Multicast routing optimization method based on quantum evolution
An optimization method, a technology of quantum evolution, which is applied to genetic models, devices that provide special services in branches, details of data exchange, etc., can solve the problems of complex solution process, premature, unsuitable for optimizing large-scale networks, etc., and achieves good simulation performance. Effect
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Publication Date
- 2011-08-24
- Estimated Expiration
- Not applicable · inactive patent
Smart Images
Figure 1 Figure 2 Figure 3
Abstract
Description
technical field
[0001] The invention belongs to the field of network communication calculation and relates to a multicast routing method, which can be used to improve the service quality of the Internet. Background technique
[0002] From the end of the last century to the beginning of this century is the era of great development of network technology, especially the IP network represented by the Internet is changing with each passing day. The number of users on the Internet continues to grow explosively, and the applications on the Internet have shifted from traditional e-mail to FTP, WWW and other applications. In addition, new Internet-based applications and services are constantly being launched, such as e-commerce, IP telephony, and video conferencing. However, it is difficult to meet the requirements of these services, especially to ensure the special requirements of some real-time services such as bandwidth and delay, with the current best-effort service in the Inter...
Examples
Embodiment Construction
[0034] refer to figure 1 , the specific implementation process of the present invention is as follows:
[0035] Step 1, initialize and generate a random network and set the source node and destination node, given the operating parameters and the maximum allowable delay. The operating parameters include the initial population size M, N qubits representing the set of alternative paths for each destination node and the rotation angle δ of the quantum revolving door.
[0036] Step 2, find all the paths from the destination node to the source node that satisfy the delay condition, and arrange the set of alternative paths in ascending order of cost.
[0037] refer to figure 2 , find all the paths from a destination node to the source node satisfying the delay condition as follows:
[0038] 2a. The node currently to be visited is pushed into the stack storing the path, and its state is set as visited;
[0039] 2b. If the current access node is the source node, save the path to t...