Survey of deterministic and stochastic service curve models in the network calculus
M Fidler - IEEE Communications surveys & tutorials, 2010 - ieeexplore.ieee.org
In recent years service curves have proven a powerful and versatile model for performance
analysis of network elements, such as schedulers, links, and traffic shapers, up to entire …
analysis of network elements, such as schedulers, links, and traffic shapers, up to entire …
VoIP: A comprehensive survey on a promising technology
S Karapantazis, FN Pavlidou - Computer Networks, 2009 - Elsevier
The Internet has burgeoned into a worldwide information superhighway during the past few
years, giving rise to a host of new applications and services. Among them, Voice over IP …
years, giving rise to a host of new applications and services. Among them, Voice over IP …
[HTML][HTML] Quality-of-service in packet networks: basic mechanisms and directions
In this paper, we review the basic mechanisms used in packet networks to support Quality-of-
Service (QoS) guarantees. We outline the various approaches that have been proposed …
Service (QoS) guarantees. We outline the various approaches that have been proposed …
Largest weighted delay first scheduling: Large deviations and optimality
AL Stolyar, K Ramanan - Annals of Applied Probability, 2001 - JSTOR
We consider a single server system with N input flows. We assume that each flow has
stationary increments and satisfies a sample path large deviation principle, and that the …
stationary increments and satisfies a sample path large deviation principle, and that the …
[PDF][PDF] Scheduling real-time traffic with deadlines over a wireless channel
S Shakkottai, R Srikant - Proceedings of the 2nd ACM international …, 1999 - dl.acm.org
Recently, there has been widespread interest in the extension of data networks to the
wireless domain. However, scheduling results from the wireline domain do not carry over to …
wireless domain. However, scheduling results from the wireline domain do not carry over to …
Performance bounds for flow control protocols
R Agrawal, RL Cruz, C Okino… - IEEE/ACM transactions …, 1999 - ieeexplore.ieee.org
We discuss a simple conceptual framework for analyzing the flow of data in integrated
services networks. The framework allows us to easily model and analyze the behavior of …
services networks. The framework allows us to easily model and analyze the behavior of …
AoI scheduling with maximum thresholds
Age of Information (AoI) is an application layer performance metric that quantifies the
freshness of information. This paper investigates scheduling problems at network edge …
freshness of information. This paper investigates scheduling problems at network edge …
Scheduling with age of information guarantee
Age of Information (AoI) is an application layer performance metric that quantifies the
freshness of information. This paper investigates scheduling problems at network edge …
freshness of information. This paper investigates scheduling problems at network edge …
Probabilistic end-to-end delay bounds for earliest deadline first scheduling
M Andrews - … IEEE INFOCOM 2000. Conference on Computer …, 2000 - ieeexplore.ieee.org
We analyze the earliest-deadline-first (EDF) scheduling discipline within the framework of
statistical multiplexing. We derive techniques for bounding the probability of delay violations …
statistical multiplexing. We derive techniques for bounding the probability of delay violations …
SCED: A generalized scheduling policy for guaranteeing quality-of-service
H Sariowan, RL Cruz… - IEEE/ACM transactions on …, 1999 - ieeexplore.ieee.org
We introduce a new scheduling policy which provides guaranteed service for a session
based on a flexible service specification called the service curve. This policy, referred to as …
based on a flexible service specification called the service curve. This policy, referred to as …