Sciweavers

4781 search results - page 380 / 957
» Online algorithms for network design
Sort
View
COMCOM
2006
96views more  COMCOM 2006»
15 years 7 months ago
An open source traffic engineering toolbox
We present the TOTEM open source Traffic Engineering (TE) toolbox and a set of TE methods that we have designed and/or integrated. These methods cover intra-domain and inter-domai...
Guy Leduc, Henrik Abrahamsson, Simon Balon, Sandfo...
SIGCOMM
2006
ACM
16 years 1 months ago
ROFL: routing on flat labels
It is accepted wisdom that the current Internet architecture conflates network locations and host identities, but there is no agreement on how a future architecture should distin...
Matthew Caesar, Tyson Condie, Jayanthkumar Kannan,...
MOBICOM
2010
ACM
15 years 7 months ago
MIMO rate adaptation in 802.11n wireless networks
This paper studies MIMO based rate adaptation (RA) in 802.11n wireless networks. Our case study shows that existing RA algorithms offer much lower throughput than even a fixed-rat...
Ioannis Pefkianakis, Yun Hu, Starsky H. Y. Wong, H...
INFOCOM
2010
IEEE
15 years 6 months ago
Markov Approximation for Combinatorial Network Optimization
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
Minghua Chen, Soung Chang Liew, Ziyu Shao, Caihong...
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
16 years 12 days ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu