Topology aggregation for directed graphs

IEEE/ACM Transactions on Networking

Volumn 9, Issue 1, 2001, Pages 82-90

  Awerbuch, Baruch ^b   Shavitt, Yuval ^a,c,d,e  

^a IEEE

^b Johns Hopkins University   (United States)

^c JOHNS HOPKINS UNIVERSITY   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

^e LUCENT TECHNOLOGIES   (United States)

Author keywords

Asynchronous transfer mode; Communication system routing; Directed graphs; Graph theory; PNNI; Topology; Wide area networks

Indexed keywords

GRAPH THEORY; HIERARCHICAL SYSTEMS; ROUTERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS; WIDE AREA NETWORKS;

DIRECTED GRAPHS;

ASYNCHRONOUS TRANSFER MODE;

EID: 0035247507     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.909026     Document Type: Article

References (10)

1. On sparse spanners of weighted graphs
2. Routing through networks with hierarchical topology aggregation
3. Probabilistic approximation of metric space and its algorithmic applications
4. QoS-based routing in networks with inaccurate information: Theory and algorithms
5. Spanning tree method for link state aggregation in large communication networks
6. Graph spanners
7. A tradeoff between space and efficiency for routing tables
8. Routing of multipoint connections