DMCA
A Calculus for Stochastic QoS Analysis (2006)
| Citations: | 9 - 7 self |
BibTeX
@MISC{Liu06acalculus,
author = {Yong Liu and Chen-khong Tham and Yuming Jiang},
title = { A Calculus for Stochastic QoS Analysis},
year = {2006}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The issue of Quality of Service (QoS) performance analysis in packet-switched networks has drawn a lot of attention in the networking community. There is a lot of work including an elegant theory under the name of network calculus, which focuses on analysis of deterministic worst case QoS performance bounds. In the meantime, researchers have studied stochastic QoS performance for specific schedulers. However, most previous works on deterministic QoS analysis or stochastic QoS analysis have only considered a server that provides deterministic service, i.e. deterministically bounded rate service. Few have considered the behavior of a stochastic server that provides input flows with variable rate service, for example wireless links. In this paper, we propose a stochastic network calculus to analyze the end-to-end stochastic QoS performance of a system with stochastically bounded input traffic over a series of deterministic and stochastic servers. We also prove that a server serving an aggregate of flows can be regarded as a stochastic server for individual flows within the aggregate. Based on this, the proposed framework is further applied to analyze per-flow stochastic QoS performance under aggregate scheduling.
Keyphrases
stochastic qos analysis stochastic server variable rate service performance analysis per-flow stochastic qos performance input flow previous work elegant theory stochastic network calculus deterministic service end-to-end stochastic qos performance network calculus stochastic qos performance deterministic qos analysis specific scheduler aggregate scheduling bounded rate service input traffic packet-switched network case qos performance bound example wireless link individual flow networking community
