Data networks (2nd ed.)
ISDN and Broadband ISDN (2nd ed.)
ISDN and Broadband ISDN (2nd ed.)
On-line Steiner trees in the Euclidean plane
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
ATM: theory and application
Routing in the Internet
Routing in communications networks
Routing in communications networks
The design & implementation of a hybrid handover protocol for multi-media wireless LANs
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Approximation algorithms for NP-hard problems
Online computation and competitive analysis
Online computation and competitive analysis
Competitive routing of virtual circuits with unknown duration
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The GSM System for Mobile Communications
The GSM System for Mobile Communications
Developments from a June 1996 seminar on Online algorithms: the state of the art
Re-Routing in Circuit Switched Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Overview of wireless personal communications
IEEE Communications Magazine
On the remote server problem or more about TCP acknowledgments
Theoretical Computer Science
IEEE Transactions on Mobile Computing
On the best possible competitive ratio for multislope ski rental
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
| Hi-index | 0.01 |
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 &OHgr;(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.