Sciweavers

527 search results - page 93 / 106
» Compact Multicast Routing
Sort
View
61
Voted
IPPS
1998
IEEE
15 years 1 months ago
A Scalable VLSI Architecture for Binary Prefix Sums
The task of computingbinary prefix sums (BPS, for short) arises, for example, in expression evaluation, data and storage compaction, and routing. This paper describes a scalable V...
Rong Lin, Koji Nakano, Stephan Olariu, Maria Crist...
93
Voted
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
15 years 3 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
88
Voted
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
15 years 2 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
CCS
2010
ACM
14 years 9 months ago
Secure latency estimation with treeple
A network latency estimation scheme associates a "position" to every peer in a distributed network such that the latency between any two nodes can be accurately estimate...
Eric Chan-Tin, Nicholas Hopper
AINA
2005
IEEE
15 years 3 months ago
Global Connectivity for Mobile IPv6-Based Ad Hoc Networks
The IPv6-enabled network architecture has recently attracted much attention. In this paper, we address the issue of connecting MANETs to global IPv6 networks while supporting IPv6...
Chiung-Ying Wang, Cheng-Ying Li, Ren-Hung Hwang, Y...