Sciweavers

1195 search results - page 125 / 239
» On allocations that maximize fairness
Sort
View
INFOCOM
2010
IEEE
14 years 11 months ago
Making the Case for Random Access Scheduling in Wireless Multi-hop Networks
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
Apoorva Jindal, Ann Arbor, Konstantinos Psounis
CONEXT
2008
ACM
15 years 2 months ago
DaVinci: dynamically adaptive virtual networks for a customized internet
Running multiple virtual networks, customized for different performance objectives, is a promising way to support diverse applications over a shared substrate. Despite being simpl...
Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee,...
111
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
Opportunistic Spectrum Access with Multiple Users: Learning under Competition
Abstract—The problem of cooperative allocation among multiple secondary users to maximize cognitive system throughput is considered. The channel availability statistics are initi...
Animashree Anandkumar, Nithin Michael, Ao Tang
85
Voted
ICCCN
2007
IEEE
15 years 7 months ago
Two-Phase Modeling of QoS Routing in Communication Networks
— We propose a precomputation-based scheme which offers Pareto optimal solutions to the network dimensioning problem. This scheme is performed by means of a two-phase procedure. ...
Chia-Hung Wang, Hsing Luh
110
Voted
ISCC
2006
IEEE
15 years 6 months ago
Performance Evaluation of a Basic OFDMA Scheduling Algorithm for Packet Data Transmissions
Currently, the OFDMA transmission scheme seems to be a promising candidate for future broadband radio systems. The crucial part which determines the performance is thereby the com...
Michael Einhaus, Ole Klein