Efficient QoS partition and routing of unicast and multicast

IEEE International Workshop on Quality of Service, IWQoS

Volumn 2000-January, Issue , 2000, Pages 75-83

  Lorenz, D H ^a   Orda, A ^a   Raz, D ^b   Shavitt, Y ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Bandwidth; Cost function; Delay; Internet; Pricing; Proposals; Quality of service; Resource management; Routing; Unicast

Indexed keywords

APPROXIMATION ALGORITHMS; BANDWIDTH; COMPLEX NETWORKS; COST FUNCTIONS; COSTS; ECONOMICS; FORESTRY; INTERNET; MOBILE TELECOMMUNICATION SYSTEMS; MULTICASTING; NETWORK ROUTING; RESOURCE ALLOCATION; TREES (MATHEMATICS);

DELAY; PROPOSALS; RESOURCE MANAGEMENT; ROUTING; UNICAST;

QUALITY OF SERVICE;

EID: 84949939774     PISSN: 1548615X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWQOS.2000.847940     Document Type: Conference Paper

References (16)

1. G. Apostolopoulos, R. Guérin, S. Kamat, A. Orda, T. Przygienda, and D. Williams. QoS routing mechanisms and OSPF extensions. Internet RFC, August 1999.
2. E. Crawley, R. Nair, B. Rajagopalan, and H. Sandick. A framework for QoS-based routing in the internet - RFC no. 2386. Internet RFC, August 1998.
3. F. Ergün, R. Sinha, and L. Zhang. QoS routing with performance-dependent costs. In Proceedings of the IEEE INFOCOM 2000, Tel-Aviv, Israel, March 2000.
4. V. Firoiu and D. Towsley. Call admission and resource reservation for multicast sessions. In Proceedings of the IEEE INFOCOM'96, San Francisco, CA, April 1996.
5. G. N. Frederickson and D. B. Johnson. The complexity of selection and ranking in X + Y and matrices with sorted columns. Journal of Computer and System Sciences, 24:197-208, 1982.
6. R. Guérin and A. Orda. QoS-based routing in networks with inaccurate information: Theory and algorithms. IEEE/ACM Transactions on Networking, 7(3), June 1999.
7. R. Hassin. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 17(1):36-42, February 1992.
8. D. S. Hochbaum. Lower and upper bounds for the alloction problem and other nonlinear optimization problems. Mathematics of Operations Research, 19(2):390-409, 1994.
9. T. Ibaraki and N. Katoh. Resource Allocation Problems. the foundations of computing. MIT Press, Cambridge, MA, 1988.
10. M. Kodialam and S. Low. Resource allocation in a multicast tree. In Proceedings of the IEEE INFOCOM'99, pages 262-266, New York, NY, March 1999.
11. V. P. Kompella, J. C. Pasquale, and G. C. Polyzos. Multicast routing for multimedia communication. IEEE/ACM Transactions on Networking, 1:286-292, 1993.
12. D. H. Lorenz and A. Orda. QoS routing in networks with uncertain parameters. IEEE/ACM Transactions on Networking, 6(6):768-778, December 1998.
13. D. H. Lorenz and A. Orda. Optimal partition of QoS requirements on unicast paths and multicast trees. In Proceedings of the IEEE INFOCOM'99, pages 246-253, New York, NY, March 1999.
14. R. Nagarajan, J.F. Kurose, and D. Towsley. Allocation of local quality of service constraints to meet end-to-end requirements. In IFIP Workshop on the Performance Analysis of ATM Systems, Martinique, January 1993.
15. D. Raz and Y. Shavitt. Optimal partition of QoS requirements with discrete cost functions. In Proceedings of the IEEE INFOCOM 2000, Tel-Aviv, Israel, March 2000.
16. Z. Wang and J. Crowcroft. Quality-of-service routing for supporting multimedia applications. IEEE JSAC, 14(7):1288-1234, September 1996.