Analysis of Multi-Server Scheduling Paradigm for Service Guarantees during Network Mobility

  • Authors:

  • Syed Zubair Ahmad;Muhammad Abdul Qadir;Muhammad Saeed Akbar;Abdelaziz Bouras

  • Affiliations:

  • Center of Distributed and Semantic Computing, Mohammad Ali Jinnah University, Islamabad, Pakistan;Center of Distributed and Semantic Computing, Mohammad Ali Jinnah University, Islamabad, Pakistan;Center of Distributed and Semantic Computing, Mohammad Ali Jinnah University, Islamabad, Pakistan;Center of Studies, Research and Research-action Lumiere (CERRAL), IUT-Lumiere, University of Lumiere Lyon 2, Lyon, France

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multi-server scheduling of traffic flows over heterogeneous wireless channels affix fresh concerns of inter-packet delay variations and associated problems of out-of-sequence reception, buffer management complexity, packet drops and re-ordering overhead. In this paper, we have presented an exclusive multi-server scheduling algorithm that is specifically tuned for mobile routers equipped with multiple wireless interfaces and has attained multiple care-of-address registrations with its home agent (HA). The proposed adaptive, Self-clocked, Multi-server (ASM) scheduling algorithm is based on predetermined transmission deadlines for each arrived packet at the mobile router. The mobile flows receive desired service levels in accordance with their negotiated service rates and are only constraint by the cumulative capacity of all active links. The major challenge lies in the handling of asymmetric channels to stitch into a unified virtual channel of higher capacity with reliable service guarantees during mobility. The sorted list of transmission schedules is used to assign physical channels in increasing order of their availability. This approach specifically encapsulates the physical layer disconnections during the handovers and ensures continuous service to ongoing flows. The proposed scheduling scheme is supplemented by an analytical model and simulations to verify its efficacy. The simulation results demonstrate higher degree of reliability and scalability of service provisioning to flows during mobility.