Research Of Packet Scheduling Mechanism Of 10 Gigabit Coaxial Access System

In order to respond to China's call for "one network",and to accelerate the integration and development of domestic cable television networks,it is urgent to realize 10 Gigabit access rate in broadband networks.HINOC came into being.Its performance is comparable to fiber.At present,HINOC 2.0 has been widely used.And the research and development of 10 Gigabit coaxial access system HINOC 3.0 is in full swing.In order to guarantee high-bandwidth,low-latency and high-capacity service such as 4K/8K,and to meet the need of users for the ultimate network service experience,it is especially important to plan the multi-channel bandwidth reasonably in the HINOC 3.0,which is urgent to study and design efficient and reasonable multi-channel scheduling mechanism and multi-channel bandwidth allocation algorithm.Based on in-depth research on the packet scheduling mechanism of the 10 Gigabit coaxial access system,the scheduling algorithm of the maximization of minimum of the remaining bandwidth based on Service Level Agreement is researched and proposed,and its purpose is to guarantee the load balancing of each subchannel as much as possible under the established multi-channel binding situation on the basis of satisfying user's service need.Another algorithm proposed in this paper is the proportional scheduling algorithm based on user's traffic volume,and its purpose is to ensure that users divide traffic volume proportionally according to the condition of different binding channels,and then resources are allocated in proportion to the amount of sub traffic volume of each user on each subchannel.Design and construct the simulation platform in MAC layer,that simulates the real network environment of the 10 Gigabit coaxial access system.The general characteristics,such as correctness and effectiveness,of the two scheduling algorithms that are designed and implemented,are tested on the simulation platform.The test results show that the execution steps of the two algorithms are in line with each's design idea,and the results are in line with expectations.Various scenarios are built on the simulation platform: high-load,intermittent traffic,and scenarios of different network scale.The two scheduling algorithms proposed in this thesis,the round-robin scheduling algorithm and the static scheduling algorithm are tested and compared under these scenarios.According to comparison results,the advantages and applicability of the two scheduling algorithms proposed in this thesis are evaluated compared with the other two scheduling algorithms.The results show that the performance of the two scheduling algorithms proposed in this thsis is better than the other two scheduling algorithms.Accurate bandwidth services and user-level fairness are provided by the scheduling algorithm of the maximization of minimum of the remaining bandwidth based on Service Level Agreement,which is suitable for small network scale.Relative fairness in data volume level and in use of channels are provided by the proportional scheduling algorithm based on user's traffic volume,which is suitable for any scale of network.