Sciweavers

262 search results - page 12 / 53
» Stability bounds in networks with dynamic link capacities
Sort
View
74
Voted
JSAC
2008
116views more  JSAC 2008»
14 years 9 months ago
Stability and Efficiency of Unstructured File Sharing Networks
We propose two unstructured file sharing games, unilateral and bilateral unstructured file sharing games, to study the interaction among self-interested players (users) of unstruct...
Honggang Zhang, Giovanni Neglia, Donald F. Towsley...
72
Voted
IPPS
2006
IEEE
15 years 3 months ago
An adaptive stabilization framework for distributed hash tables
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
Gabriel Ghinita, Yong Meng Teo
90
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
Link State Routing Overhead in Mobile Ad Hoc Networks: A Rate-Distortion Formulation
Abstract— In this paper we use an information-theoretic formulation for characterizing the minimum routing overhead of link state routing in a mobile ad hoc network. We formulate...
Di Wang, Alhussein A. Abouzeid
INFOCOM
2000
IEEE
15 years 2 months ago
Effort-limited Fair (ELF) Scheduling for Wireless Networks
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
David A. Eckhardt, Peter Steenkiste
GLOBECOM
2008
IEEE
15 years 4 months ago
The Flexible, Dynamic Optical Layer: Myths and Realities
— A dynamic optical network that adjusts quickly and automatically to changes in offered traffic load provides performance superior to that of a network of fixed, static optical ...
Joel W. Gannett, George Clapp, Michael E. Rauch