Bee colony optimization based network traffic scheduling method under multiple QoS (quality of service) constraints
A quality constraint, network traffic technology, applied in the field of computer networks, can solve the problems of traffic jitter, high-speed bandwidth, high traffic congestion, etc., and achieve the effect of improving diversity and global search ability.
Patent Information
- Authority / Receiving Office
- CN · China
- Current Assignee / Owner
- Publication Date
- 2015-09-30
Smart Images
Figure 1 Figure 2 Figure 3
Abstract
Description
technical field
[0001] The present invention is a network traffic scheduling scheme designed based on a multi-objective Artificial Bee Colony Algorithm (Multi-objective Artificial Bee Colony Algorithm), which is applicable to multi-QoS (Quality of Service, quality of service) constraints, and realizes network traffic under multi-QoS constraints. Traffic load balancing. The technology belongs to the field of computer network. Background technique
[0002] With the rapid development of the Internet in the world and the rapid popularization of various Internet applications, the number of network users is increasing day by day, and the needs of users for various network information resources and the information generated are increasing. The increase in traffic, the rapid growth of visits and data traffic, resulting in a substantial increase in network traffic. The traffic in the network is unevenly distributed. Some links in the network are congested due to overload, while oth...
Examples
Embodiment Construction
[0037] figure 1 Through the collection and analysis of traffic, the impact of multiple QoS constraints on traffic scheduling is obtained. The main considerations of multiple QoS constraints include host-to-server delay, traffic proportion, bandwidth percentage, and hop count. A multi-objective optimization function for traffic scheduling is established. Multi-objective optimization is used to design the mathematical model of traffic scheduling. The main goal of traffic scheduling is to make the delay in scheduling the shortest, the flow the most balanced, and the number of hops to be the least.
[0038] For the decision space x=(x 1 ,x 2 ,x 3 ) respectively correspond to (delay, traffic proportion and bandwidth percentage, hops) then the objective function f 1 (x), f 2 (x), f 3 (x) respectively represent the delay function, traffic balance function and hop function in scheduling.
[0039] Record n as the number of network hosts, m as the number of accessible servers, v...