TY - GEN
T1 - Routing through networks with hierarchical topology aggregation
AU - Awerbuch, B.
AU - Du, Y.
AU - Khan, B.
AU - Shavitt, Y.
PY - 1998
Y1 - 1998
N2 - In the future, global networks will consist of a hierarchy of subnetworks called domains. For reasons of both scalability and security, domains will not reveal details of their internal structure to outside nodes. Instead, these domains will advertise only a summary, or aggregated view, of their internal structure, e.g., as proposed by the ATM PNNI standard. This work compares, by simulation, the performance of several different aggregation schemes in terms of network throughput (the fraction of attempted connections that are realized), and network control load (the average number of crankbacks per realized connection.) Our main results are: the minimum spanning tree is a good aggregation scheme; exponential link cost functions perform better than min-hop routing; our suggested logarithmic update scheme that determines when re-aggregation should be computed can significantly reduce the computational overhead due to re-aggregation with a negligible decrease in performance.
AB - In the future, global networks will consist of a hierarchy of subnetworks called domains. For reasons of both scalability and security, domains will not reveal details of their internal structure to outside nodes. Instead, these domains will advertise only a summary, or aggregated view, of their internal structure, e.g., as proposed by the ATM PNNI standard. This work compares, by simulation, the performance of several different aggregation schemes in terms of network throughput (the fraction of attempted connections that are realized), and network control load (the average number of crankbacks per realized connection.) Our main results are: the minimum spanning tree is a good aggregation scheme; exponential link cost functions perform better than min-hop routing; our suggested logarithmic update scheme that determines when re-aggregation should be computed can significantly reduce the computational overhead due to re-aggregation with a negligible decrease in performance.
UR - http://www.scopus.com/inward/record.url?scp=85013308206&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85013308206&partnerID=8YFLogxK
U2 - 10.1109/ISCC.1998.702556
DO - 10.1109/ISCC.1998.702556
M3 - Conference contribution
AN - SCOPUS:85013308206
SN - 0818685387
SN - 9780818685385
T3 - Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998
SP - 406
EP - 412
BT - Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 3rd IEEE Symposium on Computers and Communications, ISCC 1998
Y2 - 30 June 1998 through 2 July 1998
ER -