CN106911393B - What shared optical path merged appoints multicast service to route minimal frequency light tree generation method - Google Patents
What shared optical path merged appoints multicast service to route minimal frequency light tree generation method Download PDFInfo
- Publication number
- CN106911393B CN106911393B CN201710152592.2A CN201710152592A CN106911393B CN 106911393 B CN106911393 B CN 106911393B CN 201710152592 A CN201710152592 A CN 201710152592A CN 106911393 B CN106911393 B CN 106911393B
- Authority
- CN
- China
- Prior art keywords
- light
- light tree
- frequency spectrum
- tree
- forest
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B10/00—Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
- H04B10/27—Arrangements for networking
- H04B10/272—Star-type networks or tree-type networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0005—Switch and router aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0005—Switch and router aspects
- H04Q2011/0037—Operation
- H04Q2011/0047—Broadcast; Multicast
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0073—Provisions for forwarding or routing, e.g. lookup tables
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/0086—Network resource allocation, dimensioning or optimisation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q11/00—Selecting arrangements for multiplex systems
- H04Q11/0001—Selecting arrangements for multiplex systems using optical switching
- H04Q11/0062—Network aspects
- H04Q2011/009—Topology aspects
- H04Q2011/0096—Tree
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computing Systems (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Appoint multicast service to route minimal frequency light tree generation method based on what shared optical path merged the present invention relates to a kind of, belong to technical field of optical fiber communication, this method is mainly used for the multicast service route transmission of elastic optical internet data central site network.This method devises the frequency spectrum consumption cost value of light tree transmission first, propose a kind of minimal frequency light tree generation method, by comprehensively considering the new influence that branch is added and selects for light tree maximum length and modulation levels, make the smallest light tree transmission of service selection frequency spectrum consumption cost；Then the present invention devises light forest link sharing degree formula, design a kind of light forest merging light tree mechanism based on link sharing degree, when there is business service to terminate to discharge enough resources, the light forest transmission services for the condition that meets are reconfigured to the light tree transmitted over resources that winding-up is discharged.The present invention can be substantially reduced the service bandwidth blocking rate and frequency spectrum fragment of elastic optical internet data central site network, improve the availability of frequency spectrum of network.
Description
Technical field
The invention belongs to technical field of optical fiber communication, are related to a kind of minimum frequency of multicast service routing that shared optical path merges
Compose light tree generation method.
Background technique
In recent years, with cloud computing, extensive scientific algorithm (such as weather forecast, Parallel Design, astrophysics and weather mould
Type), data-centered calculating (high-energy physics and astronomy), interactive mode TV and 3D game, electronics scientific research etc. emergence and
It continues to develop, bandwidth demand is continuously increased between data center.The research report in Cisco company in May, 2013 is pointed out: at 2018
The IP request in the whole world by be more than 1.4ZB threshold, global IP requests to increase in past 5 years with the speed more than four times,
It can also grow at top speed in subsequent 5 years.Up to the present the whole world has more than 500000 data centers, every year with 32%
Speed increases.As data center network scale constantly increases and the continuous growth of flow, business presents high between data center
The features such as bandwidth and high dynamic.The growth of bandwidth resources demand will certainly cause stern challenge to limited bandwidth resources, because
This, meets the transmission performance demand of data center's big data service, becomes one urgent need to resolve of data center's optical interconnection network
Problem.Traditional optical network band width based on wavelength-division multiplex (Wavelength Division Multiplexing, WDM) technology
Partition size is relatively rough, usually 50GHz or 100GHz, is not suitable in data center network flexible more granularity services and asks
It asks, causes a large amount of bandwidth resources waste and business obstruction.Based on light orthogonal frequency division multiplexing (Optical Orthogonal
Frequency Division Multiplexing, O-OFDM) technology, M.Jinno of NTT company et al. was in proposition in 2009
A kind of more flexible optical-fiber network-elastic optical network of bandwidth allocation (Elastic Optical Networks, EONs) is passed
Defeated capacity can reach Tb/s, the minimum 12.5GHz of bandwidth allocation granularity.Elastic optical network by its vast capacity, high bandwidth,
The advantages such as high energy efficiency and flexibility, become a kind of powerful physical-layer techniques effectively support it is mutual between data center network
Connection, elastic optical internet data center also becomes one important application scenarios of elastic optical network.
In elastic optical internet data central site network, for cloud computing, extensive scientific algorithm, interactive mode TV, 3D game,
The business such as electronics scientific research, individual data center are no longer satisfied requirement, and a business generally requires multiple data center's collaborations
Processing.Appoint multicast (Manycast) that there is single source node, multiple dynamic destination nodes can be from multiple candidate destination nodes
Most suitable several destination node service requests are selected according to network resource conditions, support the hair of data center network well
Exhibition.For appointing multicast, researchers have done many researchs, but most of researchs are to appoint QoS routing in research WDM network
Frequency spectrum assignment problem is no longer satisfied the demand of data center network development, therefore between research elastic optical internet data center
The routing frequency spectrum assignment problem of multicast service is appointed to have very important significance.
In elastic optical network, basic problem be routing frequency spectrum assignment problem, i.e., when service dynamic reach after, network according to
The source destination node and resource situation of service request calculate suitable path and modulation levels for business, and according to modulation levels
Appropriate frequency spectrum resource is distributed with business size.For appointing multicast service, also main includes that routing and frequency spectrum distribute two stages.
In routing phase, due to appointing multicast that there are multiple destination nodes to need in order to which business is transferred to each destination node from source node
Establishing using source node is root, using each destination node as the light tree of leaf.Problem is established for light tree, there are new branches for research at present
During light tree is added, only considers the optimal of new addition branch, do not account for branch and be added to after sub-light tree to whole light
The influence for setting modulation levels and frequency spectrum consumption sum etc., after branch is added to sub-light tree, can be such that the maximum length of whole light tree becomes
Long, business will use lower modulation levels when transmitting on light tree, to consume more frequency spectrum resource, therefore having very much must
Design new light tree generation method.It is whole since elastic optical network spectral continuity and consistency limit in frequency spectrum allocated phase
Light tree needs to meet spectral continuity and consistency, and the modulation etc. of whole light tree is determined according to light tree maximum length
Grade, suitable frequency spectrum blocks transmission services are selected according to frequency spectrum resource situation and business size.Multicast service dynamic in office reaches
With leave, light tree constantly establish with remove during, can make the frequency spectrum in path that fragmentation be presented, these are lesser, it is isolated not
Continuous frequency spectrum fragment cannot be utilized by subsequent business.When heavier loads, multicast service is appointed to be difficult by the transmission of light tree
Available resources are found, so that business be made to block, increase network blocking probability, reduce network performance.Therefore, how to reduce frequency spectrum broken
Piece and bandwidth blocking rate improve the availability of frequency spectrum, have for the development of elastic optical internet data central site network very important
Meaning.
Summary of the invention
In view of this, the purpose of the present invention is to provide what a kind of shared optical path merged, and multicast service to be appointed to route minimal frequency
Light tree generation method improves the availability of frequency spectrum for reducing the bandwidth blocking rate and frequency spectrum fragment in network.
In order to achieve the above objectives, the invention provides the following technical scheme:
A kind of multicast service routing minimal frequency light tree generation method that shared optical path merges, in the method, design
The frequency spectrum of light tree transmission consumes cost value, by comprehensively considering the new branch that is added for light tree maximum length and modulation levels choosing
The influence selected makes the smallest light tree transmission of service selection frequency spectrum consumption cost；
This method specifically includes the following steps:
Step 1: candidate destination node being grouped simultaneously label according to destination node number needed for business, successively calculates source section
Point arrives the light tree of every group of destination node, generates candidate light tree；
Step 2: the frequency spectrum of every generation light tree of assessment consumes cost value, and the smallest light tree of frequency spectrum consumption cost value is selected to make
For transmission path.
Further, the step 1 is realized especially by following manner: in every candidate light tree calculating process, being counted first
The shortest path for calculating source node first destination node into this group of destination node forms sub-light tree, then successively by this group of purpose section
Remaining destination node is added in sub-light tree in point；During remaining destination node is added to sub-light tree, destination node is calculated
To the shortest path for having generated the upper each node of sub-light tree, select to make sub-light tree frequency spectrum consume the smallest shortest path of cost value as
New branch is added in sub-light tree.
Further, in step 2, the frequency spectrum consumption cost value F is expressed as consumed frequency spectrum when light tree transmission services
Number of resources；In light tree generation phase due to non-transmission services, service rate when calculating frequency spectrum consumption cost value is set as
100Gb/s, after light tree generates, in frequency spectrum allocated phase transmission services, value is service bandwidth request.
Further, the light forest based on link sharing degree is additionally used in the method and merges light tree mechanism, devises light
Forest link sharing angle value, the link sharing degree (Link-sharing spectrum consumption, LSC) are expressed as
The percentage that the spectrum number that common link consumes in light forest accounts for light forest consumption frequency spectrum sum shows light forest when LSC is bigger
The frequency spectrum resource consumed on common link is more, and the biggish smooth forest of LSC is merged on light tree and is transmitted, and can reduce frequency spectrum money
The consumption in source；When there is business service to terminate to discharge enough resources, the light forest transmission services for the condition that meets are reconfigured to
The light tree transmitted over resources that winding-up is discharged；
Specifically includes the following steps:
Step 3: calculating the link sharing angle value for passing through light forest transmission services；
Step 4: selection has identical source node with the business that serviced, and frequency spectrum resource is needed to be less than release resource, and
The minimum light forest of link sharing degree is reconfigured to the light tree transmitted over resources that winding-up is discharged.
The beneficial effects of the present invention are: the present invention devises a kind of appointing in QoS routing most based on the merging of shared optical path
Small frequency spectrum light tree generation method comprehensively considers by a kind of minimal frequency light tree generation method and new branch is added for light tree most
The influence of long length and modulation levels selection makes the smallest light tree transmission of service selection frequency spectrum consumption cost, and passes through one kind
Light forest based on link sharing degree, which merges light tree mechanism, will meet condition when there is business service to terminate to discharge enough resources
Light forest transmission services be reconfigured to the light tree transmitted over resources that winding-up is discharged, to reduce elastic optical internet data
The bandwidth blocking rate and frequency spectrum fragment of central site network, the availability of frequency spectrum for improving network are of great significance.
Detailed description of the invention
In order to keep the purpose of the present invention, technical scheme and beneficial effects clearer, the present invention provides following attached drawing and carries out
Illustrate:
Fig. 1 is elastic optical internet data central site network；
Fig. 2 is light tree generation method example；
Fig. 3 is that light tree is divided into light forest example；
Fig. 4 is the method general flow chart that minimal frequency light tree generates and shared optical path merges；
Fig. 5 is minimal frequency light tree generation method flow chart；
Fig. 6 is that the light forest based on link sharing degree merges light tree mechanism flow chart；
Wherein: Fig. 2 (a) is shown shortest path and appoints multicast light tree generation method, and it is effective that frequency spectrum is shown in Fig. 2 (b)
Appoint multicast light tree generation method, minimal frequency light tree generation method is shown in Fig. 2 (c)；Optimal light tree is shown in Fig. 3 (a)
And the distribution of light tree transmission services frequency spectrum resource is shown in frequency spectrum resource, Fig. 3 (b), 2 stalk tree light forests are shown in Fig. 3 (c)
The transmission of 3 stalk tree light forests is shown in transmission, Fig. 3 (d).
Specific embodiment
Below in conjunction with attached drawing, a preferred embodiment of the present invention will be described in detail.
Minimal frequency light tree generation method in a kind of QoS routing merged based on shared optical path provided by the invention,
When for service request routing, using frequency spectrum consumption cost value as weight, using minimal frequency light tree generation method,
Step 1: candidate destination node being grouped simultaneously label according to destination node number required for business first, is successively counted
Source node is calculated to the light tree of every group of destination node, generates candidate light tree；In every candidate light tree calculating process, source is calculated first
The shortest path of node first destination node into this group of destination node forms sub-light tree, then successively will be in this group of destination node
Remaining destination node is added in sub-light tree；During remaining destination node is added to sub-light tree, destination node is calculated to
The shortest path for generating the upper each node of sub-light tree selects to make the sub-light tree frequency spectrum consumption the smallest shortest path of cost value as new tree
Branch is added in sub-light tree；
Then assess every generation light tree frequency spectrum consumption cost value, select frequency spectrum consume the smallest light tree of cost value as
Transmission path；After candidate light tree generates, preferably the smallest light tree of frequency spectrum consumption cost value carries out FF (First-Fit) method
Frequency spectrum distribution.If business, by light tree transmission services, when not having enough frequency spectrum resources in network, Jiang Guangshu, which is divided into, to be had
The light forest individual transmission of several smaller sub-light tree selects higher modulation levels, reduces frequency spectrum consumption, reduces bandwidth obstruction
Rate.When Jiang Guangshu is divided into the transmission of light forest, light tree is preferentially divided into the less light forest of sub-light tree and is transmitted, if
Less sub-light tree light forest can not transmit, then be transmitted by the more light forest of sub-light tree.If business can not by light forest
Transmission, then business is blocked.
When there is business service to terminate to discharge enough resources, light tree is merged using a kind of light forest based on link sharing degree
Mechanism, calculates the link sharing angle value of forest transmission services first, and selection has identical source node with the business that serviced, needs
Frequency spectrum resource is less than release resource, and the minimum light forest of link sharing degree is reconfigured to the light tree that winding-up is discharged
Transmitted over resources shares the consumption of frequency spectrum resource in optical path between sub-light tree when reducing the transmission of light forest, to be further reduced frequency
Spectrum resource consumption, reduces network bandwidth blocking rate, improves spectrum utilization.
Embodiment:
As shown in Fig. 1 it is elastic optical internet data central site network, is application scenarios of the invention.Elastic optical internet data
The physical topology of central site network is G (V, E), and V represents node set, and each node has BV-WXC in network
(Bandwidth-Variable Wavelength-Cross-Connect) can make signal or more road and hand over signal
Forwarding is changed, E represents link set, any one link maximum bandwidth capacity is indicated with B.There are fixed several data in network
Center, to provide service for business, the switching node in each data center and network has locality connection, connects data center
Switching node is VDC。
One is appointed Measurement Request to be represented by R (s, Dc, k, b), wherein source node is s, Dc={ d1,d2,...,dcIt is one
Serial candidate's destination node, i.e. data center, c are data center's number, i.e. c=| VDC|, k is data required for service business
Center number meets k≤c, bandwidth request b, as unit of frequency spectrum, is denoted as FS (Frequency Slots).Appoint multicast
(Manycast) it is the general type of anycast (Anycast) and multicast (Multicast), compared with anycast, there are multiple dynamics
Destination node, as k=1, R is anycast；Compared with multicast, multiple destination nodes are not in advance it is known that but according to net
Resource situation dynamic in network is selected, and as k=c, R is multicast.
Destination node due to appointing multicast is according to the resource situation in network, dynamically from multiple candidate destination nodes
It selects, therefore, appoints multicast service R (s, D when onec, k, b) generate when, the destination node number k according to needed for business first will
DcIn candidate destination node be grouped and number, every group of k destination node, and every group of destination node is stored in set D
In, as shown in formula 1；Then the candidate light tree of every group of destination node in from source node to D is established respectively again, altogether, this
It is because selecting k from c candidate purpose data center as business service, sub-light tree is added in the generation of light tree and destination node
It is sequentially related.
D={ (d1,d2,...,dk-1,dk),(d1,d2,...,dk-1,dk+1),...(dc-k+1,dc-k+2,...,dc-1,dc)} (1)
It is added in light tree to select optimal branch in light tree generation phase, and in frequency spectrum allocated phase from m
It selects optimal light tree to carry out transmission services in candidate light tree, needs to carry out precisive to light tree cost, the present invention devises light
It sets frequency spectrum and consumes cost value F.F is expressed as consumed frequency spectrum resource number when light tree transmission services.It is worth noting that, in light
Generation phase is set due to non-transmission services, service rate when calculating frequency spectrum consumption cost value is set as 100Gb/s, when light tree generates
Afterwards, in frequency spectrum allocated phase transmission services, value is service bandwidth request.
Below in conjunction with 2 pairs of attached drawing minimal frequency light tree generation methods of the invention for example, in order to clear
The problem of illustrating current light tree generation method, and the superiority of prominent the mentioned method of the present invention.Appoint multicast when one
When business R (0, { 1,2,5,7,8 }, 4,50) is issued from source node 0, multicast light tree generation method, frequency spectrum are appointed according to shortest path
Effectively appoint multicast light tree generation method and minimal frequency light tree generation method, using source node as root, using each destination node as tree
The optimal light tree of leaf is as shown in Fig. 2 respectively, and the light tree that three kinds of methods are established is respectively as follows: T1=0 → 1,0 → 1 → 3 → 5,0 →
3 → 2,0 → 4 → 9 → 8 }, T2={ 0 → 1,1 → 2,1 → 3 → 5,5 → 4 → 9 → 8 }, T3=0 → 1,1 → 2,1 → 3 → 5,0 →
4 → 9 → 8 }, three light tree maximum lengths are respectively 1800KM, 3200KM and 1800KM, and obtaining modulation levels by table 1 is respectively
QPSK, BPSK and QPSK, the business frequency spectrum required when transmitting on three light trees is respectively F1=27FS, F2=35FS, F3=
21FS.Compared with shortest path appoints multicast light tree generation method, minimal frequency light tree generation method can be reduced in shared optical path
The consumption of frequency spectrum；Compared with frequency spectrum effectively appoints multicast light tree generation method, minimal frequency light tree generation method can reduce light tree
Maximum length, to reduce the use of frequency spectrum resource using higher modulation levels.
In elastic optical internet data central site network, the frequency spectrum allocated phase of light tree needs to meet continuity and consistency limit
System.When light tree T is larger, the maximum length of light tree is bigger, and the modulation levels that whole light tree uses are with regard to lower, so that consumption is more
More frequency spectrum resources；In addition, number of links is also relatively more, and frequency spectrum fragment is more serious when light tree is bigger, it is difficult to find satisfaction frequency
The resource for composing continuity and consistency constraint, blocks business, increases bandwidth blocking rate.In the research of multicast, work as network
Load it is larger, business by light tree transmission can not find appropriate resources when, using sub-light tree transmit strategy, thus make business successfully
Transmission reduces network bandwidth blocking rate.The present invention introduces subtree strategic thinking in the research for taking office multicast, and is changed
Into when business is transmitted without appropriate resources by light tree, Jiang Guangshu is divided into the biography of the light forest with more smaller sub-light tree
Defeated business.When light tree is divided into light forest, since sub-light tree is smaller, every stalk light tree is individually to meet frequency spectrum continuous
Property and consistency when limiting, higher modulation levels and less frequency spectrum resource can be used, to make business Successful transmissions, drop
Low bandwidth blocking rate and frequency spectrum fragment.
Light tree as shown in Fig. 3 is divided into light forest example.When a bandwidth demand be 50Gb/s appoint multicast service R from
When source node 0 issues, optimal light tree and frequency spectrum resource service condition such as Fig. 3 (a) are shown.The maximum length of light tree is 2100KM,
The highest modulation levels that light tree uses are BPSK, and the frequency gap number used is 5FS.As shown in Fig. 3 (b), net when being transmitted using light tree
There is no enough available resources in network, therefore will cause business obstruction, to increase the bandwidth blocking rate of network.At this point, such as Fig. 3
(c) and shown in (d), it is the frequency spectrum resource of frequency spectrum fragment for the transmission of light tree, is transmitted when using light forest, due to sub-light tree
Maximum length shortens, and is able to use higher modulation levels and less frequency spectrum resource, thus reducing frequency spectrum fragment and frequency spectrum
While resource consumption, increases the probability of business Successful transmissions, reduce the bandwidth blocking rate of network.As shown in Fig. 3 (d), work as light
When tree is divided into the transmission of light forest, in shared optical path, different subtrees need that shared optical path can be made using different frequency spectrum resources
On the frequency spectrum resource that uses increase, and shared optical path can be made to become the bottleneck of light forest Successful transmissions, therefore be divided into Guang Shu
When light forest is transmitted, light tree is preferentially divided into the less light forest of sub-light tree.
When frequency spectrum resource degree of fragmentation is higher in network, when business is transmitted without available resources by light tree, Jiang Guangshu
It is divided into light forest, the probability of business Successful transmissions, drop can be increased while reducing frequency spectrum fragment and frequency spectrum resource consumes
The bandwidth blocking rate of low network.When having common link between sub-light tree in light forest, different sub-light trees need in shared optical path
Different frequency spectrum resources is occupied, the frequency spectrum resource used in shared optical path can be made to increase, and shared optical path can be made to become light forest
The bottleneck of Successful transmissions.In order to solve the problems, such as above-mentioned smooth forest transmission, the invention proposes be based on link sharing degree
Light forest merge light tree mechanism, when there is business R' service to terminate to discharge enough resources, by the transmission of the light forest of the condition that meets
Business RiIt is shared in optical path between sub-light tree when being reconfigured to the light tree transmitted over resources that R' is discharged, and then reducing the transmission of light forest
The consumption of frequency spectrum resource.
Optical path degree is shared in light forest between sub-light tree in order to evaluate, the invention proposes the chains for calculating link sharing degree
Road sharing degree (Link-sharing spectrum consumption, LSC) formula, is expressed as common link in light forest and disappears
The spectrum number of consumption accounts for the percentage of light forest consumption frequency spectrum sum.When LSC is bigger, show the frequency consumed on light forest common link
Spectrum resource is more, and the biggish smooth forest of LSC is merged on light tree and is transmitted, the consumption of frequency spectrum resource can be reduced.
The method flow merged below in conjunction with a kind of 4 pairs of attached drawing minimal frequency light trees generations of the invention and shared optical path
It is introduced in more detail, detailed process can be divided into following several steps:
S1: judging the type of new events, if new events are that new business R is reached, jumps to step S2, otherwise new events are industry
Business R', which has been serviced, to be left, then jumps to step S8；
S2: executing minimal frequency light tree generation method, generates m candidate light tree, and the frequency spectrum for calculating every light tree consumes generation
It is worth F, and is ranked up according to F value by candidate light tree is ascending；
S3: the smallest light tree of F value is preferentially selected to carry out frequency spectrum distribution according to FF method；
S4: judging whether the distribution of light tree frequency spectrum succeeds, if it succeeds, jumping to step S1, otherwise jumps to step S5；
S5: the smallest light tree of F value is preferentially selected to be divided into the forest T of N stalk light treei N, 2≤N≤k, according to Ti NIn every stalk
The maximum length and frequency spectrum resource situation of light tree select suitable modulation format and frequency spectrum resource to carry out frequency spectrum distribution；
S6: judge Ti NWhether frequency spectrum distribution succeeds, if it succeeds, by light forest Ti NIt is saved in set ST, and jumps to
Step S1, otherwise business is blocked；
S7: judging whether all business are transmitted, if be not transmitted, jumps to step S1, otherwise method terminates；
S8: it executes the light forest based on link sharing degree and merges light tree mechanism.
It is carried out specifically below in conjunction with the minimal frequency light tree generation method process in 5 couples of attached drawing step S2 of the present invention
Bright, detailed process can be divided into following several steps:
S101: according to destination node number k needed for business R by DcMiddle candidate's destination node is divided intoGroup, and number,
It is sequentially stored into set D；
S102: it is successively put into set G from taking out one group of destination node in D, and this group of destination node is deleted from D
It removes；
S103: first destination node d in source node s to G is calculated with Dijkstra methodiShortest path pi, and by pi
It is added to sub-light tree TsIn, by piUpper each node is added to set G', by diIt is deleted from G；
S104: node d is selected from Gi', successively calculate di' into G' each node shortest path pi', and by pi' successively
It is added to sub-light tree TsIn, generate more candidate sub-light tree Ts', empty set G'；
S105: each candidate sub-light tree T is calculateds' frequency spectrum consume cost value F, and be ranked up from small to large by F value；
S106: the smallest candidate sub-light tree T of selection F values', sub-light tree is updated, T is enableds=Ts', by sub-light tree T after updates
Upper each node is added in set G', by di' deleted from set G；
S107: judge whether set G is sky, if G ≠ φ, jumps to step S104, otherwise jumps to step S108；
S108: by sub-light tree TsIt is added in light tree set Tree, enables Ts=0；
S109: judge whether set D is sky, if D ≠ φ, jumps to step S102, otherwise jumps to middle step S2；
Merge light tree mechanism stream below in conjunction with the light forest based on link sharing degree in 6 couples of attached drawing step S8 of the present invention
Journey is described in detail, and detailed process can be divided into following several steps:
S201: judge to have serviced whether business R' is to carry out transmission services by light tree, if it is, jumping to step
Otherwise S202 deletes R' from set ST, discharge resource, and jump to step S1；
S202: judge whether set ST is sky, if ST ≠ φ, jumps to step S203, otherwise jumps to step S1；
S203: the link sharing angle value LSC of each smooth forest in set of computations ST, and sorted from large to small by LSC；
S204: preferred LSC biggish smooth forest, ifThen by transmission services T in light forestiWeight
It is configured in R' release light tree resource and transmits, and jump to step S1；If without suitable TiIt is reconfigured, then jumps to step
S1。
Finally, it is stated that preferred embodiment above is only used to illustrate the technical scheme of the present invention and not to limit it, although logical
It crosses above preferred embodiment the present invention is described in detail, however, those skilled in the art should understand that, can be
Various changes are made to it in form and in details, without departing from claims of the present invention limited range.
Claims (1)
1. what a kind of shared optical path merged appoints multicast service to route minimal frequency light tree generation method, it is characterised in that: in the party
In method, devise the frequency spectrum consumption cost value of light tree transmission, by comprehensively consider it is new be added branch for light tree maximum length with
The influence of modulation levels selection makes the smallest light tree transmission of service selection frequency spectrum consumption cost；
This method specifically includes the following steps:
Step 1: candidate destination node being grouped simultaneously label according to destination node number needed for business, source node is successively calculated and arrives
The light tree of every group of destination node generates candidate light tree；
Step 2: the frequency spectrum of every generation light tree of assessment consumes cost value, selects the frequency spectrum consumption the smallest light tree of cost value as biography
Defeated path；After candidate light tree generates, preferably the smallest light tree of frequency spectrum consumption cost value carries out frequency spectrum distribution；If business passes through
Light tree transmission services, when not having enough frequency spectrum resources in network, it is gloomy that Jiang Guangshu is divided into the light with several smaller sub-light tree
Woods individual transmission selects higher modulation levels；
The step 1 is realized especially by following manner: in every candidate light tree calculating process, first calculating source node to this
The shortest path of first destination node forms sub-light tree in group destination node, then successively by purpose remaining in this group of destination node
Node is added in sub-light tree；During remaining destination node is added to sub-light tree, destination node is calculated to having generated sub-light
The shortest path of each node on tree selects to be added to the sub-light tree frequency spectrum consumption the smallest shortest path of cost value as new branch
In sub-light tree；
In step 2, the frequency spectrum consumption cost value is expressed as consumed frequency spectrum resource number when light tree transmission services；In light
Generation phase is set due to non-transmission services, service rate when calculating frequency spectrum consumption cost value is set as 100Gb/s, when light tree generates
Afterwards, in frequency spectrum allocated phase transmission services, value is service bandwidth request；
The light forest based on link sharing degree is additionally used in the method and merges light tree mechanism, devises light forest link sharing
Angle value, the link sharing degree (Link-sharing spectrum consumption, LSC) are expressed as in light forest jointly
The percentage that the spectrum number of link consumption accounts for light forest consumption frequency spectrum sum shows to disappear on light forest common link when LSC is bigger
The frequency spectrum resource of consumption is more, and the biggish smooth forest of LSC is merged on light tree and is transmitted；When there is business service to terminate to discharge enough money
When source, the light forest transmission services for the condition that meets are reconfigured to the light tree transmitted over resources that winding-up is discharged；
Specifically includes the following steps:
Step 3: calculating the link sharing angle value for passing through light forest transmission services；
Step 4: selection has identical source node with the business that serviced, and frequency spectrum resource is needed to be less than release resource, and link
The minimum light forest of sharing degree is reconfigured to the light tree transmitted over resources that winding-up is discharged.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710152592.2A CN106911393B (en) | 2017-03-14 | 2017-03-14 | What shared optical path merged appoints multicast service to route minimal frequency light tree generation method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710152592.2A CN106911393B (en) | 2017-03-14 | 2017-03-14 | What shared optical path merged appoints multicast service to route minimal frequency light tree generation method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106911393A CN106911393A (en) | 2017-06-30 |
| CN106911393B true CN106911393B (en) | 2019-03-22 |
Family
ID=59187616
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710152592.2A Active CN106911393B (en) | 2017-03-14 | 2017-03-14 | What shared optical path merged appoints multicast service to route minimal frequency light tree generation method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106911393B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108494690B (en) * | 2018-01-30 | 2020-08-07 | 北京邮电大学 | Minimum failure probability optical tree construction method and device |
| CN109889928B (en) * | 2018-12-07 | 2022-01-25 | 中国南方电网有限责任公司 | Multicast optical tree transmission quality prediction method, device, equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101621721A (en) * | 2009-08-06 | 2010-01-06 | 中兴通讯股份有限公司 | K-shortest path computing method and device |
| CN102137313A (en) * | 2011-04-29 | 2011-07-27 | 东北大学 | Subtree-based multicasting traffic grooming method in WDM (Wavelength Division Multiplex) optical network |
| CN102186123A (en) * | 2011-04-29 | 2011-09-14 | 东北大学 | Multicast-sharing and multilayer protection method based on subtrees in WDM (wavelength division multiplexer) optical network, |
| WO2014081935A1 (en) * | 2012-11-25 | 2014-05-30 | Nec Laboratories America, Inc. | Grooming multicast traffic in flexible optical wavelength division multiplexing wdm networks |
| CN104486094A (en) * | 2014-12-15 | 2015-04-01 | 西安电子科技大学 | Multicast traffic grooming method based on physical topology light-tree correction |
-
2017
- 2017-03-14 CN CN201710152592.2A patent/CN106911393B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101621721A (en) * | 2009-08-06 | 2010-01-06 | 中兴通讯股份有限公司 | K-shortest path computing method and device |
| CN102137313A (en) * | 2011-04-29 | 2011-07-27 | 东北大学 | Subtree-based multicasting traffic grooming method in WDM (Wavelength Division Multiplex) optical network |
| CN102186123A (en) * | 2011-04-29 | 2011-09-14 | 东北大学 | Multicast-sharing and multilayer protection method based on subtrees in WDM (wavelength division multiplexer) optical network, |
| WO2014081935A1 (en) * | 2012-11-25 | 2014-05-30 | Nec Laboratories America, Inc. | Grooming multicast traffic in flexible optical wavelength division multiplexing wdm networks |
| CN104486094A (en) * | 2014-12-15 | 2015-04-01 | 西安电子科技大学 | Multicast traffic grooming method based on physical topology light-tree correction |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106911393A (en) | 2017-06-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2748957B1 (en) | Routing and bandwidth assignment for flexible grid wavelength switched optical networks | |
| CN105827528B (en) | A kind of route selection method suitable for the flexible optical-fiber network of frequency spectrum | |
| CN106953710B (en) | The method for routing of the distribution of minimum cost frequency spectrum and fragment perception in elastic optical network | |
| Shakya et al. | Spectral defragmentation in elastic optical path networks using independent sets | |
| Moura et al. | Fragmentation aware routing and spectrum assignment algorithm | |
| WO2013091688A1 (en) | Multilayer topology representation for network | |
| CN108134967A (en) | A kind of electric power optical-fiber network routing frequency spectrum distributing method and system | |
| Guo et al. | Adaptive modulation and regeneration-aware routing and spectrum assignment in sbpp-based elastic optical networks | |
| CN109690985A (en) | The method and apparatus that high-efficiency network utilizes are realized using super channel | |
| CN107135056A (en) | It is a kind of to reduce frequency spectrum fragment and the Anycast service resource allocation method of time delay | |
| CN106911393B (en) | What shared optical path merged appoints multicast service to route minimal frequency light tree generation method | |
| CN106506362B (en) | A kind of elastic optical network multilink fault probability guard method of minimum failure risk loss | |
| Wang et al. | Lightpath-level active rerouting algorithms in all-optical WDM networks with alternate routing and traffic grooming | |
| CN105007223A (en) | Optical network dynamic multicast routing wavelength allocation method based on optical hierarchical structure | |
| Hutcheon | OTN to enable flexible networks | |
| CN108184175B (en) | MC node limitation-based elastic optical network multicast routing and spectrum allocation method | |
| Aibin et al. | Different strategies for dynamic multicast traffic protection in elastic optical networks | |
| Chatterjee et al. | A heuristic priority based wavelength assignment scheme for optical networks | |
| CN108616782A (en) | A kind of frequency spectrum distributing method based on the optimization of non-intersecting connection group in elastic optical network | |
| Xu et al. | Wavelength assignment for dynamic traffic in WDM networks | |
| Xu et al. | Dynamic routing and spectrum allocation to minimize fragmentation in elastic optical networks | |
| Lin et al. | Dynamic sub-light-tree based traffic grooming for multicast in WDM networks | |
| Yamada et al. | Survivable hierarchical optical path network design with dedicated wavelength path protection | |
| CN104506442A (en) | Multipoint-to-multipoint multicast business optical grooming method for flexible grid optical network | |
| Lan et al. | A fragmentation-aware load-balanced RMSCA algorithm in space-division multiplexing elastic optical networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20220121 Address after: 401120 b1-16-1, No. 76 Xingguang Avenue, gaoxinyuan, North New Area, Yubei District, Chongqing Patentee after: CHONGQING INFORMATION TECHNOLOGY DESIGNING CO.,LTD. Address before: 400065 Chongqing Nan'an District huangjuezhen pass Chongwen Road No. 2 Patentee before: CHONGQING University OF POSTS AND TELECOMMUNICATIONS |