CN107509230A - Routing optimization method and router - Google Patents

Routing optimization method and router Download PDF

Info

Publication number
CN107509230A
CN107509230A CN201710874746.9A CN201710874746A CN107509230A CN 107509230 A CN107509230 A CN 107509230A CN 201710874746 A CN201710874746 A CN 201710874746A CN 107509230 A CN107509230 A CN 107509230A
Authority
CN
China
Prior art keywords
mrow
msup
msubsup
optimization
msub
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
Application number
CN201710874746.9A
Other languages
Chinese (zh)
Other versions
CN107509230B (en
Inventor
王智明
毋涛
贾智宇
卢莹
刘畅
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China United Network Communications Group Co Ltd
Original Assignee
China United Network Communications Group Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN201710874746.9A priority Critical patent/CN107509230B/en
Publication of CN107509230A publication Critical patent/CN107509230A/en
Application granted granted Critical
Publication of CN107509230B publication Critical patent/CN107509230B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The present invention, which provides a kind of routing optimization method and router, this method, to be included：Obtain the optimization information of multiple servers of EPC core nets；When receiving the optimization request that the data communications requests sent according to mobile terminal are initiated, analyzed according to analysis model and optimization information, obtain analysis result；Routing optimality is implemented according to analysis result, the routing optimality is used to optimize the network carrying performance that data between mobile terminal and the server of EPC core nets communicate.Routing optimization method provided by the invention, time delay is short, throughput is high low with packet loss, so as to improve the network carrying performance that data between mobile terminal and the server of EPC core nets communicate.

Description

Routing optimization method and router
Technical field
The present invention relates to communication technical field, in particular it relates to a kind of routing optimization method and router.
Background technology
EPC (Evolved Packet Core, hereinafter referred to as core packet networks evolution, EPC core nets), it is moved as 4G The core net of dynamic communication network, possesses user contracting data storage, the tradition of the mobile network such as mobile management and data exchange Ability.In addition, it also add the flattening network model for meeting 4G high speed data transfers, meet the data message of high speed Exchange.
At present, in order to realize resource flexible dispatching, business Quick thread, NFV (network functions Virtualization, network function virtualization) and SDN (soft defined network, software defined network) theory The new demand of EPC core nets can be agreed with well.
But with the rapid growth of SDN and NFV applied business, therewith caused telecommunications gateway route when extend, gulp down The problems such as rate is low and packet loss is high is told to become increasingly conspicuous.Therefore, checking at present needs a kind of routing optimization method so that the application system has Have that time delay is short, the high advantage low with packet loss of throughput.
The content of the invention
It is contemplated that at least solves one of technical problem present in prior art, it is proposed that a kind of routing optimization method And router, its time delay is short, throughput is high low with packet loss, so as to improve the server of mobile terminal and EPC core nets Between data communicate network carrying performance.
To realize that the purpose of the present invention provides a kind of routing optimization method, it includes：
Obtain the optimization information of multiple servers of EPC core nets；
When receiving the optimization request that the data communications requests sent according to mobile terminal are initiated, according to analysis model and The optimization information is analyzed, and obtains analysis result；
According to the analysis result implement routing optimality, the routing optimality be used for optimize the mobile terminal with it is described The network carrying performance that data communicate between the server of EPC core nets.
Specifically, it is described when receiving the optimization request that the data communications requests sent according to mobile terminal are initiated, root Analyzed according to analysis model and the optimization information, obtaining analysis result includes：
Iteration initial parameter is set；
Analyzed according to analysis model and the optimization information, obtain analysis result；
Judge whether the analysis result meets assay condition, if so, then implementing to route according to the analysis result Optimization, the routing optimality are used to optimize the net that data communicate between the mobile terminal and the server of the EPC core nets Network load-carrying properties；If it is not, then follow the steps below：
Current iteration number adds 1；
Secondary analysis are carried out according to majorized function and the optimization information, obtain analysis result；
Judge whether the current iteration number is more than default maximum iteration, if so, then being tied according to the analysis Fruit applies routing optimality, and the routing optimality is used to optimize number between the mobile terminal and the server of the EPC core nets According to the network carrying performance of communication；Above-mentioned judge whether the analysis result meets assay condition if it is not, then returning.
Specifically, the analysis model is following model matrix：
Wherein, M is information vector；The information vector of i-th row jth row (i ∈ V, j ∈ V) represents source i-node to target j sections Time delay, throughput and the packet loss of link between point.
Specifically, the information vector of the i-th row jth row meets below equation：
Wherein, Mij kFor the information vector of the i-th row jth row；WithRespectively described time delay, throughput fall Number and packet loss；K is that current iteration number is k.
Specifically, the assay condition includes following evaluation function：
Wherein,
I=1,2 ... m；J=1,2 ... n；K=1,2 ... d；K≤d, d are maximum iteration；
ξ and θ is respectively the time delay, the inverse of throughput and the Dynamic gene of packet loss.
Specifically, the majorized function is：
Wherein, MinZkRepresent optimum optimization value；
ξ、θ∈(0,1)；τij αFor heuristic information；ηij βBelieve for the inspiration of source i-node to the link between target j nodes Cease plain concentration；For the 3 ranks extraction of cubic root origin absolute moment information vector of+1 iteration of kth；AGK、FGKAnd DGKRespectively kth time The optimal routing node information vector of global history of preceding k iteration comprising current iteration in iteration.
Specifically, it is described when receiving the optimization request that the data communications requests sent according to mobile terminal are initiated, root Analyzed according to analysis model and the optimization information, obtain analysis result, including：
Collect all optimization requests by the way of being asked at interval of preset time using active reporting and periodically；
Corresponding each optimization request, analyzed according to analysis model and the optimization information, obtain analysis result, And collected.
As another technical scheme, the present invention also provides a kind of router, includes the access unit of EPC core nets, institute Stating the access unit of EPC core nets includes：
Acquisition module, the optimization information of multiple servers for obtaining EPC core nets；
Analysis module, for when receiving the optimization request that the data communications requests sent according to mobile terminal are initiated, Analyzed according to analysis model and the optimization information, obtain analysis result；
Optimization module, for implementing routing optimality according to the analysis result, the routing optimality is used to optimize the shifting The dynamic network carrying performance that data communicate between terminal and the server of the EPC core nets.
Specifically, the analysis module includes：
Submodule is analyzed, for being analyzed according to analysis model and the optimization information, obtains analysis result；And Secondary analysis are carried out according to analysis model and the optimization information, obtain analysis result；
Iteration submodule, for setting iteration initial parameter；
Judging submodule, for judging whether the analysis result meets assay condition,
If so, then sending signal to the optimization module, the optimization module optimizes the mobile terminal according to the signal The network carrying performance that data communicate between the server of the EPC core nets；
If it is not, then sending signal to the iteration submodule, the iteration submodule is secondary by current iteration according to the signal Number plus 1；And signal is sent to the analysis submodule, the analysis submodule is according to the signal according to majorized function and institute State optimization information and carry out secondary analysis, obtain analysis result；And the judging submodule is additionally operable to judge the current iteration Whether number is more than default maximum iteration, if so, then to the optimization module send signal, the optimization module according to The signal implements routing optimality according to the analysis result；If it is not, then rejudging whether the analysis result meets that analysis is commented Valency condition.
Specifically, the mobile terminal sends the data communications requests by base station signal to palm base station；The palm Upper base station is sent the data communications requests to palm gateway by vpn tunneling；The palm gateway is by network to by institute Data communications requests are stated to send to the analysis module.
The invention has the advantages that：
In the technical scheme of routing optimization method and router provided by the invention, it is by obtaining the more of EPC core nets The optimization information of individual server；When receiving the optimization request that the data communications requests sent according to mobile terminal are initiated, root Analyzed according to analysis model and optimization information, obtain analysis result；Routing optimality, the routing optimality are implemented according to analysis result The network carrying performance to be communicated for optimizing data between mobile terminal and the server of EPC core nets, time delay is short, throughput is high It is low with packet loss.
Brief description of the drawings
Fig. 1 is the FB(flow block) of routing optimization method provided in an embodiment of the present invention；
Fig. 2 is the analysis procedure chart of multiple optimization requests；
Fig. 3 is the FB(flow block) of step S2 in the embodiment of the present invention；
Fig. 4 is the theory diagram of router provided in an embodiment of the present invention；
Connection structure diagrams of the Fig. 5 between router provided in an embodiment of the present invention and mobile terminal.
Embodiment
To make those skilled in the art more fully understand technical scheme, come below in conjunction with the accompanying drawings to the present invention The routing optimization method and router of offer are described in detail.
Referring to Fig. 1, the present invention provides a kind of routing optimization method, it includes：
S1, obtain the optimization information of multiple servers of EPC core nets.
Server is used to enter row data communication between mobile terminal.Optimization information refers to optimize the phase needed for analysis Close information, it is preferred that the optimization information includes time delay, throughput and packet loss etc..Wherein, time delay refers to a message or packet Time required for being sent to another end from one end of a network.Throughput original refers in the unit interval by some node The Mean Speed of data is delivered in success.Packet loss refers to that lost data packets quantity accounts for the ratio of transmitted data group.Time delay is short, gulps down It is high low with packet loss to tell rate, then network carrying performance is better.
S2, when receiving the optimization request that the data communications requests sent according to mobile terminal are initiated, according to analysis mould Type and above-mentioned optimization information are analyzed, and obtain analysis result.
In the data communications requests that mobile terminal is sent, analysis is optimized in a manner of initiating optimization request.Analysis Used by model analysis strategy can be using intending biological iterative optimization method, and based on multiple target, game theory, graph theory, The methods of statistics, is analyzed.
S3, routing optimality is implemented according to analysis result, the routing optimality is used to optimize mobile terminal and the clothes of EPC core nets The network carrying performance that data communicate between business device.
Routing optimization method provided by the invention, its time delay is short, throughput is high low with packet loss, so as to improve movement The network carrying performance that data communicate between terminal and the server of EPC core nets.
Specifically, referring to Fig. 2, the optimization request that the data communications requests sent according to mobile terminal are initiated can be 1, 2 ..., n, these optimization requests are separate, and do not interfere with each other.When carrying out above-mentioned steps S2, each optimization request is entered The independent analysis of row, and analysis result 1,2 ..., n are obtained correspondingly.Furthermore it is possible at interval of preset time using master The dynamic mode for reporting and being periodically asked collects all optimization requests；Also, corresponding each optimization request, according to analysis model Analyzed with optimization information, obtain analysis result, and collected.That is, for multiple optimization requests of initiation, can With active reporting or periodically collected；And it is also required to collect for the analysis result corresponding to multiple optimization requests.
Referring to Fig. 3, above-mentioned steps S2 further comprises：
S21, iteration initial parameter is set.
The iteration initial parameter includes primary iteration parameter (for 1) and greatest iteration parameter, and the greatest iteration parameter can be with For 50.
S22, analyzed according to analysis model and optimization information, obtain analysis result；
Whether S23, discriminatory analysis result meet assay condition, if so, then carrying out above-mentioned steps S3；If it is not, then enter Row following steps step S24：
S24, current iteration number add 1；
S25, secondary analysis are carried out according to majorized function and optimization information, obtain analysis result；
S26, judges whether current iteration number is more than default maximum iteration, if so, then carrying out above-mentioned steps S3； If it is not, then return to above-mentioned steps S23.
Above-mentioned analysis model is specifically as follows following model matrix：
Wherein, M is information vector；The information vector of i-th row jth row (i ∈ V, j ∈ V) represents source i-node to target j sections Time delay, throughput and the packet loss of link between point.
Further, the information of above-mentioned i-th row jth row meets below equation：
Wherein, Mij kFor the information vector of the i-th row jth row；WithRespectively time delay, throughput inverse and lose Bag rate；K is that current iteration number is k, k=1,2 ....
Further, above-mentioned assay condition includes following evaluation function：
Wherein,
By the way that above-mentioned formula 1 and formula 3 are substituted into above-mentioned formula 2 to judge whether the inequality of formula 2 is set up.Wherein, i=1, 2,...m；J=1,2 ... n；K=1,2 ... d；K≤d, d are maximum iteration；ξ and θ is respectively the time delay, gulped down Tell the inverse of rate and the Dynamic gene of packet loss.
Further, above-mentioned majorized function is：
Wherein, MinZkRepresent optimum optimization value；By the way that formula 6 and the substitution formula 5 of formula 7 are calculated WillWithMinZ is calculated in substitution formula 4k。ξ、θ∈(0,1)；τij αFor heuristic information；ηij βFor source i-node to mesh Mark the heuristic information element concentration of the link between j nodes；For the 3 ranks extraction of cubic root origin absolute moment information of+1 iteration of kth Vector；AGK、FGKAnd DGKThe optimal routing node of global history of preceding k iteration comprising current iteration respectively in kth time iteration Information vector.
In summary, routing optimization method provided by the invention, its by obtain EPC core nets multiple servers it is excellent Change information；When receiving the optimization request that the data communications requests sent according to mobile terminal are initiated, according to analysis model and Optimization information is analyzed, and obtains analysis result；Routing optimality is implemented according to analysis result, the routing optimality is used to optimize movement The network carrying performance that data communicate between terminal and the server of EPC core nets, time delay is short, throughput is high low with packet loss.
As another technical scheme, referring to Fig. 4, the present invention also provides a kind of router, it includes EPC core nets Access unit 1, the access unit 1 of the EPC core nets include：
Acquisition module 11, the optimization information of multiple servers for obtaining EPC core nets；
Analysis module 12, for receiving the optimization request of the data communications requests initiation sent according to mobile terminal When, analyzed according to analysis model and the optimization information, obtain analysis result；
Optimization module 13, for implementing routing optimality according to the analysis result, the routing optimality is used to optimize movement eventually Hold the network carrying performance to be communicated with data between the server of EPC core nets.
Router provided by the invention, its time delay is short, throughput is high low with packet loss, so as to improve mobile terminal with The network carrying performance that data communicate between the server of EPC core nets.
Further, above-mentioned analysis module 12 includes：
Submodule is analyzed, for being analyzed according to analysis model and optimization information, obtains analysis result；And according to Analysis model and the optimization information carry out secondary analysis, obtain analysis result；
Iteration submodule, for setting iteration initial parameter；
Judging submodule, whether meet assay condition for discriminatory analysis result,
If so, then sending signal to optimization module, optimization module optimizes mobile terminal and EPC core nets according to the signal The network carrying performance that data communicate between server；
If it is not, then sending signal to iteration submodule, current iteration number is added 1 by iteration submodule according to the signal；With And signal is sent to analysis submodule, analysis submodule carries out secondary point according to the signal according to majorized function and optimization information Analysis, obtain analysis result；And judging submodule is additionally operable to judge whether current iteration number is more than default greatest iteration time Number, if so, then sending signal to optimization module, optimization module implements routing optimality according to the signal according to analysis result；If it is not, Then rejudge whether analysis result meets assay condition.
Preferably, referring to Fig. 5, above-mentioned mobile terminal sends number by base station signal to palm base station (Femeto base stations) According to communication request；Palm base station is sent data communications requests to palm gateway (Femeto gateways) by vpn tunneling；Net in the palm Pass is sent to above-mentioned analysis module 12 by network to by data communications requests.In this manner it is achieved that mobile terminal and EPC cores The stratification that data communicate between multiple servers of net, realize that EPC data forwarding separates with gateway access control, and telecommunications Virtualization of function.
It is understood that the principle that embodiment of above is intended to be merely illustrative of the present and the exemplary implementation that uses Mode, but the invention is not limited in this.For those skilled in the art, the essence of the present invention is not being departed from In the case of refreshing and essence, various changes and modifications can be made therein, and these variations and modifications are also considered as protection scope of the present invention.

Claims (10)

  1. A kind of 1. routing optimization method, it is characterised in that including：
    Obtain the optimization information of multiple servers of EPC core nets；
    When receiving the optimization request that the data communications requests sent according to mobile terminal are initiated, according to analysis model and described Optimization information is analyzed, and obtains analysis result；
    Routing optimality is implemented according to the analysis result, the routing optimality is used to optimize the mobile terminal and the EPC cores The network carrying performance that data communicate between the server of heart net.
  2. 2. routing optimization method according to claim 1, it is characterised in that described to be sent according to mobile terminal receiving Data communications requests initiate optimization request when, according to analysis model and it is described optimization information analyzed, obtain analysis knot Fruit includes：
    Iteration initial parameter is set；
    Analyzed according to analysis model and the optimization information, obtain analysis result；
    Judge whether the analysis result meets assay condition, if so, routing optimality is then implemented according to the analysis result, The routing optimality is used to optimize the network carrying that data communicate between the mobile terminal and the server of the EPC core nets Performance；If it is not, then follow the steps below：
    Current iteration number adds 1；
    Secondary analysis are carried out according to majorized function and the optimization information, obtain analysis result；
    Judge whether the current iteration number is more than default maximum iteration, if so, then real according to the analysis result Routing optimality is applied, the routing optimality leads to for optimizing data between the mobile terminal and the server of the EPC core nets The network carrying performance of letter；Above-mentioned judge whether the analysis result meets assay condition if it is not, then returning.
  3. 3. routing optimization method according to claim 2, it is characterised in that the analysis model is following model matrix：
    Wherein, M is information vector；I-th row jth row (i ∈ V, j ∈ V) information vector represent source i-node to target j nodes it Between link time delay, throughput and packet loss.
  4. 4. routing optimization method according to claim 3, it is characterised in that the information vector of the i-th row jth row meets Below equation：
    <mrow> <msup> <msub> <mi>M</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mi>k</mi> </msup> <mo>=</mo> <mo>{</mo> <msubsup> <mi>A</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mi>k</mi> </msubsup> <mo>,</mo> <msubsup> <mi>F</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mi>k</mi> </msubsup> <mo>,</mo> <msubsup> <mi>D</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mi>k</mi> </msubsup> <mo>}</mo> <mo>;</mo> </mrow>
    Wherein, Mij kFor the information vector of the i-th row jth row；WithRespectively described time delay, throughput inverse and Packet loss；K is that current iteration number is k.
  5. 5. routing optimization method according to claim 4, it is characterised in that the assay condition includes following evaluation Function：
    <mrow> <mi>&amp;omega;</mi> <mo>*</mo> <msubsup> <mo>&amp;Integral;</mo> <mn>1</mn> <mrow> <mo>+</mo> <mi>&amp;infin;</mi> </mrow> </msubsup> <mroot> <mrow> <mo>|</mo> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </munderover> <msup> <msub> <mi>A</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mi>k</mi> </msup> <msup> <mo>|</mo> <mn>2</mn> </msup> </mrow> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </mroot> <mi>d</mi> <mi>x</mi> <mo>+</mo> <mi>&amp;xi;</mi> <mo>*</mo> <msubsup> <mo>&amp;Integral;</mo> <mn>1</mn> <mrow> <mo>+</mo> <mi>&amp;infin;</mi> </mrow> </msubsup> <mroot> <mrow> <mo>|</mo> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </munderover> <msubsup> <mi>F</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mrow> <mo>-</mo> <mi>k</mi> </mrow> </msubsup> <msup> <mo>|</mo> <mn>2</mn> </msup> </mrow> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </mroot> <mi>d</mi> <mi>x</mi> <mo>+</mo> <mi>&amp;theta;</mi> <mo>*</mo> <msubsup> <mo>&amp;Integral;</mo> <mn>1</mn> <mrow> <mo>+</mo> <mi>&amp;infin;</mi> </mrow> </msubsup> <mroot> <mrow> <mo>|</mo> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </munderover> <msup> <msub> <mi>D</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mi>k</mi> </msup> <msup> <mo>|</mo> <mn>2</mn> </msup> </mrow> <mrow> <mn>1</mn> <mo>/</mo> <mn>2</mn> </mrow> </mroot> <mi>d</mi> <mi>x</mi> <mo>&amp;le;</mo> <msup> <mrow> <mo>(</mo> <msup> <mi>W</mi> <mi>k</mi> </msup> <mo>)</mo> </mrow> <mn>3</mn> </msup> </mrow>
    Wherein,
    <mrow> <msup> <mrow> <mo>(</mo> <msup> <mi>W</mi> <mi>k</mi> </msup> <mo>)</mo> </mrow> <mn>3</mn> </msup> <mo>=</mo> <mrow> <mo>(</mo> <mi>m</mi> <mo>*</mo> <mi>n</mi> <mo>)</mo> </mrow> <mo>*</mo> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>m</mi> </munderover> <munderover> <mo>&amp;Sigma;</mo> <mrow> <mi>j</mi> <mo>=</mo> <mn>1</mn> </mrow> <mi>n</mi> </munderover> <msup> <mrow> <mo>(</mo> <msup> <msub> <mi>M</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mi>k</mi> </msup> <mo>-</mo> <mover> <msup> <mi>M</mi> <mrow> <mi>G</mi> <mi>k</mi> </mrow> </msup> <mo>&amp;OverBar;</mo> </mover> <mo>)</mo> </mrow> <mn>3</mn> </msup> <mo>;</mo> </mrow>
    I=1,2 ... m；J=1,2 ... n；K=1,2 ... d；K≤d, d are maximum iteration；
    ξ and θ is respectively the time delay, the inverse of throughput and the Dynamic gene of packet loss.
  6. 6. routing optimization method according to claim 5, it is characterised in that the majorized function is：
    Wherein, MinZkRepresent optimum optimization value；
    <mrow> <msubsup> <mi>M</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> <mo>=</mo> <mfrac> <mrow> <msup> <mrow> <mo>&amp;lsqb;</mo> <msup> <msub> <mi>&amp;tau;</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mi>&amp;alpha;</mi> </msup> <mo>&amp;rsqb;</mo> </mrow> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>&amp;CenterDot;</mo> <msup> <mrow> <mo>&amp;lsqb;</mo> <msup> <msub> <mi>&amp;eta;</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mi>&amp;beta;</mi> </msup> <mo>&amp;rsqb;</mo> </mrow> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> </mrow> <mrow> <munder> <mo>&amp;Sigma;</mo> <mrow> <mi>i</mi> <mo>&amp;Element;</mo> <mi>m</mi> <mo>,</mo> <mi>j</mi> <mo>&amp;Element;</mo> <mi>n</mi> </mrow> </munder> <msup> <mrow> <mo>&amp;lsqb;</mo> <msup> <msub> <mi>&amp;tau;</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mi>&amp;alpha;</mi> </msup> <mo>&amp;rsqb;</mo> </mrow> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>&amp;CenterDot;</mo> <msup> <mrow> <mo>&amp;lsqb;</mo> <msup> <msub> <mi>&amp;eta;</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mi>&amp;beta;</mi> </msup> <mo>&amp;rsqb;</mo> </mrow> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> </mrow> </mfrac> <mo>*</mo> <msubsup> <mi>M</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mi>k</mi> </msubsup> <mo>+</mo> <msubsup> <mi>B</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> <mo>;</mo> </mrow>
    <mrow> <msup> <mrow> <mo>&amp;lsqb;</mo> <msup> <msub> <mi>&amp;tau;</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mi>&amp;alpha;</mi> </msup> <mo>&amp;rsqb;</mo> </mrow> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>&amp;CenterDot;</mo> <msup> <mrow> <mo>&amp;lsqb;</mo> <msup> <msub> <mi>&amp;eta;</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mi>&amp;beta;</mi> </msup> <mo>&amp;rsqb;</mo> </mrow> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>=</mo> <msup> <mrow> <mo>&amp;lsqb;</mo> <msup> <msub> <mi>&amp;tau;</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mi>&amp;alpha;</mi> </msup> <mo>&amp;rsqb;</mo> </mrow> <mi>k</mi> </msup> <mo>&amp;CenterDot;</mo> <msup> <mrow> <mo>&amp;lsqb;</mo> <msup> <msub> <mi>&amp;eta;</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> <mi>&amp;beta;</mi> </msup> <mo>&amp;rsqb;</mo> </mrow> <mi>k</mi> </msup> <mo>&amp;CenterDot;</mo> <mroot> <mrow> <mo>|</mo> <msubsup> <mi>A</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mi>k</mi> </msubsup> <mo>-</mo> <msup> <mi>A</mi> <mrow> <mi>G</mi> <mi>K</mi> </mrow> </msup> <msup> <mo>|</mo> <mn>5</mn> </msup> <mo>+</mo> <mo>|</mo> <msubsup> <mi>F</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mi>k</mi> </msubsup> <mo>-</mo> <msup> <mi>F</mi> <mrow> <mi>G</mi> <mi>K</mi> </mrow> </msup> <msup> <mo>|</mo> <mn>5</mn> </msup> <mo>+</mo> <mo>|</mo> <msubsup> <mi>D</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mi>k</mi> </msubsup> <mo>-</mo> <msup> <mi>D</mi> <mrow> <mi>G</mi> <mi>K</mi> </mrow> </msup> <msup> <mo>|</mo> <mn>5</mn> </msup> </mrow> <mrow> <mn>1</mn> <mo>/</mo> <mn>5</mn> </mrow> </mroot> <mo>;</mo> </mrow>
    <mrow> <msubsup> <mi>B</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mrow> <mi>k</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> <mo>=</mo> <mo>{</mo> <mroot> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mo>|</mo> <msubsup> <mi>A</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mi>k</mi> </msubsup> <mo>-</mo> <msup> <mi>A</mi> <mrow> <mi>G</mi> <mi>K</mi> </mrow> </msup> <msup> <mo>|</mo> <mn>3</mn> </msup> <mo>)</mo> </mrow> </mrow> <mrow> <mn>1</mn> <mo>/</mo> <mn>3</mn> </mrow> </mroot> <mo>,</mo> <mroot> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mo>|</mo> <msubsup> <mi>F</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mi>k</mi> </msubsup> <mo>-</mo> <msup> <mi>F</mi> <mrow> <mi>G</mi> <mi>K</mi> </mrow> </msup> <msup> <mo>|</mo> <mn>3</mn> </msup> <mo>)</mo> </mrow> </mrow> <mrow> <mn>1</mn> <mo>/</mo> <mn>3</mn> </mrow> </mroot> <mo>,</mo> <mroot> <mrow> <mi>E</mi> <mrow> <mo>(</mo> <mo>|</mo> <msubsup> <mi>D</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> <mi>k</mi> </msubsup> <mo>-</mo> <msup> <mi>D</mi> <mrow> <mi>G</mi> <mi>K</mi> </mrow> </msup> <msup> <mo>|</mo> <mn>3</mn> </msup> <mo>)</mo> </mrow> </mrow> <mrow> <mn>1</mn> <mo>/</mo> <mn>3</mn> </mrow> </mroot> <mo>}</mo> <mo>;</mo> </mrow>
    ξ、θ∈(0,1)；τij αFor heuristic information；ηij βFor the heuristic information element of source i-node to the link between target j nodes Concentration；For the 3 ranks extraction of cubic root origin absolute moment information vector of+1 iteration of kth；AGK、FGKAnd DGKRespectively kth time iteration In comprising current iteration preceding k iteration the optimal routing node information vector of global history.
  7. 7. routing optimization method according to claim 1, it is characterised in that described to be sent according to mobile terminal receiving Data communications requests initiate optimization request when, according to analysis model and it is described optimization information analyzed, obtain analysis knot Fruit, including：
    Collect all optimization requests by the way of being asked at interval of preset time using active reporting and periodically；
    Corresponding each optimization request, analyzed according to analysis model and the optimization information, obtain analysis result, go forward side by side Row collects.
  8. 8. a kind of router, it is characterised in that include the access unit of EPC core nets, the access unit bag of the EPC core nets Include：
    Acquisition module, the optimization information of multiple servers for obtaining EPC core nets；
    Analysis module, for when receiving the optimization request that the data communications requests sent according to mobile terminal are initiated, according to Analysis model and the optimization information are analyzed, and obtain analysis result；
    Optimization module, for implementing routing optimality according to the analysis result, the routing optimality is used to optimize the movement eventually Hold the network carrying performance to be communicated with data between the server of the EPC core nets.
  9. 9. router according to claim 8, it is characterised in that the analysis module includes：
    Submodule is analyzed, for being analyzed according to analysis model and the optimization information, obtains analysis result；And according to Analysis model and the optimization information carry out secondary analysis, obtain analysis result；
    Iteration submodule, for setting iteration initial parameter；
    Judging submodule, for judging whether the analysis result meets assay condition,
    If so, then sending signal to the optimization module, the optimization module optimizes the mobile terminal and institute according to the signal State the network carrying performance that data communicate between the server of EPC core nets；
    If it is not, then sending signal to the iteration submodule, the iteration submodule adds current iteration number according to the signal 1；And signal is sent to the analysis submodule, the analysis submodule is according to the signal according to majorized function and described excellent Change information and carry out secondary analysis, obtain analysis result；And the judging submodule is additionally operable to judge the current iteration number Whether default maximum iteration is more than, if so, then sending signal to the optimization module, the optimization module is according to the letter Number according to the analysis result implement routing optimality；If it is not, then rejudging whether the analysis result meets assay bar Part.
  10. 10. router according to claim 8, it is characterised in that the mobile terminal is by base station signal to palm base Stand and send the data communications requests；The palm base station is sent the data communications requests to net in the palm by vpn tunneling Close；The palm gateway is sent to the analysis module by network to by the data communications requests.
