CIAC 2000: Algorithms and Complexity pp 44-58 | Cite as

Duality in ATM Layout Problems

  • Shmuel Zaks
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1767)

Abstract

We present certain dualities occuring in problems of design of virtual path layouts in ATM networks. We concentrate on the one- to-many problem on a chain network, in which one constructs a set of paths, that enable connecting one vertex with all others in the network. We consider the parameters of load (the maximum number of paths that go through any single edge) and hop count (the maximum number of paths traversed by any single message). Optimal results are known for the cases where the routes are shortest paths and for the general case of unrestricted paths. These solutions are symmetric with respect to the two parameters of load and hop count, and thus suggest duality between these two.

We discuss these dualities from various points of view. The trivial one follows from corresponding recurrence relations. We then present var- ious one-to-one correspondences. In the case of shortest paths layouts we use binary trees and lattice paths (that use horizontal and vertical steps). In the general case we use ternary trees, lattice paths (that use horizontal, vertical and diagonal steps), and high dimensional spheres. These correspondences shed light on the structure of the optimal solu- tions, and simplify some of the proofs, especially for the optimal average case designs.

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ABCRS99]
    W. Aiello, S. Bhatt, F. Chung, A. Rosenberg, and R. Sitaraman, Augmented rings networks, Proceedings of the 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Lacanau-Océan, France, 1999, pp. 1–16.Google Scholar
  2. [BG97]
    L. Beccheti and C. Gaibisso, Lower bounds for the virtual path layout problem in ATM networks, Proceedings of the 24th Seminar on Theory and Practice of Informatics (SOFSEM), Milovny, The Czech Republic, November 1997, pp. 375–382.Google Scholar
  3. [BBGG97]
    L. Becchetti, P. Bertolazzi, C. Gaibisso and G. Gambosi, On the design of efficient ATM routing schemes, submitted, 1997.Google Scholar
  4. [CGZ94]
    I. Cidon, O. Gerstel and S. Zaks, A scalable approach to routing in ATM networks. 8th International Workshop on Distributed Algorithms (WDAG), Lecture Notes in Computer Science 857, Springer Verlag, Berlin, 1994, pp.209–222.Google Scholar
  5. [DFZ97]
    Ye. Dinitz, M. Feighelstein and S. Zaks, On optimal graph embedded into path and rings, with analysis using l 1-spheres, 23th International Workshop. on Graph-Theoretic Concepts in Computer Sciences (WG), Berlin, Germany, June 1997.Google Scholar
  6. [F98]
    M. Feighelstein, Virtual path layouts for ATM networks with unbounded stretch factor, M.Sc. Dissertation, Department of Computer Science, Technion, Haifa, Israel, May 1998.Google Scholar
  7. [FNP97]
    M. Flammini, E. Nardelli and G. Proietti, ATM layouts with bounded hop count and congestion, Proceedings of the 11th International Workshop on Distributed Algorithms (WDAG), Saarbrüecken, Germany, September 1997, pp. 24–26.Google Scholar
  8. [FZ98]
    M. Feighelstein and S. Zaks, Duality in chain ATM virtual path layouts, Proceedings of the 4th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Monte Verita, Ascona, Switzerland, July 24–26, 1997, pp. 228–239.Google Scholar
  9. [G95]
    O. Gerstel, Virtual Path Design in ATM Networks, Ph.D. thesis, Department of Computer Science, Technion, Haifa, Israel, December 1995.Google Scholar
  10. [GW70]
    S. W. Golomb and L. R. Welch, Perfect Codes in the Lee Metric and the Packing of Polyominoes. SIAM Journal on Applied Math., vol.18,no.2, January, 1970, pp. 302–317.MATHCrossRefMathSciNetGoogle Scholar
  11. [GWZ95]
    O. Gerstel, A. Wool and S. Zaks, Optimal layouts on a chain ATM network, Discrete Applied Mathematics, special issue on Network Communications, 83, 1998, pp. 157–178.MATHMathSciNetGoogle Scholar
  12. [GWZ97]
    O. Gerstel, A. Wool and S. Zaks, Optimal Average-Case Layouts on Chain Networks, Proceedings of the Workshop on Algorithmic Aspects of Communication, Bologna, Italy, July 11–12, 1997.Google Scholar
  13. [KKP95]
    E. Kranakis, D. Krizanc and A. Pelc, Hop-congestion tradeoffs for ATM networks, 7th IEEE Symp. on Parallel and Distributed Processing, pp. 662–668.Google Scholar
  14. [SV96]
    L. Stacho and I. Vrt’o, Virtual Path Layouts for Some Bounded Degree Networks. 3rd International Colloquium on Structural Information and Communication Complexity (SIROCCO), Siena, Italy, June 1996.Google Scholar
  15. [Z97]
    S. Zaks, Path Layout in ATM Networks, The DIMACS Workshop on Networks in Distributed Computing, DIMACS Center, Rutgers University, October 26–29, 1997, pp. 145–160.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Shmuel Zaks
    • 1
  1. 1.Department of Computer ScienceTechnionHaifaIsrael

Personalised recommendations