Related papers: A Tandem Fluid Network with L\'evy Input in Heavy …
We study the flow-level performance of random wireless networks. The locations of base stations (BSs) follow a Poisson point process. The number and positions of active users are dynamic. We associate a queue to each BS. The performance and…
The unreal high flows may appear on the actually congested links in the result when a monotonically increasing link travel time function of flow volume is adopted in traffic assignment. The fixed link flow results of a static traffic…
Recently we proposed an extension to the traffic model of Aw, Rascle and Greenberg. The extended traffic model can be written as a hyperbolic system of balance laws and numerically reproduces the reverse $\lambda$ shape of the fundamental…
By analyzing empirical time headway distributions of traffic flow, a hypothesis about the underlying stochastic process can be drawn. The results found lead to the assumption that the headways $T_i$ of individual vehicles follow a linear…
Packet traffic in complex networks undergoes the jamming transition from free-flow to congested state as the number of packets in the system increases. Here we study such jamming transition when queues are operated by the priority queuing…
Motivated by application in wireless networks, cloud computing, data centers etc, Stochastic Processing Networks have been studied in the literature under various asymptotic regimes. In the heavy-traffic regime, the steady state mean queue…
In this paper we generalize known workload decomposition results for L\'{e}vy queues with secondary jump inputs and queues with server vacations or service interruptions. Special cases are polling systems with either compound Poisson or…
We consider a connection-level model proposed by Massouli\'{e} and Roberts for bandwidth sharing among file transfer flows in a communication network. We study weighted proportionally fair sharing policies and establish explicit-form bounds…
We study heterogeneous traffic dynamics by introducing quenched disorders in all the parameters of Newell's car-following model. Specifically, we consider randomness in the free-flow speed, the jam density, and the backward wave speed. The…
In transportation systems (e.g. highways, railways, airports), traffic flows with distinct origin-destination pairs usually share common facilities and interact extensively. Such interaction is typically stochastic due to natural…
We consider a queuing model with the workload evolving between consecutive i.i.d. exponential timers $\{e_q^{(i)}\}_{i=1,2,...}$ according to a spectrally positive L\'{e}vy process $Y(t)$ which is reflected at 0. When the exponential clock…
We consider the problem of packet scheduling in single-hop queueing networks, and analyze the impact of heavy-tailed traffic on the performance of Max-Weight scheduling. As a performance metric we use the delay stability of traffic flows: a…
Motivated by applications in data center networks, in this paper, we study the problem of scheduling in an input queued switch. While throughput maximizing algorithms in a switch are well-understood, delay analysis was developed only…
In this article we use real traffic data to confirm that vehicle velocities follow Gaussian distribution in steady state traffic regimes (free-flow, and congestion). We also show that in the transition between free-flow and congestion, the…
This paper studies the heavy-traffic (HT) behaviour of queueing networks with a single roving server. External customers arrive at the queues according to independent renewal processes and after completing service, a customer either leaves…
We present an algorithmic method for analyzing networks of intersections with static signaling, with as primary example a line network that allows traffic flow over several intersections in one main direction. The method decomposes the…
A many-server heavy-traffic FCLT is proved for the $G_t/M/s_t+\mathit {GI}$ queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment…
When the arrival processes are Poisson, queueing networks are well-understood in terms of the product-form structure of the number of jobs $N_i$ at the individual queues; much less is known about the waiting time $W$ across the whole…
We propose a method based on probabilistic arguments to study the convexity of the autocorrelation function of processes associated with a single server queue. To illustrate the power of the method we apply it in two cases: to the workload…
A Markovian single-server queue is studied in an interactive random environment. The arrival and service rates of the queue depend on the environment, while the transition dynamics of the random environment depends on the queue length. We…