A Model for Evaluating the Impact of Aggregated Routing Information on Network Performance

This paper presents a mathematical model for evaluating the impact of information aggregation on the performance of PNNI-driven ATM networks. The routing aggregation scheme affects both the performance and scalability of these networks. However, to date, little is still known on how the choice of PNNI configuration parameters influences the network behavior. A generic model for the aggregation process is proposed in order to study its impact on the network utilization and routing overhead. Random geometric considerations are used to obtain closed-form approximations of various performance measures.

[1]  Ellen W. Zegura,et al.  A quantitative comparison of graph-based models for Internet topology , 1997, TNET.

[2]  François Baccelli,et al.  Poisson-Voronoi Spanning Trees with Applications to the Optimization of Communication Networks , 1999, Oper. Res..

[3]  P. Van Mieghem,et al.  Routing in a hierarchical structure , 1998 .

[4]  Jean-Louis Rougier,et al.  Self organizing hierarchical multicast trees and their optimization , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  Hiroshi Suzuki,et al.  QOS aggregation algorithms in hierarchical ATM networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[6]  Ariel Orda,et al.  QoS based routing in networks with inaccurate information: theory and algorithms , 1997, Proceedings of INFOCOM '97.

[7]  Ellen Zegura,et al.  Performance of the PNNI protocol in large networks , 1998, 1998 IEEE ATM Workshop Proceedings. 'Meeting the Challenges of Deploying the Global Broadband Network Infrastructure' (Cat. No.98EX164).

[8]  P. Van Mieghem.  Estimation of an optimal PNNI topology , 1997, IEEE ATM '97 Workshop Proceedings (Cat. No.97TH8316).

[9]  F. Baccelli,et al.  Markov paths on the Poisson-Delaunay graph with applications to routeing in mobile networks , 2000, Advances in Applied Probability.

[10]  Jennifer Rexfordz,et al.  Eecient Precomputation of Quality-of-service Routes , 1998 .

[11]  Jean-Louis Rougier,et al.  Optimization of hierarchical routing protocols , 2000, Perform. Evaluation.

[12]  Whay C. Lee,et al.  Topology aggregation for hierarchical routing in ATM networks , 1995, CCRV.

[13]  Anees Shaikh,et al.  Evaluating the overheads of source-directed quality-of-service routing , 1998, Proceedings Sixth International Conference on Network Protocols (Cat. No.98TB100256).