CN104967566B - Automatically switching optical networks little particle service path method and device for planning - Google Patents
Automatically switching optical networks little particle service path method and device for planning Download PDFInfo
- Publication number
- CN104967566B CN104967566B CN201510227647.2A CN201510227647A CN104967566B CN 104967566 B CN104967566 B CN 104967566B CN 201510227647 A CN201510227647 A CN 201510227647A CN 104967566 B CN104967566 B CN 104967566B
- Authority
- CN
- China
- Prior art keywords
- service
- path
- weight
- business
- little particle
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/827—Aggregation of resource allocation or reservation requests
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A kind of automatically switching optical networks little particle service path method and device for planning, by the way that the ethod of remittance of each little particle business is divided into end-to-end convergence and node convergence two ways, then the little particle business converged respectively to the little particle business and node of end-to-end convergence carries out path planning, and the different time-gap distribution for realizing the end-to-end convergence of little particle business and node convergence requires.The present invention is effectively increased ASON network slot utilization rates, is reduced business time-slot distribution complexity, be conducive to follow-up rapid deployment new business, while reduce O＆M cost by the application of both time slot assemblage methods.
Description
Technical field
The present invention relates to optical transport network technical field, more particularly to a kind of automatically switching optical networks little particle business road
Footpath planing method, a kind of automatically switching optical networks little particle service path device for planning.
Background technology
In general ASON (Automatically Switched Optical Network, automatically switching optical networks) net
In network, STM-N (Synchronous Transport Module level N, n grades of synchronous transfer mode) link can be with specific
Speed transmit data, such as STM-16 (third level synchronous transfer mode), STM-64 (fourth stage synchronous transfer mode) etc..
Various businesses signal is all transmitted by being multiplexed into STM-N frames.STM-1 frame rate for 155MBit/s (megabit
It is per second), if the service rate of transmission is less than STM-1, referred to as 2M little particles business, other business are known as high-order business.
In ASON networks, the configuration of the path of business includes the link sequences that business passes through in network topology and business exists
Time slot distribution on link.So being configured for a service path, i.e., the topology that choose business distributes again
The chain time gap of business.
The Sychronized optical networks technical system in China defines the PDH based on 2Mbit/s signals
The Payload of (Plesiochronous Digital Hierarchy, quasi-synchronous digital series) as ASON, and select AU-
The multiplexing route of 4 (administrative units -4).High-order business is potted directly into one or more VC4, is then directly multiplexed into STM-N
Middle transmission.And low-order service needs first to be encapsulated into VC12, then it is multiplexed into VC4, is finally multiplexed into a STM-N and transmits.
VC4 is the corresponding virtual container of PDH signals with 140Mbit/s, and VC12 is and the corresponding empty appearance of the PDH signals of 2Mbit/s
Device, VC3 are the corresponding virtual containers of PDH signals with 34Mbit/s, and a VC4 includes 63 VC12 or 3 VC3, this Shen
The 2M little particle business related to is the low-order service of VC12 ranks.Here we are business packed to VC12/VC3, VC4's
Process is known as time slot distribution.
In current optical transmission network, the transmission network using ASON as core largely exists.Current ASON networks are opened up
Flutter structure and progressively develop into multi-ring network, grid type network etc. from original Chain Network, ring-like net.Business granule degree is more and more,
There are substantial amounts of low-order service, the path planning of these business needs to run by planning software.But having various businesses,
In the network of particularly a large amount of low-order services, it may appear that service path is planned successfully, but carries out business configuration according to program results
Reduction and the business time-slot distribution of network slot utilization rate can be caused complicated, be unfavorable for follow-up rapid deployment new business, at the same time
Increase O＆M cost.
The content of the invention
Based on this, it is necessary in view of the above-mentioned problems, providing a kind of automatically switching optical networks paths planning method and device, energy
Enough effectively improve ASON network slot utilization rates.
A kind of automatically switching optical networks little particle service path planing method, including step：
The initial data of automatically switching optical networks is gathered, according to the Raw Data Generation network model data, wherein net
Network model data includes the data of network topology data and each little particle business to be planned；
According to the data of each little particle business, the little particle business with identical source device and host device is incorporated to each sub- industry
Business list；
It is each virtual service by the end-to-end convergence of the little particle business that high-order business can be filled up in each subservice list, remains
Remaining little particle business is arranged to each node convergence service；
According to network topology data, determine that the source device of each virtual service to the path weight value of host device, is weighed according to path
Weight distributes shortest route and time slot for each virtual service；
According to network topology data, the source device of each node convergence service is determined to the path weight value of host device, according to road
Footpath weight distributes shortest route and time slot for each node convergence service.
A kind of automatically switching optical networks little particle service path device for planning, including：
Network model data generation module, for gathering the initial data of automatically switching optical networks, according to the original number
According to generation network model data, wherein network model data includes the number of network topology data and each little particle business to be planned
According to；
Subservice List Generating Module, for the data according to each little particle business, will have identical source device and place to set
Standby little particle business is incorporated to each subservice list；
Service convergence module, for the end-to-end remittance of little particle business of high-order business will can be filled up in each subservice list
Gather and be arranged to each node convergence service for each virtual service, remaining little particle business；
Virtual service path planning module, for according to network topology data, determining the source device of each virtual service to place
The path weight value of equipment, shortest route and time slot are distributed according to path weight value for each virtual service；
Node traffic path planning module, for according to network topology data, determining the source device of each node convergence service
To the path weight value of host device, shortest route and time slot are distributed for each node convergence service according to path weight value.
Automatically switching optical networks little particle service path method and device for planning of the present invention, by by each little particle business
The ethod of remittance is divided into end-to-end convergence and node convergence two ways, then respectively to the little particle business and section of end-to-end convergence
The little particle business of point convergence carries out path planning, realizes the different time-gap of the end-to-end convergence of little particle business and node convergence
Distribution requires.By the application of both time slot assemblage methods, ASON network slot utilization rates are effectively increased, reduce business
Time slot distributes complexity, is conducive to follow-up rapid deployment new business, while reduce O＆M cost.
Brief description of the drawings
Fig. 1 is the flow diagram of the method for the present invention embodiment；
Fig. 2 is the flow diagram of virtual service path planning step embodiment of the present invention；
Fig. 3 is the flow diagram of node convergence service path planning step embodiment of the present invention；
Fig. 4 is the schematic diagram of ASON network topology specific embodiments；
Fig. 5 is the structure diagram of apparatus of the present invention embodiment；
Fig. 6 is the structure diagram of virtual service path planning module embodiment of the present invention；
Fig. 7 is the structure diagram of node traffic path planning module embodiment of the present invention.
Embodiment
Below in conjunction with the accompanying drawings to the specific embodiment party of automatically switching optical networks little particle service path planing method of the present invention
Formula is described in detail.
As shown in Figure 1, a kind of automatically switching optical networks little particle service path planing method, including step：
S110, the initial data for gathering automatically switching optical networks, according to the Raw Data Generation network model data, its
Middle network model data includes the data of network topology data and each little particle business to be planned；
S120, the data according to each little particle business, the little particle business with identical source device and host device is incorporated to
Each subservice list；
S130, by the little particle business that high-order business can be filled up in each subservice list it is end-to-end convergence be each virtual industry
Business, remaining little particle business are arranged to each node convergence service；
S140, according to network topology data, the source device of each virtual service is determined to the path weight value of host device, according to road
Footpath weight distributes shortest route and time slot for each virtual service；
S150, according to network topology data, determine the source device of each node convergence service to the path weight value of host device, root
According to path weight value shortest route and time slot are distributed for each node convergence service.
Little particle business refers to 2M little particle business.The initial data of ASON networks is network low-order service path planning
Basis, it is therefore desirable to gather first.The initial data of ASON networks, topological data source bag can be gathered from topological data source
Include Network Management System and network planning system.Network Management System is used for open ASON network topology data, network planning system
System is used for manual input device parameter, such as parameter of the network equipment and cable resource etc., supports graphical Interface.Pass through network
When planning system gathers initial data, there is manual New-deployed Network, open existing planning network, import three kinds of sides of webmaster network data
Formula.Exemplified by importing webmaster network data, gather initial data the step of include：Webmaster network data exchange interface is opened, it is accurate
Standby data buffer zone, starts data exchange, then generates the ASON network equipments and device data list, optical cable data list, industry
Business data list etc..The ASON network raw datas collected include Internet resources and service resources type and its parameter, specifically
Example is as shown in table 1.
The raw data list that table 1 gathers
Collect after initial data, it is necessary to which the initial data of the ASON networks in different topology data source is adapted for system
Network model data, so as to carry out service convergence and path planning according to the network model data.Network model data includes
Network topology data and the data of each 2M little particles business to be planned etc., network topology data are used to determine in ASON networks
Equipment, the length and speed of the connection of equipment room cable link etc., the data of each 2M little particles business to be planned are used to determine 2M
Little particle business, namely the source device and host device of low-order service, the speed of business etc..
End-to-end convergence refers to gathering together the low-order service of identical source device and host device, pools a height
The business of the STM-1 of rank, these low-order services use identical route and VC4 time slots in transmitting procedure.Node convergence refers to
It is by the inconsistent low-order service of source device and host device, on the identical path that business is passed through, converges to a VC4 as far as possible
In.In order to improve ASON network slots utilization rate, it is necessary to first converge operation be carried out to each 2M little particles business, by each 2M little particles
Business configuration is end-to-end convergence or node convergence.
When carrying out converge operation to each 2M little particles business, first set according to the data of each 2M little particles business, namely sourcesink
Standby ID (identity number) processing business list, each son is incorporated to by the 2M little particle business with identical source device and host device
Service lists, i.e., 2M little particle business source devices and host device inside each subservice list are identical, each subservices
List forms subservice list collection.Then subservice list collection is traveled through, a sub- industry is obtained from subservice list collection
Business list.According to the principle that 2M little particles service convergence is high-order business：Such as 63 VC12 level traffics pool a height
Rank VC4 business, can will completely complete the 2M little particles service combining of a high-order business into a void in the subservice list
Plan business, obtains a plurality of virtual service, and the ethod of remittance of these 2M little particle business is arranged to end-to-end convergence；Tape remaining
Wide deficiency fills up the 2M little particle business of single high-order business without merging treatment, and its ethod of remittance is arranged to node and is converged
It is poly-, thus the 2M little particles delineation of activities in the subservice list is converged for the low-order service and node of multiple end-to-end convergences
Poly- low-order service.Then the above-mentioned ethod of remittance setting of other subservice lists progress is being chosen, until obtaining all sub- industry
The ethod of remittance of business list.
According to the convergence of each subservice list as a result, being converged respectively to the 2M little particles business and node of end-to-end convergence
2M little particles business carries out path planning.It should be noted that ought there are the 2M little particles business and section of end-to-end convergence at the same time
During the 2M little particle business of point convergence, path planning first is carried out to the 2M little particles business of end-to-end convergence, when only existing one kind
During the 2M little particle business of the ethod of remittance, then directly only the 2M little particle business of the ethod of remittance can be planned.When
So, processing priority of the present invention not pair at the same time there are two kinds of ethods of remittance to limit.
As shown in Fig. 2, step S140 can include：
S1401, analysis network topology data, describe the topological structure of network, and build figure using undirected lax figure Graph
Each device abstract in the internal data of shape type, wherein network topology is the undirected lax corresponding vertex of figure, and each link is abstracted
For the undirected lax corresponding side of figure, S1402 is entered step；
The list that S1402, each virtual service of traversal are formed, obtains the virtual service of selection, enters step S1403；
S1403, the weight equation according to end-to-end convergence service, update the weight on each side in undirected lax figure, into step
Rapid S1404；
S1404, the weight according to undirected lax figure and each side, call shortest path first to determine that the virtual service source is set
The standby most short weight path for arriving host device, enters step S1405；
S1405, according to the most short weight path, for the virtual service on each bar link being routed across according to suitable
Sequence takes principle distribution VC4 time slots, enters step S1406；
S1406, be the virtual service distribution VC12 time slots under the VC4 time slots of distribution, enters step S1407；
S1407, judge whether each virtual service time slot distribution is completed, if not, return to step S1402, if so, then entering section
The step of point convergence service path planning, if without node convergence service, terminate.
Shown in the structure of undirected lax figure is described as follows：
After obtaining undirected lax figure Graph, the virtual service that carry out path planning is chosen.According to end-to-end convergence service
Weight equation, update the weight on each side in undirected lax figure Graph.End-to-end convergence service uses load balancing principle,
Weight equation is as follows：
Weight=TotalVC4TimeSlot/IdleVC4TimeSlot；
Weight=NA (IdleVC4TimeSlot=0)；
Wherein, TotalVC4TimeSlot describes the total VC4 timeslot numbers of link, and IdleVC4TimeSlot describes link
Free timeslot number, VC4 timeslot numbers-business that free timeslot number=link of link is total take timeslot number, IdleVC4TimeSlot
>0, NA represents infinitely great.In example network, the initialization weight on undirected lax each sides of figure Graph could be provided as 1.
According in the undirected lax figure Graph and step S1402 created in step S1401 determine each side weight,
Critical path method (CPM) is called to determine the virtual service source device to the most short weight path of host device.Critical path method (CPM) can use
Dijkstra (Dijkstra algorithm), Dijkstra are typical shortest path firsts, are outwards expanded layer by layer centered on starting point
Exhibition, untill expanding to terminal, so as to calculate a point to the most short weight path of other all the points.Use above-mentioned weight
Formula, when calculating business shortest path according to dijkstra's algorithm, meets balancing link load principle.Definite most short weight road
Footpath can use Path (DQS path setting command) to describe.
After determining shortest path, you can to distribute time slot to the virtual service.First for the virtual service in shortest route
Distribution VC4 time slots in principle are taken on each bar link passed through in sequence, since teleservice is complete in virtual service
Take, so when being the corresponding VC12 of 2M little particle traffic assignments of end-to-end convergence under the VC4 time slots that virtual service takes
Gap.The time slot of this virtual service is assigned, and is then chosen new virtual service and is carried out time slot distribution, until all is virtual
Business time-slot is assigned.
When there are during node convergence service, when all virtual service time slots are assigned, that is, starting to converge each node
Business carries out time slot distribution.If virtual service list is not present, the distribution of node convergence service time slot is directly carried out.Such as Fig. 3 institutes
Show, step S150 includes step：
S1501, analysis network topology data, describe the topological structure of network, and build graphics class using undirected lax figure
Each device abstract in the internal data of type, wherein network topology is the undirected lax corresponding vertex of figure, and the VC4 of each link is abstracted
For the undirected lax corresponding side of figure, S1502 is entered step；
The list that S1502, each node convergence service of traversal are formed, obtains the node convergence service of selection, enters step
S1503；
S1503, according to node convergence service side weight equation, update the weight of undirected lax Tu Gebian, enter step
S1504；
S1504, the weight according to undirected lax figure and each side, call shortest path first to determine the node convergence service
Source device enters step S1505 to the most short weight path of host device；
S1505, the most short weight path according to, are that the node convergence service divides on each bar link being routed across
With VC4 time slots, S1506 is entered step；
S1506, be the node convergence service distribution VC12 time slots on the VC4 time slots of distribution, enters step S1507；
S1507, judge whether each node convergence service time slot distribution is completed, if not, return to step S1502, if so, knot
Beam.
When switching to node convergence time slot matching by the distribution of virtual service time slot, it is only necessary to converge principle according to node and match somebody with somebody again
Undirected lax figure Graph sides and vertex are put, i.e., is the vertex in undirected lax figure by the device abstract in network topology, by one
The VC4 of link is abstracted as the side of undirected lax figure.Then the list formed according to node convergence service, selection need time slot to distribute
Node convergence service.
After having chosen node convergence service, according to node convergence service side weight equation, update in undirected lax figure Graph
The weight on each side.The node convergence service side weight equation is：
Weight=100 (IdleTimeSlot>TotalLowerSlot)
Weight=100*Slack (LowTimeSlot<=IdleTimeSlot<=TotalLowerSlot)
Weight=NA (IdleTimeSlot<LowTimeSlot)
Wherein, IdleTimeSlot describes the free timeslot number in VC4, because 2M little particles business is VC12 ranks, institute
VC12 timeslot numbers idle in VC4 are described with IdleTimeSlot.TotalLowerSlot describes to own in a link
The timeslot number of VC12.LowTimeSlot describes total little particle number of timeslots in VC4, because 2M little particle business is VC12 grades
Not, so LowTime1Slot refers to all VC12 timeslot numbers in VC4, numerical value 63.Slack describes the convergence on VC4 sides
Coefficient, it is desirable to Slack<1, convergence coefficient is bigger, preferential to find the high path of node convergence degree during shortest path pathfinding, generally
It is arranged to 0.3~0.5.NA represents infinitely great.
The weight on each side in the undirected lax figure Graph and figure that are created according to S1501, calls shortest path first to determine
For the node convergence service source device to the most short weight path of host device, wherein shortest path first can be using Dijkstra calculations
Method.Using node convergence service side weight equation, when determining business shortest path according to dijkstra's algorithm, meet that node converges
Business is preferentially using the requirement for the VC4 time slots that there is free time VC12.Definite most short weight path can be described with Path.
After getting the most short weight path of the node convergence service, distributed for the node convergence service on routeing each section
High-order VC4 time slots.Business route at this time is described using VC4, which is the VC4 numberings that business takes.Then
VC12 time slots are distributed for node convergence service on the VC4 of distribution, i.e., are 2M little particles according to the quantity of free time VC12 on VC4
The corresponding VC12 time slots of service selection.The time slot of this node convergence service is assigned, and then chooses new node convergence industry
Business carries out time slot distribution, until all node convergence service time slots are assigned, the planning of 2M little particles service path terminates.
In order to which embodiments of the present invention are more clearly understood, with reference to a specific embodiment to the technology of the present invention side
Case is described in detail.
As shown in figure 4, it is a specific ASON network topology schematic diagram.The network model number obtained from the ASON networks
According to as follows：
Network topology data：ASON networks have 4 equipment, and device name is respectively A, B, C, D, equipment connection feelings in topology
Condition is：A-B, B-C, C-F, F-D, D-E, E-A, there are 4 STM-64 links for each connection equipment room；
2M little particle business datums to be planned：First group is A points to C points, and one shares the business of 200 PDH2M, second
Group is that C points share the business of 100 PDH2M to D points, one, and the 3rd group is that A points share the business of 100 PDH2M to D points, one.
Converge operation is carried out to 2M little particles business according to step S120 and step S130, obtained convergence result is as follows：
200 2M little particle business in first group of business, the end-to-end convergence of 189 2M little particle business therein is 3
The virtual VC4 business of bar, is respectively set to T1, T2, T3；Remaining 11 2M little particles business converges for node, sets respectively
For C1, C2...C11.
100 2M little particle business in second group of business, the end-to-end convergence of 63 2M little particle business therein is 1
Virtual VC4 business, is arranged to T4；Remaining 37 2M little particles business converges for node, is respectively set to C12,
C13...C48。
100 articles of 2M little particle business in 3rd group of business, the end-to-end convergence of 63 2M little particle business therein is 1
Virtual VC4 business, is arranged to T5；Remaining 37 2M little particles business converges for node, is respectively set to C49,
C50...C85。
Path planning first is carried out according to step S140 to the 2M little particles business of end-to-end convergence, i.e., first to T1, T2,
T3 ... T5 carry out path planning, wherein there are 4 vertex in the undirected lax figure Graph created, A-B, B-C, C-D, D-A,
D-B, there are 4 sides for connection equipment room.By taking A equipment to C equipment virtual services T1 as an example, by this operation, obtaining route is
Path.T1={ A-B, B-C }.Link idle time slot between A-B, B-C is all 63, is that virtual service T1 distinguishes on A-B, B-C
The VC4 that time slot 1 is distributed as virtual service T1 takes time slot.63 2M little particle business in T1, are followed successively by small of every 2M
Grain business matches somebody with somebody VC12 time slots in A-B, 1 inside points of time slot of B-C links.60th article of business of final first group of A points to B points takes
The time slot of A-B, B-C link is all 1-60, wherein 1 represents that business takes the VC4 timeslot numbers of link, 60 identification services take link
The timeslot number of VC12 under VC4.So far, virtual service T1 time slots are assigned, according to the method described above to other each virtual services
Time slot distribution is carried out, subsequently into C1, the step of C2 ... ..., C85 path plannings.
To C1, C2 ... ..., before C85 path plannings, needs first according to step S1501 to undirected lax figure Graph sides and top
Point is updated, and there are 4 vertex in the undirected lax figure Graph created at this time, there are 4*63 bars side for connection equipment room.With A
Point is arrived exemplified by C point node convergence service C1, is operated by step S1504, acquisition shortest route is Path.C1={ A-B-4, B-
C-4}.Available VC4 time slots 4 are selected in link A-B, B-C, C1 is selected in link A-B, B-C on available VC4 time slots 4
For the available VC12 time slots 1 of 2M little particle service selections, then the time slot of 2M little particles business C1 distribution is 4-1.So far, C1 time slots
It is assigned, time slot distribution is carried out to other each node convergence service according to the method described above, until all node convergence industry
Business time slot is assigned, then all 2M little particles service paths planning terminates.
Based on same inventive concept, the present invention also provides a kind of planning of automatically switching optical networks little particle service path to fill
Put, the embodiment of apparatus of the present invention is described in detail below in conjunction with the accompanying drawings.
As shown in figure 5, a kind of automatically switching optical networks little particle service path device for planning, including：
Network model data generation module 510, for gathering the initial data of automatically switching optical networks, according to described original
Data generating network model data, wherein network model data include network topology data and each little particle business to be planned
Data；
Subservice List Generating Module 520, for the data according to each little particle business, will have identical source device and place
The little particle business of equipment is incorporated to each subservice list；
Service convergence module 530, for the little particle business end that high-order business can be filled up in each subservice list to be arrived
End convergence is each virtual service, and remaining little particle business is arranged to each node convergence service；
Virtual service path planning module 540, for according to network topology data, determining that the source device of each virtual service arrives
The path weight value of host device, shortest route and time slot are distributed according to path weight value for each virtual service；
Node traffic path planning module 550, for according to network topology data, determining that the source of each node convergence service is set
The standby path weight value for arriving host device, shortest route and time slot are distributed according to path weight value for each node convergence service.
The network model data that network model data generation module 510 obtains includes network topology data and to be planned each
Data of 2M little particle business etc., network topology data are used to determine the equipment in ASON networks, the connection of equipment room cable link
Length and speed etc., the data of each 2M little particles business to be planned are used to determine 2M little particle business, namely low-order service
Source device and host device, the speed of business etc..
In order to improve ASON network slot utilization rates, subservice List Generating Module 520 and service convergence module 530 will be each
2M little particles business configuration is end-to-end convergence or node convergence.Then virtual service path planning module 540 is to end-to-end remittance
Poly- 2M little particles business carries out path planning, the 2M little particle business that node traffic path planning module 550 converges node
Carry out path planning.It should be noted that 2M that ought be at the same time there are 2M little particles business and the node convergence of end-to-end convergence is small
During particle business, virtual service path planning module 540 first carries out path planning to the 2M little particles business of end-to-end convergence, when
When only existing the 2M little particle business of node convergence, then node traffic path planning module 550 can be directly only to the convergence
The 2M little particle business of mode is planned.
As shown in fig. 6, the virtual service path planning module 540 includes：
Undirected lax figure construction unit 5401, for analyzing network topology data, network is described using undirected lax figure
Topological structure, and the internal data of graph style is built, each device abstract wherein in network topology is corresponding for undirected lax figure
Vertex, each link is abstracted as the undirected corresponding side of lax figure；
Virtual service acquiring unit 5402, for traveling through the list of each virtual service composition, obtains the virtual service of selection；
Weight updating block 5403, for the weight equation according to end-to-end convergence service, updates each in undirected lax figure
The weight on side；The weight equation of end-to-end convergence service is as follows：
Weight=TotalVC4TimeSlot/IdleVC4TimeSlot；
Weight=NA (IdleVC4TimeSlot=0)；
Wherein, TotalVC4TimeSlot describes the total VC4 timeslot numbers of link, and IdleVC4TimeSlot describes link
Free timeslot number, VC4 timeslot numbers-business that free timeslot number=link of link is total take timeslot number, IdleVC4TimeSlot
>0, NA represents infinitely great.In example network, the initialization weight on undirected lax each sides of figure Graph could be provided as 1.
Most short weight path determination unit 5404, for the weight according to undirected lax figure and each side, calls shortest path
Algorithm determines the virtual service source device to the most short weight path of host device；
VC4 time slot allocating units 5405, for the most short weight path according to, are being routed across for the virtual service
Each bar link on take in sequence principle distribution VC4 time slots；
VC12 time slot allocating units 5406, for being the virtual service distribution VC12 time slots under the VC4 time slots of distribution；
Judging unit 5407, for judging whether each virtual service time slot distribution is completed, if so, node traffic path planning
Module 550 carries out path planning to node convergence service, if without node convergence service, terminates；Otherwise, virtual service obtains single
Member 5402 reselects virtual service and carries out time slot distribution, until all virtual service time slots are assigned.
When there are during node convergence service, when all virtual service time slots are assigned, node traffic path planning mould
Block 550 starts to carry out time slot distribution to each node convergence service.If virtual service list is not present, node traffic path rule
Draw module 550 and directly carry out the distribution of node convergence service time slot.As shown in fig. 7, the node traffic path planning module 550 is wrapped
Include：
Non-directed graph construction unit 5501, for analyzing network topology data, the topology of network is described using undirected lax figure
Structure, and the internal data of graph style is built, each device abstract wherein in network topology pushes up accordingly for undirected lax figure
Point, the VC4 of each link are abstracted as the undirected corresponding side of lax figure；
When switching to node convergence time slot matching by the distribution of virtual service time slot, non-directed graph construction unit 5501 only needs basis
Node convergence principle reconfigures undirected lax figure Graph sides and vertex, i.e., is undirected dilute by the device abstract in network topology
The VC4 of one link, is abstracted as the side of undirected lax figure by the vertex in loose figure.
Node convergence service acquiring unit 5502, the list formed for traveling through each node convergence service, obtains selection
Node convergence service；
Each side right weight updating block 5503, for according to node convergence service side weight equation, it is each to update undirected lax figure
The weight on side；
The node convergence service side weight equation is：
Weight=100 (IdleTimeSlot>TotalLowerSlot)
Weight=100*Slack (LowTimeSlot<=IdleTimeSlot<=TotalLowerSlot)
Weight=NA (IdleTimeSlot<LowTimeSlot)
Wherein, IdleTimeSlot describes VC12 timeslot numbers idle in VC4.TotalLowerSlot describes a link
In all VC12 timeslot number.LowTimeSlot describes all VC12 timeslot numbers in VC4, numerical value 63.Slack describes VC4
The convergence coefficient on side, it is desirable to Slack<1, convergence coefficient is bigger, preferential to find the high road of node convergence degree during shortest path pathfinding
Footpath, is traditionally arranged to be 0.3~0.5.NA represents infinitely great.
Shortest path determination unit 5504, for the weight according to undirected lax figure and each side, calls shortest path first
Determine the node convergence service source device to the most short weight path of host device；
High-order time slot allocating unit 5505, is the node convergence service on road for according to the most short weight path
By distributing VC4 time slots on each bar link for passing through；
Low order time slot allocating unit 5506, for being the node convergence service distribution VC12 on the VC4 time slots of distribution
Time slot；
Detection unit 5507, for judging whether each node convergence service time slot distribution is completed, if it is not, node convergence service
Acquiring unit 5502 reacquires node convergence service, if completing, the planning of 2M little particles service path terminates.
The other technical characteristics of apparatus of the present invention are identical with the method for the present invention, and it will not be described here.
Automatically switching optical networks little particle service path method and device for planning of the present invention, by by each 2M little particles business
The ethod of remittance be divided into it is end-to-end convergence and node convergence two ways, then respectively to the 2M little particle business of end-to-end convergence
Path planning is carried out with the 2M little particles business of node convergence, realizes the end-to-end convergence of 2M little particle business and node convergence
Different time-gap distribution requires.In the case of complicated network topology and a large amount of 2M little particles portfolios, ASON nets can be reduced
Little particle time slot service efficiency in network link, so as to lift network link utilization rate.
Embodiment described above only expresses the several embodiments of the present invention, its description is more specific and detailed, but simultaneously
Therefore the limitation to the scope of the claims of the present invention cannot be interpreted as.It should be pointed out that for those of ordinary skill in the art
For, without departing from the inventive concept of the premise, various modifications and improvements can be made, these belong to the guarantor of the present invention
Protect scope.Therefore, the protection domain of patent of the present invention should be determined by the appended claims.
Claims (10)
1. a kind of automatically switching optical networks little particle service path planing method, it is characterised in that including step：
The initial data of automatically switching optical networks is gathered, according to the Raw Data Generation network model data, wherein network mould
Type data include the data of network topology data and each little particle business to be planned；
According to the data of each little particle business, the little particle business with identical source device and host device is incorporated to each subservice and is arranged
Table；
It is each virtual service by the end-to-end convergence of the little particle business that high-order business can be filled up in each subservice list, it is remaining
Little particle business is arranged to each node convergence service；
According to network topology data, determine that the source device of each virtual service to the path weight value of host device, is according to path weight value
Each virtual service distribution shortest route and time slot；
According to network topology data, determine that the source device of each node convergence service to the path weight value of host device, is weighed according to path
Weight distributes shortest route and time slot for each node convergence service；
According to network topology data, determine that the source device of each virtual service to the path weight value of host device, is according to path weight value
The step of each virtual service distribution shortest route and time slot, includes：Network topology data are analyzed, net is described using undirected lax figure
The topological structure of network, and the internal data of graph style is built, each device abstract wherein in network topology is undirected lax figure
Corresponding vertex, each link are abstracted as the undirected corresponding side of lax figure；
According to network topology data, determine that the source device of each node convergence service to the path weight value of host device, is weighed according to path
The step of weight distributes shortest route and time slot for each node convergence service includes：Network topology data are analyzed, using undirected lax
The topological structure of figure description network, and the internal data of graph style is built, each device abstract wherein in network topology is nothing
To the corresponding vertex of lax figure, the VC4 of each link is abstracted as the undirected corresponding side of lax figure.
2. automatically switching optical networks little particle service path planing method according to claim 1, it is characterised in that according to
Network topology data, determine that the source device of each virtual service is each virtual industry according to path weight value to the path weight value of host device
The step of business distribution shortest route and time slot, further includes：
The list that each virtual service is formed is traveled through, obtains the virtual service of selection；
According to the weight equation of end-to-end convergence service, the weight on each side in undirected lax figure is updated；
According to undirected lax figure and the weight on each side, shortest path first is called to determine the virtual service source device to host device
Most short weight path；
According to the most short weight path, principle is taken in sequence on each bar link being routed across for the virtual service
Distribute VC4 time slots；
It is the virtual service distribution VC12 time slots under the VC4 time slots of distribution；
Judge whether each virtual service time slot distribution is completed, if not, the step of returning to the list for traveling through each virtual service composition.
3. automatically switching optical networks little particle service path planing method according to claim 2, it is characterised in that described
The weight equation of end-to-end convergence service is：
Weight=TotalVC4TimeSlot/IdleVC4TimeSlot；
Weight=NA (IdleVC4TimeSlot=0)；
Wherein, TotalVC4TimeSlot describes the total VC4 timeslot numbers of link, and IdleVC4TimeSlot describes the free time of link
Timeslot number, VC4 timeslot numbers-business that free timeslot number=link of link is total take timeslot number, IdleVC4TimeSlot>0,
NA represents infinitely great.
4. automatically switching optical networks little particle service path planing method according to claim 1, it is characterised in that according to
Network topology data, determine that the source device of each node convergence service is each section according to path weight value to the path weight value of host device
The step of point convergence traffic assignments shortest route and time slot, further includes：
The list that each node convergence service is formed is traveled through, obtains the node convergence service of selection；
According to node convergence service side weight equation, the weight of the undirected lax Tu Gebian of renewal；
According to undirected lax figure and the weight on each side, shortest path first is called to determine the node convergence service source device to place
The most short weight path of equipment；
According to the most short weight path, VC4 time slots are distributed on each bar link being routed across for the node convergence service；
It is the node convergence service distribution VC12 time slots on the VC4 time slots of distribution；
Judge whether each node convergence service time slot distribution is completed, the list that each node convergence service is formed is traveled through if not, returning
The step of.
5. automatically switching optical networks little particle service path planing method according to claim 4, it is characterised in that described
Node convergence service side weight equation is：
Weight=100 (IdleTimeSlot>TotalLowerSlot)
Weight=100*Slack (LowTimeSlot<=IdleTimeSlot<=TotalLowerSlot)
Weight=NA (IdleTimeSlot<LowTimeSlot)
Wherein, IdleTimeSlot describes VC12 timeslot numbers idle in VC4, and TotalLowerSlot describes institute in a link
There is the timeslot number of VC12, LowTimeSlot describes all VC12 timeslot numbers in VC4, and Slack describes the convergence coefficient on VC4 sides, NA
Represent infinitely great.
A kind of 6. automatically switching optical networks little particle service path device for planning, it is characterised in that including：
Network model data generation module, for gathering the initial data of automatically switching optical networks, gives birth to according to the initial data
Into network model data, wherein network model data includes the data of network topology data and each little particle business to be planned；
Subservice List Generating Module, for the data according to each little particle business, by with identical source device and host device
Little particle business is incorporated to each subservice list；
Service convergence module, for being by the end-to-end convergence of the little particle business that high-order business can be filled up in each subservice list
Each virtual service, remaining little particle business are arranged to each node convergence service；
Virtual service path planning module, for according to network topology data, determining the source device of each virtual service to host device
Path weight value, distribute shortest route and time slot according to path weight value for each virtual service；
Node traffic path planning module, for according to network topology data, determining the source device of each node convergence service to place
The path weight value of equipment, shortest route and time slot are distributed according to path weight value for each node convergence service；
The virtual service path planning module includes：Undirected lax figure construction unit, for analyzing network topology data, uses
Undirected lax figure describes the topological structure of network, and builds the internal data of graph style, each equipment wherein in network topology
The undirected corresponding vertex of lax figure is abstracted as, each link is abstracted as the undirected corresponding side of lax figure；
The node traffic path planning module includes：Non-directed graph construction unit, for analyzing network topology data, use is undirected
Lax figure describes the topological structure of network, and builds the internal data of graph style, each device abstract wherein in network topology
For the undirected lax corresponding vertex of figure, the VC4 of each link is abstracted as the undirected corresponding side of lax figure.
7. automatically switching optical networks little particle service path device for planning according to claim 6, it is characterised in that described
Virtual service path planning module further includes：
Virtual service acquiring unit, for traveling through the list of each virtual service composition, obtains the virtual service of selection；
Weight updating block, for the weight equation according to end-to-end convergence service, updates the weight on each side in undirected lax figure；
Most short weight path determination unit, for the weight according to undirected lax figure and each side, calls shortest path first to determine
Most short weight path of the virtual service source device to host device；
VC4 time slot allocating units, are the virtual service in each bar chain being routed across for according to the most short weight path
Principle distribution VC4 time slots are taken on road in sequence；
VC12 time slot allocating units, for being the virtual service distribution VC12 time slots under the VC4 time slots of distribution；
Judging unit, for judging whether each virtual service time slot distribution is completed.
8. automatically switching optical networks little particle service path device for planning according to claim 7, it is characterised in that described
The weight equation of end-to-end convergence service is：
Weight=TotalVC4TimeSlot/IdleVC4TimeSlot；
Weight=NA (IdleVC4TimeSlot=0)；
Wherein, TotalVC4TimeSlot describes the total VC4 timeslot numbers of link, and IdleVC4TimeSlot describes the free time of link
Timeslot number, VC4 timeslot numbers-business that free timeslot number=link of link is total take timeslot number, IdleVC4TimeSlot>0,
NA represents infinitely great.
9. automatically switching optical networks little particle service path device for planning according to claim 6, it is characterised in that described
Node traffic path planning module further includes：
Node convergence service acquiring unit, the list formed for traveling through each node convergence service, obtains the node convergence of selection
Business；
Each side right weight updating block, for according to node convergence service side weight equation, the weight of the undirected lax Tu Gebian of renewal；
Shortest path determination unit, for the weight according to undirected lax figure and each side, calls shortest path first to determine described
Most short weight path of the node convergence service source device to host device；
High-order time slot allocating unit, is being routed across for most short weight path, the node convergence service according to
VC4 time slots are distributed on each bar link；
Low order time slot allocating unit, for being the node convergence service distribution VC12 time slots on the VC4 time slots of distribution；
Detection unit, for judging whether each node convergence service time slot distribution is completed.
10. automatically switching optical networks little particle service path device for planning according to claim 9, it is characterised in that institute
Stating node convergence service side weight equation is：
Weight=100 (IdleTimeSlot>TotalLowerSlot)
Weight=100*Slack (LowTimeSlot<=IdleTimeSlot<=TotalLowerSlot)
Weight=NA (IdleTimeSlot<LowTimeSlot)
Wherein, IdleTimeSlot describes VC12 timeslot numbers idle in VC4, and TotalLowerSlot describes institute in a link
There is the timeslot number of VC12, LowTimeSlot describes all VC12 timeslot numbers in VC4, and Slack describes the convergence coefficient on VC4 sides, NA
Represent infinitely great.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510227647.2A CN104967566B (en) | 2015-05-06 | 2015-05-06 | Automatically switching optical networks little particle service path method and device for planning |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510227647.2A CN104967566B (en) | 2015-05-06 | 2015-05-06 | Automatically switching optical networks little particle service path method and device for planning |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104967566A CN104967566A (en) | 2015-10-07 |
| CN104967566B true CN104967566B (en) | 2018-04-13 |
Family
ID=54221513
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510227647.2A Active CN104967566B (en) | 2015-05-06 | 2015-05-06 | Automatically switching optical networks little particle service path method and device for planning |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104967566B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115412784A (en) * | 2022-08-30 | 2022-11-29 | 武汉烽火技术服务有限公司 | Low-order service bearing method and device |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1540934A (en) * | 2003-04-24 | 2004-10-27 | 华为技术有限公司 | Implementing method for optimizing multiple services in optical synchronization data transportation network |
| CN1691550A (en) * | 2004-04-21 | 2005-11-02 | 华为技术有限公司 | Service protection device in optical communication network and method thereof |
| CN1791000A (en) * | 2004-12-17 | 2006-06-21 | 电子科技大学 | Integrated service leading method for WDM optical network |
| CN101052235A (en) * | 2007-05-08 | 2007-10-10 | 华为技术有限公司 | Business combing method and device for ASON special protection |
| CN101969582A (en) * | 2009-07-27 | 2011-02-09 | 中兴通讯股份有限公司 | Link bundle label distribution system and method |
-
2015
- 2015-05-06 CN CN201510227647.2A patent/CN104967566B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1540934A (en) * | 2003-04-24 | 2004-10-27 | 华为技术有限公司 | Implementing method for optimizing multiple services in optical synchronization data transportation network |
| CN1691550A (en) * | 2004-04-21 | 2005-11-02 | 华为技术有限公司 | Service protection device in optical communication network and method thereof |
| CN1791000A (en) * | 2004-12-17 | 2006-06-21 | 电子科技大学 | Integrated service leading method for WDM optical network |
| CN101052235A (en) * | 2007-05-08 | 2007-10-10 | 华为技术有限公司 | Business combing method and device for ASON special protection |
| CN101969582A (en) * | 2009-07-27 | 2011-02-09 | 中兴通讯股份有限公司 | Link bundle label distribution system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104967566A (en) | 2015-10-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105721962B (en) | System, method and integrated manipulator for communication network | |
| CN104704759B (en) | The transmitting function virtualization of optical-fiber network based on wavelength-division multiplex (WDM) | |
| CN105721961B (en) | Wavelength and the spectrum assignment being grouped in optical-fiber network | |
| CN106789707B (en) | A kind of software definition Packet Transport Network overall situation service dynamic optimization method and device | |
| CN105049353B (en) | A kind of method and controller for business configuration routed path | |
| CN104244118B (en) | The construction method of modularization interference networks based on array waveguide grating | |
| CN106302153A (en) | Multiple domain controller, single domain controller, software definition optical network system and method | |
| CN106506110A (en) | Statistic multiplexing optical transfer network method and device | |
| Schwartz et al. | The gradient projection algorithm for multiple routing in message-switched networks | |
| CN105072035B (en) | A kind of generation method and system of optical transfer network atom route | |
| CN106716880B (en) | A kind of Packet Service is mapped to the method and OTN equipment of optical transport network | |
| CN105939499A (en) | Rapid configuration method and system for transport network tunnels of mobile POTN (Packet enhanced Optical Transport Network) | |
| CN108134967A (en) | A kind of electric power optical-fiber network routing frequency spectrum distributing method and system | |
| CN106998295B (en) | Optimized routing and spectrum allocation method and system based on special protection combined fault probability constraint | |
| CN101420321A (en) | SDH network planning design method for multi-modularized optical fiber | |
| CN105007220B (en) | Inter-domain routing manages system, method, field adapter and transmission network | |
| CN109379281A (en) | A kind of traffic scheduling method and system based on time window | |
| CN108989916A (en) | A kind of cross-domain protection networking of power distribution communication net towards quantum protection communication service | |
| RU2623897C2 (en) | Method and device for management of packages | |
| CN105472484A (en) | Wave channel balancing route wavelength allocation method of power backbone optical transport network | |
| CN104967566B (en) | Automatically switching optical networks little particle service path method and device for planning | |
| CN101944150B (en) | Method for automatically generating wave channel graph by programming in wavelength division system | |
| KR20170102104A (en) | Service function chaining network system for path optimization and the method for thereof | |
| CN105430538B (en) | A kind of inter-domain routing method based on optical-fiber network subtopology figure | |
| CN103716183B (en) | The management method and device of a kind of optical transfer network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200924 Address after: 510620 Tianhe District, Guangzhou, Tianhe South Road, No. two, No. 2, No. Patentee after: Guangzhou Power Supply Bureau of Guangdong Power Grid Co.,Ltd. Address before: 510620 Tianhe District, Guangzhou, Tianhe South Road, No. two, No. 2, No. Patentee before: GUANGZHOU POWER SUPPLY Co.,Ltd. |
|
| TR01 | Transfer of patent right |