Enhanced QoS Multicast Routing in Wireless Mesh Networks

Wireless mesh network (WMN) has recently emerged as a promising technology for next-generation wireless networking. In WMNs, many important applications, such as mobile TV and video/audio conferencing, require the support of multicast communication with quality-of-service (QoS) guarantee. In this paper, we address the QoS multicast routing issue in WMNs. Specifically, we propose a novel network graph preprocessing approach to enable traffic engineering and enhance the performance of QoS multicast routing algorithms. In this approach, we employ prioritized admission control scheme and develop a utility-constrained optimal priority gain policy. Extensive simulation results show that our approach can significantly improve the performance of QoS multicast routing in WMNs.

[1]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[2]  Dapeng Wu,et al.  Effective capacity: a wireless link model for support of quality of service , 2003, IEEE Trans. Wirel. Commun..

[3]  Acee Lindem,et al.  Traffic Engineering Extensions to OSPF Version 3 , 2008, RFC.

[4]  Raj Acharya,et al.  Steady state distribution for stochastic knapsack with bursty arrivals , 2005, IEEE Communications Letters.

[5]  Joseph Naor,et al.  Resource optimization in QoS multicast routing of real-time multimedia , 2004, IEEE/ACM Transactions on Networking.

[6]  Chang-Jung Kao,et al.  Source filtering in IP multicast routing , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[7]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

[8]  Mikkel Thorup,et al.  Traffic engineering with traditional IP routing protocols , 2002, IEEE Commun. Mag..

[9]  Bin Wang,et al.  Multicast routing and its QoS extension: problems, algorithms, and protocols , 2000 .

[10]  Bin Yu,et al.  A fast lightweight approach to origin-destination IP traffic estimation using partial measurements , 2006, IEEE Transactions on Information Theory.

[11]  Zvi Rosberg,et al.  A restricted complete sharing policy for a stochastic knapsack problem in B-ISDN , 1994, IEEE Trans. Commun..

[12]  E. Lerzan Örmeci,et al.  Dynamic admission control in a call center with one shared and two dedicated service facilities , 2004, IEEE Transactions on Automatic Control.

[13]  Jan Vondrák,et al.  Approximating the stochastic knapsack problem: the benefit of adaptivity , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[14]  Ronaldo M. Salles,et al.  Proportional differentiated admission control , 2004, IEEE Communications Letters.

[15]  Tibor Cinkler,et al.  Practical OSPF traffic engineering , 2004, IEEE Communications Letters.

[16]  Weihua Zhuang,et al.  Differentiated services for wireless mesh backbone , 2006, IEEE Communications Magazine.

[17]  David D. Yao,et al.  Monotonicity properties for the stochastic knapsack , 1990, IEEE Trans. Inf. Theory.

[18]  K. K. Phang,et al.  Traffic engineering enhancement to QoS-OSPF in DiffServ and MPLS networks , 2004 .

[19]  Fang Zhao,et al.  Minimum-cost multicast over coded packet networks , 2005, IEEE Transactions on Information Theory.

[20]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[21]  Yong Pei,et al.  On the capacity improvement of ad hoc wireless networks using directional antennas , 2003, MobiHoc '03.

[22]  S. Kay.  Fundamentals of statistical signal processing: estimation theory , 1993 .

[23]  Guoliang Xue,et al.  Minimum-cost QoS multicast and unicast routing in communication networks , 2003, IEEE Trans. Commun..

[24]  Xueyan Song,et al.  On Finding Feasible Solutions for the Delay Constrained Group Multicast Routing Problem , 2002, IEEE Trans. Computers.

[25]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2005, IEEE/ACM Transactions on Networking.

[26]  George N. Rouskas,et al.  Multicast Routing with End-to-End Delay and Delay Variation Constraints , 1997, IEEE J. Sel. Areas Commun..

[27]  Ian F. Akyildiz,et al.  A survey on wireless mesh networks , 2005, IEEE Communications Magazine.

[28]  R. Wolff,et al.  On the convexity of loss probabilities , 2002, Journal of Applied Probability.

[29]  Tzi-cker Chiueh,et al.  Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[30]  D. Jagerman.  Some properties of the erlang loss function , 1974 .

[31]  Fang Hao,et al.  Fast, memory-efficient traffic estimation by coincidence counting , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[32]  Keith W. Ross,et al.  The stochastic knapsack problem , 1989, IEEE Trans. Commun..

[33]  Mikkel Thorup,et al.  Optimizing OSPF/IS-IS weights in a changing world , 2002, IEEE J. Sel. Areas Commun..

[34]  Arne Jensen,et al.  Moe's Principle , 1951 .

[35]  Xiaohua Jia,et al.  A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks , 1998, TNET.

[36]  Eitan Altman,et al.  On optimal call admission control in resource-sharing system , 2001, IEEE Trans. Commun..

[37]  Azer Bestavros,et al.  A load profiling approach to routing guaranteed bandwidth flows , 1997, 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.

[38]  Imrich Chlamtac,et al.  A survey of quality of service in IEEE 802.11 networks , 2004, IEEE Wirel. Commun..