WO2012103852A2

WO2012103852A2 - Method and device for wavelength-division multiplexing network planning

Info

Publication number: WO2012103852A2
Application number: PCT/CN2012/074185
Authority: WO
Inventors: 曾峰; 董继雄
Original assignee: 华为技术有限公司
Priority date: 2012-04-17
Filing date: 2012-04-17
Publication date: 2012-08-09
Also published as: CN102934491A; CN102934491B; WO2012103852A3

Abstract

Provided are a method and device for wavelength-division multiplexing network planning. The method comprises: obtaining user service requirements, and calculating at least one physical route for each service; calculating for each service the shortest route corresponding to each physical route, selecting the shortest route having the lowest cost link from among all of the shortest routes and designating said route as the target route, determining virtual link information on the basis of the target route and bandwidth, and obtaining a first network virtual topology; determining the physical route corresponding to the target route, and obtaining a first network physical topology having a mapping relationship to the first network virtual topology. The technical solution of the present invention reduces planning cost with respect to a wavelength-division multiplexing network.

Description

Wave division network planning method and equipment

TECHNICAL FIELD The present invention relates to optical communication technologies, and in particular, to a wavelength division network planning method and device. Background technique

With the development of Wavelength Division Multiple (WDM) networks (referred to as wavelength division networks), network operators have put forward higher and higher requirements for the planning of wavelength division services. The network structure is complex, the number of services is increasing on a large scale, and network restrictions are increasing. As a result, more and more target factors are considered in planning, and the WDM network planning becomes very complicated.

The existing WDM network plan is a two-layer network plan, which is designed from the client layer to the service layer, that is, first based on input network data, such as sites, links, services, and various restrictions. The client layer is virtual topology, and then the virtual topology and the physical topology are mapped. After the mapping is completed, the route of the virtual link on the virtual topology is determined on the physical topology, and finally the virtual topology and the virtual topology are obtained. Corresponding physical topology.

As is well known, for a physical network with n nodes, there are 2 ⁿ virtual topologies. At present, there is no good way to establish a suitable virtual topology from many virtual topologies. Therefore, the establishment of virtual topology is more difficult, resulting in higher network planning costs. In addition, the service is routed on the virtual topology. The number of hops on the virtual link is high, which results in a higher capacity requirement for each virtual link, that is, more bandwidth resources, and the capacity of the virtual link is determined. Planning costs, therefore, the cost of existing WDM network planning methods is higher. Summary of the invention

The present invention provides a WDM network planning method and apparatus for reducing the cost of a WDM network plan.

Embodiments of the present invention provide a WDM network planning method, including:

Obtaining a service requirement of the user, where the service requirement includes: a source node of each service, a sink node of each service, and a bandwidth of each service;

Calculating at least one physical route for each of the services, each physical path of each of the services a fiber link that is a source node from each of the services to a sink node of each of the services; a shortest path corresponding to each physical route of each of the services, and a physical quantity of each of the services The shortest path corresponding to the route is a virtual link connection with the lowest link cost when each of the services is carried by the virtual link on each physical route of each of the services; each physical route of each service corresponds to The shortest link cost includes the cost of creating a virtual link carrying the each service and the physical cost of each physical route of each service on each physical route of each service; The shortest route with the lowest link cost in the shortest path corresponding to all the physical routes of each service is used as the target route of each service, and the target route of each service and the bandwidth of each service are determined according to the bandwidth of each service. The virtual link information of each service is obtained, and the virtual link information of the first network is obtained. The virtual link information of each service includes the number of virtual links that carry the each service and each of the services that carry the service. Virtual link Capacity and the end node;

Determining a physical route corresponding to the target route of each of the services, and obtaining a first network physical topology that forms a mapping relationship with the first network virtual topology.

The embodiment of the present invention provides a computer program product, including computer program code. When a computer unit executes the computer program code, the computer unit performs the operations described in the wavelength division network planning method provided by the embodiment of the present invention.

The embodiment of the invention provides a wavelength division network planning device, which includes:

a receiver, configured to acquire a service requirement of the user, where the service requirement includes: a source node of each service, a sink node of each service, and a bandwidth of each service;

a route calculation unit, configured to calculate at least one physical route for each of the services, where each physical route of each service is an optical fiber from a source node of each service to a sink node of each service Link

a shortest path calculation unit, configured to calculate a shortest path corresponding to each physical route of each service, where a shortest path corresponding to each physical route of each service is on each physical route of each service The virtual link connection with the lowest link cost when each of the services is carried by the virtual link; the shortest link cost corresponding to each physical route of each service is included in each physical of each service The cost of creating a virtual link carrying each of the services and the physical cost of each physical route of each service on the route;

a virtual topology obtaining unit, configured to select a shortest path with the lowest link cost from a shortest path corresponding to all physical routes of each service as a target route of each service, according to each of the industries The target route and the bandwidth of each of the services determine the virtual link information of each of the services; the virtual link information of each of the services includes the number of virtual links and the bearer that carries each of the services. Describe the capacity and end nodes of each virtual link of each service;

The physical topology obtaining unit is configured to determine a physical route corresponding to the target route of each service, and obtain a first network physical topology that forms a mapping relationship with the first network virtual topology.

The WDM network planning method, device and computer program product provided by the embodiments of the present invention calculate at least one physical route from a source node of a service to a sink node of a service for each service, and then calculate each physical route of each service. Corresponding shortest path, selecting the shortest route with the lowest link cost from all the shortest paths corresponding to each service as the target route of each service, and determining the virtual link information of each service according to the target route and bandwidth of each service, Then obtain the virtual topology of the network, determine the physical route corresponding to the target route of each service, and then obtain the network physical topology that forms a mapping relationship with the network virtual topology, thereby obtaining the planning result of the WDM network. It can be seen from the foregoing that the embodiment of the present invention determines the virtual link of the bearer service and the physical route that carries the virtual link based on the shortest link with the lowest link cost, and finally obtains the network virtual topology and the network physics that forms a mapping relationship with the network virtual topology. Topology, effectively reducing the cost of multi-layer network planning. DRAWINGS

BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are required to be used in the description of the prior art, are briefly described. It is obvious that the drawings in the following description are some embodiments of the present invention, and no one would be creative to those skilled in the art Other drawings can also be obtained from these drawings on the premise of labor.

FIG. 1 is a flowchart of a WDM network planning method according to an embodiment of the present invention;

FIG. 1B is a flow chart of an embodiment of step 103 in FIG. 1A according to an embodiment of the present invention;

FIG. 2 is a flow chart of an embodiment of step 102 to step 105 according to an embodiment of the present invention;

3 is a flowchart of a WDM network planning method according to another embodiment of the present invention;

4 is a flowchart of a WDM network planning method according to another embodiment of the present invention;

5A is a schematic diagram of a directed connection relationship corresponding to service 1 according to an embodiment of the present invention; FIG. 5B is a schematic diagram of a directed connection relationship corresponding to service 2 according to an embodiment of the present invention; FIG. 5C is a schematic diagram of a directed connection relationship corresponding to service 3 according to an embodiment of the present invention; FIG. 5D is a schematic diagram of a WDM network planning result according to an embodiment of the present invention;

FIG. 6 is a schematic structural diagram of a WDM network planning device according to an embodiment of the present invention; FIG. 7 is a schematic structural diagram of a WDM network planning device according to another embodiment of the present invention. The technical solutions in the embodiments of the present invention are clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. The embodiments are a part of the embodiments of the invention, and not all of the embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.

FIG. 1A is a flowchart of a WDM network planning method according to an embodiment of the present invention. As shown in FIG. 1A, the method in this embodiment includes:

Step 101: Obtain a service requirement of the user.

The service requirements of the user include but are not limited to: the source node of each service, the sink node of each service, and the bandwidth of each service. For example, for some services, the user's business needs may also include the number of failures allowed by the service, the separation policy, the necessary routing nodes, and the non-routing nodes. Business needs will vary depending on the business.

The execution subject of this embodiment may be a WDM network planning device.

The method for obtaining the service requirement of the user may be as follows: The wavelength division network planning device provides an input interface to the user, and the user inputs its own service requirement through the input interface, that is, inputs information such as a source node, a sink node, and a bandwidth of each service. For some services, the user can also input the number of failures allowed by the service through the input interface, the separation policy, the necessary routing nodes, and the routing nodes.

In addition, the way to obtain the user's business needs can also be: The WDM network planning device is directly obtained from other devices. Other devices may be servers that store the user's business needs, but are not limited thereto.

Step 102: Calculate at least one physical route for each service, and each physical route of each service is a fiber link from a source node of each service to a sink node of each service.

In this embodiment, the WDM network planning device calculates at least one physical route for each service according to the physical topology of the network and the source node and the sink node of each service in the service requirement. Physical routing It is the fiber link from the source node of the service to the sink node of the service. Among them, the physical topology belongs to the service layer. It can be seen that the WDM network planning device of the present embodiment starts from the service layer when planning the WDM network, instead of starting from the client layer as in the prior art, that is, not counting the virtual from the prior art. The link begins.

Step 103: Calculate the shortest path corresponding to each physical route of each service. The shortest path corresponding to each physical route of each service is to carry each service time chain through the virtual link on each physical route of each service. The lowest cost virtual link connection.

A virtual link is formed by a wavelength link of a wavelength division network. The service is carried in a wavelength link, and the wavelength link is carried in a fiber link (ie, a physical route) on the physical topology. Generally, there are multiple virtual link connections for carrying traffic over a virtual link on each physical route. The cost of links consumed by different virtual link connections is different. In this embodiment, the virtual link connection of the bearer service with the lowest link cost per physical route is referred to as the shortest path.

Wavelength network costs primarily include physical network costs and all wavelength link costs. Since the physical network is initially built, the main cost of planning is the cost of the wavelength link, that is, the cost of the virtual link carrying the service. In this embodiment, the shortest link cost corresponding to each physical route of each service includes the cost of creating a virtual link carrying each service and each service of each service on each physical route of each service. The physical cost of physical routing. In the process of carrying the service through the virtual link, the virtual link existing in the network may be preferentially considered, but when the existing virtual link does not have sufficient capacity, a new virtual link is allowed to be added to the network to satisfy The requirements that carry the business.

