Minimizing Congestion of Layouts for ATM Networks with Faulty Links

@article{Gasieniec1996MinimizingCO,
  title={Minimizing Congestion of Layouts for ATM Networks with Faulty Links},
  author={Leszek Gasieniec and Evangelos Kranakis and Danny Krizanc and Andrzej Pelc},
  journal={Int. J. Found. Comput. Sci.},
  year={1996},
  volume={10},
  pages={503-512}
}
We consider the problem of constructing virtual path layouts for an ATM network consisting of a complete network K n of n processors in which a certain number of links may fail. Our main goal is to construct layouts which tolerate any connguration of up to f layouts and have the least possible congestion. First, we study the minimal congestion of 1-hop f-tolerant layouts in K n. For any positive integer f we give upper and lower bounds on this minimal congestion and construct f-tolerant layouts… CONTINUE READING