Download now Free registration required
In this paper, the authors describe and analyze a joint scheduling, routing and congestion control mechanism for wireless networks that asymptotically guarantees stability of the buffers and fair allocation of the network resources. The queue lengths serve as common information to different layers of the network protocol stack. Their main contribution is to prove the asymptotic optimality of a primal-dual congestion controller, which is known to model different versions of TCP well. Consider a set of flows that share the resources of a fixed wireless network. Each flow is described by its source destination node pair, with no a priori established routes.
- Format: PDF
- Size: 281.6 KB