Optionally, after the at least one physical route is calculated for each service, the WDM network planning device sorts all the services, and sequentially calculates the shortest path corresponding to all the physical routes of each service according to the sorted service sequence. .

In various embodiments of the present invention, the capacity of the virtual link used is sufficiently large in calculating the shortest path of each physical route, and the actual capacity of the virtual link is determined in a subsequent planning process.

Step 104: Select the shortest route with the lowest link cost from the shortest path corresponding to all the physical routes of each service as the target route of each service, and determine the service of each service according to the target route of each service and the bandwidth of each service. The number of virtual links and the capacity and end nodes of each virtual link carrying each service obtain the first network virtual topology.

For each business, when determining the shortest path corresponding to all its physical routes, then the belongings The shortest link cost corresponding to the routing is compared, and the shortest path with the lowest link cost is selected as the target route of the service; then, the physical route corresponding to the target route of the service is determined as the physical route of the service, according to the The target route of the service and the bandwidth of the service determine the virtual link information of the service. The physical route corresponding to the target route of each service (that is, the physical route of each service) is used to carry the virtual link of each service.

Optionally, after calculating the shortest path corresponding to all the physical routes of each service, the WDM network planning device can sort all the services, and sequentially calculate the target routes of each service according to the sorted service order.

Optionally, the WDM network planning device can calculate the target route of the service after calculating the shortest path of all physical routes of a service.

The virtual link information of each service includes the number of virtual links carrying each service and the capacity and end nodes of each virtual link carrying each service. The capacity of the virtual link carrying the service is greater than or equal to the bandwidth of the carried service.

Optionally, the WDM network planning device may determine, according to the cross-nodes on the target route of each service, the number of virtual links that carry each service and the end nodes of each virtual link that carries each service. The cross-node on the target route of each service is a node other than the source node of each service and the sink node of each service on the target route of each service. Where the number of cross nodes plus

1 is the number of virtual links determined according to the cross-node. The end node of a virtual link can be the source node of the service and the nearest cross-node from the source node, two adjacent cross-nodes, and the sink node of the distance service. One of the nearest cross nodes and service sink nodes, as well as source and sink nodes. For example, the target route of a service is the node A-node B-node C-node D, and the node A and the node D are respectively the source node and the sink node of the service, and the cross-node on the target route of the service is Node B and node C; based on the cross-node node B and node C, it can be determined that the service needs three virtual links to carry, and the end nodes of one virtual link are node A and node B, respectively, and another virtual link The end nodes are node B and node C, respectively, and the end nodes of the last virtual link are node C and node D, respectively. For example, if the target route of a service is the node A-Node B, and the node A and the node B are the source node and the sink node of the service respectively, if the target route of the service does not have a cross node, the line can be determined. The service needs to be carried by a virtual link. The end nodes of the virtual link are node A and node B, respectively.

The capacity of the virtual link carrying each service is to meet the bandwidth requirement of the service carried by the virtual link. This is a basic requirement for virtual links. Therefore, the WDM network planning device can determine the capacity of each virtual link carrying each service according to the bandwidth of each service. For example, if only one service exists on a virtual link carrying a service, the WDM network planning device can determine the capacity of the virtual link that carries the service according to the bandwidth of the service. If one virtual link carrying one service also carries another service, the WDM network planning device determines the virtual part of the service and the other service according to the sum of the bandwidth of the service and another service. The capacity of the link. In a WDM network, the capacity of a wavelength link is generally fixed, such as 20G, 40G, or 100G. Therefore, the WDM network planning device determines the capacity of the virtual link, that is, determines which capacity of the wavelength link to use and The number of wavelength links used.

In the WDM network planning process, the capacity of the virtual link determines the cost of the WDM network planning to a certain extent. In this embodiment, the virtual link that carries the lowest cost is determined based on the virtual link connection with the lowest link cost on the physical route. Road information is therefore beneficial to reduce the planning cost of the WDM network.

The virtual topology of the network is mainly composed of information such as the virtual link carrying each service in the network and the capacity of the virtual link. Therefore, after the virtual link information of all services in the network is obtained, the virtual topology of the network (that is, the first network virtual topology) can be obtained according to the virtual link information of all services.

Optionally, if there is no virtual topology in the network, the obtained virtual link information of all services directly constitutes the first network virtual topology.

Optionally, if a virtual topology exists in the network, the existing virtual topology may be updated according to the obtained virtual link information of all services to obtain a first network virtual topology. The "renewing the existing virtual topology based on the obtained virtual link information of all services to obtain the first network virtual topology" mainly refers to the virtual link information according to each service, and the existing virtual extension Puzhong adds a virtual link and/or changes the capacity of an existing virtual link to obtain a first network virtual topology.

Step 105: Determine a physical route corresponding to the target route of each service, and obtain a first network physical topology that forms a mapping relationship with the virtual topology of the first network.

The physical route corresponding to the target route of each service is the physical route of the virtual link that carries each service. Therefore, after obtaining the virtual topology of the first network, the WDM network planning device can determine according to the determined The physical route corresponding to the target route of each service is obtained by the first network physical topology that forms a mapping relationship with the first network virtual topology. The first network physical topology is actually a physical topology consisting of physical routes carrying virtual links in the virtual topology of the first network.

Obtaining a first network virtual topography and a first network object that forms a mapping relationship with the first network virtual topology After the topography, it also got the planning results of the WDM network.

In other words, the WDM network planning device obtains the target route of each service at the customer layer based on at least one physical route of each service calculated by the service layer, and obtains the virtual link information of each service, and finally obtains The virtual topology of the entire network and the network physical topology that form a mapping relationship with the virtual topology of the entire network realize the planning from the service layer to the client layer. The client layer refers to a virtual topology that consists of virtual links.

Further, one or more of the following information may be saved: the service requirement of the user acquired in step 101, the physical route calculated in step 102, and the shortest path calculated in step 103, determined by step 104. The target route, the obtained virtual link information, and the first network virtual topology, and the physical route corresponding to the target route determined in step 105, and the obtained first network physical topology formed in a mapping relationship with the first network virtual topology.

In this embodiment, the WDM network planning device calculates at least one physical route for each service according to the physical extension of the source node, the sink node, and the network of the service, and then calculates the shortest corresponding to each physical route of each service. The shortest path with the lowest link cost is selected as the target route of each service from all the shortest paths corresponding to each service, and the virtual link information of each service is determined according to the target route and bandwidth of each service, and then the network is obtained. The virtual topology determines the physical route corresponding to the target route of each service, and then obtains the network physical topology that forms a mapping relationship with the network virtual topology, thereby obtaining the planning result of the WDM network. Therefore, in this embodiment, the virtual link of the bearer service and the physical route carrying the virtual link are determined based on the virtual link connection with the lowest link cost, and finally the network virtual topology and the network forming the mapping relationship with the network virtual topology are obtained. The physical topology effectively reduces the cost of multi-layer network planning. In addition, the planning method of this embodiment is a planning method from the service layer to the client layer, avoiding the design from the client layer to the service layer in the prior art. The various problems encountered in the train of thought are also conducive to reducing the cost of multi-layer network planning. For example, in this embodiment, the target route of each service at the customer layer is obtained based on at least one physical route of each service calculated by the service layer, and then the virtual link information of each service is obtained, and finally the virtual topology of the network is obtained. , making the acquisition of the virtual topology become evidence-based, and solving the problem that the existing virtual topology cannot be obtained from many virtual topologies in the prior art. For example, in this embodiment, a virtual link that carries each service is obtained based on the virtual link connection with the lowest link cost, and the planning cost is high due to the number of hops on the virtual link in order to meet the separation feature in the prior art. The problem.

In practical applications, if the user needs the service to be fault-resistant, it will be in the business demand. This includes information on the number of failures the business is allowed to accept, as well as separation strategies. If the user does not need the service to be fault-tolerant, the service requirement may not include the information about the number of failures that the service is allowed to bear, or the number of failures that the service is allowed to bear but the value is zero. The service failure prevention capability refers to that the service must be able to reach the sink node through other physical paths once the physical path selected by the service fails. That is to say, if the service is required to have anti-fault capability, it is necessary to establish a standby physical route for the service that satisfies a certain separation characteristic.

For the case that the service requirement does not include the number of faults that the service is allowed to bear, or the number of faults that the service is allowed to bear, but the value is 0, one implementation of the step 102 is as follows: The wavelength division network planning device can use K The K shortest paths (KSP) algorithm calculates at least one physical route for each service. Where K is an integer greater than zero. The process of computing physical routes on the physical topology using the KSP algorithm is prior art and will not be described in detail herein.

For the case where the service requirement includes the number of failures that the service is allowed to bear and the number of failures that the service is allowed to bear is greater than 0, according to the separation strategy, step 102 may specifically adopt the following implementation manners:

The WDM network planning device can use the link separation algorithm to calculate at least one link separation route for each service. Here, the link separation route is a physical route that satisfies the number of failures that the service is allowed to bear. The process of calculating a link separation route on a physical topology belongs to the prior art and will not be described in detail herein.

The WDM network planning device can also use the node separation algorithm to calculate at least one separate node route for each service. Here, the node separation route is a physical route that satisfies the number of failures that the service is allowed to bear. The process of calculating a node separation route on a physical topology belongs to the prior art and will not be described in detail herein.

The WDM network planning device can also calculate at least one SRLG separate route for each service using the Shared Risk Link Group ( SRLG) separation algorithm. Here, the SRLG split route is a physical route that satisfies the number of failures that the service is allowed to bear. The process of calculating the SRLG separation route on the physical topology belongs to the prior art and will not be described in detail herein.

Optionally, the process of an embodiment of step 103 is as shown in FIG. 1B, and specifically includes: Step 103: forming a directional corresponding to each physical route of each service according to a node that passes through each physical route of each service Connection relationship.

The directional connection relationship corresponding to each physical route of each service includes the source node of each service and the destination node of each service between two nodes on each physical route of each service. Directed connection.

