Sciweavers

1450 search results - page 34 / 290
» Congestible services and network effects
Sort
View
SIGECOM
2005
ACM
134views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
Congestion games with failures
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
Michal Penn, Maria Polukarov, Moshe Tennenholtz
HSNMC
2004
Springer
113views Multimedia» more  HSNMC 2004»
15 years 3 months ago
LAS Scheduling to Avoid Bandwidth Hogging in Heterogeneous TCP Networks
We propose using least attained service (LAS) scheduling in network routers to prevent some connections against utilizing all or a large fraction of network bandwidth. This phenome...
Idris A. Rai, Guillaume Urvoy-Keller, Ernst W. Bie...
SLIP
2003
ACM
15 years 3 months ago
Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement
In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framew...
Navaratnasothie Selvakkumaran, Phiroze N. Parakh, ...
GLOBECOM
2006
IEEE
15 years 3 months ago
Time-Driven Early Discard (TED) to Improve the Fairness of TCP Congestion Control
— This paper proposes a novel adaptive AQM (advanced queue management) approach called Time-Driven Early Discard (TED). The basic underlying idea is to set a deadline on packet s...
Mario Baldi, Andrea Vesco
INFOCOM
2005
IEEE
15 years 3 months ago
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs
Abstract— The distributed hash table (DHT) scheme has become the core component of many large-scale peer-to-peer networks. Degree, diameter, and congestion are important measures...
Dongsheng Li, Xicheng Lu, Jie Wu