Topology aggregation for directed graph

B. Awerbuch, Y. Shavitt*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper addresses the problem of aggregating the topology of a sub-network in a compact way with minimum distortion. The problem arises from networks that have a hierarchical structure, where each sub-network must advertise the cost of routing between each pair of its border nodes. The straightforward solution of advertising the exact cost for each pair has a quadratic cost which is not practical. We look at the realistic scenario of networks where all links are bidirectional, but their cost (or distance) in the opposite directions might differ significantly. The paper presents a solution with distortion that is bounded by the logarithm of the number of border nodes and the square-root of the asymmetry in the cost of a link. This is the first time that a theoretical bound is given to an undirected graph. We show how to apply our solution to the ATM PNNI standard.

Original languageEnglish
Title of host publicationProceedings - 3rd IEEE Symposium on Computers and Communications, ISCC 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages47-52
Number of pages6
ISBN (Print)0818685387, 9780818685385
DOIs
StatePublished - 1998
Externally publishedYes
Event3rd IEEE Symposium on Computers and Communications, ISCC 1998 - Athens, Greece
Duration: 30 Jun 19982 Jul 1998

Publication series

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

Conference

Conference3rd IEEE Symposium on Computers and Communications, ISCC 1998
Country/TerritoryGreece
CityAthens
Period30/06/982/07/98

Fingerprint

Dive into the research topics of 'Topology aggregation for directed graph'. Together they form a unique fingerprint.

Cite this