Sciweavers

117 search results - page 6 / 24
» Routing on Trees via Matchings
Sort
View
SIAMDM
2000
103views more  SIAMDM 2000»
14 years 9 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman
GLVLSI
2000
IEEE
145views VLSI» more  GLVLSI 2000»
15 years 2 months ago
Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures
Circuit interconnect has become a substantial obstacle in the design of high performance systems. In this paper we explore a new routing paradigm that strikes at the root of the i...
Cheng-Kok Koh, Patrick H. Madden
ICNP
1998
IEEE
15 years 1 months ago
OTERS: (On-Tree Efficient Recovery using Subcasting): A Reliable Multicast Protocol
This paper presents a reliable multicast protocol (OTERS) that organizes receivers into a fusion tree that matches the multicast delivery tree of the source and uses this tree to ...
Dan Li, David R. Cheriton
GLOBECOM
2007
IEEE
15 years 4 months ago
Power Efficient IP Lookup with Supernode Caching
— In this paper, we propose a novel supernode caching scheme to reduce IP lookup latencies and energy consumption in network processors. In stead of using an expensive TCAM based...
Lu Peng, Wencheng Lu, Lide Duan
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 years 7 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak