CN102006527A - Path calculation method based on PCE in optical network - Google Patents
Path calculation method based on PCE in optical network Download PDFInfo
- Publication number
- CN102006527A CN102006527A CN2010105484686A CN201010548468A CN102006527A CN 102006527 A CN102006527 A CN 102006527A CN 2010105484686 A CN2010105484686 A CN 2010105484686A CN 201010548468 A CN201010548468 A CN 201010548468A CN 102006527 A CN102006527 A CN 102006527A
- Authority
- CN
- China
- Prior art keywords
- path
- wavelength
- professional
- business
- wavelength available
- 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.)
- Granted
Links
Images
Abstract
The invention discloses a path calculation method based on a PCE in an optical network. The PCE path calculation process comprises the following steps of: dividing N services in a buffer into a group for uniform processing; calculating the shortest path of each service and carrying out wavelength reservation; sequentially checking whether the shortest path and a pre-request service have link overlapping when a post-request service path is failed in the calculation, if yes, regulating the path of the pre-request service; and analogically, finally enabling the service paths as much as possible to be calculated successfully. On the basis of considering the influence on the post-request service by the pre-request service and considering the influence on the pre-request service by the post-request service, the invention reduces the possibility of wavelength distribution conflict to a certain extent so as to achieve the aims of reducing service blocking rate and improving resource utilization rate in the optical network.
Description
Technical field
The present invention relates to ASON (Automatically Switched OpticalNetworks, ASON) technical field, be specifically related in a kind of optical-fiber network path calculation method based on PCE (PathComputation Element, path-calculating element).
Background technology
In optical-fiber network, business does not arrive simultaneously, elder generation asks and the problem of back request and exist, and the path that calculates for each business all can take corresponding wavelength resource when carrying out Wavelength reservation, like this, the professional available wavelength resource in subsequent calculations path will be less relatively, thereby make that its blocking rate relatively can be than higher.
Traditional path calculation method is in the path computing process, be followed successively by each business in proper order according to arrival and carry out path computing, at every turn with its shortest path as operating path, carry out path computing in the wavelength resource that requested service choosing formerly is left for back requested service calculating path the time, the then back requested service self-blocking if back requested service conflicts with first requested service generation Wavelength Assignment, this method can only guarantee that first requested service chooses optimal path, but the path computing success rate of back requested service is then relatively low, blocking rate raises in the optical-fiber network thereby cause, and has influenced network performance.
Summary of the invention
(1) technical problem that will solve
The technical problem to be solved in the present invention is: how to provide a kind of and can reduce the possibility that the Wavelength Assignment conflict takes place, thereby reach the reduction service blocking rate, improve in the optical-fiber network of resource utilization in the optical-fiber network path calculation method based on PCE simultaneously.
(2) technical scheme
For solving the problems of the technologies described above, the invention provides in a kind of optical-fiber network based on the path calculation method of PCE, may further comprise the steps:
S101, in the buffer of path-calculating element PCE, business is carried out buffer memory,, the business of top n request is taken out when number of services reaches after N, simultaneously described buffer continues to receive business after this, wherein, for each business, need calculate a paths for it;
S102, the top n business that processing is taken out from described buffer, when handling, the wavelength available collection of this moment is designated as the first wavelength available collection, newly-built one second wavelength available collection, before path computing begins the second wavelength available collection being composed is the first wavelength available collection, the sequencing that arrives according to business carries out shortest path calculating for each business under the represented network resource status of the second wavelength available collection then, be that it is at the concentrated Wavelength reservation that carries out of second wavelength available after each service path calculates and finishes, the rest may be inferred, finishes path computing and Wavelength reservation up to whole N business;
If the path computing of the professional i of S103 failure, then, calculates professional i for carrying out shortest path under the represented network resource status of the first wavelength available collection, if path computing is still failed, perhaps successful still first wavelength available of path computing is concentrated and is not existed idle wavelength that it is reserved successfully, and then professional i blocks; If concentrating, the path computing success and first wavelength available exist idle wavelength that it is reserved successfully, the shortest path that then calculates under the represented network resource status of the first wavelength available collection for professional i is selected a wavelength, finding out the shortest path of selected link and professional i in i-1 the business of front then has the business of overlapping and selected consistent wavelength, adjust these professional links backward successively in the past, after finishing, continue next professional path computing, finish up to N service path calculating, wherein N 〉=i 〉=1;
N business of next group request handled in S104, continuation.
Wherein, in step S102 and S103, it is to carry out under the situation of considering traffic engineering that shortest path calculates, concentrating the Wavelength reservation that carries out at second wavelength available is to carry out under the situation of consideration consistent wavelength, but the Wavelength reservation of this moment only is the mark of doing for resource situation for path computing, and the Wavelength reservation in the real physical link need go to realize by signaling;
Wherein, in step S102, if the failure of the path computing of professional i, then professional i blocks;
Wherein, in step S102, if still Wavelength reservation failure of the path computing of professional i success, then professional i blocks;
Wherein, among the step S103, when the shortest path that calculates under the represented network resource status of the first wavelength available collection for professional i is selected wavelength, at first find out selected path of professional i and front i-1 all overlapping link of professional selected link, add up then and concentrate these overlapping links at second wavelength available all have taken the ripple trombone of wavelength, in the selected Path selection second wavelength available collection 2 of professional i in these overlapping links that wavelength of occupied least number of times.
Wherein, among the step S103, for before with professional i the business reorganization path of path overlap and selected consistent wavelength being arranged, at first be the second wavelength available collection and have the professional selected link of path overlap and selected consistent wavelength to back up with professional i, recover used when failing with the adjustment of path, convenient back, concentrate the shared wavelength of the link that these are professional to discharge at second wavelength available, then the shortest path that under the represented network resource status of the first wavelength available collection, calculates for professional i according to selected wavelength before at the concentrated Wavelength reservation that carries out of second wavelength available.
Wherein, in step S103,, under the represented network resource status of the second wavelength available collection, carry out shortest path and calculate being that professional a adjusts in the process in path, after finishing for this reason shortest path carry out resource reservation.In the process in path that is professional i adjustment front business, if any one service path calculates failure or Wavelength reservation failure, then adjust and end, and professional i blocks, return to path before the path of for professional i adjusting first requested service with front i-1 professional path this moment, and the second wavelength available collection is returned to the path state before of adjusting first requested service for professional i.
(3) beneficial effect
Method of the present invention has considered that back requested service influences first requested service, when the requested service path computing failure of back, solve link overlap problem between business by the path of adjusting first requested service, on the basis that guarantees the success of first requested service path computing, increased the probability of back requested service path computing success, reduced the possibility that the Wavelength Assignment conflict takes place to a certain extent, thereby reached the reduction service blocking rate, improved the purpose of the utilance of optical-fiber network medium wavelength resource simultaneously.
Description of drawings
Fig. 1 is a method flow diagram of the present invention;
Fig. 2 is an employed network topology structure schematic diagram in the method for the embodiment of the invention;
Fig. 3 is traditional path computation policies sequential chart, and these computational methods are also used the network topology of Fig. 2;
Fig. 4 is the path calculation method sequential chart of the embodiment of the invention.
Embodiment
For making purpose of the present invention, content and advantage clearer, embodiment of the present invention is described further in detail below in conjunction with accompanying drawing.
The present invention is directed in the path computing process because back requested service and the overlapping business obstruction that brings of the link of first requested service, proposed in a kind of optical-fiber network path calculation method based on PCE.The present invention considers that the success or not of back requested service path computing and the path computation policies of first requested service have much relations, when the requested service path computing failure of back, solve link overlap problem between business by the path of adjusting first requested service, on the basis that guarantees the success of first requested service path computing, increase the probability of back requested service path computing success, reduced the service blocking rate in the network.
Traditional path computation policies is generally according to business arrival order, carry out path computing backward in the past, guaranteeing that first requested service finds on the basis of shortest path, for the only path computing result's decision thus time of the success or not of back requested service path computing, so just guaranteed that first requested service can find shortest path, saved Internet resources, but obviously its path computing priority is lower for the requested service of back, can't guarantee the path computing success rate of back requested service.Under the circumstances, in order to improve the path computing success rate of back requested service, the present invention adopts the strategy of adjusting the selected path of first requested service, when the overlapping generation of link, by adjusting the path of first requested service, avoided with the link of back requested service overlappingly, made and the path computing success of the back requested service that some block so just improved the success rate of all service path calculating under the legacy paths calculative strategy.
Fig. 1 is the flow chart of the embodiment of the invention, comprises the steps:
S101, in the buffer of path-calculating element PCE, business is carried out buffer memory,, the business of top n request is taken out when number of services reaches after N, simultaneously described buffer continues to receive business after this, wherein, for each business, need calculate a paths for it;
S102, the top n business that processing is taken out from described buffer, when handling, the wavelength available collection of this moment is designated as the first wavelength available collection, newly-built one second wavelength available collection, before path computing begins the second wavelength available collection being composed is the first wavelength available collection, the sequencing that arrives according to business carries out shortest path calculating for each business under the represented network resource status of the second wavelength available collection then, each service path calculates to be finished the back and carries out Wavelength reservation for it in that second wavelength available is concentrated, and the rest may be inferred finishes path computing and Wavelength reservation up to whole N business;
If the path computing of the professional i of S103 failure, then, calculates professional i for carrying out shortest path under the represented network resource status of the first wavelength available collection, if path computing is still failed, perhaps the path computing success and first wavelength available are concentrated and are not existed idle wavelength that it is reserved successfully, and then professional i blocks; If concentrating, the path computing success and first wavelength available exist idle wavelength that it is reserved successfully, the shortest path that then calculates under the represented network resource status of the first wavelength available collection for professional i is selected a wavelength, finding out the shortest path of selected link and professional i in i-1 the business of front then has the business of overlapping and selected consistent wavelength, adjust these professional links backward successively in the past, after finishing, continue next professional path computing and finish, wherein N 〉=i 〉=1 up to N service path calculating;
N business of next group request handled in S104, continuation.
In step S102 and S103, it is to carry out under the situation of considering traffic engineering that shortest path calculates, concentrating the Wavelength reservation that carries out at second wavelength available is to carry out under the situation of consideration consistent wavelength, but the Wavelength reservation of this moment only is the mark of doing for resource situation for path computing, and the Wavelength reservation in the real physical link need go to realize by signaling;
In step S102, if the failure of the path computing of professional i, then professional i blocks;
In step S102, if still Wavelength reservation failure of the path computing of professional i success, then professional i blocks;
Among the step S103, when the shortest path that calculates under the represented network resource status of the first wavelength available collection for professional i is selected wavelength, at first find out selected path of professional i and front i-1 all overlapping link of professional selected link, add up then and concentrate these overlapping links at second wavelength available all have taken the ripple trombone of wavelength, concentrate on that wavelength of occupied least number of times in these overlapping links for selected Path selection second wavelength available of professional i.
Among the step S103, for before with professional i the business reorganization path of path overlap and selected consistent wavelength being arranged, at first be the second wavelength available collection and have the professional selected link of path overlap and selected consistent wavelength to back up with professional i, recover used when failing with the adjustment of path, convenient back, and concentrate the shared wavelength of the link that these are professional to discharge at second wavelength available, then the shortest path that under the represented network resource status of the first wavelength available collection, calculates for professional i according to selected wavelength before at the concentrated Wavelength reservation that carries out of second wavelength available.
In step S103, being that professional a adjusts in the process in path, under the represented network resource status of the second wavelength available collection, carry out shortest path and calculate, after finishing for this reason shortest path carry out resource reservation.In the process in path that is professional i adjustment front business, if any one service path calculates failure or Wavelength reservation failure, then adjust and end, and professional i blocks, return to path before the path of for professional i adjusting first requested service with front i-1 professional path this moment, and the second wavelength available collection is returned to the path state before of adjusting first requested service for professional i.
Fig. 2 is the network topology schematic diagram of the embodiment of the invention, comprises five nodes of A～F.As shown in Figure 2, the wavelength in the present embodiment in the link has λ 1, λ 2, λ 3, but at the λ 1 of all links of path computing process with λ 2 is occupied (is shown as in Fig. 2
λ 1With
λ 2), existing only surplus wavelength X 3 can be used.Professional number arrives at 2 o'clock and handles in the buffer of tentative PCE, has two business (being respectively first requested service S1 and back requested service S2) to need to handle now in the buffer, and they ask the path between an A-F and the D-E respectively.
Fig. 3 is the situation under the traditional path computing pattern, in the path of at first calculating after the request of receiving between the A-F.Because A-B-D-E-F and A-B-C-E-F are the shortest paths of this moment, so select the possibility of two paths all to exist, if select the former also promptly as shown in Figure 3, the path of so professional S2 request will not have available resources, it is the path computing failure, so professional S2 blocks, do not consider the demand of back requested service in the path computing process of S1, thereby make Internet resources fully not to be utilized, when the demand of requested service then is unpredictable, thereby so just need be under known back requested service path computing result's situation adjusting the path computing result of first requested service, we make all successes of both path computing, so the present invention proposes N uniform service processing.
Fig. 4 has illustrated path computing flow process of the present invention among the embodiment, professional number in buffer arrives at 2 o'clock and begins to handle, the first wavelength available collection and the second wavelength available collection of this moment are { A-B (λ 3), B-C (λ 3), B-D (λ 3), C-E (λ 3), D-E (λ 3), E-F (λ 3) } (wherein, the idle wavelength of this section of A-B (λ 3) expression A-B link is λ 3, in the set implication of other element the rest may be inferred), every section link wherein is two-way link, at first calculates the shortest path of S1 under the represented network resource status of the second wavelength available collection, gets shortest path A-B-D-E-F, so if S1 selects A-B-D-E-F and reserves, this moment, the second wavelength available collection became { B-C (λ 3), C-E (λ 3) }, then S2 calculating path failure under the represented network resource status of the second wavelength available collection, so carrying out path computing under the represented network resource status of the first wavelength available collection, S2 obtains D-E, for it selects wavelength X 3.There is overlapping and selected consistent wavelength in the path of finding professional S1 with it, at first back up the second wavelength available collection and the selected path of professional S1, the wavelength resource that takies is concentrated in the path that discharges S1 then at second wavelength available, for concentrating at second wavelength available, S1 carries out Wavelength reservation, so the second wavelength available collection becomes { A-B (λ 3), B-C (λ 3), B-D (λ 3), C-E (λ 3), E-F (λ 3) }.Again obtain path A-B-C-E-F for first requested service S1 carries out path computing under the represented network resource status of the second wavelength available collection, it is λ 3 that resource reservation is selected wavelength.So two service path calculating all can be successful.The business that continues as the back request is then carried out path computing.
Need to prove, in more than describing, A-B-D-E-F and A-B-C-E-F are all the shortest path of S1, if to select path A-B-C-E-F then in the process of the path computing of S2, not have above adjustment process at the very start, to suppose in order saying something just that herein it selects path A-B-D-E-F with regard to direct selection D-E.
By foregoing description as can be seen, in traditional path computation policies, can consider the shortest problem in path, but can't make the resource conflict problem of back requested service and first requested service be well solved, thereby caused in network, still have resource can with situation under request path computing failure is but arranged, thereby make blocking rate high, wasted Internet resources.And the scheme that the present invention proposes, under the situation of back requested service path computing failure, by adjusting the selected path of first requested service, solved the link overlap problem, in the path computing success rate that guarantees to have improved on the basis that first requested service path computing can be successful back requested service, this scheme has not only improved utilization rate of network resource thus, can also reduce business block rate simultaneously.
This method will be carried out the path adjustment for first requested service in the path computing process, so complexity of the present invention can increase, but consider the demand that reduces blocking rate in PCE powerful computing ability and the network, the raising of this complexity or acceptable.
Above execution mode only is used to illustrate the present invention; and be not limitation of the present invention; the those of ordinary skill in relevant technologies field; under the situation that does not break away from the spirit and scope of the present invention; can also make various variations and modification; therefore all technical schemes that are equal to also belong to category of the present invention, and scope of patent protection of the present invention should be defined by the claims.
Claims (7)
- In the optical-fiber network based on the path calculation method of PCE, it is characterized in that, may further comprise the steps:S101, in the buffer of path-calculating element PCE, business is carried out buffer memory,, the business of top n request is taken out when number of services reaches after N, simultaneously described buffer continues to receive business after this, wherein, for each business, need calculate a paths for it;S102, the top n business that processing is taken out from described buffer, when handling, the wavelength available collection of this moment is designated as the first wavelength available collection, newly-built one second wavelength available collection, before path computing begins the second wavelength available collection being composed is the first wavelength available collection, the sequencing that arrives according to business carries out shortest path calculating for each business under the represented network resource status of the second wavelength available collection then, be that it is at the concentrated Wavelength reservation that carries out of second wavelength available after each service path calculates and finishes, the rest may be inferred, finishes path computing and Wavelength reservation up to whole N business;If the path computing of the professional i of S103 failure, then, calculates professional i for carrying out shortest path under the represented network resource status of the first wavelength available collection, if path computing is still failed, perhaps successful still first wavelength available of path computing is concentrated and is not existed idle wavelength that it is reserved successfully, and then professional i blocks; If concentrating, the path computing success and first wavelength available exist idle wavelength that it is reserved successfully, the shortest path that then calculates under the represented network resource status of the first wavelength available collection for professional i is selected a wavelength, finding out the shortest path of selected link and professional i in i-1 the business of front then has the business of overlapping and selected consistent wavelength, adjust these professional links backward successively in the past, after finishing, continue next professional path computing, finish up to N service path calculating, wherein N 〉=i 〉=1;N business of next group request handled in S104, continuation.
- 2. the method for claim 1, it is characterized in that, in step S102 and S103, it is to carry out under the situation of considering traffic engineering that shortest path calculates, and concentrating the Wavelength reservation that carries out at second wavelength available is to carry out under the situation of consideration consistent wavelength.
- 3. the method for claim 1 is characterized in that, in step S102, if the failure of the path computing of professional i, then professional i blocks.
- 4. the method for claim 1 is characterized in that, in step S102, if still Wavelength reservation failure of the path computing of professional i success, then professional i blocks.
- 5. according to claim 1, it is characterized in that, among the step S103, when the shortest path that calculates under the represented network resource status of the first wavelength available collection for professional i is selected wavelength, at first find out selected path of professional i and front i-1 all overlapping link of professional selected link, add up then and concentrate these overlapping links at second wavelength available all have taken the ripple trombone of wavelength, concentrate on that wavelength of occupied least number of times in these overlapping links for selected Path selection second wavelength available of professional i.
- 6. the method for claim 1, it is characterized in that, among the step S103, for before with professional i the business reorganization path of path overlap and selected consistent wavelength being arranged, at first be the second wavelength available collection and have the professional selected link of path overlap and selected consistent wavelength to back up with professional i, and concentrate the shared wavelength of the link that these are professional to discharge at second wavelength available, then the shortest path that under the represented network resource status of the first wavelength available collection, calculates for professional i according to selected wavelength before at the concentrated Wavelength reservation that carries out of second wavelength available.
- 7. as each described method of claim 1～6, it is characterized in that, in step S103, be that professional a adjusts in the process in path, carrying out shortest path under the represented network resource status of the second wavelength available collection calculates, after finishing for this reason shortest path carry out resource reservation, in the process in path that is professional i adjustment front business, if any one service path calculates failure or Wavelength reservation failure, then adjust and end, and professional i blocks, return to path before the path of for professional i adjusting first requested service with front i-1 professional path this moment, and the second wavelength available collection is returned to the path state before of adjusting first requested service for professional i.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010548468 CN102006527B (en) | 2010-11-17 | 2010-11-17 | Path calculation method based on PCE in optical network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201010548468 CN102006527B (en) | 2010-11-17 | 2010-11-17 | Path calculation method based on PCE in optical network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102006527A true CN102006527A (en) | 2011-04-06 |
| CN102006527B CN102006527B (en) | 2013-05-01 |
Family
ID=43813530
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201010548468 Active CN102006527B (en) | 2010-11-17 | 2010-11-17 | Path calculation method based on PCE in optical network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102006527B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102348138A (en) * | 2011-11-10 | 2012-02-08 | 北京邮电大学 | Collision avoidance wavelength assignment method based on PCE (Personal Computer Equipment) |
| CN103023780A (en) * | 2012-12-06 | 2013-04-03 | 中兴通讯股份有限公司 | Method and device for routing computation |
| WO2016000365A1 (en) * | 2014-06-30 | 2016-01-07 | 中兴通讯股份有限公司 | Method and apparatus for path computation |
| CN106452980A (en) * | 2013-06-28 | 2017-02-22 | 华为技术有限公司 | Time-based business processing method and apparatus |
| WO2017063486A1 (en) * | 2015-10-15 | 2017-04-20 | 华为技术有限公司 | Route and wavelength assignment method and device |
| CN113596630A (en) * | 2021-05-17 | 2021-11-02 | 北京邮电大学 | Routing resource allocation method and device for hybrid grid optical network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090046738A1 (en) * | 2007-08-16 | 2009-02-19 | Futurewei Technologies, Inc. | Methods for Characterizing Optical Switches and Multiplexers/Demultiplexers |
| CN101605280A (en) * | 2009-07-10 | 2009-12-16 | 北京邮电大学 | Dual-route computing unit system based on multi-layer multi-domain optical network |
| CN101610433A (en) * | 2009-07-10 | 2009-12-23 | 北京邮电大学 | The multi-constraint condition routing selection method that a kind of support policy is resolved |
| CN101808254A (en) * | 2010-02-12 | 2010-08-18 | 重庆邮电大学 | Static routing and wavelength allocation method based on layered graph |
| CN101873249A (en) * | 2009-04-27 | 2010-10-27 | 华为技术有限公司 | Method and device for computing service transmission path in optical transport network |
-
2010
- 2010-11-17 CN CN 201010548468 patent/CN102006527B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090046738A1 (en) * | 2007-08-16 | 2009-02-19 | Futurewei Technologies, Inc. | Methods for Characterizing Optical Switches and Multiplexers/Demultiplexers |
| CN101873249A (en) * | 2009-04-27 | 2010-10-27 | 华为技术有限公司 | Method and device for computing service transmission path in optical transport network |
| CN101605280A (en) * | 2009-07-10 | 2009-12-16 | 北京邮电大学 | Dual-route computing unit system based on multi-layer multi-domain optical network |
| CN101610433A (en) * | 2009-07-10 | 2009-12-23 | 北京邮电大学 | The multi-constraint condition routing selection method that a kind of support policy is resolved |
| CN101808254A (en) * | 2010-02-12 | 2010-08-18 | 重庆邮电大学 | Static routing and wavelength allocation method based on layered graph |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102348138A (en) * | 2011-11-10 | 2012-02-08 | 北京邮电大学 | Collision avoidance wavelength assignment method based on PCE (Personal Computer Equipment) |
| CN102348138B (en) * | 2011-11-10 | 2014-03-19 | 北京邮电大学 | Collision avoidance wavelength assignment method based on PCE (Personal Computer Equipment) |
| CN103023780A (en) * | 2012-12-06 | 2013-04-03 | 中兴通讯股份有限公司 | Method and device for routing computation |
| CN103023780B (en) * | 2012-12-06 | 2017-11-28 | 中兴通讯股份有限公司 | A kind of route computing method and device |
| CN106452980A (en) * | 2013-06-28 | 2017-02-22 | 华为技术有限公司 | Time-based business processing method and apparatus |
| CN106452980B (en) * | 2013-06-28 | 2019-11-15 | 华为技术有限公司 | Time-based method for processing business and device |
| WO2016000365A1 (en) * | 2014-06-30 | 2016-01-07 | 中兴通讯股份有限公司 | Method and apparatus for path computation |
| WO2017063486A1 (en) * | 2015-10-15 | 2017-04-20 | 华为技术有限公司 | Route and wavelength assignment method and device |
| CN106603405A (en) * | 2015-10-15 | 2017-04-26 | 华为技术有限公司 | Routing and wavelength assignment method and device |
| CN106603405B (en) * | 2015-10-15 | 2020-02-14 | 华为技术有限公司 | Routing and wavelength allocation method and device |
| CN113596630A (en) * | 2021-05-17 | 2021-11-02 | 北京邮电大学 | Routing resource allocation method and device for hybrid grid optical network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102006527B (en) | 2013-05-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102006527B (en) | Path calculation method based on PCE in optical network | |
| CN110505082B (en) | NFV service chain mapping method oriented to cost and QoS | |
| US8675493B2 (en) | Routing bandwidth guaranteed paths with local restoration in label switched networks | |
| CN111901170B (en) | Reliability-aware service function chain backup protection method | |
| CN106572019B (en) | Time delay guarantee hybrid SDN energy-saving flow scheduling method | |
| CN105357124B (en) | A kind of MapReduce bandwidth optimization methods | |
| CN110223174B (en) | Block transaction accounting method and system, data processing terminal and block chain system | |
| CN114071582A (en) | Service chain deployment method and device for cloud-edge collaborative Internet of things | |
| CN108737268B (en) | Software-defined industrial Internet of things resource scheduling method | |
| WO2012019404A1 (en) | Path calculating method and device | |
| CN100446472C (en) | Method for returning service route | |
| CN102065006B (en) | Method for recovering inter-domain failure of cross-domain label switched path | |
| CN103188147A (en) | Path establishment method and system | |
| CN110086870A (en) | The parallel method for reliable transmission of the multipath of data-oriented central site network | |
| KR20150080183A (en) | Method and Apparatus for dynamic traffic engineering in Data Center Network | |
| CN101222429B (en) | System and method for managing exchange capacity of transmission network equipment | |
| CN105337832A (en) | Resource distribution method for on-line multicast virtual network | |
| CN101719793A (en) | System for access control of unidirectional light bus network based on priority level dynamic regulation | |
| WO2015039554A1 (en) | Wson-based wavelength-continuity constraint reduction method | |
| CN115550173A (en) | Dynamic calculation communication scheduling method based on WFBP and link characteristics | |
| US9160649B2 (en) | Method for routing traffic using traffic weighting factors | |
| CN102026051A (en) | Layered virtual topology-based cross-granularity layer survivability method | |
| CN1707978B (en) | Method and apparatus for obtaining constrained path of loose routing in intelligent optical network | |
| CN113824650B (en) | Parameter transmission scheduling algorithm and system in distributed deep learning system | |
| CN102348138B (en) | Collision avoidance wavelength assignment method based on PCE (Personal Computer Equipment) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |