Minimizing congestion of layouts for ATM networks with faulty links

Leszek Gasieniec, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

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).

Original languageEnglish (US)
Title of host publicationMathematical Foundations of Computer Science 1996 - 21st International Symposium, MFCS 1996, Proceedings
EditorsAndrzej Szalas, Wojciech Penczek
PublisherSpringer Verlag
Pages372-381
Number of pages10
ISBN (Print)3540615504, 9783540615507
StatePublished - Jan 1 1996
Externally publishedYes
Event21st International Symposium on Mathematical Foundations of Computer Science, MFCS 1996 - Cracow, Poland
Duration: Sep 2 1996Sep 6 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1113
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference21st International Symposium on Mathematical Foundations of Computer Science, MFCS 1996
CountryPoland
CityCracow
Period9/2/969/6/96

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Minimizing congestion of layouts for ATM networks with faulty links'. Together they form a unique fingerprint.

  • Cite this

    Gasieniec, L., Kranakis, E., Krizanc, D., & Pelc, A. (1996). Minimizing congestion of layouts for ATM networks with faulty links. In A. Szalas, & W. Penczek (Eds.), Mathematical Foundations of Computer Science 1996 - 21st International Symposium, MFCS 1996, Proceedings (pp. 372-381). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1113). Springer Verlag.