Carleton University
Technical Report TR-95-04
March 1995
Hop-Congestion Tradeoffs for ATM Networks
Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
Abstract
In ATM networks messages are transmitted through virtual paths. Packets are routed along virtual paths by maintaining a routing eld whose sub elds determine the intermediary destinations of the packet. In such a network it is important to construct path layouts that min- imize 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.