Rerouting algorithm for non real time traffic

Abstract

The third generation of wireless networks will be broadband and thus will be able to support several services with different constraints on their QoS such as transit delay for time sensitive connections or cell loss probability for non real time applications. However, in such networks, the mobile may traverse several cells during the communication. Thus, if the newly visited cell does not have enough radio resources then some data may be lost or in a worst case the connection can be dropped. Since handovers are obviously critical moments then researchers have mainly investigated the bandwidth allocation problem on the radio interface and ignored the impact of mobility effects on the fixed part of the network. In this study we present a new rerouting algorithm for WATM networks called RA-NRTT, which aims to reroute non real time traffic data in the wired part of the mobile network while avoiding loops. Performance evaluation of this algorithm has been done while considering two buffer sharing strategies: complete sharing (CS) and complete partitioning (CP), and two scheduling policies; first in first out (FIFO) and weighted round robin (WRR).