Satisfying arbitrary delay requirements in multihop networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 583-591

  Andrews, Matthew ^a   Zhang, Lisa ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAY REQUIREMENTS;

INTERNET TELEPHONY; NUCLEAR PROPULSION; PACKET NETWORKS; ROUTERS; SCHEDULING; TELEPHONE SYSTEMS;

COMPUTER NETWORKS;

EID: 51349128747     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.32     Document Type: Conference Paper

References (21)

1. M. Andrews, S. Khanna, and K. Kumaran. Integrated scheduling of unicast and multicast traffic in an input-queued switch. INFOCOM '99.
2. M. Andrews and L. Zhang. Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule. INFOCOM '99.
3. M. Andrews and L. Zhang. Packet routing with arbitrary end-to-end delay requirements. ACM STOC '99.
4. M. Andrews and L. Zhang. Achieving stability in networks of input-queued switches. INFOCOM '01.
5. C.S. Chang, W.J. Chen, and H.Y. Huang. On service guarantees for input buffered crossbar switches: A capacity decomposition approach by Birkhoff and von Neumann. IEEE IWQoS '99.
6. L. Georgiadis, R. Guérin, and A. Parekh. Optimal multiplexing on a single link: delay and buffer requirements. IEEE Transactions on Information Theory, 43(5):1518 - 1535, September 1997.
7. L. Georgiadis, R. Guérin, V. Peris, and K. Sivarajan. Efficient network QoS provisioning based on per node traffic shaping. INFOCOM '96.
8. M. Grossglauser and S. Keshav. On CBR service. INFOCOM '96.
9. F. T. Leighton, B. M. Maggs, and S. B. Rao. Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica, 1994.
10. E. Leonardi, M. Mellia, F. Neri, and M. Ajmone Marsan. Bounds on average delays and queue size averages and variances in input-queued cell-based switches. INFOCOM '01.
11. C. Li and E. Knightly. Coordinated network scheduling: A framework for end-to-end services. IEEE ICNP '00.
12. C. Li and E. Knightly. Schedulability criterion and performance analysis of coordinated schedulers. ITC '01.
13. J. Liebeherr, D. Wrege, and D. Ferrari. Exact admission control for networks with a bounded delay service. IEEE/ACM Transactions on Networking, 4(6), December 1996.
14. N. W. McKeown, V. Anantharam, and J. Walrand. Achieving 100% throughput in an input-queued switch. INFOCOM '96.
15. A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The multiple-node case. IEEE/ACM Transactions on Networking, 2(2), 1994.
16. D. Stiliadis. Traffic scheduling in packet-switched networks: analysis design and implementation. PhD thesis, UCSC, 1996.
17. I. Stoica, S. Shenker, and H. Zhang. Core-stateless fair queueing: Achieving approximately fair bandwidth allocations in high speed networks. ACM SIGCOMM '98.
18. I. Stoica and H. Zhang. Providing guaranteed services without per flow management. ACM SIGCOMM '99.
19. L. Tassiulas. Linear complexity algorithms for maximum througput in radio networks and input queued switches. INFOCOM '98.
20. D. Verma, H. Zhang, and D. Ferrari. Guaranteeing delay jitter bounds in packet switching networks. Tricomm '91.
21. D. Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. ACM STOC '06.