Sciweavers

473 search results - page 72 / 95
» Early-release fair scheduling
Sort
View
ICUMT
2009
13 years 6 months ago
Adaptive resource control in 2-hop ad-hoc networks
This paper presents a simple resource control mechanism with traffic scheduling for 2-hop ad-hoc networks, in which the Request-To-Send (RTS) packet is utilized to deliver feedback...
Yimeng Yang, Geert J. Heijenk, Boudewijn R. Haverk...
SIGMETRICS
2004
ACM
124views Hardware» more  SIGMETRICS 2004»
14 years 2 months ago
Interposed proportional sharing for a storage service utility
This paper develops and evaluates new share-based scheduling algorithms for differentiated service quality in network services, such as network storage servers. This form of resou...
Wei Jin, Jeffrey S. Chase, Jasleen Kaur
WADS
1997
Springer
89views Algorithms» more  WADS 1997»
14 years 1 months ago
Intractability of Assembly Sequencing: Unit Disks in the Plane
We consider the problem of removing a given disk from a collection of unit disks in the plane. At each step, we allow a disk to be removed by a collision-free translation to infin...
Michael H. Goldwasser, Rajeev Motwani
INFOCOM
2005
IEEE
14 years 2 months ago
Optimal utility based multi-user throughput allocation subject to throughput constraints
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
Matthew Andrews, Lijun Qian, Alexander L. Stolyar
IWDC
2001
Springer
101views Communications» more  IWDC 2001»
14 years 1 months ago
Resource Stealing in Endpoint Controlled Multi-class Networks
Abstract. Endpoint admission control is a mechanism for achieving scalable services by pushing quality-of-service functionality to end hosts. In particular, hosts probe the network...
Susana Sargento, Rui Valadas, Edward W. Knightly