TY - GEN

T1 - Topology aggregation for directed graph

AU - Awerbuch, B.

AU - Shavitt, Y.

N1 - Publisher Copyright:
© 1998 IEEE.

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85013621975&partnerID=8YFLogxK

U2 - 10.1109/ISCC.1998.702442

DO - 10.1109/ISCC.1998.702442

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85013621975

SN - 0818685387

SN - 9780818685385

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

SP - 47

EP - 52

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 -