ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
DEBORAH: a tool for worst-case analysis of FIFO tandems
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Leveraging statistical multiplexing gains in single- and multi-hop networks
Proceedings of the Nineteenth International Workshop on Quality of Service
Worst-case traversal time modelling of Ethernet based in-car networks using real time calculus
NEW2AN'11/ruSMART'11 Proceedings of the 11th international conference and 4th international conference on Smart spaces and next generation wired/wireless networking
Rare events in network simulation using MIP
Proceedings of the 23rd International Teletraffic Congress
Computer Networks: The International Journal of Computer and Telecommunications Networking
A temporal network calculus approach to service guarantee analysis of stochastic networks
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Scheduling with outdated CSI: effective service capacities of optimistic vs. pessimistic policies
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Perspectives on network calculus: no free lunch, but still good value
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Perspectives on network calculus: no free lunch, but still good value
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Performance analysis of a rule-based SOA component for real-time applications
Proceedings of the 28th Annual ACM Symposium on Applied Computing
On applying stochastic network calculus
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
In recent years service curves have proven a powerful and versatile model for performance analysis of network elements, such as schedulers, links, and traffic shapers, up to entire computer networks, like the Internet. The elegance of the concept of service curve is due to intuitive convolution formulas that determine the data departures of a system from its arrivals and its service curve. This fundamental relation constitutes the basis of the network calculus and relates it to systems theory, however, under a different, so-called min-plus algebra. As in systems theory, the particular strength of the minplus convolution is the ability to concatenate tandem systems along a network path. This facilitates the notion of network service curve that has the expressiveness to characterize whole networks by a single transfer function. This paper surveys the state-of-the-art of the deterministic and the recent probabilistic network calculus. It discusses the concept of service curves, its use in the network calculus, and the relation to systems theory under the min-plus algebra. Service curve models of common schedulers and different types of networks are reviewed and methods for identification of a system's service curve representation from measurements are discussed. After recapitulating the state of knowledge on time-varying min-plus systems theory, stochastic service curve models are surveyed. These models allow utilizing the statistical multiplexing gain in a network calculus framework that features end-to-end network analysis by convolution of service curves.