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 Citations (Scopus)

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 - Jan 1 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

Fingerprint

Agglomeration
Topology
Automatic teller machines
Cost functions
Scalability
Throughput

ASJC Scopus subject areas

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

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

Routing through networks with hierarchical topology aggregation. / Awerbuch, B.; Du, Y.; Khan, B.; Shavitt, Y.

Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998. Institute of Electrical and Electronics Engineers Inc., 1998. p. 406-412 702556 (Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998).

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

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., 702556, Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998, Institute of Electrical and Electronics Engineers Inc., pp. 406-412, 3rd IEEE Symposium on Computers and Communications, ISCC 1998, Athens, Greece, 6/30/98. https://doi.org/10.1109/ISCC.1998.702556
Awerbuch B, Du Y, Khan B, Shavitt Y. Routing through networks with hierarchical topology aggregation. In Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998. Institute of Electrical and Electronics Engineers Inc. 1998. p. 406-412. 702556. (Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998). https://doi.org/10.1109/ISCC.1998.702556
Awerbuch, B. ; Du, Y. ; Khan, B. ; Shavitt, Y. / Routing through networks with hierarchical topology aggregation. Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998. Institute of Electrical and Electronics Engineers Inc., 1998. pp. 406-412 (Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998).
@inproceedings{b916aa89b65045bb991bc1dfcd0c2149,
title = "Routing through networks with hierarchical topology aggregation",
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.",
author = "B. Awerbuch and Y. Du and B. Khan and Y. Shavitt",
year = "1998",
month = "1",
day = "1",
doi = "10.1109/ISCC.1998.702556",
language = "English (US)",
isbn = "0818685387",
series = "Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "406--412",
booktitle = "Proceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998",

}

TY - GEN

T1 - Routing through networks with hierarchical topology aggregation

AU - Awerbuch, B.

AU - Du, Y.

AU - Khan, B.

AU - Shavitt, Y.

PY - 1998/1/1

Y1 - 1998/1/1

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.

ER -