Matthew Andrews
- 1.M. Andrews, B. Awerbuch, A. Fern~dez, J. Kleinberg, T. Leighton, and Z. Liu. Universal stability results for greedy contention-resolution protocols. In Proceedings of the 3?th Annual Symposium on Foundations of Computer Science, pages 380 - 389, Burlington, VT, October 1996. Google Scholar
Digital Library
- 2.M. Andrews, A. Fern,~ndez, M. Harchol-Balter, T. Leighton, and L. Zhang. Dynamic packet routing with per-packet delay guarantees of O(distance + 1/session rate). In Proceedin~s of the 3$th Annual Symposium on Foundations of Computer Science, pages 294 - 302, Miami Beach, FL, October 1997. Google ScholarDigital Library
- 3.M. Andrews and L. Zhang. Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule. In Proceedings of IEEE INFOCOM '99, March 1999.Google ScholarCross Ref
- 4.A. Banerjea, D. Ferrari, B. Mall, M. Moran, D. Verma, and H. Zhang. The Tenet real-time protocol suite: Design, implementation, and experiences. IEEE/ACM Transactions on Networking, 4(1):1- 11, February 1996. Google ScholarDigital Library
- 5.A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson. Adversarial queueing theory. In Proceedings of the 28th Annual ACM Symposium on Theo~ of Computing, Philadelphia, PA, May 1996. Google ScholarDigital Library
- 6.R. L. Cruz. A calculus for network delay, Part I: Network elements in isolation. IEEE Transactions on Information Theory, pages 114- 131, 1991.Google ScholarCross Ref
- 7.R. L. Cruz. A calculus for network delay, Part lI: Network analysis. IEEE Transactions on Information Theow, pages 132- 141, 1991.Google ScholarCross Ref
- 8.A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. Journal of lnternetworking: Research and Experience, 1:3- 26, I990.Google Scholar
- 9.A. Etwalid and D. Mitra. Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes. In Proceedings of IEEE 117- FOCOM '99, March 1999.Google Scholar
- 10.A. Elwalid, D. Mitra, and R. H. Wentworth. A new approach for allocating buffers and bandwidth to heterogeneous regulated traffic in an ATM node. IEEE Journal on Selected Areas in Communications, 13(6):1115- 1127, August 1995. Google ScholarDigital Library
- 11.U. Feige and C. Scheideler. Improved bounds for acyclic job shop scheduling. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 624 - 633, Dallas, TX, May 1998. Google ScholarDigital Library
- 12.D. Ferraxi and D. Verma. A scheme for real-time channel establishment in wide-area networks. IEEE Journal on Selected Areas in Communications, 8(3):368- 379, April I990. Google ScholarDigital Library
- 13.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 I997. Google ScholarDigital Library
- 14.L. Georgiadis, R. Gu~rin, V. Peris, and K. Sivaxajan. Efficient network QoS provisioning based on per node trafiqc shaping. In Proceedings of IEEE INFOCOM '96, pages 102 - 110, I996. Google ScholarDigital Library
- 15.R. M. Kaxp, F. T. Leighton, R. L. Rivest, C. D. Thompson, U. V. Vazirani, and V. V. Vazirani. Global wire routing in two-dimensional arrays. Algorithmica, 2:113 - 129, 1987.Google Scholar
- 16.S. Keshav. An engineering approach to computer networking. Addison Wesley, Reading, MA, 1997. Google ScholarDigital Library
- 17.F. T. Leighton, B~ M. Maggs, and S. B. Rao. Packet routing and job-shop scheduling in O(congestion + dilation) steps. Combinatorica, 14(2):167- 186, 1993.Google ScholarCross Ref
- 18.F. T. Leighton, B. M. Maggs, and A. W. Richa. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Technical report CMU-CS-96-152, Carnegie Mellon University, 1996.Google Scholar
- 19.J. Liebeherr, D. Wrege, and D. Ferraxi. Exact admission control for networks with a bounded delay service. IEEE/ACM Transactions on Networking, 4(6):885 - 901, December I996. Google ScholarDigital Library
- 20.J. Lin and J. S. Vitter. e-Approximations with minimum packing constraint violation. In Proceedings of the 2.~th Annual A CM Symposium on Theory of Computing, pages 771 - 782, Victoria, B.C. Canada, May 1992. Google ScholarDigital Library
- 21.K. Nichols and S. Blake. Differentiated services operational model and definitions, 1998. Internet Draft.Google Scholar
- 22.R. Ostrovsky and Y. Rabani. Local control packet switching algorithm. In Proceedings o/the ~9th Annual A CM Symposium on Theory o/Computing, May 1997. Google ScholarDigital Library
- 23.A. K. Paxekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks' The single-node case. IEEE/A CM 2~ansactions on Networking, 1(3):344- 357, 1993. Google ScholarDigital Library
- 24.A. K. Parekh and R. G. Gallager. A generalized processor sharing approa~ to flow control in integrated services networks' The multiple-node case. IEEE/ACM Transactions on Networking, 2(2):137- 150, 1994. Google ScholarDigital Library
- 25.Y. Rabani and E. Taxdos. Distributed packet switching in arbitrary networks. In Proceedings o/the 2Sth Annual A CM Symposium on Theory of Computing, Philadelphia, PA, May 1996. Google ScholarDigital Library
- 26.P. Raghavan and C.D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365 - 374, 1991. Google ScholarDigital Library
- 27.A. Srinivasan and C. Teo. A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. In Proceedings of the ~gth Annual A CM Symposium on Theory of Computing, pages 636 -643, EI Paso, TX, May 1997. Google ScholarDigital Library
- 28.D. Verma, H. Zhasxg, and D. Ferrari. Guaranteeing delay jitter bounds in packet switching networks. In Proceedings of ffYicomm '91, Chapel Hill, NC, April 1991.Google Scholar
- 29.D. Wrege and J. Liebeherr. A near-optimal packet scheduler for QoS networks. In Proceedings of IEEE INFOCOM '97, 1997. Google ScholarDigital Library
- 30.J. Wroclawski. Differential service for the Internet. http://diffserv.lcs.mit.edu, 1998.Google Scholar
- 31.H. Zhang. Service disciplines for guaranteed performaxxce service in packet-switching networks. In Proceedings of {EEE, October 1995.Google Scholar
Index Terms
- Packet routing with arbitrary end-to-end delay requirements
Recommendations
Distributed multicast routing, with end-to-end delay and delay variation constraints
We study the problem of constructing multicast trees for high-bandwidth delay-sensitive applications in a point-to-point communication network. This problem arise in real time multimedia applications, which often requires bounded end-to-end delay along ...
Node delay assignment strategies to support end-to-end delay requirements in heterogeneous networks
In a complex, heterogeneous network environment, such as the Internet, packets traversing different networks may be subjected to different treatments and may face different traffic loads across the routing path. This paper addresses the key issue of how ...
Improving End-to-End Routing Performance of Greedy Forwarding in Sensor Networks
Greedy forwarding is a simple yet efficient technique employed by many routing protocols. It is ideal to realize point-to-point routing in wireless sensor networks because packets can be delivered by only maintaining a small set of neighbors' ...
Comments