Optionally, the directed connection relationship may be a directed graph, but is not limited thereto. The directed graph corresponding to each physical route includes a directed connection from the source node to the sink node between the two nodes on each physical route. In a directed graph, a directed connection can be referred to as an edge.

Step 103b: Assign a weight value to each of the directed connections in the directed connection relationship corresponding to each physical route of each service.

The weight value of each directed connection in the directed connection relationship is related to whether a virtual link exists on the fiber link corresponding to the directed connection. The principle of assigning a weight value to a directed connection in a directed connection relationship is as follows: the weight value d of the directional connection of the virtual link already exists on the corresponding fiber link, and the virtual link does not exist on the corresponding fiber link. The weight value of the directed connection.

Optionally, on the basis of satisfying the above-mentioned assignment principle, a random assignment may be used to assign a weight value to each directed connection in the directed connection relationship. For example, if there is no virtual link on the fiber link corresponding to a directed connection, the weight value can be assigned to infinity, but it is not limited to this; if there is a virtual link on the fiber link corresponding to a directed connection, Assign the weight value to 10 or 1, etc., but it is not limited to this.

Optionally, considering that the WDM network cost mainly includes the physical network cost and the cost of all the wavelength links, the weight value may be assigned to the directional connection according to the following manner: if the virtual link already exists on the fiber link corresponding to the directional connection The weight of the directed connection is the physical cost of the fiber link corresponding to the directed connection. If there is no virtual link on the fiber link corresponding to the directed connection, the weight of the directed connection is the fiber corresponding to the directed connection. The cost of creating a new virtual link on the link and the physical cost of the fiber link corresponding to the directed connection.

Optionally, the wavelength division network planning device may calculate, according to formula (1), a weight value of each directed connection in each of the directed connection relationships corresponding to each physical route of each service; and then calculate the calculated directed connection. The weight value is assigned to the directed connection in the directed connection relationship corresponding to each physical route of each service.

Formula (1): Cos=wl * Service installation cost +w2* Optical multiplexer segment (OMS) cost +w2* Traffic on the path.

Where Cos is the calculated weight value of the directed connection.

The service installation cost is the cost of creating a virtual link on the fiber link corresponding to the directed connection. For example, if the cost of creating a new virtual link is set to 1, the new fiber link on the directional connection is new. The cost of building two virtual links is 2. If the virtual link is not required to be created on the fiber link corresponding to the directed connection, the cost is 0.

The OMS cost is the physical cost of the fiber link corresponding to the directed connection, that is, the cost of the physical device such as the fiber on the fiber link.

The traffic on the path is the amount of traffic on the existing virtual link on the fiber link corresponding to the directed connection; for example, if two virtual links already exist on the fiber link corresponding to a wired connection, the fiber link The traffic on the road is the sum of the traffic on the two virtual links. It is explained here that the traffic volume of this embodiment mainly refers to the bandwidth of the service.

Wl, w2, and w3 are weight coefficients. In the embodiment of the present invention, wl, w2 and w3 allow the user to make adjustments for different services.

Step 103c: Calculate a shortest path corresponding to each physical route of each service according to the weighted value of each directed connection in each of the directed connection relationship and the directed connection relationship of each physical route of each service.

After learning the weight value of each directed connection in the directed connection relationship, the WDM network planning device can calculate all virtual link connections from the source node of the service to the sink node of the service according to the directed connection relationship, that is, obtain the slave All single-directional directed connections from the source node of the service to the sink nodes of the service and all combinations of multiple directed connections. Then, the WDM network planning device uses the weight value of a single directed connection from the source node of the service to the sink node of the service as the link cost corresponding to the single directed connection, and respectively sets the source node of each service to the service. The weight values of the respective connected connections in the combination of the directed connections of the nodes are added as the link costs corresponding to the combinations of the directed connections, and finally a combination of a single directed connection or a directed connection with the lowest link cost is selected. As the shortest path of the physical route.

Optionally, the implementation manner of the step 103c may be: the wavelength division network planning device takes as input a weighted value of each directed connection relationship and a directed connection in each of the directed connections of each physical route of each service, The shortest path algorithm is used to calculate the shortest path corresponding to each physical route of each service. Among them, the use of the shortest path algorithm is beneficial to improve the efficiency of obtaining the shortest path.

Among them, while calculating the shortest path, the link cost corresponding to the shortest path is obtained.

The above first forms a directed connection relationship, then assigns a weighted value to the directed connection in the directed connection relationship, and finally obtains a directed connection or a directed connection with the lowest link cost according to the weighted value of the directed connection relationship and the directed connection. The combination as the shortest path embodiment has the advantages of simple implementation, high efficiency, and the like.

FIG. 2 shows an implementation flow of the joint implementation of the foregoing steps 102-105, but is not limited to This. As shown in Figure 2, the implementation process includes:

Step 1031: Sort all services.

Step 1032: Select one service from all services according to the service sequence, and subtract 1 from the total number of services.

Step 1033: Initialize the link cost corresponding to the selected service to infinity.

Step 1034: Determine whether to traverse all the physical routes of the selected service. If the determination result is no, go to step 1035. If the judgment result is yes, go to step 1038.

Step 1035: Select a physical route that is not traversed from all physical routes of the selected service, and calculate a shortest path corresponding to the selected physical route.

Specifically, the wavelength division network planning device first forms a directed connection relationship of the selected physical route according to the node through which the selected physical route passes.

Then, the WDM network planning device assigns a weight value to each of the directed connections in the directed connection relationship corresponding to the selected physical route according to the existence of the virtual link on the selected physical route. The assignment principle is: the weight value of the directional connection of the virtual link on the corresponding fiber link d, and the weight value of the directional connection of the virtual link on the corresponding fiber link.

Optionally, the wavelength division network planning device may calculate, according to formula (1), a weight value of each directed connection in the directed connection relationship corresponding to the selected physical route, and then assign the calculated weight value to the corresponding one. To connect.

Then, the wavelength division network planning device calculates the shortest path corresponding to the selected physical route by using the directed connection relationship corresponding to the selected physical route and the weight value of each directed connection in the directed connection relationship.

Optionally, the wavelength division network planning device may input the weight value of the directed connection relationship corresponding to the selected physical route and the directed connection in the directed connection relationship, and calculate the selected physical route by using the shortest path algorithm. The shortest path and the shortest link cost.

For the above specific implementation, reference may be made to the description of the embodiment shown in FIG. 1B.

Step 1036: Determine whether the shortest link cost corresponding to the selected physical route is less than the link cost corresponding to the selected service; if the determination result is yes, go to step 1037; if the judgment result is no, go back to step 1034.

Step 1037: Update the link cost corresponding to the selected service to the shortest link cost corresponding to the selected physical route, and update the target route of the selected service to the selected physical path. Return to step 1034 by the corresponding shortest path.

Steps 1034 to 1037 are specifically the process of selecting the shortest path with the lowest link cost from the shortest path corresponding to at least one physical route of the selected service as the target route of the selected service.

Step 1038: Determine a physical route corresponding to the target route of the selected service as a physical route of the selected service, and determine virtual link information of the selected service according to the target route of the selected service and the bandwidth of the selected service. The network virtual topology is updated according to the virtual link information of the selected service, and step 1039 is performed.

After the traversal of all the physical routes of the selected service, the target route of the selected service is the shortest route with the lowest link cost in the shortest path corresponding to all the physical routes of the selected service, and the link is the shortest. The physical route with the lowest cost shortest path corresponds to the physical route of the selected service.

Specifically, the WDM network planning device determines the number of virtual links carrying the selected service according to the cross-nodes on the target route of the selected service. If there is no virtual link on the physical route corresponding to the target route of the selected service, all the virtual links need to be created on the physical route corresponding to the target route of the selected service; if the selected service is in the selected service If one or more virtual links exist on the physical route corresponding to the target route, you only need to create the remaining virtual link on the physical route corresponding to the target route of the selected service.

Further, the WDM network planning device further needs to determine the capacity of each virtual link carrying the selected service according to the bandwidth of the selected service. For a virtual link that already exists, the bandwidth planning device determines the bandwidth for the virtual link. For example, the bandwidth of the virtual link is updated, for example, the bandwidth is increased, and the bandwidth may be increased by adding a new wavelength link or replacing the bandwidth. Large wavelength link implementation.

Step 1039: Determine whether the total number of services is 0. If the judgment result is no, return to step 1032; if the determination result is yes, go to step 1040.

Step 1040: Obtain a network physical topology that forms a mapping relationship with the current network virtual topology according to the determined physical route of each selected service, and end the operation.

In this embodiment, a variable such as the total number of services is set, and each time a service is processed, 1 is subtracted to record whether virtual link information of all services is calculated.

If the judgment result is no, that is, the total number of services is not 0, indicating that there are still services that have not been processed, then continue to acquire the service and then process it. If the judgment result is yes, the total number of services is 0. If the virtual link information of all the services is calculated, the physical topology of the network that is mapped to the virtual topology of the network is obtained according to the determined physical route of all services, and the operation ends; at this time, according to step 1038, The network virtual topology after the updated virtual link information of the selected service is the first network topology, and the first network physical topology formed by the mapping with the first network virtual topology is obtained in step 1040.

The processing flow provided in this embodiment has the advantages of simple implementation, high efficiency, and the like while realizing the purpose of calculating the virtual link of the client layer according to the service layer physical route.

Further, after obtaining the first network virtual topology, the WDM network planning device may further optimize the first network virtual topology to obtain a third network virtual topology.

As shown in FIG. 3, in another embodiment of the present invention, after the step 105, the method further includes: Step 106: Delete at least one virtual link in the virtual topology of the first network, determine at least one affected service, and obtain the first Two network virtual topography.

At least one of the affected services includes the service of the deleted virtual link, that is, the service carried by the deleted virtual link.

Optionally, the WDM network planning device may randomly select at least one existing virtual link in the first network virtual topology to delete the virtual link. A service carried by the virtual link is called an affected service because the service is carried on each virtual link. The number of affected services is the number of services carried by the deleted virtual link.

