Skip to main content
Springer Nature Link
Log in

Packet Switching in Single Buffer

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 164 Accesses

Years and Authors of Summarized Original Work

  • 2003; Bansal, Fleischer, Kimbrel, Mahdian, Schieber, Sviridenko

Problem Definition

In this entry, consider a quality-of-service (QoS) buffering system that is able to hold B packets. Time is slotted. At the beginning of a time step, a set of packets (possibly empty) arrives, and at the end of the time step, a single packet may leave the buffer to be transmitted. Since the buffer has a bounded size, at some point packets may need to be dropped. The buffer management algorithm has to decide at each step which of the packets to drop and which packets to transmit, subject to the buffer capacity constraint. The value of a packet p is denoted by v(p). The system obtains the value of the packets it sends and gains no value otherwise. The aim of the buffer management algorithm is to maximize the total value of transmitted packets.

Packet Switching in Single Buffer, Fig. 1
figure 161 figure 161

The natural greedy algorithm

Full size image

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Aiello W, Mansour Y, Rajagopolan S, Rosen A (2000) Competitive queue policies for differentiated services. In: Proceedings of the IEEE INFOCOM, Tel-Aviv. IEEE, pp 431–440

    Google Scholar 

  2. Andelman N, Mansour Y, Zhu A (2003) Competitive queueing policies in QoS switches. In: Proceedings of the 14th symposium on discrete algorithms (SODA), Baltimore. ACM/SIAM, San Francisco, pp 761–770

    Google Scholar 

  3. Bansal N, Fleischer L, Kimbrel T, Mahdian M, Schieber B, Sviridenko M (2004) Further improvements in competitive guarantees for QoS buffering. In: Proceedings of the 31st international colloquium on automata, languages, and programming (ICALP), Turku. Lecture notes in computer science, vol 3142. Springer, Berlin, pp 196–207

    Google Scholar 

  4. Englert M, Westermann M (2006) Lower and upper bounds on FIFO buffer management in qos switches. In: Azar Y, Erlebach T (eds) Proceedings of the 14th annual European symposium on algorithms – ESA 2006, Zurich. Lecture notes in computer science, vol 4168. Springer, Berlin, pp 352–363

    Chapter  Google Scholar 

  5. Epstein L, van Stee R (2004) Buffer management problems. SIGACT News 35(3):58–66

    Article  Google Scholar 

  6. Jawor W (2005) Three dozen papers on online algorithms. SIGACT News 36(1):71–85

    Article  Google Scholar 

  7. Kesselman A, Mansour Y, van Stee R (2003) Improved competitive guarantees for QoS buffering. In: Di Battista G, Zwick U (eds) Proceedings of the eleventh annual European symposium on algorithms – ESA 2003, Budapest. Lecture notes in computer science, vol 2380. Springer, Berlin, pp 361–373

    Chapter  Google Scholar 

  8. Kesselman A, Lotker Z, Mansour Y, Patt-Shamir B, Schieber B, Sviridenko M (2004) Buffer overflow management in QoS switches. SIAM J Comput 33(3):563–583

    Article  MathSciNet  MATH  Google Scholar 

  9. Kimbrel T (2004) A simple proof of the 2-competitiveness of the greedy FIFO buffering algorithm. Technical report RC23272, IBM Research

    Google Scholar 

  10. Lotker Z, Patt-Shamir B (2002) Nearly optimal FIFO buffer management for DiffServ. In: Proceedings of the 21st ACM symposium on principles of distributed computing (PODC 2002), Monterey. ACM, New York, pp 134–142

    Google Scholar 

  11. Mansour Y, Patt-Shamir B, Lapid O (2000) Optimal smoothing schedules for real-time streams. In: Proceedings of the 19th symposium on principles of distributed computing (PODC), Portland. ACM, New York, pp 21–29

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Leicester, Leicester, UK

    Rob van Stee

Authors
  1. Rob van Stee
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rob van Stee .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Stee, R. (2016). Packet Switching in Single Buffer. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_275

Download citation

Publish with us

Policies and ethics