13214 search results - page 51 / 2643 » Pseudorandomness for network algorithms |
176
click to vote
ISCC
1999
IEEE
15 years 10 months ago
1999
IEEE
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
168
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
161
click to vote
HPCN
1997
Springer
15 years 10 months ago
1997
Springer
We present a distributed algorithm for determining optimal concurrent communication ow in arbitrary computer networks. Our scheme is applicable to a wide range of network ow applic...
181
click to vote
NETWORKING
2000
15 years 7 months ago
2000
In this paper we present an algorithm to construct low-cost source trees for multicast with multiple QoS constraints and dynamic membership. Assuming the availability of link-state...
177
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
Abstract-- We study the convergence rate of average consensus algorithms in networks with stochastic communication failures. We show how the system dynamics can be modeled by a dis...