CN107864047A - A kind of multilayer union planning solved based on substep and optimization method - Google Patents
A kind of multilayer union planning solved based on substep and optimization method Download PDFInfo
- Publication number
- CN107864047A CN107864047A CN201710847600.5A CN201710847600A CN107864047A CN 107864047 A CN107864047 A CN 107864047A CN 201710847600 A CN201710847600 A CN 201710847600A CN 107864047 A CN107864047 A CN 107864047A
- Authority
- CN
- China
- Prior art keywords
- subproblem
- planning
- business
- network
- substep
- 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.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/04—Network management architectures or arrangements
- H04L41/044—Network management architectures or arrangements comprising hierarchical management structures
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
-
- 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/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- 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
Abstract
The present invention relates to a kind of multilayer union planning solved based on substep and optimization method, belong to communication network field.In order to solve the too high problem of integral linear programming time complexity, the planning problem of complexity is divided into several less planning problems by the present invention, each less planning problem has respective object function, constraints and design variable, the method that the optimum results of each subsystem are solved by substep is obtained and coordinated by coordination optimization strategy, to obtain the optimal solution of whole system.The present invention not only makes solve the problems, such as the too high easily processing, and being run on parallel computer of integral linear programming time complexity, design cycle and expense is decreased.
Description
Technical field
The invention belongs to communication network field, is related to a kind of multilayer union planning solved based on substep and optimization method.
Background technology
The photosphere net that optical transport network wavelength division multiplexed network structural evolution from point to points is combined for translucent and transparent network
Network.In order to tackle the rapid growth of 5G data services, optical transport network not only needs to carry traditional fixed-bandwidth speech business,
But also the multimedia service of various big flows is carried, including support high speed document download, super clear video requirement, huge
The new opplications such as memory space.Therefore, the big Grained Requirements such as 2.5G or 10G coexist with 2M small grain sizes business (speech business etc.) and needed
Ask.Meanwhile optical transport network also develops into coexisting for multiple technologies from single structure.Because optical transport network is one huge
Complex network, it is therefore desirable to using the multi-layer management plan model concept of classification and segmentation structure network model, in order to net
The flexible design of network and management.
To understand the state of development of prior art, retrieval is carried out to existing paper and patent, has compared and analyzes, has been screened
Go out the higher technical information of following degree related to the present invention：
Technical scheme 1：Patent No. 201210059252.2《Network plan method and device》Patent, design communication neck
Domain, there is provided a kind of network plan method and device, wherein, network plan method includes：According to the target service of network system
Load, volume calculation is carried out to the network system, obtains the system user number of the network system, the system user number bag
Include equivalent user number；According to the equivalent user number, the control domain load of the network system is calculated；According to the target service
Load and the control domain load, link budget is carried out to the network system.
Technical scheme 2：Patent No. 201510035150.0《Network plan method and device》Patent, design communication neck
Domain, there is provided a kind of network plan method and device, methods described include：It is determined that for reflecting that the multiple of Zone situation comment
Estimate dimension, and count the desired value of the current network of each assessment dimension of each cell；According to the index of the current network
Value, each cell is calculated on each value scoring for assessing dimension；Scored according to each value for assessing dimension,
Calculate the total value scoring of each cell；Scored according to the total value of each cell, identify the property of value grade of each cell；
According to the property of value grade of each cell, it is determined that the network coverage strategy of each cell region.
The methods described of technical scheme 1 solves existing network planning ignorance covering influencing each other what is mutually restricted between capacity
Relation, it is not accurate enough to the network planning effective the problem of, realize effective planning of network.But do not examined in implementation process
Consider the situation that more granularity services coexist so that program results is likely to occur the situation of inaccuracy.
The methods described of technical scheme 2 effectively identification object region can be worth, and limited resource is launched to can most produce
The region for the benefit that comes into force, effective foundation is provided for network exact construction.But the complexity of multilayer multi-service transmitting network is not accounted for
Structure, therefore the route planning in solving ultrahigh speed, multi-level transmission net optimizes with that may be met during problem of management
To problem.
The planning of Multi-layer network can be categorized as successively independent planning and multilayer union planning.The former hardly results in planning
The optimal solution of scheme.Joint planning has significant advantage compared with single level programming, but because multilayer union planning computing is more multiple
It is miscellaneous, and standard not yet be present in the content that multilayer union planning interlayer is coordinated, thus multilayer union planning and optimization are always
More stubborn problem.And integral linear programming has fully been studied as planning and a solution of optimization problem.
Integral linear programming has the advantages of obtaining globally optimal solution, but time complexity is too high, for there is the more of certain scale
For layer network, the network planning is carried out using integral linear programming, the calculating to computer requires too high, therefore integer linear is advised
The application drawn receives a definite limitation.
The content of the invention
In view of this, it is an object of the invention to provide a kind of multilayer union planning solved based on substep and optimization side
Method, in order to solve the too high problem of integral linear programming time complexity, the planning problem of complexity is divided into several by the present invention
Less planning problem, each less planning problem have respective object function, constraints and design variable, each subsystem
The method that the optimum results of system are solved by substep is obtained and coordinated by coordination optimization strategy, to obtain whole system most
Excellent solution.
To reach above-mentioned purpose, the present invention provides following technical scheme：
A kind of multilayer union planning solved based on substep and optimization method, are concretely comprised the following steps：
Optimization aim in the multilayer union planning of network is divided into subproblem A and subproblem B；
Wherein subproblem A is the number for solving each of the links bearer service in every layerSon is asked
Which business topic B specifically carries for solution each of the links under fixed sum Wherein TiFor traffic matrix；I is any 1 integer for arriving N, and a is a layers, and b is b
Bar link, NiSum, X are fixed for i-thiTo fix the set of bearer service when sum is i, t XiThe i-th of middle a layers b links
Individual business arrival time, R (t) are that business network position is reached in t network,For in XiI-th of industry of middle a layers b links
Business.
Further, it is route if the Web vector graphic shortest path algorithm is every business, remembers hkjFor the industry from k to j
The hop count for route of being engaged in, thenIt is exactly a necessary constraint of solution space constraint, but is not to fill to constrain；Such as
A business from k to j be present in fruit,l:ckm≠0andclj≠ 0 is exactly a necessary constraint of " solution space constraint ", but together
Sample is not to fill to constrain；
Wherein solution space is constrained to：If subproblem A meets that solution space constrains, following subproblem A program results is made
For subproblem B input, subproblem B solution space is not sky.
Further, if the optimization aim is：Minimize certain layer of average weighted hop count, then subproblem A optimization
Target isSubproblem B does not have optimization aim, and any solution of solution space is all as final optimum results.
Further, the services sets T of the interlayer coordination system, specially top is introduced in the methodNSecondary top layer is used
Link set LN-1Used, LN-1Used is continuing with the services sets L of N-2 layers as the business of N-2 layersN-2Used, until most lower
Layer, the link set used is L1used；Wherein, any one layer of route changes, and can all cause the money of its whole lower floor
Source use changes.
The beneficial effects of the present invention are：The present invention not only makes solve the problems, such as that integral linear programming time complexity is too high
Easily handle, and can be run on parallel computer, design cycle and expense is decreased.
Brief description of the drawings
In order that the purpose of the present invention, technical scheme and beneficial effect are clearer, the present invention provides drawings described below and carried out
Explanation：
Fig. 1 is layering nest relation；
Fig. 2 is artificial network topology；
Fig. 3 is simulation result.
Embodiment
Below in conjunction with accompanying drawing, the preferred embodiments of the present invention are described in detail.
Multilayer union planning can carry out orderly division to planning using the thought that substep solves.In physical planning
In problem, optimization aim can be decomposed into：
Subproblem A：Solve the number of each of the links bearer service in every layer
Subproblem B：Solve which business is each of the links specifically carry under fixed sum
Thus optimization aim is easier clearly to be expressed asUnder this target, above problem just meet sword and
Solution.Due to A-D business, the desired value under different routing plans is different from A-C business, it is only necessary to protects the solution of two optical fiber just
Calculate optimal solution.
This division not only reduces requirement to computer process ability, and because subproblem A leads to the network planning
Normal optimization aim coupling is more close, it is contemplated that the deviation of its result of calculation and globally optimal solution can be relatively small.And divide
Walk one of the key issue solved be how by the object function of planning, constraints and design variable two subproblems it
Between be allocated；Another key issue is input of the subproblem A result as subproblem B, and solution space is asked with the presence or absence of son
Topic A constraints includes " solution space constraint " and " resource constraint ".Here defining " solution space constraint " is：If subproblem A expires
Sufficient solution space constraint, then input of the following subproblem A program results as subproblem B, subproblem B solution space are not
It is empty；Defining " resource constraint " is：Each of the links may not exceed the bandwidth resources of the link by the number that any upper-layer service uses
Limitation.The problem of mathematical analysis of subproblem A " solution space constraint " is complex, the problem requires further study.
It is contemplated that the route of the promotion transmission net of the solution meeting of this problem effectively is theoretical.
Above mentioned problem is deployed to simple explanation herein, it is assumed that there is certain layer to have network G (Ni,Li,Bi) and traffic matrix Ti,
Here all symbols are defined as above.A certain division is met to the service condition of different linksProblem
It is：This is divided in meet which kind of " solution space constraint " in the case of, further carrying out route for every business can succeedSpecifically
Ground is said, is route if the Web vector graphic shortest path algorithm is every business, remembers hkjThe hop count being route for the business from k to j,
SoIt is exactly a necessary constraint of " solution space constraint ", but is not to fill to constrain；Furthermore if there is
One business from k to j,l:ckm≠0andclj≠ 0 is exactly a necessary constraint of " solution space constraint ", but is not equally
Filling to constrain.Subproblem B first constraint is exactly subproblem A resultIn addition, son is asked
Inscribing B constraint also includes traditional route continuity constraint and bandwidth constraint etc., and therefore not to repeat here.
According to subproblem A and B property, object function has larger flexibility in subproblem A and B distribution.Such as
Fruit optimization aim is：Minimize certain layer of average weighted hop count, then subproblem A optimization aim isSubproblem
B does not have optimization aim, and any solution of solution space can serve as final optimum results；Design variable is between subproblem A and B
Division be to cause two sub- problem areas other basic, this needs in-depth study and analysis.
Substep solution strategies proposed by the present invention have certain scalability.Such as subproblem A program results(number that each of the links is used by any business), it may be considered that using introducing randomness to protection
Recover index to be quantified.Because protection route has exclusiveness for resource occupation, (the allocated resource of protection route can not
Used in other business), therefore protect route to be equal to Work route processing；, can and the situation of restoration route is then different
To combine the failure probability analysis part in traditional communication net theory, restoration route is taken into account the occupancy join probability of resourceThis makes it possible to the performance recovered to a certain extent to protection to quantify, so as to more accurate
More fully weigh network index.
In addition, the present invention introduces the interlayer coordination system in multilayer union project study.The content and optimization that interlayer is coordinated
Target is closely related.Optimization aim species just determines that the content type that interlayer is coordinated is more compared with abundant.But generally analyze, upper strata
Business is significant for parameter optimization target using the total amount and substep of lower resource.If upper-layer service takes lower floor
Resource is excessive, and resource occupation is uneven, then necessarily affects carrying and the protection restorability of new business.Interlayer coordinate compared with
It is to pertain only to two layers of coordination for simple content.Because upper strata and lower floor are the relations of generation business and bearer service, therefore
It is client layer to deserve to be called layer, and lower floor is service layer.Complex content is the coordination of more interlayers.Because upper-layer service uses lower floor
Resource, thus there is continuity on upper strata with indirect lower floor, thus bring the possibility of the joint planning of more than three layers levels.Such as figure
Shown in 1.
The services sets T of topNThe link set L of secondary top layer is usedN-1Used, LN-1Used as N-2 layers business after
The continuous services sets L using N-2 layersN-2Used, the rest may be inferred, until orlop, the link set used is L1used.This its
In, any one layer of route is changed, and the resource use of its whole lower floor can be caused to change.
For example, top layer can be coordinated, the resource occupation sum of secondary top layer and the bottom, replaced roughly using prediction model
The service bearer situation in intermediate layer, so as to simplify every layer of integral linear programming for being required for solving so that computation complexity energy
Enough it is reduced to acceptable degree；Or sharing memory can be disposed in the bottom, then by shared risk link
Group information is coordinated with top layer and time top layer, and the protection recovery rate of lower floor just can associate with the route of top, thus right
Can more accurately it be solved in the index that protection recovers.
Algorithm is carried in order to assess the planning of the multilayer union of proposition and Optimized model, our dry runs.Such as Fig. 2 institutes
Show, topological structure of the result proposed by the present invention based on NSFNET, wherein including 14 nodes and 21 links.These nodes lead to
Cross single bidirectional optical fiber connection, each 10 wavelength of bearing optical fiber.And because most probable failure is single-link event in network
Barrier, the faulty institute occurred in of the invention is single link failure.
Assuming that optimal bandwidth allocation and traffic balance strategy are considered in network design.In fiber link, 8 are used
Wavelength is as operation wavelength, also 2 free wavelengths.
Fig. 3 compares multilayer union planning and ILP and conventional measures in terms of resources occupation rate and path blocks probability
Performance.It can be seen that in the case where total resources and business demand are certain, algorithm proposed by the present invention has obvious
Advantage.
Finally illustrate, preferred embodiment above is merely illustrative of the technical solution of the present invention and unrestricted, although logical
Cross above preferred embodiment the present invention is described in detail, it is to be understood by those skilled in the art that can be
Various changes are made to it in form and in details, without departing from claims of the present invention limited range.
Claims (4)
1. a kind of multilayer union planning solved based on substep and optimization method, it is characterised in that：This method concretely comprises the following steps：
Optimization aim in the multilayer union planning of network is divided into subproblem A and subproblem B；
Wherein subproblem A is the number for solving each of the links bearer service in every layerSubproblem B is
Solve which business is each of the links specifically carry under fixed sum Wherein TiFor traffic matrix；I is any 1 integer for arriving N, and a is a layers, and b is b
Bar link, NiSum, X are fixed for i-thiTo fix the set of bearer service when sum is i, t XiThe i-th of middle a layers b links
Individual business arrival time, R (t) are that business network position is reached in t network,For in XiI-th of industry of middle a layers b links
Business.
2. a kind of multilayer union planning solved based on substep according to claim 1 and optimization method, it is characterised in that：
It is route if the Web vector graphic shortest path algorithm is every business, remembers hkjThe hop count being route for the business from k to j, that
It is exactly a necessary constraint of solution space constraint, but is not to fill to constrain；If there is one from k to j
Business,It is exactly a necessary constraint of " solution space constraint ", but is not equally to fill and to constrain；
Wherein solution space is constrained to：If subproblem A meets that solution space constrains, following subproblem A program results is as son
Problem B input, subproblem B solution space is not sky.
3. a kind of multilayer union planning solved based on substep according to claim 1 and optimization method, it is characterised in that：
If the optimization aim is：Minimize certain layer of average weighted hop count, then subproblem A optimization aim isSubproblem B does not have optimization aim, and any solution of solution space is all as final optimum results.
4. a kind of multilayer union planning solved based on substep according to claim 1 and optimization method, it is characterised in that：
The services sets T of the interlayer coordination system, specially top is introduced in the methodNThe link set L of secondary top layer is usedN-1Used,
LN-1Used is continuing with the services sets L of N-2 layers as the business of N-2 layersN-2Used, until orlop, the link used
Integrate as L1used；Wherein, any one layer of route changes, and can all cause the resource use of its whole lower floor to change.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710847600.5A CN107864047A (en) | 2017-09-19 | 2017-09-19 | A kind of multilayer union planning solved based on substep and optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710847600.5A CN107864047A (en) | 2017-09-19 | 2017-09-19 | A kind of multilayer union planning solved based on substep and optimization method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107864047A true CN107864047A (en) | 2018-03-30 |
Family
ID=61699416
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710847600.5A Pending CN107864047A (en) | 2017-09-19 | 2017-09-19 | A kind of multilayer union planning solved based on substep and optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107864047A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1480003A (en) * | 2000-10-09 | 2004-03-03 | 艾利森电话股份有限公司 | Network topologies |
| CN102215168A (en) * | 2011-06-03 | 2011-10-12 | 黄东 | Method for optimizing and scheduling service resources based on laminated network |
| CN104079000A (en) * | 2014-07-14 | 2014-10-01 | 国家电网公司 | Power grid power transmission margin control method suitable for large-scale wind power access |
| CN104486105A (en) * | 2014-12-05 | 2015-04-01 | 广东省电信规划设计院有限公司 | Transmission network service configuration method and system |
| CN105631578A (en) * | 2015-12-10 | 2016-06-01 | 浙江大学 | Risk assessment-orientated modeling method of power transmission and transformation equipment failure probability model |
| CN107069721A (en) * | 2017-06-21 | 2017-08-18 | 华北电力大学 | A kind of electric power system operation risk assessment method theoretical based on random set |
-
2017
- 2017-09-19 CN CN201710847600.5A patent/CN107864047A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1480003A (en) * | 2000-10-09 | 2004-03-03 | 艾利森电话股份有限公司 | Network topologies |
| CN102215168A (en) * | 2011-06-03 | 2011-10-12 | 黄东 | Method for optimizing and scheduling service resources based on laminated network |
| CN104079000A (en) * | 2014-07-14 | 2014-10-01 | 国家电网公司 | Power grid power transmission margin control method suitable for large-scale wind power access |
| CN104486105A (en) * | 2014-12-05 | 2015-04-01 | 广东省电信规划设计院有限公司 | Transmission network service configuration method and system |
| CN105631578A (en) * | 2015-12-10 | 2016-06-01 | 浙江大学 | Risk assessment-orientated modeling method of power transmission and transformation equipment failure probability model |
| CN107069721A (en) * | 2017-06-21 | 2017-08-18 | 华北电力大学 | A kind of electric power system operation risk assessment method theoretical based on random set |
Non-Patent Citations (2)
| Title |
|---|
| AXEL KLEKAMP: ""Multi-layer network optimization Benefits of elastic optical networks"", 《2012 14TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON)》 * |
| WU DONG等: ""Multi-stratum Joint Strategy Based on Decomposition Implement in SDON"", 《2017 16TH INTERNATIONAL CONFERENCE ON OPTICAL COMMUNICATIONS AND NETWORKS (ICOCN)》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108696777B (en) | The flexible optical network resource distribution method of the space division multiplexing frequency spectrum of minimum cross-talk | |
| CN105242956B (en) | Virtual functions service chaining deployment system and its dispositions method | |
| CN103399902B (en) | Digraph accessibility chained list under a kind of parallel environment generates and querying method | |
| CN101588518B (en) | Transport network topological structure safety analytical method and implementation system | |
| CN106341351B (en) | A kind of path resources distribution method distinguished in hybrid network based on QoS | |
| CN108965014A (en) | The service chaining backup method and system of QoS perception | |
| CN112118176B (en) | Service reliability-oriented routing load optimization method for channel of integrated data network | |
| CN106416158B (en) | For the traffic engineered of large-scale data central site network | |
| CN104683488A (en) | Flow-type calculation system as well as dispatching method and dispatching device of flow-type calculation system | |
| CN105827528A (en) | Routing method suitable for frequency spectrum-flexible optical network | |
| CN108171413A (en) | A kind of chemical industrial park emergency resources method for optimizing configuration | |
| CN106817306B (en) | Method and device for determining target route | |
| CN104836751A (en) | Spectrum sensing-based single-path service partitioning-merging optical network frequency allocation method | |
| CN107510914A (en) | A kind of wisdom fire-fighting remote monitoring system and its method towards garden | |
| CN111162865A (en) | Virtual optical network mapping method for sensing fragments in space division multiplexing elastic optical network | |
| Xu et al. | Global optimization for multi-stage construction of rescue units in disaster response | |
| CN112332984A (en) | SDN-based wide-area quantum key distribution routing method and device | |
| CN101478705B (en) | Survivable service flow conducting method based on interlayer message routing | |
| Rastani et al. | Designing incomplete hub location-routing network in urban transportation problem | |
| Yu et al. | A deep learning based RSA strategy for elastic optical networks | |
| CN106209415A (en) | A kind of mapping method of virtual network and system | |
| CN114186750A (en) | Routing planning method and device for hierarchical requirements of power business of smart power grid | |
| Alvizu et al. | Machine-learning-based prediction and optimization of mobile metro-core networks | |
| Liu et al. | A Multiobjective optimization model for continuous allocation of emergency rescue materials | |
| CN107864047A (en) | A kind of multilayer union planning solved based on substep and optimization method |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180330 |