CN201710874746.9A 2017-09-25 2017-09-25 Route optimization method and router Active CN107509230B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710874746.9A CN107509230B (en) 2017-09-25 2017-09-25 Route optimization method and router

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710874746.9A CN107509230B (en) 2017-09-25 2017-09-25 Route optimization method and router

Publications (2)

Publication Number Publication Date
CN107509230A true CN107509230A (en) 2017-12-22
CN107509230B CN107509230B (en) 2021-04-02

Family

ID=60698580

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710874746.9A Active CN107509230B (en) 2017-09-25 2017-09-25 Route optimization method and router

Country Status (1)

Country Link
CN (1) CN107509230B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108768857A (en) * 2018-08-30 2018-11-06 中国联合网络通信集团有限公司 A kind of virtual flow-line retransmission method, apparatus and system
CN108830422A (en) * 2018-06-21 2018-11-16 中国联合网络通信集团有限公司 Optimization method, the apparatus and system of intelligent driving

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102158417A (en) * 2011-05-19 2011-08-17 北京邮电大学 Method and device for optimizing multi-constraint quality of service (QoS) routing selection
US8494559B1 (en) * 2005-12-30 2013-07-23 At&T Intellectual Property I, L.P. Method and system for selecting a wireless access technology using location based information
CN103957158A (en) * 2014-04-14 2014-07-30 华为技术有限公司 Determining method and device for flow forwarding path and communication system
CN104579961A (en) * 2013-10-11 2015-04-29 ***通信集团公司 Scheduling method and device for data message

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8494559B1 (en) * 2005-12-30 2013-07-23 At&T Intellectual Property I, L.P. Method and system for selecting a wireless access technology using location based information
CN102158417A (en) * 2011-05-19 2011-08-17 北京邮电大学 Method and device for optimizing multi-constraint quality of service (QoS) routing selection
CN104579961A (en) * 2013-10-11 2015-04-29 ***通信集团公司 Scheduling method and device for data message
CN103957158A (en) * 2014-04-14 2014-07-30 华为技术有限公司 Determining method and device for flow forwarding path and communication system

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
陈暄；万志平；许方恒；龙丹: "基于改进信息素的蚁群算法在QoS组播路由中的研究", 《计算机应用研究》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108830422A (en) * 2018-06-21 2018-11-16 中国联合网络通信集团有限公司 Optimization method, the apparatus and system of intelligent driving
CN108830422B (en) * 2018-06-21 2021-08-17 中国联合网络通信集团有限公司 Intelligent driving optimization method, device and system
CN108768857A (en) * 2018-08-30 2018-11-06 中国联合网络通信集团有限公司 A kind of virtual flow-line retransmission method, apparatus and system
CN108768857B (en) * 2018-08-30 2021-04-02 中国联合网络通信集团有限公司 Virtual route forwarding method, device and system

