KR101660967B1 - Apparatus and method for generating path in transtort network - Google Patents

Apparatus and method for generating path in transtort network Download PDF

Info

Publication number
KR101660967B1
KR101660967B1 KR1020150093701A KR20150093701A KR101660967B1 KR 101660967 B1 KR101660967 B1 KR 101660967B1 KR 1020150093701 A KR1020150093701 A KR 1020150093701A KR 20150093701 A KR20150093701 A KR 20150093701A KR 101660967 B1 KR101660967 B1 KR 101660967B1
Authority
KR
South Korea
Prior art keywords
path
station
designing
line
search condition
Prior art date
Application number
KR1020150093701A
Other languages
Korean (ko)
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 KR1020150093701A priority Critical patent/KR101660967B1/en
Application granted granted Critical
Publication of KR101660967B1 publication Critical patent/KR101660967B1/en

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/44—Star or tree networks

Landscapes

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

Abstract

A transmission network path generation apparatus according to an embodiment of the present invention includes a topology generation unit for generating topology information including a logical line and physical line information of a transmission network, a logical line search condition for designing a route of the transmission network, And a logical circuit search condition receiving unit for receiving the logical circuit search condition from the first local station and the second local station based on the topology information and the logical circuit search condition, And a path designing unit for designing a path for the optical fiber.

Description

[0001] APPARATUS AND METHOD FOR GENERATING PATH IN TRANSTORT NETWORK [0002]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an apparatus and a method for generating a path of a transmission network, and more particularly, to an apparatus and a method for generating a path of a transmission network logical line in consideration of optimum use of bandwidth and operational efficiency.

Conventional transmission networks are conventional circuit based networks. Recently, packet-based transmission devices and integrated devices such as PTN (Packet Transport Network) and POTN (Packet-Optic Transport Network) multi-layer, multi-domain, and multi-vendor devices.

In this complex transmission network, the design of a passive line for constructing an end-to-end line has been limited, and a technique for automatically configuring an end-to-end line has become important. For this purpose, SDN (Sotfware Defined Networking) controller technology of the transmission network has been introduced, and many network providers are interested in SDN commercialization that can form multi-vendor, multi-domain, multi-layer circuit configuration.

An optimal end-to-end path in a transport network does not mean simply finding the shortest path in a multi-vendor, multi-domain, multi-layer network. The optimal path in the transport network should include the part that designes the logic circuit to improve the efficiency of operation while considering the efficiency so as not to waste bandwidth.

A logical line is a high-speed logical line that is truncated to facilitate management before creating a leased line for a low-speed customer. A low-speed dedicated line can be placed on a logical line and used as a fault or performance management unit.

For example, when a device such as a Multi-Service Provisioning Platform (MSPP) carries an E1 (about 2M) line, a logical line for accommodating 63 E1 lines is made in units of 155M, and an E1 line Can be loaded.

The logical circuit may be designed in one hop unit or in multi-hop unit. For example, a 155M capacity multi-hop logical circuit connecting A system, B system, and C system can be designed.

Korean Unexamined Patent Publication No. 2010-0071741 discloses a device for automatically searching a route based on device information collected from a transmission network device to find a line between a start local terminal and a local terminal and finding a specific number of lines and recommending an optimal line . In Korean Patent Publication No. 2010-0071741, after searching five paths connected with the shortest distance with spare resources, one path is selected by calculating the weight among the five paths, and the automatic generation of the logical line is not considered It is possible to find a wrong path such as a ring in a topology in which a logical circuit and a physical circuit are mixed.

SUMMARY OF THE INVENTION It is an object of the present invention to provide an apparatus and method for generating a transmission network path for generating a transmission network route considering both optimal use of bandwidth and operational efficiency.

A transmission network path generation apparatus according to an embodiment of the present invention includes a topology generation unit for generating topology information including a logical line and physical line information of a transmission network, a logical line search condition for designing a route of the transmission network, And a logical circuit search condition receiving unit for receiving the logical circuit search condition from the first local station and the second local station based on the topology information and the logical circuit search condition, And a path designing unit for designing a path for the optical fiber.

