Sciweavers

1212 search results - page 40 / 243
» Fairness in Peer-to-Peer Networks
Sort
View
INFOCOM
2006
IEEE
14 years 4 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely
TIT
2008
119views more  TIT 2008»
13 years 10 months ago
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
Prasanna Chaporkar, Koushik Kar, Xiang Luo, Saswat...
INFOCOM
2009
IEEE
14 years 4 months ago
Fair Routing in Delay Tolerant Networks
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
Josep M. Pujol, Alberto Lopez Toledo, Pablo Rodrig...
IOR
2007
89views more  IOR 2007»
13 years 10 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
MACOM
2010
13 years 8 months ago
Static Inter-Cell Interference Coordination Techniques for LTE Networks: A Fair Performance Assessment
Abstract. This paper focuses in the analysis of 100% static and distributed inter-cell interference coordination techniques in the context of LTE networks. Several methods have bee...
David González González, Mario Garc&...