| On the way to a distributed systems calculus: an end-to-end network calculus with data scaling |
| Full text |
Pdf
(571 KB)
|
| Source
|
Joint International Conference on Measurement and Modeling of Computer Systems
archive
Proceedings of the joint international conference on Measurement and modeling of computer systems
table of contents
Saint Malo, France
SESSION: Statistics and analysis of systems and networks
table of contents
Pages: 287 - 298
Year of Publication: 2006
ISBN:1-59593-319-0
Also published in ...
|
|
Authors
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 2, Downloads (12 Months): 57, Citation Count: 0
|
|
|
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
F. Baccelli, G. Cohen, G. J. Olsder, and J.-P. Quadrat. Synchronization and Linearity: An Algebra for Discrete Event Systems. Probability and Mathematical Statistics. John Wiley & Sons Ltd., West Sussex, Great Britain, 1992.
|
| |
3
|
C.-S. Chang. On deterministic traffic regulation and service guarantees: A systematic approach by filtering. IEEE Trans. Inform. Theory, 44(3):1097--1110, May 1998.
|
| |
4
|
|
 |
5
|
|
| |
6
|
R. L. Cruz. A calculus for network delay, Part I: Network elements in isolation. IEEE Trans. Inform. Theory, 37(1):114--131, January 1991.
|
| |
7
|
R. L. Cruz. A calculus for network delay, Part II: Network analysis. IEEE Trans. Inform. Theory, 37(1):132--141, January 1991.
|
| |
8
|
R. L. Cruz. Quality of service guarantees in virtual circuit switched networks. IEEE J. Select. Areas Commun., 13(6):1048--1056, August 1995.
|
| |
9
|
R. L. Cruz. SCED+: Efficient management of quality of service guarantees. In Proc. IEEE INFOCOM, volume 2, pages 625--634, March 1998.
|
| |
10
|
F. H. P. Fitzek and M. Reisslein. MPEG--4 and H.263 video traces for network performance evaluation. IEEE Network, 15(6):40--54, November/December 2001.
|
| |
11
|
J.-Y. Le Boudec. Application of network calculus to guaranteed service networks. IEEE Trans. Inform. Theory, 44(3):1087--1096, May 1998.
|
| |
12
|
|
| |
13
|
|
| |
14
|
|
| |
15
|
|
| |
16
|
|
| |
17
|
D. E. Wrege and J. Liebeherr. Video traffic characterization for multimedia networks with a deterministic service. In Proc. IEEE INFOCOM, pages 537--544, March 1996.
|
|