Here, the path designing unit can design a route that provides the shortest hop count based on the service capacity of the line and whether or not a ring of the route is generated.

If a plurality of paths are designed to be the shortest hop count, the path designing unit may designate a route to be used for the shortest hopping to any one or more of the number of domains passed through the route, the number of physical hops passed through the route, It is possible to select one of the plurality of routes based on the route.

When the first local station is located in a first domain and the second local station is located in a second domain, the path designing unit selects a first path in the first domain and a second path in the second domain, And design the path for the first station and the second station by connecting the first path and the second path.

The path designing unit may generate a logical circuit based on the logical circuit search condition and design a path to the first local station and the second local station using the generated logical circuit.

A method for generating a transmission network path according to an embodiment of the present invention includes the steps of generating topology information including the logical circuit and physical circuit information by a device for generating a path of a transmission network including a logical circuit, Receiving a logical circuit search condition for a first local station and a second local station located in the transmission network, receiving a logical circuit search condition for a first local station and a second local station located in the transmission network, And designing a path to the second location.

The designing of the path may include selecting the first station as a root of a route tree, searching a line based on the logical line search condition, connecting the searched line to the route And adding the path tree to a leaf of the path tree to expand the path tree, checking whether the second station is connected to the leaf, and if the second station is not connected to the leaf, And expanding the path tree until the second station is connected to the leaf of the path tree.

In addition, the step of extending the path tree may add a line to the leaf of the path tree based on the service capacity of the line and whether a ring of the path is generated or not.

If the second location is connected to the leaf, the path may be added as a candidate path if the path of the extended path tree is the shortest hop number.

In addition, when there are a plurality of candidate paths, one of the plurality of candidate paths is selected based on at least any one of the number of domains via the path, the number of physical hops through the path, the weight per predetermined path, And selecting one of the plurality of paths.

The method may further include expanding the path tree when the number of hops of the path tree is greater than the number of hops of the candidate path.

The step of designing the path further comprises: checking whether the first station and the second station are located in the same domain; if the first station and the second station are located in different domains, Designing a first path in a first domain in which a local is located, designing a second path in a second domain in which the second local is located, and connecting the first path and the second path can do.

The method may further include a step of generating a logical circuit based on the logical line search condition.

According to one embodiment of the present invention, it is possible to automatically generate a route of the transmission network considering the optimum use of bandwidth and operational convenience, thereby minimizing the line configuration task, and in the topology in which the logical line and the physical line are mixed, The path can be found.

FIG. 1 is a block diagram of an entire system including a transmission network path generation apparatus 100 according to an embodiment of the present invention.
2 shows an example of a transmission network in which a physical line and a logical line exist.
3 is a block diagram of a network path generation apparatus 100 according to an embodiment of the present invention.
4 shows an example of a transmission network in which a physical line and a logical line exist.
5 is a flowchart of a method of generating a transmission network path according to an embodiment of the present invention.
FIG. 6 is a flowchart of a method of generating a path tree among transmission network path generation methods according to an embodiment of the present invention.
FIG. 7 is an illustration of a path tree for the optimal path design of FIG.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art can easily carry out the present invention. The present invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. In order to clearly illustrate the present invention, parts not related to the description are omitted, and similar parts are denoted by like reference characters throughout the specification.

Throughout the specification, when a part is referred to as being "connected" to another part, it includes not only "directly connected" but also "electrically connected" with another part in between .

Throughout the specification, when an element is referred to as "comprising ", it means that it can include other elements as well, without excluding other elements unless specifically stated otherwise.

FIG. 1 is a configuration diagram of an entire system including a transmission network path generation apparatus 100 according to an embodiment of the present invention, and FIG. 2 is an illustration of a transmission network in which a physical line and a logical line exist.

The transmission network of FIG. 1 is a multi-domain, which is composed of domain 1, domain 2, and domain 3, and each domain includes a plurality of network equipment. Although the transmission network of FIG. 1 is shown as being composed of three domains, the present invention is not limited thereto and can be applied to all transmission networks composed of a single domain and a multi-domain.

