Sciweavers

3047 search results - page 360 / 610
» Randomized Parallel Selection
Sort
View
SPAA
2005
ACM
16 years 10 days ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
PDCAT
2005
Springer
16 years 8 days ago
LRC-RED: A Self-tuning Robust and Adaptive AQM Scheme
In this paper, we propose a novel active queue management (AQM) scheme based on the Random Early Detection (RED) of the loss ratio and the total sending rate control, called LRC-R...
Naixue Xiong, Yan Yang, Xavier Défago, Yanx...
PODC
2004
ACM
16 years 6 days ago
Computation in networks of passively mobile finite-state sensors
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
Dana Angluin, James Aspnes, Zoë Diamadi, Mich...
SPAA
2004
ACM
16 years 6 days ago
Online hierarchical cooperative caching
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun V...
ICPP
2003
IEEE
16 years 2 days ago
A Recovery Algorithm for Reliable Multicasting in Reliable Networks
Any reliable multicast protocol requires some recovery mechanism. A generic description of a recovery mechanism consists of a prioritized list of recovery servers/receivers (clien...
Danyang Zhang, Sibabrata Ray, Rajgopal Kannan, S. ...