Sciweavers

INFOCOM
2005
IEEE
13 years 10 months ago
The one-to-many TCP overlay: a scalable and reliable multicast architecture
Abstract— We consider reliable multicast in overlay networks where nodes have finite-size buffers and are subject to failures. We address issues of end-to-end reliability and th...
François Baccelli, Augustin Chaintreau, Zhe...
INFOCOM
2005
IEEE
13 years 10 months ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...
INFOCOM
2005
IEEE
13 years 10 months ago
Intentional dropping: a novel scheme for SYN flooding mitigation
— This paper presents a novel scheme to mitigate the effect of SYN flooding attacks. The scheme, called intentional dropping based filtering, is based on the observation of cl...
Basheer Al-Duwairi, G. Manimaran
INFOCOM
2005
IEEE
13 years 10 months ago
Optimal utility based multi-user throughput allocation subject to throughput constraints
— We consider the problem of scheduling multiple users sharing a time-varying wireless channel. (As an example, this is a model of scheduling in 3G wireless technologies, such as...
Matthew Andrews, Lijun Qian, Alexander L. Stolyar
INFOCOM
2005
IEEE
13 years 10 months ago
Optimal peer selection for P2P downloading and streaming
— In a P2P system, a client peer may select one or more server peers to download a specific file. In a P2P resource economy, the server peers charge the client for the download...
Micah Adler, Rakesh Kumar, Keith W. Ross, Dan Rube...
INFOCOM
2005
IEEE
13 years 10 months ago
Fairness in MIMD congestion control algorithms
The Mulitplicative Increase Multiplicative Decrease (MIMD) congestion control algorithm in the form of Scalable TCP has been proposed for high speed networks. We study fairness amo...
Eitan Altman, Konstantin Avrachenkov, B. J. Prabhu