ICNP
1999
IEEE
13 years 11 months ago
1999
IEEE
A number of QoS routing algorithms have been proposed to address the dual objective of selecting feasible paths through the network with enough resources to satisfy a connections&...
SIGCOMM
1999
ACM
13 years 11 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
MOBICOM
1999
ACM
13 years 11 months ago
1999
ACM
Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in ...
ISPD
1999
ACM
13 years 11 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
DIALM
1999
ACM
13 years 11 months ago
1999
ACM
—In this paper, we study the performance of route query control mechanisms for the Zone Routing Protocol (ZRP) for ad hoc networks. ZRP proactively maintains routing information ...
ASPDAC
1999
ACM
13 years 11 months ago
1999
ACM
This paper presents a performance-driven I/O pin routing algorithm with special consideration of wire uniformity. First, a topological routing based on min-cost max-flow algorith...
SIGCOMM
2000
ACM
13 years 11 months ago
2000
ACM
Current routing protocols are monolithic, specifying the algorithm used to construct forwarding tables, the metric used by the algorithm (generally some form of hop-count), and th...
MOBIHOC
2000
ACM
13 years 11 months ago
2000
ACM
— This paper presents an alternative simple loop-free bandwidth-efficient distributed routing algorithm for mobile ad hoc networks, denoted as distributed dynamic routing (DDR)....
MOBIHOC
2000
ACM
13 years 11 months ago
2000
ACM
– In this paper, we present a novel routing protocol for wireless ad hoc networks – Landmark Ad Hoc Routing (LANMAR). LANMAR combines the features of Fisheye State Routing (FSR...
MOBICOM
2000
ACM
13 years 11 months ago
2000
ACM
We present Greedy Perimeter Stateless Routing (GPSR), a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet’s destination to ma...