Sciweavers

450 search results - page 14 / 90
» Local Search with Congestion in Complex Communication Networ...
Sort
View
INFOCOM
2007
IEEE
14 years 1 months ago
Low-Complexity Distributed Scheduling Algorithms for Wireless Networks
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
Abhinav Gupta, Xiaojun Lin, R. Srikant
HICSS
2002
IEEE
98views Biometrics» more  HICSS 2002»
14 years 11 days ago
Growth and Propagation of Disturbances in a Communication Network Model
In a society in which information is one of the highest-valued commodities, information networks are the economic backbone. Therefore, network vulnerability is a major hazard. Ana...
David E. Newman, Nathaniel D. Sizemore, Vickie E. ...
SIGMETRICS
2004
ACM
141views Hardware» more  SIGMETRICS 2004»
14 years 25 days ago
Spatio-temporal available bandwidth estimation with STAB
We study the problem of locating in space and over time a network path’s tight link, that is the link with the least available bandwidth on the path. Tight link localization ben...
Vinay J. Ribeiro, Rudolf H. Riedi, Richard G. Bara...
INFOCOM
2006
IEEE
14 years 1 months ago
Complexity of Wavelength Assignment in Optical Network Optimization
— We study the complexity of a spectrum of design problems for optical networks in order to carry a set of demands. Under wavelength division multiplexing (WDM) technology, deman...
Matthew Andrews, Lisa Zhang
MOBIHOC
2012
ACM
11 years 9 months ago
Oblivious low-congestion multicast routing in wireless networks
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
Antonio Carzaniga, Koorosh Khazaei, Fabian Kuhn