Efficient QoS routing

Computer Networks

Volumn 43, Issue 3, 2003, Pages 351-367

  Siachalou, Stavroula ^a   Georgiadis, Leonidas ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

Graph theory; Network routing; QoS routing; Simulations

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DYNAMIC PROGRAMMING; GRAPH THEORY; QUALITY OF SERVICE; ROUTERS; TELECOMMUNICATION TRAFFIC;

NETWORK ROUTING; SEVICE CONSTRAINTS;

TELECOMMUNICATION NETWORKS;

EID: 0141681235     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1389-1286(03)00286-X     Document Type: Article

References (18)

1. Ahuja R.K., Magnanti T.L., Orlin J.B. Network Flows: Theory, Algorithms, and Applications. 1993;Prentice Hall, Englewood Cliffs, NJ.
2. D. Blokh, G. Gutin, An approximation algorithm for combinatorial optimization problems with two parameters, IMADA preprint PP-1995-14, May 1995
3. S. Chen, C. Nahrstedt, On finding multi-constrained paths, in: Proceedings of IEEE ICC'98, Atlanta, GA, 1998.
4. Fredman M.L., Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM. 34:1987;596-615.
5. Garey M.R., Johnson D.S. Computer and Intractability: A Guide to the Theory of NP-Completeness. 1978;Freeman, San Francisco.
6. A. Goel, K.G. Ramakrishnan, D. Kataria, D. Logothetis, Efficient computation of delay-sensitive routes from one source to all destinations, in: Proceedings of IEEE INFOCOM'01, Anchorage, AK, April 2001.
7. Guerin R., Orda A. Computing shortest paths for any number of hops. IEEE/ACM Transactions on Networking. 10(5):2002;613-620.
8. Hassin R. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research. 17(1):1992;36-42.
9. Korkmaz T., Krunz M., Tragoudas S. An efficient algorithm for finding a path subject to two additive constraints. Computer Communications. 25(3):2002;225-238.
10. Lorenz D.H., Raz D. A simple efficient approximation scheme for the restricted shortest path problem. Operations Research Letters. 28(5):2001;213-221.
11. D.H. Lorenz, A. Orda, D. Raz, Y. Shavitt, Efficient QoS Partition and Routing of Unicast and Multicast, in: Proceedings IEEE/IFIP IWQoS, Pittsburgh, PA, June 2000.
12. Q. Ma, P. Steenkiste, Quality of service routing for traffic with performance guarantees, IWQoS'97, May 1997.
13. Mehlhorn K., Naher S. Leda: A Platform for Combinatorial and Geometric Computing. 2000;Cambridge University Press, Cambridge.
14. Q. Sun, H. Langendorfer, A new distributed routing algorithm with end-to-end delay guarantee, IWQoS'97, May 1997.
15. Wang Z., Crowford J. QoS routing for supporting resource reservation. IEEE Journal on Selected Areas in Computing. 14(7):1996;1228-1234.
16. Warburton Q. Approximation of Pareto optima in multiple objective shortest path problems. Operations Research. 35:1987;70-79.
17. The Power Law Simulator, .
18. The Real Networks, .