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

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.

[1]  Ion Stoica,et al.  Providing guaranteed services without per flow management , 1999, SIGCOMM '99.

[2]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[3]  Harrick M. Vin,et al.  Determining end-to-end delay bounds in heterogeneous networks , 1995, Multimedia Systems.

[4]  Alok Shriram,et al.  Empirical Evaluation of Techniques for Measuring Available Bandwidth , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[5]  Kameswari Chebrolu,et al.  Bandwidth aggregation for real-time applications in heterogeneous wireless networks , 2006 .

[6]  Rene L. Cruz,et al.  SCED+: efficient management of quality of service guarantees , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[7]  Sherali Zeadally,et al.  Design, implementation, and evaluation of a Programmable Bandwidth Aggregation System for home networks , 2009, J. Netw. Comput. Appl..

[8]  Jui-Tang Wang,et al.  A Mobile Bandwidth-Aggregation Reservation Scheme for NEMOs , 2008, Wirel. Pers. Commun..

[9]  Yuming Jiang.  Relationship between guaranteed rate server and latency rate server , 2003, Comput. Networks.

[10]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1998, TNET.

[11]  Jen-Yi Pan,et al.  Multiple Care-of Addresses Registration and Capacity-Aware Preference on Multi-Rate Wireless Links , 2008, 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008).

[12]  Yuming Jiang,et al.  Analysis of Multi-Server Round Robin scheduling disciplines , 2004 .

[13]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1997, TNET.

[14]  Koushik Kar,et al.  MPLOT: A Transport Protocol Exploiting Multipath Diversity Using Erasure Codes , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[15]  M.A. Qadir,et al.  Towards Dependable wireless networks a QoS constraint resource management scheme in heterogeneous environment , 2008, 2008 4th International Conference on Emerging Technologies.

[16]  Anura P. Jayasumana,et al.  Metrics for packet reordering—A comparative analysis , 2008 .

[17]  George C. Polyzos,et al.  SCED: A Generalized Scheduling Policy for Guarantee* Quality-of-Service , 1999 .

[18]  Lixia Zhang,et al.  Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks , 1990, SIGCOMM.

[19]  Harrick M. Vin,et al.  Core-stateless guaranteed rate scheduling algorithms , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[20]  Charles E. Perkins,et al.  Mobility support in IPv6 , 1996, MobiCom '96.

[21]  Marcelo Bagnulo,et al.  Analysis of Multihoming in Network Mobility Support , 2007, RFC.