WO2014187404A1 - POTN网络ODUk环规划方法及装置 - Google Patents

POTN网络ODUk环规划方法及装置 Download PDF

Info

Publication number
WO2014187404A1
WO2014187404A1 PCT/CN2014/079545 CN2014079545W WO2014187404A1 WO 2014187404 A1 WO2014187404 A1 WO 2014187404A1 CN 2014079545 W CN2014079545 W CN 2014079545W WO 2014187404 A1 WO2014187404 A1 WO 2014187404A1
Authority
WO
WIPO (PCT)
Prior art keywords
ring
ring network
capacity
oduk
topology
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2014/079545
Other languages
English (en)
French (fr)
Inventor
于洪宾
欧雪刚
陈捷
刘玲
李兴明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to EP14800576.2A priority Critical patent/EP3089408B1/en
Publication of WO2014187404A1 publication Critical patent/WO2014187404A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/28—Routing or path finding of packets in data switching networks using route fault recovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J3/00—Time-division multiplex systems
    • H04J3/16—Time-division multiplex systems in which the time allocation to individual channels within a transmission cycle is variable, e.g. to accommodate varying complexity of signals, to vary number of channels transmitted
    • H04J3/1605—Fixed allocated frame structures
    • H04J3/1652—Optical Transport Network [OTN]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
    • H04L41/5054—Automatic deployment of services triggered by the service manager, e.g. service implementation by automatic configuration of network components
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5077—Network service management, e.g. ensuring proper service fulfilment according to agreements wherein the managed service relates to simple transport services, i.e. providing only network infrastructure
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
    • H04Q11/0062—Network aspects
    • H04Q2011/0079—Operation or maintenance aspects
    • H04Q2011/0081—Fault tolerance; Redundancy; Recovery; Reconfigurability

