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.
Alternative Best-Effort (ABE) is a novel service for IP networks which offers applications the choice between receiving a lower end-to-end delay and receiving more overall throughput. Every best effort packet is marked as either green or blue. Green packet ...
Alternative Best-Effort (ABE) is a novel service for IP networks which offers applications the choice between receiving a lower end-to-end delay and receiving more overall throughput. Every best effort packet is marked as either green or blue. Green packet ...
Recent developments in transmission and switching technology has made available low-cost gigabit network capacity forpacket-based WANs (e.g., IP over WDM), that will not require the intermediate SONET/SDH multiplexing layer. For competitive operators that ...
n recent years, the Internet has proven its ability to carry real-time data, including voice. Today, a small amount of voice traffic has already been diverted from the Public Switched Telephone Network (PSTN) to the Internet. If it expands, this phenomenon ...
In this work we address the problem of supporting the QoS requirements for applications while efficiently allocating the network resources. We analyse this problem at the source node where the traffic profile is negotiated with the network and the traffic ...
Window based network flow control protocols, such as TCP, modulate the number of unacknowledged packets the protocol is allowed to have outstanding. Such protocols change the window size when they receive positive or negative acknowledgments, where the lat ...
We present a multicast routing protocol called Distributed Core Multicast (DCM). It is intended for use within a large single Internet domain network with a very large number of multicast groups with a small number of receivers. Such a case occurs, for exa ...
We present a multicast routing protocol called Distributed Core Multicast (DCM). It is intended for use within a large single Internet domain network with a very large number of multicast groups with a small number of receivers. Such a case occurs, for exa ...
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 ...