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

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > JICCE (Çѱ¹Á¤º¸Åë½ÅÇÐȸ)

JICCE (Çѱ¹Á¤º¸Åë½ÅÇÐȸ)

Current Result Document : 6 / 8 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) Buffer Management Algorithms in Unbounded Buffers
¿µ¹®Á¦¸ñ(English Title) Buffer Management Algorithms in Unbounded Buffers
ÀúÀÚ(Author) Jae-Hoon Kim  
¿ø¹®¼ö·Ïó(Citation) VOL 08 NO. 06 PP. 0721 ~ 0724 (2010. 12)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
In a network router, packet loss may occur when it overflows due to sudden burst traffic. This paper studies how much large buffers are required to eliminate the packet losses. There are buffers on which packets arrive and one output port to which a packet is transmitted at a time. The buffer management algorithm should determine one of the buffers whose packet is transmitted to the output port at each time. The front packet belonging to the buffer determined by the algorithm is transmitted. The goal is to minimize the sum of the lengths of buffers to transmit all the packets.
We provide an optimal off-line algorithm and also we show the lower bounds of on-line algorithms. The on-line algorithm has no prior information of the packets having arrived in the future. Its performance is compared to that of the optimal off-line algorithm.
Å°¿öµå(Keyword) Buffer management   off-line algorithms   on-line algorithms   lower bound  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå