One Bit Is Enough: a Framework for Deploying Explicit Feedback Congestion Control Protocols
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
The performance limits of the current Internet make the integration of IP with ATM a hotly debated issue in the networking arena, leading to various competing approaches and products. Legitimate technical and market issues are, however, often intertwined w ...
Alternative best effort (ABE) is a novel service for IP networks, which relies on the idea of providing low delay at the expense of possibly less throughput. The objective is to retain the simplicity of the original Internet single-class best-effort servic ...
We consider certain variants of the additive-increase and multiplicative-decrease end-to-end congestion avoidance algorithms. The algorithms of concern are tailored to reflect the behavior of TCP congestion avoidance, in particular, the response to multipl ...
We address interactive voice services over Best Effort packet networks where traffic is subject to unpredictable congestions. The quality of voice services can be significantly affected by network delay and jitter due to the rejection of late packets. LIFO ...
Consider a network with an arbitrary topology and arbitrary communication delays, in which congestion control is based on additive--increase and multiplicative--decrease. We show that the source rates tend to be distributed in order to maximize an objectiv ...
Consider a network with an arbitrary topology and arbitrary communication delays, in which congestion control is based on additive-increase and multiplicative-decrease. We show that the source rates tend to be distributed in order to maximize an objective ...
The authors investigate the impact of different implementations of an end-to-end transport service on the performance of high-volume data transfers in a local-area network. Of particular interest is the impact of using a connection-oriented logical-link co ...
