Optimal Allocation of Service Curves by Exploiting Properties of the Min-plus Convolution
Key: PSKS04-1
Author: Krishna Pandit, Jens Schmitt, Claus Kirchner, Ralf Steinmetz
Date: November 2004
Kind: @techreport
Abstract: Providing deterministic Quality of Service (QoS) in packet-switched networks like the Internet, which allows non-critical traffic as well, remains an open research issue. It has been shown [17] how optimal network service curves for bandwidth/delay decoupled scheduling disciplines are found. In this paper, we show how to optimally allocate service curves to nodes along the path to obtain the optimal network service curve. We further show how the nodes can locally optimize their resources to accommodate as many service curve requests as possible. These results are achieved by exploiting novel properties of the convolution operation in the Min-plus algebra, which are derived in this work. Therefore, as a second contribution, this paper gives insight on the min-plus convolution, as well as transforms in the Min-plus algebra. Particularly, an efficient method to compute the min-plus convolution under Network Calculus constraints is developed. The key results of this paper are accompanied by numerical examples.
View Full paper (PDF) | Download Full paper (PDF)

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.