Name
Title | ||
|---|---|---|
Measurement Based Optimal Source Shaping with a Shaping+Multiplexing Delay Constraint |
Abstract | ||
|---|---|---|
Most on-line (i.e., not stored) Variable Bit Rate sources would find it difficult to a priori declare the traffic pa- rameters required by a connection admission control strategy. There is thus the problem of measurement based on-line estima- tion of source parameters. In this paper we address the problem of selection of source parameters based on minimising a buffer- bandwidth cost function in the network, for a specified delay QoS Violation Probability. We consider the shaping delay plus first hop multiplexing delay; this is adequate, for example, for n statis- tically identical packet voice sources being multiplexed at a PBX, or in approaches where the end-to-end delay bound is broken into per hop delay bounds. Our approach yields a leaky bucket rate parameter p' , and the sum of the shaper buffer and leaky bucket depth (B, + a). We show that, for a fluid source model, for a linear buffer-bandwidth cost function, and for lossless multiplex- ing, a sustainable rate parameter of p* and burst parameter of 0 yields the minimum cost. We propose and study a stochastic approximation algorithm for on-line estimation of p*. We then use buffer-bandwidth cost considerations to arrive at an optimal leaky bucket depth 0' > 0 for lossy multiplexing of several statis- tically identical sources. The computation of o* must be done at the network node. We show, by an example, the improvement in cost that is possible by lossy multiplexing and a positive U*. Keywords-optimal leaky bucket, renegotiation, stochastic approxha- tion |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/INFCOM.2000.832581 | international conference on computer communications |
Keywords | Field | DocType |
end to end delay,leaky bucket,approximation algorithms,computer networks,probability,atm,minimisation,variable bit rate,approximation theory,parameter estimation,cost function,stochastic processes,qos,quality of service,asynchronous transfer mode | Approximation algorithm,Admission control,Lossy compression,Computer science,Computer network,Asynchronous Transfer Mode,Leaky bucket,Sigma,Estimation theory,Multiplexing | Conference |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Natwar Modani | 1 | 71 | 8.46 |
| Parijat Dube | 2 | 241 | 26.01 |
| Anurag Kumar | 3 | 0 | 0.34 |