Towards End-to-end Delay Bounds on WMNs Based on Statistical Network Calculus

Abstract

The transmission of data is from the mesh routers to gateway by multi-hop and then to Internet. The gateway where the traffic congregates becomes the bottleneck of the network. End-to-end delay with upper bound is one of guaranteed services, and whether the upper bound can obtain the guarantee is a key to present QoS guarantees, implement routing effectively, congestion control and load balance in WMNs. The fundamentals of network calculus, a set of recent developments which provide a deep insight into flow problems encountered in computer networks, are summarized and refined. As it can calculus the probability of the performance and the statistical bound, the statistical network calculus are applied to analyze WMNs. A practical framework of a mesh node is adopted using a scheme based on buffer queue sharing. The ideal and approximate statistical bounds on end-to-end delay are obtained by statistical network calculus in WMNs, in which mesh nodes are based on the framework. Numerical results show that the delay bound is decreased with the increase of the weight.