CN102006527B - Path calculation method based on PCE in optical network - Google Patents
Path calculation method based on PCE in optical network Download PDFInfo
- Publication number
- CN102006527B CN102006527B CN 201010548468 CN201010548468A CN102006527B CN 102006527 B CN102006527 B CN 102006527B CN 201010548468 CN201010548468 CN 201010548468 CN 201010548468 A CN201010548468 A CN 201010548468A CN 102006527 B CN102006527 B CN 102006527B
- Authority
- CN
- China
- Prior art keywords
- path
- service
- wavelength
- available
- services
- 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.)
- Active
Links
- 238000004364 calculation method Methods 0.000 title claims abstract description 27
- 230000003287 optical effect Effects 0.000 title claims abstract 4
- 238000000034 method Methods 0.000 claims abstract description 31
- 230000008569 process Effects 0.000 claims abstract description 20
- 230000000903 blocking effect Effects 0.000 abstract description 9
- 239000013307 optical fiber Substances 0.000 description 9
- 239000012141 concentrate Substances 0.000 description 6
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 108091034117 Oligonucleotide Proteins 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 230000008521 reorganization Effects 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 230000011664 signaling Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000000205 computational method Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Optical Communication System (AREA)
Abstract
本发明公开了一种光网络中基于PCE的路径计算方法。在PCE路径计算过程中将缓存器中的每N个业务分为一组统一处理，计算出每个业务的最短路径并进行波长预留，当后请求的业务路径计算失败时，依次检查其最短路径是否与先请求业务有链路重叠，若有链路重叠，则为先请求业务进行路径调整，依此类推，最终使尽量多的业务路径计算成功。本发明在考虑先请求业务对后请求业务影响的基础上，通过考虑后请求业务对先请求业务的影响，在一定程度上降低了波长分配冲突发生的可能性，从而达到了降低业务阻塞率，同时提高光网络中资源利用率的目的。
The invention discloses a PCE-based path calculation method in an optical network. In the PCE path calculation process, every N services in the buffer are divided into a group for unified processing, and the shortest path of each service is calculated and wavelength reservation is performed. When the calculation of the later requested service path fails, the shortest path is checked in turn. Whether the path overlaps with the first requested service. If there is a link overlap, the path is adjusted for the first requested service, and so on, so that as many service paths as possible can be successfully calculated. On the basis of considering the impact of the first request service on the later request service, the present invention reduces the possibility of wavelength allocation conflicts to a certain extent by considering the impact of the later request service on the first request service, thereby reducing the service blocking rate. At the same time, the purpose of improving resource utilization 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 the path calculation method based on PCE (PathComputation Element, path-calculating element).
Background technology
In optical-fiber network, business does not arrive simultaneously, and exist first the problem of request and rear request, and be that path that each service computation goes out can take corresponding wavelength resource when carrying out Wavelength reservation, like this, the professional available wavelength resource in subsequent calculations path will be relatively less, thereby so that its blocking rate relatively can be higher.
Traditional path calculation method is in the path computing process, sequentially be followed successively by each business 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 formerly requested service choosing is left for rear requested service calculating path the time, requested service self-blocking if rear requested service conflicts then with first requested service generation Wavelength Assignment after, this method can only guarantee that first requested service chooses optimal path, but the path computing success rate of rear requested service is then relatively low, blocking rate raises in the optical-fiber network thereby cause, and has affected network performance.
Summary of the invention
The technical problem that (one) 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 occurs, thereby reach the reduction service blocking rate, improve simultaneously in the optical-fiber network of resource utilization in the optical-fiber network path calculation method based on PCE.
(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, when number of services reaches after N, the business of top n request is taken out, simultaneously described buffer continues to receive business after this, wherein, for each business, need to calculate a paths for it;
S102, the top n that processing is taken out from described buffer is professional, when processing, the wavelength available collection of this moment is designated as the first wavelength available collection, newly-built second a wavelength available collection, before path computing begins the second wavelength available collection being composed is the first wavelength available collection, then the sequencing that arrives according to business carries out shortest path for each business and calculates under the represented network resource status of the second wavelength available collection, be that it is at the concentrated Wavelength reservation that carries out of the second wavelength available after each service path calculates and finishes, the rest may be inferred, until all N business finished path computing and Wavelength reservation;
If the path computing of the professional i of S103 failure, then for carrying out shortest path under the represented network resource status of the first wavelength available collection, calculates professional i, if path computing is failure still, perhaps successful still the first wavelength available of path computing is concentrated and is not existed free wavelength that it is reserved successfully, and then professional i blocks; If concentrating, path computing success and the first wavelength available exist free 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, then finding out the shortest path of selected link and professional i in i-1 the business of front has the business of overlapping and selected consistent wavelength, adjust successively from front to back these professional links, after finishing, continue next professional path computing, until calculating, finish N service path, wherein N 〉=i 〉=1;
N business of next group request processed in S104, continuation.
Wherein, in step S102 and S103, it is to carry out in the situation of considering traffic engineering that shortest path calculates, concentrating the Wavelength reservation that carries out at the 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 to 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 the selected path of professional i and front i-1 all overlapping link of professional selected link, then add up and concentrate these overlapping links at the second wavelength available all have taken the ripple trombone of wavelength, in selected Path selection the 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 during with the failure of convenient back route adjust, concentrate the shared wavelength of the link that these are professional to discharge at the second wavelength available, the shortest path that then calculates under the represented network resource status of the first wavelength available collection for professional i according to selected wavelength before at the concentrated Wavelength reservation that carries out of the second wavelength available.
Wherein, 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.
(3) beneficial effect
Method of the present invention has considered that rear requested service affects first requested service, when rear requested service path computing failure, solve link overlap problem between business by the path of adjusting first requested service, increased the probability of rear requested service path computing success on the basis that guarantees the success of first requested service path computing, reduced to a certain extent the possibility that the Wavelength Assignment conflict occurs, thereby reached the reduction service blocking rate, improved simultaneously the purpose of the utilance of optical-fiber network medium wavelength resource.
Description of drawings
Fig. 1 is method flow diagram of the present invention;
Fig. 2 is 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 rear requested service and the overlapping business obstruction that brings of the link of first requested service, proposed in a kind of optical-fiber network the path calculation method based on PCE.The present invention considers that the success or not of rear requested service path computing and the path computation policies of first requested service have much relations, when rear requested service path computing failure, solve link overlap problem between business by the path of adjusting first requested service, increase the probability of rear requested service path computing success on the basis that guarantees the success of first requested service path computing, reduced the service blocking rate in the network.
Traditional path computation policies is generally according to business arrival order, carry out from front to back path computing, guaranteeing that first requested service finds on the basis of shortest path, for the success or not of rear requested service path computing only the path computing result thus the time determine, so just guaranteed that first requested service can find shortest path, saved Internet resources, but obviously its path computing priority is lower for rear requested service, can't guarantees the path computing success rate of rear requested service.Under the circumstances, in order to improve the path computing success rate of rear 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 rear requested service overlapping so that the path computing of some rear requested services that block under legacy paths calculative strategy success has so just improved the success rate of all service path calculating.
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, when number of services reaches after N, the business of top n request is taken out, simultaneously described buffer continues to receive business after this, wherein, for each business, need to calculate a paths for it;
S102, the top n that processing is taken out from described buffer is professional, when processing, the wavelength available collection of this moment is designated as the first wavelength available collection, newly-built second a wavelength available collection, before path computing begins the second wavelength available collection being composed is the first wavelength available collection, then the sequencing that arrives according to business carries out shortest path for each business and calculates under the represented network resource status of the second wavelength available collection, concentrate at the second wavelength available for it after each service path calculates and finishes and carry out Wavelength reservation, the rest may be inferred until whole N business finished path computing and Wavelength reservation;
If the path computing of the professional i of S103 failure, then for carrying out shortest path under the represented network resource status of the first wavelength available collection, calculates professional i, if path computing is failure still, perhaps path computing success and the first wavelength available are concentrated and are not existed free wavelength that it is reserved successfully, and then professional i blocks; If concentrating, path computing success and the first wavelength available exist free 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, then finding out the shortest path of selected link and professional i in i-1 the business of front has the business of overlapping and selected consistent wavelength, adjust successively from front to back these professional links, after finishing, continue next professional path computing until N service path calculating is finished, wherein N 〉=i 〉=1;
N business of next group request processed in S104, continuation.
In step S102 and S103, it is to carry out in the situation of considering traffic engineering that shortest path calculates, concentrating the Wavelength reservation that carries out at the 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 to 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 the selected path of professional i and front i-1 all overlapping link of professional selected link, then add up and concentrate these overlapping links at the 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 the 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 during with the failure of convenient back route adjust, and concentrate the shared wavelength of the link that these are professional to discharge at the second wavelength available, the shortest path that then calculates under the represented network resource status of the first wavelength available collection for professional i according to selected wavelength before at the concentrated Wavelength reservation that carries out of the 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 link has λ 1, λ 2, λ 3, but at the λ 1 of all links of path computing process and λ 2 occupied (in Fig. 2, being shown as
λ 1With
λ 2), existing only surplus wavelength X 3 can be used.Professional number arrives at 2 o'clock and processes in the buffer of tentative PCE, has now two business (being respectively first requested service S1 and rear requested service S2) to need to process in the buffer, and they ask respectively the path between an A-F and the D-E.
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 namely as shown in Figure 3, the path of so professional S2 request will be without available resources, it is the path computing failure, so professional S2 blocks, do not consider the demand of rear requested service in the path computing process of S1, thereby so that Internet resources can not fully be utilized, when the demand of requested service then is unpredictable, thereby so we just need to be in known rear requested service path computing result's situation adjust so that all successes of both path computing the path computing result of first requested service, 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 process, 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 free 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 under the represented network resource status of the second wavelength available collection, calculate the shortest path of S1, get 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, then the wavelength resource that takies is concentrated in the path that discharges S1 at the second wavelength available, for concentrating at the 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.Then the business that continues as the back request is 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 then there is not above adjustment process in selecting paths A-B-C-E-F with regard to direct selection D-E in the process of the path computing of S2 at the very start, just suppose its selecting paths A-B-D-E-F herein in order to say something.
Can find out by foregoing description, in traditional path computation policies, can consider the shortest path problem, but can't so that the resource conflict problem of rear 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 so that blocking rate is high, Internet resources have been wasted.And the scheme that the present invention proposes, in the situation of rear requested service path computing failure, by adjusting the selected path of first requested service, solved the link overlap problem, guaranteeing that first requested service path computing can successful basis have improved the path computing success rate of rear requested service, this scheme has not only improved the utilance of Internet resources thus, can also reduce professional blocking rate simultaneously.
This method will be carried out route adjust 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 computing capability that PCE is powerful and the network, the raising of this complexity or acceptable.
Above execution mode only is used for explanation the present invention; and be not limitation of the present invention; the those of ordinary skill in relevant technologies field; in the situation that does not break away from the spirit and scope of the present invention; can also make a variety of changes 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)
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 CN102006527A (en) | 2011-04-06 |
| CN102006527B true 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) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102348138B (en) * | 2011-11-10 | 2014-03-19 | 北京邮电大学 | Collision avoidance wavelength assignment method based on PCE (Personal Computer Equipment) |
| CN103023780B (en) * | 2012-12-06 | 2017-11-28 | 中兴通讯股份有限公司 | A kind of route computing method and device |
| ES2748168T3 (en) * | 2013-06-28 | 2020-03-13 | Huawei Tech Co Ltd | Time-based service processing method and device |
| CN105282023B (en) * | 2014-06-30 | 2020-04-24 | 中兴通讯股份有限公司 | Method and device for calculating path |
| CN106603405B (en) * | 2015-10-15 | 2020-02-14 | 华为技术有限公司 | Routing and wavelength allocation method and device |
| CN113596630B (en) * | 2021-05-17 | 2022-11-15 | 北京邮电大学 | Routing resource allocation method and device for hybrid grid optical network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101605280A (en) * | 2009-07-10 | 2009-12-16 | 北京邮电大学 | Dual-routing computing unit system based on multi-layer multi-domain optical network |
| CN101610433A (en) * | 2009-07-10 | 2009-12-23 | 北京邮电大学 | A multi-constraint routing selection method supporting policy resolution |
| 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 calculating service transmission path in optical transport network |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8249451B2 (en) * | 2007-08-16 | 2012-08-21 | Futurewei Technologies, Inc. | Methods for characterizing optical switches and multiplexers/demultiplexers |
-
2010
- 2010-11-17 CN CN 201010548468 patent/CN102006527B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101873249A (en) * | 2009-04-27 | 2010-10-27 | 华为技术有限公司 | Method and device for calculating service transmission path in optical transport network |
| CN101605280A (en) * | 2009-07-10 | 2009-12-16 | 北京邮电大学 | Dual-routing computing unit system based on multi-layer multi-domain optical network |
| CN101610433A (en) * | 2009-07-10 | 2009-12-23 | 北京邮电大学 | A multi-constraint routing selection method supporting policy resolution |
| CN101808254A (en) * | 2010-02-12 | 2010-08-18 | 重庆邮电大学 | Static routing and wavelength allocation method based on layered graph |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102006527A (en) | 2011-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102006527B (en) | Path calculation method based on PCE in optical network | |
| CN110505082B (en) | A Cost- and QoS-Oriented NFV Service Chain Mapping Method | |
| CN108965014B (en) | QoS-aware service chain backup method and system | |
| CN104993941B (en) | One kind is based on Openflow network high fault tolerance virtual network mapping algorithms | |
| CN102238443A (en) | Method for establishing cross-domain path meeting wavelength-continuity constraints | |
| CN103731277A (en) | Energy-saving method in software defined network and energy-saving control device | |
| CN101552934A (en) | Optical internet cross-domain reliable route calculating method based on PCE backtracking recursion | |
| WO2012019404A1 (en) | Path calculating method and device | |
| Liu et al. | Parallel probing: Dynamic and constant time setup procedure in circuit switching NoC | |
| CN102098596B (en) | Route establishing method and device in optical network | |
| CN103828311B (en) | A kind of heavy-route sequential program(me) method and system | |
| CN115237580A (en) | Intelligent computing-oriented pipeline parallel training adaptive adjustment system and method | |
| CN108600098B (en) | A Scheduling Method for Multiple Variable Paths and Fixed Bandwidth in High Performance Networks | |
| CN110276689A (en) | Realization method of smart contract based on dynamic decision | |
| CN101360347B (en) | Route selection method for wavelength routing optical network | |
| CN110086870A (en) | The parallel method for reliable transmission of the multipath of data-oriented central site network | |
| CN101610432A (en) | A Signaling Implementation Method Supporting Cooperative Path Computing of Group Computing Units | |
| CN116258197B (en) | Distributed training acceleration method and system based on parameter calculation and communication scheduling | |
| JP7554871B2 (en) | Method and apparatus for adding additional chains to a blockchain, and shard generation method and apparatus therefor | |
| JP2011023003A (en) | Device and method for distributed execution of digital data processing operations | |
| US9160649B2 (en) | Method for routing traffic using traffic weighting factors | |
| CN115550173A (en) | Dynamic calculation communication scheduling method based on WFBP and link characteristics | |
| CN117857424A (en) | Data scheduling method, device, equipment and computer readable storage medium | |
| 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 |