Topology aggregation for combined additive and restrictive metrics

Computer Networks

Volumn 50, Issue 17, 2006, Pages 3284-3299

  Bauer, Daniel ^a   Daigle, John N ^a   Iliadis, Ilias ^a   Scotton, Paolo ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

Hierarchical networks; Multidimensional routing; QoS routing; Topology aggregation

Indexed keywords

BANDWIDTH; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; HIERARCHICAL SYSTEMS; TOPOLOGY;

HIERARCHICAL NETWORKS; MULTIDIMENSIONAL ROUTING; QOS ROUTING; TOPOLOGY AGGREGATION;

MATRIX ALGEBRA;

EID: 33748547538     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2005.12.011     Document Type: Article

References (33)

1. G. Apostolopoulos, R. Guérin, S. Kamat, A. Orda, T. Przygienda, D. Williams, QoS Routing Mechanisms and OSPF Extensions, draft-guerin-qos-routing-ospf-05.txt, Internet Engineering Task Force, April 1998, work in progress.
2. G. Apostolopoulos, R. Guérin, S. Kamat, Implementation and performance measurements of QoS routing extensions to OSPF, in: Proc. of IEEE INFOCOM'99, New York, March 1999, pp. 75-83.
3. J. Moy, OSPF Version 2, RFC 2328, April 1998.
4. The ATM Forum, Private Network-Network Interface Specification Version 1.0, Letter Ballot, March 1996.
5. F. Hao, E.W. Zegura, On scalable QoS routing: performance evaluation of topology aggregation, in: Proc. IEEE INFOCOM'2000, Tel Aviv, Israel, March 2000.
6. A. Orda, A. Sprintson, QoS routing: the precomputation perspective, in: Proc. IEEE INFOCOM'2000, Tel Aviv, Israel, March 2000, pp. 128-136.
7. I. Iliadis, P. Scotton, Transition matrix generation for complex node representation, in: Proc. of IEEE ATM Workshop'99, Kochi, Japan, May 1999, pp. 489-500.
8. Iliadis I. Optimal PNNI complex node representations for restrictive costs and minimal path computation time. IEEE/ACM Trans. Network. 8 4 (2000) 493-506
9. Lee W.C. Topology aggregation for hierarchical routing in ATM networks. Comput. Commun. Rev. 25 2 (1995) 82-92
10. W.C. Lee, Minimum equivalent subspanner algorithms for topology aggregation in ATM networks, in: Proc. 2nd International Conference on ATM ICATM'99, Colmar, France, June 1999, pp. 351-359.
11. B. Awerbuch, Y. Du, B. Khan, Y. Shavitt, Routing through networks with hierarchical topology aggregation, IEEE Symposium on Computers and Communications, Athens, Greece, June 1998, pp. 406-412.
12. Awerbuch B., and Shavitt Y. Topology aggregation for directed graphs. IEEE/ACM Trans. Network. 9 1 (2001) 82-90
13. Chen S., and Nahrstedt K. An overview of quality of service routing for next-generation high-speed networks: problems and solutions. IEEE Network 12 6 (1998) 64-79
14. S. Chen, K. Nahrstedt, On finding multi-constrained paths, in: Proc. IEEE ICC'98, June 1998.
15. R. Guérin, A. Orda, QoS-based routing in networks with inaccurate information: theory and algorithms, in: Proc. of IEEE INFOCOM'97, Kobe, Japan, March 1999, pp. 75-83.
16. D.H. Lorenz, A. Orda, QoS routing in networks with uncertain parameters, in: Proc. IEEE INFOCOM'98, San Francisco, March 1998, pp. 3-10.
17. Q. Ma, P. Steenkiste, H. Zhang, Routing high-bandwidth traffic in max-min fair share networks, in: Proc. of ACM SIGCOMM'96, Standford, August 1996, pp. 206-217.
18. Ma Q., and Steenkiste P. Quality of service routing for traffic with performance guarantees. Proc. 4th Int'l Wksp. on QoS (1997), Columbia University, New York 115-127
19. Q. Ma, P. Steenkiste, Supporting dynamic inter-class resource sharing: a multi-class QoS routing algorithm, in: Proc. of IEEE INFOCOM'99, New York, March 1999, pp. 649-660.
20. A. Orda, Routing with end-to-end QoS guarantees in broadband networks, in: Proc. IEEE INFOCOM'98, San Francisco, March 1998, pp. 27-34.
21. T. Korkmaz, M. Krunz, Source-oriented topology aggregation with multiple QoS parameters in hierarchical ATM networks, in: Proc. IEEE IWQoS'99, London, England, May-June, 1999, pp. 137-46.
22. D. Bauer, J.N. Daigle, I. Iliadis, P. Scotton, Efficient Frontier formulation for additive and restrictive metrics in hierarchical routing, in: Proc. of IEEE ICC'00, New Orleans, June 2000, pp. 1353-59.
23. Carré B. Graphs and Networks. Oxford Applied Mathematics and Computing Science Series (1979), Oxford University Press. 0-19-859622-7
24. Cormen T.H., Leiserson C.E., and Rivest R.L. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series (1989), MIT Press. 0-262-03141-8
25. Floyd R.W. Algorithm 97 (shortest path). Commun. ACM 5 6 (1965)
26. Bellman R. On a routing problem. Quart. Appl. Math. 16 1 (1958) 87-90
27. Ford Jr. L.R., and Fulkerson D.R. Flows in Networks (1962), Princeton University Press
28. Yen J.Y. Shortest Path Network Problems. Mathematical Systems in Economics vol. 18 (1975), Verlag Anton Hain, Meisenhaim am Glan. 3-445-01285-7
29. Demers A., Keshav S., and Shenker S. Analysis and simulation of a fair queueing algorithm. Internetwork.: Res. Exp. 1 1 (1990) 3-26
30. Parekh A.K., and Gallager R.G. A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Network. 1 3 (1993) 344-357
31. Parekh A.K., and Gallager R.G. A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Trans. Network. 2 2 (1994) 137-150
32. D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, J. McManus, Requirements for Traffic Engineering Over MPLS, RFC 2702, September 1999.
33. Xiao X., Hannan A., and Bailey B. Traffic engineering with MPLS in the internet. IEEE Network 14 2 (2000) 28-33