Envelope theorem - Revision history

160.39.243.44: /* Applications to Producer Theory */

2014-10-22T15:06:22Z

Applications to Producer Theory

en>Jamesmcmahon0: Typo fixing, typo(s) fixed: , → , using AWB

2014-02-14T10:41:57Z

Typo fixing, typo(s) fixed: , → , using AWB

← Older revision		Revision as of 12:41, 14 February 2014
Line 1:		Line 1:
	~~'''Weighted random early detection''' (WRED) is a queueing discipline for a [[network scheduler]] suited for~~ [~~[Network congestion avoidance\|congestion avoidance]].<ref>{{cite web \|url=~~http://~~www.cisco~~.~~com/en/US~~/~~docs/ios/12_2/qos/configuration/guide/qcfconav_ps1835_TSD_Products_Configuration_Guide_Chapter~~.~~html \|title~~=~~Congestion Avoidance Overview \|publisher~~=~~Cisco \|accessdate=2012-05-10}}</ref> It is an extension to [[random early detection~~]~~] (RED) where a single queue may have several different queue thresholds. Each queue threshold~~ is ~~associated to a particular [[Traffic_shaping#Traffic_classification\|traffic class]]~~.		The name of the [http://cpacs.org/index.php?document_srl=90091&mid=board_zTGg26 telephone psychic] writer is Jayson. My spouse and I reside in Mississippi and I adore each day residing here. Office supervising is exactly where her primary earnings arrives from but she's already utilized [http://www.herandkingscounty.com/content/information-and-facts-you-must-know-about-hobbies authentic psychic readings] for another 1. It's not a typical thing but what I like doing is to climb but I don't have the time recently.<br><br>Visit my web-site :: love psychic readings ([http://www.january-yjm.com/xe/index.php?mid=video&document_srl=158289 click the following internet site])

	For example, a queue may have lower thresholds for lower priority packet. A queue buildup will cause the lower priority packets to be dropped, hence protecting the higher priority [[network packet\|packets]] in ~~the same queue~~. ~~In this way [[quality of service]] prioritization~~ is ~~made possible for important packets~~ from ~~a pool of packets using the same buffer.<ref>{{cite web \|url=~~http://www.~~cisco~~.com/en/~~US/docs/ios/11_2/feature/guide/wred_gs.html \|title=Weighted Random Early Detection (WRED) \|publisher=Cisco \|accessdate=2011~~-05-~~27}}</ref>~~

	~~It is more likely that standard traffic will be dropped instead of higher prioritized traffic.~~

	~~== Restrictions ==~~
	~~On Cisco switches WRED is restricted to~~
	* TCP/IP traffic. Only this kind of traffic indicates congestion to the sender to enable a reduction of the transmission rate.
	~~Non~~-~~IP traffic will be dropped more often than TCP/IP traffic because it is treated with the lowest possible precedence~~.

	~~== Functional Description ==~~
	~~WRED proceeds in this order when~~ a ~~packet arrives:~~
	* Calculation of the average queue size.
	* The arriving packet is ~~queued only if the average queue size is below~~ the ~~minimum queue threshold~~.
	* Depending on the packet drop probability the packet is either dropped or queued if the average queue size is between the minimum and maximum queue threshold.
	* The packet is automatically dropped if the average queue size is greater than the maximum threshold.

	~~=== Calculation of average queue size ===~~
	~~The average queue size depends on the previous average as well as the current size of the queue. The calculation formula is given below:~~

	<~~math~~> ~~avg= o(1~~-2^{-n}) + c(~~2^{-n})\,\!<~~/~~math>~~

	~~where <math>n<~~/~~math> is the user~~-~~configurable exponential weight factor, <math>o</math> is the old average and <math>c<~~/~~math> is the current queue length. The previous average will be more important for high values of <math>n<~~/~~math>~~. ~~Peaks and Lows in queue length will be smoothed by a high value. Low values of n allows the average queue size to stay close to the current queue size.~~

	==~~References==~~
	~~{{Reflist}}~~

	~~[[Category:Network performance]]~~


	~~{{Compu-network-stub}}~~

	~~[[da:Undgåelse af datanet-trafikforstoppelse#RED og WRED]~~]

en>A. Pichler: /* See also */

2013-12-14T15:22:20Z

See also

← Older revision		Revision as of 17:22, 14 December 2013
Line 1:		Line 1:
	Ed is ~~what people call me and my wife doesn't like it at all~~. ~~What me and my family love~~ is ~~doing ballet but I've been taking on new things recently~~. ~~Her family lives~~ in ~~Ohio but her spouse wants them to move~~. ~~Credit authorising~~ is ~~how he makes cash~~.<br>~~<br>my page: good psychic ([~~http://~~help~~.~~ksu~~.~~edu~~.sa/~~node~~/~~65129 look at~~ this ~~site~~])		'''Weighted random early detection''' (WRED) is a queueing discipline for a [[network scheduler]] suited for [[Network congestion avoidance\|congestion avoidance]].<ref>{{cite web \|url=http://www.cisco.com/en/US/docs/ios/12_2/qos/configuration/guide/qcfconav_ps1835_TSD_Products_Configuration_Guide_Chapter.html \|title=Congestion Avoidance Overview \|publisher=Cisco \|accessdate=2012-05-10}}</ref> It is an extension to [[random early detection]] (RED) where a single queue may have several different queue thresholds. Each queue threshold is associated to a particular [[Traffic_shaping#Traffic_classification\|traffic class]].

			For example, a queue may have lower thresholds for lower priority packet. A queue buildup will cause the lower priority packets to be dropped, hence protecting the higher priority [[network packet\|packets]] in the same queue. In this way [[quality of service]] prioritization is made possible for important packets from a pool of packets using the same buffer.<ref>{{cite web \|url=http://www.cisco.com/en/US/docs/ios/11_2/feature/guide/wred_gs.html \|title=Weighted Random Early Detection (WRED) \|publisher=Cisco \|accessdate=2011-05-27}}</ref>

			It is more likely that standard traffic will be dropped instead of higher prioritized traffic.

			== Restrictions ==
			On Cisco switches WRED is restricted to
			* TCP/IP traffic. Only this kind of traffic indicates congestion to the sender to enable a reduction of the transmission rate.
			Non-IP traffic will be dropped more often than TCP/IP traffic because it is treated with the lowest possible precedence.

			== Functional Description ==
			WRED proceeds in this order when a packet arrives:
			* Calculation of the average queue size.
			* The arriving packet is queued only if the average queue size is below the minimum queue threshold.
			* Depending on the packet drop probability the packet is either dropped or queued if the average queue size is between the minimum and maximum queue threshold.
			* The packet is automatically dropped if the average queue size is greater than the maximum threshold.

			=== Calculation of average queue size ===
			The average queue size depends on the previous average as well as the current size of the queue. The calculation formula is given below:

			<math> avg= o(1-2^{-n}) + c(2^{-n})\,\!</math>

			where <math>n</math> is the user-configurable exponential weight factor, <math>o</math> is the old average and <math>c</math> is the current queue length. The previous average will be more important for high values of <math>n</math>. Peaks and Lows in queue length will be smoothed by a high value. Low values of n allows the average queue size to stay close to the current queue size.

			==References==
			{{Reflist}}

			[[Category:Network performance]]


			{{Compu-network-stub}}

			[[da:Undgåelse af datanet-trafikforstoppelse#RED og WRED]]

68.40.197.18: /* Envelope theorem */

2012-05-20T22:16:10Z

Envelope theorem

New page

Ed is what people call me and my wife doesn't like it at all. What me and my family love is doing ballet but I've been taking on new things recently. Her family lives in Ohio but her spouse wants them to move. Credit authorising is how he makes cash.<br><br>my page: good psychic ([http://help.ksu.edu.sa/node/65129 look at this site])