70 search results - page 5 / 14 » On the queue-overflow probabilities of distributed schedulin... |
TMC
2012
11 years 9 months ago
2012
Abstract—In order to achieve data delivery in Delay Tolerant Networks (DTN), researchers have proposed the use of store-carryand-forward protocols: a node there may store a messa...
INFOCOM
2003
IEEE
14 years 22 days ago
2003
IEEE
— Channel-aware scheduling strategies, such as the Proportional Fair algorithm for the CDMA 1xEV-DO system, provide an effective mechanism for improving throughput performance in...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, our contributions are two-fold: First, we enhance the Min-Min and Sufferage heuristics under three risk modes driven by security concerns. Second, we propose a new ...
22
Voted
SIGMETRICS
2006
ACM
14 years 1 months ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
ECRTS
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper investigates resource allocation policies for achieving real-time content distribution with subsecond delay bounds on the current Internet. Resource allocation in real-...