Sciweavers

4781 search results - page 382 / 957
» Online algorithms for network design
Sort
View
IWQOS
2004
Springer
16 years 29 days ago
Towards content distribution networks with latency guarantees
This paper investigates the performance of a content distribution network designed to provide bounded content access latency. Content can be divided into multiple classes with dif...
Chengdu Huang, Tarek F. Abdelzaher
INFOCOM
2010
IEEE
15 years 6 months ago
On Providing Non-uniform Scheduling Guarantees in a Wireless Network
Significant research effort has been directed towards the design and performance analysis of imperfect scheduling policies for wireless networks. These imperfect schedulers are o...
Vartika Bhandari, Nitin H. Vaidya
MOBICOM
2009
ACM
16 years 2 months ago
Neighbor discovery in wireless networks and the coupon collector's problem
—Neighbor discovery1 is one of the first steps in the initialization of a wireless ad hoc network. In this paper, we design and analyze practical algorithms for neighbor discove...
Sudarshan Vasudevan, Donald F. Towsley, Dennis Goe...
DCOSS
2006
Springer
15 years 11 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
IWAN
2001
Springer
16 years 1 days ago
Deploying an Active Voice Application on a Three-Level Active Network Node Architecture
Active networks have been recently highlighted as a key enabling technology to obtain immense flexibility in terms of network deployment, configurability, and customized packet pro...
Georg Carle, Henning Sanneck, Sebastian Zander, Lo...