• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

Ȩ Ȩ > ¿¬±¸¹®Çå >

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) Å¥ÀÇ º¯È­·®¿¡ ÀÇÇÑ ¿¹Ãø±â¹Ý RED ¾Ë°í¸®Áò
¿µ¹®Á¦¸ñ(English Title) Prediction Based RED Algorithm on the Variation of Queue Length
ÀúÀÚ(Author) ±è´ë¿µ   ±èµ¿Ãá   ¾È±âÁß   Dae-Young Kim   Dong-Choon Kim   Khi-Jung Ahn  
¿ø¹®¼ö·Ïó(Citation) VOL 12 NO. 01 PP. 3D ~ 0002 (2002. 04)
Çѱ۳»¿ë
(Korean Abstract)
ÀÎÅͳݸÁ¿¡¼­´Â È¥Àâ Æ®·¡ÇÈ °ü¸®´Â ÆÐŶÀ» Æó±âÇÔÀ¸·Î¼­ ¸ÁÀÇ È¥Àâ ¿øÀÎÀ» ÁÙÀÌ´Â Á¤Ã¥À¸·Î È¥ÇÕ È¸ÇÇ(Congestion Avoidance)¿Í Slow-Start ¹æ¹ýÀÌ Á¸ÀçÇÑ´Ù. ÀÌ ¹æ¹ýÀº ¶ó¿ìÅÍ¿¡¼­ ¶ó¿ìÅÍ ¹öÆÛ°¡ Â÷±â Àü¿¡ ÆÐŶÀ» ÀϺΠÆó±âÇÔÀ¸·Î¼­ È¥ÀâÀ» Á¦°ÅÇÏ°í ¸Á ¼º´ÉÀ» Çâ»ó½ÃŲ´Ù. º» ³í¹®¿¡¼­´Â TCP/IP¸Á¿¡¼­ QoS ÀúÇÏ ¹× ´ë¿ªÆøÀ» ³¶ºñ¸¦ ÃÊ·¡Çϴ ȥÀâ Æ®·¡ÇÈ¿¡ ´ëÇØ A Æò±Õ Å¥ ±æÀÌ°¡ ºü¸£°Ô º¯È­Çϸ鼭 ¸ÁÀÇ ¼º´É Çâ»óÀ» ½ÃÅ°´Â ¿¹Ãø ±â¹Ý RED ¾Ë°í¸®ÁòÀ» Á¦¾ÈÇÑ´Ù. Á¦¾È ¾Ë°í¸®ÁòÀº ´ÙÀ½¿¡´Â Æ®·¡ÇÈ Á¤º¸¸¦ ÀÌ¿ëÇÏ¿© Æò±Õ Å¥ ±æÀ̸¦ ¿¹ÃøÇÏ°í, Å¥ÀÇ threshold¿Í Æó±â È®·ü¿¡ Àû¿ëµÇ´Â ÆĶó¸ÞÅÍ¿¡ ¿¹Ãø °¡ÁßÄ¡¸¦ Àû¿ëÇÔÀ¸·Î¼­ È¥Àâ Æ®·¡ÇÈ °ü¸®¸¦ È¿À²ÀûÀ¸·Î ó¸®ÇÒ ¼ö ÀÖ´Â ¿¹Ãø±â¹Ý RED¾Ë°í¸®Áò ÇÑ´Ù. ½Ã¹Ä·¹ÀÌ¼Ç °á°ú 󸮷® ¹× ÆÐŶ ¼Õ½ÇÀ²¿¡¼­ °³¼±µÈ °ÍÀ» º¸¿©ÁÖ°í ÀÖ´Ù.
¿µ¹®³»¿ë
(English Abstract)
In internet, the management of traffic congestion involves the policy which drops a packet in Congestion avoidance and Slow Start. In this case, router drops one or more packet to improve the network performance before when its output buffer becomes full. RED(Random Early Detection) is a good example for this technique. In this paper, a congestion avoidance algorithm is proposed enhanced the performance and accommodate a rapidly changing traffic variation which can cause the congestion. waste of bandwidth and QoS degradation in TCP/IP networks. Proposed Algorithm is proposed to estimate the queue length variation and applied to the packet drop probability to control the trffic congestion. And the simulation result showed me it can improve the translation and packet loss rate.
Å°¿öµå(Keyword)   
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå