Sciweavers

213 search results - page 29 / 43
» Alternate Path Routing for Multicast
Sort
View
CCR
2004
106views more  CCR 2004»
13 years 7 months ago
Decoupling policy from mechanism in Internet routing
Routing is a black art in today's Internet. End users and ISPs alike have little control over how their packets are handled outside of their networks, stemming in part from l...
Alex C. Snoeren, Barath Raghavan
INFOCOM
2007
IEEE
14 years 1 months ago
End-to-End Routing for Dual-Radio Sensor Networks
— Dual-radio, dual-processor nodes are an emerging class of Wireless Sensor Network devices that provide both lowenergy operation as well as substantially increased computational...
Thanos Stathopoulos, Martin Lukac, Dustin McIntire...
ATMOS
2010
134views Optimization» more  ATMOS 2010»
13 years 6 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...
FOCS
2004
IEEE
13 years 11 months ago
Edge-Disjoint Paths in Planar Graphs
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
GLVLSI
2009
IEEE
262views VLSI» more  GLVLSI 2009»
13 years 5 months ago
Power distribution paths in 3-D ICS
Distributing power and ground to a vertically integrated system is a complex and difficult task. Interplane communication and power delivery are achieved by through silicon vias (...
Vasilis F. Pavlidis, Giovanni De Micheli