On Upper Bound of the Quality of Service Performance in the Gateway of Wireless Mesh Networks

Article Preview

Abstract:

Motivated by the advantage of the gateway that acts as the performance bottleneck in wireless mesh networks (WMNs) while shaping the traffic with the greedy fractal shaper, a novel approach is proposed to derive the upper stochastic/statistical bound of the backlog, delay and delay jitter of the WMNs gateway quality of service (QoS) statistic bound model. By analyzing and evaluating the QoS performance of the present model based on network calculus theory with fair bandwidth distributed strategy, a number of useful curves are achieved. Simulation shows the performance of the present model.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 403-408)

Pages:

2697-2703

Citation:

Online since:

November 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Ian F. Akyildiz, X.D. Wang. A survey on wireless mesh networks [J]. Communications Magazine, IEEE, 2005, 43(9): 23~30.

Google Scholar

[2] B. Aoun, R. Boutaba, Y. Iraqi, et al. Gateway Placement Optimization in Wireless Mesh Networks With QoS Contraionts[J]. IEEE Journal on Selected Areas in Communications, 2006, 24(11): 2127~2136.

DOI: 10.1109/jsac.2006.881606

Google Scholar

[3] Y. Bejerano. Efficient integration of multihop wireless and wired networks with QoS constraints [J]. Networking, IEEE/ACM Transactions, 2004, 12(6): 1064~1078.

DOI: 10.1109/tnet.2004.838599

Google Scholar

[4] J. Robinson, E.W. Knightly. A Performance Study of Deployment Factors in Wireless Mesh Networks[C]. In: INFCOM 2007. Anchorage, AK, USA. 2007. 2054~(2062).

Google Scholar

[5] T. Liu, W. Liao. Location-Dependent Throughput and Delay in Wireless Mesh Networks [J]. IEEE Transactions on Vehicular Technology, 2007, 57(2): 1188~1198.

DOI: 10.1109/tvt.2007.905389

Google Scholar

[6] N.L.S. Fonseca, G.S. Mayor, C.A.V. Neto. On the equivalent bandwidth of self-similar sources [J]. ACM Transactions on Modeling and Computer Simulation, 2000, 10(2): 104~124.

DOI: 10.1145/364996.365003

Google Scholar

[7] G. Procissi, A. Garg, M. Gerla, et al. Token Bucket Characterization of Long-Range Dependent Traffic [J]. Computer Communication, 2002, 25(11): 1009-1017.

DOI: 10.1016/s0140-3664(02)00015-4

Google Scholar

[8] R. L. Cruz. A calculus for network delay, part I and II [J]. IEEE Transactions on Information Theory, 1991, 37(1): 114~141.

Google Scholar

[9] J. Y. Le boundec, P. Thiran. Network Calculus. London, Britain: Springer Verlag; (2004).

Google Scholar

[10] S. D. Patek, J. Liebeherr, A. Burchard. A calculus for end-to-end statistical service guarantees[R]. Technical Report CS-2001-19, University of Virginia, Department of Computer Science, August (2001).

DOI: 10.1109/tit.2006.880019

Google Scholar

[11] A. K. Parekh, R.G. Gallager. Generalized processor sharing approach to flow control in integrated services networks: the single node case [J]. IEEE Network, 1993, 1(3): 344-357.

DOI: 10.1109/90.234856

Google Scholar