Abstract
This paper proposes an optimal method for allocating buffer and bandwidth to different classes of a forwarding engine within a Differentiated Services domain in the Internet. The optimality criterion is based on the cost of the buffer and bandwidth. Based on this criterion, the best class that matches a certain traffic with a certain statistical characteristics and the maximum packet delay corresponding to this class is found. The results are general and can be applied to other networks such as ATM.
Chapter PDF
Similar content being viewed by others
References
S. Blake et al.,“An Architecture for Differentiated Services,” RFC 2475
K. Nichols et al.,“Definition of the Differentiated Services Field (DS Field) in the IPv4 and IPv6 Headers,” RFC 2474
Juha Heinanen et al.,`Assured Forwarding PHB Group,“ RFC 2597
W. Willinger and V. Paxson, “Where mathematics meets the Internet,” Notices of the American Mathematical Society, Vol. 45, No. 8, pp. 961970, Sept. 1998.
D. Anick et al.,“Stochastic theory of a data-handling system with multiple sources,” The Bell System Technical Journal,Vol. 61, No. 8, Oct. 1982, pp. 1871–1894
B. Tsybakov and N. Georganas, “On self-similar traffic in ATM queues: definitions, overflow probability bound, and cell delay distribution,” IEEE ACM Transactions on Networking,Vol. 5 June ‘87, pp. 397–409
J. Gordon, “Pareto process as a model of self-similar packet traffic,” IEEE GLOBECOM ‘85 Proceedings, Vol. 3, pp. 2232–2236, Singapore 1995.
R. Alexander et al.,“Modelling self-similar network traffic,” Technical report, Department of Statistics, University of Auckland, http://www.stat.auckland.ac.nz
G.B. Arfken and H.J. Weber, “Mathematical methods for physicists,” San Diego: Academic Press, ©1995
A. Leon-Garcia, “Probability and random processes for electrical engineering,” Reading, Mass.: Addison-Wesley, ©1989
Clenshaw-Curtis-Quadrature automatic numerical integration package, http://momonga.t.u-tokyo.ac.jp/ ooura/intcc.html
L. Kleinrock, “The latency/bandwidth tradeoff in gigabit networks,” IEEE Communications Magazine. Vol. 30, Apr. 1992, pp. 36–40.
S.H. Low, “Equilibrium allocation of variable resources for elastic traffics,” IEEE INFOCOM ‘88 Proceedings, Vol. 2, pp. 858–864, San Francisco, USA, 1998.
A. Elwalid et al.,“A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node,” IEEE Journal on Selected Areas in Communications,Vol. 13, No. 6, August 1995, pp. 1115–1127.
F. Lo Presti et al.,“Source time scale and optimal buffer/bandwidth tradeoff for regulated traffic in an ATM node,” IEEE INFOCOM ‘87 Proceedings,Vol. 2, pp. 675–682, Kobe, Japan, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Mahdavian, S.MR., Leon-Garcia, A. (2000). Buffer and Bandwidth Allocation for Diffserv Classes. In: Tsang, D.H.K., Kühn, P.J. (eds) Broadband Communications. BC 1999. IFIP — The International Federation for Information Processing, vol 30. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35579-5_2
Download citation
DOI: https://doi.org/10.1007/978-0-387-35579-5_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4685-3
Online ISBN: 978-0-387-35579-5
eBook Packages: Springer Book Archive