Enhancement of fairness in a DiffServ network using a novel queuing algorithm

Authors:
Yi-Hung Huang;Kuan-Cheng Lin;Chao-Yu Kuo;Chin-Hsing Chen;Yen-Ping Chu
Affiliations:
Hsiuping Institute of Technology, Department of Information Networking Technology, Taichung, Taiwan;National Chung Hsing University, Department of Management Information Systems, No. 250, Kuo Kuang RD., Taichung, Taiwan;National Chung Hsing University, Institute of Computer Science, Taichung, Taiwan;Central Taiwan University of Sciences and Technology, Department of Management Information System, Taichung, Taiwan;Tunghai University, Department of Computer Science and Information Engineer, Taichung, Taiwan
Venue:
Computer Standards & Interfaces
Year:
2008

Citing 8
Cited 0

Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network

An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Dynamics of random early detection

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
High Speed Networks and Internets: Performance and Quality of Service

High Speed Networks and Internets: Performance and Quality of Service
IP QoS: Traveling in First Class on the Internet

IEEE Internet Computing
Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks

IEEE/ACM Transactions on Networking (TON)
Network border patrol: preventing congestion collapse and promoting fairness in the internet

IEEE/ACM Transactions on Networking (TON)
Adaptive CSFQ: determining the packet dropping probability adaptively for achieving fair bandwidth allocations in SCORE networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Core-Stateless Fair Queuing (CSFQ) algorithm was proposed to allocate bandwidth fairly at routers in the Differentiated Services Model (DiffServ Model). However, CSFQ can not effectively provide the fairness between TCP connections and UDP connections. Besides, the setting of buffer size strongly affects the efficiency of CSFQ. In this paper, we present a novel CSFQ-based queuing algorithm. Based on the estimated value of fair share, the probability to drop packet is determined to ensure fair share of bandwidth. The simulated experimental results demonstrate that the proposed scheme outperforms CSFQ.