Multicast RWA method with signal power attenuation limit in all-optical network

Abstract

The invention provides a multicast RWA method with signal power attenuation limit in an all-optical network, which is applied to the ranges of an all-optical metropolitan area network and other medium-scale all-optical networks. The method solves the problems of route selection and wavelength distribution in the all-optical network. The method comprises the following steps: updating a logical topology on each wavelength of the network in real time by a node; when a multicast request reaches, selecting the logical topology of one wavelength according to a determined sequence to establish a multicast tree; preferentially adding the node close to a source node as the basic principle of establishing the multicast tree; and for a destination node which cannot be added into the multicast tree, exchanging the wavelength to establish another multicast tree. The method has the main characteristics that temporary power and minimum power limits of a signal on each edge link are considered when the multicast tree is established, and only the link of which power is more than the power limit can be added into the multicast tree. Therefore, the method ensures that the signal power reaching the destination node meets the lowest power requirement, and reduces error rate.

Description

technical field [0001] The invention belongs to the technical field of multicast routing and wavelength allocation in all-optical networks, and is especially suitable for all-optical networks with small network scale and relatively dense connections between nodes, such as all-optical metropolitan area networks. Background technique [0002] Multicast technology in optical networks generally focuses on minimizing the cost of multicast communication: multicast communication needs to find a multicast forest that can connect the source node and all destination nodes in the entire network (in special cases, there is only one multicast forest in the multicast forest. tree, figure 2 Give an example), this multicast forest is composed of many links, each link will generate a certain cost, the sum of the cost of the links is the cost of multicast communication, the designer's purpose is to make This cost is minimal. This problem is a Steiner Minimum Tree (SMT, Steiner Minimum Tree)...

AI Technical Summary

Problems solved by technology

However, because the splitter with adjustable splitting ratio is relatively expensive and the technology is not very mature, this method is very difficult to realize

Images