Sciweavers

243 search results - page 38 / 49
» DARD: Distributed Adaptive Routing for Datacenter Networks
Sort
View
INFOCOM
2007
IEEE
15 years 3 months ago
DEFT: Distributed Exponentially-Weighted Flow Splitting
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
Dahai Xu, Mung Chiang, Jennifer Rexford
ICDCS
2007
IEEE
15 years 3 months ago
Temporal Privacy in Wireless Sensor Networks
Although the content of sensor messages describing “events of interest” may be encrypted to provide confidentiality, the context surrounding these events may also be sensitiv...
Pandurang Kamat, Wenyuan Xu, Wade Trappe, Yanyong ...
ICDCS
1999
IEEE
15 years 1 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
IMC
2010
ACM
14 years 7 months ago
Measurement and analysis of real-world 802.11 mesh networks
Despite many years of work in wireless mesh networks built using 802.11 radios, the performance and behavior of these networks in the wild is not well-understood. This lack of und...
Katrina LaCurts, Hari Balakrishnan
83
Voted
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 3 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking