Use of Leftover Service Curve in Admission Control in Ad Hoc Networks

Network calculus approach, with its service curve formalism, proves to be very useful in the analysis of effectiveness of admission control mechanisms and scheduling algorithms used in networks. It enables a transparent coordination of bandwidth assignments, and other resources provided at network nodes. To this end, the so-called ε-effective service curve was devised for ad hoc networks. We show that it is a special kind of the leftover service curve, exploited in the case of presence of cross traffic at nodes. New expressions are derived here. Moreover, the results of simulations for ad hoc networks, carried out with the use of NS3 simulator, are presented. Further, influence of the presence of cross traffic at nodes on servicing the through traffic is analyzed.