Performance evaluation of constraint-based path selection algorithms

IEEE Network

Volumn 18, Issue 5, 2004, Pages 16-23

  Kuipers, Fernando ^a   Korkmaz, Turgay ^b   Krunz, Marwan ^c   Van Mieghem, Piet ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

^c UNIVERSITY OF ARIZONA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; QUALITY OF SERVICE; TELECOMMUNICATION SERVICES; TOPOLOGY;

CONSTRAINT BASED PATH SELECTION ALGORITHMS; INTERNET SERVICE PROVIDERS; MULTICONSTRAINED PATH ALGORITHMS; OPTIMIZED NETWORK UTILIZATION;

INTERNET;

EID: 6444236350     PISSN: 08908044     EISSN: None     Source Type: Journal    
DOI: 10.1109/MNET.2004.1337731     Document Type: Article

References (19)

1. Z. Wang, Internet QoS: Architectures and Mechanisms for Quality of Service, Morgan Kaufman Publishers, 2001.
2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
3. F. A. Kuipers and P. Van Mieghem, "The Impact of Correlated Link Weights on QoS Routing," Proc. IEEE INFOCOM Conf., vol. 2, Apr. 2003, pp. 1425-34.
4. F. A. Kuipers et al., "An Overview of Constraint-Based Path Selection Algorithms for QoS Routing," IEEE Commun. Mag., vol. 40, no. 12, Dec. 2002, pp. 50-5.
5. R. Widyono, "The Design and Evaluation of Routing Algorithms for Real-Time Channels,".Technical Report TR-94-024, University of California at Berkeley & International Computer Science Institute, June 1994.
6. R. Hassin, "Approximation Schemes for the Restricted Shortest Path Problem," Mathematics of Operations Research, vol. 17, no. 1, Feb. 1992, pp. 36-42.
7. D. S. Reeves and H. F. Salama, "A Distributed Algorithm for Delay-Constrained Unicast Routing," IEEE/ACM Trans. Net., vol. 8, no. 2, Apr. 2000, pp. 239-50.
8. A. Juttner et al., "Lagrange Relaxation-Based Method for the QoS Routing Problem," Proc. IEEE INFOCOM Conf., vol. 2, April 2001, pp. 859-68.
9. L. Guo and I. Matta, "Search Space Reduction in QoS Routing," Proc. 19th IEEE Int'l. Conf. Distributed Computing Systems, May 1999, pp. 142-49.
10. P. Van Mieghem et al., Eds., "Quality of Service Routing," Ch. 3 in Quality of Future Internet Services, EU-COST 263 Final Report, Ed. by Smirnov et al. in Springer LNCS 2856, 2003, pp. 80-117.
11. J. M. Jaffe, "Algorithms for Finding Paths with Multiple Constraints," Networks, vol. 14, 1984, pp. 95-116.
12. A. Iwata et al., "ATM Routing Algorithms with Mutiple QoS Requirements for Multimedia Internetworking," IEICE Trans. and Cammun., vol. E79-B, no. 8, 1996, pp. 999-1006.
13. H. De Neve and P. Van Mieghem, "TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm," Computer Communications, vol. 23, 2000, pp. 667-79.
14. P. Van Mieghem and F. A. Kuipers, "Concepts of Exact Quality of Service Algorithms," to appear in IEEE/ACM Trans. Net., 2004.
15. S. Chen and K. Nahrstedt, "On Finding Multi-Constrained Paths," Proc. ICC'98 Conf., New York, 1998, pp. 874-9.
16. T. Korkmaz and M. Krunz, "A Randomized Algorithm for Finding a Path Subject to Multiple QoS Requirements," Computer Networks, vol. 36, 2001, pp. 251-68.
17. T. Korkmaz and M. Krunz, "Routing Multimedia Traffic with QoS Guarantees," IEEE Trans. Multimedia, vol. 5, no. 3, Sept. 2003, pp. 429-43.
18. X. Yuan, "Heuristic Algorithms for Multiconstrained Quality-of-Service Routing," IEEE/ACM Trans. Net., vol. 10, no. 2, April 2002, pp. 244-56.
19. G. Liu and K. G. Ramakrishnan, "A*Prune: An Algorithm for Finding k-shortest Paths Subject to Multiple Constraints," Proc. IEEE INFOCOM Conf., vol. 2, April 2001, pp. 743-9.