Sciweavers

2343 search results - page 171 / 469
» The Locomotive Routing Problem
Sort
View
PODC
2004
ACM
15 years 12 months ago
Mechanism design for policy routing
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
Joan Feigenbaum, Rahul Sami, Scott Shenker

Publication
137views
17 years 4 months ago
Optimal Flooding Protocol for Routing in Ad-Hoc Networks
Location discovery is a fundamental problem in wireless ad hoc networks. Most of the ad hoc routing protocols use some form of flooding to discover the location and route of a mobi...
Vamsi K. Parachuri, Arjan Durresi, Durga S. Dash, ...
VLSID
2002
IEEE
92views VLSI» more  VLSID 2002»
16 years 6 months ago
Electromigration Avoidance in Analog Circuits: Two Methodologies for Current-Driven Routing
Interconnect with an insufficient width may be subject to electromigration and eventually cause the failure of the circuit at any time during its lifetime. This problem has gotten...
Jens Lienig, Goeran Jerke, Thorsten Adler
ICCAD
2007
IEEE
140views Hardware» more  ICCAD 2007»
16 years 3 months ago
Thermal-aware Steiner routing for 3D stacked ICs
— In this paper, we present the first work on the Steiner routing for 3D stacked ICs. In the 3D Steiner routing problem, the pins are located in multiple device layers, which ma...
Mohit Pathak, Sung Kyu Lim
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
16 years 1 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak