[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN102638404A - Optical network protection resource allocation method based on service differentiation - Google Patents

Optical network protection resource allocation method based on service differentiation Download PDF

Info

Publication number
CN102638404A
CN102638404A CN2012101005056A CN201210100505A CN102638404A CN 102638404 A CN102638404 A CN 102638404A CN 2012101005056 A CN2012101005056 A CN 2012101005056A CN 201210100505 A CN201210100505 A CN 201210100505A CN 102638404 A CN102638404 A CN 102638404A
Authority
CN
China
Prior art keywords
service
path
shortest
link
current
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
Application number
CN2012101005056A
Other languages
Chinese (zh)
Other versions
CN102638404B (en
Inventor
沈建华
梁俊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Nanyou Information Industry Technology Research Institute Co Ltd
Original Assignee
Nanjing Post and Telecommunication University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing Post and Telecommunication University filed Critical Nanjing Post and Telecommunication University
Priority to CN201210100505.6A priority Critical patent/CN102638404B/en
Publication of CN102638404A publication Critical patent/CN102638404A/en
Application granted granted Critical
Publication of CN102638404B publication Critical patent/CN102638404B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses an optical network protection resource allocation method based on service differentiation. According to the optical network protection resource allocation method based on service differentiation, all kinds of services in an optical network are divided into high-level services, middle-level services and low-level services according to priority levels; and when a service request arrives, an operating path is dynamically selected through judging the real-time load of a link, and the sharing of the protection paths of all levels of services is realized. The optical network protection resource allocation method based on service differentiation disclosed by the invention has the advantages that the high-level services have low blocking rate and short service transfer time in an optical network environment with high complexity, and the overall resource utilization rate of the network can also be increased.

Description

Optical network protection resource allocation method based on service differentiation
Technical Field
The invention relates to an optical network, in particular to an optical network protection resource allocation method which grades service and adopts a corresponding protection strategy according to the grade.
Background
Protection is an important method for improving network survivability, and means that when one working channel fails, the working signal is maintained to be normally transmitted through a preset protection channel by using the switching of standby equipment. When a fault occurs, the protection can complete the switching work within 50ms under the control of the local network element or the remote network element, so that the service can be recovered to be normal in time, and the intervention of an external network management system is not needed. Therefore, protection schemes are often adopted for some important services. But once resources are allocated for protection purposes, they cannot be used for rerouting, so its resource utilization is often low.
Aiming at the defect of low resource utilization rate of the traditional protection method, the proposed improvement method comprises the following steps:
the method comprises the following steps: shared channel protection. [ Help.A shared path protection algorithm with traffic grooming capability in WDM mesh networks, proceedings of northeast university, 2003.4 ]. For a working path with two separate links, a protection path may be established with both working paths being link-separated. Because the protection path is only used when the working path fails, as long as two working path links are separated, when a single link fails, the two working paths cannot fail at the same time, and the protection paths corresponding to the two working paths cannot be started at the same time, the protection paths corresponding to the two working paths can share resources, thereby improving the resource utilization rate of the whole network.
The second method comprises the following steps:Pand (4) protecting the ring. Reconfigurable in WDM networkPStudy of Ring model optical communication study, 2008.7]。PThe ring protection method realizes the rapid protection in the grid network through the ring channel preset by idle resources, and simultaneously allows the working channel to select the shortest direct route on the network resource graph.PThe setting of the circle occurs before any network failure and the required real-time switching action is pre-designed.PThe ring not only provides protection against link failures on the ring, but also provides protection against cross-over segment failures. For a protectionPAnd each link is configured with single-time protection resources, double working capacity protection can be realized for a cross-over link, single-time working capacity protection can be realized for a link on the circle, and the resource utilization rate is obviously improved.
In summary, some existing optical network protective methods are directed to improving resource utilization, but ignore differences between services. With the increase of the current service types, the division of the priority of each service also becomes a necessary trend, so that the current protective method cannot effectively distinguish the services.
Disclosure of Invention
The technical problem to be solved by the present invention is to overcome the defects of the existing optical network protection method, and provide an optical network protection resource allocation method based on service differentiation, which adopts a corresponding protection mode according to the difference between services.
The invention solves the technical problems by adopting the following technical scheme.
A method for distributing optical network protection resources based on service differentiation is disclosed, wherein each service is divided into three grades: high-level, medium-level, low-level services; for the newly arrived current service, firstly, a shortest path is found out by adopting a shortest routing algorithm, and the current load of a link where the shortest path is located is considered:
when the current load of the link where the shortest path is located is smaller than a preset first threshold, directly taking the shortest path as a working path of the current service, and searching a shortest path from the remaining paths by using a shortest routing algorithm to serve as a protection path of the current service;
when the current load of the link where the shortest path is located is greater than or equal to a preset first threshold and less than a preset second threshold, if the current service is a medium-level or high-level service, taking the shortest path as a working path of the current service, and searching a shortest path from the remaining paths by using a shortest routing algorithm as a protection path of the current service; if the current service is a low-level service, searching a shortest path from the rest paths by using a shortest routing algorithm as a protection path of the current service, and searching a shortest path from paths except the shortest path and the protection path of the current service by using the shortest routing algorithm as a working path of the current service;
when the current load of the link where the shortest path is located is greater than or equal to a second threshold, if the current service is a high-level service, taking the shortest path as a working path of the current service, and searching a shortest path from the remaining paths by using a shortest routing algorithm as a protection path of the current service; if the current service is a medium-level service, searching a shortest path from the rest paths by using a shortest routing algorithm as a protection path of the current service, and searching a shortest path of which the current load of a link is smaller than a second threshold value from paths except the shortest path and the protection path of the current service by using the shortest routing algorithm as a working path of the current service; if the current service is a low-level service, searching a shortest path from the rest paths by using a shortest routing algorithm as a protection path of the current service, and searching a shortest path of which the current load of a link is smaller than a first threshold value from paths except the shortest path and the protection path of the current service by using the shortest routing algorithm as a working path of the current service;
the link load refers to the proportion of the number of the wavelengths distributed on the link to the total number of the wavelengths of the link; the first and second thresholds satisfy: the first threshold value < the second threshold value < 1.
Preferably, the shortest routing algorithm is Dijkstra shortest routing algorithm. Of course, other shortest routing algorithms, such as the SPFA algorithm (shortest path fast algorithm) and Bellman-Ford algorithm, etc., may be used.
Compared with the prior art, the invention can ensure that the high-grade service (namely the most important service) has lower blocking rate and shorter fault recovery time, and the overall resource utilization rate of the network is also improved.
Drawings
Fig. 1 is a flowchart of a method for allocating optical network protection resources based on service differentiation according to the present invention;
fig. 2 is a flowchart of a specific embodiment, where 1, 2, 3, 4, 5, 6, 7, 8, 9, and 10 are node numbers in an optical network, a solid line with an arrow indicates a working path, and a dotted line with an arrow indicates a protection path.
Detailed Description
The technical scheme of the invention is explained in detail in the following with the accompanying drawings:
the idea of the invention is as follows: when a service request comes, a working path is dynamically selected by judging the real-time load of a link, and protection path sharing among services at all levels is realized. The method ensures that the high-grade service has lower blocking rate and shorter service transmission time in the optical network environment with higher complexity, and improves the utilization rate of the overall network resources.
In the invention, various services in the optical network are divided into three priority levels: high-level services, medium-level services, low-level services. The specific service classification method may be determined according to actual conditions, for example, according to the following methods:
the method comprises the following steps: the relatively important traffic has a higher priority, while the general traffic has a lower priority, divided according to the importance of the traffic. The business of important organizations such as civil aviation, bank, etc. is determined as high-grade business; the business of some companies and organizations is classified as middle-level business; whereas the services of a typical individual user are destined to low-level services.
The second method comprises the following steps: and dividing the sensitivity of the service to the time delay according to the sensitivity of the service to the time delay, wherein the sensitivity of different services to the time delay is different. Some services with higher requirements for delay have higher priority, and services with lower requirements for delay have lower priority. For example, some conversational services have a high requirement on delay and are defined as advanced services; some mails, fax type services generally require time delay and are defined as medium level services; and some background services can accept larger time delay and are determined as low-level services.
The third method comprises the following steps: according to the business service quality division, according to the difference of user payment cost, dividing a high-level user, a medium-level user and a low-level user, and respectively providing different service qualities.
In the present invention, the current load of the link (in terms of load)bExpressed) refers to the ratio of the number of wavelengths used on the link to the total number of wavelengths of the link; the invention presets two link load thresholdspAndqis used to mark the current busy level of the link, andp<q<1。
as shown in fig. 1, the method for allocating optical network protection resources based on service differentiation specifically includes the following steps:
step 1, initializing a network, judging whether a service connection request exists at the current moment, and if the service connection request exists, turning to step 2;
step 2, according to the service connection request, using Dijkstra shortest route algorithm to calculate a shortest link between the source node and the destination node, and investigating the current load of the linkb: if it is notb<pTurning to step 3-1; if it is notq≤b<1Turning to step 3-2; if it is notq≤b<1Turning to step 3-3;
step 3-1 uses the idle resources in the shortest link to allocate a working path for the service connection request, then deletes the shortest link in the network topology, and finds out a shortest path as a protection path of the service by using Dijkstra shortest route algorithm;
step 3-2, judging the grade of the current service, and if the grade is a medium-grade service or a high-grade service, turning to step 3-1; if the service is low-level service, turning to step 3-4;
step 3-3, judging the grade of the current service, and if the grade is a high-grade service, turning to step 3-1; if the service is the medium-grade service, turning to the step 3-5; if the service is a low-level service, turning to step 3-6;
step 3-4 deleting the shortest link and the link passed by the service protection path on the link in the network topology, and finding out a link with the shortest link by using Dijkstra routing algorithmLoad less thanpThe shortest path of the protection link is used as a working path of the current service, and the protection path on the protection link deleted just now is used as a protection path;
step 3-5 deleting the shortest link and the link passed by the service protection path on the link in the network topology, and finding out a link with the load smaller than that of the link by using Dijkstra shortest route algorithmqThe shortest path of the intermediate-level service is used as a working path of the intermediate-level service, and a protection path on the protection link which is just deleted is used as a protection path;
step 3-6 deleting the shortest link and the link passed by the service protection path on the link in the network topology, and finding out a link with the load smaller than that of the link by using Dijkstra shortest route algorithmpThe shortest path of (a) is taken as the working path for the low-level traffic and the protection path on the protection link just deleted is taken as the protection path.
To facilitate understanding of the technical solutions of the present invention by the public, a simpler example is further described below. In the pan-european COST239 network topology shown in fig. 1, there are ten network nodes 0-9. For the selection of the working path and the protection path of each level of service with the source node being 0 and the destination node being 9, the following details are provided:
(1) firstly, the shortest link is calculated to be 0-9 by using the shortest routing algorithm, if the load on the link is less thanpTaking the idle path on the link as a working path, removing the link from 0 to 9, using the shortest routing algorithm to obtain a shortest link from 0 to 8 to 9, and using the idle path of the link as a protection path.
(2) If the link load between 0 and 9 isbSatisfy the following requirementspb<qFor medium and high grade service, the idle path on the 0-9 link is continuously used as the working path, and 0-8-9 is used as the protection link; for low-level traffic, two links, 0-9 and 0-8-9, are removed, and a shortest link, 0-7-6-9, is solved. Judging the link load of 0-7-6-9, if less thanpThen 0-7-6-9 is used as the working path and 0-8-9 is used as the protectionA path. Otherwise, solving the secondary short link 0-5-10-9, and continuously judging the load of the link until finding a link with the load smaller than that of the linkpThe working path is allocated with 0-8-9 as the protection path.
(3) If the load is between 0 and 9, the load is satisfiedqb<1For the high-level service, the link 0-9 is continuously used as a working path, and the link 0-8-9 is used as a protection link; for the medium-level service, two links of 0-9 and 0-8-9 are removed, and a shortest link of 0-7-6-9 is solved. Judging the link load of 0-7-6-9, if less thanqThen 0-7-6-9 is used as the working path and 0-8-9 as the protection path. Otherwise, solving the secondary short link 0-5-10-9, and continuously judging the load of the link until finding a link with the load smaller than that of the linkqThe working path is allocated by the link of (1), and 0-8-9 is taken as a protection path; for low-level service, two links of 0-9 and 0-8-9 are removed to solve the shortest path 0-7-6-9, and the load of the path is judged, if the load is less than the load of the pathpThen this shortest path is used as the working path and 0-8-9 as the protection path. Otherwise, solving the secondary short link 0-5-10-9, and continuously judging the load of the link until finding a link with the load smaller than that of the linkpThe working path is allocated with 0-8-9 as the protection path.
(4) When the working paths of the high, medium and low services have faults, the paths of the services with different levels can be switched to the protection paths 0-8-9.
Therefore, the sharing among the high-level service protection link, the medium-level service protection link and the low-level service protection link is realized, and the higher-level service has more shorter link options, so that the blocking rate and the service transmission time are reduced.

