Results 11 - 20 of 7,947

Performance comparison of two on-demand routing protocols for ad hoc networks

by Samir R. Das, Charles E. Perkins , Elizabeth M. Royer , 2000
"... Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the performance of two prominent ondemand routing protocols for mobile ad hoc networks — Dynamic Source Routing (DSR) and Ad Ho ..."
Abstract - Cited by 554 (21 self) - Add to MetaCart
Ad hoc networks are characterized by multihop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the performance of two prominent ondemand routing protocols for mobile ad hoc networks — Dynamic Source Routing (DSR) and Ad

A Survey on Position-Based Routing in Mobile Ad-Hoc Networks

by Martin Mauve, Jörg Widmer, Hannes Hartenstein - IEEE Network , 2001
"... We present an overview of ad-hoc routing protocols that make forwarding decisions based on the geographical position of a packet's destination. Other than the destination 's position, each node needs to know only its own position and the position of its one-hop neighbors in order to forwar ..."
Abstract - Cited by 496 (16 self) - Add to MetaCart
to forward packets. Since it is not necessary to maintain explicit routes, position-based routing does scale well even if the network is highly dynamic. This is a major advantage in a mobile ad-hoc network where the topology may change frequently. The main prerequisite for position-based routing is that a

DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks”, in Ad Hoc Networking, edited by Charles E.

by David B Johnson , David A Maltz , Josh Broch - Perkins, Chapter , 2001
"... Abstract The Dynamic Source Routing protocol (DSR) is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes. DSR allows the network to be completely self-organizing and self-configuring, without the need for any existing network ..."
Abstract - Cited by 764 (8 self) - Add to MetaCart
-demand, allowing the routing packet overhead of DSR to scale automatically to only that needed to react to changes in the routes currently in use. We have evaluated the operation of DSR through detailed simulation on a variety of movement and communication patterns, and through implementation and significant

The design and implementation of an intentional naming system

by William Adjie-Winoto, Elliot Schwartz, Hari Balakrishnan, Jeremy Lilley - 17TH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES (SOSP '99) PUBLISHED AS OPERATING SYSTEMS REVIEW, 34(5):186--201, DEC. 1999 , 1999
"... This paper presents the design and implementation of the Intentional Naming System (INS), a resource discovery and service location system for dynamic and mobile networks of devices and computers. Such environments require a naming system that is (i) expressive, to describe and make requests based o ..."
Abstract - Cited by 518 (14 self) - Add to MetaCart
.e., their intent), not where to find things (i.e., not hostnames). INS implements a late binding mechanism that integrates name resolution and message routing, enabling clients to continue communicating with end-nodes even if the name-to-address mappings change while a session is in progress. INS resolvers self

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
, the traffic pattern of the connection, the lack of knowledge of the number of congested gateways, the possibilities of routing changes, or other difficulties in distinguishing propagation delay from persistent queueing delay. The most effective detection of congestion can occur in the gateway itself

Randomized Greedy Hot-Potato Routing

by Costas Busch, Maurice Herlihy, Roger Wattenhofer - In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms , 2000
"... We present a novel greedy hot-potato routing algorithm for the 2-dimensional n × n mesh or torus. This algorithm uses randomization to adjust packet priorities. For any permutation problem or random destination problem, it ensures that each packet reaches its destination in asymptotically ..."
Abstract - Cited by 14 (8 self) - Add to MetaCart
We present a novel greedy hot-potato routing algorithm for the 2-dimensional n × n mesh or torus. This algorithm uses randomization to adjust packet priorities. For any permutation problem or random destination problem, it ensures that each packet reaches its destination in asymptotically

Simple Algorithms for Hot-Potato Routing

by Robert Krauthgamer , 1996
"... Hot-potato routing is a particular form of routing in a synchronous network of processors, which makes no use of buffers at intermediate nodes. Packets must keep moving in the network (possibly deflected to "bad" directions), giving rise to the term "hot-potato". Simple hot-potat ..."
Abstract - Add to MetaCart
Hot-potato routing is a particular form of routing in a synchronous network of processors, which makes no use of buffers at intermediate nodes. Packets must keep moving in the network (possibly deflected to "bad" directions), giving rise to the term "hot-potato". Simple hot-potato

On the Hot-Potato Permutation Routing Algorithm of

by Richard Thomas, Plunkett Antonis Symvonis
"... Borodin, Rabani and Schieber [3] presented an O(n p n)-step algorithm for hot-potato routing of permutations on n n meshes. They conjectured that their algorithm completes the routing of a permutation in O(n) steps. In this paper, we present worst-case partial permutations which force their algorith ..."
Abstract - Add to MetaCart
Borodin, Rabani and Schieber [3] presented an O(n p n)-step algorithm for hot-potato routing of permutations on n n meshes. They conjectured that their algorithm completes the routing of a permutation in O(n) steps. In this paper, we present worst-case partial permutations which force

Hot-Potato Routing on Multi-Dimensional Tori

by Friedhelm Meyer auf der Heide, Matthias Westermann - LECTURE NOTES IN COMPUTER SCIENCE , 1995
"... . We consider the hot-potato routing problem. The striking feature of this form of packet routing is that there are no buffers at the nodes. Thus packets are always moving. A probabilistic hot-potato routing protocol is presented that routes random functions on the (n; d)-torus. If at most d 88 n ..."
Abstract - Cited by 5 (2 self) - Add to MetaCart
. We consider the hot-potato routing problem. The striking feature of this form of packet routing is that there are no buffers at the nodes. Thus packets are always moving. A probabilistic hot-potato routing protocol is presented that routes random functions on the (n; d)-torus. If at most d 88

Hot-Potato Routing Algorithms for Sparse Optical Torus

by Risto Honkanen, Ville Leppänen, Martti Penttonen , 2000
"... In this work we present an optical network architecture and deflection (or hot potato) routing algorithms supporting efficient communication between n processor nodes. The network consists of an n x n torus, where processor nodes are situated diagonally, and routing nodes are optical deflection nod ..."
Abstract - Cited by 6 (4 self) - Add to MetaCart
In this work we present an optical network architecture and deflection (or hot potato) routing algorithms supporting efficient communication between n processor nodes. The network consists of an n x n torus, where processor nodes are situated diagonally, and routing nodes are optical deflection
Results 11 - 20 of 7,947