It is noted that there may be multiple virtual links carrying the affected services, for example, one of them is deleted, and the bandwidth resource is also released, that is, the capacity of other virtual links carrying the affected services is modified. Therefore, obtaining the virtual topology of the second network in this embodiment refers to the virtual topology after releasing the bandwidth resources occupied by all affected services.

Step 107: Obtain virtual link information of each affected service in at least one affected service. Optionally, an implementation manner of step 107 includes: the wavelength division network planning device can calculate a shortest path corresponding to each physical route of each affected service; and obtain a shortest path corresponding to all physical routes of each affected service. The shortest path with the lowest link cost is selected as the target route of each affected service. The virtual link information of each affected service is determined according to the target route of each affected service and the bandwidth of each affected service.

Optionally, after the wavelength division network planning device determines the target route of each affected service, The physical route corresponding to the target route of each affected service can be determined as the physical route of each affected service.

For the process of calculating the shortest path corresponding to each physical route of each affected service, the description of the specific implementation manners of step 103 and step 103 is omitted. For the target route of each affected service and the bandwidth of each affected service, determine the virtual link information of each affected service. For details, refer to the description in step 104, and details are not described here.

Step 108: Update the number of virtual links in the virtual topology of the second network according to the number of virtual links in the virtual link information of each affected service to obtain a virtual topology of the third network.

The number of virtual links in the virtual topology of the second network is mainly increased according to the number of virtual links in the virtual link information of each affected service. / or delete the virtual link.

In this embodiment, the at least one virtual link in the virtual topology of the first network is deleted, and the affected service and the virtual topology of the second network are obtained, and then the virtual link information of the affected service is obtained, and then obtained according to the obtained virtual link. The number of virtual links in the virtual link information that affects the service is updated. The virtual topology of the second network is used to obtain the virtual topology of the third network, which optimizes the virtual topology of the network, which is beneficial to further reduce the planning cost of the multi-layer network.

The result of updating the number of virtual links in the virtual topology of the second network is usually: updating the second network virtual topology according to the number of virtual links in the virtual link information of each affected service obtained. The number of virtual links in the third network virtual topography obtained by Park is less than the number of virtual links in the virtual topology of the first network, so that the purpose of optimizing the virtual topology of the network can be achieved, but it is not limited thereto. For example, the result of updating the number of virtual links in the virtual topology of the second network may be: updating the second network virtual topology according to the number of virtual links in the virtual link information of each affected service. The number of virtual links in the obtained third network virtual topology is the same as the number of virtual links in the first network virtual topology. For this update result, the network virtual topology can be further updated.

Based on the above, as shown in FIG. 4, in another embodiment of the present invention, after step 108, the method further includes:

Step 109: Determine whether the update operation ends; if the determination result is no, perform step 110; otherwise, end the operation. Step 110: Determine whether the number of virtual links in the virtual topology of the third network is smaller than the number of virtual links in the virtual topology of the second network. If the determination result is no, go to step 111; if the judgment result is yes, execute Step 112.

Step 111: Restore the third network virtual topology to the second network virtual topology, and re-create the second network virtual topology as the first network virtual topology, and return to step 106 until the update operation ends.

Step 112: Re-establish the third network virtual topology as the first network virtual topology, and return to step 106 until the update operation ends.

This embodiment is equivalent to the process of continuously updating the virtual topology of the network for the purpose of reducing the number of virtual links in the virtual topology of the network.

After the end of each update, the third network virtual topology is obtained, and the number of virtual links in the virtual topology of the third network and the number of virtual links in the virtual topology of the second network before the update are obtained by the WDM network planning device. Comparing, that is, determining whether the number of virtual links in the third network virtual topology obtained by the update is smaller than the number of virtual links in the virtual topology of the second network before the update, that is, determining the updated third network virtual Whether the number of virtual links in the topology is smaller than the number of virtual links in the virtual topology of the first network, that is, whether the planning cost of the network is reduced. The number of virtual links in the network virtual topology determines the size of the network planning cost.

If the number of virtual links in the third network virtual topology obtained after the update is smaller than the number of virtual links in the virtual topology of the second network before the update, the result of the update is accepted, and the third network virtual topology is re-established. As the first network virtual topology continues the next update process, that is, returns to step 106 until the update process ends.

If the number of virtual links in the third network virtual topology obtained after the update is greater than or equal to the number of virtual links in the virtual topology of the second network before the update, the update result is rejected, and the third network is expanded. The PC is restored to the second network virtual topology, and the second network virtual topology is re-executed as the first network virtual topology to continue the next update process, that is, returning to step 106 until the update process ends. After the set update threshold is reached, the update processing operation ends. The update threshold may be input by the user or may be determined by the update algorithm used. When the processing time arrives, the update processing operation ends. The update processing time can be input by the user.

The update processing method provided in this embodiment has the advantages of simple implementation, fast processing speed, and reduced network. The cost of planning.

It is noted that, except that the update operation of the first network virtual topology is performed by using the update method shown in FIG. 4, the WDM network planning device may further optimize the number of virtual links in the first network virtual topology. The objective is to use a simulated annealing algorithm, an evolution algorithm, a particle swarm algorithm or an ant colony algorithm to optimize the virtual link in the network to obtain a third network virtual topology.

The simulated annealing algorithm, the evolution algorithm, the particle swarm algorithm, or the ant colony algorithm are all common optimization processing algorithms. Therefore, the specific embodiments of the present invention are not described.

In order to facilitate the understanding of the technical solutions provided by the foregoing embodiments of the present invention, a specific physical topology will be described in conjunction with specific services.

In this embodiment, the physical topology of the network is a linear physical topology, and the linear physical topology is: Node A-Node B-Node C-Node D-Node E. In this embodiment, there are three services in the network, and there is no protection service, that is, the number of service failures per service is 0, the bandwidth of each service is 2.5G, and the three services are: Service 1: Node A-node C; Service 2: Node C - Node E; Service 3: Node A - Node E. Node A and node C are the source node and the sink node of service 1, respectively; node C and node E are the source node and the sink node of service 2, respectively; node A and node E are the source node and the sink node of service 3, respectively.

In this embodiment, the capacity of each virtual link is preset to be 10 G. In the initial state, there is no virtual link in the network (that is, the network resource status is empty). In addition, the weight coefficients used are also preset to be wl=100, w2=5, w3=-l.

Let's start planning the linear physical topology above:

The first step is to calculate the physical route of each service based on the linear physical topology.

In this embodiment, a physical route is calculated for the service 1 according to the linear physical topology and the source and the sink node of the service 1, and the physical route is: node A-node B-node C;

Calculating a physical route for service 2 according to the linear physical topology and the source and sink nodes of service 2, the physical route is: node C-node D-node E;

According to the linear physical topology and the source and sink nodes of service 3, a physical route is calculated for service 3. The physical route is: node A-node B-node C-node D-node E.

The second step is to obtain the first network virtual topology.

First, sort the business and get the business planning order. In this embodiment, the order of the service planning obtained by the ordering is Service 1, Service 2, and Service 3. Next, plan for Business 1 first.

Service 1 has only one physical route, and the nodes passing through the physical route form a directed connection relationship, as shown in FIG. 5A. There are a total of three directed connections in the directed connection relationship, namely:

a directed connection formed by node A to node B;

a directed connection formed by node A to node C;

A directed connection formed by node B to node C.

The number of cross-node combinations selectable on the physical route is 2, and there is no cross node and node B as cross nodes. Since the number of virtual links in the current network is 0, if node B is selected as the cross-node, two virtual links need to be created, that is, a new fiber link corresponding to the directed connection formed by node A to node B needs to be new. Create a virtual link, the corresponding service installation cost is 1, and node A to node B only need one hop, so the corresponding OMS cost is 1, and since the virtual link needs to be newly created, there is no traffic, then the path The traffic on the link is 0. On the fiber link corresponding to the directed connection formed by the node B to the node C, a virtual link needs to be created. The corresponding service installation cost is also 1, and the node B to the node C only need one. The cost of the corresponding OMS is 1, and since the virtual link needs to be newly created, there is no traffic, and the traffic on the path is 0. If you do not have a cross-node, you need to create a virtual link. A virtual link needs to be created on the fiber link corresponding to the directed connection from node A to node C. The corresponding service installation cost is 1, because node A is Node C needs to go through two hops, so the corresponding OMS cost is 2, and since the virtual link needs to be newly created, there is no traffic, and the traffic on the path is 0.

Based on the above, the weight values of each directional connection in the directed connection relationship are respectively calculated according to the formula (1).

The weight value of the directed connection formed by node A to node B = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. The weight value of the directed connection formed by the node A to the node C=100*1+5*2+(-1)*0=110. The weight value of the directed connection formed by the node B to the node C = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. Based on the above, it is calculated that the shortest path of the physical routing node A-Node B-Node C is Node A-Node C, and the shortest link cost is 110. The wavelength division network planning device may first acquire all virtual link connections from the node A to the node C, and then add the weight values of the directed connections included in each virtual link connection as links of the corresponding virtual link connections. cost. For example, the directed connection from node A to node C is a virtual link connection with a link cost of 110; from node A to node B to node C is another virtual link connection, the link cost Is 105+105=210; then select the link cost as The link bearer mode of 110 is that node A to node C are the shortest. The method of calculating the shortest path is called a direct calculation method.

Optionally, in order to improve the efficiency of obtaining the shortest path, the WDM network planning device can take the direct connection relationship and the weight value of each directed connection as input, and directly use the shortest path calculated by the shortest path algorithm.

In addition, since only one physical route exists in the service 1, the shortest path corresponding to the physical route of the calculation service 1 is terminated after the shortest path corresponding to the physical route is calculated. The calculated shortest path is the destination route of service 1, and the physical route corresponding to the target route is also the physical route of service 1.

Since the target route of service 1 does not include a cross node (that is, does not include nodes other than the source node and the sink node), it is determined that the number of virtual links of service 1 is 1, and the virtual link is recorded as VLinkl, VLinkl. The source and sink nodes are node A and node C, respectively. Since the bandwidth of service 1 is 2.5G, the remaining bandwidth of VLink1 after carrying service 1 is 7.5G.

So far: The virtual topology of the network includes { ( VLinkl , SrcDst = A-C, Freeband=7.5 ) }. Where SrcDst represents the source and sink nodes of the virtual link; FreeBand represents the remaining bandwidth of the virtual link.

For service 1, the physical route of service 1 is: node A-node B-node C; the virtual link of service 1 is: VLinkl.

Next, plan for Business 2.

The planning process for Business 2 is similar to the planning process for Business 1. Service 2 also has only one physical route, and the nodes passing through the physical route form a directed connection relationship, as shown in FIG. 5B. The directed connection relationship includes three directed connections, which are:

a directed connection formed by node C to node D;

a directed connection formed by node C to node E;

The directed connection formed by node D to node E.

The number of cross-node combinations selectable on the physical route is 2, and there is no cross node and node D as cross nodes, respectively. If you select node D as the cross-node, you need to create two virtual links. That is, a virtual link needs to be created on the fiber link corresponding to the directed connection from node C to node D. The corresponding service installation cost is 1. Node C to node D only need one hop, so the corresponding OMS cost is 1, and since the virtual link needs to be newly created, there is no traffic, then the traffic on the path is 0; at node D to node E Newly created on the fiber link corresponding to the directed connection For a virtual link, the corresponding service installation cost is 1, and node D to node E only needs one hop, so the corresponding OMS cost is 1, and since the virtual link needs to be newly created, there is no traffic, then the path is The business volume is 0. If you do not have a cross-node, you need to create a virtual link, that is, a virtual link needs to be created on the fiber link corresponding to the directed connection from node C to node E. The corresponding service installation cost is 1. The node E needs two hops, so the corresponding OMS cost is 2, and since the virtual link needs to be newly created, there is no traffic, and the traffic on the path is 0.

The weight value of the directed connection formed by node C to node D = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. The weight value of the directed connection formed by node C to node E is 100*1+5*2+ ( -1 ) *0=110. The weight value of the directed connection formed by node D to node E = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. Based on the above, the wavelength division network planning device uses the direct calculation method or the shortest path calculation method to calculate the shortest path as the node C-node E, and the shortest link cost is 110.

In addition, since only the physical route exists in the service 2, after calculating the shortest path corresponding to the physical route, the shortest path corresponding to the physical route of the calculation service 2 is ended. The shortest path calculated is the target route of service 2. The physical route corresponding to the target route is also the physical route of service 2.

Since the target route of the service 2 does not include the cross node (that is, the node other than the source node and the sink node is not included), it is determined that the number of virtual links of the service 2 is 1, and the virtual link is recorded as VLink2, VLink2. The source and sink nodes are node C and node E, respectively. Since the bandwidth of service 2 is 2.5G, the remaining bandwidth of VLink2 after carrying service 2 is 7.5G.

So far: The virtual topology of the network includes { ( VLinkl , SrcDst =A-C, Freeband=7.5 ); ( VLink2, SrcDst =C-E, Freeband=7.5 ) }.

For Service 2, the physical route of Service 2 is: Node C-Node D-Node E; The virtual link of Service 2 is: VLink2.

Plan for business 3.

Service 3 also has only one physical route, and a node according to the physical route forms a directed connection relationship, as shown in FIG. 5C. The directed connection relationship includes 10 directed connections, which are:

a directed connection formed by node A to node B;

a directed connection formed by node A to node C; a directed connection formed by node A to node D;

a directed connection formed by node A to node E;

a directed connection formed by node B to node C;

a directed connection formed by node B to node D;

a directed connection formed by node B to node E;

a directed connection formed by node C to node D;

a directed connection formed by node C to node E;

The directed connection formed by node D to node E.

The number of cross-node combinations selectable on the physical route is 2 ³ = 8, which are: no cross nodes, node B as a cross node, node C as a cross node, node D as a cross node, node B and node C as a cross Nodes, Node B and Node D act as cross nodes, Node C and Node D act as cross nodes, and Node B, Node C and Node D act as cross nodes. Select the virtual link connections corresponding to different cross-node combinations:

If you do not select a cross-node, you need to create a virtual link, that is, a virtual link needs to be created on the fiber link corresponding to the directed connection from node A to node E. The corresponding service installation cost is 1, and node A is The node E needs four hops, so the corresponding OMS cost is 4. Since the virtual link needs to be newly created, there is no traffic, and the traffic on the path is 0.

Based on the above, the weight values of each directional connection are respectively calculated according to the formula (1).

The weight value of the directed connection formed by node A to node E = 100*1+5*4+ ( -1 ) *0=120. If you select Node B as the cross-node, you need to create two virtual links. The virtual link that corresponds to the directional connection formed by the node A to the node B needs to create a virtual link. The corresponding service installation cost is 1. Node A to Node B only need one hop, so the corresponding OMS cost is 1, and since the virtual link needs to be newly created, there is no traffic, then the traffic on the path is 0; at node B to node E A virtual link needs to be newly created on the fiber link corresponding to the directed connection. The corresponding service installation cost is 1, and the node B to node E needs three hops. Therefore, the corresponding OMS cost is 3, and the virtual link is required. Created, so there is no traffic, then the traffic on the path is 0.

The weight value of the directed connection formed by node A to node B = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. The weight value of the directed connection formed by the node B to the node E is 100*1+5*3+(-1)*0=115. If node C is selected as the cross node, the paired connection pair formed by node A to node C The virtual link VLink1 exists on the fiber link. Therefore, the virtual link is not required to be created. The corresponding service installation cost is 0. Node A to node C requires two hops. The corresponding OMS cost is 2, due to VLinkl. The service 1 is already present, so the traffic on the path is 1; the virtual link VLink2 already exists on the fiber link corresponding to the directed connection formed by the node C to the node E, so no new virtual link needs to be created. The service installation cost is 0. The node C to node E requires two hops, and the corresponding OMS cost is 2. Since the service 2 already exists on VLink2, the traffic on the path is 1.

The weight value of the directed connection formed by node A to node C = 100*0+5*2+ ( -1 ) *1=9. The weight value of the directed connection formed by node C to node E = 100 * 0 + 5 * 2 + ( -1 ) * 1 = 9. If you select node D as the cross-node, you need to create two virtual links, that is, a virtual link needs to be created on the fiber link corresponding to the directed connection from node A to node D. The corresponding service installation cost is 1. Node A to node D need three hops, so the corresponding OMS cost is 3, and since the virtual link needs to be newly created, there is no traffic, then the traffic on the path is 0; from node D to node E A virtual link needs to be created on the fiber link corresponding to the directed connection. The corresponding service installation cost is 1. The node D to node E needs one hop. Therefore, the corresponding OMS cost is 1, and the virtual link needs to be newly created. Therefore, there is no traffic, and the traffic on the path is 0.

The weight value of the directed connection formed by node A to node D = 100*1+5*3+ ( -1 ) *0=115. The weight value of the directed connection formed by node D to node E = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. If Node B and Node C are selected as the cross-nodes, since the virtual link VLink2 already exists on the fiber link corresponding to the directed connection formed by the node C to the node E, only the node A to the node B and the node B to the node respectively A virtual link is created on the fiber link corresponding to the directional connection formed by C. A virtual link needs to be created on the fiber link corresponding to the directional connection formed by the node A to the node B. The corresponding service installation cost is 1 , Node A to Node B need one hop, so the corresponding OMS cost is 1, and since the virtual link needs to be newly created, there is no traffic, then the traffic on the path is 0; at Node B to Node C A virtual link needs to be created on the fiber link corresponding to the directed connection. The corresponding service installation cost is 1, and the node B to node C needs one hop. Therefore, the corresponding OMS cost is 1, and the virtual link is required. Newly created, so there is no traffic, then the traffic on the path is 0.

Based on the above, the weight values of each of the directed connections are respectively calculated according to the formula (1). The weight value of the directed connection formed by node A to node B = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. The weight value of the directed connection formed by the node B to the node C = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. The weight value of the directed connection formed by node C to node E = 100 * 0 + 5 * 2 + ( -1 ) * 1 = 9. If you select Node B and Node D as the cross-nodes, you need to create three virtual links, that is, a virtual link needs to be created on the fiber link corresponding to the directed connection from Node A to Node B. The corresponding service installation cost is 1 , Node A to Node B need one hop, so the corresponding OMS cost is 1, and since the virtual link needs to be newly created, there is no traffic, then the traffic on the path is 0; Node B to Node D constitute A virtual link needs to be newly created on the fiber link corresponding to the directed connection. The corresponding service installation cost is 1, and the node B to node D needs two hops. Therefore, the corresponding OMS cost is 2, and since the virtual link needs new Created, so there is no traffic, the traffic on the path is 0; a virtual link needs to be created on the fiber link corresponding to the directed connection formed by the node D to the node E, and the corresponding service installation cost is 1. Node D to node E needs one hop, so the corresponding OMS cost is 1, and since the virtual link needs to be newly created, there is no traffic, and the traffic on the path is 0.

Based on the above, the weight values of each of the directed connections are respectively calculated according to the formula (1).

The weight value of the directed connection formed by node A to node B = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. The weight value of the directed connection formed by the node B to the node D=100*1+5*2+(-1)*0=110. The weight value of the directed connection formed by the node D to the node E = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. If you select Node B, Node C, and Node D as the cross-nodes, you need to create four virtual links, that is, a virtual link needs to be created on the fiber link corresponding to the directed connection from Node A to Node B. The installation cost is 1, the node A to the node B needs one hop, so the corresponding OMS cost is 1, and since the virtual link needs to be newly created, there is no traffic, then the traffic on the path is 0; A virtual link needs to be newly created on the fiber link corresponding to the directed connection formed by the node C. The corresponding service installation cost is 1, and the node B to node C needs one hop. Therefore, the corresponding OMS cost is 1, and the virtual chain is The road needs to be newly created, so there is no traffic, and the traffic on the path is 0. A virtual link needs to be created on the fiber link corresponding to the directed connection formed by the node C to the node D. The cost is 1, the node C to the node D needs one hop, so the corresponding OMS cost is 1, and since the virtual link needs to be newly created, there is no traffic, then the traffic on the path is 0; Directed connection of node E Need to create a new virtual link on the corresponding fiber link corresponding to the installation cost of a service, the node D to node E need to hop, Therefore, the corresponding OMS cost is 1, and since the virtual link needs to be newly created, there is no traffic, and the traffic on the path is 0.

The weight value of the directed connection formed by node A to node B = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. The weight value of the directed connection formed by node B to node C = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. The weight value of the directed connection formed by node C to node D = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. The weight value of the directed connection formed by node D to node E = 100 * 1 + 5 * 1 + ( -1 ) * 0 = 105. Based on the above, the WDM network planning device can calculate the shortest path to the node A-node C-node E using the direct calculation method or using the shortest path algorithm, and the shortest link cost is 18.

In addition, since only the physical route exists in the service 3, after calculating the shortest path corresponding to the physical route, the shortest path corresponding to the physical route of the calculation service 3 is ended. The shortest path calculated is the destination route of service 3. The physical route corresponding to the target route is also the physical route of service 3. The number of virtual links in service 3 is 2, and the two virtual links are VLink1 and VLink2. Since the bandwidth of service 3 is 2.5G, the remaining bandwidth of VLinkl and VLink2 after carrying service 3 is 5G.

So far: The virtual topography of the network includes { ( VLinkl , SrcDst = A-C, Freeband=5 ); ( VLink2, SrcDst =C-E, Freeband=5 ) }.

For service 3, the physical route of service 3 is: node A-node B-node C-node D-node E; the virtual link of service 3 is: VLinkl and VLink2.

At this point, the planning process for all services is completed, and the planning results of the WDM network are obtained.

5D shown. As shown in FIG. 5D, the virtual topology of the network in the WDM network planning result is composed of two virtual links, namely VLink1 and VLink2. The WDM network planning result also includes a network that forms a mapping relationship with the network virtual topology. Physical topology, the physical topology of the network is determined by the physical route of service 1: Node A - Node B - Node C, Physical route of Service 2: Node C - Node D - Node E and Physical route of Service 3: Node A - Node B-node C-node D-node E is constructed. In this embodiment, the physical route of the service 1 and the physical route of the service 2 coincide with the physical route of the service 3, and therefore, the network physical topology of the embodiment is visually observed by the physical route: Node A-Node B - Node C - Node D - Node E.

Step 3: Update the virtual topology of the network.

Stpl, deletes a virtual link. In this embodiment, the deleted virtual link is VLink1. And The affected services related to VLinkl are service 1 and service 3. The resources occupied by service 1 and service 3 are released, and the virtual topology of the network after the virtual link is deleted is obtained. This example is to delete a virtual link as an example, but is not limited thereto.

The virtual topology of the network after the virtual link is deleted includes { ( VLink2 , SrcDst=C-E , Freeband=7.5 ) }.

Stp2, return to the second step, re-planning for Business 1 and Business 3. The results of the planning for Business 1 and Business 3 are the same as those for the initial planning, so the results of the planning are rejected. At this point, the virtual topology of the network still includes: { ( VLinkl , SrcDst =AC, Freeband=5 ); ( VLink2, SrcDst =CE, Freeband=5 ) } ; For Service 1, the physical route of Service 1 is: Node A-Node B-Node C, the virtual link of Service 1 is: VLinkl; For Service 2, the physical route of Service 2 is: Node C-Node D-Node E, Virtual Link of Service 2 is: VLink2 For service 3, the physical route of service 3 is: node A-node B-node C-node D-node E, and the virtual link of service 3 is: VLinkl and VLink2.

If the number of updates has not reached the preset update threshold, continue to return to Stpl until the number of updates reaches the preset update threshold.

It is noted that the result of updating the virtual topology of the network includes at least one of the following: finally updating the capacity of the virtual link in the virtual topology of the network, and finally updating the virtual topology of the virtual link in the network. The number.

In various embodiments of the present invention, the update result of the virtual topology of the network is mainly based on the number of virtual links in the virtual topology of the network.

In summary, the WDM network planning method provided by the embodiment of the present invention is a multi-layer planning method based on the self-service layer to the client layer, avoiding the prior art from the client layer to the service layer planning idea. A series of problems can well control the hop count of the virtual topology in the customer layer, optimize the capacity of the virtual link in the virtual layer of the client layer, greatly improve the results of the multi-layer network planning, and reduce the planning cost. In addition, the design process of obtaining the virtual link information of the service according to the physical topology and the service requirement of the embodiment of the present invention can well guide the network management personnel to plan and design the virtual topology, thereby guiding the user to construct the network.

FIG. 6 is a schematic structural diagram of a WDM network planning device according to an embodiment of the present invention. As shown in FIG. 6, the device in this embodiment includes: a receiver 61, a route calculation unit 62, a shortest path calculation unit 63, a virtual topology acquisition unit 64, and a physical topology acquisition unit 65. The receiver 61 is configured to acquire a service requirement of the user. Business requirements include: the source node of each service, the sink nodes of each service, and the bandwidth of each service.

The route calculation unit 62 is connected to the receiver 61 and configured to calculate at least one physical route for each service. Each physical route of each service is a fiber link of a source node of each service acquired from the receiver 61 to a sink node of each service.

The shortest path calculation unit 63 is connected to the route calculation unit 62 for calculating the shortest path corresponding to each physical route of each service calculated by the route calculation unit 62. The shortest path corresponding to each physical route of each service is the virtual link connection with the lowest link cost when carrying each service through the virtual link on each physical route of each service; each physical route of each service The corresponding shortest link cost includes the cost of creating a virtual link carrying each service and the physical cost of each physical route of each service on each physical route of each service.

The virtual topology obtaining unit 64 is connected to the receiver 61 and the shortest path calculating unit 63, and selects the shortest path with the lowest link cost among the shortest paths corresponding to all physical routes of each service calculated from the shortest path calculating unit 63. As the target route of each service, the virtual link information of each service is determined according to the target route of each service and the bandwidth of each service acquired by the receiver 61. The virtual link information of each service includes the number of virtual links carrying each service and the capacity and end nodes of the virtual link carrying each service.

The physical topology obtaining unit 65 is connected to the virtual topology obtaining unit 64, and is configured to determine a physical route corresponding to the target route of each service acquired by the virtual topology obtaining unit 64, and obtain a mapping relationship with the virtual topology of the first network. The first network physical topology.

The function modules of the WDM network optimization device provided in this embodiment can be used to execute the process of the WDM network planning method shown in FIG. 1A. The specific working principle is not described here. For details, refer to the description of the method embodiments.

Further, the WDM network planning device of the embodiment further includes a memory for storing one or more of the following information: the service requirement of the user acquired by the receiver 61, and the physical route calculated by the route calculation unit 62, the shortest The shortest path calculated by the path calculating unit 63, the target route determined by the virtual topology obtaining unit 64, the obtained virtual link information and the first network virtual topology, and the target of each service determined by the physical topology obtaining unit 65 The physical route corresponding to the route and the obtained first network physical topology formed by mapping with the first network virtual topology. Correspondingly, the memory is connected to at least one or more of the following units: a receiver 61, a route calculation unit 62, a shortest path calculation unit 63, The virtual topology acquisition unit 64 and the physical topology acquisition unit 65.

Further, the WDM network planning device of the embodiment further includes a transmitter, configured to use the WDM network planning result, that is, the first network virtual topology and the first network physical topology that forms a mapping relationship with the first network virtual topology. ) is sent to a network management device or a Path Computation Element (PCE) or a display device.

Further, the wavelength division network planning device of the embodiment may include a power module, an input device, and an output device in addition to the above devices.

Here, in order to simplify the illustration, the memory, the receiver, the power supply module, the input device, the output device, and the like of the above-described wavelength division network planning device are not shown in the drawings.

The wavelength division network planning device of this embodiment may be various devices having computing capabilities, such as a computer, a server, and the like.

The wavelength division network planning device of the embodiment calculates at least one physical route for each service according to the physical topology of the source node, the sink node, and the network, and then calculates the shortest path corresponding to each physical route of each service. The shortest route with the lowest link cost is selected as the target route of each service from all the shortest paths corresponding to each service, and the virtual link information of each service is determined according to the target route and bandwidth of each service, and then the network virtual extension is obtained. Park, determines the physical route corresponding to the target route of each service, and then obtains the network physical topology that forms a mapping relationship with the network virtual topology, thereby obtaining the planning result of the WDM network. It can be seen that the WDM network planning device of the present embodiment determines the virtual link of the bearer service and the physical route that carries the virtual link based on the virtual link connection with the lowest link cost, and finally obtains the network virtual topology and the network virtual topology. The network physical topology of the mapping relationship is effectively reduced, and the cost of the multi-layer network planning is effectively reduced. In addition, the planning process of the wavelength division network planning device of the present embodiment is a planning process from the service layer to the customer layer. The process avoids various problems encountered in the design of the customer layer to the service layer in the prior art, and also reduces the cost of the multi-layer network planning.

Another embodiment of the present invention provides a computer program product comprising computer program code for performing the operations recited in the various method embodiments described above when a computer unit executes the computer program code. The specific content will not be described here.

FIG. 7 is a schematic structural diagram of a WDM network planning device according to another embodiment of the present invention. This embodiment can be implemented based on the embodiment shown in FIG. 6. As shown in FIG. 7, the device in this embodiment also includes at least: a receiver 61, a route calculation unit 62, a shortest path calculation unit 63, a virtual topology acquisition unit 64, and objects. The topology acquisition unit 65. In addition, the apparatus of this embodiment also includes devices such as a memory, a receiver, a power supply module, an input device, and an output device, which are not shown in the drawings for simplicity of illustration.

The shortest path calculation unit 63 of this embodiment includes: a formation subunit 631, an assignment subunit 632, and a calculation subunit 633.

The sub-unit 631 is formed, and is connected to the route calculation unit 62, and is configured to form a directional connection corresponding to each physical route of each service according to the node through which each physical route of each service calculated by the route calculation unit 62 passes. relationship. The directed connection relationship corresponding to each physical route of each service includes a directed connection between the two nodes of each service on each physical route of each service along the direction of the source node of each service to the sink node of each service.