Claims (3)

1. A method for distributing optical network protection resources based on service differentiation is characterized in that various services are divided into three levels: high-level, medium-level, low-level services; for the newly arrived current service, firstly, a shortest path is found out by adopting a shortest routing algorithm, and the current load of a link where the shortest path is located is considered:
when the current load of the link where the shortest path is located is smaller than a preset first threshold, directly taking the shortest path as a working path of the current service, and searching a shortest path from the remaining paths by using a shortest routing algorithm to serve as a protection path of the current service;
when the current load of the link where the shortest path is located is greater than or equal to a preset first threshold and less than a preset second threshold, if the current service is a medium-level or high-level service, taking the shortest path as a working path of the current service, and searching a shortest path from the remaining paths by using a shortest routing algorithm as a protection path of the current service; if the current service is a low-level service, searching a shortest path from the rest paths by using a shortest routing algorithm as a protection path of the current service, and searching a shortest path from paths except the shortest path and the protection path of the current service by using the shortest routing algorithm as a working path of the current service;
when the current load of the link where the shortest path is located is greater than or equal to a second threshold, if the current service is a high-level service, taking the shortest path as a working path of the current service, and searching a shortest path from the remaining paths by using a shortest routing algorithm as a protection path of the current service; if the current service is a medium-level service, searching a shortest path from the rest paths by using a shortest routing algorithm as a protection path of the current service, and searching a shortest path of which the current load of a link is smaller than a second threshold value from paths except the shortest path and the protection path of the current service by using the shortest routing algorithm as a working path of the current service; if the current service is a low-level service, searching a shortest path from the rest paths by using a shortest routing algorithm as a protection path of the current service, and searching a shortest path of which the current load of a link is smaller than a first threshold value from paths except the shortest path and the protection path of the current service by using the shortest routing algorithm as a working path of the current service;
the link load refers to the proportion of the number of the wavelengths distributed on the link to the total number of the wavelengths of the link; the first and second thresholds satisfy: the first threshold value < the second threshold value < 1.
2. The method of claim 1, wherein the shortest routing algorithm is Dijkstra's shortest routing algorithm.
3. The method for allocating optical network protection resources based on service differentiation according to claim 1, wherein the service classification specifically follows the following method:
dividing according to the importance degree of the service, wherein the relatively important service has higher priority, and the general service has lower priority; or,
dividing according to the sensitivity of the service to the time delay, wherein the service with higher time delay requirement has higher priority, and the service with lower time delay requirement has lower priority; or,
according to the service quality division, different service qualities are respectively provided according to different payment fees of users.
CN201210100505.6A 2012-04-09 2012-04-09 Optical network protection resource allocation method based on service differentiation Active CN102638404B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210100505.6A CN102638404B (en) 2012-04-09 2012-04-09 Optical network protection resource allocation method based on service differentiation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210100505.6A CN102638404B (en) 2012-04-09 2012-04-09 Optical network protection resource allocation method based on service differentiation

