Sciweavers

2076 search results - page 78 / 416
» Universal Routing in Distributed Networks
Sort
View
ISPAN
1999
IEEE
14 years 2 months ago
Complete Exchange Algorithms in Wormhole-Routed Torus Networks: A Divide-and-Conquer Strategy
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approac...
Si-Gwan Kim, Seung Ryoul Maeng, Jung Wan Cho
ANCS
2006
ACM
14 years 4 months ago
A practical fast parallel routing architecture for Clos networks
Clos networks are an important class of switching networks due to their modular structure and much lower cost compared with crossbars. For routing I/O permutations of Clos network...
Si-Qing Zheng, Ashwin Gumaste, Enyue Lu
IPSN
2004
Springer
14 years 3 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
IPPS
2000
IEEE
14 years 2 months ago
Network Survivability Simulation of a Commercially Deployed Dynamic Routing System Protocol
With the ever-increasing demands on server applications, many new server services are distributed in nature. We evaluated one hundred deployed systems and found that over a one-yea...
Abdur Chowdhury, Ophir Frieder, Paul Luse, Peng-Ju...
DIALM
1999
ACM
98views Algorithms» more  DIALM 1999»
14 years 2 months ago
Routing with guaranteed delivery in ad hoc wireless networks
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge...