CN101312464A - Method for realizing load balance in automatic exchange optical network - Google Patents
Method for realizing load balance in automatic exchange optical network Download PDFInfo
- Publication number
- CN101312464A CN101312464A CNA2008101165203A CN200810116520A CN101312464A CN 101312464 A CN101312464 A CN 101312464A CN A2008101165203 A CNA2008101165203 A CN A2008101165203A CN 200810116520 A CN200810116520 A CN 200810116520A CN 101312464 A CN101312464 A CN 101312464A
- Authority
- CN
- China
- Prior art keywords
- network
- path
- available bandwidth
- link
- node
- 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
Images
Abstract
The invention relates to a method for realizing load balancing based on synchronous digital hierarchy in an automatic switch optical network, which comprises: adopting multiple Dijkstra algorism to calculate a plurality of disjoint paths from a source node to a destination node; adopting a route calculation module to attain the available bandwidth of all chains contained in each disjoint path, adopting the minimum available bandwidth of all chains contained by each disjoint path as the maximum available bandwidth provided by the disjoint path, dividing the maximum available bandwidth of each disjoint path by the path index of the path to attain the load index of each disjoint path, and selecting a best path from a plurality of disjoint paths according to the load index. The load balancing method can reduce the service amount affected by accident network resource and can keep a certain redundancy in all resources in a network to provide protection and recovery for existed services, thereby reducing the failure rate of service protection and recovery.
Description
Technical field
The present invention relates to a kind of method that in ASON, realizes load balancing, relate in particular to the method that in based on the ASON ASON of synchronous digital hierarchy SDH, realizes load balancing, can be applicable to ASON network and other the various types of traffic engineered networks of SDH.
Background technology
Along with diverse network, traditional IP particularly, to improving constantly of operation quality requirement, traffic engineering TE technology begins to enter more and more practicality.Again to the GMPLS network, traffic engineering all begins to widely apply from IP network to the MPLS network.
Especially aspect transmission network, with of the fast development based on the ASON ASON of SDH transmission equipment of GMPLS-TE protocol suite as control plane, brought the control device of a lot of automations to optical-fiber network, for example: neighbours find automatically, automatic topological discover or the like, the change that brings aspect optical network reliability simultaneously also is huge.
ASON provides service provisioning mode flexibly for the user, and the user only needs the inlet/outlet and the corresponding constraints of specified services type and business and can realize professional foundation automatically by control plane.
Professional automatic foundation depends on the route calculating that control plane carries out according to network traffic engineering information, and the route that calculates is professional final actual route.
The ASON network also provides powerful protection restore funcitons for business; in order to provide protection to business to greatest extent and to recover; require network to have enough redundant resources that protection and recovery are provided everywhere; this just requires in automatic foundation business is to consider business is distributed to network everywhere as much as possible, realizes the load balancing of network.
In order to realize load balancing, control plane is in the traffic engineering information of carrying out must taking into full account when route is calculated various resources in the network, and the certain algorithm of foundation is distributed to load on the network equably.
A kind of so just method that realizes that in based on the ASON network of SDH network load everywhere is balanced as far as possible that the present invention describes.
G.707 method is based on (SDH Network Node Interface), IETF G-MPLS protocol suite and IETF OSPF-TE Routing Protocol described in the present invention.
Method based on the ad hot network subsequent multi-path route of load balancing in the prior art is mainly used in networks such as wireless ad hoc network, sensor network, WLAN (wireless local area network), wireless access, and the present invention is applicable to all ASON networks based on SDH.
The main method that solves load balancing in the prior art is to weigh loading level with the number of packet to be transmitted of network layer data buffering area, this method is not suitable for the network based on traffic engineering, particularly can't on the network of non-grouping exchange, use, for example, based on the ASON network of SDH.And the present invention goes for the ASON network based on SDH, and the method for its load balancing is applicable to the network of packet switching and non-grouping exchange.
The present invention does not carry out big change to route agreement and routing algorithm, need not the data that the route agreement is carried be changed, and is easy to realize.
Summary of the invention
The present invention improves the load-balancing method of prior art, is implemented in packet switching network and non-grouping switching network carries out the control of load balancing.
The invention provides a kind of method that in based on the ASON network of SDH, realizes load balancing.
Concrete technical scheme is as follows:
A kind of method that in based on the ASON network of SDH, realizes load balancing, utilize multiple dijkstra's algorithm to calculate many disjoint paths of source node to destination node, every disjoint path all is made up of with the link that is connected network node network node, it is characterized in that
Utilize the routing calculation module of ASON network to obtain the available bandwidth of all included links of every disjoint path, the minimum value of the available bandwidth of all links that every disjoint path is included, the maximum available bandwidth that can provide as this disjoint path, with the maximum available bandwidth in every disjoint path path index divided by this path, obtain the load factor in every disjoint path, according to load factor from many disjoint Path selection optimal paths
Wherein, the path index is N
i, N is the jumping figure in disjoint path, i is the load regulation index.
In time divided network, the available bandwidth of network node can provide total number of timeslots to be determined by occupied number of timeslots and network node.
In time divided network, the numerical value of the available bandwidth of link is idle timeslot number.
In the network based on SDH, the numerical value of available bandwidth equals the quantity of idle VC-4, VC-4-4c on the link or VC-4-16c.
In packet switching network, the available bandwidth of network node is determined by total packet forward ability that occupied packet forward ability and network node can provide.
In packet switching network, the numerical value of the available bandwidth of link can be by the byte bit number of data for the link unit interval.
When the business of the network carrying is higher to reliability requirement, when stability of network is relatively poor when occurring node or link failure easily, when the operating cost of apparatus for network node and link is higher or when the time-delay of network was big, load regulation index i got bigger numerical value.
When the business of the network carrying is hanged down reliability requirement, when stability of network is more not at all easy when node or link failure occurring, when the operating cost of apparatus for network node and link is low or when the time-delay of network hour, load regulation index i gets less numerical value.
Every disjoint path have an identical load regulation index i.
Every disjoint path have different load regulation index i.
By in network, implementing the method for load balancing, can try one's best under few prerequisite taking Internet resources, miscellaneous service is distributed to network everywhere.Can reduce the number of services that is influenced when Internet resources break down on the one hand, can make all resources in the network all leave certain redundancy on the other hand, reduce service protection and recover the probability of failure with to protection being provided with the business that exists and recovering.
Description of drawings
Fig. 1 realizes the schematic diagram of first embodiment of load balancing for the present invention;
Fig. 2 realizes the schematic diagram of second embodiment of load balancing for the present invention.
Embodiment
The technical problem to be solved in the present invention be in the route calculation process with the load in path as the index of selecting Actual path.Comprise a plurality of network nodes in the ASON network based on SDH, wherein, can have a link between any two network nodes, also can not have link.The present invention is that example describes with the ASON network based on SDH, and the person of ordinary skill in the field can understand, and technical scheme of the present invention is not limited in the ASON network based on SDH.
In the shortest path dijkstra's algorithm, the route computational entity will compare some index (for example jumping figure, link cost) of all possible paths, and comparative result more the superior will preferentially be used.When the actual negative of a route was loaded with method and can weighs, we can require routing algorithm that the load factor of route is compared, thereby realized that the minimum path of load is preferentially used not changing under the prerequisite that routing algorithm calculates principle.
At first, utilize many nonintersecting paths of multiple dijkstra's algorithm calculating from the source node to the destination node, concrete step is:
Topological structure operation dijkstra's algorithm Network Based calculates the shortest path of source node to destination node; If utilize dijkstra's algorithm can't calculate the shortest path of source node to destination node, so current destination node is unreachable; When calculating source node behind the shortest path of destination node, in network topology structure, delete comprise in the above-mentioned shortest path all intermediate nodes, form new network topology structure; Network topology structure operation dijkstra's algorithm based on new calculates the shortest path of source node to destination node, and the double counting source node obtains to many shortest paths of destination node; If can't calculate shortest path, illustrate so in the current network topology structure, do not existed source node to arrive the shortest path of destination node.
Every nonintersecting paths is made up of with the link that is connected network node network node, as shown in Figure 1, the network node of nonintersecting paths Path1 comprises source node S, destination node D, intermediate node node11, node12 and node13, link L11 connects source node and intermediate node node11, link L12 connects intermediate node node11 and intermediate node node12, and link L13 connects intermediate node node12 and intermediate node node13, and link L14 connects intermediate node node13 and destination node.The network node of nonintersecting paths Path2 comprises source node S, destination node D, intermediate node node14 and node15, link L21 connects source node and intermediate node node14, link L22 connects intermediate node node14 and intermediate node nod1e5, and link L23 connects intermediate node node15 and destination node.
Then, utilize routing calculation module to obtain the load of every link, just calculate the available bandwidth of every link, as shown in Figure 1, calculate link L11, L12, L13, L14, L21, the available bandwidth of L22 and L23.
Load-balancing method provided by the present invention, considered the isomerism of network, can be applied to time divided network and packet switching network, for time divided network, for example, introduced the SDH network of ASON control plane, the loading level of network node is can provide total number of timeslots to determine by occupied number of timeslots and network node.In time divided network, the numerical value of certain link available bandwidth is idle timeslot number.For example, in the network based on SDH, the numerical value of the available bandwidth of certain link equals the quantity of idle VC-4 on this link.
In the SDH network, business is generally VC-4, VC-4-4c, VC-4-16c etc.In the ASON network based on SDH, the control plane route entity should be held the corresponding idle timeslot number of all signal types on every TE Link (VC-4, VC-4-4c, VC-4-16c).Therefore when certain type service being carried out calculate, when investigating the available bandwidth of certain bar link, should obtain the available bandwidth of this link at the signal type of service request based on the route of load balancing strategy.
By such way, can be optimized at the load of various types of traffic to network.Owing to do not have direct quantitative corresponding relation between the various signal types, can carry out meticulousr adjustment to oarse-grained business by this method.
And for packet switching network, the loading level of network node is determined by total packet forward ability that occupied packet forward ability and network node can provide.In packet switching network, the available bandwidth numerical value of certain link is that this link unit interval can be by the byte bit number of data, and according to the difference of link capacity, its unit can be bps, Kbps or Mbps etc.
Behind the available bandwidth that has obtained link, the maximum load that the minimum value of the available bandwidth that every link in the nonintersecting paths can be provided can provide as this nonintersecting paths, with the maximum load of nonintersecting paths path index divided by this nonintersecting paths, obtain the load factor of nonintersecting paths, select optimal path according to load factor, wherein, the path index is N
i, N is the jumping figure in path, i is the load regulation index.
Formula below utilizing further specifies the balancing method of technical solution of the present invention to the load of certain paths:
If certain path P is L through link
1, L
2, L
3... the available bandwidth that Ln, every link can provide is respectively B
1, B
2, B
3... Bn, then our maximum load that defines this path P and can provide is:
Bmax＝min{B
1、B
2、B
3......Bn}；
The jumping figure of supposing certain path P is N, and its load factor is defined as:
I＝Bmax/N
i；
Wherein i is the load regulation index.
The present invention dynamically adjusts the load regulation index according to the network practical operation situation.By the adjusting of this index, optimal path P that route calculates is being provided under the situation of maximum load as far as possible, the quantity that takies Internet resources is as far as possible little, reduces professional node and the link failure risk that faces.
When the business of the network carrying to reliability requirement when higher, load regulation index i gets bigger numerical value, can reduce node and link failure risk that business faces like this.Because, when the business of the network carrying to reliability requirement when higher, perhaps stability of network is relatively poor, when occurring node or link failure easily, the few path of jumping figure is paid the utmost attention in selected path, and such selection can reduce because the efficient that node or link failure cause reduces.
When the business of the network carrying was relatively hanged down reliability requirement, load regulation index i got smaller numerical value, guarantees the maximum available bandwidth in path.Because when the business of the network carrying was relatively hanged down reliability requirement, perhaps stability of network was higher, when being not easy to occur node or link failure, the bigger path of available bandwidth is paid the utmost attention in selected path, and such selection can improve the speed of transfer of data, effectively utilizes bandwidth.
When the cost of apparatus for network node and link when higher, load regulation index i gets bigger numerical value, reduces node and link circuit resource that the path takies.Because, when the cost of apparatus for network node and link when higher, the few path of jumping figure is paid the utmost attention in selected path, such selection can reduce cost.
When the cost of apparatus for network node and link relatively hanged down, load regulation index i got smaller numerical value, guarantees the maximum available bandwidth in path.The bigger path of available bandwidth is paid the utmost attention in selected path, and such selection can improve the speed of transfer of data, effectively utilizes bandwidth.
When stability of network is relatively poor when occurring node or link failure easily or when the time-delay of network was big, load regulation index i got bigger numerical value.The few path of jumping figure is paid the utmost attention in selected path, can reduce because the efficient that node or link failure cause reduces, and can reduce network delay.
Better when stability of network, when being not easy node or link failure to occur or when the time-delay of network hour, load regulation index i gets smaller numerical value.The bigger path of available bandwidth is paid the utmost attention in selected path, and such selection can improve the speed of transfer of data, effectively utilizes bandwidth.
Described an ASON network based on SDH among Fig. 1, when setting up one by source node S during to destination node D professional, there are two of Path1 and Path2 in possible path.Path1 has passed through link L11, L12, four links of L13, L14, and the idle VC-4 timeslot number of four links is respectively 64,32,40 and 64, and its jumping figure is 4; Path2 has passed through link L21, L22, three links of L23, and the idle VC-4 timeslot number of three links is respectively 48,64 and 27, and its jumping figure is 3.
When the business of the network carrying to reliability requirement when higher, when stability of network is relatively poor when occurring node or link failure easily, when the operating cost of apparatus for network node and link when higher or when the time-delay of network was big, load regulation index i got bigger numerical value.
For example, at above-mentioned formula I=Bmax/N
iIn, we get load regulation index i=2 and calculate.
In Path1, maximum available bandwidth is the idle VC-4 timeslot number 32 of L12, and jumping figure N is 4, so load factor I=32/4
2=2;
In Path2, maximum available bandwidth is the idle VC-4 timeslot number 27 of L23, and jumping figure N is 3, so load factor I=27/3
2=3.
We can draw size by load factor relatively, weigh Path1 and Path2 under the load balancing strategy, and Path2 is more excellent path.From as can be seen above-mentioned, though the available bandwidth of Path1 greater than the available bandwidth of Path2, the bar number of Path1 is greater than the jumping figure of Path2, because the load regulation index is bigger numerical value 2, so jumping figure is bigger to the influence of load factor.
When the business of the network carrying is relatively hanged down reliability requirement, when stability of network better, when being not easy to occur node or link failure, when the operating cost of apparatus for network node and link is relatively lower or when the time-delay of network hour, load regulation index i gets smaller numerical value.
For example, at above-mentioned formula I=Bmax/N
iIn, we get load regulation index i=0.5 and calculate.
In Path1, maximum available bandwidth is the idle VC-4 timeslot number 32 of L12, and jumping figure N is 4, so load factor I=32/4
0.5=16;
In Path2, maximum available bandwidth is the idle VC-4 timeslot number 27 of L23, and jumping figure N is 3, so load factor I=27/3
0.5=15.59.
We can draw size by load factor relatively, weigh Path1 and Path2 under the load balancing strategy, and Path1 is more excellent path.From as can be seen above-mentioned, though the bar number of Path1 greater than the jumping figure of Path2, the available bandwidth of Path1 is greater than the available bandwidth of Path2, because the load regulation index is less numerical value 0.5, so available bandwidth is bigger to the influence of load factor.
If the load factor of many nonintersecting paths equates that by their order when multiple dijkstra's algorithm calculates nonintersecting paths, that is, the nonintersecting paths of calculating at first is as optimal path.In addition, the present invention realizes among second embodiment of load balancing that disjoint path can have different load regulation index i, as shown in Figure 2.
Described an ASON network based on SDH among Fig. 2, when setting up one by source node S during to destination node D professional, there are two of Path1 and Path2 in possible path.Path1 has passed through link L11, L12, four links of L13, L14, and the idle VC-4 timeslot number of four links is respectively 64,32,40 and 64, and its jumping figure is 4; Path2 has passed through link L21, L22, three links of L23, and the idle VC-4 timeslot number of three links is respectively 48,64 and 27, and its jumping figure is 3.
According to Path1 and Path2 loaded service to reliability requirement, the stability in Path1 and Path2 path, the network delay in the apparatus for network node in Path1 and Path2 path and the operating cost of link or Path1 and Path2 path is dynamically adjusted the load regulation index i in Path1 and Path2 path.
For example, Path1 load regulation index i
1=0.5 and the load regulation index i of Path2
2=1 calculates.
In Path1, maximum available bandwidth is the idle VC-4 timeslot number 32 of L12, and jumping figure N is 4, so load factor I=32/4
0.5=16;
In Path2, maximum available bandwidth is the idle VC-4 timeslot number 27 of L23, and jumping figure N is 3, so load factor I=27/3
1=9.
We can draw size by load factor relatively, weigh Path1 and Path2 under the load balancing strategy, and Path1 is more excellent path.
Dynamically adjust the load regulation index i in Path1 and Path2 path,, can select optimal path flexibly, effectively realize load balancing, improve the speed of transfer of data, effectively utilize bandwidth for Path1 and Path2 are provided with different load regulation indexes.
The above; only be the specific embodiment of the present invention, but protection scope of the present invention is not limited thereto, anyly is familiar with those skilled in the art in the technical scope that the present invention discloses; the variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.
Claims (10)
1, a kind of method that in based on the ASON of synchronous digital hierarchy, realizes load balancing, utilize multiple dijkstra's algorithm to calculate many disjoint paths of source node to destination node, every disjoint path all is made up of with the link that is connected network node network node, it is characterized in that
Utilize the routing calculation module of ASON to obtain the available bandwidth of all included links of every disjoint path; The minimum of a value of the available bandwidth of all links that every disjoint path is included; The maximum available bandwidth that can provide as this disjoint path; With the maximum available bandwidth in every the disjoint path path index divided by this path; Obtain the load factor in every disjoint path; According to load factor from many disjoint Path selection optimal paths
Wherein, the path index is N
i, N is the jumping figure in disjoint path, i is the load regulation index.
2, the method for claim 1 is characterized in that, in time divided network, the available bandwidth of network node can provide total number of timeslots to be determined by occupied number of timeslots and network node.
3, the method for claim 1 is characterized in that, in time divided network, the numerical value of the available bandwidth of link is idle timeslot number.
4, the method for claim 1 is characterized in that, in the network based on synchronous digital hierarchy, the numerical value of available bandwidth equals the quantity of idle VC-4, VC-4-4c on the link or VC-4-16c.
5, the method for claim 1 is characterized in that, in packet switching network, the available bandwidth of network node is determined by total packet forward ability that occupied packet forward ability and network node can provide.
6, the method for claim 1 is characterized in that, in packet switching network, the numerical value of the available bandwidth of link can be by the byte bit number of data for the link unit interval.
7, the method for claim 1, it is characterized in that, when the business of the network carrying is higher to reliability requirement, when stability of network is relatively poor when occurring node or link failure easily, when the operating cost of apparatus for network node and link is higher or when the time-delay of network was big, load regulation index i got bigger numerical value.
8, the method for claim 1, it is characterized in that, when the business of the network carrying is hanged down reliability requirement, when stability of network is more not at all easy when node or link failure occurring, when the operating cost of apparatus for network node and link is low or when the time-delay of network hour, load regulation index i gets less numerical value.
9, the method for claim 1 is characterized in that, every disjoint path have an identical load regulation index i.
10, the method for claim 1 is characterized in that, every disjoint path have different load regulation index i.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101165203A CN101312464B (en) | 2008-07-11 | 2008-07-11 | Method for realizing load balance in automatic exchange optical network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008101165203A CN101312464B (en) | 2008-07-11 | 2008-07-11 | Method for realizing load balance in automatic exchange optical network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101312464A true CN101312464A (en) | 2008-11-26 |
| CN101312464B CN101312464B (en) | 2012-06-13 |
Family
ID=40100882
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008101165203A Expired - Fee Related CN101312464B (en) | 2008-07-11 | 2008-07-11 | Method for realizing load balance in automatic exchange optical network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101312464B (en) |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2010142096A1 (en) * | 2009-06-11 | 2010-12-16 | 中兴通讯股份有限公司 | Network routing method and apparatus |
| CN102439920A (en) * | 2011-09-20 | 2012-05-02 | 华为技术有限公司 | Business cross-layer separation path computing method, device and communication system |
| CN103166985A (en) * | 2011-12-09 | 2013-06-19 | 上海盛霄云计算技术有限公司 | Global load balancing scheduling method and data transmission method and device and system |
| CN104202081A (en) * | 2014-08-28 | 2014-12-10 | 北京邮电大学 | Optical network low delay fault recovery method and system |
| WO2016078461A1 (en) * | 2014-11-18 | 2016-05-26 | 中兴通讯股份有限公司 | Path calculation method and path calculation server |
| CN105791116A (en) * | 2016-03-15 | 2016-07-20 | 上海缔安科技股份有限公司 | Data transmission routing method |
| CN104202081B (en) * | 2014-08-28 | 2017-01-04 | 北京邮电大学 | Optical-fiber network low time delay fault recovery method and system |
| CN107171955A (en) * | 2017-05-24 | 2017-09-15 | 深圳市乃斯网络科技有限公司 | The system of selection of data link and system in network |
| CN107241374A (en) * | 2016-03-28 | 2017-10-10 | 财团法人工业技术研究院 | Load balancing system, load balancing device and topology management method |
| CN107294852A (en) * | 2017-07-01 | 2017-10-24 | 台州学院 | A kind of network route method using the scattered short path collection of topology |
| CN107888398A (en) * | 2016-09-29 | 2018-04-06 | 中国联合网络通信集团有限公司 | A kind of service bearer system and control method |
| CN108111411A (en) * | 2017-12-06 | 2018-06-01 | 上海神添实业有限公司 | Backbone network and its active path planning system and planing method |
| WO2018214059A1 (en) * | 2017-05-24 | 2018-11-29 | 深圳市乃斯网络科技有限公司 | Method and system for selecting data link in network |
| CN110300426A (en) * | 2018-03-21 | 2019-10-01 | 普天信息技术有限公司 | Route selection method and device in a kind of wireless self-networking |
| CN112087397A (en) * | 2020-10-10 | 2020-12-15 | 烽火通信科技股份有限公司 | Load balancing method and device based on multi-channel protocol |
| CN113645311A (en) * | 2021-08-23 | 2021-11-12 | 烽火通信科技股份有限公司 | Path calculation method based on load balancing strategy and electronic equipment |
| CN114363737A (en) * | 2021-12-09 | 2022-04-15 | 国网新疆电力有限公司 | Optical transmission network resource optimization configuration method, system and storage medium thereof |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7760626B2 (en) * | 2004-03-31 | 2010-07-20 | Intel Corporation | Load balancing and failover |
| CN1756233B (en) * | 2004-09-30 | 2010-07-28 | 富士通株式会社 | Route selecting method and apparatus in telecom network |
| CN100399772C (en) * | 2005-08-26 | 2008-07-02 | 电子科技大学 | Ad hot network subsequent multi-path route method based on load balance |
| EP1764956A1 (en) * | 2005-09-14 | 2007-03-21 | Siemens Aktiengesellschaft | Method for load balancing in a network |
-
2008
- 2008-07-11 CN CN2008101165203A patent/CN101312464B/en not_active Expired - Fee Related
Cited By (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101583057B (en) * | 2009-06-11 | 2013-08-07 | 中兴通讯股份有限公司 | Network routing method and device |
| WO2010142096A1 (en) * | 2009-06-11 | 2010-12-16 | 中兴通讯股份有限公司 | Network routing method and apparatus |
| CN102439920A (en) * | 2011-09-20 | 2012-05-02 | 华为技术有限公司 | Business cross-layer separation path computing method, device and communication system |
| CN102439920B (en) * | 2011-09-20 | 2014-07-09 | 华为技术有限公司 | Business cross-layer separation path computing method, device and communication system |
| CN103166985A (en) * | 2011-12-09 | 2013-06-19 | 上海盛霄云计算技术有限公司 | Global load balancing scheduling method and data transmission method and device and system |
| CN103166985B (en) * | 2011-12-09 | 2018-02-27 | 上海盛大网络发展有限公司 | A kind of GSLB dispatching method, data transmission method, apparatus and system |
| CN104202081B (en) * | 2014-08-28 | 2017-01-04 | 北京邮电大学 | Optical-fiber network low time delay fault recovery method and system |
| CN104202081A (en) * | 2014-08-28 | 2014-12-10 | 北京邮电大学 | Optical network low delay fault recovery method and system |
| WO2016078461A1 (en) * | 2014-11-18 | 2016-05-26 | 中兴通讯股份有限公司 | Path calculation method and path calculation server |
| CN105791116A (en) * | 2016-03-15 | 2016-07-20 | 上海缔安科技股份有限公司 | Data transmission routing method |
| US10484463B2 (en) | 2016-03-28 | 2019-11-19 | Industrial Technology Research Institute | Load balancing system, load balancing device and topology management method |
| CN107241374A (en) * | 2016-03-28 | 2017-10-10 | 财团法人工业技术研究院 | Load balancing system, load balancing device and topology management method |
| CN107241374B (en) * | 2016-03-28 | 2020-01-31 | 财团法人工业技术研究院 | Load balancing system, load balancing device and topology management method |
| CN107888398A (en) * | 2016-09-29 | 2018-04-06 | 中国联合网络通信集团有限公司 | A kind of service bearer system and control method |
| WO2018214059A1 (en) * | 2017-05-24 | 2018-11-29 | 深圳市乃斯网络科技有限公司 | Method and system for selecting data link in network |
| CN107171955A (en) * | 2017-05-24 | 2017-09-15 | 深圳市乃斯网络科技有限公司 | The system of selection of data link and system in network |
| CN107294852B (en) * | 2017-07-01 | 2019-12-27 | 台州学院 | Network routing method using topology dispersed short path set |
| CN107294852A (en) * | 2017-07-01 | 2017-10-24 | 台州学院 | A kind of network route method using the scattered short path collection of topology |
| CN108111411A (en) * | 2017-12-06 | 2018-06-01 | 上海神添实业有限公司 | Backbone network and its active path planning system and planing method |
| CN108111411B (en) * | 2017-12-06 | 2020-12-22 | 上海神添实业有限公司 | Backbone network and dynamic path planning system and planning method thereof |
| CN110300426A (en) * | 2018-03-21 | 2019-10-01 | 普天信息技术有限公司 | Route selection method and device in a kind of wireless self-networking |
| CN112087397A (en) * | 2020-10-10 | 2020-12-15 | 烽火通信科技股份有限公司 | Load balancing method and device based on multi-channel protocol |
| CN113645311A (en) * | 2021-08-23 | 2021-11-12 | 烽火通信科技股份有限公司 | Path calculation method based on load balancing strategy and electronic equipment |
| CN113645311B (en) * | 2021-08-23 | 2023-06-09 | 烽火通信科技股份有限公司 | Path calculation method based on load balancing strategy and electronic equipment |
| CN114363737A (en) * | 2021-12-09 | 2022-04-15 | 国网新疆电力有限公司 | Optical transmission network resource optimization configuration method, system and storage medium thereof |
| CN114363737B (en) * | 2021-12-09 | 2024-02-20 | 国网新疆电力有限公司 | Optical transmission network resource optimal configuration method, system and storage medium thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101312464B (en) | 2012-06-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101312464B (en) | Method for realizing load balance in automatic exchange optical network | |
| Sengupta et al. | Switched optical backbone for cost-effective scalable core IP networks | |
| CN100493210C (en) | Constraint-based shortest path priority method for dynamically switched optical transport networks | |
| CN100596102C (en) | Method for establishing label switched path of minimized path preemption cost | |
| CN1898919B (en) | Dynamic route discovery for optical switched networks | |
| US20050030951A1 (en) | Reservation protocol signaling extensions for optical switched networks | |
| CN102137313B (en) | Subtree-based multicasting traffic grooming method in WDM (Wavelength Division Multiplex) optical network | |
| JP2003218918A (en) | Method and apparatus for composing virtual link in a label switched network | |
| CN101399748B (en) | Route computing method and router | |
| US10491487B2 (en) | Network service establishment method, orchestration control center, and network system | |
| US20140269296A1 (en) | Systems and Methods of Bundled Label Switch Path for Load Splitting | |
| WO2011147261A2 (en) | System and method for advertising a composite link in interior gateway protocol and/or interior gateway protocol-traffic engineering | |
| JP2017511656A (en) | Method for provisioning an optical connection in an optical network | |
| CN101459589A (en) | Method and device for distributing network resource | |
| CN102186123A (en) | Multicast-sharing and multilayer protection method based on subtrees in WDM (wavelength division multiplexer) optical network, | |
| JP3782362B2 (en) | Packet switch / optical switch integrated controller | |
| CN113242176A (en) | End-to-end multi-path rapid calculation method and device | |
| JP3925468B2 (en) | Path capacity and path route changing method, and node device | |
| CN111245724A (en) | SDN load balancing routing method based on virtual switch deployment | |
| CN101621451B (en) | Method, node and system for bearing service | |
| Ho et al. | A framework of scalable optical metropolitan networks for improving survivability and class of service | |
| CN114745227A (en) | Power service network slice time delay calculation method and device based on Flexe and SPN technologies | |
| CN102685004A (en) | Method for implementing traffic engineering in GMPLS/OBS (generalized multi-protocol label switching/optical burst switching) network | |
| Mohan et al. | QoS routing in GMPLS-capable integrated IP/WDM networks with router cost constraints | |
| JP2003051836A (en) | Communication network, path setting method, network management device, and node |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120613 Termination date: 20210711 |