Sciweavers

32 search results - page 1 / 7
» An Efficient Construction of Node Disjoint Paths in OTIS Net...
Sort
View
APPT
2007
Springer
13 years 11 months ago
An Efficient Construction of Node Disjoint Paths in OTIS Networks
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
Weidong Chen, Wenjun Xiao, Behrooz Parhami
GLOBECOM
2006
IEEE
13 years 11 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, ...
ISCAPDCS
2007
13 years 6 months ago
A Node-to-set cluster-fault-tolerant disjoint routing algorithm in pancake graphs
With rapid increase of parallel computation systems in their sizes, it is inevitable to develop algorithms that are applicable even if there exist faulty elements in the systems. ...
Tatsuro Watanabe, Keiichi Kaneko, Shietung Peng
CN
2007
154views more  CN 2007»
13 years 5 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,...
JCT
1998
99views more  JCT 1998»
13 years 4 months ago
From Hall's Matching Theorem to Optimal Routing on Hypercubes
We introduce a concept of so-called disjoint ordering for any collection of finite sets. It can be viewed as a generalization of a system of distinctive representatives for the s...
Shuhong Gao, Beth Novick, Ke Qiu