Abstract
In the today’s Internet, multimedia traffic have been increasing with the development of broadband networks. However, the Best-Effort service used in the IP network has trouble guaranteeing QoS for each user. Therefore, the realization of QoS guarantees becomes a very important issue. So far, we have proposed a new queue management scheme, called DMFQ (Dual Metrics Fair Queueing), to improve fairness and to guarantee QoS. DMFQ can improve fairness and throughput considering the amount of instantaneous and historical network resources consumed per flow. In addition, DMFQ has high-speed and high-scalability mechanism since it is hardware-oriented. However, DMFQ may be unable to adapt to fluctuations of networks due to its static set-up parameters. In this paper, we extend DMFQ to solve the above problem. This extended DMFQ stabilizes buffer utilization by controlling its parameter. Thus, it can dynamically adapt to various network conditions, which leads to the stability of queueing delay and the realization of QoS guarantee.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Richard Stevens, W.: TCP/IP Illustrated. In: The Protocols, vol. 1, Addison Wesley, Reading (1994)
Floyd, S., Jacobson, V.: Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Trans. on Networking 1(4), 397–413 (1993)
Lin, D., Morris, R.: Dynamics of Random Early Detection. In: Proc. of ACM SIGCOMM 1997, September 1997, vol. 27(4), pp. 127–137 (1997)
Stoica, I., Shenker, S., Zhang, H.: Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocation in High Speed Networks. In: Proc. of ACM SIGCOMM 1998, September 1998, vol. 28(4), pp. 118–130 (1998)
Fang, W., Kandlur, D.D., Saha, D.: Stochastic Fair Blue: A Queue Management Algorithm for Enforcing Fairness. In: Proc. of IEEE INFOCOM 2001, April 2001, vol. 3, pp. 1520–1529 (2001)
Floyd, S., Gummadi, R., Shenker, S.: Adaptive RED: An Algorithm for Increasing the Robustness of RED’s Active Queue Management. (August 2001), available at http://www.icir.org/floyd/papers/adaptiveRed.pdf
Shreedhar, M., Varghese, G.: Efficient Fair Queueing using Deficit Round Robin. IEEE/ACM Trans. on Networking 4, 375–385 (1996)
Xiao, X., Ni, L.M.: Internet QoS: A Big Picture. In: IEEE Network, pp. 8–18 (April 1999)
Yamagaki, N., Tode, H., Murakami, K.: Dual Metrics Fair Queueing: Improving Fairness and File Transfer Time. In: Proc. of the 2005 International Symposium on Applications and the Internet (SAINT 2005) (February 2005) (to appear)
Clark, D.D., Fang, W.: Explicit Allocation of Best-Effort Packet Delivery Service. IEEE/ACM Trans. Networking 6(4), 362–373 (1998)
OPNET Technologies Inc., http://www.mil3.com
Floyd, S., Henderson, T.: The NewReno Modification to TCP’s Fast Recovery Algorithm, RFC2582 (October 1996)
Jain, R., Chiu, D., Hawe, W.: A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. Technical Report TR-301, DEC (September 1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shinohara, Y., Yamagaki, N., Tode, H., Murakami, K. (2005). Queue Management Scheme Stabilizing Buffer Utilization in the IP Router. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-31957-3_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25338-9
Online ISBN: 978-3-540-31957-3
eBook Packages: Computer ScienceComputer Science (R0)