Document Open Access Logo

A Constant Approximation Algorithm for Scheduling Packets on Line Networks

Authors Guy Even, Moti Medina, Adi Rosén

Thumbnail PDF


  • Filesize: 0.66 MB
  • 16 pages

Document Identifiers

Author Details

Guy Even
Moti Medina
Adi Rosén

Cite AsGet BibTex

Guy Even, Moti Medina, and Adi Rosén. A Constant Approximation Algorithm for Scheduling Packets on Line Networks. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 40:1-40:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


In this paper we improve the approximation ratio for the problem of scheduling packets on line networks with bounded buffers with the aim of maximizing the throughput. Each node in the network has a local buffer of bounded size B, and each edge (or link) can transmit a limited number c of packets in every time unit. The input to the problem consists of a set of packet requests, each defined by a source node, a destination node, and a release time. We denote by n the size of the network. A solution for this problem is a schedule that delivers (some of the) packets to their destinations without violating the capacity constraints of the network (buffers or edges). Our goal is to design an efficient algorithm that computes a schedule that maximizes the number of packets that arrive to their respective destinations. We give a randomized approximation algorithm with constant approximation ratio for the case where the buffer-size to link-capacity ratio, B/c, does not depend on the input size. This improves over the previously best result of O(log^* n) [Räcke and Rosén SPAA 2009]. Our improvement is based on a new combinatorial lemma that we prove, stating, roughly speaking, that if packets are allowed to stay put in buffers only a limited number of time steps, 2d, where d is the longest source-destination distance, then the optimal solution is decreased by only a constant factor. This claim was not previously known in the integral (unsplitable, zero-one) case, and may find additional applications for routing and scheduling algorithms. While we are not able to give the same improvement for the related problem when packets have hard deadlines, our algorithm does support "soft deadlines". That is, if packets have deadlines, we achieve a constant approximation ratio when the produced solution is allowed to miss deadlines by at most log n time units.
  • approximation algorithms
  • linear programming
  • randomized rounding
  • packet scheduling
  • admission control


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Micah Adler, Arnold L. Rosenberg, Ramesh K. Sitaraman, and Walter Unger. Scheduling time-constrained communication in linear networks. Theory Comput. Syst., 35(6):599-623, 2002. URL:
  2. William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, and Adi Rosén. Dynamic routing on networks with fixed-size buffers. In SODA, pages 771-780, 2003. URL:
  3. Stanislav Angelov, Sanjeev Khanna, and Keshav Kunal. The network as a storage device: Dynamic routing with bounded buffers. Algorithmica, 55(1):71-94, 2009. (Appeared in APPROX-05). URL:
  4. Baruch Awerbuch, Yossi Azar, and Amos Fiat. Packet routing via min-cost circuit routing. In ISTCS, pages 37-42, 1996. Google Scholar
  5. Yossi Azar and Rafi Zachut. Packet routing and information gathering in lines, rings and trees. In ESA, pages 484-495, 2005. (See also manuscript in URL:
  6. Guy Even and Moti Medina. An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines. In ICALP (2), pages 139-150, 2010. URL:
  7. Guy Even and Moti Medina. Online packet-routing in grids with bounded buffers. In Proc. 23rd Ann. ACM Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 215-224, 2011. URL:
  8. Guy Even and Moti Medina. Online packet-routing in grids with bounded buffers. CoRR, abs/1407.4498, 2014. Google Scholar
  9. Guy Even, Moti Medina, and Boaz Patt-Shamir. Better deterministic online packet routing on grids. In Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015, pages 284-293, 2015. URL:
  10. Jon M Kleinberg. Approximation algorithms for disjoint paths problems. PhD thesis, Massachusetts Institute of Technology, 1996. Google Scholar
  11. Harald Räcke and Adi Rosén. Approximation algorithms for time-constrained scheduling on line networks. In SPAA, pages 337-346, 2009. URL:
  12. Prabhakar Raghavan. Randomized rounding and discrete ham-sandwich theorems: provably good algorithms for routing and packing problems. In Report UCB/CSD 87/312. Computer Science Division, University of California Berkeley, 1986. Google Scholar
  13. Prabhakar Raghavan and Clark D Tompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365-374, 1987. Google Scholar
  14. Adi Rosén and Gabriel Scalosub. Rate vs. buffer size-greedy information gathering on the line. ACM Transactions on Algorithms, 7(3):32, 2011. URL:
  15. Neal E Young. Randomized rounding without solving the linear program. In SODA, volume 95, pages 170-178, 1995. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail