WO2016000365A1 - Method and apparatus for path computation - Google Patents

Method and apparatus for path computation

Info

Publication number
WO2016000365A1
WO2016000365A1 PCT/CN2014/089795 CN2014089795W WO2016000365A1 WO 2016000365 A1 WO2016000365 A1 WO 2016000365A1 CN 2014089795 W CN2014089795 W CN 2014089795W WO 2016000365 A1 WO2016000365 A1 WO 2016000365A1
Authority
WO
Grant status
Application
Patent type
Prior art keywords
path
request
module
topology
cache
Prior art date
Application number
PCT/CN2014/089795
Other languages
French (fr)
Chinese (zh)
Inventor
张朝伟
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date

Links

Images

Abstract

A method and apparatus for path computation, the method comprising: obtaining a current load value of a CPU (Central Processing Unit); generating a path computation request when the current load value is smaller than a preset value; obtaining a computation request for nodes with no path; performing path computation according to the path computation request and the computation request, to obtain a first path; using the first path as a cache path for caching; receiving a preset request, followed by generating a path request; querying the cache path according to the path request; and if there is in the cache path a second path matched with the path request, sending the second path.

Description

A method and apparatus for calculating path FIELD

The present invention relates to WSON (Wavelength Switched Optical Network, wavelength-switched optical network), PCE (Path Computation Element, PCE), SDN (Software Defined Network, the software defined network) communications and a router, and more particularly, to a path computation method and apparatus.

Background technique

In WSON, PCE, SDN, and re-routing of the router (Reroute), the path computation (Path Calculate) generally occupy path computation time of 100ms, and the algorithm will increase as the topology, the computation time increases rapidly, this will greatly reduce the recovery efficiency, and telecommunications networks generally have a successful recovery of 50ms performance requirements (see "intelligent optical networks: architecture, protocols and standards" - "Optical.Network.Control.Architecture.Protocols.And.Standards" 4.1.1 section damage assessment on business interruption time), so the longer the path calculation will lead to longer recovery, thus resulting in service interruption for a long time, the loss of large customers. Therefore necessary to reduce the occupied path calculation time, thereby reducing the duration of service interruption.

SUMMARY

To provide a method and apparatus of the embodiment of the present invention calculates the path, the path computation to solve the prior art is low efficiency, longer a problem.

To solve the above problems, embodiments provide a path calculating method of the present invention, comprising:

Get the current value of the CPU load;

When the load current value is less than the preset value, generates a path computation request;

No acquired path calculation requesting node;

The path calculation request and the calculation of the path computation request, to obtain a first path;

The first path as a route cache for caching;

Generates a default route request receiving the request;

The path of the request for the cached query path;

If there is a second path and the path request in the cache matching path, the second path is sent.

Alternatively, the method described above, when the load current value is less than the predetermined value, the step of generating a path computation request is specifically:

When the load current value is less than the preset value, generating a notification calculation;

Computation request according to the calculated notification generation path.

Optionally, the method further comprising:

If there is a second path and the path that matches the request, the path computation request is generated;

The path calculation request to the path, to obtain a third path;

Sending the third path.

Optionally, the method further comprising:

The third path as a path of the cache buffer.

Optionally, the method further comprising:

After receiving an update notification to obtain the current topology information and topological historical information saved;

Comparing the current topology information from the topology historical information are the same;

When the topology of the current topology information is inconsistent with the history information, the history information of the topology to the topology of the current replacement information;

The cache tag available paths according to the current topology information modification.

Embodiments of the invention also provides a device for computation of a path, comprising:

A first acquiring module, which is set to the current value obtaining the CPU load;

A first generation module is set to a value less than a preset value in the load current, generates a path computation request;

A second acquiring module, configured to capture computing node No route request;

A first calculation module configured to calculate a request based on the calculated path and the path computation request, to obtain a first path;

A first cache module, which is provided to the first path as a route cache for caching;

A second generation module generates the path setting request is received after a predetermined request;

Query module according to the path set request to query the cache path;

A first sending module, which is set in the cache, if present, the second path and the path matching the request path, the second transmission path.

Alternatively, the above-described apparatus, the first generating module comprising:

A first generating unit, which is set when the load current value is less than the preset value, generating a notification calculation;

