Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Queueing theory

Related publications (25)

The Strong Integral Input-to-State Stability Property in Dynamical Flow Networks

Nils Gustav Nilsson

Dynamical flow networks serve as macroscopic models for, e.g., transportation networks, queuing networks, and distribution networks. While the flow dynamics in such networks follow the conservation of mass on the links, the outflow from each link is often ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Critical node selection method for efficient Max-Pressure traffic signal control in large-scale congested networks

Nikolaos Geroliminis, Anastasios Kouvelas, Dimitrios Tsitsokas

Decentralized signal control of congested traffic networks based on the Max-Pressure (MP) controller is theoretically proven to maximize throughput, stabilize the system and balance queues for single intersections under specific conditions. However, its pe ...

2022

Reinforcement Learning-Based Joint Reliability and Performance Optimization for Hybrid-Cache Computing Servers

David Atienza Alonso, Marina Zapater Sancho, Ali Pahlevan, Darong Huang, Luis Maria Costero Valero

Computing servers play a key role in the development and process of emerging compute-intensive applications in recent years. However, they need to operate efficiently from an energy perspective viewpoint, while maximizing the performance and lifetime of th ...

2022

Perimeter Control and Route Guidance of Multi-Region MFD Systems With Boundary Queues Using Colored Petri Nets

Nikolaos Geroliminis, Anastasios Kouvelas

Perimeter control based on Macroscopic Fundamental Diagram (MFD) aims to meter the number of transferring vehicles at the periphery of the protected urban region in order to obtain the desired number of vehicles in that region. The advantage of perimeter c ...

IEEE Institute of Electrical and Electronics Engineers2022

Content Based Status Updates

Emre Telatar, Rajai Nasser, Elie Najm

Consider a stream of status updates generated by a source, where each update is of one of two types: high priority or ordinary (low priority). These updates are to be transmitted through a network to a monitor. However, the transmission policy of each pack ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

The mean-field behavior of processor sharing systems with general job lengths under the SQ(d) policy

Arpan Mukhopadhyay

This paper addresses the mean-field behavior of large-scale systems of parallel servers with a processor sharing service discipline when arrivals are Poisson and jobs have general service time distributions when an SQ(d) routing policy is used. Under this ...

ELSEVIER SCIENCE BV2018

Status Updates in a multi-stream M/G/1/1 preemptive queue

Emre Telatar, Elie Najm

We consider a source that collects a multiplicity of streams of updates and sends them through a network to a monitor. However, only a single update can be in the system at a time. Therefore, the transmitter always preempts the packet being served when a n ...

IEEE2018

On quadratic matrix equations with infinite size coefficients encountered in QBD stochastic processes

Stefano Massei

Matrix equations of the kind A(1)X(2)+A(0)X+A(-1)=X, where both the matrix coefficients and the unknown are semi-infinite matrices belonging to a Banach algebra, are considered. These equations, where coefficients are quasi-Toeplitz matrices, are encounter ...

WILEY2018

Low-rank tensor methods for large Markov chains and forward feature selection methods

Francisco Santos Paredes Quartin de Macedo

In the first part of this thesis, we present and compare several approaches for the determination of the steady-state of large-scale Markov chains with an underlying low-rank tensor structure. Such structure is, in our context of interest, associated with ...

EPFL2018

Latency and Backlog Bounds in Time-Sensitive Networking with Credit Based Shapers and Asynchronous Traffic Shaping

Jean-Yves Le Boudec, Eleni Stai, Ehsan Mohammadpour, Maaz Mashood Mohiuddin

We compute bounds on end-to-end worst-case latency and on nodal backlog size for a per-class deterministic network that implements Credit Based Shaper (CBS) and Asynchronous Traffic Shaping (ATS), as proposed by the Time-Sensitive Networking (TSN) standard ...

IEEE2018

Improved Utility-based Congestion Control for Low-Delay Communication

Pascal Frossard, Laura Toni, Sergio Mena, Stefano D'Aronco

Due to the presence of buffers in the inner network nodes, each congestion event leads to buffer queueing and thus to an increasing end-to-end delay. In the case of delay sensitive applications, a large delay might not be acceptable and a solution to prope ...

Ieee-Inst Electrical Electronics Engineers Inc2017

Unraveling Brittle-Fracture Statistics from Intermittent Patterns Formed During Femtosecond Laser Exposure

Yves Bellouard, Max-Olivier Hongler, Christos Edouardos Athanasiou

Femtosecond-laser-written patterns at the surface of brittle materials may show at random times spontaneous alternations from regular to disordered structures and vice versa. Here, we show that these random transitions carry relevant statistical informatio ...

American Physical Society (APS)2017

Interference Functionals in Poisson Networks

We propose and prove a theorem that allows the calculation of a class of functionals on Poisson point processes that have the form of expected values of sum-products of functions. In proving the theorem, we present a variant of the Campbell-Mecke theorem f ...

Ieee-Inst Electrical Electronics Engineers Inc2016

The roles of coupling and the deviation matrix in determining the value of capacity in M/M/1/C queues

Sophie Myriam Hautphenne

In an M/M/1/C queue, customers are lost when they arrive to find C customers already present. Assuming that each arriving customer brings a certain amount of revenue, we are interested in calculating the value of an extra waiting place in terms of the expe ...

Springer Verlag2016

The Case for RackOut: Scalable Data Serving Using Rack-Scale Systems

Babak Falsafi, Edouard Bugnion, Boris Robert Grot, Alexandros Daglis, Stanko Novakovic

To provide low latency and high throughput guarantees, most large key-value stores keep the data in the memory of many servers. Despite the natural parallelism across lookups, the load imbalance, introduced by heavy skew in the popularity distribution of k ...

2016

The IX Operating System: Combining Low Latency, High Throughput, and Efficiency in a Protected Dataplan

Edouard Bugnion, Christos Kozyrakis, Georgios Prekas, Mia Primorac

The conventional wisdom is that aggressive networking requirements, such as high packet rates for small messages and μs-scale tail latency, are best addressed outside the kernel, in a user-level networking stack. We present ix, a dataplane operating system ...

Association for Computing Machinery2016

Max-stable processes and stationary systems of Levy particles

Sebastian Engelke

We study stationary max-stable processes {n(t): t is an element of R} admitting a representation of the form n(t) = max(i is an element of N) (U-i +Y-i(t)), where Sigma(infinity)(i=1) delta U-i is a Poisson point process on R with intensity e(-u)du, and Y1 ...

Elsevier2015

Effectiveness of variable speed limits considering commuters' long-term response

Wei Liu

This paper examines the effectiveness of variable speed limits (VSLs) on improving traffic flow efficiency and reducing vehicular emissions in a stylized setting of morning commute where a fixed number of individuals commute from home to work through the f ...

Pergamon-Elsevier Science Ltd2015

Statistics of bedload transport over steep slopes: Separation of time scales and collective motion

Christophe Ancey, Joris Heyman, François Mettra, Hongbo Ma

Steep slope streams show large fluctuations of sediment discharge across several time scales. These fluctuations may be inherent to the internal dynamics of the sediment transport process. A probabilistic framework thus seems appropriate to analyze such a ...

American Geophysical Union2013

A tractable analytical model for large-scale congested protein synthesis networks

Michel Bierlaire, Carolina Osorio Pizano

This paper presents an analytical model, based on finite capacity queueing network theory, to evaluate congestion in protein synthesis networks. These networks are modeled as a set of single server bufferless queues in a tandem topology. This model propose ...

2012