Sciweavers

1388 search results - page 23 / 278
» Approximability of Robust Network Design
Sort
View
113
Voted
BROADNETS
2007
IEEE
15 years 9 months ago
Joint monitoring and routing in wireless sensor networks using robust identifying codes
Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their ons present challenges to fundamental network services such as routing. In t...
Moshe Laifenfeld, Ari Trachtenberg, Reuven Cohen, ...
123
Voted
IPSN
2004
Springer
15 years 8 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
117
Voted
ASPDAC
2007
ACM
121views Hardware» more  ASPDAC 2007»
15 years 6 months ago
Approximation Algorithm for Process Mapping on Network Processor Architectures
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
Christopher Ostler, Karam S. Chatha, Goran Konjevo...
139
Voted
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 8 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
127
Voted
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
16 years 3 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi