Please use this identifier to cite or link to this item:
|Title:||A calculus for stochastic QoS analysis||Authors:||Liu, Y.
|Keywords:||Generalized stochastically bounded burstiness (gSBB)
Quality of service
Stochastic service curve
|Issue Date:||Jul-2007||Citation:||Liu, Y., Tham, C.-K., Jiang, Y. (2007-07). A calculus for stochastic QoS analysis. Performance Evaluation 64 (6) : 547-572. ScholarBank@NUS Repository. https://doi.org/10.1016/j.peva.2006.07.003||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. © 2006 Elsevier Ltd. All rights reserved.||Source Title:||Performance Evaluation||URI:||http://scholarbank.nus.edu.sg/handle/10635/53927||ISSN:||01665316||DOI:||10.1016/j.peva.2006.07.003|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.