Skip to main content
SpringerLink
Log in

Wireless ATM Layouts for Chain Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

In this paper we consider the problem of constructing ATM layouts for wireless networks in which mobile users can move along a chain of base stations. We first show that deciding the existence of a layout with maximum hop count h, load l and channel distance d is NP-complete for every fixed value of d greater or equal to 1. We then provide optimal layout constructions for the case d≤2. Finally, optimal layout constructions are obtained also for any d within the class of the so-called canonic layouts, that so far have always been shown to be the optimal ones.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. Ahn, R.P. Tsang, S.R. Tong and D.H.C. Du, Virtual path layout design on ATM networks, in: Proc. of the 13th INFOCOM Conf. (1994) pp. 192–200.

  2. B.A. Akyol and D.C. Cox. Rerouting for handoff in a wireless ATM network, in: Proc. of the IEEE Internat. Conf. on Universal Personal Communications (1996).

  3. L. Becchetti, P. Bertolazzi, C. Gaibisso and G. Gambosi, On the design of efficient ATM schemes, in: Proc. of the SOFSEM Conf., Lecture Notes in Computer Science, Vol. 1338 (Springer, New York, 1997) pp. 375–382.

    Google Scholar 

  4. J. Burgin and D. Dorman, Broadband ISDN resource management: The role of virtual paths, IEEE Communicatons Magazine 29 (1991).

  5. M. Cheng, S. Rajagopalan, L. Chang, G. Pollini and M. Barton. PCS mobility support over fixed ATM networks, IEEE Communications Magazine 35 (1997) 82–92.

    Google Scholar 

  6. C. Chrysostomou, A. Pitsillides and F. Pavlidou, A survey of wireless ATM handover iusses, in: Proc. of the Internat. Symposium of 3G Infrastructure and Services, 3GIS, Vol. 2/3 (2001) pp. 34–39.

    Google Scholar 

  7. I. Cidon, O. Gerstel and S. Zaks, A scalable approach to routing in ATM networks, in: Proc. of the 8th Internat. Workshop on Distributed Algorithms, eds. G. Tel and P.M.B. Vitányi, Terschelling, The Netherlands (October 1994), Lecture Notes in Computer Sience, Vol. 857 (Springer, New York, 1994) pp. 209–222; submitted for publication in IEEE/ACM Transactions on Networking.

    Google Scholar 

  8. R. Cohen and A. Segall, Connection management and rerouting in ATM networks, in: Proc. of the 13th INFOCOM Conf. (1994) pp. 184–191.

  9. Y. Dinitz, M. Feighelstein and S. Zaks, On optimal graphs embedded into path and rings, with analysis using l 1-spheres, in: Proc. of the 23rd Internat. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Lecture Notes in Computer Science, Vol. 1335 (Springer, New York, 1997) pp. 171–183.

    Google Scholar 

  10. T. Eilam, M. Flammini and S. Zaks, A complete characterization of the path layout construction problem for ATM networks with given hop count and load, in: Proc. of the 24th Internat. Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, Vol. 1256 (Springer, New York, 1997) pp. 527–537.

    Google Scholar 

  11. M. Flammini, G. Gambosi and A. Navarra, Wireless ATM layouts for chain networks, in: Proc. of the 17th Internat. Parallel and Distributed Processing Symposium (IPDPS), 3rd Workshop on Wireless, Mobile and Ad Hoc Networks (WMAN), IEEE Computer Society (2003) p. 220.1.

  12. M. Flammini, A. Gasparini, G. Gambosi and A. Navarra, Dynamic layouts for wireless ATM, in: Proc. of the 9th Internat. Conf. on Parallel and Distributed Computing (Euro-Par), Lecture Notes in Computer Science, Vol. 2790 (Springer, New York, 2003) pp. 1056–1063.

    Google Scholar 

  13. O. Gerstel, I. Cidon and S. Zaks, The layout of virtual paths in ATM networks, IEEE/ACM Transactions on Networking 4(6) (1996) 873–884.

    Google Scholar 

  14. O. Gerstel, A. Wool and S. Zaks, Optimal layouts on a chain ATM network, in: 3rd Annual European Symposium on Algorithms (ESA), Corfu, Greece (September 1995), Lecture Notes in Computer Science, Vol. 979 (Springer, New York, 1995) pp. 508–522; to appear in Discrete Applied Mathematics.

    Google Scholar 

  15. O. Gerstel and S. Zaks, The virtual path layout problem in fast networks, in: Proc. of the 13th ACM Symposium on Principles of Distributed Computing, Los Angeles, USA (August 1994) pp. 235–243.

  16. J.D. Gibson, The Mobile Communications Handbook, 2nd ed. (CRC Press/IEEE Press, 1999).

  17. R.L. Graham, D.E. Knuth and O. Patashnik, Concrete Mathematics (Addison-Wesley, Reading, MA, 1989).

    Google Scholar 

  18. R. Händler and M.N. Huber, Integrated Broadband Networks: An Introduction to ATM-Based Networks (Addison-Wesley, Reading, MA, 1991).

    Google Scholar 

  19. ITU recommendation, I series, Blue Book (November 1990).

  20. R.M. Karp, On the computational complexity of combinatorial problems, Networks 5 (1975) 45–68.

    Google Scholar 

  21. E. Kranakis, D. Krizanc and A. Pelc, Hop-congestion tradeoffs in ATM networks, in: Proc. of the 9th IEEE Symposium on Parallel and Distributed Processing (1995) pp. 662–668.

  22. M. Mouly and M.B. Pautet, The GSM System for Mobile Communications (Cell & Sys, 1993).

  23. G. Parry, Wireless ATM MAC protocols — a literature survey, WARP Project — URL, http://vera.ee.und.ac.za/coe/warp (1999).

  24. C. Partridge, Gigabit Networking (Addison-Wesley, Reading, MA, 1994).

    Google Scholar 

  25. K.I. Sato, S. Ohta and I. Tokizawa, Broad-band ATM network architecture based on virtual paths, IEEE Transactions on Communications 38(8) (1990) 1212–1222.

    Google Scholar 

  26. Y. Sato and K.I. Sato, Virtual path and link capacity design for ATM networks, IEEE Journal on Selected Areas in Communications 9 (1991).

  27. D. Sobirk and J.M. Karlsson, A survey of wireless ATM MAC protocols, in: Proc. of the Internat. Conf. on the Performance and Management of Complex Communication Networks (PMCCN) (Chapman & Hall, London, 1997).

    Google Scholar 

  28. A. Srinivasan, Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems, in: Proc. of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS) (IEEE Computer Society Press, Los Alamitos, CA, 1997) pp. 416–425.

    Google Scholar 

  29. L. Stacho and I. Vrto, Virtual path layouts for some bounded degree networks, in: Proc. of the 3rd Colloquium on Structural Information and Communication Complexity (SIROCCO) (Carleton Univ. Press, 1996) pp. 269–278.

  30. S. Zaks, Path layouts in ATM networks, in: Proc. of the SOFSEM Conf., Lecture Notes in Computer Science, Vol. 1338 (Springer, New York, 1997) pp. 144–160.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, University of L'Aquila, Via Vetoio loc. Coppito, I-67100, L'Aquila, Italy

    Michele Flammini & Alfredo Navarra

  2. Dipartimento di Matematica, University of Rome “Tor Vergata”, Via della Ricerca Scientifica, I-00133, Rome, Italy

    Giorgio Gambosi

  3. MASCOTTE project, I3S-CNRS, INRIA, Université de Nice, Sophia Antipolis, route des Lucioles, B.P. 93, F-06902, Sophia Antipolis Cedex, France

    Alfredo Navarra

Authors
  1. Michele Flammini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giorgio Gambosi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Alfredo Navarra
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Flammini, M., Gambosi, G. & Navarra, A. Wireless ATM Layouts for Chain Networks. Mobile Networks and Applications 10, 35–45 (2005). https://doi.org/10.1023/B:MONE.0000048544.06992.f7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:MONE.0000048544.06992.f7

Search

Navigation