Routing through networks with hierarchical topology aggregation

B. Awerbuch, Y. Du, B. Khan, Y. Shavitt

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages406-412
Number of pages7
ISBN (Print)0818685387, 9780818685385
DOIs
StatePublished - 1998
Event3rd IEEE Symposium on Computers and Communications, ISCC 1998 - Athens, Greece
Duration: Jun 30 1998Jul 2 1998

Publication series

NameProceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998

Other

Other3rd IEEE Symposium on Computers and Communications, ISCC 1998
CountryGreece
CityAthens
Period6/30/987/2/98

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Safety, Risk, Reliability and Quality

Fingerprint Dive into the research topics of 'Routing through networks with hierarchical topology aggregation'. Together they form a unique fingerprint.

  • Cite this

    Awerbuch, B., Du, Y., Khan, B., & Shavitt, Y. (1998). Routing through networks with hierarchical topology aggregation. In Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998 (pp. 406-412). [702556] (Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISCC.1998.702556