TAMCRA: A tunable accuracy multiple constraints routing algorithm

Computer Communications

Volumn 23, Issue 7, 2000, Pages 667-679

  De Neve, H ^a   Van Mieghem, P ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA COMMUNICATION SYSTEMS; PROBABILITY DISTRIBUTIONS; VALUE ENGINEERING;

MULTIPLE CONSTRAINTS ROUTING ALGORITHMS; QUALITY OF SERVICE (QOS);

INTERNET;

EID: 0033908221     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(99)00225-X     Document Type: Article

References (23)

1. Ferguson P., Huston G. Quality of Service, Delivering QoS on the Internet and in Corporate Networks. 1998;Wiley, New York.
2. A. Orda, Routing with end to end QoS guarantees in broadband networks, IEEE INFOCOM'98.
3. Van Mieghem P. Topology information condensation in hierarchical networks. Comput. Net. ISDN Syst. 31:(12):1998;1999.
4. Van Mieghem, P., Routing in a hierarchical structure, in: Proceedings of First IEEE International Conference on ATM (ICATM'98), 22-24 June, Colmar, France, pp. 378-384.
5. Garey M.R., Johnson D.S. Computers and Intractability, A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
6. Jaffe J.M. Algorithms for finding paths with multiple constraints. Networks. 14:1984;95-116.
7. Henig M.I. The shortest path problem with two objective functions. Eur. J. Oper. Res. 25:1985;281-291.
8. Iwata A., Izmailov R., Lee D.-S., Sengupta B., Ramamurthy G., Suzuki H. ATM routing algorithms with multiple QOS requirements for multimedia internetworking. IEICE Trans. Commun. E79-B:(8):1996;999-1007.
9. Lee W., Hluchyj M., Humblet P. Rule-based call-by-call source routing for integrated communication networks. IEEE INFOCOM'93. 1993;987-993.
10. Wang Z., Crowcroft J. Quality-of-service routing for supporting multimedia applications. IEEE J. Selected Areas Commun. 14:1996;1228-1234.
11. Vogel R., Herrtwich R., Kalfa W., Wittig H., Wolf L. QoS-based routing of multimedia streams in computer networks. IEEE J. Selected Areas Commun. 14:(7):1996;1235-1244.
12. Chong E.I., Maddila S., Morley S. On finding single-source single-destination k shortest paths. J. Comput. Inform. 1995;40-47. (special issue ICCI'95).
13. Golub G.H., Van Loan C.F. Matrix Computations. 1st ed. 1983;North Oxford Academic, Oxford.
14. Royden H.L. Real Analysis. 3rd ed. 1988;Macmillan, New York.
15. Cormen T.H., Leiserson C.E., Rivest R.L. Algorithms. 1991;MIT Press, Cambridge, MA.
16. Bollobas B. Random Graphs. 1985;Wiley, New York.
17. Calvert K., Doar M., Zegura E. Modelling internet topology. IEEE Comm. Mag. 1997;160-163.
18. H. De Neve, P. Van Mieghem, A multiple quality of service routing algorithm for PNNI, in: Proceedings of IEEE ATM 98 Workshop, Fairfax, USA, pp. 324-328.
19. Guerin R., Orda A. QoS-based routing in networks with inaccurate information: theory and algorithms. IEEE INFOCOM '97. 1997;75-83.
20. Hassin R. Approximation schemes for restricted shortest path problem. Math. Oper. Res. 17:(1):1992;36-42.
21. W. Lee, M. Hluchyi, P. Humblet, Routing subject to quality of service constraints in integrated communication networks, IEEE Network (July/August) (1995) 46-55.
22. D.H. Lorenz, A. Orda, QoS routing in networks with uncertain parameters, IEEE INFOCOM'98.
23. M. Sanjay, Bounds on end-to-end performance via greedy, multi-path routing in integrated services networks, IEEE INFOCOM'98.