Sciweavers

83 search results - page 14 / 17
» Fault-Tolerant Routing Algorithms for Hypercube Networks
Sort
View
JCP
2008
162views more  JCP 2008»
13 years 7 months ago
A Hypercube-based Scalable Interconnection Network for Massively Parallel Computing
An important issues in the design of interconnection networks for massively parallel computers is scalability. A new scalable interconnection network topology, called Double-Loop H...
Youyao Liu, Jungang Han, Huimin Du
ACSAC
2007
IEEE
14 years 2 months ago
Countering False Accusations and Collusion in the Detection of In-Band Wormholes
Cooperative intrusion detection techniques for MANETs utilize ordinary computing hosts as network intrusion sensors. If compromised, these hosts may inject bogus data into the int...
Daniel Sterne, Geoffrey Lawler, Richard Gopaul, Br...
SPAA
1994
ACM
13 years 11 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
IPPS
1998
IEEE
13 years 12 months ago
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
Torsten Suel
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
13 years 11 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham