Sciweavers

804 search results - page 155 / 161
» Uncooperative congestion control
Sort
View
MEMOCODE
2006
IEEE
14 years 1 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
NOMS
2006
IEEE
169views Communications» more  NOMS 2006»
14 years 1 months ago
Real-Time Measurement of End-to-End Available Bandwidth using Kalman Filtering
—This paper presents a new method, BART (Bandwidth Available in Real-Time), for estimating the end-toend available bandwidth over a network path. It estimates bandwidth quasi-con...
Svante Ekelin, Martin Nilsson, Erik Hartikainen, A...
ACMACE
2006
ACM
14 years 1 months ago
An empirical evaluation of TCP performance in online games
A fundamental design question to ask in the development of a network game is—Which transport protocol should be used—TCP, UDP, or some other protocols? Seeking an objective an...
Kuan-Ta Chen, Chun-Ying Huang, Polly Huang, Chin-L...
SENSYS
2006
ACM
14 years 1 months ago
Capturing high-frequency phenomena using a bandwidth-limited sensor network
Small-form-factor, low-power wireless sensors—motes—are convenient to deploy, but lack the bandwidth to capture and transmit raw high-frequency data, such as human voices or n...
Ben Greenstein, Christopher Mar, Alex Pesterev, Sh...
SIGCOMM
2006
ACM
14 years 1 months ago
Beyond bloom filters: from approximate membership checks to approximate state machines
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...