WO2014019167A1 - Procédé et dispositif de planification de réseau à multiplexage par répartition en longueur d'onde - Google Patents

Procédé et dispositif de planification de réseau à multiplexage par répartition en longueur d'onde Download PDF

Info

Publication number
WO2014019167A1
WO2014019167A1 PCT/CN2012/079502 CN2012079502W WO2014019167A1 WO 2014019167 A1 WO2014019167 A1 WO 2014019167A1 CN 2012079502 W CN2012079502 W CN 2012079502W WO 2014019167 A1 WO2014019167 A1 WO 2014019167A1
Authority
WO
WIPO (PCT)
Prior art keywords
service
link
node
och
physical
Prior art date
Application number
PCT/CN2012/079502
Other languages
English (en)
Chinese (zh)
Inventor
刘欣超
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to CN201280001096.2A priority Critical patent/CN102907053B/zh
Priority to PCT/CN2012/079502 priority patent/WO2014019167A1/fr
Publication of WO2014019167A1 publication Critical patent/WO2014019167A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J14/00—Optical multiplex systems
    • H04J14/02—Wavelength-division multiplex systems
    • H04J14/0227—Operation, administration, maintenance or provisioning [OAMP] of WDM networks, e.g. media access, routing or wavelength allocation
    • H04J14/0254—Optical medium access
    • H04J14/0272—Transmission of OAMP information
    • H04J14/0273—Transmission of OAMP information using optical overhead, e.g. overhead processing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J14/00—Optical multiplex systems
    • H04J14/02—Wavelength-division multiplex systems
    • H04J14/0227—Operation, administration, maintenance or provisioning [OAMP] of WDM networks, e.g. media access, routing or wavelength allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J14/00—Optical multiplex systems
    • H04J14/02—Wavelength-division multiplex systems
    • H04J14/0278—WDM optical network architectures
    • H04J14/0284—WDM mesh architectures

Definitions

  • the present invention relates to optical communication technologies, and in particular, to a wavelength division network planning method and device. Background technique
  • WDM Wavelength Division Multiple
  • 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 virtual topology is mapped, 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 is corresponding to the virtual topology. Physical topology.
  • the most common method for creating a virtual topology is to pre-establish a full mesh virtual topology, that is, a virtual link is established between any two nodes, and then a certain algorithm is used to optimize according to the service matrix.
  • Embodiments of the present invention provide a WDM network planning method and device for improving the efficiency of a WDM network plan.
  • a WDM network planning method including:
  • each physical node in the physical topology to form a two-layer topology, where the two-layer topology includes each physical node, a logical node mapped by each physical node, and each physical node and each physical node are connected. a port link of the mapped logical node and a physical link of the connected physical node existing in the physical topology; For each service in the pre-acquired service matrix, if there is an optical channel OCH in the double-layer topology that can carry the service and pass the end node of the service, according to the OCH, for each OCH that exists, according to the OCH
  • the end node of the service is a pseudo-logical link formed by the logical link corresponding to the OCH, and the logical link corresponding to the OCH is connected between the logical nodes mapped by the physical nodes at both ends of the OCH.
  • the pseudo-logical link is an end node connected to the service, and calculates a service route of the service in the double-layer topology, and determines the service according to a link type passed by the service route.
  • calculating a service route of the service in the double layer topology includes:
  • the first node set is not empty, obtaining a first node with the lowest link cost of the source node of the service from the first node set, and collecting the first node from the first node Moving to the second node set, acquiring a first link with the first node as an endpoint; a link cost of the first node to a source node of the service is the first node to the service The sum of the weight values of the links through which the source node passes;
  • the predecessor link of the second node refers to a link that needs to pass from the source node of the service to the second node and is the end point of the second node.
  • the method further includes: a link cost of the first node to a source node of the service and a weight value of the first link
  • the first link is a pseudo logical link
  • the link cost of updating the second node to the source node of the service is the link cost of the first node to the source node of the service Determining a sum of weight values of the first link, and updating the precursor link of the second node as the first link until calculating a link from a source node of the service to a sink node of
  • determining the physical route corresponding to the OCH on the service route and the OCH on the service route according to the link type of the service route includes:
  • an OCH is created between the physical nodes corresponding to the port link through which the service route passes, and the service route is determined from the physical node of the created OCH-end to the other end.
  • the physical node and the physical link that the physical node passes through constitute the physical route corresponding to the created OCH.
  • the determining, according to the link type of the service route, the OCH on the service route and the PHY corresponding to the OCH on the service route Routing includes:
  • the service route passes through a pseudo logical link, respectively create a pseudo of the service route.
  • the physical node and the physical link on the service route from the physical node of the created OCH-side to the physical node at the other end constitute the physical route corresponding to the created OCH, and the pseudo-logical link through which the service is routed,
  • the OCH corresponding to the logical link associated with the pseudo-logical link through which the service route passes, and the logic associated with the pseudo-logical link in the double-layer topology except the pseudo-logical link through which the service route passes In an optional implementation manner of the method, the determining, according to the link type of the service route, the OCH on the service route and the physical route corresponding to the OCH on the service route, including:
  • the OCH corresponding to the logical link through which the service route passes and the physical route corresponding to the OCH corresponding to the logical link through which the service route passes are determined.
  • the method after determining the OCH on the service route and the physical route corresponding to the OCH on the service route, the method includes:
  • the two OCHs corresponding to the same physical route are merged, and the logical links corresponding to the merged OCH are:
  • the service carried by the other OCH Incorporating the OCH whose remaining capacity is greater than or equal to the total capacity of the service carried by the another OCH, deleting the other OCH and the logical link corresponding to the other OCH.
  • the two OCHs corresponding to the same physical route are merged, and the logical links corresponding to the merged OCH are:
  • the physical route corresponding to the other OCH will be The remaining capacity is greater than or equal to the other OCH
  • the OCH of the total capacity of the carried service is split into two OCHs, and the logical link corresponding to the OCH whose remaining capacity is greater than or equal to the total capacity of the service carried by the other OCH is split into two logical chains. And deleting the service carried by the another OCH into the same OCH that is the same as the physical route corresponding to the another OCH, and deleting the logic corresponding to the other OCH and the other OCH link.
  • Another aspect provides a wavelength division network planning device, including:
  • a forming unit configured to map each physical node in the physical topology to form a double layer topology, where the double layer topology includes each physical node, a logical node mapped by each physical node, and each physical node is connected a port link of a logical node mapped with each physical node and a physical link of the connected physical node existing in the physical topology;
  • a service processing unit configured to: for each service in the pre-acquired service matrix, if there is an optical channel OCH in the double-layer topology that can carry the service and pass the end node of the service,
  • the OCH according to the end node of the service that the OCH passes, forms a pseudo logical link for the logical link corresponding to the OCH, and the logical link corresponding to the OCH is mapped by the physical node connected to the two ends of the OCH.
  • a link between the logical nodes, wherein the pseudo logical link is a link between a logical node mapped by the end node connected to the service and a logical node at both ends of the logical link corresponding to the OCH;
  • a first acquiring unit configured to calculate a service route of the service in the double-layer topology, and determine, according to a link type of the service route, an OCH on the service route and the service route
  • the physical route corresponding to the OCH obtains a first planning result, where the first planning result includes an OCH on a service route of each service in the service matrix and a physical route corresponding to an OCH on the service route.
  • the first acquiring unit includes:
  • Generating a subunit configured to generate a first node set including an initial value including all physical nodes and a logical node in the double layer topology, and generating a second node set whose initial value is null;
  • a setting unit configured to set a weight value for the physical link, the logical link, the port link, and the pseudo logical link in the double layer topology, where the port link The weight value of the physical link is greater than the weight value of the physical link, and the weight value of the physical link is greater than the weight value of the logical link and the weight value of the pseudo logical link;
  • Obtaining a sub-unit configured to: when the first node set is not empty, obtain a first node with a lowest link cost of a source node of the service from the first node set, and use the first node from the first node The first node set moves to the second node set, and acquires a first link with the first node as an endpoint; a link cost of the first node to a source node of the service is the first The sum of the weight values of the links that a node passes to the source node of the service;
  • An update processing subunit configured to: for each first link that is an endpoint of the first node, a link cost of the first node to a source node of the service, and a weight of the first link When the sum of the values is less than the link cost of the second node that is the other end of the first link to the source node of the service, if the first link is a logical link, and from the first Determining the existence of a pseudo logical link in the link between the first link and the source node from the first node to the service, if the node has a pseudo logical link in the link through which the source node of the service passes.
  • the link cost of updating the second node to the source node of the service is the link cost of the first node to the source node of the service. And a sum of weight values of the first link, and updating a precursor link of the second node as the first link until calculating a source node from the service to a sink node of the service.
  • the predecessor link of the second node refers to a link that needs to pass from the source node of the service to the second node and is the end point of the second node;
  • a first result obtaining sub-unit configured to determine, according to a link type of the service route, an OCH on the service route and a physical route corresponding to an OCH on the service route, until the service matrix is determined
  • the first planned result is obtained by the OCH on the service route of all services and the physical route corresponding to the OCH on the service route.
  • the update processing subunit is further configured to: when the first node sends a link cost to the source node of the service, the first link When the sum of the weight values is smaller than the link cost of the second node that is the other end of the first link to the source node of the service, if the first link is a pseudo logical link, and Determining that the first link to the source node of the service includes a logical link, and determining that the first link exists in a link that passes from the first node to a source node of the service Whether the OCH corresponding to the logical link is the same OCH, and if the determination result is no, updating the link cost of the second node to the source node of the service is the link of the first node to the source node of the service And a sum of the cost and the weight value of the first link, and updating the precursor link of the second node as the first link until the calculation is performed From the source node of the service to the service
  • the service processing unit is further configured to: after forming a pseudo logical link for the logical link corresponding to the OCH, the formed pseudo logical link Correlating with the logical link corresponding to the OCH, to identify that the formed pseudo logical link corresponds to the same OCH as the logical link corresponding to the OCH;
  • the first result obtaining sub-unit is specifically configured to: if the service route passes through the port link, create an OCH between the physical nodes corresponding to the port link through which the service route passes, and determine the service route.
  • the physical node and the physical link that pass from the physical node of the created OCH-end to the physical node of the other end constitute the physical route corresponding to the created OCH.
  • the first result obtaining subunit is specifically configured to: if the service route passes through a pseudo logical link, respectively create the service route to determine the service.
  • the physical node and the physical link on the route from the physical node of the created OCH-end to the physical node at the other end constitute the physical route corresponding to the created OCH, and the pseudo-logical link and the route through which the service is routed
  • the first result obtaining sub-unit is specifically configured to: if the service route passes through a logical link, determine an OCH corresponding to a logical link through which the service route passes, and a logical link corresponding to the service route The physical route corresponding to the OCH.
  • the service processing unit is further configured to determine, after determining an OCH on the service route and a physical route corresponding to an OCH on the service route, Whether the remaining capacity of one of the OCHs is greater than or equal to the total capacity of the service carried by the other OCH in the OCH corresponding to the two identical or partially identical physical routes in the double-layer topology, and if so, the two The OCHs corresponding to the same or partially identical physical routes are merged, and the logical links corresponding to the combined OCHs are adjusted.
  • the service processing unit is specifically configured to: if the remaining capacity is greater than or equal to the OCH of the total capacity of the service carried by another OCH If the length of the corresponding physical route is greater than or equal to the length of the physical route corresponding to the another OCH, the service carried by the other OCH is merged into the remaining capacity that is greater than or equal to that carried by the other OCH.
  • the OCH of the total capacity of the service deletes the other OCH and the logical link corresponding to the other OCH.
  • the service processing unit is specifically configured to: if the remaining capacity is greater than or equal to the length of the physical route corresponding to the total capacity of the service carried by the other OCH If the length of the physical route corresponding to the other OCH is smaller than the physical route corresponding to the other OCH, the OCH with the remaining capacity greater than or equal to the total capacity of the service carried by the other OCH is split.
  • the two OCHs split the logical link corresponding to the OCH whose remaining capacity is greater than or equal to the total capacity of the service carried by the other OCH into two logical links, and the service carried by the other OCH In the one OCH that is merged into the same physical route as the other OCH, the other OCH and the logical link corresponding to the other OCH are deleted.
  • a wave division network planning device including:
  • mapping each physical node in the physical topology to form a two-layer topology where the two-layer topology includes each physical node, a logical node mapped by each physical node, and each physical node and each physical node are connected. a port link of the mapped logical node and a physical link of the connected physical node existing in the physical topology;
  • the end node of the service is a pseudo-logical link formed by the logical link corresponding to the OCH, and the logical link corresponding to the OCH is connected between the logical nodes mapped by the physical nodes at both ends of the OCH. a link between the logical node that is connected to the source node or the sink node and the logical node that is connected to the logical link of the OCH;
  • the physical route is obtained, and the first planning result is obtained, where the first planning result includes an OCH on a service route of each service in the service matrix and a physical route corresponding to an OCH on the service route.
  • a computer program product comprising computer program code for performing the operations recited by any of the wavelength division network planning methods provided by one aspect of the present invention when a computer unit executes the computer program code.
  • the WDM network planning method and device map a physical node in a physical topology to generate a two-layer topology with logical topology information and dynamic topology information.
  • the existing OCH is interrupted to form a double-layer topology.
  • the existing OCH is preferentially used, and then the service route of the service is calculated on the double-layer topology, and the OCH on the service route and the OCH on the service route are determined according to the type of the link through which the service route passes.
  • the corresponding physical route after planning all the services in the service matrix, obtains the planning result of the WDM network, and establishes the double-layer topology and completes the physical route corresponding to the OCH and the OCH simultaneously on the double-layer topology.
  • the final virtual topology and physical topology will be determined.
  • Row mapping reduces the amount of computation in the WDM network planning process and improves the efficiency of WDM network planning.
  • FIG. 1 is a flowchart of a method for planning a wavelength division network according to an embodiment of the present invention
  • FIG. 2 is a schematic structural diagram of a physical topology of a wavelength division network according to an embodiment of the present invention
  • FIG. 3 is a schematic structural diagram of a two-layer topology formed by the physical topology shown in FIG. 2;
  • FIG. 4 is a schematic diagram of mapping relationship between physical routes corresponding to OCH and OCH according to an embodiment of the present invention
  • FIG. 5 is a flowchart of a WDM network planning method according to another embodiment of the present invention.
  • FIG. 6 is a flowchart of a method for planning a wavelength division network according to another embodiment of the present invention
  • FIG. FIG. 7 is a schematic structural diagram of a two-layer topology in each stage of a wavelength division network planning method according to an embodiment of the present invention
  • FIG. 10 is a schematic structural diagram of a WDM network planning device according to an embodiment of the present invention
  • FIG. 12 is a schematic structural diagram of a WDM network planning device according to another embodiment of the present invention
  • FIG. 1 is a flowchart of a method for planning a wavelength division network according to an embodiment of the present invention. As shown in FIG. 1, the method in this embodiment includes:
  • Step 101 Mapping each physical node in the physical topology to form a double layer topology, where the double layer topology includes each physical node, a logical node mapped by each physical node, and each physical node and each node are connected. The physical port of the logical node mapped by the physical node and the physical link of the connected physical node existing in the physical topology.
  • the execution subject of this embodiment may be a WDM network planning device.
  • the WDM network planning device can obtain the physical topology information of the network to be planned.
  • the physical topology information includes, but is not limited to, a physical node existing in the physical topology, a physical link existing in the physical topology, and an optical channel (OCH) already existing in the physical topology.
  • OCH optical channel
  • a physical link is a link between two physical nodes.
  • the WDM network planning device maps a logical node to each physical node in the physical topology, and between each physical node and each logical node mapped logical node.
  • a link is created, which is a port link, thus forming a double layer topology.
  • the WDM network planning device needs to create a logical link for the existing OCH.
  • the dual-layer topology also includes the OCH and the logical link corresponding to the OCH.
  • the logical link is a link between two logical nodes, and the logical link corresponding to the OCH is a link between logical nodes mapped to the end node connected to the OCH.
  • the physical topology of the WDM network to be planned is as shown in FIG.
  • FIG. 3 The double-layer topology obtained by mapping the physical nodes by the WDM network planning device is shown in FIG. 3.
  • a dotted line connecting the physical node A and the logical node A1, the physical node B and the logical node B1, the physical node C and the logical node C1, and the physical node D and the logical node D1 represents a port link connected to the physical
  • the solid line between node A, physical node B, physical node C, and physical node D represents the physical link.
  • Step 102 For each service in the pre-acquired service matrix, if there is an optical channel (OCH) in the double-layer topology that can carry the service and the end node that passes the service, for each OCH that exists, according to the OCH
  • OCH optical channel
  • the end node of the service is a pseudo-logical link formed by the logical link corresponding to the OCH
  • the service route of the service is calculated in the double-layer topology, and the link is determined according to the calculated link type of the service route.
  • the first planning result is obtained by the OCH corresponding to the OCH on the service route and the physical route corresponding to the OCH on the service route, where the first planning result includes the OCH on the service route of each service in the service matrix and the OCH on the service route. Corresponding physical route.
  • one OCH corresponds to one logical link.
  • the logical link corresponding to the OCH is connected to the
  • Each logical link corresponding to the OCH of the end node capable of carrying the foregoing service and passing the foregoing service may form two or three pseudo logical links.
  • a pseudo-logical link refers to a link between a logical node mapped by an end node connected to the service and a logical node at both ends of a logical link corresponding to the OCH of the end node that can carry the service and the service.
  • the end node of each service includes a source node and a sink node of the service, and the end node of the service is a physical node in the physical topology, and the logical node is also mapped.
  • the end node that passes the service includes the following three cases: a source node that passes the service, a sink node that passes the service, and a source node and a sink node that pass through the service at the same time.
  • the pseudo logical link between the logical node connecting the end node connected to the service and the logical link corresponding to the OCH of the end node that can carry the service and the service end may be the following: one end is connected to the foregoing The logical node at one end of the logical link corresponding to the OCH, and the other end connected to the logical node mapped by the source node of the service; one end is connected to the logical node at the other end of the logical link corresponding to the OCH, and the other end is connected to the source of the service.
  • a logical node that is mapped by a node; one end is connected to a logical node at one end of the logical link corresponding to the OCH, and the other end is connected to a logical node mapped by a sink node of the service; one end is connected to the other end of the logical link corresponding to the OCH Logical node, the other end is connected to the sink node of the above service.
  • the mapped logical node; one end is connected to the logical node mapped by the source node of the above service; the other end is connected to the logical node mapped by the sink node of the service.
  • the WDM network planning device may obtain a service matrix of the user, where the service matrix includes but is not limited to: a service that the user needs to create, and a source node of each service, a sink node of each service, and each Information such as bandwidth of the service.
  • the service matrix may also include information such as the number of failures allowed by the service, the separation policy, the necessary routing node, and the non-routing node. The information included in the business matrix will vary depending on the business.
  • the method for obtaining the service matrix may be as follows:
  • the WDM network planning device provides an input interface to the user, and the user inputs the service to be created and the source node, the sink node, and the bandwidth of each service through the input interface.
  • the user can also input the number of failures allowed by the service, the separation policy, the necessary routing nodes, and the information that must not pass through the routing node through the input interface.
  • the manner of obtaining the service matrix may also be:
  • the wavelength division network planning device is directly obtained from other devices.
  • the other device may be a server that stores information such as a service that the user needs to create and a source node, a sink node, and a bandwidth of each service, but is not limited thereto.
  • the WDM network planning device Based on the information of each service in the pre-acquired service matrix, after the two-layer topology is formed, the WDM network planning device separately processes each service to obtain the OCH that carries each service and the physical route corresponding to each OCH. And the first planning result of the WDM network is formed by the OCH carrying all the services and the physical route corresponding to each OCH. The relationship between the physical routes corresponding to OCH and OCH is illustrated below.
  • the physical node 8, the physical node 8, the physical node C, and the physical node D are sequentially connected, and the blocks on the physical node A and the physical node D represent the transceivers on the physical node A and the physical node D.
  • the actual signal flow of a service is shown by the solid line in Figure 4, and after passing through the transceiver of the physical node A, it passes through a configurable optical split-multiplexer (Reconfigurable Optical Add-drop Multiplexer, ROADM for short).
  • ROADM Reconfigurable Optical Add-drop Multiplexer
  • the physical route actually taken by the service is the physical node eight-> physical node 8-> physical node->physical node D; if the service is only viewed from the electrical layer route, the service is a transceiver that directly reaches the physical node D point from the transceiver of the physical node A point, without passing through any intermediate physical node.
  • the transceiver, the link from the physical node A directly to the physical node D constitutes an OCH, as shown by the dotted line in FIG. 4, the physical route corresponding to the OCH is a physical node -> physical node 8 -> physical node -> object Node D.
  • the detailed process of planning and processing each service by the WDM network planning device is as follows: The WDM network planning device determines whether there is an OCH that can carry the service in the double-layer topology; if the judgment result is existence, the WDM network plan The device further determines whether the existing OCH passes the source node and/or the sink node of the service; if the judgment result is traversed, for each source node that exists in the double-layer topology and can carry the service and passes the service, The OCH of the sink node is a breakpoint of the source node and/or the sink node of the service through which the OCH passes, forming a logical link for the logical link corresponding to the OCH.
  • the source node of the service is used as a break point, and two pseudo logical links may be formed for the logical link corresponding to the OCH, where one pseudo logical link is connected to A logical node of the logical link and a logical node mapped by the interruption point (ie, the source node of the service), another pseudo logical link is connected to another logical node of the logical link and the interruption point is mapped Out of the logical nodes.
  • the sink node of the service is used as a break point, and two pseudo logical links may be formed for the logical link corresponding to the OCH, where a pseudo logical link is connected to the logical link. Between one logical node of the road and the logical node mapped by the interruption point (ie, the sink node of the service), another pseudo logical link is connected to another logic node of the logical link and the logic mapped by the interruption point Between nodes.
  • the source node and the sink node of the service are both used as interruption points, and three pseudo-logical links are formed for the logical link corresponding to the OCH, wherein one pseudo-logical link Between a logical node connected to the logical link and a logical node mapped by the source node of the service (one of the interruption points), another pseudo logical link is connected to the logical node mapped by the source node of the service and the logical node The sink node of the service (another breakpoint) is mapped between the logical nodes, and the third pseudo-logical link is connected between the logical node mapped by the sink node of the service and another logical node of the logical link.
  • the pseudo logical link to be formed is included A logical link corresponding to the OCH is associated to identify that the formed pseudo logical link corresponds to the same OCH as the logical link corresponding to the OCH. That is to say, when the pseudo logical link is formed, the corresponding OCH is not created for the pseudo logical link at the same time.
  • the WDM network planning device directly performs the calculation of the service route of the service in the double-layer topology and determines the service route according to the type of the link through which the service route passes.
  • the WDM network planning device calculates the service route of the service in the double-layer topology, and determines the OCH on the service route and the OCH on the service route according to the type of the link through which the service route passes. Physical routing.
  • the determined OCH on the service route is the OCH that carries the service, and the physical route corresponding to the OCH on the determined service route is the physical route corresponding to the service.
  • the WDM network planning device uses the Dijkstra algorithm to calculate the service route of the service in the double layer topology.
  • the process of the WDM network planning device using the Dijkstra algorithm to calculate the service route includes:
  • V is the set of nodes in graph G
  • E is the set of edges in graph G.
  • the physical nodes and logical nodes in the double-layer topology are both nodes in V.
  • the physical links, logical links, port links, and pseudo-logical links in the double-layer topology are used as one edge in E.
  • W ( E ) represents the weight value on edge E, where the weight value can also be referred to as the distance value or the cost value.
  • a mapping relationship of the link cost of the node to the source node of the service denoted as D, where the link cost of a node to the source node of the service is the source node of the node to the service.
  • the sum of the weight values of the edges corresponding to the link Another mapping relationship from the node to the predecessor edge is denoted as P, where the predecessor edge of a node refers to the edge from the source node of the service to the end point of the node that the node needs to pass, and arrives at the node.
  • the shortest path is through which predecessor edge to reach the node.
  • the link cost of the source node of the service to the source node itself is recorded as 0, and the predecessor edge is empty.
  • the node with the lowest link cost selected from the set U to the source node of the service is denoted as u, that is, Among all the nodes included in the set U, the value of D[u] is the smallest.
  • D[u] is the link cost of the node u to the source node of the service, and is the sum of the weight values of the edges corresponding to the links that the node u goes to the source node; moving the node u from the set U to the set L, The node u is deleted from the set U and added to the set L.
  • the route with the lowest link cost from the sink node of the service to the source node of the service is obtained, which is the service route of the service.
  • the WDM network planning device uses the improved Dijkstra algorithm to calculate the service route of the service in the double layer topology.
  • the process includes:
  • Generating an initial value includes a first node set of all physical nodes and logical nodes in the double layer topology, and generating a second node set whose initial value is null; where the first node set is equivalent to the above set U, where the second set is The set of nodes is equivalent to the above set
  • a weight value is set for the physical link, the logical link, the port link, and the pseudo logical link (that is, each link) in the double-layer topology, where the weight value of the port link is greater than the weight value of the physical link.
  • the weight value of the physical link is greater than the weight value of the logical link and the weight value of the pseudo logical link;
  • the first node that obtains the lowest link cost of the source node of the service from the first node set moves the first node from the first node set to the second node set, and obtains The first node is the first link of the endpoint; wherein, the link cost of the first node to the source node of the service is the sum of the weight values of the link that the first node passes to the source node of the service; The link cost of the source node of the service to the source node itself is set to 0, and the precursor link of the source node of the service is empty.
  • the link cost to the source node is the sum of the link cost of the first node to the source node and the weight value of the link, and updates the predecessor link of the second node to the link.
  • the predecessor link of the second node refers to a link that needs to pass from the source node of the service to the second node and is the end point of the second node.
  • the update operation is not performed.
  • the link cost of the first node to the source node and the weight value of the link is less than the link cost of the second node to the source node that is another endpoint of the link. If the link is a pseudo-logical link, and the link from the first node to the source node includes a logical link, determine the logical chain existing between the link and the link from the first node to the source node. Whether the OCH corresponding to the path is the same OCH. If the judgment result is no, the link cost of updating the second node to the source node is the sum of the link cost of the first node to the source node and the weight value of the link, and the update is performed. The predecessor link of the two nodes is the link.
  • the service requirement of the service includes: a situation in which the calculated service route cannot pass through the same physical link
  • the foregoing link is determined to pass through from the first node to the source node. If the logical link or the pseudo-logical link corresponding to the OCH is different, it is further determined whether the physical route corresponding to each link in the link from the first node to the source node is Passed the same physical link or physical node. If the determination result is no, updating the link cost of the second node to the source node is the sum of the link cost of the first node to the source node and the weight value of the link, and updating the predecessor link of the second node to The link, on the other hand, does not perform an update operation.
  • the route with the lowest link cost from the source node of the service to the sink node of the service is obtained, which is recorded as the service route of the service.
  • the above process of calculating the service route is based on the standard Dijkstra algorithm, combining the Dijkstra algorithm with the double layer topology of the embodiment, and processing each link with the first node as the endpoint.
  • the verification process has been added during the process.
  • the summary of the verification process is as follows:
  • the link is a logical link, and there is a pseudo logical link in the link from the first node to the source node of the service, the link is determined to be from the first node to the source node of the service. Whether the OCH corresponding to the pseudo-logical link existing in the traversed link is the same OCH. Since the same OCH is unreasonable twice, if the judgment result is yes, it is determined that the link is unreasonable. If the judgment result is no, Then the link is determined to be reasonable.
  • the link is determined to be reasonable.
  • the service requirements of the service include: The calculated service route cannot pass through the same physical link, and further judges: the link and the link in the link from the first node to the source node Whether the physical route corresponding to the path passes through the same physical link or physical node. If the judgment result is no, it is determined that the link is reasonable, and conversely, it is determined that the link is unreasonable.
  • the following types of links may exist in the dual layer topology: physical links, port links, logical links, and pseudo logical links.
  • the calculated route through which the service route passes may be any one or several of a physical link, a port link, a logical link, and a pseudo logical link.
  • a type of link is determined according to the type of the link through which the calculated service route passes: ' , ' ' , : ' " If the service route passes through the port link, the WDM network planning device is in the service.
  • An OCH is created between the physical nodes corresponding to the port link through which the route passes, and the physical node and the physical link that the physical node passing through the created physical node from the OCH end to the other end constitute the created OCH.
  • Corresponding physical route where the physical node corresponding to the port link refers to the physical node to which the port link is connected.
  • the service route passes through the port link, the service route passes through a pair of port links, and A new OCH is created between the physical nodes to which the port links are connected.
  • the service route is recorded, that is, the service route is recorded.
  • the information such as the link and the node is used to determine the physical route corresponding to the OCH and the OCH on the service route.
  • the WDM network planning device separately creates the service path OCH, and determines the physical route from the created physical node of the OCH-end to the other end of the service route.
  • the physical node and the physical link that the node passes through constitute the physical route corresponding to the created OCH.
  • the WDM network planning device also needs to pass the pseudo-logical link through which the service is routed, the OCH corresponding to the logical link associated with the pseudo-logical link through which the service route passes, and the double-layer topology. The other pseudo logical links are deleted.
  • one logical link may be associated with two or three pseudo-logical links, and the calculated service route may only be two or three through a pseudo-pseudo-random link ( This includes the pseudo-logical links through which the service routes pass.
  • the operation here is equivalent to selecting an OCH from the OCH of the source node and/or the sink node that can carry the service and passing the service existing in the double layer topology, and splitting the OCH into multiple OCHs (for example, The two may also be three OCHs, replacing the original OCH with the split OCH.
  • the logical link associated with the pseudo-logical link that the service route passes through forms a pseudo-logical link
  • the operation of deleting the logical link associated with the pseudo-logical link through which the service route passes is equivalent to
  • the selected OCH is split by the logical link, and the logical link is replaced by multiple pseudo logical links to adapt to the processing of the OCH.
  • the pseudo logical link can become a logical link.
  • the WDM network planning device determines the OCH corresponding to the logical link through which the service route passes and the service route.
  • the physical route corresponding to the OCH corresponding to the logical link is not need to create an OCH for the logical link through which the service route passes because the physical link corresponding to the OCH and the OCH already exists in the logical link. .
  • the link through which a service route may pass may include any one or more of the foregoing.
  • the processing of each link is described above. For example, if a service route passes through a pseudo-logical link, a logical link, and a port link, the WDM network planning device creates an OCH between the physical nodes corresponding to the port link through which the service route passes, and determines The physical route and the physical link between the physical node of the created OCH-side and the physical node of the other end constitute the physical route corresponding to the created OCH.
  • the logical link respectively creates an OCH, and determines that the physical node and the physical link that the physical node passes from the physical node of the created OCH end to the physical node of the other end constitute the physical route corresponding to the created OCH, and determines the The OCH corresponding to the logical link through which the service route passes and the physical route corresponding to the OCH.
  • the service after determining the OCH on the service route of the service and the physical route corresponding to the OCH on the service route, the service includes: Whether the remaining capacity of one of the OCHs in the OCH corresponding to the two identical or partially identical physical routes in the double-layer topology is greater than or equal to the total capacity of the service carried by the other OCH; if yes, the two are the same or The OCH corresponding to the same physical route is merged, and the logical link corresponding to the combined OCH is adjusted.
  • the WDM network planning device compares the physical routes corresponding to the OCH existing in the double-layer topology to obtain the same or Part of the same physical route corresponding to the OCH.
  • the physical route mentioned here is the same as the physical node, the physical link, and the sequence of the physical node and the physical link passing through the physical node and the physical link. For example, suppose a physical route is a physical node -> physical node 8 -> physical node C, another physical route is a physical node A -> physical node 8 -> physical node C or a physical node -> physical node 8 -> physics Node A, the two physical routes are the same.
  • the same physical routing part mentioned here means that two physical routes pass through the same physical node and physical link, but the length is different. For example, suppose a physical route is physical node A-> physical node 8-> physical node C, The other physical route is also the physical node -> physical node 8 -> physical node -> physical node D, then the two physical routing parts are the same.
  • the WDM network planning device compares the remaining capacity of the OCH corresponding to the same or partially identical physical route and the total capacity of the services carried by the WCH network, if the remaining capacity of one OCH is greater than or equal to another OCH
  • the total capacity of the carried service indicates that another OCH can be merged with the OC whose remaining capacity is greater than the total capacity of the service carried by the other OCH, so that small-sized services can be aggregated (Grooming in English) into one OCH. It is beneficial to reduce the planning cost of the WDM network.
  • the length of the merge processing route of the OCH corresponding to the two identical or partially identical physical routes is related.
  • An embodiment includes: if the remaining capacity is greater than or equal to another If the length of the physical route corresponding to the OCH of the total capacity of the service carried by the OCH is greater than or equal to the length of the physical route corresponding to another OCH, the service carried by the other OCH is incorporated into the remaining capacity that is greater than or equal to another OCH.
  • the OCH of the total capacity of the carried service deletes another OCH and another logical link corresponding to the 0CH. This embodiment is equivalent to directly converge the services carried by one 0CH to another 0CH that can carry these services, and deletes the original CHCH that carries the services.
  • Another embodiment includes: if the length of the physical route corresponding to the OCH of the total capacity of the service carried by the other OCH is less than the length of the physical route corresponding to the other OCH, the corresponding one of the 0CHs The physical route, the OCH whose remaining capacity is greater than or equal to the total capacity of the service carried by the other OCH is split into two OCHs, and the remaining capacity is greater than or equal to the OCH of the total capacity of the service carried by the other OCH.
  • the logical link is split into two logical links, and the service carried by the other OCH is merged into the same OCH that is split out of the physical route corresponding to the other OCH, and the other 0CH and the other 0CH are deleted.
  • Logical link. This embodiment is equivalent to splitting a 0CH, and converges the services carried by one 0CH split by the 0CH into another 0CH capable of carrying these services.
  • the number of 0CHs is not reduced, the length of the 0CH is Shortened, the physical resources such as the fiber link used by the 0CH are reduced, which is conducive to saving the network construction cost of the wavelength division network.
  • the method includes:
  • Step 103 Delete at least one OCH in the double-layer topology, determine at least one affected service, and delete the logical link corresponding to the deleted OCH, and obtain a second planning result, where at least one affected service is deleted.
  • OCH bears the business.
  • Step 104 Determine an OCH corresponding to the service route of each of the affected services in the at least one affected service and a physical route corresponding to the OCH on the service route of each of the affected services, and obtain a third planned result.
  • the implementation process of the step 104 includes: for each affected service in the at least one affected service, if there is an end node in the double-layer topology that can carry the affected service and pass the affected service
  • the OCH for each OCH that exists, forms a pseudo-logical link for the logical link corresponding to the OCH according to the end node of the affected service that the OCH passes; and then calculates the affected service in the double-layer topology Service routing, according to the service routing of the affected service The physical link of the OCH on the service route of the affected service and the OCH on the service route of the affected service.
  • the implementation process of the step 104 includes: for each affected service in the at least one affected service, if there is no OCH in the double-layer topology that can carry the affected service, or The OCH carrying the affected service, but the OCH does not pass through the end node of the affected service, and the service route of the affected service is directly calculated in the double-layer topology, and the service route of the affected service passes.
  • the link type determines the physical route corresponding to the OCH on the service route of the affected service and the OCH on the service route of the affected service.
  • the implementation manner of determining the physical route corresponding to the OCH on the service route of the affected service and the OCH on the service route of the affected service according to the link type of the service route of the affected service includes:
  • an OCH is created between the physical nodes corresponding to the port link through which the service route of the affected service passes, and the service route of the affected service is determined from the created The physical node and the physical link through which the physical node of the OCH-side to the physical node at the other end constitute the physical route corresponding to the created OCH.
  • the OCH corresponding to the affected service is created, and the service route of the affected service is determined from the physical node of the created OCH-end to the physical node of the other end.
  • the traversed physical node and the physical link constitute the physical route corresponding to the created OCH, and the pseudo-logical link through which the service route of the affected service passes, and the pseudo-logical link through which the service route of the affected service passes.
  • the OCH corresponding to the logical link and the pseudo-logical link except the pseudo-logical link associated with the logical link associated with the pseudo-logical link through which the service route of the affected service passes are deleted.
  • the service route of the affected service passes through the logical link, the OCH corresponding to the logical link through which the service route of the affected service passes, and the physical route corresponding to the OCH corresponding to the logical link through which the service route of the affected service passes.
  • the method further includes:
  • Step 105 Determine whether the update operation ends; if the determination result is no, perform step 106; otherwise, end the operation.
  • Step 106 Determine whether the number of OCHs in the third planning result is greater than the number of OCHs in the second planning result; if the determination result is yes, execute step 107; if the determination result is no, perform step 108.
  • step 107 the third planning result is restored to the second planning result, and the second planning result is returned to the first planning result, and the process returns to step 103, that is, the execution returns to delete at least one OCH in the double layer topology, and at least one piece is determined.
  • the affected service is deleted, and the logical link corresponding to the deleted OCH is deleted, and the operation of the second planning result is obtained.
  • step 108 the third planning result is returned to the first planning result, and the process returns to step 103, that is, the execution returns to delete at least one OCH in the double-layer topology, determines at least one affected service, and deletes the deleted OCH.
  • Logical link the operation of obtaining the second planning result.
  • This embodiment is equivalent to the process of continuously updating the double layer topology for the purpose of reducing the number of OCHs in the double layer topology.
  • the wavelength division network planning device compares the number of OCHs in the third planning result with the number of OCHs in the second planning result before the update, that is, determines the third obtained by the update. Whether the number of OCHs in the planning result is smaller than the number of OCHs in the second planning result before the update, that is, whether the number of OCHs in the updated third planning result is smaller than the number of OCHs in the first planning result, That is to judge whether the planning cost of the network is reduced. Among them, the number of OCH determines the size of the network planning cost.
  • the result of the update is accepted, and the third planning result is re-executed as the first planning result to continue the next update processing. , that is, return to step 103 until the end of the update process.
  • the update processing operation ends.
  • the update threshold may be input by the user or may be determined by the update algorithm used.
  • 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 cost of network planning.
  • the WDM network planning device may use the simulated annealing algorithm with the minimum number of OCHs in the first planning result as the optimization target.
  • the evolution algorithm, the particle swarm algorithm or the ant colony algorithm optimizes the OCH in the double-layer topology to obtain the third planning result.
  • 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.
  • the physical topology of the WDM network is as shown in FIG. 2, including physical node A, physical node physical node C, and physical node D, and physical node A, physical node ⁇ physical node C, and physical node D are in turn Connected, forming four physical links.
  • BD STM-16 service from physical node B to physical node D
  • service STM-16 service from physical node A to physical node D
  • AD requires a line speed of 10G and requires 1+1 protection.
  • the first step Form a double layer topology.
  • the dual-layer topology includes a physical node A, a physical node B, a physical node, a physical node D, a logical node A mapped by the physical node A, a logical node B1 mapped by the physical node B, and a physical node C.
  • the port link indicated by the dotted line between D1 is connected to the physical link represented by the solid line between the physical node 8, the physical node: 6, the physical node C, and the physical node D.
  • the second step is to calculate the physical route corresponding to the OCH and the OCH on the service route of each service, and obtain the first planning result.
  • the working route of the service BD is B1->B- >A->D->D1, as shown by the thick solid line in Figure 7.
  • the protection route of the calculation service BD is B1->B->C->D->D1, as shown by the thick dotted line in FIG.
  • the pair of ports are An OCH is created between the physical node D and the physical node B corresponding to the link, and the physical route corresponding to the OCH is determined to be B->A->D (that is, the physical path from the OCH to the other end of the service route).
  • the node and the physical link constitute), and a logical link is created between the logical nodes B1 and D1, as shown by the dotted line between B1 and D1 in FIG.
  • the protection route passes through a pair of port links B1->B, D1->D
  • an OCH is established between the physical node B corresponding to the pair of port links and the physical node D, and the OCH is determined.
  • the physical route is B->C->D (that is, the physical node and the physical link that pass through the protection route from one end of the OCH to the other end), and the logic corresponding to the OCH is created between the logical nodes B1 and D1.
  • the link is shown by the dotted line between B1 and D1 in Figure 7.
  • plan for the business AD Since the OCH already exists in the double-layer topology at this time, it is determined whether there is an OCH in the existing OCH that can carry the service AD and pass through the service AD (including the source node and/or the sink node through the service). It is assumed that the OCH corresponding to the physical route B->A->D can carry the service AD, and the physical route passes through the source node of the service AD. Based on this, the source node A of the service AD is used as a break point, and a pseudo-logical link is formed for the logical link corresponding to the OCH, as shown by the dotted line between B1 and Al, A1 and D1 in FIG.
  • the pseudo-logic is Link B1->A1 and pseudo-logical link A1->D1 are associated with logical link B1->D1.
  • the service route of the service AD is calculated, and the work route of the service AD is A1->D1, as shown by the thick solid line in FIG.
  • the protection route of the service AD is calculated as A1->B1->D1, as shown by the thick dotted line in FIG. Since the working route of the service AD passes through the pseudo-logical link A1->D1, the pseudo-logical links B1->A1 and A1 associated with the logical link B1->D1 associated with the pseudo-logical link A1->D1 are created.
  • ->D1 corresponds to the OCH, that is, the OCH is newly created between the physical node B and the physical node A, and it is determined that B->A is the physical route corresponding to the OCH, and the OCH is newly created between the physical node A and the physical node D. At the same time, it is determined that A->D is the physical route corresponding to the OCH. At the same time, the logical link B1->D1 shown by the broken line in FIG. 9 and the OCH corresponding to the logical link B1->D1 (that is, the OCH between the physical node B and the physical node D) are deleted, and the service BD passes.
  • the protection route of the service AD passes through the logical links A1->B1 and B1->D1, and then the OCH (the OCH between the physical node A and the physical node B) corresponding to the logical link A1->B1 is determined, and Determining the physical route corresponding to the OCH (ie, B->A), and determining the OCH corresponding to the logical link B1->D1 (ie, physical node B) And the physical route between the physical node D) and determine the physical route corresponding to the OCH (ie, B->C->D).
  • the planning of the business AD and the business BD is completed, and the first planning result is obtained.
  • Step 3 Update the double layer topology.
  • Stpl deletes an OCH.
  • the OCH between physical node A and physical node D is deleted.
  • the affected services are the service AD and the service BD, and release all the resources occupied by the service AD and the service BD.
  • the double-layer topology includes an OCH and a logical link.
  • Stp2 return to the second step, re-planning the business AD and the business BD.
  • the planning process for the service AD and the service BD is the same as the previous planning process, and is not described here.
  • the WDM network planning method maps a physical node in a physical topology to generate a two-layer topology with logical topology information and dynamic topology information.
  • the interrupt processing of the existing OCH is formed through the logic in the double-layer topology.
  • Link prioritize the use of the existing OCH, and then calculate the service route of the service on the double-layer topology, and determine the OCH on the service route and the PHY corresponding to the OCH on the service route according to the link type through which the service route passes.
  • Routing when planning all the services in the service matrix, obtaining the planning result of the WDM network, by constructing a double-layer topology and simultaneously determining the physical routes corresponding to OCH and OCH on the double-layer topology, without
  • the virtual topology that is finally used is determined in the virtual topology of the entire network, and the final virtual topology and the physical topology are mapped. It reduces the amount of calculation in the planning process of the WDM network and improves the efficiency of WDM network planning.
  • An embodiment of the present invention provides a computer program product, comprising computer program code, when a computer unit executes the computer program code, the computer unit performs the actions recited in the foregoing method embodiments.
  • the specific content will not be described here.
  • FIG. 10 is a schematic structural diagram of a WDM network planning device according to an embodiment of the present invention.
  • the WDM network planning device of this embodiment includes: a forming unit 1001, a service processing unit 1002, and a first obtaining unit 1003.
  • the forming unit 1001 is configured to map each physical node in the physical topology to form a double layer topology, where the double layer topology includes each physical node, a logical node mapped by each physical node, and a connection A physical node is a port link of a logical node mapped to each physical node and a physical link connecting the physical node existing in the physical topology.
  • the forming unit 1001 is connected to the service processing unit 1002 and the first obtaining unit 1003, and supplies the formed double layer topology to the service processing unit 1002 and the first obtaining unit 1003.
  • the service processing unit 1002 is configured to: for each service in the pre-acquired service matrix, if there is an OCH in the double-layer topology formed by the forming unit 1001 that can carry the service and pass the service,
  • Each of the OCHs, the end node of the service that the OCH passes through forms a pseudo-logical link for the logical link corresponding to the OCH, and the logical link corresponding to the OCH is a physical node that is connected to the two ends of the OCH.
  • a link between the mapped logical nodes, the pseudo logical link being a link between a logical node mapped by the end node connected to the service and a logical node at both ends of the logical link corresponding to the OCH.
  • a first obtaining unit 1003 configured to calculate a service route of the service in a double-layer topology formed by the forming unit 1001, determine an OCH on the service route, and the foregoing according to a link type of the service route
  • the physical route corresponding to the OCH on the service route obtains the first planning result, where the first planning result includes the OCH on the service route of each service in the service matrix and the physical route corresponding to the OCH on the service route.
  • the first obtaining unit 1003 is further connected to the service processing unit 1002.
  • the first obtaining unit 1003 also cooperates with the service processing unit 1002 to complete planning processing for each service.
  • 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. 1.
  • the specific working principle is not described here. For details, refer to the description of the method embodiment.
  • the wavelength division network planning device of this embodiment further includes a memory for storing one or more of the following information: forming a double layer topology formed by the unit 1001, and the service processing unit 1002 is formed in the double layer topology.
  • the pseudo-logical link, the first routing unit 1003 determines the service route of each service, the OCH on the service route, and the physical route corresponding to the OCH on the service route, and the first planning result finally obtained by the first obtaining unit 1003. Wait.
  • the memory is connected to at least one or more of the following units: forming unit 1001, business processing unit 1002, and first obtaining unit 1003.
  • the WDM network planning device of the embodiment further includes a transmitter, configured to send the WDM network planning result (that is, the first planning result) to the network management device or the Path Computation Element (PCE) or the display device. ( display device ) and so on.
  • a transmitter configured to send the WDM network planning result (that is, the first planning result) to the network management device or the Path Computation Element (PCE) or the display device. ( display device ) and so on.
  • 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.
  • the memory, the transmitter, 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 in this embodiment maps a physical node in a physical topology to generate a two-layer topology with logical topology information and dynamic change information at the same time, for each service
  • the planning process if there is a logical link in the double-layer topology that can carry the service and pass through the industry, priority is given to using the existing OCH, and then the service route of the service is calculated on the double-layer topology, and according to the service
  • the link type of the route determines the physical route corresponding to the OCH on the service route and the OCH on the service route.
  • the planning result of the WDM network is obtained.
  • Parker also completes the determination of the physical route corresponding to OCH and OCH on the double-layer topology, instead of determining the final virtual topology in the virtual topology of the whole network as in the prior art, in the final definition of the virtual topology and Physical topology mapping reduces the computational complexity of the WDM network planning process and improves the efficiency of WDM network planning.
  • FIG. 11 is a schematic structural diagram of a WDM network planning device according to another embodiment of the present invention. This embodiment is implemented based on the embodiment shown in FIG. As shown in FIG. 11, the device in this embodiment includes at least: a forming unit 1001, a service processing unit 1002, and a first obtaining unit 1003. Further, the apparatus of this embodiment also includes devices such as a memory, a transmitter, a power supply module, an input device, and an output device, which are not shown in the drawings for the sake of simplicity of illustration.
  • devices such as a memory, a transmitter, a power supply module, an input device, and an output device, which are not shown in the drawings for the sake of simplicity of illustration.
  • the first obtaining unit 1003 of this embodiment includes: a generating subunit 10031, a setting subunit 10032, an obtaining subunit 10033, an updating processing subunit 10034, and a first result obtaining subunit 10035.
  • a setting subunit 10032 connected to the forming unit 1001, configured to set a weight value for the physical link, the logical link, the port link, and the pseudo logical link in the double layer topology,
  • the weight of the physical link is greater than the weight of the physical link, and the weight of the physical link is greater than a weight of the logical link and a weight of the pseudo logical link.
  • the obtaining subunit 10033 is connected to the generating subunit 10031 and the service processing unit 1002, and the first node set generated by the generating subunit 10031 is not empty, and the source node of the service is obtained from the first node set.
  • a first node with the lowest link cost moving the first node from the first node set to the second node set, and acquiring a first link with the first node as an endpoint;
  • the link cost of a node to the source node of the service is the sum of the weight values of the links through which the first node to the source node of the service passes.
  • the update processing sub-unit 10034 is connected to the obtaining sub-unit 10033, and is configured to use, for each link, the first link that is the endpoint of the first node, and the link cost of the first node to the source node of the service.
  • the first link is a logical chain a path, and a pseudo logical link exists in a link from the first node to a source node of the service, determining that the first link passes through a source node from the first node to the service Whether the OCH corresponding to the pseudo logical link existing in the link is the same OCH, and if the determination result is no, updating the link cost of the second node to the source node of the service is the first node to the The sum of the link cost of the source node of the service and the weight value of the first link, and updating the precursor link of the second node as
  • the update processing sub-unit 10034 is further configured to: when a sum of a link cost of the first node to the source node of the service and a weight value of the first link is smaller than another endpoint of the first link
  • the second node is connected to the source node of the service, if the first link is a pseudo-logical link, and the link from the first node to the source node of the service includes a logical link
  • a sum of the cost and the weight value of the first link and updating the precursor link of the second node as the first link until calculating a sink node from the source node of the service to the service
  • the first result obtaining sub-unit 10035 is connected to the update processing sub-unit 10034, and is configured to determine an OCH on the service route and the service route according to a link type that the service route obtained by the update processing sub-unit 10034 passes. The physical route corresponding to the OCH, thereby obtaining the first planning result.
  • the service processing unit 1002 is further configured to
  • the formed pseudo logical link is associated with the logical link corresponding to the OCH to identify the logical link formed by the pseudo logical link and the OCH.
  • the road corresponds to the same OCH.
  • the first result obtaining sub-unit 10035 is specifically configured to: if the service route passes through the port link, create an OCH between the physical nodes corresponding to the port link through which the service route passes, and determine the service route.
  • the physical node and the physical link that pass from the physical node of the created OCH-end to the physical node of the other end constitute the physical route corresponding to the created OCH.
  • the first result obtaining sub-unit 10035 is specifically configured to: if the service route passes through the pseudo-logical link, respectively create the pseudo-logical route through which the service route passes, from the created The physical node and the physical link that the physical node of the OCH-to-end physical node passes to form the physical route corresponding to the created OCH, and the pseudo-logical link through which the service is routed, and the pseudo-passage of the service route
  • the first result The obtaining sub-unit 10035 is specifically configured to: if the service route passes through the logical link, determine the OCH corresponding to the logical link through which the service route passes, and the physical route corresponding to the OCH corresponding to the logical link through which the service route passes.
  • the first result obtaining subunit 10035 is more specifically configured for each of the logical links associated with the pseudo logical link through which the service route passes.
  • An OCH is created between physical nodes corresponding to logical nodes connected by pseudo-logical links.
  • the service processing unit 1002 is further configured to determine, in the double-layer topology, after determining an OCH on the service route and a physical route corresponding to an OCH on the service route. Whether the remaining capacity of one of the OCHs is greater than or equal to the total capacity of the service carried by the other OCH, and if so, the two identical or partially identical The OCH corresponding to the physical route is merged, and the logical link corresponding to the combined OCH is adjusted.
  • the service processing unit 1002 is specifically configured to: if the remaining capacity is greater than or equal to the length of the physical route corresponding to the total capacity of the service carried by the other OCH, the length of the physical route is greater than or equal to the length of the physical route corresponding to the another OCH. And the service carried by the another OCH is merged into the OCH whose remaining capacity is greater than or equal to the total capacity of the service carried by the another OCH, and the logic corresponding to the other OCH and the other OCH is deleted. link.
  • the service processing unit 1002 is specifically configured to: if the length of the physical route corresponding to the OCH of the total capacity of the service carried by the other OCH is less than or equal to the length of the physical route corresponding to the another OCH, An OCH corresponding to the OCH, the OCH whose remaining capacity is greater than or equal to the total capacity of the service carried by the other OCH is split into two OCHs, and the remaining capacity is greater than or equal to the other OCH.
  • the logical link corresponding to the OCH of the total capacity of the carried service is split into two logical links, and the service carried by the other OCH is merged into the split physical route corresponding to the other OCH. In one OCH, the other OCH and the logical link corresponding to the other OCH are deleted.
  • the wavelength division network planning device of this embodiment further includes: a second obtaining unit 1004 and a third obtaining unit 1005.
  • the second obtaining unit 1004 is connected to the first obtaining unit 1003, and configured to: after the first acquiring unit 1003 obtains the first planning result, delete at least one OCH in the double layer topology, and determine at least one affected service, And deleting the logical link corresponding to the deleted OCH, and obtaining a second planning result; the at least one affected service is a service carried by the deleted OCH.
  • the second obtaining unit 1004 is connected to the first result obtaining subunit 10035.
  • the third obtaining unit 1005 is connected to the second obtaining unit 1004, and configured to determine the OCH and the service of each affected service on the service route of each of the at least one affected service determined by the second obtaining unit 1004.
  • the third obtaining unit 1005 includes: a forming subunit 10051, a determining subunit 10052, and a second result obtaining subunit 10053.
  • the bearer may be carried
  • the determining subunit 10052 is connected to the forming subunit 10051, and is configured to calculate a service route of the affected service in the double layer topology, and determine a location according to a link type of the service route of the affected service. The physical route corresponding to the OCH on the service route of the affected service and the OCH on the service route of the affected service. The determining subunit 10052 calculates the service route of the affected service in the double layer topology formed by the forming subunit 10051.
  • the second result obtaining subunit 10053 is connected to the determining subunit 10052, and configured to determine, on the service route of each of the at least one affected service, the OCH and each affected service in the determining subunit 10052. After the physical route corresponding to the OCH on the service route, the third planning result is obtained.
  • the wavelength division network planning device of this embodiment further includes: a first trigger execution unit 1006.
  • the first trigger execution unit 1006 is connected to the second result obtaining subunit 10053 and the second obtaining unit 1004, for if the number of OCHs in the third planning result obtained by the second result obtaining subunit 10053 is less than or equal to the second
  • the number of OCHs in the planning result is used as the first planning result, and the second obtaining unit 1004 is triggered to perform deletion of at least one OCH in the double layer topology to determine at least one affected service. And deleting the logical link corresponding to the deleted OCH, and obtaining the operation of the second planning result.
  • the WDM network planning device of the embodiment further includes: a second trigger execution unit 1007.
  • the second trigger execution unit 1007 is connected to the second result obtaining subunit 10053 and the second obtaining unit 1004, where the number of OCHs in the third planning result obtained by the second result obtaining subunit 10053 is greater than the second planning result.
  • the at least one OCH is deleted, the at least one affected service is determined, and the logical link corresponding to the deleted 0CH is deleted, and the operation of the second planning result is obtained.
  • the wavelength division network planning device in this embodiment maps a physical node in a physical topology to generate a two-layer topology with logical topology information and dynamic change information at the same time, for each service
  • the planning process if there is a COH in the double-layer topology that can carry the service and pass through the source node and/or the sink node of the service, interrupt processing of the existing OCH forms a logical chain through the pair of topologies.
  • the priority is to use the existing OCH, and then calculate the service route of the service on the double-layer topology, and determine the physical route corresponding to the OCH on the service route and the OCH on the service route according to the link type through which the service route passes.
  • the planning result of the WDM network is obtained.
  • the virtual topology of the final use is determined in the virtual topology of the whole network, and the final virtual topology and physical topology are mapped, and the reduction is reduced. Calculating the amount of the planning process in the sub-network, improves the efficiency of the WDM network planning.
  • FIG. 12 is a schematic structural diagram of a WDM network planning device according to another embodiment of the present invention.
  • the wavelength division network planning apparatus of this embodiment includes: at least one processor 1201, and a memory 1202.
  • the memory 1202 is configured to store executable program code, wherein the processor 1201 passes the program for:
  • mapping each physical node in the physical topology to form a two-layer topology where the two-layer topology includes each physical node, a logical node mapped by each physical node, and each physical node and each physical node are connected. a port link of the mapped logical node and a physical link of the connected physical node existing in the physical topology;
  • the end node of the service is a pseudo-logical link formed by the logical link corresponding to the OCH, and the logical link corresponding to the OCH is connected between the logical nodes mapped by the physical nodes at both ends of the OCH.
  • the first planning result includes an OCH on a service route of each service in the service matrix and a physical route corresponding to an OCH on the service route.
  • the calculating, by the processor, the service routing of the service in the double-layer topology specifically includes: the processor 1202 is specifically configured to generate an initial value, where the double-layer topology is included a first set of nodes of all physical nodes and logical nodes, generating a second set of nodes whose initial value is null, the physical link, the logical link, the port link, and The pseudo logical link sets a weight value, where a weight value of the port link is greater than a weight value of the physical link, a weight value of the physical link is greater than a weight value of the logical link, and the a weight value of the pseudo logical link; then, if the first node set is not empty, the processor 1202 obtains, from the first node set, the link cost of the source node of the service is the most d, the first a node, moving the first node from the first node set to the second node set, acquiring a first link with the first node as an endpoint;
  • the processor 1202 is further configured to: when a sum of a link cost of the first node to a source node of the service and a weight value of the first link is smaller than another endpoint of the first link
  • the processor 1202 is further configured to: when a sum of a link cost of the first node to a source node of the service and a weight value of the first link is smaller than another endpoint of the first link
  • the first link is a pseudo logical link
  • the link from the first node to the source node of the service includes a logical link, determining a logic existing in the link between the first link and a source node from the first node to the service Whether the OCH corresponding to the link is the same OCH, and if the determination result is no, the link cost of the source node to the source node of the service is updated to be the link of the first node to the source node of the service.
  • a sum of the cost and the weight value of the first link and updating the precursor link of the second node
  • the predecessor link of the second node refers to a link that needs to pass from the source node of the service to the second node and is the end point of the second node.
  • the processor 1202 is further configured to use the logic corresponding to the formed pseudo logical link and the OCH.
  • the link is associated to identify that the formed pseudo logical link corresponds to the same OCH as the logical link corresponding to the OCH.
  • the processor 1202 determines, according to the link type of the service route, the OCH on the service route and the physical route corresponding to the OCH on the service route, where the processor 1202 is specifically configured to: if The service route passes through the port link, and an OCH is created between the physical nodes corresponding to the port link through which the service route passes, and the physical route from the created OCH-end to the physical node at the other end is determined on the service route.
  • the physical node and the physical link that pass through form the physical route corresponding to the created OCH.
  • the processor 1202 determines, according to the link type of the service route, the OCH on the service route and the physical route corresponding to the OCH on the service route, including: The device 1202 is specifically configured to: if the service route passes through the pseudo logical link, the OCH corresponding to the logical link determines the physical node on the service route from the physical node of the created OCH end to the physical node of the other end.
  • the processor 1202 determines, according to the link type of the service route, the OCH on the service route and the physical route corresponding to the OCH on the service route, including: The device 1202 is specifically configured to: if the service route passes through the logical link, determine an OCH corresponding to the logical link through which the service route passes, and a logical chain through which the service route passes The physical route corresponding to the OCH corresponding to the road.
  • the processor 1202 separately creates the service route, and the processor 1202 is specifically configured to be associated with a logical link associated with the pseudo-logical link through which the service route passes.
  • An OCH is created between physical nodes corresponding to logical nodes connected to each pseudo logical link.
  • the processor 1202 is further configured to determine any two of the two-layer topology. Whether the remaining capacity of one OCH is greater than or equal to the total capacity of the service carried by the other OCH in the OCH corresponding to the same or partially identical physical route, and if so, the two physical routes that are the same or partially identical.
  • the corresponding OCH performs a merge process, and adjusts the logical link corresponding to the combined OCH.
  • the processor 1202 performs a merge process on the OCHs corresponding to the two physical routes that are the same or partially identical, and adjusts the logical links corresponding to the merged OCH to include: the processor 1202 Specifically, if the length of the physical route corresponding to the OCH of the total capacity of the service carried by the other OCH is greater than or equal to the length of the physical route corresponding to the another OCH, the other OCH is used. The bearer service is merged into the OCH whose remaining capacity is greater than or equal to the total capacity of the service carried by the another OCH, and the other OCH and the logical link corresponding to the other OCH are deleted.
  • the processor 1202 performs a merge process on the OCHs corresponding to the two physical routes that are the same or partially identical, and adjusts the logical links corresponding to the merged OCH to include: the processor 1202 Specifically, if the length of the physical route corresponding to the OCH that is greater than or equal to the total capacity of the service carried by the other OCH is smaller than the length of the physical route corresponding to the another OCH, the physical corresponding to the other OCH Routing, the OCH whose remaining capacity is greater than or equal to the total capacity of the service carried by the other OCH is split into two OCHs, and the remaining capacity is greater than or equal to the total amount of services carried by the other OCH.
  • the logical link corresponding to the OCH of the capacity is split into two logical links, and the service carried by the other OCH is merged into the same OCH that is split out of the physical route corresponding to the other OCH, and deleted.
  • the other OCH and the logical link corresponding to the other OCH are split into two logical links, and the service carried by the other OCH is merged into the same OCH that is split out of the physical route corresponding to the other OCH, and deleted.
  • the wavelength division network planning device in this embodiment maps physical nodes in the physical topology. Generating a two-layer topology with both logical topology information and dynamic topology information. In the planning process for each service, if there is a source in the double-layer topology that can carry the service and pass the service. When the COH of the node and/or the sink node is interrupted by the existing OCH, the logical link in the dual-layer topology is formed, and the existing OCH is preferentially used, and then the service of the service is calculated on the double-layer topology.
  • Routing and determining the physical route corresponding to the OCH on the service route and the OCH on the service route according to the type of the link through which the service route passes, and obtaining the planning result of the WDM network after planning all the services in the service matrix,
  • 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.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Optical Communication System (AREA)

Abstract

La présente invention concerne un procédé et un dispositif de planification d'un réseau à multiplexage par répartition en longueur d'onde. Selon l'invention, le procédé fait appel : à l'exécution d'une mise en correspondance au niveau de chaque nœud physique de la topologie physique pour former une topologie à deux couches ; pour chaque service, s'il existe un OCH capable de supporter le service et de passer par un nœud d'extrémité du service dans la topologie à deux couches, à la formation, pour chaque OCH existant, d'une pseudo-liaison logique de liaison logique correspondant à l'OCH, conformément au nœud d'extrémité du service ; et au calcul d'un trajet de service du service dans la topologie à deux couches ainsi qu'à la détermination de l'OCH du trajet de service et d'un trajet physique correspondant à l'OCH, de façon à obtenir un premier résultat de planification. La solution technique de la présente invention permet d'améliorer l'efficacité de planification d'un réseau à multiplexage par répartition en longueur d'onde.
PCT/CN2012/079502 2012-08-01 2012-08-01 Procédé et dispositif de planification de réseau à multiplexage par répartition en longueur d'onde WO2014019167A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201280001096.2A CN102907053B (zh) 2012-08-01 2012-08-01 波分网络规划方法及设备
PCT/CN2012/079502 WO2014019167A1 (fr) 2012-08-01 2012-08-01 Procédé et dispositif de planification de réseau à multiplexage par répartition en longueur d'onde

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2012/079502 WO2014019167A1 (fr) 2012-08-01 2012-08-01 Procédé et dispositif de planification de réseau à multiplexage par répartition en longueur d'onde

