TY - GEN

T1 - Minimizing congestion of layouts for ATM networks with faulty links

AU - Gasieniec, Leszek

AU - Kranakis, Evangelos

AU - Krizanc, Danny

AU - Pelc, Andrzej

N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1996.

PY - 1996

Y1 - 1996

N2 - We consider the problem of constructing virtual path layouts for an ATM network consisting of a complete networkKn of n processors in which a certain number of links may fail. Our main goal is to construct layouts which tolerate any configuration of up to f layouts and have a least possible congestion. First, we study the minimal congestion of 1- hop f-tolerant layouts in Kn. For any positive integer f we give upper and lower bounds on this minimal congestion and construct f-tolerant layouts with congestion corresponding to the upper bounds. Our results are based on a precise analysis of the diameter of the network Kn[F] which results from Kn by deleting links from a set F of bounded size. Next we study the minimal congestion of h-hop f-tolerant layouts in Kn, for larger values of the number h of hops. We give upper and lower bounds on the order of magnitude of this congestion, based on results for 1-hop layouts. Finally, we consider a random, rather than worst case, fault distribution. Links fail independently with constant probability p < 1. Our goal now is to construct layouts with low congestion that tolerate the existing faults with high probability. For any p < 1, we show such layouts in Kn, with congestion O(log n).

AB - We consider the problem of constructing virtual path layouts for an ATM network consisting of a complete networkKn of n processors in which a certain number of links may fail. Our main goal is to construct layouts which tolerate any configuration of up to f layouts and have a least possible congestion. First, we study the minimal congestion of 1- hop f-tolerant layouts in Kn. For any positive integer f we give upper and lower bounds on this minimal congestion and construct f-tolerant layouts with congestion corresponding to the upper bounds. Our results are based on a precise analysis of the diameter of the network Kn[F] which results from Kn by deleting links from a set F of bounded size. Next we study the minimal congestion of h-hop f-tolerant layouts in Kn, for larger values of the number h of hops. We give upper and lower bounds on the order of magnitude of this congestion, based on results for 1-hop layouts. Finally, we consider a random, rather than worst case, fault distribution. Links fail independently with constant probability p < 1. Our goal now is to construct layouts with low congestion that tolerate the existing faults with high probability. For any p < 1, we show such layouts in Kn, with congestion O(log n).

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

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

U2 - 10.1007/3-540-61550-4_163

DO - 10.1007/3-540-61550-4_163

M3 - Conference contribution

AN - SCOPUS:84947906013

SN - 3540615504

SN - 9783540615507

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 372

EP - 381

BT - Mathematical Foundations of Computer Science 1996 - 21st International Symposium, MFCS 1996, Proceedings

A2 - Penczek, Wojciech

A2 - Szalas, Andrzej

PB - Springer Verlag

T2 - 21st International Symposium on Mathematical Foundations of Computer Science, MFCS 1996

Y2 - 2 September 1996 through 6 September 1996

ER -