Please use this identifier to cite or link to this item:
Title: Conformance analysis in networks with service level agreements
Authors: Liu, Y. 
Tham, C.-K. 
Jiang, Y.
Keywords: Conformance deterioration
Network calculus
Quality of service
Service level agreement
Issue Date: 22-Apr-2005
Citation: Liu, Y., Tham, C.-K., Jiang, Y. (2005-04-22). Conformance analysis in networks with service level agreements. Computer Networks 47 (6) : 885-906. ScholarBank@NUS Repository.
Abstract: To achieve some level of Quality of Service (QoS) assurance, a network usually has Service Level Agreements (SLAs) with its users and neighboring domains, which describe the QoS level that the service provider is committed to provide, and the specification of traffic that users or neighboring domains are allowed to send. An interesting and important question arises as to whether a flow is still conformant to its original traffic specification after crossing the network since it may interact with other flows within the network. In this paper, we study analytically the extent to which a flow and an aggregate of flows become non-conformant through an analysis of the stochastic burstiness increase of flows after crossing a per-flow scheduling network and an aggregate scheduling network. The stochastic behavior of a server in aggregate scheduling networks is also studied to determine the conformance deterioration of individual flows, which provides the theoretical conformance deterioration bound and provides useful results for conformance analysis in an aggregate scheduling network with general topology. Our theoretical results are verified by extensive simulations. © 2004 Elsevier B.V. All rights reserved.
Source Title: Computer Networks
ISSN: 13891286
DOI: 10.1016/j.comnet.2004.10.001
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Jan 30, 2023


checked on Jan 30, 2023

Page view(s)

checked on Jan 26, 2023

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.