A second generating unit configured to calculate based on the calculated notification request generation path.

Optionally, the apparatus further comprising:

Third generation module, if there is provided a second path from the path matches the request, the path computation request is generated;

A second calculation module is provided to calculate a route according to the path calculation request, to obtain a third path;

A second sending module, which is configured to transmit the third path.

Optionally, the apparatus further comprising:

A second cache module, which is provided to the cache as said third path cache path.

Optionally, the apparatus further comprising:

The third acquisition module, after it is set to receive the update notification to obtain the current topology information and topological historical information saved;

A comparison module arranged to compare the information with the topology of the current topology is consistent history information;

Replacement module, which is set when the topology of the current topology information is inconsistent with the history information, the history information of the topology to the topology of the current replacement information;

Modification module, which is arranged according to the topology information currently available to modify the cache tag path.

Embodiments of the invention further provides a computer program comprising program instructions, the program instructions when executed by a computer, causes the computer to execute the above method.

Embodiments of the invention also provides a readable storage medium carrying the computer program of the computer.

In the above embodiment, the method of calculating the path by using CPU idle time and cached route calculation, route inquiry direct to obtaining the required quick path from the cache when there is demand, greatly reducing the time occupied by the path computation and improve the path computation efficiency, reducing business downtime, improve business recovery efficiency, reduce customer losses.

Brief Description

Figure 1 is a path calculation method step a schematic example of embodiment of the invention;

FIG 2 is a schematic structural calculation apparatus according to the path of the embodiment of the invention;

FIG path calculation device 3 according to a schematic configuration of the embodiment of the invention.

Preferred embodiment of the present invention.

Following with reference to the specific embodiments of the present invention will be described in detail, in the case of no conflict, embodiments and features of the present invention in the embodiment may be arbitrarily combined with each other.

The present invention is inefficient calculation, the longer path problems in the related art, there is provided a method of computation of a path, shown in Figure 1, comprising:

Step 11: Obtain the current CPU load value;

Step 12: when the load current value is less than the preset value, generates a path computation request;

Step 13: Calculation of the requesting node acquiring No path;

Step 14: according to the path computation request and the path computation request is calculated, to obtain a first path;

Step 15: the first path as a cache buffer path;

Step 16: After receiving a predetermined request generated route request;

Step 17: according to the path request for the cached query path;

Step 18: If there is a second path and the path request in the cache matching path, the second path is sent.

The method of calculating the path according to an embodiment of the present invention is calculated by using the CPU idle time and route cache, fast path query directly to obtaining the required path from the cache when there is demand, greatly reducing the time occupied by the path computation improved route calculation efficiency, reducing business downtime, improve business recovery efficiency, reduce customer losses.

Wherein the step of load current when the value is less than the preset value, generates a path computation request specifically includes: when the load current value is less than the preset value, generating a notification calculation; computation request notification generated based on the calculated path.

Optionally, the method provided in the embodiment of the present invention further comprises: if there is a second path and the path matching the request, generates a path computation request; according to the path calculation request for path computation, to give a third path; the third transmission path.

In order to facilitate the calculation of the third path comprising the next query, without re-calculation, the method provided in the embodiment of the present invention further comprises: a third path as the path of the buffer cache.

Considering the actual application, in order to facilitate the update cache location, embodiments of the present invention is provided in the method further comprising: obtaining the current topology information and the saved history information update notification upon receiving the topology; comparing the information with the topology of the current whether the topology consistent history information; when the topology of the current history information with the topology information inconsistency, then the history information of the topology to the topology of the current replacement information; modifying the current information available in the cache according to the path topology mark.

Embodiments of the invention by a method of cache path, the path computation time is reduced, particularly large effect is more obvious in the topology, the topology larger path calculation significantly more efficiency gains; more rerouting number, the higher the cache utilization; and present invention effective use of idle CPU resources in the apparatus, improved resource utilization, and the longer the operating time, the more significant efficiency gains. Compared with the prior art, the present invention effectively improve the efficiency of path computation, rerouting reduced time to achieve the purpose of reducing the service interruption time, thereby reducing the customer network interruption losses, improve the network service.

To solve the above technical problem, embodiments of the present invention further provides an apparatus for computation of a path, shown in Figure 2, comprising:

A first acquiring module, which is set to the current value obtaining the CPU load;

A first generation module is set to a value less than a preset value in the load current, generates a path computation request;

A second acquiring module, configured to capture computing node No route request;

A first calculation module configured to calculate a request based on the calculated path and the path computation request, to obtain a first path;

A first cache module, which is provided to the cache as cache path the first path.

A second generation module generates the path setting request is received after a predetermined request;

Query module according to the path set request to query the cache path;

A first sending module, which is set in the cache, if present, the second path and the path matching the request path, the second transmission path.

The path calculating apparatus according to an embodiment of the present invention is calculated by using the CPU idle time and route cache, fast path query directly to obtaining the required path from the cache when there is demand, greatly reducing the time occupied by the path computation improved route calculation efficiency, reducing business downtime, improve business recovery efficiency, reduce customer losses.

Wherein the first generating module comprises: a first generating unit, which is set when the load current value is less than the preset value, generating a notification calculation; a second generating unit configured to generate notification calculated based on the calculated path request.

Optionally, the apparatus according to an embodiment of the present invention further comprises: generating a third module, if there is provided a second path from the path matches the request, the path computation request is generated; a second calculation module arranged to calculate the path according to the path calculation request, to obtain a third path; a second sending module, which is provided to the third transmission path.

In order to facilitate the calculation of the third path comprising the next query, without re-calculation, the means provided in the embodiment of the present invention further comprises: a second cache module, which is provided to the third path, as the cache path for caching.

It means taking into account the actual application, in order to facilitate route update the cache, according to an embodiment of the present invention further comprises: a third acquisition module, obtaining topology information and the topology of the current history information saved after it arranged to receive an update notification; Comparative module, arranged to compare the information with the topology of the current topology is consistent history information; replacement module, which is set when the topology of the current history information with the topology information inconsistency, it is replaced the history information of topology the topology of the current information; modifying module, configured to modify the current information available in the cache tag in accordance with the route topology.

Embodiments of the present invention by way of the buffer path, the path computation time is reduced, particularly large effect is more obvious in the topology, the topology larger path calculation significantly more efficiency gains; more rerouting number, the higher the cache utilization; and present Inventive Example idle CPU resources effectively utilized in the apparatus, improved resource utilization, and the longer the operating time, the more significant efficiency gains. Compared with the related art, embodiments of the present invention effectively improve the efficiency of path computation, rerouting reduced time to achieve the purpose of reducing the service interruption time, thereby reducing the customer network interruption losses, improve the network service.

Means for calculating a path according to an embodiment of the present invention, the second generation module, a query module, a first transmitting module, a third transmitting module, and a second generation module may be integrated path selector; calculating a first module and the second computing module may be integrated in the path calculator; third acquisition module may be integrated in the topology database; second acquiring module, a first module cache, a second cache module, a comparison module, the replacement module and the modification module can be integrated in the path buffer the first acquisition module and a first generation module may be integrated in a CPU load monitor.

Path selector (Path Selector): After receiving the path computation request, first looks for the available paths in the path of the buffer, can be used to find the path to reply to the service control module; If no path is found, the path buffer to initiate a path calculator a path computation request.

Calculator path (Path Calculator): complete the path calculation function, using a resource allocation and path computation algorithm, the path computation and resource allocation algorithm proposed service control out the path selection needs in the topology database.

Topology database (Traffic Engine Database): The state routing protocol message parsing each advertisement is topology data, thereby generating the global topology, the topology resources for providing the path calculator.

Buffer path (Path Cache): Before buffer route calculation result, the next alternative path is calculated as well.

CPU load monitor (CPU Load Monitor): When monitoring CPU load, and found that the CPU is idle, namely the path buffer initiates a path computation request.

Next, the program execution process will be described in conjunction with the above device.

First, the cache path, directly: Calculated results of previous direct use, its approach is to calculate the path to success has been the result of caching, direct access to the results before the next time calculations.

1, the path calculation process cache misses:

1) After receiving the path selection in the route request, it will check whether there is an existing route path request meet the various requirements to the buffer path, see FIG. 3 Process ①;

2) path buffer module path route request query cache match, the match fails if the path, the path buffer path initiating a request to the route calculator, see FIG. 3 process ②, continued Scheme 3);

3) path computation using the path calculator and resource allocation algorithm (in this case the path computation algorithm comprises engineering database topology on the basis of this process: A *, Dijkstra, Bellman-ford, or other algorithms; resource assignment algorithm comprising: a wavelength allocation algorithm, slot allocation algorithms, etc.) for path computation, and sends the results to calculate the path of the path selector, Figure 3 process ③;

4) and at the same path calculator sends this route to the route cache, the cache buffer path path path for the next query, ④ the process shown in Figure 3;

5) you will receive a path selection path results back to the service control module, thereby completing the path calculation process.

2, the cache hit path calculation process:

1) path calculator module after receiving the route request, it will check whether there is an existing route path request meet the various requirements to the buffer path, see FIG. 3 Process ①;

2) route cache buffer module path route request query matching case, if a match exists a path, the path to the return path selector, Figure 3 process ⑤, and enters Scheme 3);

3) Results path selector route the received service back to the control module, thereby completing the path calculation process.

Second, leisure calculation: to improve the hit rate of the cache queries.

In a network device, re-routing (Reroute) is a sudden process, the probability of such a burst is relatively low, in fact, most of CPU resources are idle controller during idling, at this time we make full use of CPU idle time , by the path computation and the resource allocation algorithm (path computation algorithm comprises: a *, Dijkstra, Bellman-ford, or other algorithms; resource assignment algorithm comprising: a wavelength assignment algorithm, the slot allocation algorithms, etc.) as much of the path is calculated and cache backup, which can effectively improve the hit rate of the cache query path, and in this process, as the system is running, the system will gradually path to all nodes is calculated to achieve the path query hit rate close to 100%, more efficient path to improve computational efficiency.

1, when the cache is leisure calculation process is not saturated:

1) CPU load monitor when the CPU is idle found, the path buffer notification initiates a path computation request, the process shown in Figure 3 ⑥;

2) The current path of the buffer and the buffer path where the topology, the nodes find out a set of requests has not been path, initiating a path computation request, see FIG. 3 ② flow path to the calculator;

3) path computation using the path calculator and resource allocation algorithm (in this case the path computation algorithm comprises traffic engineering database topology based on: A *, Dijkstra, Bellman-ford, or other algorithms; resource assignment algorithm comprising: a wavelength allocation algorithm, when slot allocation algorithms, etc.) for route calculation, route calculator sends this path to the route cache, the cache buffer path path path for the next query, ④ the process shown in Figure 3; leisure time calculation process is now complete. If the CPU load monitor finds CPU remains idle, from Step 1) was repeated starts.

2, when the cache is leisure saturation calculation process:

1) CPU load monitor when the CPU is idle found, the path buffer notification initiates a path computation request, the process shown in Figure 3 ⑥;

2) The current path of the buffer and the buffer path where the topology, the nodes find out a set of requests has not been path, if found suitable are all nodes in the path, the process ends; If the CPU load monitor CPU remains idle found from step 1) is repeated start.

Three cache path refresh process: the state of the resource topology possible changes, which will affect the existing cache path availability, in order to improve the availability of the cache path, when the topology changes, to refresh the cache path.

1) when the routing topology update protocol, notification topology database, analyzing whether the topology database update topology data changes to the existing topology, if there is a change, the topology information transmitted to the route change buffer, the process shown in Figure 3 ⑦; to suppress frequent route flapping caused by calculation, topology changes can take measures focused on the timing of a number of refreshing to resolve.

2) Cache path after buffer (cache memory) refresh message, the topology for the cache path Variation influence, and updates the cache location tags available, to ensure the availability of cache path.

The above-described embodiment is a preferred embodiment of the present invention, it should be noted that for the ordinary skill in the art, in the present invention without departing from the principles of the premise, further improvements and modifications may be made, and these improvements and modifications should also depend the scope of the present invention.

Those of ordinary skill in the art understand that all or part of the steps of the above-described embodiments may be implemented using a computer program process, the computer program may be stored in a computer-readable storage medium, the computer program on the respective hardware platform (e.g. system, apparatus, equipment, device) to perform, when executed, the method comprising the steps of the one embodiment or a combination thereof.

Alternatively, all or part of the steps of the above-described embodiments may be implemented using an integrated circuit, these steps may be made into one integrated circuit modules, or by making them into a plurality of modules or steps single integrated circuit module achieve. Thus, the present invention is not limited to any particular hardware and software combination.

Each of the above embodiments of the apparatus / function module / function unit general purpose computing devices may be employed to implement, they can be integrated on a single computing device or distributed in a network composed of multiple computing devices.

When each of the above-described embodiments of the apparatus / function module / functional unit is implemented as an independent product sold or used in the form of functional software modules may be stored in a computer-readable storage medium. The above-mentioned computer-readable storage medium may be a read-only memory, magnetic or optical disk.

Any skilled in the art in the art within the technical scope of the present invention is disclosed, variations or replacement that can be easily, shall fall within the protection scope of the present invention. Accordingly, the scope of the present invention should be the scope of the claims and their equivalents.

Industrial Applicability

Embodiments of the present invention greatly reduces the time occupied by the path computation, path computation efficiency is improved, thereby reducing the service interruption time and improves service recovery efficiency, reduce the loss of customers.

Claims (12)

  1. A method of computation of a path, comprising:
    Get the current value of the CPU load;
    When the load current value is less than the preset value, generates a path computation request;
    No acquired path calculation requesting node;
    The path calculation request and the calculation of the path computation request, to obtain a first path;
    The first path as a route cache for caching;
    Generates a default route request receiving the request;
    The path of the request for the cached query path;
    If there is a second path and the path request in the cache matching path, the second transmission path.
  2. The method according to claim 1, wherein, when the current load value is smaller than the predetermined value, the path computation request generating step comprises:
    When the load current value is less than the preset value, generating a notification calculation;
    Computation request according to the calculated notification generation path.
  3. The method as claimed in claim 1, further comprising:
    If there is a second path and the path that matches the request, the path computation request is generated;
    The path calculation request to the path, to obtain a third path;
    Sending the third path.
  4. The method as claimed in claim 3, further comprising:
    The third path as a path of the cache buffer.
  5. The method as claimed in claim 1, further comprising:
    After receiving an update notification to obtain the current topology information and topological historical information saved;
    Comparing the current topology information from the topology historical information are the same;
    When the topology of the current topology information is inconsistent with the history information, the history information of the topology to the topology of the current replacement information;
    The cache tag available paths according to the current topology information modification.
  6. A computing device path, comprising:
    A first acquiring module, which is set to the current value obtaining the CPU load;
    A first generation module is set to a value less than a preset value in the load current, generates a path computation request;
    A second acquiring module, configured to capture computing node No route request;
    A first calculation module configured to calculate a request based on the calculated path and the path computation request, to obtain a first path;
    A first cache module, which is provided to the first path as a route cache for caching;
    A second generation module generates the path setting request is received after a predetermined request;
    Query module according to the path set request to query the cache path; and
    A first sending module, which is set if there is a second path and the path request in the cache matching path, the second transmission path.
  7. The apparatus as claimed in claim 6, wherein the first generating module comprising:
    A first generating unit, which is set to the current load value less than the preset value, generates a calculated notification; and
    A second generating unit configured to calculate based on the calculated notification request generation path.
  8. The apparatus as claimed in claim 6, further comprising:
    Third generation module, if there is provided a second path from the path matches the request, the path computation request is generated;
    A second calculation module is provided to calculate a route according to the path calculation request, to obtain a third path; and
    A second sending module, which is configured to transmit the third path.
  9. The apparatus as claimed in claim 8, further comprising:
    A second cache module, which is provided to the cache as said third path cache path.
  10. The apparatus as claimed in claim 6, further comprising:
    The third acquisition module, after it is set to receive the update notification to obtain the current topology information and topological historical information saved;
    A comparison module arranged to compare the information with the topology of the current topology is consistent history information;
    Replacement module, which is set when the topology of the current history information with the topology information inconsistency, then the history information of the topology to the topology of the current replacement information;
    Modification module, which is arranged according to the topology information currently available to modify the cache tag path.
  11. A computer program comprising program instructions, the program instructions when executed by a computer, causes the computer-executable method of claim any one of claims 1-5.
  12. One carrier of claim 11 with a computer program of computer readable storage medium.
