Competitive on-line switching policies

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 525-534

  Bar Noy, Amotz ^a   Freiind, Ari ^b   Landa, Shimon ^b   Naor, Joseph ^b  

^a ATandT Labs Research   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

MODEMS; QUEUEING THEORY; TRAFFIC CONTROL;

CABLE MODEM SYSTEMS; COMPETITIVE ANALYSIS; LINE SWITCHING; ON-LINE SETTING; OUTPUT CHANNELS; SCENARIO MODELS; SERVICE POLICY; SERVICE RATES;

SWITCHING;

EID: 84968735836     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. G. Armitage. Quality of service in IP networks. Pearson Higher Education, 2000.
2. D. Askoy and M. Franklin. Scheduling for large scale on-demand data broadcasting, In Proc.of Infocom, pp. 651-659, 1998.
3. Y. Azar, J. Naor and R. Rom. The competitiveness of on-line assignments. In Journal of Algorithms, Vol. 18, pp. 221-237, 1995.
4. Y. Azar. On-line load balancing. In On-line Algorithms: The State of the Art, Editors A. Fiat and G. Woeginger, LNCS 1442, Springer, pp. 178-195, 1998.
5. A. Birman, P. C. Chang, J. S. C. Chen, R. Guerin. Buffer Sizing in an ISDN Frame Relay Switch. IBM Research Report, RC14386, 1989.
6. A. Birman, H. R. Gail, S. L. Hantier, Z. Rösberg, and M. Sidi, An Optimal Service Policy for Buffer Systems. In Journal of the Association Computing Machinery (JACM), Vol. 42, No. 3, pp. 641-657, 1995.
7. CableLabs. Data-over-Cable Service Interface Specifications. Radio Frequency Specifications, SP-RFIv1.1-101-990311." (1999).
8. I. Cidon, I. Gopal, G. Grover, and M. Sidi. Real-Time Packet Switching: A Performance Analysis. In IEEE Journal on Selected Areas In Communication, Vol 6, pp. 1576-1586, 1988.
9. H. R. Gail, G. Grover, R. Guerin, S. L Hantier, Z. Rösberg, and M. Sidi. Buffer Size Requirements under Longest Queue First. In Performance Evaluation, Vol. 18, No. 2, pp. 133-140, 1993.
10. A. G Greenberg and N. Madras. How Fair is Fair Queuing? In Journal of the Association Computing Machinery (JACM), Vol. 39, No. 3, pp. 568-598, 1992.
11. A.Kessekman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko. Competitive buffer overflow management in QoS switches. In Proceedings of 33rd Annual Symposium on Theory of Computing, 2001.
12. A. K. Parekh and R. G. Gallager. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case. In IEEE/ACM Transactions On Networking, Vol 1, No 3, pp. 344-357, 1993.
13. G. Sasaki. Input Buffer Requirements for Round Robin Polling Systems. In Proceedings of 27th Annual Conference on Communication, Control and Computing, pp. 397-406, 1989.