CN110139173A - A kind of network dividing area method reducing optical transfer network end-to-end time delay - Google Patents
A kind of network dividing area method reducing optical transfer network end-to-end time delay Download PDFInfo
- Publication number
- CN110139173A CN110139173A CN201910376041.3A CN201910376041A CN110139173A CN 110139173 A CN110139173 A CN 110139173A CN 201910376041 A CN201910376041 A CN 201910376041A CN 110139173 A CN110139173 A CN 110139173A
- Authority
- CN
- China
- Prior art keywords
- node
- time delay
- combination
- network
- end time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- 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
- H04Q11/0067—Provisions for optical access or distribution networks, e.g. Gigabit Ethernet Passive Optical Network (GE-PON), ATM-based Passive Optical Network (A-PON), PON-Ring
-
- 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/0079—Operation or maintenance aspects
- H04Q2011/0083—Testing; Monitoring
Abstract
The invention discloses a kind of network dividing area methods for reducing optical transfer network end-to-end time delay, belong to technical field of photo communication.Topology to be optimized, ideal number of partitions m and participation in the election node set N are inputted first；Optionally m node constructs combination of nodes from set N；Then topology area is repartitioned to each combination of nodes, obtains corresponding topological project；Calculate each average end-to-end time delay value for combining updated topological project；Point domain topological project for finally selecting the average the smallest topological project of end-to-end time delay value optimal as time delay.The present invention can be avoided business in the end-to-end transmission of carry out business and detour, both reduced chain-circuit time delay, decrease node time delay by the reasonable network planning, so that network delay performance boost, can preferably ensure the demand of low time delay and time delay sensitive traffic.
Description
Technical field
The invention belongs to technical field of photo communication, are related to optical transport network technology, and specifically a kind of reduction optical transfer network end is arrived
The network dividing area method of terminal delay time.
Background technique
Universal with Internet application with the development of communication technology, part industry and business mention the delay performance of network
Extremely harsh requirement is gone out, network delay performance is increasingly becoming one of emerging hot spot of the communications field.Optical transfer network (OTN) skill
Art has merged the electric layer processing and network management energy of synchronous digital system (SDH) technology based on wavelength-division multiplex (WDM) technology
Power has traffic scheduling flexibly and the advantage of high capacity transmission；Further, since business level is lower and transmits for rigid conduit,
OTN technology also has the advantage of low time delay and low time delay shake, is the optimal selection for constructing low time delay network.
Traditional communication network generallys use the control mode in stratified set, splits the network into multiple regions, Mei Gequ
Domain includes a server, is responded to the service request in the region, meanwhile, these region servers are again by the clothes of general headquarters
Business device is regulated and controled.When business is to region server request content, if the server includes this content, by region server
The request is responded, otherwise from the server to headquarters server send request, and by headquarters server to the request into
Row response.Although OTN has time delay advantage, chain-circuit time delay is still inevitable.Under this layering centralized control,
For larger Backbone Transport Network, part of nodes between headquarters server at a distance from it is excessive, cause chain-circuit time delay compared with
Greatly, thus traffic affecting delay performance.
In order to improve network delay performance, the strategy of Ying Caiyong network flattening replaces tradition with multicenter Collaborative Control
Layering centerized fusion, i.e., the function of original headquarters server is dispersed to each region server, by each regional service
The scheduling of device Collaborative Control.Under multicenter Collaborative Control mode, in each region server other than storing local content, also store
Contents list in other region servers searches for contents list when local zone server does not include requested content
And request is initiated to comprising the content and apart from nearest region server, the service request is rung by the region server
It answers.Multicenter Collaborative Control mode can effectively reduce the transmission range of business, to reduce end-to-end time delay.It is above-mentioned to realize
Target first has to carry out region division to network and determines regional center.When network area division and central node selection do not conform to
When reason, the problems such as business of will cause detours, so that end-to-end transfer delay be made to increase.Traditional communication network such as carrier network
Usually it is foundation with administrative division to carry out network division and determines central node, it is this for network delay performance perspective
Division mode is simultaneously non-optimal., need to be using end-to-end time delay as foundation in order to meet increasingly harsh delay requirement, algorithm for design comes real
The now classifying rationally to network area and the optimal scheduling central node in determining each region.
Summary of the invention
The present invention in view of the above-mentioned problems, using traverse by the way of, by all possible network under specific input condition
Point domain scheme carries out average end-to-end time delay and calculates, and the optimal network dividing area scheme of time delay under the input condition is obtained, so that net
The region division of network and the determination of central node are more reasonable, reduce the possibility that business detours, to reach reduction business end
To the technical effect of terminal delay time, there is the advantage for improving network delay performance, ensureing low time delay and time delay sensitive traffic demand
Aspect has realistic meaning.
Specific step is as follows:
Step 1: topological G, ideal number of partitions m that input is to be optimized, and participation in the election node set N={ n1,n2,…,na}；
It is integer that the number of element, which is a, a > 1, and a, in set N；Each subregion is by a node control, i.e. m≤a；Set
Element in N is whole nodes in topology G or the part of nodes met certain condition.
Step 2: optional m node constructs a combination of nodes from a node of set N, form altogetherIt is a
Combination of nodes.
Step 3: repartitioning topology area to each combination of nodes, corresponding topological project is obtained
It is divided into following steps:
Step 301, input topology G and i-th of combination of nodes C to be optimizedi={ n1,n2,…,nm}。
Step 302, for be not belonging in topological G combination CiSome node A, the section is successively calculated with dijkstra's algorithm
Point A to combination CiIn end-to-end routed path between each node, and calculate separately the corresponding end-to-end time delay value in each path
t1,t2,…,tm。
The step of each routed path respectively corresponds an end-to-end time delay value, end-to-end time delay calculation method is as follows:
Step 1: being directed to some routed path, according to the bandwidth that network topology attribute and user specify, obtain the routing road
The node and list of link that diameter passes through.
Step 2: according to the length of every section of link in list of link, calculating the time delay of each section of link, summation obtains link
Overall delay Tl。
Step 3: judge the location of each node that the routed path passes through, in conjunction with the time delay of each node of bandwidth calculation,
Summation obtains node overall delay Tn。
Step 4: further obtaining end-to-end overall delay Tt=Tl+Tn。
Step 303, to be not belonging to combination CiNode A, select minimum value t from m end-to-end time delay valuek, and by time delay
Minimum value tkNode n in corresponding combinationkCentral node as node A.
tk=min { t1,t2,…,tm}。
Step 304, similarly is each not belonging to combination CiNode, can be according to minimum end-to-end time delay value, in combination Ci
Inside find respective central node.
Step 305 is directed to combination CiInterior certain node nk, the group is respectively not belonging to according to end-to-end minimal time delay value is corresponding
The node of conjunction is as node nkSubordinate's node；
Step 306, by node nkIt is a region with its subordinate's node division, updates topology G, obtains combination CiIt is corresponding
Topological project Gi。
Topological project GiIn include m region, each region includes a central node and its whole subordinate node, node
And the link between node is identical as original topology G.
Step 307, similarly, each combination of nodes is optimized respectively, and it is topological to obtain corresponding updates of each combination；
Including the central node in combination and each subordinate's node respectively connected in the topology of each update.
Step 4: calculating each average end-to-end time delay value for combining updated topological project；
It is divided into following steps:
First, it is directed to updated some topological project Gi, including node set are as follows:It is right
Each node in set R calculates point domain routed path of the node into set R between other each nodes；
Each of set R node will be used as source node, and by other nodes in set R as destination node, successively
Calculate corresponding point of domain routed path of sourcesink node；Detailed process is as follows:
Input divides the topological project G in regioni, source node src and destination node des；Obtain source node and destination node respectively
Affiliated regional center node HsrcAnd Hdes.Then, judge source node src and destination node des regional center node whether phase
Together, if so, source node src and destination node des belong to the same area, divide domain routed path using dijkstra's algorithm calculating
Path: for src → Hsrc→des；Otherwise not same area carries out recycling dijkstra's algorithm after dividing as follows according to nodal community
Calculate routed path:
Finally, a point domain routed path set is obtained
Then, each divide domain routed path corresponding end-to-end time delay value in set of computations P, and form set Q；
End-to-end time delay results set
Finally, according to end-to-end time delay results set Q, topological project G is calculatediThe whole network be averaged end-to-end time delay value Ti。
Wherein j=1,2 ..., | Gi|×(|Gi|-1)。
Similarly, the whole network for obtaining each updated topological project is averaged end-to-end time delay value；
Step 5: point domain topological project for selecting the average the smallest topological project of end-to-end time delay value optimal as time delay.
The present invention has the advantages that
(1) a kind of network dividing area method for reducing optical transfer network end-to-end time delay, can be according to the number of regions of input and full
The node of sufficient condition is that constraint carries out region division and selection area central node to network with time delay, can be effectively reduced industry
The end-to-end transfer delay of business improves network delay performance.
(2) a kind of network dividing area method for reducing optical transfer network end-to-end time delay, is based on multicenter Collaborative Control feature, root
Segmentation shortest path is carried out using classical dijkstra's algorithm according to the sourcesink node and affiliated area of business to calculate, and industry can be obtained
The most short point of domain routing of business, reduces chain-circuit time delay.
(3) a kind of network dividing area method for reducing optical transfer network end-to-end time delay, the time delay based on OTN network are constituted, can
The end-to-end time delay of business is obtained according to the bandwidth and router-level topology of OTN equipment feature and specific business, to obtain network
Average end-to-end time delay is the basis for carrying out low time delay network dividing area.
Detailed description of the invention
Fig. 1 is a kind of step flow chart for the network dividing area method for reducing optical transfer network end-to-end time delay of the present invention；
Fig. 2 is a kind of step flow chart for dividing domain route computing method of the present invention；
Fig. 3 is a kind of step flow chart of OTN teleservice time-delay calculation method of the present invention；
Fig. 4 is the six node topology figures for not dividing domain used in the embodiment of the present invention；
Fig. 5 is the six node topology figures for having divided domain used in the embodiment of the present invention.
Specific embodiment
Below in conjunction with attached drawing and example, the present invention is described in further detail.
A kind of network dividing area method for reducing optical transfer network end-to-end time delay of the present invention, as shown in Figure 1, being divided into following step
It is rapid:
Step 1: topological G, ideal number of partitions m that input is to be optimized, and participation in the election node set N={ n1,n2,…,na}；
It is integer that the number of element, which is a, a > 1, and a, in set N；Each subregion is by a node control, i.e. m≤a；Set
Element in N is whole nodes in topology G or the part of nodes met certain condition.
Step 2: optional m node constructs a combination of nodes from a node of set N, form altogetherIt is a
Combination of nodes.
Wherein, m central node in participation in the election central node set N is included in each combination of nodes.
Step 3: repartitioning topology area to each combination of nodes, corresponding topological project is obtained；
It is divided into following steps:
Step 301, input topology G and i-th of combination of nodes C to be optimizedi={ n1,n2,…,nm}。
Step 302, for be not belonging in topological G combination CiSome node A, the section is successively calculated with dijkstra's algorithm
Point A to combination CiIn end-to-end routed path between each node, and calculate separately the corresponding end-to-end time delay value in each path
t1,t2,…,tm。
Each routed path respectively corresponds an end-to-end time delay value, as shown in figure 3, the step of end-to-end time delay calculation method
It is rapid as follows:
The first step, input topological diagram G and certain business traffic=(B, P)；
Wherein, B is the bandwidth of business, user specified value；P is the routed path of the business, and each business has unique road
By path.
Second step obtains the node set n that this routed path P is passed throughlist={ n1,n2,…,nkAnd link set llist
={ l1,l2,…,lk-1}。
Third step, according to llistThe chain-circuit time delay of calculating business；
To llistIn each of the links li, obtain the length of this link in topology GWhenWhen this
The time delay of linkWhenWhen this link time delay
The then total link time delay of this businessWherein, i=1,2 ..., k-1.
4th step, according to nlistThe node time delay of calculating business；
To nlistIn each node ni, its time delay is calculated according to its present positionThen when total node of this business
ProlongWherein, i=1,2 ..., k.
Node niTime delay valueIt is as follows with the relationship of its present position:
Wherein:
(1) time delay of intermediate node and the exchanged form of selection are related, if by light layer devices reality when signal passes through node
Existing photosphere is through, thenFor light break-through time delay Tthrough；OtherwiseFor electric switching delay Tswitch；
(2) electric switching delay TswitchWith light break-through time delay TthroughIt is related with specific capacity of equipment, it needs as the case may be
To be arranged.
(3) time delay T is encapsulatedencapWith decapsulation time delay TdecapWith capacity of equipment, service bandwidth and specific mapping multiplexing road
Diameter is related:
When service bandwidth is greater than capacity of equipment, mapping is packaged after need to splitting to business again；Every increase level-one
Multiplexing, time delay increase 0.512us.It is inversely carried out when due to decapsulation according to encapsulation mapping multiplexed path, Tencap=Tdecap。
If a) capacity of equipment meets service bandwidth, Tencap=Tdecap=0.512 × u, wherein u is business mapping multiplexing
Series；
If b) capacity of equipment is unable to satisfy service bandwidth, former business is carried out to be split as v subservice and 1 remaining industry
Business, so that original service bandwidth=equipment maximum rate × v+ surplus lines bandwidth, Tencap=Tdecap=0.512 × (u1×v+
u2), wherein u1And u2Respectively the mapping of subservice and surplus lines is multiplexed series.
(4) FEC coding delay TcodeWith fec decoder time delay TdecodeWith complexity, service bandwidth and the business of FEC algorithm
Transmitting range is related, and specific time delay value should be determined according to selected FEC algorithm and specific application scenarios.
The corresponding end-to-end overall delay T of routed path of this business is calculated in 5th stept=Tl+Tn。
Step 303, to be not belonging to combination CiNode A, select minimum value t from m end-to-end time delay valuek, and by time delay
Minimum value tkNode n in corresponding combinationkCentral node as node A.
tk=min { t1,t2,…,tm}。
Step 304, similarly is each not belonging to combination CiNode, can be according to minimum end-to-end time delay value, in combination Ci
Inside find respective central node.
Step 305 is directed to combination CiInterior certain node nk, the group is respectively not belonging to according to end-to-end minimal time delay value is corresponding
The node of conjunction is as node nkSubordinate's node；
Step 306, by node nkIt is a region with its subordinate's node division, updates topology G, obtains combination CiIt is corresponding
Topological project Gi。
Topological project GiIn include m region, each region includes a central node and its whole subordinate node, node
And the link between node is identical as original topology G.
Step 307, similarly, each combination of nodes is optimized respectively, and it is topological to obtain corresponding updates of each combination；
Including the central node in combination and each subordinate's node respectively connected in the topology of each update.
Step 4: calculating each average end-to-end time delay value for combining updated topological project；
To each combination of nodes CiTopology area is repartitioned, topological project G is obtainedi, and calculate its it is average end-to-end when
Prolong value Ti.Topological project GiIt should make to be not belonging to combination C in former topology GiOther nodes to the central node time delay belonging to it most
It is small.
It is divided into following steps:
First, it is directed to updated some topological project Gi, including node set are as follows:It is right
Each node in set R calculates point domain routed path of the node into set R between other each nodes；
As shown in Fig. 2, detailed process is as follows: input divides the topological project G in regioni, source node src and destination node des；
Obtain source node and destination node respectively affiliated regional center node HsrcAnd Hdes.Then, judge source node src and destination node
Des whether same area, if so, source node src and destination node des central node having the same, utilize dijkstra's algorithm meter
Point counting domain routed path path: for src → Hsrc→des；Otherwise not same area carries out sharp again after dividing as follows according to nodal community
Routed path is calculated with Dijkstra algorithm:
Finally obtain final point domain routed path set
Then, each divide domain routed path corresponding end-to-end time delay value in set of computations P, and form set Q；
End-to-end time delay results set
Finally, according to end-to-end time delay results set Q, topological project G is calculatediThe whole network be averaged end-to-end time delay value Ti。
Wherein j=1,2 ..., | Gi|×(|Gi|-1)。
Similarly, the whole network for obtaining each updated topological project is averaged end-to-end time delay value；
Step 5: point domain topological project for selecting the average the smallest topological project of end-to-end time delay value optimal as time delay.
Embodiment 1
It is illustrated by taking six node topologies as an example, it is assumed that whole nodes can be used as centromere in the network
The network is divided into two regions by point, the specific steps are as follows:
1, six node topologies of input are as topology G, ideal number of partitions m=2 to be optimized, and participate in the election of central node set N=
{n1,n2,n3,n4,n5,n6}。
2, it according to topology G to be optimized, ideal number of partitions m and participation in the election central node set N, obtains all altogether
A central node combination.
Wherein, it is respectively as follows: in each central node combination comprising 2 central nodes in participation in the election central node set N
C1=(n1,n2),C2=(n1,n3),C3=(n1,n4),C4=(n1,n5),C5=(n1,n6),C6=(n2,n3),C7
=(n2,n4),C8=(n2,n5),C9=(n2,n6),C10=(n3,n4),C11=(n3,n5),C12=(n3,n6),C13=(n4,
n5),C14=(n4,n6),C15=(n5,n6)。
3, C is combined to each central nodei, according to CiTopology area is repartitioned, topological project G is obtainedi, and calculate
Its average end-to-end time delay value Ti。
With C1=(n1,n2) topological project G1For, the specific steps are as follows:
A) topology G and central node to be optimized are inputted and combines C1=(n1,n2)。
B) C is not belonging to each in topological G1=(n1,n2) node, calling divide domain method for routing and end-to-end time delay
Calculation method successively calculates the node to C1In two central nodes end-to-end time delay value, concrete outcome is as shown in the table:
| Other nodes | Central node | Time delay value/us | Central node | Time delay value/us |
| n3 | n1 | 1656.998 | n2 | 1156.448 |
| n4 | n1 | 1907.048 | n2 | 1406.498 |
| n5 | n1 | 1656.998 | n2 | 1156.448 |
| n6 | n1 | 655.948 | n2 | 905.948 |
C) C is not belonging to each in topological G1=(n1,n2) node, in C1In find a corresponding node p conduct
Its central node makes the end-to-end time delay value ratio of node-to-node p to C1In other nodes it is small, it may be assumed that
| Other nodes | Central node | Time delay value/us |
| n3 | n2 | 1156.448 |
| n4 | n2 | 1406.498 |
| n5 | n2 | 1156.448 |
| n6 | n1 | 655.948 |
D) it is a region by each central node and its subordinate's node division, updates topology G, obtain topological project G1,
That is:
4, whole topological project G are obtained according to the method described above1,G2,…,G15, to each topological project Gi, calculate its whole network
Average end-to-end time delay value Ti。
To calculate G1Time delay value T1For, the specific steps are as follows:
A) the topological project G of subregion is inputted1。
B) R={ n1,n2,n3,n4,n5,n6, it is topology G1Node set.To each node in set R, calculating should
Node other nodes into R divide domain routed path, obtain route results set:
P={ p12,p13,p14,p15,p16,p21,p23,p24,p25,p26,p31,p32,p34,p35,p36, p41,p42,p43,p45,
p46,p51,p52,p53,p54,p56,p61,p62,p63,p64,p64}
C) according to route results set P, topology G is calculated1In each node to the end-to-end time delay value of other nodes, held
To terminal delay time results set:
Q={ t12,t13,t14,t15,t16,t21,t23,t24,t25,t26,t31,t32,t34,t35,t36, t41,t42,t43,t45,
t46,t51,t52,t53,t54,t56,t61,t62,t63,t64,t64}
D) according to end-to-end time delay results set Q, topological project G is calculated1The whole network be averaged end-to-end time delay value T1Pair, i.e.,
T1In all time delay values be averaged.
5, whole topological project G are obtained according to the method described above1,G2,…,G15Whole end-to-end time delay value T1,T2,…,
T15, concrete outcome is as follows:
6, the average the smallest topological project G of end-to-end time delay value is selected15As optimization topological project Go, GoIt is as final to obtain
To time delay it is optimal divide domain topological.As shown in figure 5, specifically dividing domain situation as follows:
| Region | Central node | Other nodes |
| area1 | n5 | n3,n4 |
| area2 | n6 | n1,n2 |
Embodiment 2
As shown in figure 5, six node topology G have divided region, node is calculated separately in this topology to (n3,n4),(n5,
n6),(n5,n1),(n3,n6),(n4,n1) between divide domain routed path.
(A) source node src=n3, destination node des=n4
1, input has divided topological G, the source node src=n in region3, destination node des=n4；
2, source is obtained according to the region division of G, the central node of destination node is respectively Hsrc=n5、Hdes=n5；
3, area1 is belonged to according to the region division source of G, destination node, therefore D-algorithm is utilized to calculate src → Hdes→ des,
Path=[n can be obtained3,n5,n4]。
(B) source node src=n5, destination node des=n6
1, input has divided topological G, the source node src=n in region5, destination node des=n6；
2, source is obtained according to the region division of G, the central node of destination node is respectively Hsrc=n5、Hdes=n6；
3, area1, area2, and node n are adhered to separately according to the region division source of G, destination node5、n6It is regional center
Node, therefore D-algorithm is utilized to calculate src → des, path=[n can be obtained5,n6]。
(C) source node src=n5, destination node des=n1
1, input has divided topological G, the source node src=n in region5, destination node des=n1；
2, source is obtained according to the region division of G, the central node of destination node is respectively Hsrc=n5、Hdes=n6；
3, area1, area2, and node n are adhered to separately according to the region division source of G, destination node5For center node, node
n1Non-central node, therefore dijkstra's algorithm is utilized to calculate src → HdesPath=[n can be obtained in → des5,n6,n1]。
(D) source node src=n3, destination node des=n6
1, input has divided topological G, the source node src=n in region3, destination node des=n6；
2, source is obtained according to the region division of G, the central node of destination node is respectively Hsrc=n5、Hdes=n6；
3, area1, area2, and node n are adhered to separately according to the region division source of G, destination node3Non-central node, node
n6For center node, therefore D-algorithm is utilized to calculate src → HsrcPath=[n can be obtained in → des3,n5,n6]。
(E) source node src=n4, destination node des=n1
1, input has divided topological G, the source node src=n in region4, destination node des=n1；
2, source is obtained according to the region division of G, the central node of destination node is respectively Hsrc=n5、Hdes=n6；
3, area1, area2, and node n are adhered to separately according to the region division source of G, destination node4、n1Non-central node,
Therefore D-algorithm is utilized to calculate src → Hsrc→HdesPath=[n can be obtained in → des4,n5,n6,n1]。
Embodiment 3
As shown in figure 5, six node topology G have divided region, it is known that business routed path P=[n4,n5,n6,n1], it is assumed that
Service bandwidth B=1000MHz calculates in this topology node to (n4,n1) between business end-to-end time delay.It is false for convenience of narration
If topological interior joint is 100Gbps OTN equipment, intermediate node is dispatched using photosphere.Specific step is as follows:
1, topology G, business traffic=(B, P)=(1000MHz, [n is inputted4,n5,n6,n1])；
2, this business institute is obtained through node set nlist={ n4,n5,n6,n1, link set llist={ (n4,n5),
(n5,n6),(n6,n1)}；
3, according to llistThe chain-circuit time delay of calculating business:
That is, the end-to-end link overall delay T of this businessl=1750.1us.
4, according to nlistThe node time delay of calculating business:
| Node | Present position | Node time delay is constituted |
| n4 | Source | Tswitch+Tencap+Tcode |
| n5 | It is intermediate | Tthrough |
| n6 | It is intermediate | Tthrough |
| n1 | Place | Tswitch+Tdecap+Tdecode |
Above-mentioned each value is described as follows:
(1) the electric switching delay of OTN equipment and light break-through time delay are related with specific capacity of equipment, and value is herein
Tswitch=2us, Tthrough=0.05us；
(2) capacity of equipment is 100Gbps in this example, and service bandwidth 1000MHz is split without to business.
Specific business mapping path is traffic → ODU0 → ODU1 → OTU1, i.e. business mapping multiplexing series u=3,
Therefore Tencap=Tdecap=0.512 × 3=1.536us.
(3) the FEC algorithm selected in this example it is long away from/ultra long haul transmission scene knit stitch to different business transmission rate not
Together, transceiver overall latency measured value is as shown in the table:
Business packed maps to OTU1 in this example, i.e., the transmission rate in the line side OTN is 2.5Gbps, therefore has transmitting-receiving to set
The sum of standby overall latency Tcode+Tdecode=149.4us.
That is, passing through the end-to-end node overall delay that can be calculated this business are as follows:
Tn=2 × Tswitch+2×Tthrough+Tencap+Tdecap+Tcode+Tdecode
=2 × 2+2 × 0.05+1.536+1.536+149.4=156.572us
5, the overall delay of this business is calculated:
Tt=Tl+Tn=1750.1+156.572=1906.672us.
Embodiment 1 is a kind of specific implementation case for the network dividing area method for reducing optical transfer network end-to-end time delay of the present invention
Example.Embodiment 2,3 is one kind point domain route computing method used in the present invention and a kind of OTN teleservice time-delay calculation side
The specific implementation case of method.Can be seen that a different point domain schemes from the data in embodiment 1 in table shown in step 5 will be right
The end-to-end average delay of network generates different influences, when network dividing area and reasonable central node selection, can effectively reduce
The end-to-end time delay value of network.The result final from embodiment 1 can be seen that through the invention a kind of reduction optical transfer network end to
Optimal network dividing area scheme can be obtained in the network dividing area method of terminal delay time, keeps the average end-to-end time delay of network optimal, network
Delay performance promoted, can preferably ensure the delay requirement of business.
Claims (3)
1. a kind of network dividing area method for reducing optical transfer network end-to-end time delay, which is characterized in that specific step is as follows:
Step 1: topological G, ideal number of partitions m that input is to be optimized, and participation in the election node set N={ n1,n2,…,na}；
It is integer that the number of element, which is a, a > 1, and a, in set N；Each subregion is by a node control, i.e. m≤a；In set N
Element be whole nodes or the part of nodes that meets certain condition in topology G；
Step 2: optional m node constructs a combination of nodes from a node of set N, form altogetherA node
Combination；
Step 3: repartitioning topology area to each combination of nodes, corresponding topological project is obtained；
It is divided into following steps:
Step 301, input topology G and i-th of combination of nodes C to be optimizedi={ n1,n2,…,nm}；
Step 302, for be not belonging in topological G combination CiSome node A, node A is successively calculated with dijkstra's algorithm and is arrived
Combine CiIn end-to-end routed path between each node, and calculate separately the corresponding end-to-end time delay value t in each path1,
t2,…,tm；
Step 303, to be not belonging to combination CiNode A, select minimum value t from m end-to-end time delay valuek, and time delay is minimum
Value tkNode n in corresponding combinationkCentral node as node A；
tk=min { t1,t2,…,tm}；
Step 304, similarly is each not belonging to combination CiNode, can be according to minimum end-to-end time delay value, in combination CiInside look for
To respective central node；
Step 305 is directed to combination CiInterior certain node nk, the combination is respectively not belonging to according to end-to-end minimal time delay value is corresponding
Node is as node nkSubordinate's node；
Step 306, by node nkIt is a region with its subordinate's node division, updates topology G, obtains combination CiIt is corresponding to open up
Flutter scheme Gi；
Topological project GiIn include m region, each region includes a central node and its whole subordinate node, node and section
Link between point is identical as original topology G；
Step 307, similarly, each combination of nodes is optimized respectively, and it is topological to obtain corresponding updates of each combination；
Including the central node in combination and each subordinate's node respectively connected in the topology of each update；
Step 4: calculating each average end-to-end time delay value for combining updated topological project；
Step 5: point domain topological project for selecting the average the smallest topological project of end-to-end time delay value optimal as time delay.
2. a kind of network dividing area method for reducing optical transfer network end-to-end time delay as described in claim 1, which is characterized in that institute
In the step 302 stated, the step of each routed path respectively corresponds an end-to-end time delay value, end-to-end time delay calculation method, is such as
Under:
Step 1: being directed to some routed path, according to the bandwidth that network topology attribute and user specify, obtain routed path warp
The node and list of link crossed；
Step 2: according to the length of every section of link in list of link, calculate the time delay of each section of link, summation obtain link it is total when
Prolong Tl；
Step 3: the location of each node that the routed path passes through is judged, in conjunction with the time delay of each node of bandwidth calculation, summation
Obtain node overall delay Tn；
Step 4: further obtaining end-to-end overall delay Tt=Tl+Tn。
3. a kind of network dividing area method for reducing optical transfer network end-to-end time delay as described in claim 1, which is characterized in that institute
The step of stating four is divided for following steps:
First, it is directed to updated some topological project Gi, including node set are as follows:To set
Each node in R calculates point domain routed path of the node into set R between other each nodes；
Each of set R node will be used as source node, and other nodes in set R are successively calculated as destination node
Corresponding point of domain routed path of sourcesink node；Detailed process is as follows:
Input divides the topological project G in regioni, source node src and destination node des；It is respectively affiliated to obtain source node and destination node
Regional center node HsrcAnd Hdes；Then, judge whether the regional center node of source node src and destination node des are identical, if
It is that source node src and destination node des belong to the same area, divides domain routed path path using dijkstra's algorithm calculating: for
src→Hsrc→des；Otherwise not same area carries out recycling dijkstra's algorithm to calculate routing after dividing as follows according to nodal community
Path:
Finally, a point domain routed path set is obtained
Then, each divide domain routed path corresponding end-to-end time delay value in set of computations P, and form set Q；
End-to-end time delay results set
Finally, according to end-to-end time delay results set Q, topological project G is calculatediThe whole network be averaged end-to-end time delay value Ti；
Wherein j=1,2 ..., | Gi|×(|Gi|-1)；
Similarly, the whole network for obtaining each updated topological project is averaged end-to-end time delay value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910376041.3A CN110139173B (en) | 2019-05-07 | 2019-05-07 | Network domain division method for reducing end-to-end time delay of optical transport network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910376041.3A CN110139173B (en) | 2019-05-07 | 2019-05-07 | Network domain division method for reducing end-to-end time delay of optical transport network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110139173A true CN110139173A (en) | 2019-08-16 |
| CN110139173B CN110139173B (en) | 2020-03-27 |
Family
ID=67576406
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910376041.3A Active CN110139173B (en) | 2019-05-07 | 2019-05-07 | Network domain division method for reducing end-to-end time delay of optical transport network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110139173B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113193993A (en) * | 2021-04-19 | 2021-07-30 | 天津大学 | Aerospace Ethernet topology optimization method |
| CN116346705A (en) * | 2023-05-29 | 2023-06-27 | 广东省电信规划设计院有限公司 | Optical transmission network intelligent deployment method and device based on time delay measurement and calculation |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102325039A (en) * | 2011-06-09 | 2012-01-18 | 国网电力科学研究院 | ASON (Automatically Switched Optical Network) optimization design method orienting to electric power control business |
| CN107070794A (en) * | 2016-12-08 | 2017-08-18 | 航天东方红卫星有限公司 | A kind of low rail information network optimal network benefit delay constraint method for routing |
-
2019
- 2019-05-07 CN CN201910376041.3A patent/CN110139173B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102325039A (en) * | 2011-06-09 | 2012-01-18 | 国网电力科学研究院 | ASON (Automatically Switched Optical Network) optimization design method orienting to electric power control business |
| CN107070794A (en) * | 2016-12-08 | 2017-08-18 | 航天东方红卫星有限公司 | A kind of low rail information network optimal network benefit delay constraint method for routing |
Non-Patent Citations (2)
| Title |
|---|
| NADIA BRAHMI，OSMAN N. C. YILMAZ ，ETC.: ""Deployment Strategies for Ultra-Reliable and Low-Latency Communication in Factory Automation"", 《2015 IEEE GLOBECOM WORKSHOPS (GC WKSHPS)》 * |
| 余景文，李俊杰: ""光网络低时延特性分析及优化思路"", 《电信网技术》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113193993A (en) * | 2021-04-19 | 2021-07-30 | 天津大学 | Aerospace Ethernet topology optimization method |
| CN113193993B (en) * | 2021-04-19 | 2022-05-10 | 天津大学 | Aerospace Ethernet topology optimization method |
| CN116346705A (en) * | 2023-05-29 | 2023-06-27 | 广东省电信规划设计院有限公司 | Optical transmission network intelligent deployment method and device based on time delay measurement and calculation |
| CN116346705B (en) * | 2023-05-29 | 2023-09-19 | 广东省电信规划设计院有限公司 | Optical transmission network intelligent deployment method and device based on time delay measurement and calculation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110139173B (en) | 2020-03-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103650435B (en) | Routing traffic method of adjustment, device and controller | |
| US6882627B2 (en) | Methods and apparatus for selecting multiple paths taking into account shared risk | |
| US7889675B2 (en) | Method and system for multi-layer network routing | |
| CN106789707B (en) | A kind of software definition Packet Transport Network overall situation service dynamic optimization method and device | |
| CN103379032B (en) | The acquisition methods and device, sub-route computational entity of cross-domain end-to-end route | |
| CN103346979B (en) | Flow distribution method and equipment in SPBM network | |
| CN108111411B (en) | Backbone network and dynamic path planning system and planning method thereof | |
| CN101083548A (en) | Multi-domain routing computation method and system | |
| CN104518961B (en) | It is grouped the leading method and device of optical transport network | |
| CN105472484B (en) | A kind of electric power backbone Optical Transmission Network OTN radio frequency channel proportional routing Wavelength allocation method | |
| KR20100071855A (en) | A resource management and recursive path computation for real-time automatic path setup at multi-layer transport network | |
| CN108966053A (en) | A kind of cross-domain route computing method of multiple-domain network dynamic domain sequence and device | |
| CN110139173A (en) | A kind of network dividing area method reducing optical transfer network end-to-end time delay | |
| Zheng et al. | Dependence-aware service function chain embedding in optical networks | |
| CN108833142A (en) | A kind of network plan method of multi-core optical fiber planning business | |
| CN105007223A (en) | Optical network dynamic multicast routing wavelength allocation method based on optical hierarchical structure | |
| CN105430538B (en) | A kind of inter-domain routing method based on optical-fiber network subtopology figure | |
| CN103795641B (en) | The optical network resource management method mapped based on multidimensional frame | |
| CN108174446B (en) | Network node link resource joint distribution method with minimized resource occupancy | |
| CN104917677A (en) | Data stream forwarding control method and system | |
| CN101742366B (en) | QOS-assuring parameterized label forwarding method for optical packet network | |
| CN104702510B (en) | Message forwarding method and device in a kind of RPR networks | |
| CN114745227B (en) | Electric power business network slicing time delay calculation method and device based on FlexE and SPN technologies | |
| CN110062301A (en) | Route selection method, device, equipment and storage medium | |
| CN104506442A (en) | Multipoint-to-multipoint multicast business optical grooming method for flexible grid optical network |
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 |