CN106656864A - Message forwarding scheduling method and apparatus - Google Patents
Message forwarding scheduling method and apparatus Download PDFInfo
- Publication number
- CN106656864A CN106656864A CN201710093599.1A CN201710093599A CN106656864A CN 106656864 A CN106656864 A CN 106656864A CN 201710093599 A CN201710093599 A CN 201710093599A CN 106656864 A CN106656864 A CN 106656864A
- Authority
- CN
- China
- Prior art keywords
- message
- evaluation function
- function value
- optz
- scheduling evaluation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/6255—Queue scheduling characterised by scheduling criteria for service slots or service orders queue load conditions, e.g. longest queue first
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/56—Queue scheduling implementing delay-aware scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a message forwarding scheduling method and apparatus. The method comprises the following steps: when a new to-be-forwarded message arrives, a vCPE obtains queue information of vBRAS, determines an optimal scheduling evaluation function value according to the queue information by using an iterative algorithm, and determines the optimal message queue accordingly so as to allocate the to-be-forwarded message to the optimal message queue. According to the message forwarding scheduling method and apparatus provided by the invention, the current message processing capacity of the message queues is fully considered, each user message can obtain global optimization forwarding scheduling, and the rationality of forwarding telecommunication edge cloud network messages is improved. In addition, the user messages are forwarded by using a virtual telecommunication edge cloud network element, so that the operation and maintenance can be simplified, the operation and maintenance cost is reduced, the business deployment online and innovation periods are shortened, and large-scale elastic expansion is facilitated.
Description
Technical field
The present invention relates to communication technical field, and in particular to a kind of message forwarding dispatching method and device.
Background technology
Telecommunications edge cloud has become the important trend of global telecommunications industry development, and telecommunications edge cloud is to solve
Existing private communication facility not enough and produce therewith, be traditional and newly-increased network function to be virtualized and is assembled or is decomposed
Its network function, and the software virtualization platform using general X86-based hardware is carried on, the equipment of conventional telecommunications machine room is entered
Row software is decoupled with hardware, and based on physical computing, storage, network resource communication network function is realized.Currently, telecommunications edge
Cloud has become the generally acknowledged development priority of global telecommunications industrial circle；The telecommunications edge cloud industry giant of international and national accelerates technology
The dominant right to seize the cloud development of telecommunications edge and emerging market space are cooperated in research and development, enterprise transformation with alliance.In this case,
In the face of increasingly urgent telecommunications edge cloud growth requirement, the message based on telecommunications edge cloud is distinguished and forwards scheduling system for electricity
The rapid sustainable development of letter edge cloud is significant.
With the rapid growth of telecommunications applied business, the numerous and diverse dispersion of O＆M produced with it, service deployment are reached the standard grade and are innovated
The problems such as cycle is longer, scale is difficult extension, network congestion degree is high becomes increasingly conspicuous.Existing telecommunications edge high in the clouds office system is main
Message forwarding scheduling mode is carried out using forwarding-table item, and end office's function is realized by physics special equipment, and need relatively strong special
The O＆M team of industry technical ability, exists and does not fully take into account that the numerous and diverse dispersion of O＆M, service deployment are reached the standard grade and the innovation cycle is longer, scale
It is difficult the aspect problems such as extension, network congestion degree height.
Therefore, a kind of message forwarding scheduling scheme is needed badly, to solve above-mentioned technical problem.
The content of the invention
The present invention is for above-mentioned deficiency present in prior art, there is provided a kind of message forwarding dispatching method and device, uses
To solve the unreasonable caused network congestion problem of battery core edge cloud network message forwarding scheduling, and the problem that extension is difficult.
The present invention is adopted the following technical scheme that to solve above-mentioned technical problem：
The present invention provides a kind of message and forwards dispatching method, methods described to include：
When message to be forwarded is received, to each vBRAS message queue information acquisition request is sent；
The message queue information that the vBRAS is returned is received, the message queue information is described in the vBRAS is received
Send after message queue information acquisition request；The message queue information includes：Absolute Message processing total energy force value Ω, relative
Message processing capability ratio Ψ, message queuing length average Γ, message wait length average Φ, message waiting unit interval average
TWWith Message processing unit interval average TP；
According to the queuing message, optimum scheduling evaluation function value is determined using iterative algorithm, and according to the optimum
Scheduling evaluation function value determine optimum message queue；
The message to be forwarded is distributed to the optimum message queue.
Preferably, it is described according to the queuing message, optimum scheduling evaluation function value is determined using iterative algorithm, specifically
Including：
S11, calculates this scheduling evaluation function value optZk；
S12, calculates previous scheduling evaluation function value optZk-1With this scheduling evaluation function value optZkDifference it is absolute
Value；
S13, by previous scheduling evaluation function value optZk-1With this scheduling evaluation function value optZkDifference absolute value with
Default first threshold P compares, if the former is more than or equal to the latter, by this scheduling evaluation function value optZkAs most
Excellent scheduling evaluation function value.
Further, the message forwarding dispatching method also includes：
If previous scheduling evaluation function value optZk-1With this scheduling evaluation function value optZkDifference absolute value be less than institute
First threshold P is stated, then performs S14 and S15：
S14, k=k+1, k are iterationses；
S15, k is compared with default Second Threshold K, if k is less than or equal to K, performs S11；Otherwise, this is adjusted
Degree evaluation function value optZkAs optimum scheduling evaluation function value.
Preferably, the scheduling evaluation function is：
Wherein, ε,θ, σ, ξ, τ be Dynamic gene, and ε,θ, σ, ξ, τ ∈ (0,1)；N is the total quantity of message queue,
I is message queue mark, and k is iterationses, and k≤K, K are Second Threshold, represents maximum iteration time；xi kRepresent kth time iteration
When the i-th queue in whether load message,optZkRepresent kth time repeatedly
For when scheduling evaluation function value.
Preferably, relative message processing capability ratio Ψ is that message amount and the message for completing is processed in the unit time
The ratio of the total quantity of message to be forwarded in queue；
Absolute Message processing total energy force value Ω is the total quantity of message to be forwarded and unit interval in message queue
Product.
The present invention also provides a kind of message forwarding dispatching device, including：First receiver module, sending module, second receive
Module, processing module and scheduler module,
First receiver module is used for, and receives message to be forwarded；
Second receiver module is used for, and receives the message queue information that the vBRAS is returned, and the message queue information is institute
State vBRAS and receive what is sent after the message queue information acquisition request；The message queue information includes：Definitely at message
Reason total energy force value Ω, relative message processing capability ratio Ψ, message queuing length average Γ, message wait length average Φ, report
Text waiting unit interval average TWWith Message processing unit interval average TP；
The processing module is used for, when first receiver module receives message to be forwarded, indicate sending module to
Each vBRAS sends message queue information acquisition request；According to the queuing message, determine that optimum scheduling is commented using iterative algorithm
Valency functional value, and optimum message queue is determined according to the optimum scheduling evaluation function value；
Scheduler module is used for, and the message to be forwarded is distributed to the optimum message queue.
Preferably, the processing module is specifically for calculating this scheduling evaluation function value optZk, and calculate previous tune
Degree evaluation function value optZk-1With this scheduling evaluation function value optZkDifference absolute value；By previous scheduling evaluation function value
optZk-1With this scheduling evaluation function value optZkDifference absolute value compared with default first threshold P, when the former is more than
Or during equal to the latter, by this scheduling evaluation function value optZkAs optimum scheduling evaluation function value.
Further, the processing module is additionally operable to, when previous scheduling evaluation function value optZk-1Evaluate with this scheduling
Functional value optZkDifference absolute value be less than the first threshold P when, make k=k+1, k be iterationses, and by k with it is default
Second Threshold K compares, and when k is less than or equal to K, calculates this scheduling evaluation function value optZk；When k is more than K, incite somebody to action this
Secondary scheduling evaluation function value optZkAs optimum scheduling evaluation function value.
Preferably, the scheduling evaluation function is：
Wherein, ε,θ, σ, ξ, τ be Dynamic gene, and ε,θ, σ, ξ, τ ∈ (0,1)；N is the total quantity of message queue,
I is message queue mark, and k is iterationses, and k≤K, K are Second Threshold, represents maximum iteration time；xi kRepresent kth time iteration
When the i-th queue in whether load message,optZkRepresent kth time repeatedly
For when scheduling evaluation function value.
Preferably, relative message processing capability ratio Ψ is that message amount and the message for completing is processed in the unit time
The ratio of the total quantity of message to be forwarded in queue；
Absolute Message processing total energy force value Ω is the total quantity of message to be forwarded and unit interval in message queue
Product.
The present invention can realize following beneficial effect：
When new message to be forwarded is reached, vCPE obtains the message queue information of each vBRAS, according to queuing message, profit
Determine optimum scheduling evaluation function value with iterative algorithm, and thereby determine that out optimum message queue, to wait to turn by described
Text of transmitting messages distributes into the optimum message queue, and the present invention has taken into full account the current Message processing energy of each message queue
Power, each user's message can obtain global optimization forwarding scheduling, improve the reasonability of telecommunications edge cloud network message forwarding.This
Outward, the present invention realizes the forwarding of user's message using virtual telecommunications edge cloud network element, can simplify O＆M, reduce O＆M into
This, shortens service deployment and reaches the standard grade and the innovation cycle, is conducive to scale resilient expansion.
Description of the drawings
Fig. 1 is telecommunications edge cloud network topological diagram provided in an embodiment of the present invention；
Fig. 2 is one of cloud network message forwarding mechanism schematic diagram in telecommunications edge provided in an embodiment of the present invention；
Fig. 3 is the two of cloud network message forwarding mechanism schematic diagram in telecommunications edge provided in an embodiment of the present invention；
Fig. 4 is that message provided in an embodiment of the present invention forwards scheduling flow figure；
Fig. 5 is the flow chart for determining optimum scheduling evaluation function value provided in an embodiment of the present invention；
Fig. 6 is the structural representation that message provided in an embodiment of the present invention forwards dispatching device.
Specific embodiment
Below in conjunction with the accompanying drawing in the present invention, clear, complete description is carried out to the technical scheme in the present invention, shown
So, described embodiment is a part of embodiment of the present invention, rather than the embodiment of whole.Based on the enforcement in the present invention
Example, the every other embodiment that those of ordinary skill in the art are obtained on the premise of creative work is not made all belongs to
In the scope of protection of the invention.
For the problems referred to above that prior art is present, message forwarding scheduling scheme is embodiments provided, using void
Intend telecommunications edge network and replace existing physics special equipment, and scheduling mechanism is forwarded using global optimization, realize user's message
The reasonability of forwarding.
The present invention provides a kind of message and forwards dispatching method, in being applied to telecommunications edge cloud network as shown in Figure 1, telecommunications
The message forwarding scheduling application system of edge cloud adopts loose coupling framework, comprising fixed network enterprises and institutions user's access domain.
Fixed network enterprises and institutions user's access domain realizes fixed network enterprises and institutions user by Vxlan (Virtual
EXtensible Local Area Network, virtual expansible LAN) tunnel style connects virtual end office's network element and accesses
Privately owned cloud data center and the Internet.Access idiographic flow as follows：
Fixed network enterprises and institutions users ENUSER_PC initiates DHCP request message, and fixing end is by PG (namely Simple CPE
(Customer Premise Equipment customer terminal equipments)), Vxlan gateways and vCPE set up Vxlan tunnels, Jin Ershi
The access of existing Vxlan double layer networks.The request message of fixed network enterprises and institutions user ENUSER_PC passes through Vxlan double layer networks
VCPE is pass-through to, vCPE supports the terminal distribution IP address as Dynamic Host Configuration Protocol server to lower extension, and supports as pppoe client
Process and send to vBRAS (Broadband Remote Access Server, Broadband Remote Access Service through fire wall etc.
Device BRAS) dial-up access certification is carried out, entered by NAT (Network Address Translation, network address translation) equipment
The conversion of row private network and public network address, and access and access the Internet or enterprise's cloud data center by gateway (Gateway).
As shown in figure 1, realizing that message turns using pseudo telecommunications edge networks such as vCPE, vBRAS in telecommunications edge cloud network
Send out scheduling.
Wherein, vCPE is capable of achieving following functions：(1) DHCP functions, provide independent for each fixed network enterprises and institutions user
DHCP Server simultaneously carry out the lower IP address distribution for hanging terminal；(2) fixed network enterprises and institutions user's message distinguishes function, according to message
IP address and port (port) number message is made a distinction；(3) fixed network enterprises and institutions user's message forwarding scheduling feature, according to each
The feature of message carries out forwarding scheduling；(4) ACL (Access Control List, accesses control list) filtering function, limits
Access of the domestic consumer to the webserver；(5) pppoe feature, for supporting to vBRAS dial-up access certifications, sets with vBRAS
It is standby to set up pppoe session；(6) QoS (Quality of Service, service quality) business function, supports the multistage QoS of user
Demand for services；(7) firewall functionality, realizes user isolation and supports that it is right to realize based on application and the access control of user behavior
The fine granularity management of security strategy.
VBRAS is capable of achieving following functions：(1) traffic engineering capability of user is converged；(2) control realization function, with Verification System,
Charge system and client management system and service strategy control system are engaged certification, charging and the management work(realized user and access
Energy；(3) fixed network enterprises and institutions user's message auxiliary forwarding scheduling feature, according to the feature of each message, auxiliary vCPE carries out message and turns
Send out scheduling.
NAT is capable of achieving the switch technology that privately owned (reservation) address is converted into legitimate ip address.
With reference to shown in Fig. 2 and Fig. 3, the request message of fixed network enterprises and institutions user ENUSER_PC through Vxlan gateways or
Vxlan servers are sent to vCPE, each vBRAS one message queue of correspondence, and vCPE can be according to the IP address of message and end
Slogan distinguishes all kinds of messages, and the user's message forwarding of fixed network enterprises and institutions is dispatched in message queue.In each message queue
Message includes two states：Waiting state and process state, waiting state refers to the state for waiting vBRAS forwardings, processes state
Refer to the state for being forwarded by vBRAS.
Below in conjunction with Fig. 4, the message forwarding dispatching method of the present invention is described in detail, methods described is applied to as shown in Figure 1
Telecommunications edge cloud network in.As shown in figure 4, the method comprising the steps of：
Step 401, when vCPE receives message to be forwarded, to each vBRAS message queue information acquisition request is sent.
Specifically, when the request message for having new fixed network enterprises and institutions user ENUSER_PC passes through Vxlan double layer networks
When being pass-through to vCPE, triggering vCPE obtains each message queue information to each vBRAS.That is, vCPE sends to each vBRAS
Message queue information acquisition request, so that each vBRAS reports current message queue information to vCPE.
Step 402, each vBRAS is received after the message queue information acquisition request of vCPE transmissions, to vCPE returned packets
Queuing message.
Specifically, the message queue information includes：Definitely Message processing can force value Ω, relative message processing capability ratio
Rate Ψ, message queuing length average Γ, message wait length average Φ, message waiting unit interval average TWWith Message processing list
Position time average TP。
Definitely Message processing total energy force value Ω is the product of the total quantity of message to be forwarded and unit interval in message queue,
I.e. absolute Message processing total energy force value Ω can be calculated according to below equation：Ω=v*tu；Wherein, v is to treat in the message queue
The total quantity for E-Packeting, tuFor the unit time.
It is that the message amount that process is completed in the unit time is total with message to be forwarded with respect to message processing capability ratio Ψ
Ratio of number, i.e., can calculate with respect to message processing capability ratio Ψ according to below equation：Wherein, ρ is the unit time
Interior to process the message amount for completing, v is the total quantity of message to be forwarded in the message queue.
VBRAS is equal according to absolute Message processing total energy force value Ω, relative message processing capability ratio Ψ, message queuing length
Value Γ, message wait length average Φ, message waiting unit interval average TWWith Message processing unit interval average TPGenerate queue
Information vector E, E={ Ω, Ψ, Γ, Φ, TW,TP, return queuing message vector E to vCPE.
It should be noted that the message involved by message queue information is the message in message queue for waiting state, no
Message comprising the state of process.
Step 403, vCPE determines optimum scheduling evaluation function value according to the queuing message using iterative algorithm, and
Optimum message queue is determined according to the optimum scheduling evaluation function value.
Specifically, vCPE collects the queuing message of each vBRAS, and according to the queuing message of each vBRAS, using iteration
Algorithm is calculated the scheduling evaluation function value of optimum.The scheduling evaluation function value is believed according to the queue of each vBRAS queue
Above-mentioned 6 parameter weightings in breath are averagely obtained.The formula of scheduling evaluation function and iterative calculation obtain the scheduling of optimum and comment
The process that implements of valency function is subsequently described in detail again.
Step 404, vCPE distributes message to be forwarded to optimum message queue.
Specifically, vCPE distributes the request message of the fixed network enterprises and institutions user ENUSER_PC to optimum report
Literary queue, so as to the forwarding for completing message is dispatched.
Can be seen that when new message to be forwarded is reached by above-mentioned steps 401-404, vCPE obtains each vBRAS's
Message queue information, according to queuing message optimum scheduling evaluation function value is determined, and thereby determines that out optimum message queue,
So that the message to be forwarded is distributed into the optimum message queue, the present invention has taken into full account that each message queue is worked as
Front message processing capability, each user's message can obtain global optimization forwarding scheduling, improve telecommunications edge cloud network message
The reasonability of forwarding.Additionally, the present invention realizes the forwarding of user's message using virtual telecommunications edge cloud network element, fortune can be simplified
Dimension, reduces O＆M cost, shortens service deployment and reaches the standard grade and the innovation cycle, is conducive to scale resilient expansion.
Below in conjunction with Fig. 5, the flow process that optimum scheduling evaluation function value is determined using iterative algorithm is described in detail.Such as Fig. 5
Shown, the flow process is comprised the following steps：
S11, calculates this scheduling evaluation function value optZk。
Specifically, the scheduling evaluation function is：
Wherein, ε,θ, σ, ξ, τ be Dynamic gene, and ε,θ, σ, ξ, τ ∈ (0,1)；N is the total quantity of message queue,
I is message queue mark, and k is iterationses, and k≤K, K are Second Threshold, represents maximum iteration time；xi kRepresent kth time iteration
When the i-th queue in whether load message,optZkRepresent kth time repeatedly
For when scheduling evaluation function value.
Can be seen that when scheduling evaluation function is calculated according to the formula of above-mentioned scheduling evaluation function, only consider there is wait
The message queue of state message (waiting outstanding message), for the message in current message queue without waiting for state message
Queue not do not consider, optimum scheduling evaluation function value obtained from is the scheduling evaluation function that each iterative algorithm is obtained
Minima in value.
S12, calculates previous scheduling evaluation function value optZk-1With this scheduling evaluation function value optZkDifference absolute value
|optZk-1-optZk|。
S13, by previous scheduling evaluation function value optZk-1With this scheduling evaluation function value optZkDifference absolute value |
optZk-1-optZk| compared with default first threshold P, if the former is more than or equal to the latter, perform S16；Otherwise, perform
S14 and S15.
Specifically, as | optZk-1-optZk| during >=P, illustrate this scheduling evaluation function value optZkIt has been minima, will
This scheduling evaluation function value optZkAs optimum scheduling evaluation function value (performing S16).
When | optZk-1-optZk|<During P, this scheduling evaluation function value optZ is illustratedkAlso it is not minima, continues iteration,
Calculate scheduling next time evaluation function value (performing S14 and S15).
S14, k=k+1.
S15, k is compared with default Second Threshold K, if k is less than or equal to K, performs S11；Otherwise, S16 is performed.
Specifically, after iterationses k adds 1, k is compared with the iterationses K of maximum, whether judges iterationses k
More than maximum iteration time K, if now iterationses k is more than maximum iterationses K, does not continue to iterative calculation scheduling and comment
Valency functional value, but this is dispatched into evaluation function value optZkAs optimum scheduling evaluation function value (performing S16).
It is if now iterationses k is less than or equal to maximum iteration time K, i.e., current also not less than maximum iteration time, then
Continue to iterate to calculate scheduling evaluation function value, and continue to determine that optimum scheduling evaluation function value (performs S11 and its follow-up step
Suddenly).
S16, by this scheduling evaluation function value optZkAs optimum scheduling evaluation function value.
Based on identical technology design, the embodiment of the present invention also provides a kind of message forwarding dispatching device, as shown in fig. 6,
A kind of message forwarding dispatching device includes：First receiver module 61, sending module 62, the second receiver module 63, processing module
64 and scheduler module 65.
First receiver module 61 is used for, and receives message to be forwarded.
Second receiver module 63 is used for, and receives the message queue information that vBRAS is returned, and the message queue information is described
VBRAS receives what is sent after the message queue information acquisition request；The message queue information includes：Absolute Message processing
Total energy force value Ω, relative message processing capability ratio Ψ, message queuing length average Γ, message wait length average Φ, message
Waiting unit interval average TWWith Message processing unit interval average TP。
Processing module 64 is used for, and when the first receiver module 61 receives message to be forwarded, indicates sending module 62 to each
VBRAS sends message queue information acquisition request；According to the queuing message, optimum scheduling evaluation is determined using iterative algorithm
Functional value, and optimum message queue is determined according to the optimum scheduling evaluation function value.
Scheduler module 65 is used for, and the message to be forwarded is distributed to the optimum message queue.
Preferably, processing module 64 is specifically for calculating this scheduling evaluation function value optZk, and calculate previous scheduling
Evaluation function value optZk-1With this scheduling evaluation function value optZkDifference absolute value；By previous scheduling evaluation function value
optZk-1With this scheduling evaluation function value optZkDifference absolute value compared with default first threshold P, when the former is more than
Or during equal to the latter, by this scheduling evaluation function value optZkAs optimum scheduling evaluation function value.
Further, processing module 64 is additionally operable to, when previous scheduling evaluation function value optZk-1Letter is evaluated with this scheduling
Numerical value optZkThe absolute value of difference when being less than first threshold P, make k=k+1, k be iterationses, and by k and default the
Two threshold ks compare, and when k is less than or equal to K, calculate this scheduling evaluation function value optZk；When k is more than K, by this
Scheduling evaluation function value optZkAs optimum scheduling evaluation function value.
Preferably, the scheduling evaluation function is：
Wherein, ε,θ, σ, ξ, τ be Dynamic gene, and ε,θ, σ, ξ, τ ∈ (0,1)；N is the total quantity of message queue,
I is message queue mark, and k is iterationses, and k≤K, K are Second Threshold, represents maximum iteration time；xi kRepresent kth time iteration
When the i-th queue in whether load message,optZkRepresent kth time repeatedly
For when scheduling evaluation function value.
Preferably, relative message processing capability ratio Ψ is that message amount and the message for completing is processed in the unit time
The ratio of the total quantity of message to be forwarded in queue；
Absolute Message processing total energy force value Ω is the total quantity of message to be forwarded and unit interval in message queue
Product.
It is understood that the embodiment of above principle being intended to be merely illustrative of the present and the exemplary enforcement for adopting
Mode, but the invention is not limited in this.For those skilled in the art, in the essence without departing from the present invention
In the case of god and essence, various modifications and improvement can be made, these modifications and improvement are also considered as protection scope of the present invention.
Claims (10)
1. a kind of message forwards dispatching method, it is characterised in that methods described includes：
When message to be forwarded is received, to each vBRAS message queue information acquisition request is sent；
The message queue information that the vBRAS is returned is received, the message queue information is that the vBRAS receives the message
Queuing message obtains what is sent after request；The message queue information includes：Definitely Message processing can force value Ω, relative message
Disposal ability ratio Ψ, message queuing length average Γ, message wait length average Φ, message waiting unit interval average TWWith
Message processing unit interval average TP；
According to the queuing message, optimum scheduling evaluation function value is determined using iterative algorithm, and according to the optimum tune
Degree evaluation function value determines optimum message queue；
The message to be forwarded is distributed to the optimum message queue.
2. the method for claim 1, it is characterised in that described according to the queuing message, is determined using iterative algorithm
Optimum scheduling evaluation function value, specifically includes：
S11, calculates this scheduling evaluation function value optZk；
S12, calculates previous scheduling evaluation function value optZk-1With this scheduling evaluation function value optZkDifference absolute value；
S13, by previous scheduling evaluation function value optZk-1With this scheduling evaluation function value optZkDifference absolute value with it is default
First threshold P compare, if the former be more than or equal to the latter, by this scheduling evaluation function value optZkAs optimum
Scheduling evaluation function value.
3. method as claimed in claim 2, it is characterised in that methods described also includes：
If previous scheduling evaluation function value optZk-1With this scheduling evaluation function value optZkDifference absolute value less than described the
One threshold value P, then perform S14 and S15：
S14, k=k+1, k are iterationses；
S15, k is compared with default Second Threshold K, if k is less than or equal to K, performs S11；Otherwise, this scheduling is commented
Valency functional value optZkAs optimum scheduling evaluation function value.
4. the method for claim 1, it is characterised in that the scheduling evaluation function is：
Wherein, ε,θ, σ, ξ, τ be Dynamic gene, and ε,θ, σ, ξ, τ ∈ (0,1)；N is the total quantity of message queue, and i is report
Literary queue identity, k is iterationses, and k≤K, K are Second Threshold, represents maximum iteration time；xi kI-th when representing kth time iteration
Whether message is loaded in queue,optZkWhen representing kth time iteration
Scheduling evaluation function value.
5. the method as described in any one of claim 1-4, it is characterised in that relative message processing capability ratio Ψ is single
The ratio of the message amount and total quantity of message to be forwarded in message queue for completing is processed in the time of position；
Absolute Message processing total energy force value Ω is the product of the total quantity of message to be forwarded and unit interval in message queue.
6. a kind of message forwards dispatching device, it is characterised in that include：First receiver module, sending module, second receive mould
Block, processing module and scheduler module,
First receiver module is used for, and receives message to be forwarded；
Second receiver module is used for, and receives the message queue information that the vBRAS is returned, and the message queue information is described
VBRAS receives what is sent after the message queue information acquisition request；The message queue information includes：Absolute Message processing
Total energy force value Ω, relative message processing capability ratio Ψ, message queuing length average Γ, message wait length average Φ, message
Waiting unit interval average TWWith Message processing unit interval average TP；
The processing module is used for, and when first receiver module receives message to be forwarded, indicates sending module to each
VBRAS sends message queue information acquisition request；According to the queuing message, optimum scheduling evaluation is determined using iterative algorithm
Functional value, and optimum message queue is determined according to the optimum scheduling evaluation function value；
Scheduler module is used for, and the message to be forwarded is distributed to the optimum message queue.
7. message as claimed in claim 6 forwards dispatching device, it is characterised in that the processing module is specifically for calculating
This scheduling evaluation function value optZk, and calculate previous scheduling evaluation function value optZk-1With this scheduling evaluation function value
optZkDifference absolute value；By previous scheduling evaluation function value optZk-1With this scheduling evaluation function value optZkDifference it is exhausted
To value compared with default first threshold P, when the former is more than or equal to the latter, by this scheduling evaluation function value optZk
As optimum scheduling evaluation function value.
8. message as claimed in claim 7 forwards dispatching device, it is characterised in that the processing module is additionally operable to, when previous
Scheduling evaluation function value optZk-1With this scheduling evaluation function value optZkDifference absolute value be less than the first threshold P when,
Make k=k+1, k be iterationses, and k is compared with default Second Threshold K, when k is less than or equal to K, calculate this tune
Degree evaluation function value optZk；When k is more than K, by this scheduling evaluation function value optZkAs optimum scheduling evaluation function
Value.
9. message as claimed in claim 6 forwards dispatching device, it is characterised in that the scheduling evaluation function is：
Wherein, ε,θ, σ, ξ, τ be Dynamic gene, and ε,θ, σ, ξ, τ ∈ (0,1)；N is the total quantity of message queue, and i is report
Literary queue identity, k is iterationses, and k≤K, K are Second Threshold, represents maximum iteration time；xi kI-th when representing kth time iteration
Whether message is loaded in queue,optZkWhen representing kth time iteration
Scheduling evaluation function value.
10. the message as described in any one of claim 6-9 forwards dispatching device, it is characterised in that the relative Message processing
Capability ratio Ψ is the ratio that the message amount and total quantity of message to be forwarded in message queue for completing is processed in the unit time；
Absolute Message processing total energy force value Ω is the product of the total quantity of message to be forwarded and unit interval in message queue.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710093599.1A CN106656864B (en) | 2017-02-21 | 2017-02-21 | Message forwarding scheduling method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710093599.1A CN106656864B (en) | 2017-02-21 | 2017-02-21 | Message forwarding scheduling method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106656864A true CN106656864A (en) | 2017-05-10 |
| CN106656864B CN106656864B (en) | 2020-04-28 |
Family
ID=58845746
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710093599.1A Active CN106656864B (en) | 2017-02-21 | 2017-02-21 | Message forwarding scheduling method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106656864B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108429731A (en) * | 2018-01-22 | 2018-08-21 | 新华三技术有限公司 | Anti-attack method, device and electronic equipment |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1536820A (en) * | 2003-04-09 | 2004-10-13 | 华为技术有限公司 | Method for raising data transmission performance when the network is congested |
| CN101188547A (en) * | 2006-11-17 | 2008-05-28 | 中兴通讯股份有限公司 | Router for improving forward efficiency based on virtual monitoring group and CAR rate limit |
| CN101286947A (en) * | 2008-05-30 | 2008-10-15 | 杭州华三通信技术有限公司 | Data output controlling method and device therefor |
| CN101374109A (en) * | 2008-10-07 | 2009-02-25 | 中兴通讯股份有限公司 | Method and apparatus for scheduling packets |
| CN101631077A (en) * | 2009-08-24 | 2010-01-20 | 中兴通讯股份有限公司 | Message processing method and device |
| US20120002544A1 (en) * | 2010-07-02 | 2012-01-05 | Nec Laboratories America, Inc. | Dynamic Resource Partitioning for Long-Term Fairness to Non-Elastic Traffic on a Cellular Basestation |
| CN103986653A (en) * | 2014-05-29 | 2014-08-13 | 苏州大学 | Network nodes and data transmission method and system |
| CN105610733A (en) * | 2016-02-17 | 2016-05-25 | 京信通信技术(广州)有限公司 | Queue scheduling processing method and queue scheduling processing system |
| CN106302221A (en) * | 2016-09-12 | 2017-01-04 | 中国联合网络通信集团有限公司 | Traffic scheduling method based on end office's cloud and system |
-
2017
- 2017-02-21 CN CN201710093599.1A patent/CN106656864B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1536820A (en) * | 2003-04-09 | 2004-10-13 | 华为技术有限公司 | Method for raising data transmission performance when the network is congested |
| CN101188547A (en) * | 2006-11-17 | 2008-05-28 | 中兴通讯股份有限公司 | Router for improving forward efficiency based on virtual monitoring group and CAR rate limit |
| CN101286947A (en) * | 2008-05-30 | 2008-10-15 | 杭州华三通信技术有限公司 | Data output controlling method and device therefor |
| CN101374109A (en) * | 2008-10-07 | 2009-02-25 | 中兴通讯股份有限公司 | Method and apparatus for scheduling packets |
| CN101631077A (en) * | 2009-08-24 | 2010-01-20 | 中兴通讯股份有限公司 | Message processing method and device |
| US20120002544A1 (en) * | 2010-07-02 | 2012-01-05 | Nec Laboratories America, Inc. | Dynamic Resource Partitioning for Long-Term Fairness to Non-Elastic Traffic on a Cellular Basestation |
| CN103986653A (en) * | 2014-05-29 | 2014-08-13 | 苏州大学 | Network nodes and data transmission method and system |
| CN105610733A (en) * | 2016-02-17 | 2016-05-25 | 京信通信技术(广州)有限公司 | Queue scheduling processing method and queue scheduling processing system |
| CN106302221A (en) * | 2016-09-12 | 2017-01-04 | 中国联合网络通信集团有限公司 | Traffic scheduling method based on end office's cloud and system |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108429731A (en) * | 2018-01-22 | 2018-08-21 | 新华三技术有限公司 | Anti-attack method, device and electronic equipment |
| CN108429731B (en) * | 2018-01-22 | 2021-10-12 | 新华三技术有限公司 | Anti-attack method and device and electronic equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106656864B (en) | 2020-04-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108063830B (en) | Network slice dynamic resource allocation method based on MDP | |
| Fouda et al. | A lightweight message authentication scheme for smart grid communications | |
| Shakkottai et al. | Network optimization and control | |
| Wang et al. | Adaptive path isolation for elephant and mice flows by exploiting path diversity in datacenters | |
| Goma et al. | Insomnia in the access: or how to curb access network related energy consumption | |
| WO2021047678A1 (en) | Computing power routing method and apparatus | |
| CN105634956B (en) | A kind of message forwarding method, device and system | |
| CN111638957B (en) | Method for realizing cluster sharing type public cloud load balance | |
| CN104468358A (en) | Message forwarding method and device of distributive virtual switch system | |
| CN101141420A (en) | Method and system for performing data communication between private network and public network | |
| CN108810993A (en) | Network is sliced selection method, equipment, UE, control plane functional entity and medium | |
| CN109788041B (en) | SDN cloud network integrated system based on UTN network | |
| Liu et al. | Full-duplex aided user virtualization for mobile edge computing in 5G networks | |
| Zhu et al. | Secure routing in smart grids | |
| CN103312682A (en) | Method and system for accessing gateway safely | |
| CN106209990A (en) | The appreciable request scheduling method of cost under a kind of distribution strange land cloud data center | |
| Wang et al. | Performance modeling and suitability assessment of data center based on fog computing in smart systems | |
| CN106656864A (en) | Message forwarding scheduling method and apparatus | |
| Tang et al. | Dynamic computation offloading with imperfect state information in energy harvesting small cell networks: A partially observable stochastic game | |
| Qiu et al. | Optimal rate allocation in wireless networks with delay constraints | |
| Luo et al. | Traffic-aware VDC embedding in data center: A case study of fattree | |
| Chochlidakis et al. | Robust virtual network embedding for mobile networks | |
| CN112838993A (en) | Method for realizing dynamic issuing of MAC VLAN | |
| Raussi et al. | Edge Computing supported Fault Indication in Smart Grid | |
| CN105376231A (en) | Method and device for realizing service isolation |
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 |