In this paper we study the problem of resource allocation and control for an ATM 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 allocation scheme suggests a time scale separation of sources sharing an ATM node with finite bandwidth and buffer space, with the optimal buffer/bandwidth trade-off is determined by the sources' time scale. For statistical service with a small loss probability, we present a new approach for estimating the loss probability in a shared buffer multiplexor with the so called ''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.
LO PRESTI, F., Zhang, Z., Kurose, J., Towsley, D. (1997). Source time scale and optimal buffer/bandwidth trade-off for regulated traffic in an ATM node. In IEEE Infocom '97: the conference on computer communication: sixteenth annual joint conference of the IEEE computer and communications societies: driving the information revolution: proceedings (pp.675-682). Los Alamitos : IEE Computer Soc. Press.
Source time scale and optimal buffer/bandwidth trade-off for regulated traffic in an ATM node
LO PRESTI, FRANCESCO;
1997-01-01
Abstract
In this paper we study the problem of resource allocation and control for an ATM 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 allocation scheme suggests a time scale separation of sources sharing an ATM node with finite bandwidth and buffer space, with the optimal buffer/bandwidth trade-off is determined by the sources' time scale. For statistical service with a small loss probability, we present a new approach for estimating the loss probability in a shared buffer multiplexor with the so called ''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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
