Αναζήτηση
Αποτελέσματα 1-5 από 5
Distributed on-line schedule adaptation for balanced slot allocation in wireless ad hoc networks
(2004)
We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes. The primary objective is to derive a distributed ...
End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks
(2003)
Sharing the locally common spectrum among the links of the same vicinity is a fundamental problem in wire-less ad-hoc networks. Lately some scheduling approaches have been proposed that guarantee fair share of the bandwidth ...
End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks
(2005)
Sharing the common spectrum among the links in a vicinity is a fundamental problem in wireless ad-hoc networks. Lately, some scheduling approaches have been proposed that guarantee fair share of bandwidth among the links. ...
Layered multicast rate control based on lagrangian relaxation and dynamic programming
(2004)
In this paper, we address the rate control problem for layered multicast traffic, with the objective of solving a generalized throughput/fairness objective. Our approach is based on a combination of lagrangian relaxation ...
Scheduling Algorithms for Optical Packet Fabrics
(2003)
Utilizing optical technologies to build packet fabrics for high-capacity switches and routers has several advantages in terms of scalability, power consumption, and cost. However, several technology related problems have ...