| ²é¿´: 493 | »Ø¸´: 1 | |||
| ±¾Ìû²úÉú 1 ¸ö ·ÒëEPI £¬µã»÷ÕâÀï½øÐв鿴 | |||
duhaifengľ³æ (ÖøÃûдÊÖ)
|
[½»Á÷]
°ïæÈóɫһÏ£¬¿´ÊÇ·ñÓдíÎó£¬Ð»Ð»
|
||
| Differentiated Services (DiffServ) networks have been studied for several years. Conventional Active Queue Management (AQM) algorithm can¡¯t provide differentiated bandwidth allocation with low-cost complexity in DiffServ. In this paper, we present an AQM scheme called CHOKeR, named after previous work CHOKe that is effective to protect TCP flows. A method is borrowed from CHOKeW that draw multi-packets at random from the buffer, compares them with the arriving packet, and drops a pair packets including the arriving packet and the compared packet if they are from the same flow, can be used as signals to inform TCP of the congestion status. But CHOKeR enhances the drawing function by using a MISD mechanism. To provide the proportional bandwidth allocation, CHOKeR may drop a packet with the same priority as the arrived packet if ratio of the packets with the priority in the queue beyond the predefined value. The number of parameters that CHOKeR needs to maintain is determined by the number of priority levels being supported by the network, which usually has a small limited value. In order to explain the features of CHOKeR, an analytical model is used, followed by running a series of simulations to evaluate the performance. |
» ²ÂÄãϲ»¶
²ÄÁÏÓ뻯¹¤304ÇóBÇøµ÷¼Á
ÒѾÓÐ7È˻ظ´
0703»¯Ñ§336·ÖÇóµ÷¼Á
ÒѾÓÐ4È˻ظ´
[¸´ÊÔµ÷¼Á]Î÷ÄϿƼ¼´óѧ¹ú·À/²ÄÁϵ¼Ê¦ÍƼö
ÒѾÓÐ6È˻ظ´
»¯Ñ§¹¤³Ì321·ÖÇóµ÷¼Á
ÒѾÓÐ12È˻ظ´
211±¾£¬11408Ò»Ö¾Ô¸ÖпÆÔº277·Ö£¬ÔøÔÚÖпÆÔº×Ô¶¯»¯Ëùʵϰ
ÒѾÓÐ4È˻ظ´
²ÄÁÏר˶326Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
¶«ÄÏ´óѧ364Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
¹ú×Ô¿ÆÃæÉÏ»ù½ð×ÖÌå
ÒѾÓÐ7È˻ظ´
ҩѧ383 Çóµ÷¼Á
ÒѾÓÐ4È˻ظ´
286Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
duhaifeng(½ð±Ò+50, ·ÒëEPI+1):лл£¬¶ÁÆðÀ´Ë³¶àÁË£¬ÎÒдµÄÌ«ÉúÓ²ÁË¡£ 2010-04-28 22:09
|
ALTHOUGH Differentiated Services (DiffServ) networks have been WELL DISCUSSED IN THE PAST several years, Conventional Active Queue Management (AQM) algorithm STILL can¡¯t provide differentiated bandwidth allocation with low-cost complexity in DiffServ. In THE CURRENT paper, an AQM scheme called CHOKeR WAS PRESENTED, WHICH WAS named after previous work CHOKe to protect TCP flows EFFECTIVELY. A method WAS DERIVED from CHOKeW TO draw multi-packets RANDOMLY from the buffer, compare with the arriving packet, and drop a pair packets including the arriving and the compared ONES from the same flow to inform TCP the congestion status. CHOKeR enhanceD the drawing function by a MISD mechanism. To provide the proportional bandwidth allocation, AT THE TIME THE ratio of the packets with the priority in the queue beyond the predefined value, CHOKeR COULD GENERATE AN ARRIVED packet with the same priority. The number of parameters that CHOKeR needs to maintain WAS determined by the number of priority levels being supported by the network WITH a small limited value. In order to explain the features of CHOKeR AND TO EVALUATE ITS PERFORMANCE, an analytical model WAS EMPLOYED FOR simulations. ÇëÂ¥Ö÷¸ù¾Ýרҵ֪ʶÔÙÕå×ᣠ|
2Â¥2010-04-28 17:26:06













»Ø¸´´ËÂ¥