When the transmission network equipment management server 200 updates the database 300 with the failure and shape information of the network equipment, the transmission network path creation apparatus 100 according to one embodiment of the present invention locates the location The path between the two locations is designed. In this case, the network-path generating apparatus 100 may receive information necessary for designing a path from a user or an application.

For example, the transmission network path generation apparatus 100 can design a path between the A station and the Z station located in the transmission network as shown in FIG. Each of the diagrams in FIG. 2 may correspond to a respective domain, and each city includes a plurality of nodes that transmit packets using network equipment.

2 includes four logical lines, and the logical circuit 1 is a virtual circuit connecting node # 3 of city 1 and node # 1 of city 3 to node # 3 of city 1 and node # 4 of city 2 And the physical line connecting the node # 4 of the city 2 and the node # 1 of the city 3 are distinguished from each other. In the case of transmitting a packet from node # 3 of city 1 to node # 1 of city 3, the route using logical line 1 has one hop count, while the route using two physical lines has two hop counts. In this case, the number of hops in the physical path is two even in the path using the logical circuit 1.

The transmission network path generating apparatus 100 can design an optimal path between the A station and the Z station using the logical circuit and the physical circuit connecting the nodes of FIG. A path passing through logic 1, a path passing between logic 2 and 3, and a path passing between logic 4 can be considered. The path passing through the logic circuit 1 is a physical circuit connecting the node # 1 of the city 1 to the node # 3 of the city 1, the logical circuit 1, and a physical circuit connecting the node # 4 of the city 3 to the node # . In this case, the number of hops in the path is 3, and the number of hops is 3 in the path passing through the logical line 4, and the number of hops is 4 in the path passing between the logical line 2 and the logical line 3.

The network path generating apparatus 100 can select a path passing through the logic circuit 1 having the shortest hop count and a path passing through the logic circuit 4 as the candidate path. In this case, the network-path generating apparatus 100 can design a path that passes through the logical circuit 1 having the smaller number of hops of the physical path among the two candidate paths as an optimal path.

Hereinafter, a description will be made in detail of a transmission network path generation apparatus 100 according to an embodiment of the present invention with reference to FIG. 3 to FIG.

3 is a block diagram of a transmission network path generation apparatus 100 according to an embodiment of the present invention, FIG. 4 is an illustration of a transmission network in which a physical line and a logical line exist, and FIG. 5 is a diagram illustrating an example And FIG. FIG. 6 is a flow chart of a method of generating a path tree among transmission network path generation methods according to an embodiment of the present invention, and FIG. 7 is an example of a path tree for the optimal path design of FIG.

The network path generation apparatus 100 according to an embodiment of the present invention includes a topology generation unit 110, a logical circuit search condition reception unit 120, and a path design unit 130. The topology generation unit 110 generates a topology based on the information about the network equipment stored in the database 300 when the network equipment management server 200 updates the database 300 with the failure and shape information transmitted from the network equipment. And generates topology information including logical circuits and physical circuit information. In this case, the topology information may also include the service capacity information of the logical line and the physical line.

For example, as shown in FIG. 4, the topology generation unit 110 may generate topology information including logical circuit information and physical circuit information.