Publications (1)

Publication Number Publication Date
WO2014019167A1 true WO2014019167A1 (fr) 2014-02-06

Family

ID=47577504

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/079502 WO2014019167A1 (fr) 2012-08-01 2012-08-01 Procédé et dispositif de planification de réseau à multiplexage par répartition en longueur d'onde

Country Status (2)

Country Link
CN (1) CN102907053B (fr)
WO (1) WO2014019167A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014019167A1 (fr) * 2012-08-01 2014-02-06 华为技术有限公司 Procédé et dispositif de planification de réseau à multiplexage par répartition en longueur d'onde
EP3041170B1 (fr) * 2013-09-30 2017-10-25 Huawei Technologies Co., Ltd. Procédé et dispositif de planification réseau
CN107769964B (zh) * 2017-09-29 2021-06-04 北京天元创新科技有限公司 专线核查方法及系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1625869A (zh) * 2002-05-17 2005-06-08 艾利森电话股份有限公司 分组交换多层通信网中的动态路由
CN101155137A (zh) * 2006-09-25 2008-04-02 华为技术有限公司 一种确定路由路径的方法和路由路径确定单元
CN101478705A (zh) * 2009-01-21 2009-07-08 电子科技大学 基于层间信息路由的可生存性业务量疏导方法
EP2207313A1 (fr) * 2009-01-12 2010-07-14 Alcatel Lucent Procédé de routage d'une communication dans un réseau de communication et système de gestion de routage associé
CN102907053A (zh) * 2012-08-01 2013-01-30 华为技术有限公司 波分网络规划方法及设备

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1625869A (zh) * 2002-05-17 2005-06-08 艾利森电话股份有限公司 分组交换多层通信网中的动态路由
CN101155137A (zh) * 2006-09-25 2008-04-02 华为技术有限公司 一种确定路由路径的方法和路由路径确定单元
EP2207313A1 (fr) * 2009-01-12 2010-07-14 Alcatel Lucent Procédé de routage d'une communication dans un réseau de communication et système de gestion de routage associé
CN101478705A (zh) * 2009-01-21 2009-07-08 电子科技大学 基于层间信息路由的可生存性业务量疏导方法
CN102907053A (zh) * 2012-08-01 2013-01-30 华为技术有限公司 波分网络规划方法及设备