Publications (2)

Publication Number Publication Date
CN102638404A true CN102638404A (en) 2012-08-15
CN102638404B CN102638404B (en) 2014-07-16

Family

ID=46622657

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210100505.6A Active CN102638404B (en) 2012-04-09 2012-04-09 Optical network protection resource allocation method based on service differentiation

Country Status (1)

Country Link
CN (1) CN102638404B (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103259723A (en) * 2013-06-05 2013-08-21 清华大学 Energy conservation method based on combination of data center network routing and flow preemptive scheduling
CN104796217A (en) * 2014-01-21 2015-07-22 中国联合网络通信集团有限公司 Optical transport network wavelength assignment method and equipment
CN105376111A (en) * 2015-11-13 2016-03-02 百度在线网络技术(北京)有限公司 Resource allocation method and device
CN105577435A (en) * 2015-12-21 2016-05-11 中国联合网络通信集团有限公司 Method and equipment for configuring P-cycles
CN106060682A (en) * 2016-05-27 2016-10-26 深圳大学 Wave band route method based on serial structure layering optical cross connection
CN106453121A (en) * 2016-09-14 2017-02-22 上海烟草集团有限责任公司 Dynamic link load configuration method and system, and server
CN106850378A (en) * 2017-01-05 2017-06-13 华北电力大学 A kind of P suitable for electricity needs response business encloses guard method
CN106992810A (en) * 2017-01-23 2017-07-28 苏州大学 Shared protection route and spectrum allocation method considering joint fault probability constraint

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1661984A (en) * 2004-02-25 2005-08-31 华为技术有限公司 Method for treating multiplexing segments of loop chain in automatic switching optical network
CN101155063A (en) * 2006-09-30 2008-04-02 华为技术有限公司 Service protection method and routing device
CN101515886A (en) * 2008-11-07 2009-08-26 西安交通大学 Multi-domain optical network survivability method based on identification of reliable service

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1661984A (en) * 2004-02-25 2005-08-31 华为技术有限公司 Method for treating multiplexing segments of loop chain in automatic switching optical network
CN101155063A (en) * 2006-09-30 2008-04-02 华为技术有限公司 Service protection method and routing device
CN101515886A (en) * 2008-11-07 2009-08-26 西安交通大学 Multi-domain optical network survivability method based on identification of reliable service

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103259723A (en) * 2013-06-05 2013-08-21 清华大学 Energy conservation method based on combination of data center network routing and flow preemptive scheduling
CN104796217B (en) * 2014-01-21 2019-03-15 中国联合网络通信集团有限公司 A kind of Wavelength allocation method and equipment of optical transport network
CN104796217A (en) * 2014-01-21 2015-07-22 中国联合网络通信集团有限公司 Optical transport network wavelength assignment method and equipment
CN105376111A (en) * 2015-11-13 2016-03-02 百度在线网络技术(北京)有限公司 Resource allocation method and device
CN105376111B (en) * 2015-11-13 2019-04-26 百度在线网络技术(北京)有限公司 Resource allocation methods and device
CN105577435A (en) * 2015-12-21 2016-05-11 中国联合网络通信集团有限公司 Method and equipment for configuring P-cycles
CN106060682B (en) * 2016-05-27 2019-04-19 深圳大学 Wavestrip method for routing based on cascaded structure layering optical cross connect
CN106060682A (en) * 2016-05-27 2016-10-26 深圳大学 Wave band route method based on serial structure layering optical cross connection
CN106453121A (en) * 2016-09-14 2017-02-22 上海烟草集团有限责任公司 Dynamic link load configuration method and system, and server
CN106453121B (en) * 2016-09-14 2019-05-21 上海烟草集团有限责任公司 A kind of link dynamic load configuration method, system and server
CN106850378A (en) * 2017-01-05 2017-06-13 华北电力大学 A kind of P suitable for electricity needs response business encloses guard method
CN106992810A (en) * 2017-01-23 2017-07-28 苏州大学 Shared protection route and spectrum allocation method considering joint fault probability constraint
CN106992810B (en) * 2017-01-23 2020-02-18 苏州大学 Shared protection route and spectrum allocation method considering joint fault probability constraint

Also Published As

Publication number Publication date
CN102638404B (en) 2014-07-16

Similar Documents

Publication Publication Date Title
CN102638404B (en) Optical network protection resource allocation method based on service differentiation
US12095507B2 (en) Multi-layer network system and path setting method in multi-layer network
CN107196854B (en) Data plane exception handling method in software defined network
CN101252494B (en) Equipment and method for sharing traffic load
US20090296572A1 (en) Tunnel establishing method, network node device and network system
US8830825B2 (en) Method and system for priority based (1:1)n ethernet protection
CN102480368B (en) Protecting method and system of aggregation link
EP3430776B1 (en) System and method for communication network service connectivity
CN111355660B (en) Routing determination method and system based on capacity balance and relative time delay
CN110913285B (en) Route distribution method and device
EP2326046A1 (en) Method for realizing permanent ring network protection in mesh network
CN109088822B (en) Data flow forwarding method, device, system, computer equipment and storage medium
CN108965013B (en) System and method for rapidly opening IP and optical network service
CN115632702A (en) Multi-layer protection recovery and resource allocation method for optical network
Ma et al. A fairness-aware dynamic spectrum allocation scheme in elastic optical networks
CN102480411A (en) Reservation method and system for protected bandwidth resources
CN110062301B (en) Routing method, device, equipment and storage medium
Rostami et al. CoSE: A SRLG-disjoint routing algorithm
CN103139005A (en) Method and device for detecting reasonability of network resource allocation
Kim et al. Rapid and efficient protection for all-optical WDM mesh networks
Rak et al. Reliable routing and resource allocation scheme for hybrid RF/FSO networks
Kantarci et al. Adaptive schemes for differentiated availability-aware connection provisioning in optical transport networks
EP2429129B1 (en) Method for network protection and architecture for network protection
CN105847440A (en) Method for reconstructing roundabout path during interruption of wide-area protection communication under heavy load
Ramesh et al. Survivable traffic grooming RWA protocol for WDM networks

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
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20120815

Assignee: Jiangsu Nanyou IOT Technology Park Ltd.

Assignor: Nanjing Post & Telecommunication Univ.

Contract record no.: 2016320000207

Denomination of invention: Optical network protection resource allocation method based on service differentiation

Granted publication date: 20140716

License type: Common License

Record date: 20161109

LICC Enforcement, change and cancellation of record of contracts on the licence for exploitation of a patent or utility model
EC01 Cancellation of recordation of patent licensing contract
EC01 Cancellation of recordation of patent licensing contract

Assignee: Jiangsu Nanyou IOT Technology Park Ltd.

Assignor: Nanjing Post & Telecommunication Univ.

Contract record no.: 2016320000207

Date of cancellation: 20180116

TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20200115

Address after: Room 507, No. 6-3, Xingzhi Road, Nanjing Economic and Technological Development Zone, Nanjing, Jiangsu Province

Patentee after: Nanjing Nanyou Information Industry Technology Research Institute Co. Ltd.

Address before: 210003, No. 66, new exemplary Road, Nanjing, Jiangsu

Patentee before: Nanjing Post & Telecommunication Univ.