Definitions

  • the present invention relates to communication technologies, and in particular, to a POTN network ODUk ring planning method and apparatus. Background technique
  • the Optical Packet Transport Network (POTN) technology is essentially a deep integration of packet technology and optical transport technology after the Packet Transport Network (PTN) technology. It not only has the packet processing capability of PTN, but also The OTN technology is integrated to enhance the line side bandwidth and transmission distance.
  • PTN Packet Transport Network
  • the main services carried by the network include: 2G/3G base station service, group private line and Internet big customer service, internal business (business hall DCN and IPTV), optical line terminal (OLT, Optical Line Terminal), WLAN, environmental monitoring, etc.
  • the POTN network There are three main protection modes in the POTN network: linear 1+1 protection, linear 1:1 protection, and optical channel data unit (ODU).
  • linear protection simply after finding the path on the physical topology, deduct the corresponding capacity.
  • the ODUk ring is mainly divided into an ODU1 ring, an ODU2 ring, an ODU3 ring, and an ODU4 ring according to the capacity of the bearer service.
  • each fiber has multiple waves in the same direction.
  • the link represents a pair of source-destination nodes and waves with the same bandwidth and opposite directions. If there is at least one identical wavelength link between any two nodes of the ring network, the two rings intersect, and the ring intersecting the wavelength link is called the intersecting ring, as shown in Figure 1, which is the intersection of the ODUk ring of the POTN network. In the figure, the symbol "2" on the link indicates the number of wavelengths.
  • Figure 1 shows that the ring network is separated. There are two wavelength links (a and b) between nodes 2-3, which belong to two ring networks (1-2-3-4-1, and 2-5-6-, respectively). 3-2).
  • Figure 2 shows the ring network intersecting. There is only one wavelength link between the two ring network intersection nodes 2 and 3. Compared with the ring network of Figure 2, there are two ring networks between nodes 2-3 due to the separation of the ring networks in Figure 1, resulting in an increase in the number of POTN network ring networks and an increase in wavelength usage. Summary of the invention
  • the embodiments of the present invention provide a method, a device, and a computer storage medium for a POTN network (OTU, Optical Channel Data Unit) k-ring, which can reduce the number of ring networks and reduce the use of wavelengths.
  • POTN network OTU, Optical Channel Data Unit
  • An embodiment of the present invention provides a method for planning an ODUk ring of a POTN network, including: acquiring a physical topology and a ring topology;
  • the ODUk ring of the ring network service is constructed by using the shortest path separated by the two nodes, and the ODUk ring is updated to the ring network topology.
  • the method further includes: setting a capacity of the ODUk ring of the service according to a bandwidth capacity of the service, and updating a capacity of the ring topology and the physical topology link according to a capacity of the ODUk ring.
  • the method further includes:
  • the ring topology and the capacity of the physical topology link are updated according to the capacity of the updated ring network.
  • the method further includes:
  • the ring topology and the capacity of the physical topology link are updated according to the capacity of the updated ring network.
  • the capacity update according to the ring network service of the wavelength link includes the capacity of the ring network of the wavelength link, including:
  • the ring network including the wavelength link is traversed, and when the capacity of the traversed ring network is less than the capacity of the advanced ODUk container formed by the sum of the ODUk container capacities, the capacity of the ring network is updated to the advanced container capacity.
  • the embodiment of the present invention further provides a POTN network ODUk ring planning device, including: a topology obtaining module, a service information acquiring module, a path finding module, an updating module, and a ring network building module; and the topology acquiring module is configured to acquire a physics Topology and ring network topology;
  • the service information obtaining module is configured to obtain node information of a ring network service that needs ring network protection;
  • the path finding module is configured to find a path on the ring network topology according to node information of the ring network service
  • the ring network building module is configured to find a shortest path separated by two nodes on the set map of the physical topology and the ring topology when the path finding module fails to find a path on the ring topology. Constructing an ODUk ring of the ring network service by using the shortest path separated by the two nodes;
  • the update module is configured to update the constructed ODUk ring into the ring topology.
  • the device further includes: a capacity setting module;
  • the capacity setting module is configured to set a capacity of the ODUk ring of the ring network service according to a bandwidth capacity of the service;
  • the update module is further configured to update the ring topology and the capacity of the physical topology link according to a capacity of the ODUk ring
  • the device further includes: a ring network capacity processing module;
  • the ring network capacity processing module is configured to:
  • the update module is further configured to update the capacity of the ring topology and the physical topology link according to the capacity of the updated ring network.
  • the device further includes: a ring network capacity processing module; the ring network capacity processing module is configured to:
  • the update module is further configured to update the capacity of the ring topology and the physical topology link according to the capacity of the updated ring network.
  • the ring network capacity processing module is further configured to determine, by using all the ring network services of the wavelength link, the sum of the ODUk container capacities of the ring network service packages;
  • the ring network including the wavelength link is traversed, and when the capacity of the traversed ring network is smaller than the capacity of the advanced ODUk container formed by the sum of the ODUk container capacities, the capacity of the ring network is updated to the advanced container capacity.
  • the embodiment of the invention further provides a computer storage medium, wherein the computer storage medium stores computer executable instructions, and the computer executable instructions are used to execute the POTN network ODUk ring planning method described above.
  • the technical solution of the embodiment of the invention can reduce the number of rings constructed and reduce the use of wavelengths.
  • the ODUk ring of the service can be constructed by using the shortest path separated by two nodes, that is, the ring network, in a known network topology and service configuration, and a suitable ODUk ring can be constructed to perform services on the ring.
  • Ring network protection Compared with related technologies, it can greatly reduce the number of ring network construction, while reducing the use of wavelengths, saving network resources.
  • Figure 1 is a schematic view of the separation of the ring network
  • 2 is a schematic diagram of the intersection of ring networks
  • 3 is a schematic flowchart of a method for planning an ODUk ring of a POTN network according to Embodiment 1 of the present invention
  • FIG. 4 is a schematic flowchart of a method for planning an ODUk ring of a POTN network according to Embodiment 1 of the present invention
  • FIG. 5 is a schematic flowchart of another ODUk ring planning method for a P0TN network according to Embodiment 1 of the present invention.
  • FIG. 6 is a schematic structural diagram of a P0TN network topology diagram according to Embodiment 2 of the present invention
  • FIG. 7 is a ring network service configuration information table according to Embodiment 2 of the present invention
  • Embodiment 9 is a planned ring network information table according to Embodiment 2 of the present invention.
  • FIG. 10 is a schematic structural diagram of an apparatus for planning an ODUk ring of a first P0TN network according to Embodiment 3 of the present invention.
  • FIG. 11 is a schematic structural diagram of a second P0TN network ODUk ring planning apparatus according to Embodiment 3 of the present invention.
  • FIG. 12 is a schematic structural diagram of a third P0TN network ODUk ring planning apparatus according to Embodiment 3 of the present invention.
  • FIG. 13 is a schematic structural diagram of a fourth POTN network ODUk ring planning apparatus according to Embodiment 3 of the present invention. detailed description
  • Embodiment 1 is a diagrammatic representation of Embodiment 1:
  • this embodiment provides a P0TN network ODUk ring planning method, which includes the following steps:
  • Step 301 Obtain a physical topology and a ring topology.
  • the physical topology of this embodiment includes nodes, fibers between nodes, and links between nodes.
  • the POTN network topology is known according to the actual application, including the number of nodes and the connectivity of the nodes.
  • the network node device has a unified control plane, so that the service working path is switched to the protection path under the affected condition.
  • the ring network topology is composed of an already constructed ODUk ring, including a ring network, a node, and a working path and a protection path.
  • the ring topology can be initialized, initialized to 0, and then planned for the service, and the ring topology is updated after the plan.
  • the method of the embodiment may also include establishing a physical topology and a ring topology before acquiring the physical topology and the ring topology, and then planning by using the established physical topology and the ring topology;
  • the physical topology and the ring topology are not established. For example, the physical topology and the ring topology that have been established and saved can be read.
  • the new ODUk ring when planning a plurality of services, if the current service needs to construct a new ODUk ring, the new ODUk ring needs to be updated to the ring network topology, and then acquired during the planning of the next service.
  • the ring topology is the updated ring topology, and so on until all services are planned.
  • Step 302 Obtain node information of the ring network service that needs to be protected by the ring network, and find a path on the ring network topology according to the node information of the ring network service.
  • a suitable ODUk ring is constructed under the condition of known network topology and service configuration. During the construction, it can know the node information and bandwidth information of the ring network service that needs to be protected by the ring network, and then perform path finding on the ring network topology according to the service node information. For example, the source node of the service is 1, and the destination node is 3, You can find the path of 1-3 on the ring topology. If it exists, it indicates that the working path of the service already has ring protection. In this case, you do not need to construct a ring for the service.
  • the POTN ring network service is directed and the uplink and downlink services are symmetric.
  • the Dijkstra shortest path algorithm with directed directed graphs can be used to establish a working channel or working path.
  • the working channel links of the ring network service are all on the ring network.
  • Step 303 When the path finding fails on the ring topology, find the shortest path separated by two nodes on the set of the physical topology and the ring topology.
  • the ring network is the ODUk ring, and the service is ODUk ring protected.
  • Step 304 Construct an ODUk ring of the ring network service by using the shortest path separated by the two nodes, and update the ODUk ring to the ring network topology.
  • the path of the two node components in this embodiment refers to two paths whose source node is the same but the intermediate nodes are completely different.
  • the shortest path of this embodiment refers to the path that passes through the fewest number of nodes.
  • the present embodiment can reduce the number of ring networks in a POTN network by constructing a ring network service through such a path, and at the same time, the use of wavelengths is reduced because the number of nodes through which the ODUk ring passes is small. Compared with related technologies, it can save network resources and simplify the construction of the ring network.
  • the ODUk ring is constructed in this embodiment by using techniques well known to those skilled in the art. For example, an inter-node working path and a protection path may be established, and the working path and the protection path form an ODUk ring.
  • the ring network in the network refers to an ODUk ring, including two ODUk rings clockwise and counterclockwise, and each ODUk ring includes a working ODUk channel (working path) and a protection ODUk channel (protection path), and the working channel. Use the same wave as the protection channel. But the two ODUk rings, clockwise and counterclockwise, belong to two different waves.
  • the ring is added to the ring network topology.
  • the added ring network topology is used, and so on until all the services are planned. Form a planned ring network topology.
  • the method further includes: setting a capacity of the ODUk ring of the service according to a bandwidth capacity of the service, and updating the ring network extension according to the capacity of the ODUk ring. Park and the capacity of the physical topology link.
  • the bandwidth capacity of the service is 2.5G. Since the ODUk ring needs to reserve half of the resources as the protection bandwidth, the ODUk capacity is at least 5G, and the ODU1 capacity is 2.5G, the ODU2 capacity is 10G, and the ODU3 capacity is 40G.
  • the method in this embodiment can also plan the capacity of the ring network. As shown in FIG. 4, after constructing a new ODUk ring and setting the ring capacity, the method may further include:
  • Step 401 Obtain a working path of the ring network service on the ODUk ring.
  • the working path can be obtained because the working path of the ring network service is established in the above process of constructing the ODUk ring.
  • Step 402 Acquire a wavelength link through which the working path passes and all ring networks including the wavelength link.
  • the working path may include nodes 1-2-3, and the wavelength link through which the working path passes may be (1 - 2) ⁇ ( 2 _ subscript 1 indicates that the number 1 wave passes through the link, and then respectively acquires the wavelength link including (1 - 2 ⁇ ring network, including wavelength link ( 2 -way ring).
  • Step 403 Update the capacity of the ring network including the wavelength link according to the capacity of the ring network service passing through the wavelength link.
  • the ring network When the capacity of the traversed ring network is greater than or equal to the capacity of the advanced ODUk container formed by the sum of the ODUk container capacities, the ring network is not processed, and the ring network is traversed.
  • This embodiment updates the capacity of the ring network including the wavelength link so that the ring network can have sufficient capacity to protect all services passing through the ring network.
  • the wavelength link (1 - ⁇ ring network includes ring 5 of capacity 5G and ring 2 of 10G
  • Tl and T2 Tl bandwidth is 2.5G
  • T2 capacity is 2.5G
  • T1 and T2 are respectively packaged in ODU1
  • the sum of container capacity is 5G.
  • the advanced ODUk container is an ODU2 container
  • the capacity of the ODU2 container is 10G.
  • the capacity of the ring network 1 is less than 10G. It is obvious that the capacity of the ring network 1 is less than 10G, so the capacity of the ring network 1 is updated to 10G, and then it is judged. Whether the capacity of the ring network 2 is less than 10G, it is obvious that the capacity of the ring network 2 is equal to 10G, so the ring network 2 is not processed, and its capacity is stored at 10G.
  • Step 404 Update the capacity of the ring topology and the physical topology link according to the capacity of the updated ring network.
  • the ring topology and the capacity of the physical topology link are updated according to the capacity of the ring network 2.
  • the above describes the construction of a new ODUk ring after the pathfinding failure, and plans the ring capacity of the service in the ODUk ring capacity for planning. Therefore, the method in this embodiment may further include:
  • the network topology can be represented by a directed graph G ( N, L ), which has been known according to practical applications, the links between nodes are known, and the bandwidth is known.
  • G N, L
  • the links between nodes are known, and the bandwidth is known.
  • RB indicates the capacity of the ring network R.
  • the capacity of the ring network refers to the capacity of the ODUk. If it is ODU1, the capacity is 2.5G. If it is ODU2, the capacity is 10G. If it is ODU3, the capacity is 40G. Half of the resources are reserved in the ODUk ring as the protection bandwidth. Therefore, the capacity of a ring network ODUk is further encapsulated into the advanced ODUk container by twice the ODUk container capacity required by the service capacity of the service. The capacity of the advanced OUDK container is Half of the capacity of the ring network is reserved for protection.
  • WP The set of wavelength links through which the work path of the business 7: ⁇ .
  • T C ⁇ , c collection of ring network services, T C ⁇ , c is an arbitrary constant, indicating the number of services. It is assumed here that the services in the set T are all services that require ring network protection.
  • Step 501 First, all the ring network services are sorted according to the service capacity, and the ring topology matrix ringTop is established, and initialized to 0; then the network physical topology is established.
  • Step 502 Traverse the ring network service set 1 in sequence, obtain node information of the service, and find a path on the ring network topology according to the node information.
  • Step 503 Determine whether the path finding is successful. If the path finding is unsuccessful, go to step 504; if successful, go to step 505.
  • Step 504 Form a new ODUK ring, add the ring to the ring topology, and at the same time The capacity of the new ring topology and physical topology links.
  • the symmetric path of the path separated by the two nodes is formed into a new ODUk ring, and the capacity of the ring is equal to the capacity of the ⁇ ]
  • the capacity of the constructed advanced ODUk container is then added to the ring topology, while updating the capacity of the ring topology and the physical topology link.
  • Step 505 Record a collection of wavelength links through which the working path of the ring network service passes.
  • step 505 For each ring network service, step 505 needs to be repeated until the set of wavelength links through which the ring network service working path passes is traversed.
  • Step 506 Traverse the wavelength link in the set and find all rings including the wavelength link.
  • ⁇ Traverse the wavelength link in the set, and get the sum of the capacity of the ODU containers packaged by all the ring network services of the wavelength link ⁇ TM ⁇ 3 ⁇ 4/, and find all the ring networks P including the link of this wavelength.
  • Step 507 Traverse the processing of each ring in the set R.
  • Step 506 and step 507 are performed on all the wavelength links in the set. After obtaining the ring network including the wavelength link for one wavelength link and traversing the obtained ring network, it is also required to return to step 506 for processing. The other wavelength links in the set are processed until the wavelength link in the set is processed.
  • Step 508 Determine whether the capacity of the ring network ⁇ is smaller than the capacity OZ) of the advanced ODUk formed by SumVoi. If yes, go to step 509. If no, go to step 507 to traverse other ring networks in the set.
  • Step 508 and step 509 are processing for each ring network in the set; after a ring network in the set R corresponds to step 508 and step 509, step 508 and steps corresponding to other ring networks in the set R are also required. 509 performs processing until the ring network in the set R is processed. Step 510: All ring network services are traversed and the planning ends.
  • the method in this embodiment can implement ring network protection according to the ring network constructed by the POTN network service and the planned ring network capacity, minimize the number of ring network construction, and reduce the use of wavelengths.
  • multiple ring networks exist in some sections of the service working path to protect the survivability of the service.
  • the algorithm is also suitable for dynamic joining of services, and has strong practicability.
  • step S10 the physical topology of the POTN network as shown in FIG. 6 and the topology of the ring network initialized to 0 are established, and the upper limit of the wavelength bandwidth is 40 G.
  • FIG. 7 includes the ring network service that the network needs to bear.
  • Figure 6 is a POTN network topology. Each circle represents a node in the network topology. There are 8 nodes in total.
  • the link is two fibers with opposite directions. The number "2" on the link indicates the number of fibers, and the number of fibers in the same direction is 2 in the same direction. Wave, the upper limit of the wave capacity is 40G.
  • Figure 7 is a table of business information that needs to be allocated.
  • the information of the service may include a source node, a destination node, a protection mode, and a bandwidth of the service.
  • step S20 the service set is traversed in sequence. If the service 1 is (1-3), the path is first found on the ring network topology, and the ring network topology is not found, and the ring network topology and the physical topology are collected. Looking for a path separated by two nodes, the wavelength link set through the working path ⁇ ⁇ is ((1 - A, ( 2 _ subscript 1 indicates the number 1 wave passing through the link, because the wavelength chain is recorded here) Road, not fiber), the wavelength link set through the downlink protection path is (( 3 _ 4 , (4-l ) 0
  • Step S30 the working path and the downlink protection path form an ODUk ring (1-2-3-4-1, ring network ID is 1), the ODUk ring is an ODU2 ring, the ring network capacity is 10G, and the capacity occupied by the working path It is 2.5C - the capacity of an ODU1 container).
  • the ring network information is added to the ring topology, and the physical topology information is updated at the same time (1-2, 2-3, 3-4, 4-1 are only 2 of these links in the physical topology). Wave, because there are only two waves in the fiber), traverse the set i.
  • Step S30 can be implemented by step S310 and step 320:
  • Step S310 the obtained wavelength links (l- 2, this link comprises a ring with a ring 1, ring 1 is not less than the capacity, traffic can be protected by the size of the capacity of the container advanced ODU service package ring, Then ring network I does not process.
  • a wavelength link ( 2 _ is included, and the ring including the link has a ring network 1, and the capacity of the ring network 1 is not less than the capacity of the advanced ODU container encapsulated by the ring network service, and the service can be protected. Ring network I does not process.
  • the service 1 is planned to be completed, and the ring network 1 (1-2-3-4-1) is created, and the ring network is the ODU2 ring.
  • the working capacity of the ring network is 2.5G, and then the next service is planned.
  • step S50 the service 2 (1 8) is taken.
  • the path is found on the ring network topology, and the ring network topology is not found.
  • the two nodes are separated on the ring network topology and the physical topology.
  • Path the set of wavelength links through which the working path passes is ((1- ⁇ , ( 2 _ )), and the set of wavelength links through which the downlink protection path passes is ((8-7; ⁇ ,
  • Step S60 the working path and the downlink protection path form an ODUk ring (1-2-8-7-1, ring network ID is 2), the ODUk ring is an ODU1 ring, and the ring network capacity is 2.5G, and the working path occupies The capacity is 1.25G (the capacity of one ODU0 container).
  • the ring network information is added to the ring topology, and the physical topology information traversal set is updated at the same time.
  • Step S60 can be implemented by using step S610 and step S620:
  • Step S610 obtaining a wavelength link (1-2 ) , including the ring network 1 and the ring network 2 of the link, and the ODU of the capacity encapsulation of all ring network services passing through the wavelength link (service 1 is ODU1, Service 2 is ODU0) is 3.75, and the capacity of ring network 1 is not less than the capacity of the encapsulated advanced ODU container (ODU2), which can protect the service.
  • ODU2 ⁇ /Encapsulated Advanced ODU Container
  • the ring ODU2 ring of ring 2 is updated, and the capacity is 10G.
  • step S620 the wavelength link ( 2 _ , including the ring of the link, the ring network 2, the sum of the ODUs of the capacity encapsulation of all the ring network services of the wavelength link (the service 2 is the ODU0) is 1.25, and the ring network is obtained.
  • the capacity of 2 is not less than the capacity of the encapsulated advanced ODU container, and the service can be protected, and the ring network 2 does not process.
  • the service 2 is planned to be completed, and the ring network 2 (1-2-8-7-1) is newly created.
  • the ring network is the ODU2 ring, and the ring network has a working capacity of 3.75G, and then the next service is planned.
  • the working path ( ) create a new ring network 3 ( 2-5-6-3-2 ), the ring network is an ODU3 ring, and the working capacity of the ring network is 10G.
  • the working path is ((1-2; ⁇ , ), after the ring network 1, 2, 3, the capacity of the ring network 1 is unchanged, still the ODU2 ring, the working capacity is 5G (the sum of the capacity of one ODU1 and the two ODU0), and the capacity of the ring network 2 is unchanged, which is the ODU2 ring.
  • the working capacity is 5G
  • the ring network 3 is still the ODU3 ring
  • the working capacity is 11.25G.
  • a ring network planning table as shown in FIG. 9 is obtained, which includes: the ring network ID and the ring network capacity and working capacity after the planning.
  • a work path table of the service shown in FIG. 8 can be obtained, including a service number, a source node, and a work path.
  • this embodiment provides a POTN network ODUk ring planning apparatus, including: a topology acquisition module, a service information acquisition module, a path finding module, an update module, and a ring network construction module;
  • the topology acquisition module is configured to acquire a physical topology and a ring topology;
  • the service information obtaining module is configured to obtain node information of a ring network service that needs ring network protection
  • the path finding module is configured to find a path on the ring network topology according to node information of the ring network service
  • the ring network building module is configured to find a shortest path separated by two nodes on the set map of the physical topology and the ring topology when the path finding module fails to find a path on the ring topology. Constructing an ODUk ring of the ring network service by using the shortest path separated by the two nodes;
  • the update module is configured to update the constructed ODUk ring into the ring topology.
  • the apparatus further includes: a capacity setting module;
  • the capacity setting module is configured to set the ring network service according to the bandwidth capacity of the service
  • the update module is further configured to update the ring topology and the capacity of the physical topology link based on the capacity of the ODUk ring.
  • the device further includes: a ring network capacity processing module; the ring network capacity processing module is configured to:
  • the update module is further configured to update the capacity of the ring topology and the physical topology link according to the capacity of the updated ring network.
  • the device shown in FIG. 10 may further include a ring capacity processing module; the ring capacity processing module is configured to: And obtaining, by the path finding module, a working path of the service from the ring network topology when the path topology of the ring network is successful;
  • the update module is further configured to update the capacity of the ring topology and the physical topology link according to the capacity of the updated ring network.
  • the ring network capacity processing module is further configured to determine all ring network services that pass through the wavelength link, and obtain a sum of ODUk container capacities encapsulated in each ring network service;
  • the ring network including the wavelength link is traversed, and when the capacity of the traversed ring network is smaller than the capacity of the advanced ODUk container formed by the sum of the ODUk container capacities, the capacity of the ring network is updated to the advanced container capacity.
  • the modules in the OOTk ring planning device of the POTN network may be a Central Processing Unit (CPU), a Digital Signal Processor (DSP) or a Field Programmable Gate Array (FPGA, Field) in the POTN network ODUk ring planning device. Programmable Gate Array ) implementation.
  • CPU Central Processing Unit
  • DSP Digital Signal Processor
  • FPGA Field Programmable Gate Array
  • the embodiment describes a computer storage medium, where the computer storage medium stores computer executable instructions, and the computer executable instructions are used to execute the OOTk ring planning method of the POTN network shown in any of FIG. 3 to FIG. .
  • the device in this embodiment can reasonably plan the ODUk ring and ring capacity of the service, minimize the number of ring network constructions, and reduce the use of wavelengths. At the same time, there are multiple ring networks in the part of the business work path to protect the survivability of the service.
  • the algorithm is also applicable to the dynamic joining of services, and has strong practicability.
  • embodiments of the invention may be provided as a method, system, or Computer program product. Accordingly, the present invention may take the form of a hardware embodiment, a software embodiment, or a combination of software and hardware. Moreover, the invention can be embodied in the form of one or more computer program products embodied on a computer usable storage medium (including but not limited to disk storage and optical storage, etc.) in which computer usable program code is embodied.
  • a computer usable storage medium including but not limited to disk storage and optical storage, etc.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps that are configured to implement the functions specified in one or more blocks of the flowchart or in a block or blocks of the flowchart.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Small-Scale Networks (AREA)

Abstract

本发明实施例公开了一种POTN网络ODUk环规划方法、装置及计算机存储介质；所述方法包括：获取物理拓扑和环网拓扑；获取需要环网保护的环网业务的节点信息，根据所述环网业务的节点信息在所述环网拓扑上寻路；当在所述环网拓扑上寻路失败时，在所述物理拓扑和环网拓扑的集合图上寻找两条节点分离的最短路径；以所述两条节点分离的最短路径构建该环网业务的ODUk环，将该ODUk环更新至所述环网拓扑中。

Description

POTN网络 ODUk环规划方法及装置 技术领域
本发明涉及通信技术， 尤其涉及一种 POTN网络 ODUk环规划方法及 装置。 背景技术
光分组传送网络（ POTN， Packet Optical Transport Network ) 技术实质 上是继分组传送网络（PTN， Packet Transport Network )技术后， 分组技术 和光传送技术的进一步深度融合， 它不仅具有 PTN的分组处理能力， 同时 融合了 OTN技术增强线路侧带宽和传输距离。在运营商的城域网中， POTN 将最先应用在城域核心和汇聚层， 随着接入层容量需求的提升， 逐步向接 入层延伸。 网络主要承载的业务有： 2G/3G基站业务、 集团专线和互联网 大客户业务、 内部业务（营业厅 DCN和 IPTV )、 光线路终端 (OLT， Optical Line Terminal )、 WLAN、环境监控等多种高质分组业务以及 STM时分业务、 光通道数据单元（OUD )业务和光信道层（OCH ) 业务。 所以一旦网络中 链路或节点失效将中断大量的业务， 造成巨大的损失。同时随着业务规模和 带宽的日益扩大， 业务的生存性显得越来越重要，这就迫使我们考虑 POTN 网络业务的生存能力。
POTN网络中主要有三种保护方式： 线性 1+1保护、 线性 1 :1保护和光 通路数据单元（ ODU， Optical channel Data Unit ) k环网保护。 对于线性保 护， 只是简单的在物理拓朴上寻路之后， 扣除相应的容量。 ODUk 环， 根 据承载业务容量的大小， 主要分为 ODU1环、 ODU2环、 ODU3环和 ODU4 环。
在 ODUk环网保护中， 节点对间存在多条光纤的网络， 每条光纤中有 多个相同方向的波， 链路表示一对源目节点和带宽相同， 方向相反的波。 两个环网任意节点之间至少有一条相同的波长链路， 则两环相交， 相交于 该波长链路的环称之为相交环， 如图 1所示， 为 POTN网络 ODUk环相交 的说明图， 链路上标号 "2" 表示波长数。 图 1环网相离， 在节点 2-3之间 存在两条波长链路（ a和 b )， 分别属于两个环网（ 1-2-3-4-1， 和 2-5-6-3-2 )。 图 2为环网相交， 在两个环网相交节点 2和 3间只有一条波长链路。 与图 2 的环网相比， 图 1 中由于环网相离导致节点 2-3之间存在两个环网， 导致 POTN网络环网构建数量增加， 波长使用增加。 发明内容
本发明实施例提供一种 POTN网络（ ODU， Optical channel Data Unit ) k环规划方法、 装置及计算机存储介质， 能够减少环网构建数量， 减少波长 的使用。
本发明实施例的技术方案是这样实现的：
本发明实施例提供一种 POTN网络 ODUk环规划方法， 包括： 获取物理拓朴和环网拓朴；
获取需要环网保护的环网业务的节点信息， 根据所述环网业务的节点 信息在所述环网拓朴上寻路；
当在所述环网拓朴上寻路失败时， 在所述物理拓朴和环网拓朴的集合 图上寻找两条节点分离的最短路径；
以所述两条节点分离的最短路径构建所述环网业务的 ODUk环， 将所 述 ODUk环更新至所述环网拓朴中。
优选地， 所述方法还包括： 根据所述业务的带宽容量设置该业务的 ODUk环的容量， 并且根据该 ODUk环的容量更新所述环网拓朴和所述物 理拓朴链路的容量。
优选地， 所述方法还包括：
获取所述 ODUk环上所述环网业务的工作路径； 网；
根据经过所述波长链路的环网业务的容量更新包括所述波长链路的环 网的容量；
根据更新后的环网的容量更新所述环网拓朴和所述物理拓朴链路的容 量。
优选地， 所述方法还包括：
当在所述环网拓朴寻路成功时， 从所述环网拓朴中获取所述环网业务 的工作路径； 网；
根据经过所述波长链路的环网业务的容量更新包括所述波长链路的环 网的容量；
根据更新后的环网的容量更新所述环网拓朴和所述物理拓朴链路的容 量。
优选地， 所述根据经过所述波长链路的环网业务的容量更新包括所述 波长链路的环网的容量， 包括：
确定经过所述波长链路的所有环网业务，获取各环网业务封装的 ODUk 容器容量之和；
遍历包括所述波长链路的环网， 当遍历的环网的容量小于所述 ODUk 容器容量之和所构成的高级 ODUk容器容量时， 更新所述环网的容量为所 述高级容器容量。
本发明实施例还提供了一种 POTN网络 ODUk环规划装置， 包括： 拓 朴获取模块、 业务信息获取模块、 寻路模块、 更新模块以及环网构建模块； 所述拓朴获取模块配置为获取物理拓朴和环网拓朴； 所述业务信息获取模块配置为获取需要环网保护的环网业务的节点信 息；
所述寻路模块配置为根据所述环网业务的节点信息在所述环网拓朴上 寻路；
所述环网构建模块配置为当所述寻路模块在所述环网拓朴上寻路失败 时， 在所述物理拓朴和环网拓朴的集合图上寻找两条节点分离的最短路径； 以所述两条节点分离的最短路径构建该环网业务的 ODUk环；
所述更新模块配置为将构建的 ODUk环更新至所述环网拓朴中。
优选地， 所述装置还包括： 容量设置模块；
所述容量设置模块配置为根据所述业务的带宽容量设置所述环网业务 的 ODUk环的容量；
所述更新模块还配置为根据所述 ODUk环的容量更新所述环网拓朴和 所述物理拓朴链路的容量
优选地， 所述装置还包括： 环网容量处理模块；
所述环网容量处理模块配置为：
获取所述 ODUk环上所述环网业务的工作路径； 网；
根据经过所述波长链路的环网业务的容量更新包括所述波长链路的环 网的容量；
所述更新模块还配置为根据更新后的环网的容量更新所述环网拓朴和 所述物理拓朴链路的容量。
优选地， 所述装置还包括： 环网容量处理模块； 所述环网容量处理模 块配置为：
当所述寻路模块在所述环网拓朴寻路成功时， 从所述环网拓朴中获取 所述业务的工作路径； 网；
根据经过所述波长链路的环网业务的容量更新包括所述波长链路的环 网的容量；
所述更新模块还配置为根据更新后的环网的容量更新所述环网拓朴和 所述物理拓朴链路的容量。
优选地， 所述环网容量处理模块还配置为确定经过所述波长链路的所 有环网业务， 获取各环网业务封装的 ODUk容器容量之和；
遍历包括所述波长链路的环网， 当遍历的环网的容量小于所述 ODUk 容器容量之和所构成的高级 ODUk容器容量时， 将更新该环网的容量为所 述高级容器容量。
本发明实施例还提供一种计算机存储介质， 所述计算机存储介质中存 储有计算机可执行指令，所述计算机可执行指令用于执行以上所述的 POTN 网络 ODUk环规划方法。
本发明实施例的有益效果是：
本发明实施例的技术方案能够减少环网构建数量， 减少波长的使用。 通过实施本发明， 可以在已知网络拓朴和业务配置情况下， 以两条节点分 离的最短路径构建业务的 ODUk环， 即环网， 可以构建合适的 ODUk环， 对经过该环的业务进行环网保护； 与相关技术相比， 可以大限度减少环网 构建数量， 同时减少波长的使用， 节省了网络资源。 另外， 业务工作路径 部分段存在多个环网保护， 提供了业务的生存能力。 附图说明
图 1为环网相离的示意图;
图 2为环网相交的示意图; 图 3为本发明实施例一提供的一种 P0TN网络 ODUk环规划方法的流 程示意图；
图 4为本发明实施例一提供的 P0TN网络 ODUk环规划方法的流程示 意图；
图 5为本发明实施例一提供的另一种 P0TN网络 ODUk环规划方法的 流程示意图；
图 6为本发明实施例二提供的一种 P0TN网络拓朴图的结构示意图； 图 7为本发明实施例二提供的一种环网业务配置信息表；
图 8为本发明实施例二提供的一种业务的工作路径表；
图 9为本发明实施例二提供的一种规划后的环网信息表；
图 10为本发明实施例三提供的第一种 P0TN网络 ODUk环规划装置的 结构示意图；
图 11为本发明实施例三提供的第二种 P0TN网络 ODUk环规划装置的 结构示意图；
图 12为本发明实施例三提供的第三种 P0TN网络 ODUk环规划装置的 结构示意图；
图 13为本发明实施例三提供的第四种 P0TN网络 ODUk环规划装置的 结构示意图。 具体实施方式
下面通过具体实施方式结合附图对本发明作进一步详细说明。
实施例一：
请参考图 3， 本实施例提供了一种 P0TN网络 ODUk环规划方法， 包 括如下步骤：
步骤 301 : 获取物理拓朴和环网拓朴。
本实施例的物理拓朴包括节点、 节点之间的光纤以及节点之间的链路 的信息， 拓朴中节点间光纤有多条波。 本实施例中在规划时， POTN网络拓 朴结构根据实际应用已知， 包括节点数和节点连通情况。 本实施例拓朴中 网络节点设备有统一控制平面， 从而支持业务工作路径在受影响情况下， 倒换到保护路径。
本实施例中环网拓朴由已经构建的 ODUk环构成， 包括环网、 节点以 及工作路径、 保护路径等信息。
本实施例可以对环网拓朴进行初始化， 将其初始化为 0， 然后为业务进 行规划， 规划后更新环网拓朴。
本实施例方法在获取物理拓朴和环网拓朴之前还可以包括建立物理拓 朴和环网拓朴， 然后利用建立的物理拓朴和环网拓朴进行规划； 当然本实 施例方法也可以不建立物理拓朴和环网拓朴， 例如可以读取已经建立并保 存的物理拓朴和环网拓朴。
本实施例方法在对多个业务进行规划时， 如果当前业务需要构建新的 ODUk环， 则需要将新的 ODUk环更新至环网拓朴， 然后在对下一个业务 的规划时， 所获取的环网拓朴为更新后的环网拓朴， 以此类推直到所有业 务均规划完毕。
步骤 302: 获取需要环网保护的环网业务的节点信息，根据所述环网业 务的节点信息在所述环网拓朴上寻路。
本实施例方法是在已知网络拓朴和业务配置情况下，构建合适的 ODUk 环。 在构建时， 可以知道需要环网保护的环网业务的节点信息以及带宽信 息，然后根据业务节点信息在环网拓朴上进行寻路，例如业务的源节点为 1、 目的节点为 3，就可以在环网拓朴上查找是否已经存在 1-3的路径，若存在， 就说明该业务的工作路径已经有环网保护， 此时就不需要构建该业务的环 网。
本实施例中 POTN环网业务是有向的且上下行业务为对称的， 业务进 行路由建立工作通道即工作路径时可以釆用有向带权图的 Dijkstra 最短路 径算法。 环网业务的工作通道链路全部在环网上。
步骤 303: 当在所述环网拓朴上寻路失败时， 在所述物理拓朴和环网拓 朴的集合图上寻找两条节点分离的最短路径。
当根据环网业务的节点信息在环网拓朴上寻路失败时， 也就是说环网 拓朴上不存在该业务的工作路径以及该工作路径的环网保护， 此时需要构 建该业务的环网即 ODUk环， 对该业务进行 ODUk环保护。
步骤 304: 以所述两条节点分离的最短路径构建该环网业务的 ODUk 环， 将该 ODUk环更新至所述环网拓朴中。
本实施例两条节点分量的路径指的是源目节点相同， 但中间节点完全 不同的两条路径。 本实施例的最短路径指的是经过节点数目最少的路径。 本实施例通过这样的路径构建环网业务可以减少 POTN网络中环网的构建 数量， 同时由于 ODUk环经过的节点较少， 就减少了波长的使用。 与相关 技术相比， 可以节省网络资源， 简化环网的构建。
本实施例中构建 ODUk环釆用本领域技术人员所熟知的技术， 例如， 可以为建立节点间工作路径和保护路径， 由工作路径和保护路径构成一个 ODUk环。 本实施例中网络中的环网是指 ODUk环， 包括顺时针和逆时针 两个 ODUk环， 每个 ODUk环中又包括工作 ODUk通道（工作路径）和保 护 ODUk通道（保护路径）， 工作通道和保护通道使用同一个波。 但是顺时 针和逆时针的两个 ODUk环则是分别属于两个不同的波。
本实施例在构建新的 ODUk环之后将该环添加到环网拓朴中， 当对下 一个业务进行规划时， 使用添加后的环网拓朴， 以此类推直到所有的业务 都规划完， 形成一个规划后的环网拓朴。
本实施例在构建 ODUk环之后， 还包括： 根据所述业务的带宽容量设 置该业务的 ODUk环的容量， 并且根据该 ODUk环的容量更新所述环网拓 朴和所述物理拓朴链路的容量。 例如业务的带宽容量为 2.5G， 由于 ODUk 环中还需要预留一半的资源作为保护带宽， 所以 ODUk容量最少为 5G， 而 ODU1容量为 2.5G、 ODU2容量为 10G， ODU3容量为 40G， 所以可以设 置构建的 ODUk环为 ODU2环；然后更新环网拓朴和物理拓朴链路的容量。
本实施例方法还可以对环网的容量进行规划， 如图 4所示， 在构建新 的 ODUk环和设置该环容量之后还可以包括：
步骤 401 : 获取所述 ODUk环上所述环网业务的工作路径。
可以获取工作路径是由于在上述构建 ODUk环过程中建立了环网业务 的工作路径。
步骤 402:获取所述工作路径经过的波长链路以及所有包括所述波长链 路的环网。
例如工作路径可以包括节点 1-2-3， 工作路径经过的波长链路可以为 (1 - 2)^ (2_ 下标 1表示经过链路中的 1号波， 然后分别获取包括波长链 路 (1 - 2\的环网， 包括波长链路 (2 - 的环网。
步骤 403:根据经过所述波长链路的环网业务的容量更新包括所述波长 链路的环网的容量。
例如， 确定经过该波长链路的所有环网业务， 获取各环网业务封装的 ODUk容器容量之和； 遍历包括该波长链路的环网， 当遍历的环网的容量 小于所述 ODUk容器容量之和所构成的高级 ODUk容器容量时， 将更新该 环网的容量为所述高级容器容量；
当遍历的环网的容量大于或等于 ODUk 容器容量之和所构成的高级 ODUk容器容量时， 对该环网不做处理， 遍历一下环网。
本实施例更新包括波长链路的环网的容量使得环网能够有足够的容量 对所有经过该环网的业务进行保护。 例如经过波长链路 (1 - ^的环网包括容 量为 5G的环网 1和 10G的环网 2， 经过波长链路 (1 - ^业务有 T1和 T2， Tl和 T2， Tl带宽为 2.5G、 T2的容量为 2.5G， T1和 T2分别封装在 ODU1 中， 那么 T1和 Τ2封装的 ODUk容器容量即为 2*0DU1=5G， 容器容量之 和为 5G， 其构成的高级 ODUk容器为 ODU2容器， ODU2容器的容量为 10G;首先判断环网 1的容量是否小于 10G，很明显环网 1的容量小于 10G， 所以更新环网 1的容量为 10G， 然后判断环网 2的容量是否小于 10G， 很 明显环网 2的容量等于 10G， 所以对环网 2不#丈处理， 其容量保存在 10G。
步骤 404:根据更新后的环网的容量更新所述环网拓朴和所述物理拓朴 链路的容量。
例如根据环网 2的容量更新环网拓朴和所述物理拓朴链路的容量。 上述介绍的是在寻路失败后构建新的 ODUk环， 并规划 ODUk环容量 中业务的环网容量进行规划。 因此， 本实施例的方法还可以包括：
当在所述环网拓朴寻路成功时， 从所述环网拓朴中获取所述业务的工 作路径 ；
获取该工作路径经过的波长链路以及所有包括所述波长链路的环网； 根据经过所述波长链路的环网业务的容量更新包括所述波长链路的环 网的容量； 其中， 更新环网容量的过程可以参考上述在新建环网情况下的 环网容量更新过程。
下面结合对 ODUk环构建以及容量规划， 对本发明实施例记载的方法 进行说明。 本实施例中网络拓朴可以通过一个有向图 G ( N， L )表示， 具 体拓朴结构已根据实际应用已知， 节点间的链路已知， 带宽已知。 首先对 本实施例的相关参数进行介绍：
N: N为节点设备集合， n=|N|为节点个数。
L: 网络链路集合， d=|L|为链路数， 节点间可以有多条链路。
M: 表示光纤集合， Μ^Λ^ ,Μ^..., Mm } , m表示网络的光纤数， 由 于节点间可以存在多条链路， 所以 m=2d。
: 表示环网集合， Κ={ ， , ...... RK } , k表示网络中段保护环个数， 开始时环网集合为空， k为 0。
RB, : 表示环网 R,的容量， 环网的容量指的是 ODUk 的容量， 如果是 ODU1 , 则容量为 2.5G， 如果为 ODU2， 则容量为 10G， 如果为 ODU3， 则 容量为 40G， ODUk环中预留了一半的资源作为保护带宽， 因此一个环网 ODUk的容量是由业务的工作容量需要的 ODUk容器容量的两倍再一步封 装到高级 ODUk容器中，高级 OUDK容器的容量即为环网的容量，其中有一 半是作为预留的保护容量。
WP, : 业务 7：·的工作路径经过的波长链路集合。
τ: 环网业务集合，
Figure imgf000013_0001
TC } , c为任意常数， 表示业务数， 此 处假设集合 T中业务全是需要环网保护的业务。
具体完成的 ODUk环构建和容量规划的步骤如下：
步骤 501 : 首先给所有环网业务按业务容量大小进行排序， 建立环网拓 朴矩阵 ringTop, 并且初始化为 0; 然后建立网络物理拓朴。
步骤 502: 依次遍历环网业务集合1， 获取业务 的节点信息， 根据节 点信息在环网拓朴上寻路。
需要说明的是， 后续步骤是对业务集合 T 中每个业务进行的处理， 为 便于说明，仅对业务集合中的一个业务 进行的处理为例进行说明， 当对业 务集合中的所有业务进行了下述处理之后， 则表明所有环网业务遍历完毕， 规划结束。
步骤 503: 判断是否寻路成功， 若寻路不成功， 转步骤 504; 若成功， 则转步骤 505。
由于对环网拓朴初始化为 0， 第一次肯定是寻路失败的。
步骤 504: 组成一个新 ODUK环， 将该环添加到环网拓朴中， 同时更 新环网拓朴和物理拓朴链路的容量。
在环网拓朴和物理拓朴的集合图上寻找两条节点分离的路径， 以寻到 的两条节点分离的路径的对称路径组成一个新 ODUk环，该环的容量等于 Ί] 的容量所构成的高级 ODUk容器的容量， 然后将该环添加到环网拓朴中， 同时更新环网拓朴和物理拓朴链路的容量。
步骤 505： 记录该环网业务工作路径经过的波长链路集合 。
对于每一个环网业务， 步骤 505 需要重复执行， 直至遍历完该环网业 务工作路径经过的波长链路集合。
步骤 506: 遍历集合 里的波长链路， 找到包括波长链路的所有环网。 ^^遍历集合 里的波长链路， 得到经过此波长链路的所有环网业务 容量分别封装的 ODU容器容量之和 ^™ί¾/，找到包括此波长链路的所有环 网 P 。
步骤 507: 遍历处理集合 R里的每一个环网。
步骤 506和步骤 507为针对集合里的所有波长链路进行的处理， 当针 对一个波长链路， 得到包括该波长链路的环网、 且遍历所得到的环网后， 还需要返回步骤 506处理集合中的其他波长链路， 直至集合中的波长链路 处理完毕。
步骤 508： 判断环网^^的容量 是否小于由 SumVoi所构成的高级 ODUk的容量 OZ) /， 若是， 则转步骤 509， 若否， 则转步骤 507以遍历 集合中其他环网。
步骤 509: 更新环网容量 R = ODUVol , 记录环网容量和工作容量， 同 时更新环网拓朴中波长链路的容量使用情况。
步骤 508和步骤 509为对集合中的每一个环网进行的处理；当对集合 R 中的一个环网对应步骤 508和步骤 509之后， 还需对集合 R的中其他环网 对应步骤 508和步骤 509进行处理， 直至集合 R中的环网处理完毕。 步骤 510: 所有环网业务遍历完毕， 规划结束。
本实施例的方法可以根据 POTN网络业务构建的环网及规划出的环网 容量， 既能达到对环网业务保护， 最大限度减少环网构建数量， 减少波长 的使用。 同时业务工作路径部分段存在多个环网进行保护， 提高了业务的 生存能力。 该算法同时适用于业务的动态加入， 实用性强。 实施例二：
本实施例将以简单的物理拓朴和环网业务来介绍本发明实施例记载的 规划方法：
步骤 S10， 建立初始为如图 6的 POTN网络物理拓朴， 和初始化为 0 的环网拓朴， 波长带宽上限为 40G， 图 7中包括网络需要承载的环网业务。
图 6是 POTN网络拓朴图。 每一个圓代表网络拓朴中的一个节点， 共 有 8个节点， 链路为两条方向相反的光纤， 链路上标号 "2" 表示光纤数， 4叚设一条光纤中有 2个同方向的波， 波的容量上限为 40G。
图 7是需要分配的业务信息表。 其中业务的信息可以包括业务的源节 点、 目的节点、 保护方式、 带宽等。
步骤 S20， 依次遍历业务集合， 假如业务 1为 （1-3 )， 首先在环网拓朴 上寻路， 环网拓朴上找不到， 则在环网拓朴和物理拓朴的集合图上寻找两 条节点分离的路径， 工作路径经过的波长链路集合^ ^为（（1 - A， （2_ 下 标 1表示经过链路中的 1号波，因为此处记录的是波长链路，而不是光纤）， 下行保护路径经过的波长链路集合为 （（3_4 ， (4-l )0
步骤 S30， 以工作路径和下行保护路径组成一个 ODUk环 （ 1-2-3-4-1， 环网 ID为 1 )， 该 ODUk环为 ODU2环， 环网容量为 10G， 工作路径占用 的容量为 2.5C —个 ODU1容器的容量）。在该环网信息添加到环网拓朴中， 同时更新物理拓朴信息 （ 1-2,2-3,3-4,4-1在物理拓朴中这些链路中只有 2号 波， 因为光纤中只有两个波）， 遍历集合 i 。
步骤 S30可以通过步骤 S310和步骤 320实现：
步骤 S310， 得到波长链路 (l-2 ， 包括此链路的环有环网 1， 环网 1的 容量不小于由该环网业务封装的高级 ODU容器容量的大小，可以对业务进 行保护， 则环网 I不处理。
步骤 S320， 得到波长链路 (2_ ， 包括此链路的环有环网 1， 环网 1的 容量不小于由该环网业务封装的高级 ODU容器容量的大小，可以对业务进 行保护， 则环网 I不处理。
步骤 S40， 业务 1规划结束， 新建环网 1 (1-2-3-4-1)， 环网为 ODU2 环， 环网的工作容量为 2.5G， 然后进行下一个业务的规划。
按照以上步骤， 对应对业务 2进行处理：
步骤 S50， 取业务 2 (1 8)， 首先在环网拓朴上寻路， 环网拓朴上找不 到， 则在环网拓朴和物理拓朴的集合图上寻找两条节点分离的路径， 工作 路径经过的波长链路集合 为 （（1-^， （2_ )， 下行保护路径经过的波 长链路集合为 （（8-7；^，
Figure imgf000016_0001
步骤 S60， 以工作路径和下行保护路径组成一个 ODUk环 （ 1-2-8-7-1， 环网 ID为 2 )， 该 ODUk环为 ODU1环， 环网容量为 2.5G， 工作路径占用 的容量为 1.25G (—个 ODU0容器的容量）。在该环网信息添加到环网拓朴中， 同时更新物理拓朴信息遍历集合 。
步骤 S60可以通过步骤 S610和步骤 S620实现：
步骤 S610， 得到波长链路 (l-2 ， 包括此链路的环有环网 1和环网 2， 经过此波长链路的所有环网业务的容量封装的 ODU之和 (业务 1为 ODU1, 业务 2为 ODU0)为 3.75， 环网 1的容量不小于由 封装的高 级 ODU容器 （ODU2)容量的大小， 可以对业务进行保护， 则环网 I不处 理， 环网 2的容量小于由 ^謹^/封装的高级 ODU容器（ODU2)容量的大 小， 则更新环网 2的尾 ODU2环， 容量为 10G。
步骤 S620， 得到波长链路 (2_ ， 包括此链路的环有环网 2， 经过此波 长链路的所有环网业务的容量封装的 ODU之和 (业务 2为 ODU0 ) 为 1.25， 环网 2的容量不小于由 封装的高级 ODU容器容量的大小， 可以对业务进行保护， 则环网 2不处理。
步骤 S70， 业务 2规划结束， 新建环网 2 ( 1-2-8-7-1 )， 环网为 ODU2 环， 环网的工作容量为 3.75G， 然后进行下一个业务的规划。
按照以上与业务 1和业务 2对应的处理步骤， 对于业务 3 ( 2-6 )， 工作 路径 (
Figure imgf000017_0001
), 新建环网 3 ( 2-5-6-3-2 ), 环网为 ODU3环， 环网 的工作容量为 10G。 业务 4 ( 1-5 )， 工作路径为 （（1-2；^，
Figure imgf000017_0002
), 经过环 网 1、 2、 3， 环网 1容量不变， 仍为 ODU2环， 工作容量为 5G (—个 ODU1 和两个 ODU0容量之和）， 环网 2容量不变， 为 ODU2环， 工作容量为 5G， 环网 3仍为 ODU3环，工作容量为 11.25G。业务 5 ( 1-9 )，工作路径（ (1- )^ (7 - 8)ρ (8 - 9^ ), 新建环 4 ( 1-7-8-9-5-2-1 )， 环网为 ODU2环， 工作容量为 2.5G, 其余环的信息不变。 业务 6 ( 2-5 )， 工作路径（（2_5)2 )， 此时只能选 2号波， 因为 2-5中 1号波容量不够， 新建环 5 ( 2-5-6-3-2 ), 环网为 ODU3 环， 工作容量为 10G， 由于不经过其他环， 因此不影响其他环的信息。
按照上述的步骤最终得到如图 9所示的环网规划表， 该表包括： 规划 之后的环网 ID及环网容量、 工作容量。 另外还可以得到图 8所示的业务的 工作路径表， 包括业务编号、 源目节点、 工作路径。 实施例三：
如图 10所示， 本实施例提供了一种 POTN网络 ODUk环规划装置， 包 括： 拓朴获取模块、 业务信息获取模块、 寻路模块、 更新模块以及环网构 建模块； 所述拓朴获取模块配置为获取物理拓朴和环网拓朴；
所述业务信息获取模块配置为获取需要环网保护的环网业务的节点信 息；
所述寻路模块配置为根据所述环网业务的节点信息在所述环网拓朴上 寻路；
所述环网构建模块配置为当所述寻路模块在所述环网拓朴上寻路失败 时， 在所述物理拓朴和环网拓朴的集合图上寻找两条节点分离的最短路径； 以所述两条节点分离的最短路径构建该环网业务的 ODUk环；
所述更新模块配置为将构建的 ODUk环更新至所述环网拓朴中。
优选地， 如图 11所示， 所述装置还包括： 容量设置模块；
所述容量设置模块配置为根据所述业务的带宽容量设置该环网业务的
ODUk环的容量；
所述更新模块还配置为根据该 ODUk环的容量更新所述环网拓朴和所 述物理拓朴链路的容量。
优先地， 如图 12所示， 所述装置还包括： 环网容量处理模块； 所述环网容量处理模块配置为：
获取所述 ODUk环上所述环网业务的工作路径； 网；
根据经过所述波长链路的环网业务的容量更新包括所述波长链路的环 网的容量；
所述更新模块还配置为根据更新后的环网的容量更新所述环网拓朴和 所述物理拓朴链路的容量。
优先地， 如图 13， 在图 10所示的装置基础上还可以包括环网容量处理 模块； 所述环网容量处理模块配置为： 当所述寻路模块在所述环网拓朴寻路成功时， 从所述环网拓朴中获取 所述业务的工作路径；
获取该工作路径经过的波长链路以及所有包括所述波长链路的环网； 根据经过所述波长链路的环网业务的容量更新包括所述波长链路的环 网的容量；
所述更新模块还配置为根据更新后的环网的容量更新所述环网拓朴和 所述物理拓朴链路的容量。
优先地， 所述环网容量处理模块还配置为确定经过该波长链路的所有 环网业务， 获取各环网业务封装的 ODUk容器容量之和；
遍历包括该波长链路的环网， 当遍历的环网的容量小于所述 ODUk容 器容量之和所构成的高级 ODUk容器容量时， 将更新该环网的容量为所述 高级容器容量。
POTN网络 ODUk环规划装置中的模块可由 POTN网络 ODUk环规划 装置中的中央处理器（ CPU, Central Processing Unit )、数字信号处理器（ DSP, Digital Signal Processor )或现场可编程门阵列 （ FPGA， Field Programmable Gate Array ) 实现。 实施例四：
本实施例记载一种计算机存储介质， 所述计算机存储介质中存储有计 算机可执行指令， 所述计算机可执行指令用于执行图 3至图 5任一附图所 示的 POTN网络 ODUk环规划方法。
本实施例的装置可以合理的规划业务的 ODUk环以及环容量， 最大限 度减少环网构建数量， 减少波长的使用。 同时业务工作路径部分段存在多 个环网进行保护， 提高了业务的生存能力。 该算法同时适用于业务的动态 加入， 实用性强。
本领域内的技术人员应明白， 本发明实施例可提供为方法、 系统、 或 计算机程序产品。 因此， 本发明可釆用硬件实施例、 软件实施例、 或结合 软件和硬件方面的实施例的形式。 而且， 本发明可釆用在一个或多个其中 包含有计算机可用程序代码的计算机可用存储介质 (包括但不限于磁盘存 储器和光学存储器等）上实施的计算机程序产品的形式。
本发明是参照根据本发明实施例的方法、 设备（系统）、 和计算机程序 产品的流程图和 /或方框图来描述的。 应理解可由计算机程序指令实现流程 图和 /或方框图中的每一流程和 /或方框、以及流程图和 /或方框图中的流程和 /或方框的结合。 可提供这些计算机程序指令到通用计算机、 专用计算机、 嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器， 使得 通过计算机或其他可编程数据处理设备的处理器执行的指令产生配置为实 现在流程图一个流程或多个流程和 /或方框图一个方框或多个方框中指定的 功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理 设备以特定方式工作的计算机可读存储器中， 使得存储在该计算机可读存 储器中的指令产生包括指令装置的制造品， 该指令装置实现在流程图一个 流程或多个流程和 /或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备 上， 使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机 实现的处理， 从而在计算机或其他可编程设备上执行的指令提供配置为实 现在流程图一个流程或多个流程和 /或方框图一个方框或多个方框中指定的 功能的步骤。
以上所述仅是本发明的优选实施方式， 应当指出， 对于本技术领域的 普通技术人员来说， 在不脱离本发明原理的前提下， 还可以做出若干改进 和润饰， 这些改进和润饰也应视为本发明的保护范围。

Claims

权利要求书 包括：
获取物理拓朴和环网拓朴；
获取需要环网保护的环网业务的节点信息， 根据所述环网业务的节点 信息在所述环网拓朴上寻路；
当在所述环网拓朴上寻路失败时， 在所述物理拓朴和环网拓朴的集合 图上寻找两条节点分离的最短路径；
以所述两条节点分离的最短路径构建所述环网业务的 ODUk环， 将所 述 ODUk环更新至所述环网拓朴中。
2、 如权利要求 1所述的 POTN网络 ODUk环规划方法， 其中， 所述方 法还包括：根据所述业务的带宽容量设置所述环网业务的 ODUk环的容量， 并且根据所述 ODUk环的容量更新所述环网拓朴和所述物理拓朴链路的容 量。
3、 如权利要求 2所述的 POTN网络 ODUk环规划方法， 其中， 所述方 法还包括：
获取所述 ODUk环上所述环网业务的工作路径； 网；
根据经过所述波长链路的环网业务的容量更新包括所述波长链路的环 网的容量；
根据更新后的环网的容量更新所述环网拓朴和所述物理拓朴链路的容
4、 如权利要求 1所述的 POTN网络 ODUk环规划方法， 其中， 所述方 法还包括： 当在所述环网拓朴寻路成功时， 从所述环网拓朴中获取所述环网业务 的工作路径； 网；
根据经过所述波长链路的环网业务的容量更新包括所述波长链路的环 网的容量；
根据更新后的环网的容量更新所述环网拓朴和所述物理拓朴链路的容 量。
5、 如权利要求 3或 4所述的 POTN网络 ODUk环规划方法， 其中， 所 述根据经过所述波长链路的环网业务的容量更新包括所述波长链路的环网 的容量， 包括：
确定经过所述波长链路的所有环网业务，获取各环网业务封装的 ODUk 容器容量之和；
遍历包所述波长链路的环网， 当遍历的环网的容量小于所述 ODUk容 器容量之和所构成的高级 ODUk容器容量时， 更新所述环网的容量为所述 高级容器容量。
6、 一种 POTN网络 ODUk环规划装置， 包括： 拓朴获取模块、 业务信 息获取模块、 寻路模块、 更新模块以及环网构建模块；
所述拓朴获取模块配置为获取物理拓朴和环网拓朴；
所述业务信息获取模块配置为获取需要环网保护的环网业务的节点信 息；
所述寻路模块配置为根据所述环网业务的节点信息在所述环网拓朴上 寻路；
所述环网构建模块配置为当所述寻路模块在所述环网拓朴上寻路失败 时， 在所述物理拓朴和环网拓朴的集合图上寻找两条节点分离的最短路径； 以所述两条节点分离的最短路径构建所述环网业务的 ODUk环； 所述更新模块配置为将所述构建的 ODUk环更新至所述环网拓朴中。
7、如权利要求 6所述的 POTN网络 ODUk环规划装置，其中，还包括： 容量设置模块；
所述容量设置模块配置为根据所述业务的带宽容量设置所述环网业务 的 ODUk环的容量；
所述更新模块还配置为根据所述 ODUk环的容量更新所述环网拓朴和 所述物理拓朴链路的容量。
8、如权利要求 7所述的 POTN网络 ODUk环规划装置，其中，还包括： 环网容量处理模块；
所述环网容量处理模块配置为：
获取所述 ODUk环上所述环网业务的工作路径； 网；
根据经过所述波长链路的环网业务的容量更新包括所述波长链路的环 网的容量；
所述更新模块还配置为根据更新后的环网的容量更新所述环网拓朴和 所述物理拓朴链路的容量。
9、如权利要求 6所述的 POTN网络 ODUk环规划装置，其中，还包括： 环网容量处理模块； 所述环网容量处理模块配置为：
当所述寻路模块在所述环网拓朴寻路成功时， 从所述环网拓朴中获取 所述业务的工作路径； 网；
根据经过所述波长链路的环网业务的容量更新包括所述波长链路的环 网的容量；
所述更新模块还配置为根据更新后的环网的容量更新所述环网拓朴和 所述物理拓朴链路的容量。
10、 如权利要求 8或 9所述的 POTN网络 ODUk环规划装置， 其中， 所述环网容量处理模块还配置为确定经过该波长链路的所有环网业务， 获 取各环网业务封装的 ODUk容器容量之和；
遍历包括所述波长链路的环网， 当遍历的环网的容量小于所述 ODUk 容器容量之和所构成的高级 ODUk容器容量时， 更新所述环网的容量为所 述高级容器容量。
11、 一种计算机存储介质， 所述计算机存储介质中存储有计算机可执 行指令， 所述计算机可执行指令用于执行权利要求 1 至 5 任一项所述的 POTN网络 ODUk环规划方法。
PCT/CN2014/079545 2013-12-26 2014-06-09 POTN网络ODUk环规划方法及装置 Ceased WO2014187404A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP14800576.2A EP3089408B1 (en) 2013-12-26 2014-06-09 Potn network oduk ring planning method and device

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201310733623.5A CN104753780B (zh) 2013-12-26 2013-12-26 一种potn网络oduk环规划方法及装置
CN201310733623.5 2013-12-26

Publications (1)

Publication Number Publication Date
WO2014187404A1 true WO2014187404A1 (zh) 2014-11-27

Family

ID=51932951

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/079545 Ceased WO2014187404A1 (zh) 2013-12-26 2014-06-09 POTN网络ODUk环规划方法及装置

Country Status (3)

Country Link
EP (1) EP3089408B1 (zh)
CN (1) CN104753780B (zh)
WO (1) WO2014187404A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112910689A (zh) * 2021-01-18 2021-06-04 Ut斯达康通讯有限公司 一种时钟网络拓扑构建方法及系统
CN114125982A (zh) * 2021-11-10 2022-03-01 浙江大学 用于无人系统自组织网络的环定向路由算法及存储介质

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10200353B2 (en) 2013-07-25 2019-02-05 Convida Wireless, Llc End-to-end M2M service layer sessions
JP6837492B2 (ja) 2016-04-20 2021-03-03 コンヴィーダ ワイヤレス， エルエルシー 新しい無線における物理チャネル
WO2017184865A1 (en) 2016-04-20 2017-10-26 Convida Wireless, Llc Configurable reference signals
EP3455985B1 (en) 2016-05-11 2022-03-09 Convida Wireless, LLC New radio downlink control channel
JP2019518392A (ja) 2016-06-15 2019-06-27 コンヴィーダ ワイヤレス， エルエルシー 新しい無線のための許可不要アップリンク伝送
WO2017218849A1 (en) 2016-06-15 2017-12-21 Convida Wireless, Llc Network slice discovery and selection
CN109565370B (zh) * 2016-06-15 2021-06-15 康维达无线有限责任公司 用于新无线电的上传控制信令的装置
US10840982B2 (en) 2016-08-11 2020-11-17 Convidia Wireless, LLC Beamforming sweeping and training in a flexible frame structure for new radio
CN109891772B (zh) 2016-11-03 2022-10-04 康维达无线有限责任公司 Nr中的帧结构
CN107241659B (zh) * 2017-05-27 2019-06-21 烽火通信科技股份有限公司 光传送网通用映射规程的仿真系统及仿真方法
CN112753265B (zh) 2018-09-27 2025-02-11 交互数字专利控股公司 新无线电的未经许可的频谱中的子频带操作
CN109525910B (zh) * 2019-01-04 2021-06-08 国网四川省电力公司经济技术研究院 一种最小环的电力系统保护otn网络双路径规划方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1812359A (zh) * 2005-01-25 2006-08-02 华为技术有限公司 一种环网保护控制方法
CN101686419A (zh) * 2008-09-28 2010-03-31 华为技术有限公司 通知重路由的方法、节点设备及环网络
CN101998178A (zh) * 2009-08-12 2011-03-30 中兴通讯股份有限公司 光数据单元环路共享保护控制方法与装置
CN102255739A (zh) * 2010-05-17 2011-11-23 华为技术有限公司 一种路径分组方法、装置和系统
US20130142509A1 (en) * 2011-12-02 2013-06-06 Ciena Corporation Optical transport network line management system and methods

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8248913B1 (en) * 2005-06-23 2012-08-21 Verizon Services Corp. System and method to support full-time protection services in a network

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1812359A (zh) * 2005-01-25 2006-08-02 华为技术有限公司 一种环网保护控制方法
CN101686419A (zh) * 2008-09-28 2010-03-31 华为技术有限公司 通知重路由的方法、节点设备及环网络
CN101998178A (zh) * 2009-08-12 2011-03-30 中兴通讯股份有限公司 光数据单元环路共享保护控制方法与装置
CN102255739A (zh) * 2010-05-17 2011-11-23 华为技术有限公司 一种路径分组方法、装置和系统
US20130142509A1 (en) * 2011-12-02 2013-06-06 Ciena Corporation Optical transport network line management system and methods

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3089408A4 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112910689A (zh) * 2021-01-18 2021-06-04 Ut斯达康通讯有限公司 一种时钟网络拓扑构建方法及系统
CN112910689B (zh) * 2021-01-18 2022-05-17 Ut斯达康通讯有限公司 一种时钟网络拓扑构建方法及系统
CN114125982A (zh) * 2021-11-10 2022-03-01 浙江大学 用于无人系统自组织网络的环定向路由算法及存储介质
CN114125982B (zh) * 2021-11-10 2023-12-01 浙江大学 用于无人系统自组织网络的环定向路由方法及存储介质

Also Published As

Publication number Publication date
EP3089408B1 (en) 2019-04-24
CN104753780B (zh) 2020-05-22
EP3089408A1 (en) 2016-11-02
EP3089408A4 (en) 2016-12-21
CN104753780A (zh) 2015-07-01

Similar Documents

Publication Publication Date Title
WO2014187404A1 (zh) POTN网络ODUk环规划方法及装置
ES2654817T3 (es) Método, dispositivo y sistema para el ajuste de ancho de banda sin interrupciones
US10153948B2 (en) Systems and methods for combined software defined networking and distributed network control
US20230134574A1 (en) Routing and Regenerator Planning in a Carrier's Core Reconfigurable Optical Network
CN104704759B (zh) 基于波分复用(wdm)的光网络的传送功能虚拟化
US9628172B2 (en) Optimization of photonic services with colorless and directionless architecture
EP2951964B1 (en) An enhanced path selection scheme for equal cost paths in communication networks
CN101361306A (zh) 光网络中最优化动态选路
EP2489143A1 (en) Method for encoding routing and wavelength assignment information for wavelength switched optical networks
WO2014180448A1 (zh) 一种对ptn网络业务进行保护的方法及装置
EP3038302B1 (en) Grooming method and device for packet optical transport network
US8503880B2 (en) Optical transport network decoupling using optical data unit and optical channel link aggregation groups (LAGS)
CN104579965A (zh) 支持多种约束策略的光-电两层路径计算方法及系统
US20130084075A1 (en) Super-channel assignment using a flexible grid
US20230291678A1 (en) Method and system for load-balanced traffic grooming in ip over quasi-cwdm network
WO2011020392A1 (zh) 信息传输方法、通信装置及通信系统
CN101645796A (zh) 一种自动交换光网络保护的分布式配置方法
ES2661521T3 (es) Procedimiento, aparato y sistema de establecimiento de canal de control
CN116094981A (zh) 一种跨层业务的创建方法及相应的装置
JP5898284B1 (ja) 通信ネットワーク設計装置及び通信ネットワーク設計方法
EP2860907A1 (en) Planning of optical connections in a WDM optical network
Rouskas et al. Hierarchical Traffic Grooming

Legal Events

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

Ref document number: 14800576

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2014800576

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 2014800576

Country of ref document: EP