The assignment sub-unit 632 is connected to the formation sub-unit 631, and is used to assign a weight value to each of the directed connections in the corresponding connection relationship corresponding to each physical route of each service formed by the sub-unit 631. If the virtual link exists on the fiber link corresponding to the connection, the weight of the directional connection is the physical cost of the fiber link corresponding to the directional connection; if there is no virtual link on the fiber link corresponding to the directional connection The weight of the link, the directed connection is the cost of creating a virtual link on the fiber link corresponding to the directed connection and the physical cost of the fiber link corresponding to the directed connection.

The calculation subunit 633 is connected to the formation subunit 631 and the assignment subunit 632 for the directed connection according to the directed connection relationship and the assignment subunit 632 corresponding to each physical route of each service formed by the subunit 631. The weight value of each directed connection in the relationship, and the shortest path corresponding to each physical route of each service is calculated.

Optionally, the calculating sub-unit 633 is specifically configured to input, by using a shortest path algorithm, a weighted value of each of the directed connection relationship and the directional connection in each of the directional connections of each physical route of each service. The shortest path corresponding to each physical route of the strip service.

Optionally, the assignment sub-unit 632 is specifically configured to calculate, according to the formula (1), a weight value of each directed connection in each of the directed connection relationships corresponding to each physical route of each service, and the calculated directed connection The weight value is assigned to the directed connection in the directed connection relationship corresponding to each physical route of each service. For the formula (1), refer to the description in the above method embodiment.

Further, the virtual topology obtaining unit 64 of this embodiment includes: a first determining subunit 641, a second determining subunit 642, a third determining subunit 643, and an obtaining subunit 644.

The first determining sub-unit 641 is connected to the calculating sub-unit 633, and is configured to select the lowest link cost among the shortest paths corresponding to all the physical routes of each service calculated from the calculating sub-unit 633. The shortest path is the target route for each service. Optionally, the first determining subunit 641 is further connected to the physical topology obtaining unit 65, and is configured to provide the physical topology obtaining unit 65 with a target route of each service.

The second determining sub-unit 642 is connected to the first determining sub-unit 641, and is configured to determine, according to the cross-nodes on the target route of each service determined by the first determining sub-unit 641, the virtual link that carries each service. The number and the end node of each virtual link that carries each service. The target node of each service is the node on the route of each service except the source node of each service and the node of each service.

The third determining subunit 643 is connected to the receiver 61 and the second determining subunit 642, and is configured to determine, according to the bandwidth of each service acquired by the receiver 61, each bearer determined by the second determining subunit 642 The capacity of a virtual link.

The obtaining sub-unit 644 is configured to determine, according to the second determining sub-unit 642, the number of virtual links carrying each service, and the end node of each virtual link carrying each service and the third determining sub-unit 643. The capacity of each virtual link carrying each service is obtained, and the first network virtual topology is obtained.

Further, the WDM network planning device of this embodiment further includes: an impact service determining unit 66, a virtual link obtaining unit 67, and a virtual topology updating unit 68.

The influencing service determining unit 66 is connected to the obtaining sub-unit 644 in the virtual topology obtaining unit 64, and is configured to delete at least one virtual link in the first network virtual topology obtained by the obtaining sub-unit 644, and determine at least one piece. Affected business, obtain the second network virtual topology. The affected service is a virtual link. The information includes the service of the deleted virtual link.

The virtual link obtaining unit 67 is connected to the impact service determining unit 66, and configured to obtain the virtual link information of each of the at least one affected service determined by the impact determining unit 66.

The virtual topology update unit 68 is connected to the impact service determining unit 66 and the virtual link obtaining unit 67, and is configured to use the number of virtual links in the virtual link information of each affected service obtained by the virtual link obtaining unit 67. And updating the number of virtual links in the second network virtual topology obtained by the service determining unit 66, and acquiring the third network virtual topology. Generally, the number of virtual links in the third network virtual topology acquired by the virtual topology update unit 68 is smaller than the number of virtual links in the virtual topology of the first network, but is not limited thereto.

The virtual link obtaining unit 67 includes: a shortest path calculating subunit 671 and a virtual link determining subunit 672.

The shortest path calculation subunit 671 is connected to the impact service determining unit 66 for calculation. The shortest path corresponding to each physical route of each affected service determined by the service determining unit 66 is determined.

The virtual link determining subunit 672 is connected to the shortest path calculating subunit 671 for selecting the shortest link cost of the shortest path corresponding to all physical routes of each affected service calculated from the shortest path calculating subunit 671 As the target route of each affected service, the virtual link information of each affected service is further determined according to the target route of each affected service and the bandwidth of each affected service. The WDM network planning of this embodiment The device also includes: a first iteration unit 69. The first iteration unit 69 is connected to the impact service determining unit 66 and the virtual topology update unit 68, and the number of virtual links in the third network virtual topology obtained by the virtual topology update unit 68 is greater than or When the number of virtual links in the second network virtual topology obtained by the service determining unit 66 is affected, the three network virtual topologies are restored to the second network virtual topology, and the second network virtual topology is re-established as the first network virtual The topology, the triggering impact service determining unit 66 re-executes deleting at least one virtual link in the first network virtual topology, determining at least one affected service, and obtaining the operation of the second network virtual topology.

Further, the wavelength division network planning device of this embodiment further includes: a second iteration unit 70. The second iteration unit 70 is connected to the impact service determining unit 66 and the virtual topology update unit 68, and the number of virtual links in the third network virtual topology obtained by the virtual topology update unit 68 is smaller than the impact service determination. When the number of virtual links in the second network virtual topology obtained by the unit 66 is used, the third network virtual topology is re-established as the first network virtual topology, and the trigger impact service determining unit 66 re-executes the first network virtual topology. At least one virtual link is deleted, and at least one affected service is determined, and the operation of the second network virtual topology is obtained.

Optionally, the route calculation unit 62 of this embodiment may be specifically configured to calculate at least one physical route for each service by using a KSP algorithm.

Optionally, the service requirements of this embodiment include: the number of failures allowed for each service. Then, the route calculation unit 62 may be specifically configured to calculate at least one link separation route for each service by using a link separation algorithm. A link-separated route is a physical route that satisfies the number of failures that a service is allowed to bear. Or,

The route calculation unit 62 may be specifically configured to calculate at least one node separate route for each service by using a node separation algorithm. A node-separated route is a physical route that satisfies the number of failures that the service is allowed to bear. Or The route calculation unit 62 may be specifically configured to calculate at least one SRLG separate route for each service using the SRLG separation algorithm. The SRLG separation route is a physical route that meets the number of failures that the service is allowed to bear.

The foregoing functional units or sub-units can be used to perform the corresponding processes in the foregoing method embodiments shown in FIG. 1B to FIG. 5D, and the specific working principles are not described herein.

A person skilled in the art can understand that all or part of the steps of implementing the above method embodiments may be completed by using hardware related to program instructions, and the foregoing program may be stored in a computer readable storage medium, and the program is executed when executed. The method includes the steps of the foregoing method embodiments; and the foregoing storage medium includes: a medium that can store program codes, such as a ROM, a RAM, a magnetic disk, or an optical disk.

Finally, it should be noted that the above embodiments are only for explaining the technical solutions of the present invention, and are not intended to be limiting thereof; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art will understand that The technical solutions described in the foregoing embodiments may be modified, or some or all of the technical features may be equivalently replaced; and the modifications or substitutions do not deviate from the technical solutions of the embodiments of the present invention. range.

Claims

Claim

A method for planning a wavelength division network, characterized in that it comprises:

Calculating, for each of the services, at least one physical route, where each physical route of each service is a fiber link from a source node of each service to a sink node of each service;

Calculating a shortest path corresponding to each physical route of each service, where a shortest path corresponding to each physical route of each service is carried by a virtual link on each physical route of each service The virtual link connection with the lowest link cost for each service; the shortest link cost corresponding to each physical route of each service includes newly creating each of the physical routes on each of the services The cost of the virtual link of the service and the physical cost of each physical route of each service; selecting the shortest route with the lowest link cost from the shortest path corresponding to all the physical routes of each service The target route of the service, determining the virtual link information of each service according to the target route of each service and the bandwidth of each service, and obtaining the virtual topology of the first network; The link information includes the number of virtual links carrying the each service and the capacity and end nodes of each virtual link carrying the each service;

2. The wavelength division network planning method according to claim 1, wherein the calculating the shortest path corresponding to each physical route of each service includes:

And forming, according to the node that each physical route of each service passes, a directional connection relationship corresponding to each physical route of each service, where the directional connection relationship corresponding to each physical route of each service includes a directed connection between the two nodes of each physical route of each service along the direction of the source node of each service to the destination node of each service;

And assigning a weight value to each of the directed connections in the directional connection relationship corresponding to each of the physical routes of the service; wherein, if a virtual link exists on the fiber link corresponding to the directional connection, The weight of the directional connection is the physical cost of the fiber link corresponding to the directional connection; if there is no virtual link on the fiber link corresponding to the directional connection, the weight value of the directional connection is in the Describe the cost of creating a virtual link on the fiber link corresponding to the connection and the physical cost of the fiber link corresponding to the directed connection; Calculating a shortest path corresponding to each physical route of each service according to the directional connection relationship corresponding to each physical route of each service and the weight value of each directional connection in the directed connection relationship .

The wavelength division network planning method according to claim 2, wherein the directed connection relationship corresponding to each physical route of each of the services and each of the directed connection relationships are directed The weighted value of the connection, the shortest path corresponding to each physical route of each of the services is: the directional connection relationship corresponding to each physical route of each service and each of the directional connections The weighted value of the directed connection is used as an input, and the shortest path algorithm is used to calculate the shortest path corresponding to each physical route of each service.

The wavelength division network planning method according to claim 2 or 3, wherein the weighting value of each directed connection in the directed connection relationship corresponding to each physical route of each of the services is performed. Includes:

