Sciweavers

1195 search results - page 21 / 239
» On allocations that maximize fairness
Sort
View
ICDCS
2009
IEEE
14 years 6 months ago
On the Impossibility of Maximal Scheduling for Strong Fairness with Interleaving
A strongly fair schedule is one in which tasks that are enabled infinitely often are also executed infinitely often. When tasks execute atomically, a strongly fair scheduler can...
Matthew Lang, Paolo A. G. Sivilotti
WIOPT
2006
IEEE
14 years 3 months ago
Fairness and throughput guarantees with maximal scheduling in multi-hop wireless networks
Abstract— We investigate the fairness and throughput properties of a simple distributed scheduling policy, maximal scheduling, in the context of a general ad-hoc wireless network...
Saswati Sarkar, Prasanna Chaporkar, Koushik Kar
INFOCOM
2012
IEEE
11 years 11 months ago
Maximizing throughput when achieving time fairness in multi-rate wireless LANs
Abstract—This paper focuses on designing a distributed medium access control algorithm that aims at achieving time fairness among contending stations and throughput maximization ...
Yuan Le, Liran Ma, Wei Cheng, Xiuzhen Cheng, Biao ...
PIMRC
2008
IEEE
14 years 3 months ago
Joint routing and scheduling for maximizing fair throughput in WiMAX mesh network
—WiMAX mesh mode, recently standardized, enables direct communications between subscriber stations without referring to the base station (BS). It can be a great solution for prov...
Salim Nahle, Naceur Malouch