Sciweavers

2926 search results - page 136 / 586
» Partially Optimal Routing
Sort
View
SIROCCO
2003
15 years 4 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
CORR
2010
Springer
123views Education» more  CORR 2010»
15 years 1 months ago
A Stackelberg Strategy for Routing Flow over Time
Routing games are used to to understand the impact of individual users’ decisions on network efficiency. Most prior work on routing games uses a simplified model of network fl...
Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
APNOMS
2009
Springer
15 years 9 months ago
A Scheme for Supporting Optimal Path in 6LoWPAN Based MANEMO Networks
In this paper, we focus on the scheme for the route optimization in 6LoWPAN based MANEMO environments. If 6LoWPAN mobile routers for supporting NEMO protocol are organized by neste...
Jin Ho Kim, Choong Seon Hong
ASPDAC
2004
ACM
148views Hardware» more  ASPDAC 2004»
15 years 8 months ago
Optimal planning for mesh-based power distribution
— Robust power distribution within available routing area resources is critical to chip performance and reliability. In this paper, we propose a novel and efficient method for o...
Hongyu Chen, Chung-Kuan Cheng, Andrew B. Kahng, Ma...
ICCAD
2007
IEEE
281views Hardware» more  ICCAD 2007»
16 years 2 days ago
Archer: a history-driven global routing algorithm
Global routing is an important step in the physical design process. In this paper, we propose a new global routing algorithm Archer, which resolves some of the most common problem...
Muhammet Mustafa Ozdal, Martin D. F. Wong