Calculating, according to the formula, a weight value of each directed connection in the directed connection relationship corresponding to each physical route of each service; assigning the calculated weight value of the directed connection to each of the services a directed connection in a directed connection relationship corresponding to each physical route;

The formula is: Cos=wl* business installation cost +w2* optical multiplex section cost +w2* traffic on the path,

Wherein Cos is a calculated weight value of the directed connection;

The service installation cost is the cost of creating a virtual link on the fiber link corresponding to the directed connection;

The optical multiplex section cost is the physical cost of the fiber link corresponding to the directional connection; the traffic volume on the path is the traffic volume on the virtual link already existing on the fiber link corresponding to the directional connection ;

Wl, w2, and w3 are weight coefficients.

The wavelength division network planning method according to any one of claims 1 to 4, wherein the determining, according to the target route of each service and the bandwidth of each service, determining each service Virtual link information includes:

Determining, according to the cross-nodes on the target route of each service, the number of virtual links carrying each of the services, and the end nodes of each virtual link carrying the each service, where each service is The cross-node on the target route is the source of each of the services on the target route of each of the services a node and a node other than the sink node of each of the services;

Determining, according to the bandwidth of each service, the capacity of each virtual link that carries the each service.

The wavelength division network planning method according to any one of claims 1 to 5, further comprising: after obtaining the first network virtual topology:

Deleting at least one virtual link in the first network virtual topology, determining at least one affected service, and obtaining a second network virtual topology; wherein the at least one affected service is a virtual link information including deleted virtual Link service;

And obtaining the virtual link information of each of the at least one affected service; and updating the second network virtual topology according to the number of virtual links in the virtual link information of each affected service The number of virtual links in the network is obtained as the virtual topology of the third network.

The method for planning a WDM network according to claim 6, wherein the obtaining the virtual link information of each of the affected services in the at least one affected service comprises:

Calculating a shortest path corresponding to each physical route of each affected service;

Selecting the shortest route with the lowest link cost from the shortest path corresponding to all the physical routes of the affected service as the target route of each affected service, according to the target route and the location of each affected service The bandwidth of each affected service determines the virtual link information of each affected service.

The wavelength division network planning method according to claim 6 or 7, wherein after the obtaining the third network virtual topology, the method further comprises:

If the number of virtual links in the third network virtual topology is greater than or equal to the number of virtual links in the second network virtual topology, restore the third network virtual topology to the second Deleting the second network virtual topology as the first network virtual topology, and returning to perform deletion of at least one virtual link in the first network virtual topology, determining that at least one of the virtual links is affected Business, obtaining the operation of the second network virtual topology.

If the number of virtual links in the third network virtual topology is smaller than the number of virtual links in the virtual topology of the second network, the third network virtual topology is re-established as the first network virtual The topology returns to perform the operation of deleting at least one virtual link in the first network virtual topology, determining at least one affected service, and obtaining a virtual topology of the second network.

The method for planning a wavelength division network according to any one of claims 1 to 9, wherein the calculating at least one physical route for each of the services includes:

The K shortest path algorithm is used to calculate at least one physical route for each of the services, and K is an integer greater than zero.

The wavelength division network planning method according to any one of claims 1 to 9, wherein the service requirement further includes: a number of failures allowed for each of the services;

The calculating, for the each service, the at least one physical route includes:

A link separation algorithm is used to calculate at least one link separation route for each of the services, and the link separation route is a physical route that satisfies the number of failures allowed.

The WDM network planning method according to any one of claims 1 to 9, wherein the service requirement further includes: the number of failures allowed by each of the services;

A node separation algorithm is used to calculate at least one node separation route for each of the services, and the node separation route is a physical route that satisfies the number of failures allowed.

The shared risk link group separation algorithm is used to calculate at least one shared risk link group separate route for each of the services, and the shared risk link group separate route is a physical route that satisfies the number of failures allowed.

A computer program product, comprising computer program code, wherein when a computer unit executes the computer program code, the computer unit performs the actions recited in any one of claims 1-13.

15. A wavelength division network planning device, comprising:

a shortest path calculation unit, configured to calculate a shortest path corresponding to each physical route of each service, The shortest path corresponding to each physical route of each service is a virtual link connection with the lowest link cost when each of the services is carried by the virtual link on each physical route of each service; The shortest link cost corresponding to each physical route of each service includes the cost of newly creating a virtual link carrying each of the services on each physical route of each service and each of the services Physical cost of physical routing;

a virtual topology obtaining unit, configured to select a shortest path with the lowest link cost from a shortest path corresponding to all physical routes of each service as a target route of each service, according to the target route of each service The virtual link information of each of the services is determined by the bandwidth of each of the services, and the virtual link information of each of the services includes the number of virtual links that carry the service and each of the services. Capacity and end nodes of each virtual link;

The wavelength division network planning device according to claim 15, wherein the shortest path calculation unit comprises:

Forming a sub-unit, configured to form a directional connection relationship corresponding to each physical route of each service according to a node that is used by each physical route of each service, where each physical route of each service corresponds to The directed connection relationship includes a directed connection between the two nodes on each physical route of each service along the direction of the source node of each service to the sink node of each service;

An assignment sub-unit, configured to assign a weight value to each of the directed connections in the directional connection relationship corresponding to each physical route of each of the services; wherein, if the fiber link corresponding to the directional connection already exists a virtual link, the weight of the directional connection is a physical cost of the fiber link corresponding to the directional connection; if there is no virtual link on the fiber link corresponding to the directional connection, the directional connection The weight value is the cost of creating a virtual link on the fiber link corresponding to the directed connection and the physical cost of the fiber link corresponding to the directed connection;

a calculating subunit, configured to calculate each of the each service according to a directed connection relationship corresponding to each physical route of each service and a weight value of each directed connection in the directed connection relationship The shortest path corresponding to the physical route.

The wavelength division network planning device according to claim 16, wherein the calculation subunit is specifically configured to use a directional connection relationship and the directional connection corresponding to each physical route of each of the services. The weight value of each directed connection in the input is used as an input, and the shortest path algorithm is used to calculate the The shortest path corresponding to each physical route of each service.

The wavelength division network planning device according to claim 16 or 17, wherein the assignment subunit is specifically configured to calculate a directed connection relationship corresponding to each physical route of each service according to a formula. a weighted value of each directed connection, the calculated weight value of the directed connection is assigned to a directed connection in a directed connection relationship corresponding to each physical route of each service; : Cos=wl* business installation cost + w2 * optical multiplex section cost + w2 * traffic on the path,

Wherein Cos is a calculated weight value of the directed connection;

Wl, w2, and w3 are weight coefficients.

The wavelength division network planning device according to any one of claims 15 to 18, wherein the virtual topology acquisition unit comprises:

a first determining subunit, configured to select a shortest path with the lowest link cost from a shortest path corresponding to all physical routes of each service as a target route of each service;

a second determining subunit, configured to determine, according to the cross node on the target route of each service, the number of virtual links that carry the each service, and each virtual link that carries each of the services The end node, the cross-node on the target route of each service is a node other than the source node of each service and the sink node of each service of the target route of each service;

a third determining subunit, configured to determine, according to the bandwidth of each service, a capacity of each virtual link that carries each of the services;

And obtaining the sub-unit, configured to obtain the first network virtual topology according to the number of virtual links carrying the service and the end node and capacity of each virtual link that carries the service.

The wavelength division network planning device according to any one of claims 15 to 19, further comprising:

An impact determining unit, configured to delete at least one virtual link in the first network virtual topology, determine at least one affected service, and obtain a second network virtual topology; the at least one affected The service includes the service of the deleted virtual link in the virtual link information.

a virtual link obtaining unit, configured to obtain virtual link information of each affected service in the at least one affected service;

a virtual topology update unit, configured to update a virtual link in the virtual topology of the second network according to the number of virtual links in the virtual link information of each affected service obtained by the virtual link obtaining unit Number, get the third network virtual topology.

The wavelength division network planning device according to claim 20, wherein the virtual link obtaining unit comprises:

a shortest path calculation subunit, configured to calculate a shortest path corresponding to each physical route of each of the affected services;

a virtual link determining sub-unit, configured to select a shortest path with the lowest link cost from the shortest path corresponding to all the physical routes of each of the affected services, as the target route of each of the affected services, according to each The target route of the affected service and the bandwidth of each of the affected services determine the virtual link information of each of the affected services.

The device of the wavelength division network according to claim 20 or 21, further comprising:

a first iteration unit, configured to: when the number of virtual links in the third network virtual topology is greater than or equal to the number of virtual links in the second network virtual topology, Restoring the topology to the second network virtual topology, and re-executing the second network virtual topology as the first network virtual topology, triggering the impact service determining unit to re-execute the first network virtual topology At least one virtual link is deleted, and at least one affected service is determined, and the operation of the second network virtual topology is obtained.

The device according to claim 20 or claim 21, further comprising:

a second iteration unit, where the number of virtual links in the third network virtual topology is smaller than the number of virtual links in the second network virtual topology, and the third network virtual topology is re-created And the at least one virtual link in the first network virtual topology is deleted, the at least one affected service is determined, and the second network virtual topology is obtained. Park's operation.

The wavelength division network planning device according to any one of claims 15 to 23, wherein the route calculation unit is specifically configured to calculate at least each of the services by using K shortest path algorithms. A physical route, K is an integer greater than zero.

The wavelength division network planning device according to any one of claims 15 to 23, wherein the service requirement further includes: the number of failures allowed by the each service;

The route calculation unit is specifically configured to calculate, by using a link separation algorithm, at least one link separation route for each of the services, where the link separation route is a physical route that satisfies the number of failures allowed to be received.

The route calculation unit is specifically configured to calculate, by using a node separation algorithm, at least one node separate route for each of the services, where the node separate route is a physical route that satisfies the number of failures allowed.

The wavelength division network planning device according to any one of claims 15 to 23, wherein the service requirement further includes: a number of failures allowed for each of the services;

The route calculation unit is configured to calculate, by using a shared risk link group separation algorithm, at least one shared risk link group separate route for each of the services, where the shared risk link group separate route is to meet the allowable The physical route of the number of failures.