Load balancing with fair scheduling for multiclass priority traffic in wireless mesh networks

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Wireless Mesh Networks (WMNs) are emerging as a key technology for providing cost effective, resilient and adaptive services for the next generation networks. WMNs provide a number of applications to end users such as Video on demand (VoD), Voice over IP (VoIP), high speed internet access, video conferencing etc. To provide Quality of Service (QoS) to these applications, load balancing and fair scheduling are important metrics. In this paper, we propose a novel strict priority based fair load balancing (SPFLB) algorithm for multi class priority traffic in WMNs. The available capacity (AC) and Load Index (LI) of the link is calculated and based upon these values cost evaluation function (CEF) is defined. The performance of the proposed algorithm is evaluated using simulations on ns-2 with respect to various metrics. The results obtained show that the proposed algorithm is quite effective for balancing the load of multiclass traffic flows. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Kumar, N., Chilamkurti, N., Park, J. H., & Park, D. S. (2011). Load balancing with fair scheduling for multiclass priority traffic in wireless mesh networks. In Communications in Computer and Information Science (Vol. 184 CCIS, pp. 101–109). https://doi.org/10.1007/978-3-642-22333-4_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free