Quality of Service Provisioning in Wireless Networks

Thursday, August 9, 2001 - 2:00pm - 2:20pm
Keller 3-180
Leandros Tassiulas (University of Maryland)
Scheduling algorithms that provide guaranteed service rates in wireless ad-hoc networks will be presented in this talk. Providing quality of service guarantees is a goal that attracted a lot of efforts over the last decade. Starting with fair-queueing, a wide variety of switch scheduling algorithms were proposed that can support quite stringent quality of service requirements in wireline networks. Little has been done in this respect in wireless networks. The interdependence of different links at the access layer in combination with mobility makes the problem fairly challenging and the available results are mostly on stability guarantees. An algorithm for providing rate guarantees in a wireless ad-hoc network will be presented here. The algorithm is a combination of a fair-queueing like token allocation mechanism at the node level and a matching selection algorithm at the link level. The algorithm guarantees max-min fairness in rate allocation at the network level irrespectively of the traffic load of the diffreent flows. When the flows have unequal priorities, different operating regimes can be achieved by appopriate selection of a set of weights.

(Joint work with S. Sarkar).