Sciweavers

306 search results - page 10 / 62
» Routing Algorithms for Anycast Messages
Sort
View
WDAG
2009
Springer
114views Algorithms» more  WDAG 2009»
15 years 6 months ago
Virtual Ring Routing Trends
Virtual Ring Routing (VRR) schemes were introduced in the context of wireless ad hoc networks and Internet anycast overlays. They build a network-routing layer using ideas from dis...
Dahlia Malkhi, Siddhartha Sen, Kunal Talwar, Renat...
IPPS
1999
IEEE
15 years 4 months ago
Oblivious Deadlock-Free Routing in a Faulty Hypercube
A central problem in massively parallel computing is efficiently routing data between processors. This problem is complicated by two considerations. First, in any massively parall...
Jin Suk Kim, Eric Lehman, Frank Thomson Leighton
TPDS
1998
78views more  TPDS 1998»
14 years 11 months ago
Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms
—We show that deadlocks due to dependencies on consumption channels are a fundamental problem in wormhole multicast routing. This type of resource deadlocks has not been addresse...
Rajendra V. Boppana, Suresh Chalasani, C. S. Ragha...
IPPS
1997
IEEE
15 years 3 months ago
Adaptive Fault-Tolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection
In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. ...
Jau-Der Shih
IAJIT
2007
146views more  IAJIT 2007»
14 years 11 months ago
Adaptive Optimizing of Hello Messages in Wireless Ad-Hoc Networks
: Routing is an important functional aspect in wireless ad-hoc networks that handles discovering and maintaining the paths between nodes within a network. Due to nodes mobility, th...
Essam Natsheh, Adznan B. Jantan, Sabira Khatun, Su...