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. Using an efficient handoff rerouting algorithm is important for the efficient management of PCS networks. 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 whose precise value depends on the ratio between the setup costs and the hold costs of the links. We also prove that the competitive ratio of the best online algorithm is at least 2, 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