2076 search results - page 98 / 416 » Universal Routing in Distributed Networks |
IPPS
1999
IEEE
14 years 2 months ago
1999
IEEE
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
IPPS
1997
IEEE
14 years 2 months ago
1997
IEEE
This paper addresses the one-to-all broadcasting problem, and the one-to-many broadcasting problem, usually simply called broadcasting and multicasting, respectively. Inthispaper,...
PDCAT
2005
Springer
14 years 3 months ago
2005
Springer
This paper considers the on-line traffic grooming problem in WDM-TDM switched optical mesh networks without wavelength conversion capability. The objective is to efficiently rou...
IPPS
2003
IEEE
14 years 3 months ago
2003
IEEE
This work presents a new switching mechanism to tolerate arbitrary faults in interconnection networks with a negligible implementation cost. Although our routing technique can be ...
SIAMAM
2010
13 years 8 months ago
2010
We address the stochastic characteristics of a recently-proposed greedy routing scheme. The stochastic behaviour of individual hop advancements is examined to observe the overall ...