A talk by Yi Du
5PM, November 20th, 1997. Shaffer 3.
In this talk, we discuss scalable topology aggregation schemes for management of large scale networks. Topology aggregation schemes are used in hierarchical source routing frameworks such as the ATM PNNI routing standard and Nimrod Routing for Internet, for scalability and security reasons. The design and implementation of a simulation environment which emulates the PNNI standard is discussed. Using this simulator, we study by simulation the performance, in terms of network throughput and signalling delay, of various topology aggregation schemes and link cost metrics. Our study results in identification of aggregation schemes with good trade-off between performance and representation. We verify the theoretical superiority of the exponential cost metric in hierarchical routing by studying the routing performance of exponential metric and min-hop metrics. Re-aggregation policies are also discussed, with new policy called Logarithmic Update designed to reduce the number of aggregations to be carried out.