PCT/CN2014/089795 2014-06-30 2014-10-29 Method and apparatus for path computation WO2016000365A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201410307209.2 2014-06-30
CN 201410307209 CN105282023A (en) 2014-06-30 2014-06-30 Method and device for calculating path

Publications (1)

Publication Number Publication Date
WO2016000365A1 true true WO2016000365A1 (en) 2016-01-07

Family

ID=55018376

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/089795 WO2016000365A1 (en) 2014-06-30 2014-10-29 Method and apparatus for path computation

Country Status (2)

Country Link
CN (1) CN105282023A (en)
WO (1) WO2016000365A1 (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080298805A1 (en) * 2007-05-30 2008-12-04 Futurewei Technologies, Inc. System and Method for Wavelength Conversion and Switching
CN101606341A (en) * 2006-03-14 2009-12-16 思科技术公司 Technique for efficiently routing IP traffic on CE-CE paths across a provider network
CN101646108A (en) * 2009-09-07 2010-02-10 中兴通讯股份有限公司 Method and device for determining route
CN101741912A (en) * 2009-12-30 2010-06-16 中兴通讯股份有限公司 Method, network apparatus and distributed network system for processing computation task
CN102006527A (en) * 2010-11-17 2011-04-06 北京邮电大学 Path calculation method based on PCE in optical network
CN103716251A (en) * 2014-01-14 2014-04-09 三星电子(中国)研发中心 Load balancing method and equipment for content distribution network

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101606341A (en) * 2006-03-14 2009-12-16 思科技术公司 Technique for efficiently routing IP traffic on CE-CE paths across a provider network
US20080298805A1 (en) * 2007-05-30 2008-12-04 Futurewei Technologies, Inc. System and Method for Wavelength Conversion and Switching
CN101646108A (en) * 2009-09-07 2010-02-10 中兴通讯股份有限公司 Method and device for determining route
CN101741912A (en) * 2009-12-30 2010-06-16 中兴通讯股份有限公司 Method, network apparatus and distributed network system for processing computation task
CN102006527A (en) * 2010-11-17 2011-04-06 北京邮电大学 Path calculation method based on PCE in optical network
CN103716251A (en) * 2014-01-14 2014-04-09 三星电子(中国)研发中心 Load balancing method and equipment for content distribution network

Also Published As

Publication number Publication date Type
CN105282023A (en) 2016-01-27 application

Similar Documents

Publication Publication Date Title
US20090285101A1 (en) Method and Apparatus for Dynamically Runtime Adjustable Path Computation
US20130041982A1 (en) Method and node for acquiring content and content network
US8553562B2 (en) Automated traffic engineering for multi-protocol label switching (MPLS) with link utilization as feedback into the tie-breaking mechanism
US20130250958A1 (en) Communication control system, control server, forwarding node, communication control method, and communication control program
US20110085461A1 (en) Flexible network measurement
US20010034853A1 (en) Load distribution failure recovery system and method
Li et al. OpenFlow based load balancing for Fat-Tree networks with multipath support
CN1866852A (en) Method for realizing path computation in network domain
US20100039939A1 (en) Method and system for obtaining path information, path computation element
US20100232287A1 (en) Method and network device for realizing shared mesh protection
CN101237399A (en) Method, system and device for getting label switching path
US20150138973A1 (en) Shortening of service paths in service chains in a communications network
US20140098678A1 (en) Network Management
US20090228604A1 (en) Apparatus and method for calculating communication paths
CN102546406A (en) Network-on-chip routing centralized control system and device and adaptive routing control method
CN103001892A (en) Network resource distribution method and system based on cloud computing
CN1870570A (en) Method for solving resource conflict in distribution route counting
CN101001102A (en) Route device and method for raising service quality of space information network
CN103414644A (en) Method for issuing entries and controller
CN102204188A (en) Routing computation method and host node device in virtual network element
CN103746911A (en) SDN (software defined networking) structure and communication method thereof
CN102291324A (en) High concurrent service request processing method
JP2007179243A (en) Communication system and communication apparatus
CN101141376A (en) Method to establish TE path, path computation equipment and system
CN101170477A (en) A link resource management method and transmission method and network device

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: 14896845

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase in:

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 14896845

Country of ref document: EP

Kind code of ref document: A1