Dynamic Clustering and Control for Large Scale Urban Networks
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
he objectives, approach, advantages, and some application results of recent extensions of the traffic-responsive urban control (TUC) strategy are presented. Based on well-known methods of the automatic control theory, TUC allows for traffic-responsive coor ...
In ATM local area networks, several kinds of traffic, such as data, video and voice, are likely to coexist. Some of this traffic has stringent delay and jitter requirements, which can only be guaranteed to be met through bandwidth reservation. In contrast, ...
The principal question we address in this work is the following: "Is Markov modelling appropriate to analyse data networks?". We will conclude that it is. The motivation for this question comes from the work of a research team at Bellcore who argue that th ...
We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate \fpp and time-average window \taw for some known parti ...
The paper presents the design approach, the objectives, the development, the advantages, and some application results of the traffic-responsive urban control (TUC) strategy. Based on a store-and-forward modelling of the urban network traffic and using the ...
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 ...
We consider increase-decrease congestion controls, a formulation that accommodates many known congestion controls. There have been many works that aim to obtain relation between the loss-event rate \fpp and time-average window \taw for some known parti ...
The traffic generated by multimedia applications presents a great amount of burstiness, which can hardly be described by a static set of traffic parameters. The dynamic and efficient usage of the resources is one of the fundamental aspects of multimedia ne ...
