Skip to main content
SpringerLink
Log in

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

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ng, C., Ernst, T., Paik, E., & Bagnulo, M. (2007). Analysis of multi-homing in network mobility support. RFC 4980.

  2. Kameswari, C., & Ramesh, R.R. (2006). Bandwidth aggregation for real-time applications in heterogeneous wireless networks, IEEE Transaction on Mobile Computing, 5(4).

  3. Kim, P., & Han, H. (2009). A packet distribution scheme for bandwidth aggregation on network mobility. Internet Draft.

  4. Huang T. et al (2009) Design, implementation, and evaluation of a programmable bandwidth aggregation system for home networks. Published in Journal of Network and Computer Applications 32(3): 741–759

    Google Scholar 

  5. Piratla N. M., Jayasumana A. P. (2008) Metrics of packet reorder—A comparative analysis. Published in International Journal of Communication Systems 21(1): 99–113

    Article  Google Scholar 

  6. Wang J. et al (2008) A mobile bandwidth-aggregation reservation scheme for NEMOs. Wireless Personal Communications 44: 383–401

    Article  Google Scholar 

  7. Abhay K. Parekh, Robert G. Gallager (1993) A generalized processor sharing approach to flow control in integrated services networks: The single node case. IEEE/ACM Transactions on Networking, 1(3): 344–357

    Article  Google Scholar 

  8. Abhay K. Parekh, Robert G. Gallager (1994) A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. IEEE/ACM Transactions on Networking 2(2): 137–150

    Article  Google Scholar 

  9. Jiang Y. (1998) Relationship between guaranteed rate server and latency rate server. Computer Networks 43(5): 611–624

    Google Scholar 

  10. Sariowan H. et al (1999) SCED: A generalized scheduling policy for guaranteeing Quality-of-Service. IEEE/ACM Trans. Networking 7(5): 669–684

    Article  Google Scholar 

  11. Cruz, R. L. (1998). SCED+: Efficient management of quality of service guarantees. In Proceedings of INFOCOM’98.

  12. Jon C.R.B., Zhang H. (1996) Hierarchical packet fair queuing algorithms. IEEE/ACM Transactions on Networking 5(5): 675–689 Oct 1997. Also in Proceedings of SIGCOMM’96

    Google Scholar 

  13. Stiliadis D., Varma A. (1998) Latency-rate servers: A general model for analysis of traffic scheduling algorithms. IEEE/ACM Trains on Networking 6(5): 611–624

    Article  Google Scholar 

  14. Kaur, J., & Vin, H. M. (2001). Core-stateless guaranteed rate scheduling algorithms. In Proceedings of IEEE INFOCOM, (pp. 1484–1492).

  15. Zhang, L. (1990). Virtual clock: A new traffic control algorithm for packet switching networks. In SIGCOMM Symposium on Communications Architectures and Protocols, (pp. 19–29). Philadelphia, PA.

  16. Stoica, I., & Zhang, H. (1999). Providing guaranteed service without per flow management. In Proceedings of ACM SIGCOMM.

  17. Blake, S., et al. (1998)An architecture of differentiated services. In IETF RFC 2475.

  18. Goyal, P., et al. (1996). Determining end-to-end delay bounds in heterogeneous networks. ACM/Springer-Verlog Multimedia System Journal, 157–163.

  19. Xiao, H., & Jiang, Y. (2004). Analysis of multi-server round Robin scheduling disciplines. IEICE Transactions on Communications, E87-B(12), 3593–3602.

  20. Jen-Yi, P., Jing-Luen, L., & Kai-Fung, P. (2008). Multiple care-of addresses registration and capacity-aware preference on multi-rate wireless links. In AINAW, 22nd International Conference on Advanced Information Networking and Applications—Workshops (pp.768–773).

  21. Johnson, D., Perkins, C., & Arkko, J. (2004). Mobility support in IPv6. RFC 3775.

  22. Ahmad, S. Z., Akbar, M. S., & Qadir, M. A. (2008). Towards dependable wireless networks a QoS constraint resource management scheme in heterogeneous environment. In 4th International Conference on Emerging Technologies, (ICET) 2008. (pp. 182–186).

  23. Shriram, A., & Kaur, J. (2007). Empirical evaluation of techniques for measuring available bandwidth. In Proceedings of IEEE INFOCOM, 2007, (pp. 2161–2169).

  24. IEEE 802.21 Working Group Document. (2009). IEEE Standard for local and metropolitan area networks: Media independent handover services, IEEE P802.21/D07.00.

  25. Sharma, V., Kalyanaraman, S., Kar, K., Ramakrishnan, K.K., & Subramanian, V. (2008). MPLOT: A transport protocol exploiting multipath diversity using erasure codes. In Proceedings of 27th IEEE Conference on Computer Communications. (INFOCOM).

Download references

Author information

Authors and Affiliations

  1. Center of Distributed and Semantic Computing, Mohammad Ali Jinnah University, Islamabad campus, Islamabad, Pakistan

    Syed Zubair Ahmad, Muhammad Abdul Qadir & Muhammad Saeed Akbar

  2. Center of Studies, Research and Research-action Lumiere (CERRAL), IUT-Lumiere, University of Lumiere Lyon 2, Lyon, France

    Abdelaziz Bouras

Authors
  1. Syed Zubair Ahmad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Muhammad Abdul Qadir
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Muhammad Saeed Akbar
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Abdelaziz Bouras
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Syed Zubair Ahmad.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ahmad, S.Z., Qadir, M.A., Akbar, M.S. et al. Analysis of Multi-Server Scheduling Paradigm for Service Guarantees during Network Mobility. Wireless Pers Commun 63, 177–197 (2012). https://doi.org/10.1007/s11277-010-0114-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-010-0114-5

Keywords

Search

Navigation