Source time scale and optimal buffer/bandwidth tradeoff for heterogeneous regulated traffic in a network node

Publisher Website
Google Scholar
Abstract
In this paper, we study the problem of resource allocation and control for a network node with regulated traffic Both guaranteed lossless service and statistical service with small loss probability are considered We investigate the relationship between source characteristics and the buffer/bandwidth trade - off under both services Our contributions are the following For guaranteed lossless service, we find that the optimal resource allo - cation scheme suggests that sources sharing a network node with finite bandwidth and buffer space divide into groups according to time scales defined by their leaky bucket parameters This time scale separation determines the manner by which the buffer and bandwidth resources at the network node are shared among the sources For statistical service with a small loss probability, we present a new approach for estimating the loss probability in a shared buffer multiplexor using the "extremal" on - off, periodic sources Under this approach, the optimal resource allocation for statistical service is achieved by maximizing both the benefits of buffering sharing and bandwidth sharing The optimal buffer/bandwidth trade - off is again determined by time scale separation Besides their obvious application to resource allocation and call admission control, our results have many other implications in network design and control such as network dimensioning and traffic shaping

This publication has 12 references indexed in Scilit: