Sciweavers

1414 search results - page 231 / 283
» Performance Bounds in Communication Networks with Variable-R...
Sort
View
SENSYS
2009
ACM
14 years 2 months ago
Collection tree protocol
This paper presents and evaluates two principles for wireless routing protocols. The first is datapath validation: data traffic quickly discovers and fixes routing inconsistenc...
Omprakash Gnawali, Rodrigo Fonseca, Kyle Jamieson,...
DEDS
2008
108views more  DEDS 2008»
13 years 7 months ago
An Algorithmic Toolbox for Network Calculus
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
Anne Bouillard, Eric Thierry
SIGMETRICS
2006
ACM
102views Hardware» more  SIGMETRICS 2006»
14 years 1 months ago
On the way to a distributed systems calculus: an end-to-end network calculus with data scaling
Network calculus is a min-plus system theory which facilitates the efficient derivation of performance bounds for networks of queues. It has successfully been applied to provide e...
Markus Fidler, Jens B. Schmitt
WWW
2005
ACM
14 years 8 months ago
Hierarchical substring caching for efficient content distribution to low-bandwidth clients
While overall bandwidth in the internet has grown rapidly over the last few years, and an increasing number of clients enjoy broadband connectivity, many others still access the i...
Utku Irmak, Torsten Suel
TON
1998
71views more  TON 1998»
13 years 7 months ago
Real-time block transfer under a link-sharing hierarchy
— Most application data units are too large to be carried in a single packet (or cell) and must be segmented for network delivery. To an application, the end-to-end delays and lo...
Geoffrey G. Xie, Simon S. Lam