Adi Rosén
ABSTRACT
We consider packet networks with limited buffer space at the nodes, and are interested in the question of maximizing the number of packets that arrive to destination rather than being dropped due to full buffers.
We initiate a more refined analysis of the throughput competitive ratio of admission and scheduling policies in the Competitive Network Throughput model [2], taking into account not only the network size but also the buffer size and the injection rate of the traffic.
We specifically consider the problem of information gathering on the line, with limited buffer space, under adversarial traffic. We examine how the buffer size and the injection rate of the traffic affect the performance of the greedy protocol for this problem. We establish upper bounds on the competitive ratio of the greedy protocol in terms of the network size, the buffer size, and the adversary's rate, and present lower bounds which are tight up to constant factors. These results show, for example, that provisioning the network with sufficiently large buffers may substantially improve the performance of the greedy protocol in some cases, whereas for some high-rate adversaries, using larger buffers does not have any effect on the competitive ratio of the protocol.
- W. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosén. Competitive Queue Policies for Differentiated Services. Journal of Algorithms, 55(2):113--141, 2005. Google Scholar
Digital Library
- W. Aiello, R. Ostrovsky, E. Kushilevitz, and A. Rosén. Dynamic Routing on Networks with Fixed-Sized Buffers. In Proceedings of the 14th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 771--780, 2003. Google ScholarDigital Library
- S. Albers and M. Schmidt. On the Performance of Greedy Algorithms in Packet Buffering. SIAM Journal on Computing, 35(2):278--304, 2005. Google ScholarDigital Library
- N. Andelman and Y. Mansour. Competitive Management of Non-preemptive Queues with Multiple Values. In Proceedings of the 17th International Symposium on Distributed Computing (DISC), pages 166--180, 2003.Google ScholarCross Ref
- S. Angelov, S. Khanna, and K. Kunal. The Network as a Storage Device: Dynamic Routing with Bounded Buffers. In Proceedings of the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 1--13, 2005. Google ScholarDigital Library
- Y. Azar and A. Litichevskey. Maximizing Throughput in Multi-Queue Switches. Algorithmica, 45(1):69--90, 2006. Google ScholarDigital Library
- Y. Azar and Y. Richter. An Improved Algorithm for CIOQ Switches. In Proceedings of the 12th Annual European Symposium on Algorithms (ESA), pages 65--76, 2004.Google ScholarCross Ref
- Y. Azar and Y. Richter. Management of Multi-Queue Switches in QoS Networks. Algorithmica, 43(1-2):81--96, 2005.Google ScholarDigital Library
- Y. Azar and R. Zachut. Packet Routing and Information Gathering in Lines, Rings and Trees. In Proceedings of the 13th Annual European Symposium on Algorithms (ESA), pages 484--495, 2005. Google ScholarDigital Library
- L. Epstein and R. V. Stee. Buffer Management Problems. ACM SIGACT News, 35(3):58--66, September 2004.Google ScholarDigital Library
- C. Florens, M. Franceschetti, and R. J. McEliece. Lower Bounds on Data Collection Time in Sensory Networks. IEEE Journal on Selected Areas in Communications, 22(6):1110--1120, 2004. Google ScholarDigital Library
- E. Gordon and A. Rosén. Competitive Weighted Throughput Analysis of Greedy Protocols on DAGs. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 227--236, 2005. Google ScholarDigital Library
- A. Kesselman, Z. Lotker, Y. Mansour, and B. Patt-Shamir. Buffer Overflows of Merging Streams. In Proceedings of the 11th Annual European Symposium on Algorithms (ESA), pages 349--360, 2003.Google ScholarDigital Library
- A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko. Buffer Overflow Management in QoS Switches. SIAM Journal on Computing, 33(3):563--583, 2004. Google ScholarDigital Library
- A. Kesselman, Y. Mansour, and R. van Stee. Improved Competitive Guarantees for QoS Buffering. Algorithmica, 43(1-2):63--80, 2005.Google ScholarDigital Library
- A. Kesselman and A. Rosén. Scheduling policies for CIOQ switches. Journal of Algorithms, 60(1):60--83, 2006. Google ScholarDigital Library
- K. Kothapalli, M. Onus, A. Richa, and C. Scheideler. Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks. In Proceedings of the 8th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN), pages 346--351, 2005. Google ScholarDigital Library
- K. Kothapalli and C. Scheideler. Information Gathering in Adversarial Systems: Lines and Cycles. In Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 333--342, 2003. Google ScholarDigital Library
Index Terms
- Rate vs. buffer size: greedy information gathering on the line
Recommendations
Rate vs. buffer size--greedy information gathering on the line
We consider packet networks with limited buffer space at the nodes, and are interested in the question of maximizing the number of packets that arrive to destination rather than being dropped due to full buffers.
We initiate a more refined analysis of ...
Competitive weighted throughput analysis of greedy protocols on DAGs
The combination of the buffer sizes of routers deployed in the Internet, and the Internet traffic itself, leads routinely to the dropping of packets. Motivated by this, we are interested in the problem of maximizing the throughput of protocols that ...
Online Packet Scheduling for CIOQ and Buffered Crossbar Switches
SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and ArchitecturesWe consider the problem of online packet scheduling in Combined Input and Output Queued (CIOQ) and buffered crossbar switches. In the widely used CIOQ switches, packet buffers (queues) are placed at both input and output ports. An N x N CIOQ switch has ...
Comments