Sciweavers

162 search results - page 7 / 33
» The Induced Disjoint Paths Problem
Sort
View
ISPAN
2005
IEEE
14 years 1 months ago
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng
DAM
2008
123views more  DAM 2008»
13 years 7 months ago
Polar cographs
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
Tinaz Ekim, Nadimpalli V. R. Mahadev, Dominique de...
CN
2007
154views more  CN 2007»
13 years 7 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
COREGRID
2007
Springer
14 years 1 months ago
Synthetic Coordinates for Disjoint Multipath Routing
We address the problem of routing packets on multiple, router-disjoint, paths in the Internet using large-scale overlay networks. Multipath routing can improve Internet QoS, by rou...
Andrei Agapi, Thilo Kielmann, Henri E. Bal
GLOBECOM
2010
IEEE
13 years 5 months ago
Correlation-Resilient Path Selection in Multi-Path Routing
Multi-path routing is effective to enhance network availability, by selecting multiple failure-independent paths for reaching one destination in the hope to survive individual pat...
Xin Zhang, Adrian Perrig