Sciweavers

155 search results - page 13 / 31
» A New Necessary Condition for Shortest Path Routing
Sort
View
ICNP
2005
IEEE
14 years 2 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu
INFOCOM
2010
IEEE
13 years 6 months ago
Limitations and Possibilities of Path Trading between Autonomous Systems
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...
Yuval Shavitt, Yaron Singer
ISCC
2002
IEEE
101views Communications» more  ISCC 2002»
14 years 1 months ago
Partial path protection for WDM networks: end-to-end recovery using local failure information
In this paper, we propose a new protection scheme, which we term partial path protection (PPP), to select endto-end backup paths using local information about network failures. PP...
Hungjen Wang, Eytan Modiano, Muriel Médard
CCR
1998
140views more  CCR 1998»
13 years 8 months ago
Policy tree multicast routing: an extension to sparse mode source tree delivery
Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scal...
Horst Hodel
ICRA
2008
IEEE
136views Robotics» more  ICRA 2008»
14 years 2 months ago
Generalizing the dubins and reeds-shepp cars: Fastest paths for bounded-velocity mobile robots
— What is the shortest or fastest path a mobile robot can follow between two configurations in the unobstructed plane? The answer to this fundamental question is only known anal...
Andrei A. Furtuna, Devin J. Balkcom, Hamid Reza Ch...