Also Published As

Publication number Publication date
CN107509230B (en) 2021-04-02

Similar Documents

Publication Publication Date Title
CN106411733B (en) A kind of SDN dynamic load leveling dispatching method based on link real time load
CN104982013B (en) A kind of method, equipment and the system of business routing
CN107094115A (en) A kind of ant group optimization Load Balance Routing Algorithms based on SDN
CN103117957B (en) The buffer memory management method of Effect-based operation number of copies and comprehensive effectiveness in opportunistic network
CN110986979A (en) SDN multi-path routing planning method based on reinforcement learning
CN103348639B (en) Routing resource and Control Server
CN108566659A (en) A kind of online mapping method of 5G networks slice based on reliability
CN114285758B (en) Communication network optimization simulation system, method and device based on OPNET
CN104301305B (en) Interest bag is forwarded under information centre&#39;s network method and forwarding terminal
CN107454630A (en) Load-balancing method and load balancing router
CN112350949B (en) Rerouting congestion control method and system based on flow scheduling in software defined network
CN107317707A (en) A kind of SDN topological management method based on vertex covering set
CN104580165A (en) Cooperative caching method in intelligence cooperative network
CN103312606A (en) Wireless Mesh network routing based on multi-path concurrence and method thereof
CN105992297A (en) SDN-based connection management and forwarding control method and related equipment
CN107566275A (en) Multi-path transmission method based on the delay inequality opposite sex in data center network
CN106209615A (en) A kind of Dynamic Route Control method calculating forward-path based on SPFA algorithm
CN107509230A (en) Routing optimization method and router
CN107835130A (en) A kind of flow allocation method and device
CN108462983A (en) Based on the Communication of Muti-robot System network-building method for improving ant colony AODV agreements
CN106792971A (en) Network node system of selection based on ant group algorithm
CN107196856A (en) A kind of method and apparatus for determining routing forwarding path
CN110536187A (en) Forward the method and access layer exchange device of data
CN107333320A (en) Data forwarding method and device
Parag et al. Value-aware resource allocation for service guarantees in networks

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant