Sciweavers

Share
INFOCOM
2000
IEEE

Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach

9 years 1 months ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems that are used as an infrastructure for PCS networks are based on connection-based technologies. In these systems, the session cost is composed of two components. The setup cost represents the cost associated with the handoff operations, and the hold cost determines the expense related to the use of network resources held by the connection. This work introduces for the first time, rerouting algorithms for general graphs which are cost effective in terms of their worst-case analysis. The algorithms are analyzed using a competitive analysis approach, and it is proved that the competitive ratio of the proposed algorithms is a small constant of which the precise value depends on the ratio between the setup costs and the hold costs of the links. We also prove a lower bound of 2 on the competitive ratio of any onlin...
Yigal Bejerano, Israel Cidon, Joseph Naor
Added 31 Jul 2010
Updated 31 Jul 2010
Type Conference
Year 2000
Where INFOCOM
Authors Yigal Bejerano, Israel Cidon, Joseph Naor
Comments (0)
books