Abstract—In this paper, we propose a simple and effective queue management scheme to provide fairness and differentiated drop precedence at the same time, that is, Dynamic Swapping and Marking (DSM). The DSM dynamically swaps the counts of current queue length between both packets according to their drop precedence within the same flow. In addition, the DSM selectively marks a resided packet with the maximum count among competing flows. Simulation results show that DSM achieves good fairness and sufficient differentiated drop precedence under various traffic conditions.
Index Terms—Queue management, fairness, differentiated drop precedence.
Jui-Pin Yang is with the Department of Information Technology and Communication, Shih Chien University, Taiwan, R.O.C. (e-mail: juipin.yang@mail.kh.usc.edu.tw).
Cite: Jui-Pin Yang, "Dynamic Swapping and Marking Queue Management," International Journal of Future Computer and Communication vol. 1, no. 1, pp. 1-4, 2012.
Copyright © 2008-2024. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net