The packet scheduling is a classic multidimensional decision problem,centering on the real-time determination of rational packet enqueuing and dequeuing within network devices.Within this domain,fair traffic scheduling stands out as a highly regarded and crucial subject.Swift,equitable,and general scheduling algorithm is paramount for ensuring service level agreements,alleviating link congestion,and effectively countering network attacks.While traditional packet scheduling algorithms achieve fair bandwidth allocation and traffic isolation,the emergence and evolution of Software-Defined Networking(SDN)and programmable network have given rise to innovative and practical fair scheduling solutions proposed by scholars worldwide.This paper systematically reviews six categories of methods focused on achieving fair scheduling,providing a comprehensive summary of their development and current research status.Additionally,the paper outlines future research directions in the realm of fair traffic scheduling.
维普
万方数据