Abstract
Recent study for congestion control in high speed networks indicates that the derivative information for the congestion at the common buffer for multiple sources could be useful in achieving efficient and fair allocation of the bandwidth (Kelly, 1997; Kelly et al., 1998). In this paper we present an algorithm that estimates such derivatives for multiple on-off sources. The algorithm has its root in the infinitesimal perturbation analysis (IPA) for the classical queueing systems. Although the traditional IPA algorithm does not give unbiased derivative estimates for multi-class arrivals, we are able to prove the unbiasedness in the case of multi-class ON-OFF sources. The results in this paper may motivate a new look at the end-to-end congestion control issue.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anick, D., Mitra, D., and Sondhi, M. M. 1982. Stochastic theory of a data-handling system with multiple sources. The Bell System Technical Journal HP. 61(8): 1871–1894.
Arrow, K. J. 1968. Applications of control theory to economic growth. Lectures in Applied Mathematics, 12. Providence, R.I.: American Mathematical Society.
Boxma, O. J., and Dumas, V. 1998. The busy period in the fluid queue. Proceedings of Sigmetrics/Performance'98, pp. 100–110.
Brockett, R. W., Gong, W. B., and Guo, Y. 1999. Stochastic analysis for fluid queueing systems. Proceedings of IEEE CDC'99, pp. 3077–3082.
Chong, E. K. P., and Ramadge, P. J. 1993. Optimization of queues using an infinitesimal perturbation analysis based stochastic algorithm with general update times. SIAM J. Control and Optimization 31(3): 698–732.
Elwalid, A., and Mitra, D. 1991. Analysis and design of rate-based congestion control of high speed networks, I: stochastic fluid models, access regulation. Queueing Systems 9: 29–64.
Gallager, R. G. 1975. A Minimum delay routing algorithm using distributed computation. IEEE Trans Commun. COM-23: 73–85.
Gibbens, R. J., and Kelly, F. P. 1999. Resource pricing and the evolution of congestion control. Automatica 35.
Glasserman, P. 1991. Perturbation Analysis for Gradient Estimation. Norwell, Massachusetts: Kluwer.
Ho, Y. C., and Cao, X. R. 1991. Perturbation Analysis of Discrete Event Dynamic Systems. Norwell, Massachusetts: Kluwer.
Ho, Y. C., Sreeniva, R., and Vakili, P. 1992. Ordinal optimization of discrete event dynamic systems. Journal on DEDS. 2(2).
Kelly, F., Maulloo, A., and Tan, D. 1998. Rate control in communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society 49 (1998) 237–252.
Kelly, F. 1997. Charging and rate control for elastic traffic. European Transaction on Telecommunications 8: 33–37.
Konstantopoulos, T., and Zazanis, M. 1997. Conservation laws and reflection mappings with an application to multiclass mean value analysis for stochastic fluid queues. Stoch. Proc. Appl. 65(1): 139–146.
Kurose, J. F., and Simha, R. 1989. Resource sharing in distributed systems. IEEE Transactions on Computers. 38(5): 705–707.
Liu, Y., and Gong, W. B. 1999. Perturbation analysis for stochastic fluid queueing system. Proceedings of 38th IEEE/CDC.
Suri, R., Fu, B. 1995. On using continuous lines to model discrete production lines. Journal of Discrete Event Dynamic Systems. 4: 129–169.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Liu, Y., Gong, W. Perturbation Analysis for Stochastic Fluid Queueing Systems. Discrete Event Dynamic Systems 12, 391–416 (2002). https://doi.org/10.1023/A:1019707508130
Issue Date:
DOI: https://doi.org/10.1023/A:1019707508130