Sciweavers

14 search results - page 1 / 3
» Constructing Pairwise Disjoint Paths with Few Links
Sort
View
WADS
1997
Springer
74views Algorithms» more  WADS 1997»
14 years 3 months ago
Constructing Pairwise Disjoint Paths with Few Links
Himanshu Gupta, Rephael Wenger
ICCCN
2007
IEEE
14 years 5 months ago
Enhancing Robustness Under Dual-Link Failures
—In this paper, we show that minimizing the product of path lengths results in minimizing the probability of connection failure between a source and destination given two links h...
Sandeep Kour Ahuja, Srinivasan Ramasubramanian
CN
2007
154views more  CN 2007»
13 years 11 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,...
GLOBECOM
2006
IEEE
14 years 5 months ago
Disjoint Multipath Routing in Dual Homing Networks using Colored Trees
Abstract— Wireless sensor networks (WSNs) employed in monitoring applications require data collected by the sensors to be deposited at specific nodes, referred to as drains. To ...
Preetha Thulasiraman, Srinivasan Ramasubramanian, ...
JNCA
2007
106views more  JNCA 2007»
13 years 11 months ago
Relay reduction and disjoint routes construction for scatternet over Bluetooth radio system
Bluetooth is a new technology for low-cost, low-power, and short-range wireless communication. By constructing a piconet, Bluetooth device establishes link and communicates with o...
Gwo-Jong Yu, Chih-Yung Chang, Kuei-Ping Shih, Shih...