English
Related papers

Related papers: A Queuing Envelope Model for Estimating Latency Gu…

200 papers

Advances in Micro-Electro-Mechanical Systems (MEMS) have revolutionized the digital age to a point where animate and inanimate objects can be used as a communication channel. In addition, the ubiquity of mobile phones with increasing…

Networking and Internet Architecture · Computer Science 2012-10-04 Zhenxin Feng , Kwan-Wu Chin

Exact queueing analysis of erasure networks with network coding in a finite buffer regime is an extremely hard problem due to the large number of states in the network. In such networks, packets are lost due to either link erasures or due…

Information Theory · Computer Science 2010-12-14 Nima Torabkhani , Badri N. Vellambi , Faramarz Fekri

Much of the current theory of networked control systems uses simple point-to-point communication models as an abstraction of the underlying network. As a result, the controller has very limited information on the network conditions and…

Systems and Control · Computer Science 2011-03-29 Phoebus Chen , Chithrupa Ramesh , Karl H. Johansson

While mobile edge computing (MEC) alleviates the computation and power limitations of mobile devices, additional latency is incurred when offloading tasks to remote MEC servers. In this work, the power-delay tradeoff in the context of task…

Networking and Internet Architecture · Computer Science 2017-10-03 Chen-Feng Liu , Mehdi Bennis , H. Vincent Poor

This work investigates the effect of finite buffer sizes on the throughput capacity and packet delay of line networks with packet erasure links that have perfect feedback. These performance measures are shown to be linked to the stationary…

Information Theory · Computer Science 2016-11-15 Badri N. Vellambi , Nima Torabkhani , Faramarz Fekri

In this paper we analyze an $M/M/1$ queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between classes. The queuing system can be described by a…

Probability · Mathematics 2015-11-13 Andrei Sleptchenko , Jori Selen , Ivo Adan , Geert-Jan van Houtum

Motivated by the Quality-of-Service (QoS) buffer management problem, we consider online scheduling of packets with hard deadlines in a finite capacity queue. At any time, a queue can store at most $b \in \mathbb Z^+$ packets. Packets arrive…

Data Structures and Algorithms · Computer Science 2009-02-09 Fei Li

We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling…

Networking and Internet Architecture · Computer Science 2011-01-07 Yashar Ghiassi-Farrokhfal , Jorg Liebeherr , Almut Burchard

We consider the delay properties of max-weight opportunistic scheduling in a multi-user ON/OFF wireless system, such as a multi-user downlink or uplink. It is well known that max-weight scheduling stabilizes the network (and hence yields…

Optimization and Control · Mathematics 2009-01-02 Michael J. Neely

In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing relay network to better exploit the time diversity and relay…

Information Theory · Computer Science 2009-08-10 Rui Wang , Vincent K. N. Lau , Kaibin Huang

Edge computing promises to offer low-latency and ubiquitous computation to numerous devices at the network edge. For delay-sensitive applications, link delays can have a direct impact on service quality. These delays can fluctuate…

Networking and Internet Architecture · Computer Science 2025-03-04 Jiaming Cheng , Duong Thuy Anh Nguyen , Ni Trieu , Duong Tung Nguyen

This paper investigates two strategies to reduce the communication delay in future wireless networks: traffic dispersion and network densification. A hybrid scheme that combines these two strategies is also considered. The probabilistic…

Networking and Internet Architecture · Computer Science 2018-03-15 Guang Yang , Ming Xiao , H. Vincent Poor

We develop accurate approximations of the delay distribution of the MArP/G/1 queue that cap- ture the exact tail behavior and provide bounded relative errors. Motivated by statistical analysis, we consider the service times as a mixture of…

Probability · Mathematics 2014-05-21 Eleni Vatamidou , Ivo J. B. F. Adan , Maria Vlasiou , Bert Zwart

This paper proposes an innovative end-to-end deterministic network mechanism to achieve delay-bounded transmissions across multiple network domains. The proposed mechanism installs discrete shapers at the edge of the network domains, which…

Networking and Internet Architecture · Computer Science 2023-05-17 Binwei Wu , Shuo Wang , Weiqian Tan

Understanding the fundamental end-to-end delay performance in mobile ad hoc networks (MANETs) is of great importance for supporting Quality of Service (QoS) guaranteed applications in such networks. While upper bounds and approximations for…

Networking and Internet Architecture · Computer Science 2013-12-30 Juntao Gao , Yulong Shen , Xiaohong Jiang , Osamu Takahashi , Norio Shiratori

In this paper correspondence between experimental data for packet delay and two theoretical types of distribution is investigated. Statistical tests have shown that only exponential distribution can be used for the description of packet…

Networking and Internet Architecture · Computer Science 2017-02-20 A. M. Sukhov , N. Yu. Kuznetsova , A. K. Pervitsky , A. A. Galtsev

We explore the achievable delay performance in wireless random-access networks. While relatively simple and inherently distributed in nature, suitably designed queue-based random-access schemes provide the striking capability to match the…

Networking and Internet Architecture · Computer Science 2013-05-17 Niek Bouman , Sem Borst , Johan van Leeuwaarden

Flight delays are a significant challenge in the aviation industry, causing major financial and operational disruptions. To improve passenger experience and reduce revenue loss, flight delay prediction models must be both precise and…

This paper presents a method for calculating steady state probabilities of $M|E_r|c|K$ queueing systems. The infinitesimal generator matrix is used to define all possible states in the system and their transition probabilities. While this…

Systems and Control · Computer Science 2014-01-21 Stefan Hochrainer , Ronald Hochreiter , Georg Pflug

Anonymity platforms route the traffic over a network of special routers that are known as mixes and implement various traffic disruption techniques to hide the communicating users' identities. Batch mixes in particular anonymize…

Performance · Computer Science 2019-07-29 Mehmet Fatih Aktas , Emina Soljanin