Hop-congestion trade-offs for high-speed networks

Message transmission in ATM networks is via virtual paths. Packets are routed along virtual paths by maintaining a routing field whose subfields determine the intermediary destinations of the packet. In such a network it is important to construct path layouts that minimize the hop number (i.e. the n...

Full description

Saved in:
Bibliographic Details
Published inProceedings.Seventh IEEE Symposium on Parallel and Distributed Processing pp. 662 - 667
Main Authors Kranakis, E., Krizanc, D., Pelc, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1995
Subjects
Application software
Asynchronous transfer mode
Computer science
Costs
Councils
High-speed networks
ISDN
Routing
Virtual colonoscopy
Online AccessGet full text
ISBN9780818671951
0818671955
ISSN1063-6374
DOI10.1109/SPDP.1995.530745

Cover

More Information
Summary:Message transmission in ATM networks is via virtual paths. Packets are routed along virtual paths by maintaining a routing field whose subfields determine the intermediary destinations of the packet. In such a network it is important to construct path layouts that minimize the hop number (i.e. the number of virtual paths used to travel between any two nodes) as a function of edge-congestion (i.e. the number of virtual paths passing through a link). In this paper we construct asymptotically optimal virtual path layouts for chains and meshes.
ISBN:9780818671951
0818671955
ISSN:1063-6374
DOI:10.1109/SPDP.1995.530745