Describing network congestion and blocking with an analytic queueing network model
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.
We consider an n-relay Gaussian diamond network where a source communicates to a destination with the help of n half-duplex relays. Achieving rates close to the capacity of this network requires to employ all the n relays under an optimal transmit/receive ...
Ensuring correct network behavior is hard. This is the case even for simple networks, and adding middleboxes only complicates this task. In this paper, we demonstrate a fundamental property of networks. Namely, we show a way of using a network to emulate t ...
The MEU GIS-enabled web-platform [1] has been developed in close collaboration with four Swiss cities. The tool enables detailed monitoring and planning for both energy demand and supply at individual building, neighborhood and whole city scale (http://meu ...
Wireless mesh networks were designed as a mean to rapidly deliver large-scale communication capabilities without the support of any prior infrastructure. Among the different properties of mesh networks, the self-organizing feature is particularly interesti ...
Congestion is a phenomenon that arises in a variety of contexts. The most familiar representation is urban traffic congestion. Nonetheless, phenomenons such as prison cell congestion, hospital bed blocking or, at a cellular scale, ribosome congestion, also ...
This paper addresses the problem of distributed rate allocation for a class of multicast networks employing linear network coding. The goal is to minimize the cost (for example, the sum rates allocated to each link in the network) while satisfying a multic ...
Research on congestion and propagation in large urban city networks has been mainly based on microsimulations of link-level traffic dynamics. However, both the unpredictability of travel behaviors and high complexity of accurate physical modeling remain ch ...
Recent advances in traffic flow theory at the network level, namely the Macroscopic Fundamental Diagram (MFD), reveals the existence of well-defined laws of congestion dynamics at aggregated levels. The same knowledge for multimodal networks however is lim ...
In this thesis, we investigate methods for the practical and accurate localization of Internet performance problems. The methods we propose belong to the field of network loss tomography, that is, they infer the loss characteristics of links from end-to-en ...
Despite many advantages that could be gained through belonging to enterprise networks, only a few networks continue running businesses after the governments stop their funding. One of the reasons is the lack of a model that evaluates the benefits from the ...
