DocumentCode
2232445
Title
Hop-congestion trade-offs for high-speed networks
Author
Kranakis, Evangelos ; Krizanc, Danny ; Pelc, Andrzej
Author_Institution
Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada
fYear
1995
fDate
25-28 Oct 1995
Firstpage
662
Lastpage
667
Abstract
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
Keywords
B-ISDN; asynchronous transfer mode; message passing; ATM networks; chains; edge-congestion; high-speed networks; hop number; hop-congestion trade-offs; meshes; message transmission; optimal virtual path layouts; path layouts; routing field; virtual paths; Application software; Asynchronous transfer mode; Computer science; Costs; Councils; High-speed networks; ISDN; Routing; Virtual colonoscopy;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on
Conference_Location
San Antonio, TX
ISSN
1063-6374
Print_ISBN
0-81867195-5
Type
conf
DOI
10.1109/SPDP.1995.530745
Filename
530745
Link To Document