Sciweavers

1502 search results - page 35 / 301
» Node weighted scheduling
Sort
View
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 4 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
INFOCOM
2007
IEEE
14 years 4 months ago
G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
Chuanxiong Guo
PERCOM
2003
ACM
14 years 9 months ago
Dynamic Bandwidth Management for Single-Hop Ad Hoc Wireless Networks
Distributed weighted fair scheduling schemes for QoS support in wireless networks have not yet become standard. In this paper we propose an Admission Control and Dynamic Bandwidth...
Samarth H. Shah, Kai Chen, Klara Nahrstedt
SIGMETRICS
2008
ACM
159views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Weighted fair sharing for dynamic virtual clusters
In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support w...
Laura E. Grit, Jeffrey S. Chase
TSP
2010
13 years 4 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat