Αναζήτηση
Αποτελέσματα 31-40 από 242
MNCM: A Critical Node Matching Approach to Scheduling for Input Buffered Switches With No Speedup
(2009)
In this paper, we use fluid model techniques to establish new results for the throughput of input-buffered switches. Dai and Prabhakar have shown that any maximal size matching algorithm with speedup of 2 achieves 100% ...
A fair scheduling policy for wireless channels with intermittent connectivity
(2008)
We consider a system of parallel queues with the constraint that only one queue can be served at a time. Each queue can be served through a wireless channel with intermittent connectivity. We propose a policy which serves ...
Energy-aware base stations: The effect of planning, management, and femto Layers
(2014)
We compare the performance of three base station management schemes on three different network topologies. In addition, we explore the effect of offloading traffic to heterogeneous femtocell layer upon energy savings taking ...
Fair distributed congestion control in multirate multicast networks
(2005)
We study fairness of resource allocation in multirate, multicast networks. In multirate networks, different receivers of the same multicast session can receive service at different rates. We develop a mathematical framework ...
Cross-layer power control in wireless networks
(2006)
We introduce a power control algorithm that exploits queue length information to achieve maximum data throughput in single-hop CDMA wireless networks. The algorithm operates in real-time, i.e., executes a single iteration ...
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. ...
On optimal cooperative route caching in large, memory-limited wireless ad hoc networks
(2004)
Caching is a popular mechanism for enhancing performance in various layers and applications of computer networking. We introduce both a model and algorithms for caching routing information in large, memory-limited wireless ...
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 ...