A basic stochastic network calculus
ACM SIGCOMM Computer Communication Review (2006)
- ISSN: 01464833
- ISBN: 1595933085
- DOI: 10.1145/1151659.1159929
Available from portal.acm.org
or
Available from portal.acm.org
Page 1
A basic stochastic network calculus
A Stochastic Network Calculus
Yong Liu a, Chen-Khong Tham a, Yuming Jiang b
a Department of Electrical & Computer Engineering, National University of Singapore
b Centre for Quantifiable Quality of Service in Communication Systems
Norwegian University of Science and Technology
{engp1130, eletck}@nus.edu.sg, ymjiang@ieee.org
Technical Report: ECE-CCN-0301
Department of Electrical & Computer Engineering
National University of Singapore
November, 2003
Yong Liu a, Chen-Khong Tham a, Yuming Jiang b
a Department of Electrical & Computer Engineering, National University of Singapore
b Centre for Quantifiable Quality of Service in Communication Systems
Norwegian University of Science and Technology
{engp1130, eletck}@nus.edu.sg, ymjiang@ieee.org
Technical Report: ECE-CCN-0301
Department of Electrical & Computer Engineering
National University of Singapore
November, 2003
Page 2
ABSTRACT
The issue of Quality of Service (QoS) performance analysis in packet switching networks
has drawn a lot of attention in the networking community in recent years. There is a lot of
work including an elegant theory under the name of network calculus focusing on analysis
of deterministic worst case QoS performance bounds. In the meantime, other researchers
have studied the stochastic QoS performance for specific schedulers. As yet, there has been
no systematic investigation and analysis of end-to-end stochastic QoS performance. On the
other hand, most of the previous work on deterministic QoS analysis or stochastic QoS
analysis only considered a server which provides deterministic service, i.e. deterministically
bounded rate service. Few works have considered the behavior of a stochastic server provid-
ing input flows with variable rate service. In this paper, we propose a stochastic network
calculus to systematically analyze the end-to-end stochastic QoS performance of a system
with stochastically bounded input traffic over a series of deterministic and stochastic servers.
The proposed framework is also applied to analyze per-flow stochastic QoS performance since
a server serving an aggregate of flows can be regarded as a stochastic server for individual
flows within the aggregate under aggregate scheduling.
Keywords
Stochastic Modeling, Network Calculus, Quality of Service
The issue of Quality of Service (QoS) performance analysis in packet switching networks
has drawn a lot of attention in the networking community in recent years. There is a lot of
work including an elegant theory under the name of network calculus focusing on analysis
of deterministic worst case QoS performance bounds. In the meantime, other researchers
have studied the stochastic QoS performance for specific schedulers. As yet, there has been
no systematic investigation and analysis of end-to-end stochastic QoS performance. On the
other hand, most of the previous work on deterministic QoS analysis or stochastic QoS
analysis only considered a server which provides deterministic service, i.e. deterministically
bounded rate service. Few works have considered the behavior of a stochastic server provid-
ing input flows with variable rate service. In this paper, we propose a stochastic network
calculus to systematically analyze the end-to-end stochastic QoS performance of a system
with stochastically bounded input traffic over a series of deterministic and stochastic servers.
The proposed framework is also applied to analyze per-flow stochastic QoS performance since
a server serving an aggregate of flows can be regarded as a stochastic server for individual
flows within the aggregate under aggregate scheduling.
Keywords
Stochastic Modeling, Network Calculus, Quality of Service
Sign up today - FREE
Mendeley saves you time finding and organizing research. Learn more
- All your research in one place
- Add and import papers easily
- Access it anywhere, anytime
Start using Mendeley in seconds!
Readership Statistics
8 Readers on Mendeley
by Discipline
13% Engineering
13% Physics
by Academic Status
63% Ph.D. Student
13% Researcher (at an Academic Institution)
13% Researcher (at a non-Academic Institution)
by Country
25% United States
13% China
13% Japan