Sciweavers

COMCOM
2000
96views more  COMCOM 2000»
13 years 11 months ago
A routing algorithm for dynamic multicast trees with end-to-end path length control
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
Hiroshi Fujinoki, Kenneth J. Christensen
ALGORITHMICA
2006
74views more  ALGORITHMICA 2006»
13 years 11 months ago
On the Number of t-Ary Trees with a Given Path Length
We show that the number of t-ary trees with path length equal to p is t h(t-1) tp log2 p(1+o(1)) , where h(x)=-x log2 x-(1-x) log2(1-x) is the binary entropy function. Besides its...
Gadiel Seroussi
BROADNETS
2004
IEEE
14 years 3 months ago
Random Asynchronous Wakeup Protocol for Sensor Networks
This paper presents Random Asynchronous Wakeup (RAW), a power saving technique for sensor networks that reduces energy consumption without significantly affecting the latency or c...
Vamsi Paruchuri, Shivakumar Basavaraju, Arjan Durr...
BROADNETS
2004
IEEE
14 years 3 months ago
Capacity-Efficient Protection with Fast Recovery in Optically Transparent Mesh Networks
Survivability becomes increasingly critical in managing high-speed networks as data traffic continues to grow in both size and importance. In addition, the impact of failures is e...
Sun-il Kim, Steven S. Lumetta
FODO
1989
Springer
268views Algorithms» more  FODO 1989»
14 years 3 months ago
The Path Length of Binary Trees
We further refine the bounds on the path length of binary trees of a given size by considering not only the size of a binary tree, but also its height and fringe thickness (the d...
Rolf Klein, Derick Wood
ISAAC
1997
Springer
114views Algorithms» more  ISAAC 1997»
14 years 3 months ago
Algorithms for Finding Optimal Disjoint Paths Around a Rectangle
We give algorithms to find the optimal disjoint paths around a rectangle. The set of disjoint paths connects a set of sources to a set of sinks (no fixed pairing between the sour...
Wun-Tat Chan, Francis Y. L. Chin
SPAA
2003
ACM
14 years 4 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
ISMVL
2003
IEEE
85views Hardware» more  ISMVL 2003»
14 years 4 months ago
On the Average Path Length in Decision Diagrams of Multiple-Valued Functions
We consider the path length in decision diagrams for multiple-valued functions. This is an important measure of a decision diagram, since this models the time needed to evaluate t...
Jon T. Butler, Tsutomu Sasao
ASPDAC
2004
ACM
107views Hardware» more  ASPDAC 2004»
14 years 4 months ago
Minimization of the expected path length in BDDs based on local changes
— In many verification tools methods for functional simulation based on reduced ordered Binary Decision Diagrams (BDDs) are used. The evaluation time for a BDD can be crucial an...
Rüdiger Ebendt, Wolfgang Günther, Rolf D...
GCC
2005
Springer
14 years 5 months ago
Dynamic Zone-Balancing of Topology-Aware Peer-to-Peer Networks
Building a topology-aware peer-to-peer overlay network can bring many advantages, such as providing locality-aware connectivity and reducing routing path length. While its benefit...
Gang Wu, Jianli Liu