Also Published As

Publication number Publication date
CN102907053B (zh) 2014-10-08
CN102907053A (zh) 2013-01-30

Similar Documents

Publication Publication Date Title
JP5651756B2 (ja) ネットワークトポロジー要求を物理ネットワークにマッピングする方法及び通信システム
CN104486194B (zh) 一种多可靠性等级虚拟网络控制系统和方法
US9491086B2 (en) Distributed network planning systems and methods
KR20160033695A (ko) 네트워크 온 칩에서의 시스템 레벨 시뮬레이션
WO2016086709A1 (fr) Procédé et dispositif de mise en œuvre de planification de capacité
CN105827528A (zh) 一种适用于频谱灵活光网络的路由选择方法
CN106817306B (zh) 一种确定目标路由的方法及装置
US9820020B2 (en) Grooming method and device for packet optical transport network
US10516482B1 (en) Physical layer routing and monitoring
CN107306224A (zh) 一种路由路径更新方法及网络管理装置
CN107465966B (zh) 一种用于光网络的拓扑重构控制方法
CN104301812A (zh) 一种光网络系统和网络功能虚拟化方法
US11706146B1 (en) Directing network traffic using local routing decisions with a global overview
JP5866637B2 (ja) 光電気複合型ネットワークノードの制御装置、制御システム及び制御方法
CN105472484A (zh) 一种电力骨干光传输网波道均衡路由波长分配方法
JP6084583B2 (ja) フロー経路変更計算装置およびフロー経路変更計算システム
WO2014019167A1 (fr) Procédé et dispositif de planification de réseau à multiplexage par répartition en longueur d'onde
JP5782999B2 (ja) 経路決定装置、ノード装置及び経路決定方法
US20180062982A1 (en) Network control device, network control method, and recording medium for program
WO2012103852A2 (fr) Procédé et dispositif de planification de réseau à multiplexage par répartition en longueur d'onde
WO2017024521A1 (fr) Procédé de configuration de services inter-couches et contrôleur
WO2016107757A1 (fr) Procédé et système pour attribuer des indicateurs de performance à des objets d'un réseau
CN107689916A (zh) 一种求完全风险共享链路组分离路径对的方法及系统
JP5898112B2 (ja) ネットワーク設計装置およびネットワーク設計プログラム
CN111988682B (zh) 网络控制方法、装置和系统

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 201280001096.2

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12882014

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12882014

Country of ref document: EP

Kind code of ref document: A1