ISDN and Broadband ISDN (2nd ed.)
ISDN and Broadband ISDN (2nd ed.)
ATM: theory and application
Approximation algorithms for NP-hard problems
Wireless ATM: an enabling technology for multimedia personal communication
Wireless Networks - Special issue on wireless multimedia networking
Online computation and competitive analysis
Online computation and competitive analysis
The GSM System for Mobile Communications
The GSM System for Mobile Communications
Performance evaluation of crossover switch discovery algorithms for wireless ATM LANs
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
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
Emerging wireless broadband networks
IEEE Communications Magazine
Low-latency handover in a wireless ATM LAN
IEEE Journal on Selected Areas in Communications
Fast handoff for seamless wireless mesh networks
Proceedings of the 4th international conference on Mobile systems, applications and services
The SMesh wireless mesh network
ACM Transactions on Computer Systems (TOCS)
| Hi-index | 0.00 |
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 online algorithm, which means that the proposed algorithms are close in terms of worst case behavior to the best possible rerouting algorithm. In addition, experimental results also show that the proposed algorithms indeed balance between the session setup cost and the hold cost, yielding overall lower cost when compared to other algorithms described in the literature.