13214 search results - page 56 / 2643 » Pseudorandomness for network algorithms |
150
click to vote
AINTEC
2007
Springer
16 years 11 days ago
2007
Springer
In this article, we explore modified versions of Multicast Overlay Spanning Tree algorithms (MOST) to support quality of service for wireless ad hoc networks. These algorithms (Q-...
160
click to vote
PODC
2009
ACM
16 years 6 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
194
click to vote
MMNS
1997
15 years 7 months ago
1997
A single failure in a communication network can trigger many alarms. We propose an alarm ltering algorithm for the management of an optical network using Wavelength Division Multi...
194
click to vote
ICC
2007
IEEE
16 years 15 days ago
2007
IEEE
—In our previous work [11], we derived detection delay and detection probability for a randomized scheduling algorithm in wireless sensor networks. In this paper, we study asympt...
127
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
We consider the problem of time-constrained scheduling of packets in a communication network. Each packet has, in addition to its source and its destination, a release time and a ...