Related papers: Modeling, Analysis and Impact of a Long Transitory…
Enabling autonomous driving and industrial automation with wireless networks poses many challenges, which are typically abstracted through reliability and latency requirements. One of the main contributors to latency in cellular networks is…
In this paper, we investigate the effect of bursty traffic and random availability of caching helpers in a wireless caching system. More explicitly, we consider a general system consisting of a caching helper with its dedicated user in…
Channel idle time distribution based secondary transmission strategies have been studied intensively in the literature. Under various performance metrics, the ultimate performance of secondary devices are eventually dictated by the presumed…
The exact Markov modeling analysis of erasure networks with finite buffers is an extremely hard problem due to the large number of states in the system. In such networks, packets are lost due to either link erasures or blocking by the full…
It has been noticed that when the waiting time distribution exhibits a transition from an intermediate time power law decay to a long-time exponential decay in the continuous time random walk model, a transition from anomalous diffusion to…
We analyze a tandem network of polling queues with two product types and two stations. We assume that external arrivals to the network follow a Poisson process, and service times at each station are exponentially distributed. For this…
This work investigates the probability that the delay and the peak-age of information exceed a desired threshold in a point-to-point communication system with short information packets. The packets are generated according to a stationary…
Admission control can be employed to avoid congestion in queueing networks subject to overload. In distributed networks the admission decisions are often based on imperfect measurements on the network state. This paper studies how the lack…
This paper introduces a new asymptotic regime for simplifying stochastic models having non-stationary effects, such as those that arise in the presence of time-of-day effects. This regime describes an operating environment within which the…
For wireless systems in which randomly arriving devices attempt to transmit a fixed payload to a central receiver, we develop a framework to characterize the system throughput as a function of arrival rate and per-user data rate. The…
We numerically investigate jamming transitions in complex heterogeneous networks. Inspired by Internet routing protocols, we study a general model that incorporates local traffic information through a tunable parameter. The results show…
Two independent Poisson streams of jobs flow into a single-server service system having a limited common buffer that can hold at most one job. If a type-i job (i=1,2) finds the server busy, it is blocked and routed to a separate type-i…
We investigate the stability problem for discrete-time stochastic switched linear systems under the specific scenarios where information about the switching patterns and the probability of switches are not available. Our analysis focuses on…
Two important aspects of the Internet, namely the properties of its topology and the characteristics of its data traffic, have attracted growing attention of the physics community. My thesis has considered problems of both aspects. First I…
The discrepancy between the upper bound on throughput in wireless networks and the throughput scaling in random networks which is also known as the connectivity-throughput trade-off is analyzed. In a random network with $\lambda$ nodes per…
We study infinite-server queues in which the arrival process is a Cox process (or doubly stochastic Poisson process), of which the arrival rate is given by shot noise. A shot-noise rate emerges as a natural model, if the arrival rate tends…
We consider random-access networks with nodes representing transmitter-receiver pairs whose signals interfere with each other depending on their vicinity. Data packets arrive at the nodes over time and form queues. The nodes can be either…
We use fluid limits to explore the (in)stability properties of wireless networks with queue-based random-access algorithms. Queue-based random-access schemes are simple and inherently distributed in nature, yet provide the capability to…
5G wireless networks are expected to support new services with stringent requirements on data rates, latency and reliability. One novel feature is the ability to serve a dense crowd of devices, calling for radically new ways of accessing…
In this work, the achievable rate of three-node relay systems with selection relaying under statistical delay constraints, imposed on the limitations of the maximum end-to-end delay violation probabilities, is investigated. It is assumed…