Analysis of a real-time network using statistical network calculus with approximate invariance of effective bandwidth

Publikationstyp
Conference Paper
Date Issued
2007-02
Sprache
English
Author(s)
Angrishi, Kishore  
Zhang, Shu  
Killat, Ulrich  
Institut
Kommunikationsnetze E-4  
TORE-URI
http://hdl.handle.net/11420/4404
Start Page
189
End Page
200
Citation
15. Fachtagung Kommunikation in Verteilten Systemen, KiVS 200: 189-200
Contribution to Conference
15. Fachtagung Kommunikation in Verteilten Systemen, KiVS 2007  
Publisher DOI
10.1007/978-3-540-69962-0_16
Scopus ID
2-s2.0-84879846689
Publisher
Springer
ISBN
978-3-540-69962-0
978-3-540-69961-3
ISBN of container
978-3-540-69962-0
978-3-540-69961-3
The modern industrial network traffic consists of an increasing amount of soft real-time flows, which can tolerate very small delay and losses. Allowing probabilistic Quality of Service (QoS) violation for these flows can greatly help to improve resource utilization. However, the improvement depends on the statistical properties of competing independent flows. The notion of effective bandwidth summarizes the statistical properties and QoS requirements of a flow. This paper suggests the usage of effective bandwidth to describe the arrival process of the flow along its path in a network within the framework of the statistical network calculus. Further, we improve the existing formal relationship between effective envelope and effective bandwidth to achieve a better bound for the arrival process. This new approach enables efficient utilization of statistical multiplexing of independent flows both at the ingress of the network and along the path of the flow.
Subjects
Effective bandwidth
Network calculus
Quality-of-scrvicc
Statistical multiplexing
DDC Class
004: Informatik