Related papers: Excluded Volume Effect in Queueing Theory

In network quality of service provisioning, premium services generally require to keep a very small loss probability, which is infeasible to measure directly. The proposed virtual queue scheme estimates the small packet loss probability of…

We study a minimal model to understand the formation of clusters on surfaces in the presence of surface defects. We consider reaction diffusion model in which atoms undergoes reactions at the defect centers to form clusters. Volume…

Recent work in decentralized, schedule-driven traffic control has demonstrated the ability to significantly improve traffic flow efficiency in complex urban road networks. However, in situations where vehicle volumes increase to the point…

The local navigation of pedestrians amid a crowd is generally believed to involve no anticipation beyond (at best) the avoidance of the most imminent collisions. We show that current models rooted in this belief fail to reproduce some key…

We consider a horizontal traffic queue (HTQ) on a periodic road segment, where vehicles arrive according to a spatio-temporal Poisson process, and depart after traveling a distance that is sampled independently and identically from a…

The calibration and validation of pedestrian simulations require the acquisition of empirical evidences of human behaviour. The current work presents the results of an experiment focused on the potentially combined effect of counter flow…

Queueing theory is used for modeling biological processes, traffic flows and many more real-life situations. Beyond that, queues describe systems out of equilibrium and can thus be considered as minimal models of non-equilibrium statistical…

This note examines the distributional implications of introducing a fast-track queue for accessing a service when agents are heterogeneous in both income and service valuation. Relative to a single free queue, I show that willingness to…

Molecular weight dependence of excluded volume effects is examined. The swollen-to-unperturbed coil transition point shifts to lower concentration range with increasing molecular weight (Mw). It is shown that in the limit of the infinite…

This paper introduces a space-continuous force-based model for simulating pedestrian dynamics. The main interest of this work is the quantitative description of pedestrian movement through a bottleneck. Measurements of flow and density will…

It's a situation everyone dreads. A road is down to one lane for repairs. Traffic is let through one way until the backlog clears and then traffic is let through the other way to clear that backlog and so on. When stuck in a very long queue…

In discrete time, customers arrive at random. Each waits until one of two servers is available; each thereafter departs at random. We seek the distribution of maximum line length of idle customers. In the context of an emergency room (for…

We consider polling models in the sense of Takagi (MIT Press, 1986). In our case, the feature of the server is that it may be forced to wait idly for new messages at an empty queue instead of switching to the next station. We propose four…

We present modeling strategies that describe the motion and interaction of groups of pedestrians in obscured spaces. We start off with an approach based on balance equations in terms of measures and then we exploit the descriptive power of…

We study the joint control of arrival and service rates in queueing systems with the objective of minimizing long-run expected cost minus revenue. Although the objective function is non-convex, first-order methods have been empirically…

Pedestrians are often encountered walking in the company of some social relations, rather than alone. The social groups thus formed, in variable proportions depending on the context, are not randomly organised but exhibit distinct features,…

To perform a queuing analysis or design in a communications context, we need to estimate the values of the input parameters, specifically the mean of the arrival rate and service time. In this paper, we propose an approach for estimating…

We calculate asymptotics of the distribution of the number of customers in orbit in a two-class priority retrial $M/G/1$-type queueing model. In this model, priority customers wait in line while non-priority customers join an orbit and…

In this paper we consider a single-server, cyclic polling system with switch-over times. A distinguishing feature of the model is that the rates of the Poisson arrival processes at the various queues depend on the server location. For this…

We establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiency-driven (QED) regime, then a bounding…