Sciweavers

83 search results - page 13 / 17
» Fault-Tolerant Routing Algorithms for Hypercube Networks
Sort
View
MOBIHOC
2008
ACM
15 years 9 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
86
Voted
IPPS
1998
IEEE
15 years 1 months ago
Randomized Routing and PRAM Emulation on Parallel Machines
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
David S. L. Wei
COLCOM
2005
IEEE
15 years 3 months ago
On-demand overlay networking of collaborative applications
We propose a new overlay network, called Generic Identifier Network (GIN), for collaborative nodes to share objects with transactions across affiliated organizations by merging th...
Cheng-Jia Lai, Richard R. Muntz
102
Voted
INFOCOM
2003
IEEE
15 years 2 months ago
Distributed Admission Control to Support Guaranteed Services in Core-Stateless Networks
— The core-stateless service architecture alleviates the scalability problems of the integrated service framework while maintaining its guaranteed service semantics. The admissio...
Sudeept Bhatnagar, B. R. Badrinath
ICPP
1990
IEEE
15 years 1 months ago
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A good solut...
Sunggu Lee, Kang G. Shin