The logical circuit search condition receiving unit 120 receives the logical circuit search condition for route design from the user or the application 400. [ The logical circuit search condition is a criterion for selecting a logical circuit including a path when the path designing unit 130 designates a path.

For example, in the case of designing a path including a circuit having a specific capacity or more, there may be a logic circuit search condition for selecting a logical circuit of a large unit, and a plurality of circuits sharing the same starting and ending stations are designed simultaneously There may be a logical line search condition for selecting a logical line of a specific unit irrespective of the capacity.

In addition, if the Ethernet service is set to 30M or more and the circuit is configured using the Multiple Service Provisioning Platform (MSPP) system, if it is determined to configure the end-to-end 45M VC3, only the physical line excluding the logical line There may be a logical line search condition to select.

When the path designing unit 130 receives information for designing a path of a transmission network from a user or an application 400, the path designing unit 130 generates an optimal path of the transmission network. The information for the path design of the transmission network may include starting and ending local information, ports, bandwidth information, and the like located in the transmission network.

When the path designing unit 130 receives a path design request from the user or the application 400 for the starting and ending stations located in the transmission network, the path designing unit 130 extracts the port- 120 designate paths for the start point and the end point on the basis of the logical circuit search condition received by the terminal.

Hereinafter, an optimal path design method of the path designing unit 130 will be described with reference to FIG.

First, the path designing unit 130 receives information for route design from the user or the application 400 (S101), and the logical circuit search condition receiving unit 120 receives the logical circuit search condition (S102). If the starting and ending stations are located in the same domain (S103), the path designing unit 130 designates a path in the corresponding domain (S104). If the starting and ending stations are located in different domains, the path designing unit 130 designates a path for each of the domains (S105), and connects the paths designed for the respective domains (S106). If there is only one generated path, the generated path is the optimal path between the starting and ending stations.

If the number of generated candidate paths is two or more (S107), the path designing unit 130 selects a path having a high priority as an optimal path (S108). The priority may include the number of domains to which the path passes, the number of physical hops through the path, a predetermined path weight, and the utilization rate of the logical line.

Also, unlike FIG. 5, the path designing unit 130 can design an optimal path based on a logical line search condition without distinguishing domains where start and end stations are located. Also in this case, when there are two or more generated candidate paths, the path designing unit 130 selects a path having a high priority as an optimum path.

In addition to designing the route based on the logical line search condition, the route designing unit 130 can design a route that has the shortest hop count based on the service capacity of the line and whether a ring of the route is generated or not.

Therefore, the transmission network path generation apparatus 100 according to one embodiment of the present invention can improve the operational convenience of the transmission network by designing the route using the logical line. Also, the transmission network path generation apparatus 100 can design a path considering the bandwidth efficiency, and can find a route in which the ring does not occur.

Hereinafter, a method of generating a path tree for an optimal path design of the path designing unit 130 will be described with reference to FIGS. 6 and 7. FIG.

First, the path designing unit 130 selects the starting point as the root of the path tree (S111). Then, the path designing unit 130 searches the logical line and the physical line based on the logical line search condition (S112). In this case, the path designing unit 130 checks the service capacity of the searched line and whether or not a ring of the route is generated (S113, S114). If the service capacity of the line is not sufficient or a ring is generated on the route It may not add the line to the leaf of the path tree. The path designing unit 130 may extend the path tree by adding the line to the leaf only when the service capacity of the line is sufficient and the ring is generated on the path by adding the corresponding line (S115).

If a line satisfying the above condition is added to the leaf and an end station is connected to the leaf (S116), and if the end station is connected to the leaf, the path designing unit 130 determines whether the route is the shortest route (S117). The path designing unit 130 may add the candidate path only if it is the shortest path number (S118), and not add it to the candidate path if it is not the shortest path number path (S119).

In addition, if the hop count of the candidate path added is shorter than the existing candidate path, the path designing unit 130 can replace the candidate path with a path having a smaller hop count. The path designing unit 130 may select an optimal path according to the priority among the paths selected as the candidate paths. If there is one candidate path, the path designing unit 130 can select the candidate path as an optimal path.

When an end station is not connected to the leaf, the path designing unit 130 extends the path tree by connecting the line until the end station is connected to the leaf of the path tree. The path designing unit 130 may not expand the path tree any more when the number of hops is larger than the number of hopes of the candidate path when the path tree is expanded.

The path designing unit 130 may generate a path tree as shown in FIG. 7 using the path tree generating method of FIG.

For example, the path designing unit 130 may apply the path tree generation method of FIG. 6 to design an optimal path from A to Z in FIG. p1 is a candidate path of the shortest hop number passing through the logical circuit 2, and p2 is a candidate path of the shortest hop number passing through the logical circuit 1. And, p3 is a candidate path of the shortest hop number passing only the physical circuit. The candidate paths of p1, p2, and p3 all have three hop counts. The path designing unit 130 can extract three candidate paths as shown in FIG. 7 by the path tree generation method, and select a path having a higher priority among the candidate paths as the optimum path. For example, the path designing unit 130 may select p3 as an optimal path considering the number of physical hops.

In addition, the path designing unit 130 not only can design the path using the existing logic circuit, but also generates the logic circuit based on the logic circuit search condition and designates the path using the generated logic circuit can do.

As described above, the network transmission path generation apparatus 100 according to an embodiment of the present invention can automatically design the optimal path according to the path tree generation method, thereby minimizing the line configuration task.

The embodiments of the present invention described above are not implemented only by the apparatus and method, but may be implemented through a program for realizing the function corresponding to the configuration of the embodiment of the present invention or a recording medium on which the program is recorded.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments, It belongs to the scope of right.

100: Transmission network path generation unit 110: Topology generation unit
120: Logical circuit search condition receiving unit 130: Path designing unit
200: Transmission Network Management Server 300: Database
400: user or application

Claims (13)

A topology generation unit for generating topology information including a logical circuit of the transmission network and physical circuit information,
A logical circuit search condition receiving unit for receiving a logical circuit search condition for route design of the transport network,
And a path designing unit for designating paths for the first station and the second station based on the topology information and the logical circuit search condition when requesting a route design for a first station and a second station located in the transmission network,
/ RTI >
Wherein the path designing unit generates a logic circuit based on the logic circuit search condition and designs a path to the first station and the second station using the generated logic circuit. The method of claim 1,
Wherein the path designing unit designes a path that is a shortest hop count based on a service capacity of a line and whether or not a ring of the path is generated. 3. The method of claim 2,
In a case where a plurality of paths with the shortest hop count are designed, the path designing unit calculates the number of shortest hop counts based on at least any one of the number of domains passed through the path, the number of physical hops passed through the path, And selecting one of the plurality of routes. The method of claim 1,
When the first station is located in a first domain and the second station is located in a second domain, the path designing unit designes a first path in the first domain and a second path in the second domain And designing a path for the first station and the second station by connecting the first path and the second path. delete An apparatus for generating a path of a transmission network including a logical circuit,
Generating topology information including the logical circuit and physical circuit information,
Receiving a logical circuit search condition for route design of the transmission network,
Receiving a path design for a first station and a second station located in the transmission network, and
Generating a logic circuit based on the topology information and the logic circuit search condition, and designing a path to the first station and the second station using the generated logic circuit
Gt; a < / RTI > The method of claim 6,
The step of designing the path includes:
Selecting the first station as a root of a path tree,
Searching for a line based on the logical line search condition,
Expanding the path tree by connecting the searched line with the root and adding it as a leaf of the path tree,
Confirming that the second location is connected to the leaf, and
And expanding the path tree until the second station is connected to the leaf of the path tree when the second station is not connected to the leaf. 8. The method of claim 7,
Wherein the step of extending the path tree includes adding a line to a leaf of the path tree based on a service capacity of the line and whether or not a ring of the path is generated. 8. The method of claim 7,
And adding the second path as a candidate path when the second path is connected to the leaf, if the path of the extended path tree is the shortest path number. The method of claim 9,
When one of the plurality of candidate paths is a plurality of candidate paths based on at least any one of the number of domains through which the path passes, the number of physical hops passed through the path, the predetermined path weight, The method comprising the steps of: The method of claim 9,
Further comprising expanding the path tree when the number of hops of the path tree is greater than the number of hops of the candidate path. The method of claim 6,
The step of designing the path includes:
Confirming whether the first station and the second station are located in the same domain,
Designing a first path in a first domain in which the first station is located if the first station and the second station are located in different domains and designating a second path in a second domain in which the second station is located Designing steps, and
And connecting the first path and the second path. delete
KR1020150093701A 2015-06-30 2015-06-30 Apparatus and method for generating path in transtort network KR101660967B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020150093701A KR101660967B1 (en) 2015-06-30 2015-06-30 Apparatus and method for generating path in transtort network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020150093701A KR101660967B1 (en) 2015-06-30 2015-06-30 Apparatus and method for generating path in transtort network

Publications (1)

Publication Number Publication Date
KR101660967B1 true KR101660967B1 (en) 2016-09-28

Family

ID=57101279

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020150093701A KR101660967B1 (en) 2015-06-30 2015-06-30 Apparatus and method for generating path in transtort network

Country Status (1)

Country Link
KR (1) KR101660967B1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101855742B1 (en) * 2016-10-12 2018-05-10 아토리서치(주) Method and apparatus for destination based packet forwarding control in software defined networking
CN109088748A (en) * 2018-07-16 2018-12-25 烽火通信科技股份有限公司 Minimize POTN equipment Ethernet service general network administration configuration method and system

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR19990011808A (en) * 1997-07-25 1999-02-18 윤종용 How to Navigate Routing Paths for Connection Paths
WO2012141241A1 (en) * 2011-04-13 2012-10-18 日本電気株式会社 Network, data transfer node, communication method, and program

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR19990011808A (en) * 1997-07-25 1999-02-18 윤종용 How to Navigate Routing Paths for Connection Paths
WO2012141241A1 (en) * 2011-04-13 2012-10-18 日本電気株式会社 Network, data transfer node, communication method, and program

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR101855742B1 (en) * 2016-10-12 2018-05-10 아토리서치(주) Method and apparatus for destination based packet forwarding control in software defined networking
CN109088748A (en) * 2018-07-16 2018-12-25 烽火通信科技股份有限公司 Minimize POTN equipment Ethernet service general network administration configuration method and system
CN109088748B (en) * 2018-07-16 2021-08-03 烽火通信科技股份有限公司 Universal network management configuration method and system for Ethernet service of miniaturized POTN (packet optical transport network) equipment

Similar Documents

Publication Publication Date Title
CN100377529C (en) Route designing method
US7099286B1 (en) Method and system for finding shared risk diverse paths
EP2737671B1 (en) Method and apparatus for resilient routing of control traffic in a split-architecture system
CN107925613A (en) It is used for the methods, devices and systems to E-Packet in business function chain SFC
JP6117911B2 (en) Optimization of 3-stage folded CLOS for 802.1AQ
EP2254284B1 (en) Method and device for route installation and distribution
CN111698152B (en) Fault protection method, node and storage medium
CN108259341B (en) Prefix label distribution method and SDN controller
KR20100112144A (en) Tie-breaking in shortest path determination
CN102055665B (en) OSPF point-to-multipoint over broadcast or NBMA mode
US20050152333A1 (en) Method and apparatus for controlling the dissemination of routing information on a communication network
JP6589060B2 (en) Software-defined network entry generation and packet forwarding
CN105052090A (en) Seamless segment routing
KR101457317B1 (en) Prioritization of routing information updates
CN108650177A (en) The method and system of cross-domain service configuration are carried out to SPTN equipment
CN103023773A (en) Method, device and system for forwarding message in multi-topology network
EP3295623B1 (en) Transport software defined networking (sdn) zero configuration adjacency via packet snooping
KR101660967B1 (en) Apparatus and method for generating path in transtort network
US6973028B1 (en) SONET ring map generation method and system
CN101453412A (en) Method and apparatus for automatic topology discovery and resource management in PBB network
CN111416806B (en) IP address tracing method and device for anonymous attack traffic of backbone network
CN104412548B (en) The method and apparatus for keeping user equipment (UE) IP address to fix
CN105530109A (en) Method, router and system for realizing network element plugging and management
US9007892B2 (en) Apparatus and method to find partially disjoint routes for dual fiber-cuts
CN102857424B (en) Method and equipment for establishing LSP (label switched path) in MPLS (multi-protocol label switching) network

Legal Events

Date Code Title Description
GRNT Written decision to grant
FPAY Annual fee payment

Payment date: 20190807

Year of fee payment: 4