Details
| Original language | English |
|---|---|
| Title of host publication | SIGMETRICS 2006/Performance 2006 |
| Subtitle of host publication | Joint International Conference on Measurement and Modeling of Computer Systems, Proceedings |
| Pages | 287-298 |
| Number of pages | 12 |
| Edition | 1 |
| Publication status | Published - Jun 2006 |
| Externally published | Yes |
| Event | SIGMETRICS 2006/Performance 2006 - Joint International Conference on Measurement and Modeling of Computer Systems - Saint Malo, France Duration: 26 Jun 2006 → 30 Jun 2006 |
Publication series
| Name | Performance Evaluation Review |
|---|---|
| Number | 1 |
| Volume | 34 |
| ISSN (Print) | 0163-5999 |
| ISSN (electronic) | 0163-5999 |
Abstract
Network calculus is a min-plus system theory which facilitates the efficient derivation of performance bounds for networks of queues. It has successfully been applied to provide end-to-end quality of service guarantees for integrated and differentiated services networks. Yet, a true end-to-end analysis including the various components of end systems as well as taking into account mid-boxes like firewalls, proxies, or media gateways has not been accomplished so far. The particular challenge posed by such systems are transformation processes, like data processing, compression, encoding, and decoding, which may alter data arrivals drastically. The heterogeneity, which is reflected in the granularity of operation, for example multimedia applications process video frames which, however, are represented by packets in the network, complicates the analysis further. To this end this paper evolves a concise network calculus with scaling functions, which allow modelling a wide variety of transformation processes, Combined with the concept of packetizer this theory enables a true end-to-end analysis of distributed systems.
Keywords
- Network calculus, Packetizers, Scaling functions
ASJC Scopus subject areas
- Computer Science(all)
- Software
- Computer Science(all)
- Hardware and Architecture
- Computer Science(all)
- Computer Networks and Communications
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
SIGMETRICS 2006/Performance 2006 : Joint International Conference on Measurement and Modeling of Computer Systems, Proceedings. 1. ed. 2006. p. 287-298 (Performance Evaluation Review; Vol. 34, No. 1).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - On the Way to a Distributed Systems Calculus
T2 - SIGMETRICS 2006/Performance 2006 - Joint International Conference on Measurement and Modeling of Computer Systems
AU - Fidler, Markus
AU - Schmitt, Jens B.
PY - 2006/6
Y1 - 2006/6
N2 - Network calculus is a min-plus system theory which facilitates the efficient derivation of performance bounds for networks of queues. It has successfully been applied to provide end-to-end quality of service guarantees for integrated and differentiated services networks. Yet, a true end-to-end analysis including the various components of end systems as well as taking into account mid-boxes like firewalls, proxies, or media gateways has not been accomplished so far. The particular challenge posed by such systems are transformation processes, like data processing, compression, encoding, and decoding, which may alter data arrivals drastically. The heterogeneity, which is reflected in the granularity of operation, for example multimedia applications process video frames which, however, are represented by packets in the network, complicates the analysis further. To this end this paper evolves a concise network calculus with scaling functions, which allow modelling a wide variety of transformation processes, Combined with the concept of packetizer this theory enables a true end-to-end analysis of distributed systems.
AB - Network calculus is a min-plus system theory which facilitates the efficient derivation of performance bounds for networks of queues. It has successfully been applied to provide end-to-end quality of service guarantees for integrated and differentiated services networks. Yet, a true end-to-end analysis including the various components of end systems as well as taking into account mid-boxes like firewalls, proxies, or media gateways has not been accomplished so far. The particular challenge posed by such systems are transformation processes, like data processing, compression, encoding, and decoding, which may alter data arrivals drastically. The heterogeneity, which is reflected in the granularity of operation, for example multimedia applications process video frames which, however, are represented by packets in the network, complicates the analysis further. To this end this paper evolves a concise network calculus with scaling functions, which allow modelling a wide variety of transformation processes, Combined with the concept of packetizer this theory enables a true end-to-end analysis of distributed systems.
KW - Network calculus
KW - Packetizers
KW - Scaling functions
UR - http://www.scopus.com/inward/record.url?scp=33750372512&partnerID=8YFLogxK
U2 - 10.1145/1140103.1140310
DO - 10.1145/1140103.1140310
M3 - Conference contribution
AN - SCOPUS:33750372512
SN - 1595933204
SN - 9781595933201
T3 - Performance Evaluation Review
SP - 287
EP - 298
BT - SIGMETRICS 2006/Performance 2006
Y2 - 26 June 2006 through 30 June 2006
ER -