An Analytic Finite Capacity Queueing Network Model Capturing Congestion and Spillbacks
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.
One of the activities of the ACTS project EXPERT is to perform trials demonstrating the use of advancedResource Management and Routing (RMR) algorithms in ATM networks. The RMR model chosen for those trials is based on the Virtual Trunk (VT) concept. In AT ...
This paper presents an application of heuristic methods to the restoration of distribution networks after disturbances. The heuristic approach is proposed since the problem needs more reasoning than pure calculation. Due to the combinatorial aspect of the ...
In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that opt ...
An algorithm that pre-computes a list of routes for each node in the network. An alternate route is also computed in case of overload of the primary one. Simulations show that this algorithm provides routes as good as On-Demand ones. ...
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 ...
Integrating virtual human animation in networked virtual environments (NVEs) has the potential to create severe network load issues. In NVEs, users are represented by their virtual embodiments. The articulated structure of these embodiments introduces a ne ...
