CN102026051B - Layered virtual topology-based cross-granularity layer survivability method - Google Patents
Layered virtual topology-based cross-granularity layer survivability method Download PDFInfo
- Publication number
- CN102026051B CN102026051B CN201010585269.2A CN201010585269A CN102026051B CN 102026051 B CN102026051 B CN 102026051B CN 201010585269 A CN201010585269 A CN 201010585269A CN 102026051 B CN102026051 B CN 102026051B
- Authority
- CN
- China
- Prior art keywords
- wavelength
- wavestrip
- granularity
- granularity layers
- layers
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention relates to a layered virtual topology-based cross-granularity layer survivability method. The using state of waveband and wavelength resources in a network is reflected through layered virtual topology; by applying a layered routing mechanism and comparing the service bandwidth requirement with a threshold value, services are divided into high-bandwidth services and low-bandwidth services; the high-bandwidth services are routed in a waveband granularity layer, and the low-bandwidth services are routed in a wavelength granularity layer, so that the bandwidth requirement can be automatically met when the shortest path is found for the high-bandwidth services; meanwhile, the rate of idle waveband resources occupied by the low-bandwidth services is reduced; and by applying a joint routing mechanism, paths meeting the service requirement can be found in more complete network resources.
Description
Technical field
The invention belongs to the communications field, be specifically related to a kind of survivability method of striding granularity layers based on the layering virtual topology that is applicable to have in the multiple size light network business of different bandwidth demand.
Background technology
Along with the rapid growth of message volume and the continuous maturation of WDM technology, number of wavelengths that can be integrated in same optical fiber also constantly increases.Improve so on the one hand the utilance of fiber resource, also increased on the other hand cost and the complexity of OXC node, reduced its reliability.Many granularity exchanges comprise wavelength, the exchange of wavestrip and optical fiber.Its core concept is that different wavelength is bundled on wavestrip or the optical fiber, forms an information entity, directly exchanges, and has so just reduced the port scale of node, and has increased handling capacity.
Owing to having the wavelength of One's name is legion in the optical fiber, and wavelength has very high bit rate, so the fault of optical-fiber network can be brought very large impact to network performance.Thereby Study on survivability is significant to optical-fiber network.Survivability mechanism mainly comprises protection mechanism and Restoration Mechanism.Wherein, protection mechanism has very short recovery time, can satisfy all business to the requirement of recovery time, is more studied in optical-fiber network and uses.
Survivability Strategy in current many granularities net still has the following disadvantages:
(1) in the research of multiple size light survivability, mainly be the business for wavelength level, the minority article is the business for the wavestrip level.Do not consider that the service request bandwidth is variable, such as the single or multiple wavelength of service needed or wavestrip.
(2) in the research of multiple size light survivability, do not consider professional bandwidth demand, the business of large bandwidth granularity possibly can't satisfy bandwidth demand after choosing shortest path.
(3) in the Study on survivability in many granularities net, the business of the wide granularity of small band can take the wavestrip of a large amount of free time, consumes a large amount of wavestrip resources.
Summary of the invention
The object of the invention is to solve in many granularities net existing Survivability Strategy at the routing issue to the different bandwidth granularity service, for the service computation shortest path by the time can not satisfy the problem of service bandwidth demand, and the survivability method of striding granularity layers based on the layering virtual topology that improves network resource utilization under the wide granularity service request of small band.
The objective of the invention is to be achieved through the following technical solutions, at first be creating a mechanism of layering virtual topology, it is with the number of physical network according to wavestrip, be divided into separate in logic subnet, each subnet comprises the wavelength in this wavestrip, set up the layering virtual topology according to wavelength and wavestrip granularity, i.e. wavelength granularity layers and wavestrip granularity layers; Next is the layered routing mechanism of different bandwidth demand business, this mechanism has been set a threshold values, the bandwidth demand of business is compared with threshold values, if bandwidth demand is greater than threshold values, use dijkstra's algorithm to calculate shortest path from the wavestrip granularity layers, if bandwidth demand is less than threshold values, from wavelength granularity layers calculating K bar shortest path, then calculate the bandwidth at the resulting K paths of wavelength granularity layers, namely in each subnet, satisfy the wavelength available number that the wavelength continuity requires, choose and satisfy and near the path of service bandwidth demand; Be the joint route mechanism of striding granularity layers again, if said method does not find the path that satisfies the demands, associating wavestrip granularity layers and wavelength granularity layers calculating K bar shortest path, and calculate the bandwidth in each path are chosen and are satisfied and near the path of business demand; The calculating of protection route at last; if operating path is in the wavestrip granularity layers; then remove corresponding wavestrip link; at the wavestrip layer or stride granularity layers and calculate the protection route, if operating path is in wavelength layer, then remove corresponding wavelength span; at wavelength layer with stride granularity layers and calculate the protection route; stride granularity layers if operating path is in, then remove corresponding wavelength and wavestrip link, striding granularity layers calculating protection route.
Described layering virtual topology is by the wavestrip granularity layers, and the virtual link of wavelength granularity layers and interlayer forms.The wavestrip granularity layers is by the wavestrip node, and the wavestrip link forms.The wavelength granularity layers is comprised of wavelength node and wavelength span, and has removed the wavelength span corresponding with the wavestrip link, and the wavelength granularity layers is a multilayer figure, comprises a plurality of separate wavelength virtual topology layers.Coupled together by virtual link between wavestrip node and the wavelength node.
Described for the professional layered routing mechanism of different bandwidth demand, to judge according to the service bandwidth granularity, the business that band is wider than threshold values the wavestrip granularity layers calculate shortest path by, bandwidth less than the business of threshold values wavelength granularity layers calculating K bar shortest path by, and selected bandwidth is the most approaching and the path of satisfying business demand.
Described joint route mechanism, when said method does not find suitable path, will unite wavestrip granularity layers and wavelength granularity layers calculating K bar shortest path by, and selected bandwidth is the most approaching and the path of satisfying business demand.Operating path method for building up in this mechanism is as follows:
The S101 netinit makes up virtual topology figure;
S102 is professional to arrive, and the T-γ value of calculating if calculate gained T-γ＞0, turns S103, otherwise turns S104, and wherein T is the required number of wavelengths of service request bandwidth, the threshold values of γ for setting;
S103 the wavestrip granularity layers of each wavestrip subnet calculate shortest path by;
S104 the wavelength granularity layers calculating K bar shortest path of each subnet by, and calculate the WBP in each path
x(1＜X＜| value B|) and P
X(P
X=WBP
x-T) value, wherein X is the ordering number of wavestrip subnet, | B| is contained wavestrip number in the optical fiber, WBP
xIn being the wavestrip subnet of X, sequence number satisfies the wavelength available number of wavelength continuity constraint for the path;
S105 judges whether to find shortest path in the wavestrip granularity layers, finds to turn S107, otherwise turns S108:
S106 judges whether to exist and makes P
X＞0 path turns S109 if exist, otherwise turns S108;
The Work route that S107 meets service request calculates successfully;
S108 associating wavelength and wavestrip granularity layers calculating K bar shortest path by, and calculate the WBP in each path
x(1＜X＜| value B|) and P
XValue;
The Work route that S109 meets service request calculates successfully;
The present invention has reflected that by the virtual topology of layering wavestrip and the wavelength resource in the network uses state; The applying hierarchical routing mechanism, comparison by service bandwidth demand and threshold values, business is divided into two types of large bandwidth and little bandwidth, large band width service will be in wavestrip granularity layers route, little band width service is in wavelength granularity layers route, make large band width service when finding shortest path, automatically satisfy bandwidth demand, reduced simultaneously little band width service taking idle wavestrip resource; Use joint route mechanism can seek to satisfy business demand under more complete Internet resources path.
Description of drawings
Fig. 1 is performing step of the present invention;
Fig. 2 is layering route and joint route mechanism flow chart;
In the literary composition: T, the required number of wavelengths of service request bandwidth; The threshold values of γ, setting; The sequence number of X, wavestrip subnet; | contained wavestrip number in B|, the optical fiber; WBPP
x, every paths satisfies the number of wavelengths of the wavelength condition of continuity in each wavestrip subnet; P
X, WBP
xDifference with T.
Fig. 3 is the schematic diagram during this algorithm is given an example;
Fig. 4 is the schematic diagram during this algorithm performance is analyzed.
Embodiment
The present invention will be further described below in conjunction with accompanying drawing.
Performing step of the present invention as shown in Figure 1, the below describes performing step of the present invention in detail.
(1) the layering virtual topology creates a mechanism
The layering virtual topology is by the wavestrip granularity layers, and the virtual link of wavelength granularity layers and interlayer forms.The wavestrip granularity layers is by the wavestrip node, and the wavestrip link forms.The wavelength granularity layers is comprised of wavelength node and wavelength span, and has removed the wavelength span corresponding with the wavestrip link, and the wavelength granularity layers is a multilayer figure, comprises a plurality of separate wavelength virtual topology layers.Coupled together by virtual link between wavestrip node and the wavelength node.
(2) for the layered routing mechanism of different bandwidth demand business
Judge according to the service bandwidth granularity, the business that band is wider than threshold values the wavestrip granularity layers calculate shortest path by, bandwidth less than the business of threshold values wavelength granularity layers calculating K bar shortest path by, and selected bandwidth is the most approaching and the path of satisfying business demand.
(3) joint route mechanism
If the appeal method does not find suitable path, will unite wavestrip granularity layers and wavelength granularity layers calculating K bar shortest path by, and selected bandwidth is the most approaching and the path of satisfying business demand.For the layered routing mechanism of different bandwidth demand business and joint route mechanism flow chart as shown in Figure 2, step is as follows:
The S101 netinit makes up virtual topology figure;
S102 is professional to arrive, and the T-γ value of calculating if calculate gained T-γ＞0, turns S103, otherwise turns S104, and wherein T is the required number of wavelengths of service request bandwidth, the threshold values of γ for setting;
S103 the wavestrip granularity layers of each wavestrip subnet calculate shortest path by;
S104 the wavelength granularity layers calculating K bar shortest path of each subnet by, and calculate the WBP in each path
x(1＜X＜| value B|) and P
X(P
X=WBP
x-T) value, wherein X is the ordering number of wavestrip subnet, | B| is contained wavestrip number in the optical fiber, WBP
xIn being the wavestrip subnet of X, sequence number satisfies the wavelength available number of wavelength continuity constraint for the path;
S105 judges whether to find shortest path in the wavestrip granularity layers, finds to turn S107, otherwise turns S108;
S106 judges whether to exist and makes P
X＞0 path turns S109 if exist, otherwise turns S108;
The Work route that S107 meets service request calculates successfully;
S108 associating wavelength and wavestrip granularity layers calculating K bar shortest path by, and calculate the WBP in each path
x(1＜X＜| value B|) and P
XValue;
The Work route that S109 meets service request calculates successfully;
(4) obtain operating path after, remove respective link, calculate in the same way again Protection path.
Specific embodiment
For better interpretation algorithms, provide an example among Fig. 3.Fig. 3 (a) expression physical network topology structure.And suppose to contain in the optical fiber two wavestrip B1, B2, each wavestrip contains 3 wavelength.Make 5 professional S (0,3,2), S (2,4,1), S (3,5,3), S (1,7,1), S (0,6,2) arrives successively.Wherein in S (s, d, T), s represents source node, and d represents destination node, and T is professional bandwidth Grained Requirements.
After S (0,3,2) arrives, be in initial condition in the network, taking of resource do not arranged, all wavestrip links are in equal idle condition.Distribute 0-1-2-3 as operating path, in Fig. 3 (b), use _ _ _ expression; 0-5-4-3 is as backup path, and use _ ._._ represents in Fig. 3 (b).While wavestrip granularity layers link 0-1-2-3,0-5-4-3 is removed from the wavestrip granularity layers, and adds respective link in λ 3 wavelength virtual topology layers.
The professional granularity of S (2,4,1) is 1, will at first use K bar shortest path in wavelength granularity layers route.Distribution 2-3-4 is operating path, and 2-1-0-5-4 is backup path.
S (3,5,3) granularity is 3, will be successively from two subnet B1, and the wavestrip granularity layers among the B2 uses shortest-path method to seek the path.Shown in Fig. 3 (d), among the wavestrip B2 _ _ _ lines are expressed as its assignment path.Among the wavestrip B 1 _ the ._._ lines represent is backup path for its distribution.
Fig. 3 (e) has then described the operating path of S (1,7,1) and the distribution condition of backup path.
For professional S (0,6,2), all do not satisfy the path of its demand in wavestrip granularity layers and wavelength granularity layers, therefore between two-layer, seek the path.Among Fig. 3 (f) _ _ _ representing operating path, the 0-5-7 in this path is in the wavestrip granularity layers, connects through the virtual link between wavestrip node 7 and the wavelength node 7, and then the 0-7 by the wavelength granularity layers arrives point of destination._ ._._ has then represented backup path.
The following describes the performance of this method:
At first, for large band width service will the wavestrip granularity layers calculate shortest path by, because wavestrip granularity layers chain route idler band consists of, when finding suitable path, bandwidth demand can satisfy automatically.When if the service bandwidth request is the wide granularity of small band, will at wavelength granularity layers calculating K bar shortest path, calculate again the WBP of every paths
xAnd P
xValue, then choose so that Px get minimum on the occasion of the path, namely found the path of satisfying bandwidth demand.
Secondly, the business of large bandwidth has improved the probability that finds active path preferentially from wavelength granularity layers route.If directly seek K bar shortest path from physical topology or wavelength virtual topology layer, then just exist the path probability that satisfies Grained Requirements lower.Take Fig. 4 as example.Professional source node and destination node are respectively 1 and 3.In physical topology, use respectively _ _ _, _ ._._ and marked 3 shortest paths.Suppose that professional bandwidth demand is a wavestrip.If in the K bar shortest path, get K=2, when namely only finding 2 shortest paths, bandwidth demand can't be satisfied in the path that _ ._._ lines represent.
Again, preferentially seek the path from the wavelength granularity layers for the business of smaller particle size, can reduce like this use to idle wavestrip.Such as Fig. 3 (c), shown in 3 (d), professional S (3,5,3) uses path 2-3-4 and the 2-1-0-5 of wavelength granularity layers, saved wavestrip, thereby professional S (2,4,1) can use the path of 3-6-7-5 as backup path.
At last, when said method can't find suitable path, will unite wavestrip granularity layers and wavelength granularity layers and calculate route, and because stride the use Internet resources that the route of granularity layers can be complete, avoid professional and in individual layer, can not find appropriate resources and be rejected.Just showed such example among Fig. 3 (f).
The foundation of wavestrip granularity layers can obtain by the calculating to the wavelength virtual topology in the wavestrip, and computational complexity is 0 (n), and wherein the n network is nodes.But (computational complexity of θ＞γ) significantly reduces so that the business of large bandwidth granularity.At first, only need to calculate in the wavestrip granularity layers, the relative wavelength topological layer, the network number that needs to process is reduced to
Secondly, need not to consider to calculate the gained path and whether satisfy bandwidth demand, only need use shortest path to calculate route, K bar shortest path complexity greatly reduces relatively.
The invention provides a kind of survivability method of striding granularity layers based on the layering virtual topology, network is divided into separate subnet according to wavestrip, each subnet comprises the wavelength in this wavestrip, sets up the layering virtual topology according to wavelength and wavestrip granularity, i.e. wavelength granularity layers and wavestrip granularity layers; The applying hierarchical routing mechanism, comparison according to service bandwidth demand and threshold values, business is divided into large band width service and little band width service, large band width service is in wavestrip granularity layers route, little band width service is in wavelength granularity layers route, make large band width service when finding shortest path, automatically satisfy bandwidth demand, and reduced little band width service taking idle wavestrip resource; Use joint route mechanism and then can between wavelength granularity layers and wavestrip granularity layers, cross-layer calculate the path of satisfying business demand.
Claims (2)
1. based on the survivability method of striding granularity layers of layering virtual topology, it is characterized in that may further comprise the steps:
1) at first is the foundation of layering virtual topology, with the number of physical network according to wavestrip, be divided into separate in logic subnet, each subnet comprises the wavelength in this wavestrip, set up the layering virtual topology according to wavelength and wavestrip granularity, this virtual topology is comprised of the virtual link of wavelength granularity layers, wavestrip granularity layers and interlayer;
Described wavestrip granularity layers is comprised of wavestrip node and wavestrip link, and described wavelength granularity layers is comprised of wavelength node and wavelength span;
2) secondly, the foundation of the layered routing mechanism of different bandwidth demand business, namely set a threshold values, the bandwidth demand of business is compared with threshold values, if bandwidth demand is greater than threshold values, use dijkstra's algorithm to calculate shortest path from the wavestrip granularity layers, if bandwidth demand is less than threshold values, from wavelength granularity layers calculating K bar shortest path, then calculate the bandwidth at the resulting K paths of wavelength granularity layers, namely in each subnet, satisfy the wavelength available number that the wavelength continuity requires, choose and satisfy and near the path of service bandwidth demand;
3) then, stride the foundation of the joint route mechanism of granularity layers, if step 2) do not find the path that satisfies the demands, then unite wavestrip granularity layers and wavelength granularity layers calculating K bar shortest path, and calculate the bandwidth in each path, choose and satisfy and near the path of business demand; The calculating of protection route at last; if operating path is in the wavestrip granularity layers; then remove corresponding wavestrip link; in the wavestrip granularity layers or stride granularity layers and calculate the protection route, if operating path is in the wavelength granularity layers, then remove corresponding wavelength span; in the wavelength granularity layers with stride granularity layers and calculate the protection route; stride granularity layers if operating path is in, then remove corresponding wavelength and wavestrip link, striding granularity layers calculating protection route.
2. the survivability method of striding granularity layers based on the layering virtual topology according to claim 1, it is characterized in that: described wavelength granularity layers has been removed the wavelength span corresponding with the wavestrip link, the wavelength granularity layers is a multilayer figure, comprise a plurality of separate wavelength virtual topology layers, connected by virtual link between wavestrip node and the wavelength node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010585269.2A CN102026051B (en) | 2010-12-13 | 2010-12-13 | Layered virtual topology-based cross-granularity layer survivability method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010585269.2A CN102026051B (en) | 2010-12-13 | 2010-12-13 | Layered virtual topology-based cross-granularity layer survivability method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102026051A CN102026051A (en) | 2011-04-20 |
| CN102026051B true CN102026051B (en) | 2013-01-02 |
Family
ID=43866808
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010585269.2A Expired - Fee Related CN102026051B (en) | 2010-12-13 | 2010-12-13 | Layered virtual topology-based cross-granularity layer survivability method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102026051B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102355608B (en) * | 2011-06-30 | 2013-10-30 | 南京邮电大学 | Improved method for fault recovery of multi-granularity optical network based on GMPLS |
| CN102355464B (en) * | 2011-10-10 | 2013-11-06 | 西安交通大学 | Construction method of survivable Overlay network |
| CN102523155B (en) * | 2011-12-08 | 2015-03-25 | 中国电力科学研究院 | Boost Graph library-based K shortest path searching method and system |
| CN103457663B (en) | 2012-06-01 | 2018-08-28 | 中兴通讯股份有限公司 | path establishment method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101155137A (en) * | 2006-09-25 | 2008-04-02 | 华为技术有限公司 | Method for confirming routing path and its confirming unit |
| CN101515886A (en) * | 2008-11-07 | 2009-08-26 | 西安交通大学 | Multi-domain optical network survivability method based on identification of reliable service |
| CN101873271A (en) * | 2010-06-29 | 2010-10-27 | 西安交通大学 | Business-driven cross-layer survivability method in multilayer network |
-
2010
- 2010-12-13 CN CN201010585269.2A patent/CN102026051B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101155137A (en) * | 2006-09-25 | 2008-04-02 | 华为技术有限公司 | Method for confirming routing path and its confirming unit |
| CN101515886A (en) * | 2008-11-07 | 2009-08-26 | 西安交通大学 | Multi-domain optical network survivability method based on identification of reliable service |
| CN101873271A (en) * | 2010-06-29 | 2010-10-27 | 西安交通大学 | Business-driven cross-layer survivability method in multilayer network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102026051A (en) | 2011-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101052235B (en) | Business combing method and device for ASON special protection | |
| US10069570B2 (en) | Multi-layer modem reclamation systems and methods | |
| CN101883293B (en) | Method and device for realizing K optimal path algorithm under condition of multiple sides among neighboring nodes | |
| EP2058986A1 (en) | A method for determining a routing path and a routing path determination unit | |
| CN101611592A (en) | The dynamic routing of the light signal in the optical-fiber network | |
| CN102026051B (en) | Layered virtual topology-based cross-granularity layer survivability method | |
| CN102546440B (en) | Routing and wavelength assignment method and system | |
| CN110061859B (en) | SDN controller deployment method based on user survivability condition constraint | |
| CN101478705B (en) | Survivable service flow conducting method based on interlayer message routing | |
| CN105978811B (en) | A kind of route selecting method and device based on business transmission | |
| CN106506362B (en) | A kind of elastic optical network multilink fault probability guard method of minimum failure risk loss | |
| CN101459589B (en) | Method and device for distributing network resource | |
| CN101741717A (en) | Conditional risk separation degree-based multiple domain network routing method | |
| CN105007223A (en) | Optical network dynamic multicast routing wavelength allocation method based on optical hierarchical structure | |
| CN102025615B (en) | Method and device for planning paths of small-granularity services in optical communication network | |
| CN103200468A (en) | Method and device of route wavelength allocation of electric power optical fiber communication network | |
| Guo et al. | Multicast multi-granular grooming based on integrated auxiliary grooming graph in optical networks | |
| Huang et al. | A scalable path protection mechanism for guaranteed network reliability under multiple failures | |
| CN103997458B (en) | Node cost optimal route selection method based on optical-electrical hybrid cross-connection | |
| WO2012103852A2 (en) | Method and device for wavelength-division multiplexing network planning | |
| CN103259590B (en) | A kind of light multicast static P circle segment protection method of jumping section based on 2 | |
| CN101873271B (en) | Business-driven cross-layer survivability method in multilayer network | |
| CN101715150A (en) | Wavelength assignment algorithm with capacity relative minimum influence | |
| Vadrevu et al. | Survivable IP topology design with re-use of backup wavelength capacity in optical backbone networks | |
| 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20130102 Termination date: 20151213 |
|
| EXPY | Termination of patent right or utility model |