Routing through networks with hierarchical topology aggregation

Journal of High Speed Networks

Volumn 7, Issue 1, 1998, Pages 57-73

  Awerbuch, Baruch ^a,c   Du, Yi ^a   Khan, Bilal ^a   Shavitt, Yuval ^b  

^a Johns Hopkins University   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HOP-BY-HOP ROUTING; PRIVATE NETWORK-TO-NETWORK INTERFACE (PNNI); SCALABILITY; VIRTUAL CENTER NODE;

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ELECTRIC NETWORK TOPOLOGY; NETWORK PROTOCOLS; PARAMETER ESTIMATION; ROUTERS; SECURITY OF DATA;

HIERARCHICAL SYSTEMS;

EID: 0002206787     PISSN: 09266801     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. B. Awerbuch, Y. Azar and S. Plotkin, Throughput-competitive on-line routing, in: 34th Annual IEEE Symposium on Foundations of Computer Science, 1993, pp. 32-40.
2. I. Althofer, G. Das, D. Dopkin, D. Joseph and J. Soares, On sparse spanners of weighted graphs, Discrete and Computational Geometry 9 (1993), 81-100.
3. B. Awerbuch and Y. Shavitt, Topology aggregation for directed graphs, in: Third IEEE Symposium on Computers and Communications, 1998, pp. 47-52.
4. Y. Bartal, Probabilistic approximation of metric space and its algorithmic applications, in: 37th Annual IEEE Symposium on Foundations of Computer Science, 1996.
5. D. Bertsekas and R. Gallager, Data Networks, 2nd edn, Prentice-Hall, 1992.
6. A. Bar-Noy and M. Gopal, Topology distribution cost vs. efficient routing in large networks, Computer Communications Review 20(4) (1990), 242-252.
7. I. Castineyra, J.N. Chiappa and M. Steenstrup, The nimrod routing architecture, Internet Draft, Nimrod Working Group, 1996.
8. I. Cidon, R. Rom and Y. Shavitt, Analysis of one-way reservation algorithms, Journal of High Speed Networks 5(4) (1996), 347-363.
9. W.-C. Lee, Spanning tree method for link state aggregation in large communication networks, in: IEEE INFOCOM '95, 1995, pp. 297-302.
10. W.-C. Lee, Topology aggregation for hierarchical routing in ATM networks, Computer Communication Review 25(2) (1995), 82-92.
11. Private network-network interface specification version 1.0 (PNNI), Technical report, The ATM Forum technical committee, 1996, af-pnni-0055.000.
12. D. Peleg and A.A. Schäffer, Graph spanners, Journal of Graph Theory 13(1) (1989), 99-116.
13. D. Peleg and E. Upfal, A tradeoff between space and efficiency for routing tables, in: 20th ACM Symposium on the Theory of Computing, 1988, pp. 43-52.
14. B.M. Waxman, Routing of multipoint connections, Journal on Selected Areas in Communications 6 (1988), 1617-1622.