Results 1 - 10 of 3,851

Randomized Routing With Shorter Paths

by Eli Upfal , Sergio Feleprin, Marc Snir - PROC. 5TH ACM SYMP. PARALLEL , 1993
"... We study in this paper the use of randomized routing in multistage networks. While log N additional randomizing stages are needed to break "spatial locality", within each permutation, only log log N additional randomizing stages are needed to break "temporal locality " among ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
We study in this paper the use of randomized routing in multistage networks. While log N additional randomizing stages are needed to break "spatial locality", within each permutation, only log log N additional randomizing stages are needed to break "temporal locality " among

Randomized Routing on Fat-Trees

by Ronald I. Greenberg, Charles E. Leiserson - Advances in Computing Research , 1996
"... Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the ..."
Abstract - Cited by 51 (10 self) - Add to MetaCart
Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound

Random Routing in Tech Nets

by Sid C-k Chau, Sid C-k Chau, Sid C-k Chau
"... Suppose you are in charge of transportation. What do you do to reduce congestion? – Congestion is caused by traffic demand exceeding the capacity of transport resource – To build more roads (to increase capacity)? – To raise toll (to reduce demand)? – Or to optimize the traffic routes and schedules ..."
Abstract - Add to MetaCart
(from algorithmic design)? Here is a radical idea – “random routing”: 1. A passenger wants to travel from a source to a destination 2. Take a passenger from the source to a “random ” location 3. Then take the passenger from the “random ” location to the destination Does this reduce congestion

Random Early Detection Gateways for Congestion Avoidance.

by Sally Floyd , Van Jacobson - IEEELACM Transactions on Networking, , 1993
"... Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gatewa ..."
Abstract - Cited by 2716 (31 self) - Add to MetaCart
Abstract-This paper presents Random Early Detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving

Random Waypoint Considered Harmful

by Jungkeun Yoon, Mingyan Liu, Brian Noble , 2003
"... This study examines the random waypoint model widely used in the simulation studies of mobile ad hoc networks. Our findings show that this model fails to provide a steady state in that the average nodal speed consistently decreases over time, and therefore should not be directly used for simulation. ..."
Abstract - Cited by 471 (2 self) - Add to MetaCart
. We show how unreliable results can be obtained by using this model. In particular, certain ad hoc routing metrics can drop by as much as 40% over the course of a 900-second simulation using the random waypoint model. We give both an intuitive and a formal explanation for this phenomenon. We also

Regular Article Selection Errors of Random Route

by Johannes J. Bauer
"... Random route samples are widely used in face-to-face surveys. Most previ-ous studies of random route sample quality compare the data collected by random route samples with data from reliable sources, such as the German Microcensus. While these studies usually find few differences in the distribu-tio ..."
Abstract - Add to MetaCart
Random route samples are widely used in face-to-face surveys. Most previ-ous studies of random route sample quality compare the data collected by random route samples with data from reliable sources, such as the German Microcensus. While these studies usually find few differences in the distribu

Energy-efficient communication protocol for wireless microsensor networks

by Wendi Rabiner Heinzelman, Anantha Chandrakasan, Hari Balakrishnan , 2000
"... Wireless distributed microsensor systems will enable the reliable monitoring of a variety of environments for both civil and military applications. In this paper, we look at communication protocols, which can have significant impact on the overall energy dissipation of these networks. Based on our f ..."
Abstract - Cited by 2103 (10 self) - Add to MetaCart
findings that the conventional protocols of direct transmission, minimum-transmission-energy, multihop routing, and static clustering may not be optimal for sensor networks, we propose LEACH (Low-Energy Adaptive Clustering Hierarchy), a clustering-based protocol that utilizes randomized rotation of local

Range-Free Localization Schemes for Large Scale Sensor Networks

by Tian He, Chengdu Huang, Brain M. Blum, John A. Stankovic, Tarek Abdelzaher , 2003
"... Wireless Sensor Networks have been proposed for a multitude of location-dependent applications. For such systems, the cost and limitations of hardware on sensing nodes prevent the use of range-based localization schemes that depend on absolute point-to-point distance estimates. Because coarse accura ..."
Abstract - Cited by 525 (8 self) - Add to MetaCart
performs best when an irregular radio pattern and random node placement are considered, and low communication overhead is desired. We compare our work via extensive simulation, with three state-of-the-art range-free localization schemes to identify the preferable system configurations of each. In addition

Routing indices for peer-to-peer systems

by Arturo Crespo, Hector Garcia-molina , 2002
"... Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or ooding the network with queries. In this paper we introduce the concept of Routing Indices (RIs), which allow nodes to forward queries to neighbors that are more likely to have answers. I ..."
Abstract - Cited by 423 (15 self) - Add to MetaCart
routing indices. We evaluate their performance via simulations, and nd that RIs can improve performance by one or two orders of magnitude vs. a ooding-based system, and by up to 100 % vs. a random forwarding system. We also discuss the tradeo s between the di erent RIschemes and highlight the e ects

Randomized routing and sorting on fixed-connection networks

by F. T. Leighton, Bruce M. Maggs, Abhiram G. Ranade, Satish B. Rao - JOURNAL OF ALGORITHMS , 1994
"... This paper presents a general paradigm for the design of packet routing algorithms for fixed-connection networks. Its basis is a randomized on-line algorithm for scheduling any set of N packets whose paths have congestion c on any bounded-degree leveled network with depth L in O(c + L + log N) steps ..."
Abstract - Cited by 86 (13 self) - Add to MetaCart
This paper presents a general paradigm for the design of packet routing algorithms for fixed-connection networks. Its basis is a randomized on-line algorithm for scheduling any set of N packets whose paths have congestion c on any bounded-degree leveled network with depth L in O(c + L + log N
Results 1 - 10 of 3,851