Related papers: Modeling skiers flows via Wardrope equilibrium in …

We consider the design of wireless queueing network control policies with particular focus on combining stability with additional application-dependent requirements. Thereby, we consequently pursue a cost function based approach that…

Vertical equilibrium models have proven to be well suited for simulating fluid flow in subsurface porous media such as saline aquifers with caprocks. However, in most cases the dimensionally reduced model lacks the accuracy to capture the…

In this paper, we introduce a scalable model for the aggregate electricity demand of a fleet of electric vehicles, which can provide the right balance between model simplicity and accuracy. The model is based on classification of tasks with…

Closed queuing networks with finite capacity buffers and skip-over policies are fundamental models in the performance evaluation of computer and communication systems. This technical report presents the details of computational algorithms…

We consider a switched network, a fairly general constrained queueing network model that has been used successfully to model the detailed packet-level dynamics in communication networks, such as input-queued switches and wireless networks.…

Modeling traffic in road networks is a widely studied but challenging problem, especially under the assumption that drivers act selfishly. A common approach is the deterministic queuing model, for which the structure of dynamic equilibria…

We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees. Using network slicing to decouple the queueing dynamics between flows, we show that the network's ability to meet hard throughput and deadline…

An overview of the recursive equations based models and their applications in simulation based analysis and optimization of queueing systems is given. These models provide a variety of systems with a convenient and unified representation in…

The effective design and management of public transport systems are essential to ensure the best service for users. The performance of a transport system will depend heavily on user behaviour. In the common-lines problem approach, users…

The problem of the equivalence of the spherical and mean spherical models, which has been thoroughly studied and understood in equilibrium, is considered anew from the dynamical point of view during the time evolution following a quench…

We present a fluid-dynamic model for the simulation of urban traffic networks with road sections of different lengths and capacities. The model allows one to efficiently simulate the transitions between free and congested traffic, taking…

Concepts and tools from network theory, the so-called Lagrangian Flow Network framework, have been successfully used to obtain a coarse-grained description of transport by closed fluid flows. Here we explore the application of this…

With the development of real-time networks such as reactive embedded systems, there is a need to compute deterministic performance bounds. This paper focuses on the performance guarantees and stability conditions in networks with cyclic…

Consider a terminal in which users arrive continuously over a finite period of time at a variable rate known in advance. A fleet of shuttles has to carry the users over a fixed trip. What is the shuttle schedule that minimizes their waiting…

In this paper, we address the problem of optimizing flows on generalized graphs that feature multiple entry points and multiple populations, each with varying cost structures. We tackle this problem by considering the multi-population…

With a growing number of quantum networks in operation, there is a pressing need for performance analysis of quantum switching technologies. A quantum switch establishes, distributes, and maintains entanglements across a network. In…

We propose a regularized saddle-point algorithm for convex networked optimization problems with resource allocation constraints. Standard distributed gradient methods suffer from slow convergence and require excessive communication when…

The equilibrium properties of allocation algorithms for networks with a large number of nodes with finite capacity are investigated. Every node is receiving a flow of requests and when a request arrives at a saturated node, i.e. a node…

This study validates the continuum traffic flow model of capacity drop at sag and tunnel bottlenecks, as proposed by Jin (2018) and Wada et al. (2020), through empirical analysis. Specifically, after addressing the limitations in the…

Consider a distribution of citizens in an urban area in which some services (supermarkets, post offices...) are present. Each citizen, in order to use a service, spends an amount of time which is due both to the travel time to the service…