Topology aggregation for hierarchical routing in ATM networks

作者: Whay C. Lee

DOI: 10.1145/210613.210625

关键词:

摘要: This paper provides a tutorial for topology arregation in large hierarchical communication networks. Specifically, it examines some issues of aggregation PNNI Routing ATM networks, presents complex node representation, and guidelines aggregation. There are two main reasons First, information must be compressed to avoid excessive complexity adevertisement. Second, the internal network may have hidden security reasons. A desirable method adequately represent given efficient routing netowrk resource allocation, using compact advertised topology.

参考文章(4)
Ingo Althöfer, Gautam Das, David Dobkin, Deborah Joseph, José Soares, On sparse spanners of weighted graphs Discrete and Computational Geometry. ,vol. 9, pp. 81- 100 ,(1993) , 10.1007/BF02189308
David Peleg, Eli Upfal, A trade-off between space and efficiency for routing tables Journal of the ACM. ,vol. 36, pp. 510- 530 ,(1989) , 10.1145/65950.65953
Baruch Awerbuch, Complexity of network synchronization Journal of the ACM. ,vol. 32, pp. 804- 823 ,(1985) , 10.1145/4221.4227
W.C. Lee, Spanning tree method for link state aggregation in large communication networks international conference on computer communications. ,vol. 1, pp. 297- 302 ,(1995) , 10.1109/INFCOM.1995.515888