CN101237399A - Method, system and device for getting label switching path - Google Patents
Method, system and device for getting label switching path Download PDFInfo
- Publication number
- CN101237399A CN101237399A CNA2007101752960A CN200710175296A CN101237399A CN 101237399 A CN101237399 A CN 101237399A CN A2007101752960 A CNA2007101752960 A CN A2007101752960A CN 200710175296 A CN200710175296 A CN 200710175296A CN 101237399 A CN101237399 A CN 101237399A
- Authority
- CN
- China
- Prior art keywords
- path
- constraints
- jumping
- request
- module
- 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.)
- Pending
Links
Images
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/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- 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/20—Hop count for routing purposes, e.g. TTL
-
- 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/42—Centralised routing
-
- 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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
-
- 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/645—Splitting route computation layer and forwarding layer, e.g. routing according to path computational element [PCE] or based on OpenFlow functionality
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computing Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention discloses a method, a system and a device for obtaining a label switching path, which belong to the communication field. The method comprises the following steps of receiving a path calculation request which carries a destination address, a basic constraint condition and a hop number constraint condition; according to a network topological structure and the destination address in the request, calculating the paths which satisfy the basic constraint condition; selecting the path in which the hop number satisfies the hop number constraint condition from the calculated paths; returning the selected path to the path calculation request sending party. The system comprises a path calculation requesting device and a path calculation device. The device comprises a message extending module, a path calculation request sending module and a receiving module. The present invention further provides another device which comprises a path calculation request receiving module, a path calculation module, a path selecting module and a sending module. The present invention adds the hop number as a constraint condition when calculating paths, the reliability of the calculated paths is enhanced.
Description
Technical field
The present invention relates to the communications field, particularly a kind of method, system and equipment that obtains label switched path.
Background technology
Traffic engineering is paid close attention to the optimization of overall performance of network, and its main target provides the service of high-efficiency reliable network, optimizes the use of Internet resources, optimizes network traffics.Traffic engineering specifically is divided into two aspects: the one, towards flow, promptly pay close attention to the service quality that how to improve network; The 2nd, towards resource, promptly pay close attention to use how to optimize Internet resources, most importantly how to effectively utilize bandwidth resources.Along with the expansion of network design scope, and the development of GMPLS (Genneral Multiple ProtocolLabel Switch, general multiprotocol label switching) technology, inter-domain flux engineering will be crossed over different operators, contains the GMPLS network.
CSPF (Constraint-based Shortest Path First, SPF based on constraint) calculating is MPLS (Multiple Protocol Label Switch, multiprotocol label switching) and the important component part of GMPLS traffic engineering, many AS (Autonomous Systems, autonomous system) path computing between is very complicated, may need the computational entity of different AS to cooperate mutually, finish jointly.In addition, based on PCE (Path Computation Element, the path computing node) the constrained path computational methods of model also can be applied to inter-domain flux engineering, these computational methods do not influence the use in the path of calculating, foundation, maintenance and dismounting as LSP (Label Swithing Path, label switched path).
Constrained path computational methods based on the PCE model are specific as follows:
As PCC (Path Computation Client, path calculating client), as ingress LSR (ingress LabelSwitch Router, the inlet LSR) when setting up the LSP path, send request by the PCEP protocol massages to PCE, can contain essential informations such as the destination address in path and various constraintss in the solicited message.
PCE is according to TED (Traffic Engineering Database, traffic engineering database) network topological information in, calculate the path of satisfying the constraints in this request, return to PCC by response message, as the ERO that sets up LSP (Explicit Route Object, the explicit path object) parameter can contain accurate node (router) and loose nodes (network segment, a zone or an AS) in the result of calculation.
The responsible computer capacity of PCE generally is an AS, this is because IGP (Interior Gateway Protocol, Interior Gateway Protocol) diffusion TED range of information is an AS, when the destination of computation requests is another one AS, then need the PCE cooperation between different AS, finish the calculating of a paths.PCE is not limited to the specific implementation form, can be implemented in the router, or in specified server.
Two basic agreements are arranged in the PCE model:
PCED (Path Computation Element Discovery Protocol, PCE finds agreement), be responsible for existence and computing capability that PCC finds PCE, when PCC has computation requests, according to the information that this agreement obtains, select suitable PCE to send computation requests and calculate;
PCEP (Path Computation Element communication Protocol, PCE communication protocol), be responsible for transmitting between PCC and the PCE computation requests and response message, PCC is when sending computation requests, comprise various constraintss, need other PCE to assist when a certain PCE calculates, the communication between the PCE also needs this communication protocol support.
The PCEP protocol massages adopts TLV (Type, Length, Value, type, length, value) mode to carry various information, and encapsulation format is as follows:
0 1 2 3
0?1?2?3?4?5?6?7?8?9?0?1?2?3?4?5?6?7?8?9?0?1?2?3?4?5?6?7?8?9?0?1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|?Object-Class?| OT?|?Res?|?P?|I| Object?Length(bytes) |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| |
// (Object?body) //
| |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Wherein the implication of each field is as follows:
Object-Class: object kind;
Object-Type: object type;
Res: reserved field;
P: the processing rule field, represent during set that the constraints of this object factory must be processed;
I: ignore field, represent during set whether the constraints of this object factory is left in the basket when calculating;
Object Length: the length of whole object;
Object body: the content of object.
Wherein, object of the unique expression of Object-Class and Object-Type, after Object-Class and Object-Type determined, the content of Object body had also just been determined.
When setting up the LSP path, more than one of the path of satisfying constraints that obtains.For example,, 5 node R 1, R2, R3, R4 and R5 are arranged in the network referring to Fig. 1, wherein, R1-R2, R2-R4, the TE cost between the R4-R5 is 10, R1-R3, the TE cost of R3-R5 is 15; Need set up the TE path of a R1 now to R5, suppose that bandwidth information is all just the same and satisfy constraints on each link, by current topology two paths: R1-R2-R4-R5 and R1-R3-R5 are arranged as can be known, total TE cost all is 30, so can think that this is the path of two equivalences.
But, find out a path more reliably if desired, should select R1-R3-R5.The possibility of supposing each node and each bar link occurs fault is identical, can know the probability height that R1-R2-R4-R5 should break down than R1-R3-R5 from the angle analysis of probability.The link and the node that is to say process are few more, and this paths is just more reliable comparatively speaking so.
In realizing process of the present invention, the inventor finds prior art, and there are the following problems at least:
Can only select to satisfy the path of existing constraints, make the path of selection optimize poor practicability inadequately.
Summary of the invention
In order to find more excellent LSP path, the embodiment of the invention provides a kind of method, system and equipment that obtains label switched path.Described technical scheme is as follows:
The embodiment of the invention provides a kind of method of obtaining label switched path, and described method comprises:
RX path computation requests, described request are carried destination address, basic constraints and jumping figure constraints;
According to the destination address in network topology structure and the described request, calculate the path of satisfying described basic constraints;
The path of from the path that is calculated, selecting jumping figure to satisfy described jumping figure constraints;
The path of selecting is returned to the path computing request transmit leg.
The embodiment of the invention provides a kind of system that obtains label switched path, and described system comprises:
Path computing request equipment is used for path computation request, and described request is carried destination address, basic constraints and jumping figure constraints;
Path computation equipment, be used to receive the path computing request that described path computing request equipment sends, according to the destination address in network topology structure and the described request, the path of described basic constraints is satisfied in calculating, the path of from the path that is calculated, selecting jumping figure to satisfy described jumping figure constraints, and the path of selecting returned to described path computing request equipment.
The embodiment of the invention provides a kind of equipment, and described equipment comprises:
The message expansion module is used for extensions path computing node communication protocol message, carries jumping figure constraints in described message;
The path computing request sending module is used to use the path computing node communication protocol massages path computation request after described message expansion module is expanded, and described message carries destination address, basic constraints and jumping figure constraints;
Receiver module is used for the path that the RX path computing equipment calculates.
Further, the embodiment of the invention also provides a kind of equipment, and described equipment comprises:
The path computing request receiver module is used for the RX path computation requests, and described request is carried destination address, basic constraints and jumping figure constraints;
Path calculation module is used for the destination address according to the request of network topology structure and the reception of described path computing request receiver module, calculates the path of satisfying described basic constraints;
Path selection module, the path that the path that is used for calculating from described path calculation module selects jumping figure to satisfy described jumping figure constraints;
Sending module is used for the path that described path selection module is selected is returned to path computing request equipment.
The beneficial effect of the technical scheme that the embodiment of the invention provides is:
By in the PCEP message, introducing the jumping figure object, when PCC sets up the LSP path, increase jumping figure as new constraints, under the situation that other constraints all satisfies, select the path of jumping figure minimum, because the node of path process is few more, the reliability in path is also high more, therefore with jumping figure as constraints after, can get access to more excellent LSP path.
Description of drawings
Fig. 1 is the schematic diagram of TE path node in the prior art;
Fig. 2 is the flow chart of the method for obtaining label switched path that provides of the embodiment of the invention 1;
Fig. 3 is the structure chart of the system that obtains label switched path that provides of the embodiment of the invention 2;
Fig. 4 is the structure chart of the equipment that provides of the embodiment of the invention 3;
Fig. 5 is the structure chart of the equipment that provides of the embodiment of the invention 4.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, embodiment of the present invention is described further in detail below in conjunction with accompanying drawing.
The embodiment of the invention with the constraints that jumping figure calculates as CSPF, when other constraints all satisfies, is selected the minimum path of jumping figure by introduce the jumping figure object in the PCEP protocol massages.
Embodiment 1
The embodiment of the invention provides a kind of method of obtaining label switched path, and this method is finished by PCE, comprising:
RX path computation requests, this request are carried destination address, basic constraints and jumping figure constraints;
Destination address according in network topology structure and the request calculates the path of satisfying basic constraints;
The path of from the path that is calculated, selecting jumping figure to satisfy jumping figure constraints;
The path of selecting is returned to the path computing request transmit leg.
PCE in the present embodiment can be a router or a specified server, is used to receive the path computing request information of PCC, calculates the LSP path of satisfying constraints.
Referring to Fig. 2, the above-mentioned method of obtaining label switched path specifically may further comprise the steps:
Step 101: expansion PCEP protocol massages, in the PCEP protocol massages, introduce a new jumping figure object, i.e. MAX-HOPObject is with the constraints of jumping figure when obtaining the LSP path.
The Object-Class of the new jumping figure object of introducing and Object-Type need application in addition, and to be different from more existing Object, the Object body form of jumping figure object is as follows:
0 1 2 3
0?1?2?3?4?5?6?7?8?9?0?1?2?3?4?5?6?7?8?9?0?1?2?3?4?5?6?7?8?9?0?1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| |?R?| S | hop-value |
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Wherein, the implication of each field is as follows in the jumping figure object of above-mentioned new application:
S (Scope): the implication of expression jumping figure be Node Hop (node jumping figure), or Area is Hop (territory jumping figure), or AS is Hop (AS jumping figure), and the S fields account is with 3 bit positions.
R: flag bit can be set to 1 or 0.Can be by being set to 1, expression PCC wonders the actual jumping figure in path; By being set to the actual jumping figure that 0 expression PCC does not wonder the path, PCE there is no need to return.
Hop-value: the actual jumping figure in the path that expression PCE calculates, for example, hop-value is 3, the jumping figure in the path that expression PCE calculates is 3, can judge which class jumping figure hop-value specifically represents according to the value of setting of S field.
1) when PCC need set up the LSP path, PCEP protocol massages after PCE sends expansion, a receptible jumping figure of maximum is set, a constraints during as PCE, for example, it is 5 that maximum receptible jumping figure is set, if PCE can't calculate when satisfying the path of specifying jumping figure, promptly do not find jumping figure 5 during, calculate failure to the PCC notice with interior path;
2) if PCE is because the reason of jumping figure is calculated failure, can calculate the minimum hop count of returning in the Actual path in the response message of failure at the notice PCC that PCE sends and supply the PCC reference, for example, minimum hop count is 7 in the Actual path, PCE returns to PCC with minimum hop count 7 by the bit in the jumping figure object is set in the response message of the notice PCC calculating failure that PCE sends;
3) a PCC constraints during as the PCE calculating path not with jumping figure, but require PCE after calculating the path, the consequent part of jumping figure is returned to PCC.
Step 102: when PCC sets up the LSP path, to the PCE path computation request.
An AS inside, one or more PCE can be arranged, when having a plurality of PCE, PCC can select a suitable PCE according to the computing capability of each PCE before PCE sends the PCEP message.
Carried the information of the destination address in the path that constraints and PCC will set up in the path computing request, basic constraintss such as constraints comprises bandwidth, forbids node, management group, in the present embodiment, also increased jumping figure constraints in the constraints, promptly when other constraints all satisfies, require PCE to select the path of jumping figure minimum.
Path computing request can have various ways, be that example describes with the message in the present embodiment, the PCEP protocol massages of PCC after PCE sends expansion, for the constraints that increases newly, the bit of jumping figure object in the PCEP protocol massages after the expansion can be set, the jumping figure that PCC requires is set, and for example, it is 5 that maximum receptible jumping figure is set.
After step 103:PCE receives the path computing request of PCC transmission, the path of satisfying the basic constraints in this request according to the information calculations among the TED.
Storing topology information among the TED with Network Synchronization, PCE is according to the destination address and the network topological information in the path in the message that receives, by the path that the CSPF algorithm computation satisfies basic constraints in the message, the path of in the path of satisfying basic constraints that calculates, selecting jumping figure to satisfy jumping figure constraints.
Step 104: judge whether to exist the path of satisfying constraints, if then execution in step 105; Otherwise, execution in step 106.
Step 105:PCE sends the PCEP response message to PCC, has carried one group of information such as LSR address that satisfy the path node of constraints in this response message, and execution in step 107 then.
The result of calculation of CSPF algorithm is external route of output, this external route comprised one group satisfy constraints the LSR address of shortest path node, PCE can return to PCC in the mode of ERO coding with the LSR address information of the path node that satisfies constraints that calculates.For example, in Fig. 2, if be that constraints finds two suitable path: R1-R2-R4-R5 and R1-R3-R5 with bandwidth etc., at this moment the jumping figure that compares two paths, select the path of jumping figure minimum, i.e. R1-R3-R5, PCE returns to PCC with this result by response message then.
When PCE calculates many paths of satisfying constraints,, the path of picking out is returned to PCC with therefrom selecting optimum path.
Step 106:PCE sends the PCEP response message to PCC, and notice PCC calculates failure, does not promptly have the path of satisfying current constraints.
When PCE calculates failure because of the reason of jumping figure, be PCE when not selecting the path of satisfying jumping figure constraints in the path of satisfying basic constraints that calculates, the flag bit R in the PCEP protocol massages that sends according to PCC judges whether that the jumping figure in the path that will calculate returns to PCC.For example, the maximum receptible jumping figure that requires in the request message is 5, and the jumping figure of the minimum of the Actual path that calculates is 7, when R position 1, in response message this minimum hop count 7 is returned to PCC as a reference, when R position 0, does not return jumping figure information.
After step 107:PCC receives the response message of PCE transmission, extract the path node information in the message, it as the ERO parameter of setting up LSP, is initiated to set up the signaling of LSP, set up the LSP path.
Calculate failure if the response message that PCC receives is a notice, can wait for a period of time and calculate once more, perhaps reduce constraints and ask once more to calculate new path, method is the same, repeats no more here.
Embodiment 2
Referring to Fig. 3, the embodiment of the invention provides a kind of system that obtains label switched path, specifically comprises:
Path computing request equipment 201 is used for path computation request, and destination address, basic constraints and jumping figure constraints are carried in request;
Path computation equipment 202, be used for the path computing request that RX path computation requests equipment 201 sends, according to the destination address in network topology structure and the request, the path of basic constraints is satisfied in calculating, the path of from the path that is calculated, selecting jumping figure to satisfy jumping figure constraints, and the path of selecting returned to path computing request equipment 201.
Further, path computing request equipment 201 can specifically comprise:
The message expansion module is used for extensions path computing node communication protocol message, carries jumping figure constraints in message;
The path computing request sending module is used to use the path computing node communication protocol massages path computation request after the message expansion module is expanded, and message carries destination address, basic constraints and jumping figure constraints.
Path computation equipment 202 can specifically comprise:
The path computing request receiver module is used for the path computing request that RX path computation requests equipment 201 sends;
Path calculation module is used for the destination address according to the request of network topology structure and the reception of path computing request receiver module, calculates the path of satisfying basic constraints;
Path selection module, the path that the path that is used for calculating from path calculation module selects jumping figure to satisfy jumping figure constraints;
Sending module is used for the path that path selection module is selected is returned to path computing request equipment 201.
Embodiment 3
Referring to Fig. 4, the embodiment of the invention provides a kind of equipment, and the equipment that present embodiment provides can be used for when setting up the LSP path, and path computation request specifically comprises:
Message expansion module 301 is used for extensions path computing node communication protocol message, carries jumping figure constraints in message;
Path computing request sending module 302 is used to use the path computing node communication protocol massages path computation request after message expansion module 301 is expanded, and message carries destination address, basic constraints and jumping figure constraints;
Receiver module 303 is used for the path that the RX path computing equipment calculates.
Embodiment 4
Referring to Fig. 5, the embodiment of the invention also provides a kind of equipment, and the equipment that present embodiment provides can be used for the RX path computation requests, calculates the path of satisfying constraints in the request according to request, specifically comprises:
Path computing request receiver module 401 is used for the RX path computation requests, and destination address, basic constraints and jumping figure constraints are carried in request;
Path calculation module 402 is used for the destination address according to the request of network topology structure and 401 receptions of path computing request receiver module, calculates the path of satisfying basic constraints;
Path selection module 403 is used for the path of selecting jumping figure to satisfy jumping figure constraints from the path that path calculation module 402 is calculated;
Sending module 404 is used for the path that path selection module 403 is selected is returned to path computing request equipment.
The embodiment of the invention can realize by software, and corresponding software can be stored in the storage medium that can read, for example in the hard disk of computer, floppy disk or the CD, or in the network equipment such as router.
The embodiment of the invention is by introducing the jumping figure object in the PCEP message, when PCC sets up the LSP path, with jumping figure as constraints, under the situation that other constraints all satisfies, select the path of jumping figure minimum, because the node of path process is few more, also reliable more comparatively speaking, therefore with jumping figure as constraints after, can get access to more excellent LSP path.
The above only is preferred embodiment of the present invention, and is in order to restriction the present invention, within the spirit and principles in the present invention not all, any modification of being done, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (8)
1. a method of obtaining label switched path is characterized in that, described method comprises:
RX path computation requests, described request are carried destination address, basic constraints and jumping figure constraints;
According to the destination address in network topology structure and the described request, calculate the path of satisfying described basic constraints;
The path of from the path that is calculated, selecting jumping figure to satisfy described jumping figure constraints;
The path of selecting is returned to the path computing request transmit leg.
2. the method for obtaining label switched path according to claim 1 is characterized in that, described path computing request is specially the path computing node communication protocol massages that carries jumping figure constraints.
3. the method for obtaining label switched path according to claim 1 is characterized in that, described method also comprises:
When not satisfying the path of described jumping figure constraints in the path that is calculated, return the calculating failure notification to the path computing request transmit leg.
4. a system that obtains label switched path is characterized in that, described system comprises:
Path computing request equipment is used for path computation request, and described request is carried destination address, basic constraints and jumping figure constraints;
Path computation equipment, be used to receive the path computing request that described path computing request equipment sends, according to the destination address in network topology structure and the described request, the path of described basic constraints is satisfied in calculating, the path of from the path that is calculated, selecting jumping figure to satisfy described jumping figure constraints, and the path of selecting returned to described path computing request equipment.
5. the system that obtains label switched path according to claim 4 is characterized in that, described path computing request equipment comprises:
The message expansion module is used for extensions path computing node communication protocol message, carries jumping figure constraints in described message;
The path computing request sending module is used to use the path computing node communication protocol massages path computation request after described message expansion module is expanded, and described message carries destination address, basic constraints and jumping figure constraints.
6. the system that obtains label switched path according to claim 4 is characterized in that, described path computation equipment comprises:
The path computing request receiver module is used to receive the path computing request that described path computing request equipment sends;
Path calculation module is used for the destination address according to the request of network topology structure and the reception of described path computing request receiver module, calculates the path of satisfying described basic constraints;
Path selection module, the path that the path that is used for calculating from described path calculation module selects jumping figure to satisfy described jumping figure constraints;
Sending module is used for the path that described path selection module is selected is returned to described path computing request equipment.
7. an equipment is characterized in that, described equipment comprises:
The message expansion module is used for extensions path computing node communication protocol message, carries jumping figure constraints in described message;
The path computing request sending module is used to use the path computing node communication protocol massages path computation request after described message expansion module is expanded, and described message carries destination address, basic constraints and jumping figure constraints;
Receiver module is used for the path that the RX path computing equipment calculates.
8. an equipment is characterized in that, described equipment comprises:
The path computing request receiver module is used for the RX path computation requests, and described request is carried destination address, basic constraints and jumping figure constraints;
Path calculation module is used for the destination address according to the request of network topology structure and the reception of described path computing request receiver module, calculates the path of satisfying described basic constraints;
Path selection module, the path that the path that is used for calculating from described path calculation module selects jumping figure to satisfy described jumping figure constraints;
Sending module is used for the path that described path selection module is selected is returned to path computing request equipment.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007101752960A CN101237399A (en) | 2007-09-28 | 2007-09-28 | Method, system and device for getting label switching path |
| PCT/CN2008/072260 WO2009043256A1 (en) | 2007-09-28 | 2008-09-03 | Method, system and device for obtaining label switched path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007101752960A CN101237399A (en) | 2007-09-28 | 2007-09-28 | Method, system and device for getting label switching path |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101237399A true CN101237399A (en) | 2008-08-06 |
Family
ID=39920765
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2007101752960A Pending CN101237399A (en) | 2007-09-28 | 2007-09-28 | Method, system and device for getting label switching path |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN101237399A (en) |
| WO (1) | WO2009043256A1 (en) |
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009043256A1 (en) * | 2007-09-28 | 2009-04-09 | Huawei Technologies Co., Ltd. | Method, system and device for obtaining label switched path |
| WO2011022982A1 (en) * | 2009-08-25 | 2011-03-03 | 中兴通讯股份有限公司 | Method and path computation element for improving service restoration speed in transmission network |
| CN102201971A (en) * | 2010-03-23 | 2011-09-28 | 中兴通讯股份有限公司 | Pseudo wire routing realization method, device and system |
| WO2012006785A1 (en) * | 2010-07-15 | 2012-01-19 | Huawei Technologies Co., Ltd. | Method and apparatus for implementing p2mp path computation |
| CN102523156A (en) * | 2011-12-09 | 2012-06-27 | 北京邮电大学 | Routing method based on hop count constraint |
| CN103168451A (en) * | 2010-09-21 | 2013-06-19 | 瑞典爱立信有限公司 | Relayed cspf computation for multiple areas and multiple autonomous systems |
| CN103532849A (en) * | 2012-07-06 | 2014-01-22 | 中兴通讯股份有限公司 | Method for calculating frequency-spectrum time-sequence channel, path calculating unit and nodes |
| WO2014139356A1 (en) * | 2013-03-15 | 2014-09-18 | Huawei Technologies Co., Ltd. | Method of communicating for establishing path and network apparatus |
| CN104092611A (en) * | 2014-07-17 | 2014-10-08 | 杭州华三通信技术有限公司 | Method and device for determining label switching route with restrained cross region |
| US9184998B2 (en) | 2013-03-14 | 2015-11-10 | Qualcomm Incorporated | Distributed path update in hybrid networks |
| CN105306245A (en) * | 2014-07-31 | 2016-02-03 | 杭州华三通信技术有限公司 | Traffic engineering link information maintenance method and traffic engineering link information maintenance device |
| CN105515981A (en) * | 2014-10-17 | 2016-04-20 | 中兴通讯股份有限公司 | Path computation method, tunnel establishment method, PCC, PCE and path computation system |
| CN105681190A (en) * | 2014-11-21 | 2016-06-15 | 中兴通讯股份有限公司 | Tunnel restraint information sending, receiving method and device |
| WO2016095699A1 (en) * | 2014-12-16 | 2016-06-23 | 中兴通讯股份有限公司 | Method and apparatus for acquiring state of label switching path |
| CN106789656A (en) * | 2016-12-16 | 2017-05-31 | 北京格林伟迪科技股份有限公司 | A kind of route requests treating method and apparatus |
| US9705747B1 (en) | 2012-12-04 | 2017-07-11 | Qualcomm Incorporated | Distributed path selection in hybrid networks |
| CN107154862A (en) * | 2016-03-04 | 2017-09-12 | 上海海岸展览服务有限公司 | A kind of go-between recommends method and system |
| CN107800637A (en) * | 2016-08-30 | 2018-03-13 | 中国电信股份有限公司 | A kind of method, PCE and SDN for being used to determine service transmission path |
| WO2018054197A1 (en) * | 2016-09-21 | 2018-03-29 | Huawei Technologies Co., Ltd. | Method and apparatus for path selecting |
| CN107864103A (en) * | 2016-09-22 | 2018-03-30 | 中兴通讯股份有限公司 | A kind of method and device of tunnel building |
| CN108075939A (en) * | 2016-11-17 | 2018-05-25 | 中国电信股份有限公司 | Network quality detecting system and method |
| WO2018095438A1 (en) * | 2016-11-28 | 2018-05-31 | 中兴通讯股份有限公司 | Method and device for processing equal cost multi-path (ecmp) |
| CN108989065A (en) * | 2017-05-31 | 2018-12-11 | 中兴通讯股份有限公司 | The processing method and processing device of road failure is calculated in a kind of PCC request |
| CN111385206A (en) * | 2018-12-29 | 2020-07-07 | 北京华为数字技术有限公司 | Message forwarding method, network system, related equipment and computer storage medium |
| CN114996544A (en) * | 2022-04-26 | 2022-09-02 | 东南大学 | Travel path extraction method based on mobile phone signaling data and Mix-Markov model |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116208527B (en) * | 2023-02-28 | 2024-03-26 | 西安电子科技大学 | Method for evaluating destructiveness of mobile self-organizing network limited by transceiver |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100542126C (en) * | 2004-10-21 | 2009-09-16 | 华为技术有限公司 | A kind of system of selection of optimum route |
| JP2007235579A (en) * | 2006-03-01 | 2007-09-13 | Nippon Telegr & Teleph Corp <Ntt> | Control device, path setting method, and program |
| CN101237399A (en) * | 2007-09-28 | 2008-08-06 | 华为技术有限公司 | Method, system and device for getting label switching path |
-
2007
- 2007-09-28 CN CNA2007101752960A patent/CN101237399A/en active Pending
-
2008
- 2008-09-03 WO PCT/CN2008/072260 patent/WO2009043256A1/en active Application Filing
Cited By (35)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009043256A1 (en) * | 2007-09-28 | 2009-04-09 | Huawei Technologies Co., Ltd. | Method, system and device for obtaining label switched path |
| US8767550B2 (en) | 2009-08-25 | 2014-07-01 | Zte Corporation | Method and path computation element for improving service restoration speed in transmission network |
| WO2011022982A1 (en) * | 2009-08-25 | 2011-03-03 | 中兴通讯股份有限公司 | Method and path computation element for improving service restoration speed in transmission network |
| KR101342787B1 (en) * | 2009-08-25 | 2013-12-19 | 지티이 코포레이션 | Method and path computation element for improving service restoration speed in transmission network |
| CN102201971A (en) * | 2010-03-23 | 2011-09-28 | 中兴通讯股份有限公司 | Pseudo wire routing realization method, device and system |
| WO2012006785A1 (en) * | 2010-07-15 | 2012-01-19 | Huawei Technologies Co., Ltd. | Method and apparatus for implementing p2mp path computation |
| CN103168451A (en) * | 2010-09-21 | 2013-06-19 | 瑞典爱立信有限公司 | Relayed cspf computation for multiple areas and multiple autonomous systems |
| CN102523156A (en) * | 2011-12-09 | 2012-06-27 | 北京邮电大学 | Routing method based on hop count constraint |
| CN102523156B (en) * | 2011-12-09 | 2014-11-26 | 北京邮电大学 | Routing method based on hop count constraint |
| CN103532849A (en) * | 2012-07-06 | 2014-01-22 | 中兴通讯股份有限公司 | Method for calculating frequency-spectrum time-sequence channel, path calculating unit and nodes |
| CN103532849B (en) * | 2012-07-06 | 2018-10-23 | 中兴通讯股份有限公司 | A kind of method, path-calculating element and node calculating frequency slot channel |
| US9705747B1 (en) | 2012-12-04 | 2017-07-11 | Qualcomm Incorporated | Distributed path selection in hybrid networks |
| US9184998B2 (en) | 2013-03-14 | 2015-11-10 | Qualcomm Incorporated | Distributed path update in hybrid networks |
| WO2014139356A1 (en) * | 2013-03-15 | 2014-09-18 | Huawei Technologies Co., Ltd. | Method of communicating for establishing path and network apparatus |
| CN104092611A (en) * | 2014-07-17 | 2014-10-08 | 杭州华三通信技术有限公司 | Method and device for determining label switching route with restrained cross region |
| CN105306245A (en) * | 2014-07-31 | 2016-02-03 | 杭州华三通信技术有限公司 | Traffic engineering link information maintenance method and traffic engineering link information maintenance device |
| US10320682B2 (en) | 2014-07-31 | 2019-06-11 | Hewlett Packard Enterprise Development Lp | Maintaining information of TE link |
| CN105515981A (en) * | 2014-10-17 | 2016-04-20 | 中兴通讯股份有限公司 | Path computation method, tunnel establishment method, PCC, PCE and path computation system |
| WO2016058299A1 (en) * | 2014-10-17 | 2016-04-21 | 中兴通讯股份有限公司 | Path computation method, tunnel establishment method, pcc, pce, path computation system and storage medium |
| CN105681190A (en) * | 2014-11-21 | 2016-06-15 | 中兴通讯股份有限公司 | Tunnel restraint information sending, receiving method and device |
| WO2016095699A1 (en) * | 2014-12-16 | 2016-06-23 | 中兴通讯股份有限公司 | Method and apparatus for acquiring state of label switching path |
| CN107154862A (en) * | 2016-03-04 | 2017-09-12 | 上海海岸展览服务有限公司 | A kind of go-between recommends method and system |
| CN107800637A (en) * | 2016-08-30 | 2018-03-13 | 中国电信股份有限公司 | A kind of method, PCE and SDN for being used to determine service transmission path |
| CN107800637B (en) * | 2016-08-30 | 2021-06-22 | 中国电信股份有限公司 | Method for determining service transmission path, PCE (path computation element) and SDN (software defined network) |
| CN109716718A (en) * | 2016-09-21 | 2019-05-03 | 华为技术有限公司 | The method and apparatus of Path selection |
| WO2018054197A1 (en) * | 2016-09-21 | 2018-03-29 | Huawei Technologies Co., Ltd. | Method and apparatus for path selecting |
| CN107864103A (en) * | 2016-09-22 | 2018-03-30 | 中兴通讯股份有限公司 | A kind of method and device of tunnel building |
| CN108075939B (en) * | 2016-11-17 | 2020-06-09 | 中国电信股份有限公司 | Network quality detection system and method |
| CN108075939A (en) * | 2016-11-17 | 2018-05-25 | 中国电信股份有限公司 | Network quality detecting system and method |
| WO2018095438A1 (en) * | 2016-11-28 | 2018-05-31 | 中兴通讯股份有限公司 | Method and device for processing equal cost multi-path (ecmp) |
| CN106789656A (en) * | 2016-12-16 | 2017-05-31 | 北京格林伟迪科技股份有限公司 | A kind of route requests treating method and apparatus |
| CN106789656B (en) * | 2016-12-16 | 2019-10-25 | 北京格林伟迪科技股份有限公司 | A kind of route requests treating method and apparatus |
| CN108989065A (en) * | 2017-05-31 | 2018-12-11 | 中兴通讯股份有限公司 | The processing method and processing device of road failure is calculated in a kind of PCC request |
| CN111385206A (en) * | 2018-12-29 | 2020-07-07 | 北京华为数字技术有限公司 | Message forwarding method, network system, related equipment and computer storage medium |
| CN114996544A (en) * | 2022-04-26 | 2022-09-02 | 东南大学 | Travel path extraction method based on mobile phone signaling data and Mix-Markov model |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2009043256A1 (en) | 2009-04-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101237399A (en) | Method, system and device for getting label switching path | |
| CN111587580B (en) | Interior gateway protocol flooding minimization | |
| EP2548341B1 (en) | Alternate down paths for directed acyclic graph (dag) routing | |
| US9800493B2 (en) | Routing messages in a computer network using deterministic and probalistic source routes | |
| EP2476224B1 (en) | Method and apparatus for path computation element and routing controller cooperation | |
| US9300569B2 (en) | Compressing data packet routing information using bloom filters | |
| CN103379032A (en) | Acquisition method and device for cross-domain end-to-end route and secondary route computation element | |
| US11632322B2 (en) | Preferred path route graphs in a network | |
| CN101141376B (en) | Method to establish TE path, path computation equipment and system | |
| Al-Naday et al. | Information resilience: source recovery in an information-centric network | |
| CN103166848A (en) | Method and point for selecting multi-protocol label switching traffic engineering bypass tunnel | |
| CN101296178B (en) | Inter-domain flux engineering route computing method and route computing device | |
| CN101247322A (en) | Method and network appliance for route computation between autonomy systems | |
| CN104253750A (en) | Path obtaining method and system, path computation element, and path computation client | |
| CN113542120A (en) | Path selection method and device and computer readable storage medium | |
| CN101521601A (en) | Method, system and device for advertising adjacent network domain of DS-TE information | |
| CN101714940A (en) | Path-calculating and establishing methods and path-calculating element, nodes and network | |
| CN103650453B (en) | The method communicated in path computation element communication protocol and network equipment | |
| CN102571530A (en) | Inter-domain link status information processing method and PCE | |
| US10992573B2 (en) | Multi-layer LSP control method and apparatus | |
| CN103004149B (en) | For the method in certainty equivalents path in a network, network equipment and system | |
| CN104753778A (en) | Cross-domain path processing method and cross-domain path processing device | |
| CN106470160B (en) | Information transmission method and network node | |
| CN118827505A (en) | Force calculation routing method and device, node equipment and network equipment | |
| CN117135769A (en) | Network connection recovery method and device, network node and controller |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20080806 |