Sciweavers

4037 search results - page 117 / 808
» Routing without ordering
Sort
View
ADHOC
2007
107views more  ADHOC 2007»
13 years 9 months ago
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
Weifa Liang, Yuzhen Liu
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
14 years 3 months ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
ICPADS
2005
IEEE
14 years 2 months ago
Routing through Backbone Structures in Sensor Networks
Virtual infrastructures or backbones in wireless sensor networks reduce the communication overhead and energy consumption. In this paper, we present BackBone Routing (BBR), a nove...
Vamsi Paruchuri, Arjan Durresi, Mimoza Durresi, Le...
ICNP
2005
IEEE
14 years 2 months ago
Expected Convergence Properties of BGP
Border Gateway Protocol (BGP) is the de facto standard used for interdomain routing. Since packet forwarding may not be possible until stable routes are learned, it is not only cr...
Ramesh Viswanathan, Krishan K. Sabnani, Robert J. ...
SIGCOMM
2009
ACM
14 years 3 months ago
Optimizing the BSD routing system for parallel processing
The routing architecture of the original 4.4BSD [3] kernel has been deployed successfully without major design modification for over 15 years. In the unified routing architectur...
Qing Li, Kip Macy