skip to main content
10.1145/345848.345864acmconferencesArticle/Chapter ViewAbstractPublication PagesdialmConference Proceedingsconference-collections
Article
Free Access

Dynamic session management for static and mobile users: a competitive on-line algorithmic approach

Authors Info & Claims
Published:01 August 2000Publication History

ABSTRACT

Most modern communication systems that support real-time communication (ATM, ISDN, Frame-Relay, etc.) are based on connection oriented technologies. This is also true for cellular and Personal Communication Systems, where the users are mobile. Consequently, selecting good routes for Virtual Channels (VCs) is considered as one of the most important problems in modern networks. Usually, the VC route is determined during the session initialization along the shortest path (with respect to some metric) between the users and remains the same during the entire session. However, the user mobility and the fact that the cost of a session may also depend on its duration, motivate the development of dynamic session management algorithms. Such algorithms may reroute the VCs dynamically during the sessions for improving session cost and for supporting handoff operations of mobile users.

This work deals with the general Session Management problem and proposes several on-line algorithms for managing session between static or mobile users. In the case of static users, we present a 4-competitive algorithm for the situation where the path cost functions are concave. In the presence of mobile users we prove that for a general graph, mobile users and arbitrary link cost functions with positive setup cost, the competitive ratio of the best on-line algorithm is at least Ω(log n), where n is the number of nodes in the network. We also present constant competitive on-line algorithms for several practical topologies and movement assumptions.

References

  1. 1.W. Stallings. ISDN and broadband ISDN. 2nd edition, Macmillan Publishing Company, 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.D. E. McDysan and D. L. Spohn. ATM theory and application. McGraw-Hill, 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.C. Huitema. Routing in the Internet. Prentice. Hall, 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.R. Braden, D. Clark and S. Shenker. Integrated services in the Internet architecture: an overview. RFC 1633, June 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Mouly and M. B. Pautet. The GSM system for mobile communication. M. Mouly, 49 rue Louise Bruneau, Palaiseau, France 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.D. C. Cox. Wireless personal communication: what is it? IEEE Personal Communication, April 1995.]]Google ScholarGoogle ScholarCross RefCross Ref
  7. 7.E. Padgett, C. G. Gunther and T. Hattori. Overview of wireless personal communications. IEEE communication magazine, January 1995 Vol 33 No 1.]]Google ScholarGoogle Scholar
  8. 8.E. Streenstrup. Routing in communication networks. Prentice-Hall, 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.D. Bertsekas, R. Gallager. Data networks. 2nd Edition, Printice-Hall, 1992.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 10.i. F. Akyildiz, J. S. M. Ho and M. Ulema. Performance analysis of the anchor radio system handover method for personal access communications system. Proc. IEEE INFOCOM, 1996.]]Google ScholarGoogle ScholarCross RefCross Ref
  11. 11.M. H. Ackroyd. Call repacking in connecting networks. IEEE Trans. on Commun. Vol. 27, No. 3, March 1979.]]Google ScholarGoogle ScholarCross RefCross Ref
  12. 12.E. W. M. Wong, A. K. M. Chan and T. S. P. Yum. Re-routing in circuit switched networks. Proc. iEEE INFOCOM, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.A. Girard and S. Hurtubise. Dynamic routing and call repacking in circuit-switched networks. IEEE Trans. on Comrnun. Vol. 31, No. 12, December 1983.]]Google ScholarGoogle Scholar
  14. 14.K. C. Lee and V. O. K. Li, A circuit rerouting algorithm for all-optical wide-area networks. Proc. IEEE INFOCOM, 1994.]]Google ScholarGoogle Scholar
  15. 15.R. Cohen. Smooth intentional rerouting and its applications in ATM networks. Proc. IEEE INFOCOM, 1994.]]Google ScholarGoogle ScholarCross RefCross Ref
  16. 16.B. Awerbuch, Y. Azar, S. Plotkin and O. Waarts. Competitive routing of virtual circuits with unknown duration Proc. of 5th SODA (1994), 321-327.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. 17.B. A. J. Banh, G. J. Anido and E. Dutkiewicz. Handover re-routing schemes for connection oriented services in mobile ATM networks. Proc. IEEE INFOCOM, 1998.]]Google ScholarGoogle ScholarCross RefCross Ref
  18. 18.K. Keeton, B. A. Mah, S. Seshan, R. H. Katz and D. Ferrari. Providing connection-oriented network services to mobile hosts. Proc. of the USENIX Symp. On Mobile and Location-independent Computing, Cambridge Massachusetts, August 1993.]]Google ScholarGoogle Scholar
  19. 19.C. K. Toh The design and implementation of a hybrid handover protocol for multi-media wireless LANs. Proc. ACM MOBICOM 95, 1995.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. 20.A. Borodin and R. EI-Yaniv. Online computation and competitive analysis, Cambridge University Press, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. 21.S. Irani and A. R. Karlin. On Online Computation. Chapter 13 in "Approximation algorithms for NP-hard problems", Edited by D. S. Hochbaum, P WS Publishing Company, 1996.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. 22.Y. Azar, Y. Bartal, E. Feuerstein, A. Fiat, S. Leonardi and A. Rosen. On capital investment. Algorithmica, Vol. 25, no. 1, pp. 22-36, 1999.]]Google ScholarGoogle ScholarCross RefCross Ref
  23. 23.R. E1-Yaniv, R. Kaniel and N. Linial. Competitive optimal on-line leasing. Algorithmica, Vol. 25, no. 1, pp. 116-140, 1999.]]Google ScholarGoogle Scholar
  24. 24.Y. Bejerano, I. Cidon, and J. Naor. Efficient handoff rerouting algorithms: a competitive on-line algorithmic approach, Proc. IEEE INFOCOM-2000. March 2000.]]Google ScholarGoogle ScholarCross RefCross Ref
  25. 25.M. Imaze and B. M. Waxman. Dynamic steiner tree problem. SIAM Journal on Discrete Mathematics 4:369-384, 1991.]]Google ScholarGoogle ScholarCross RefCross Ref
  26. 26.N. Alon and Y. Azar. On-line steiner trees in the Euclidean plane. Proc. of 8th Computational Geometry (1992), 337-343.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 27.Y. Azar. On-line load balancing. Chapter 8 in "Online Algorithms, State of the Art", Edited by A. Fiat and G. J. Woeginger, Lecture Notes in Computer Science, Vol. 1442, Springer-Verlag, 1998.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. 28.Y. Bejerano, I. Cidon, and J. Naor. Dynamic Session Management for Static and Mobile Users: A Competitive On-Line Algorithmic Approach. Research Report, Center for Communication and Information Technologies, Technion Haifa, israel. CC PUB ~291, August 1999.]]Google ScholarGoogle Scholar

Index Terms

  1. Dynamic session management for static and mobile users: a competitive on-line algorithmic approach

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Conferences
                DIALM '00: Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
                August 2000
                104 pages
                ISBN:1581133014
                DOI:10.1145/345848

                Copyright © 2000 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 August 2000

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • Article

                Acceptance Rates

                DIALM '00 Paper Acceptance Rate11of33submissions,33%Overall Acceptance Rate21of68submissions,31%

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader