Sciweavers

12 search results - page 1 / 3
» Path Decomposition Under a New Cost Measure with Application...
Sort
View
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
13 years 9 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
TPDS
2002
126views more  TPDS 2002»
13 years 3 months ago
P-3PC: A Point-to-Point Communication Model for Automatic and Optimal Decomposition of Regular Domain Problems
One of the most fundamental problems automatic parallelization tools are confronted with is to find an optimal domain decomposition for a given application. For regular domain prob...
Frank J. Seinstra, Dennis Koelma
PEWASUN
2006
ACM
13 years 9 months ago
Wave propagation using the photon path map
In wireless network planning, much effort is spent on the improvement of the network and transport layer – especially for Mobile Ad Hoc Networks. Although in principle realworl...
Arne Schmitz, Leif Kobbelt
CCGRID
2006
IEEE
13 years 9 months ago
Correlating Topology and Path Characteristics of Overlay Networks and the Internet
Real-world IP applications such as Peer-to-Peer filesharing are now able to benefit from network and location awareness. It is therefore crucial to understand the relation betwe...
Alexandru Iosup, Pawel Garbacki, Johan A. Pouwelse...
FOCS
2007
IEEE
13 years 10 months ago
Buy-at-Bulk Network Design with Protection
We consider approximation algorithms for buy-at-bulk network design, with the additional constraint that demand pairs be protected against edge or node failures in the network. In...
Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce...