Journal of information and communication convergence engineering

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Buffer Management Algorithms in Unbounded Buffers

  • Kim, Jae-Hoon (Division of Computer Engineering, Pusan University of Foreign Studies)
  • Received : 2010.10.08
  • Accepted : 2010.11.10
  • Published : 2010.12.31
Download PDF
⟨ Previous Next ⟩

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 packet 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.

Keywords

References

  1. Rudolf Fleischer and Hisashi Koga, "Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness", Algorithmica, vol. 38(2), pp. 363-376, 2003.
  2. Yossi Azar, "Online packet switching", Proc. Second Workshop on Approximation and Online Algorithms, pp. 1-5, 2004.
  3. Leah Epstein and Rob van Stee, "Buffer management problems", SIGACT news, vol. 35(3), pp. 58-66, 2004. https://doi.org/10.1145/1027914.1027930
  4. Wojciech Jawor, "Three dozen papers on online algorithms", SIGACT news, vol. 36(1), pp. 71-85, 2005. https://doi.org/10.1145/1052796.1052808
  5. Marek Chrobak, "Online algorithms column 13", SIGACT news, vol. 39(3), pp. 96-121, 2008. https://doi.org/10.1145/1412700.1412719
  6. William A. Aiello, Yishay Mansour, S. Rajagopolan, and Adi Rosen, "Competitive queue policies for differentiated services", Journal of Algorithms, vol. 55(2), pp. 113-141, 2005. https://doi.org/10.1016/j.jalgor.2004.04.004
  7. An Zhu, "Analysis of queuing policies in QoS switches", Journal of Algorithms, vol. 53(2), pp. 137-168, 2004. https://doi.org/10.1016/j.jalgor.2004.04.007
  8. Yishay Mansour, Boaz Patt-Shamir, and Ofer Lapid, "Optimal smoothing schedules for real-time streams", Distributed Computing, vol. 17(1), pp. 77-89, 2004. https://doi.org/10.1007/s00446-003-0101-0
  9. Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt- Shamir, Baruch Schieber, and Maxim Sviridenko, "Buffer overflow management in QoS switches", SIAM Journal on Computing, vol. 33(3), pp. 563-583, 2004. https://doi.org/10.1137/S0097539701399666
  10. Yossi Azar and Yossi Ritcher, "Management of multi-queue switches in QoS networks", Proc.35th ACM Symp. on Theory of Computing, pp. 82-89, 2003.
  11. Alex Kesselman and Adi Rosen, "Scheduling policies for CIOQ switches", Journal of Algorithms, vol. 60(1), pp. 60-83, 2006. https://doi.org/10.1016/j.jalgor.2004.09.003