CN106411768B - Business chain resource regulating method and device - Google Patents
Business chain resource regulating method and device Download PDFInfo
- Publication number
- CN106411768B CN106411768B CN201510462802.9A CN201510462802A CN106411768B CN 106411768 B CN106411768 B CN 106411768B CN 201510462802 A CN201510462802 A CN 201510462802A CN 106411768 B CN106411768 B CN 106411768B
- Authority
- CN
- China
- Prior art keywords
- path
- network element
- business chain
- feasible
- users
- 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.)
- Active
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/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
Abstract
The present invention discloses a kind of business chain resource regulating method and device.This method comprises: obtaining the business chain demand information of user, wherein business chain demand information includes that appellative function network element and appellative function network element pass through sequence；Passing through for functional network element sequentially determines all feasible paths according to demand；Obtain the path length and path reception number of users of all feasible paths；Number of users is received according to the path length of all feasible paths and path, the business chain path of user is selected from all feasible paths.Use is optimized by considering multiple resources optimization, to three kinds of resources of link bandwidth between virtual machine CPU, virutal machine memory and server in the present invention, and carries out load balancing from the angle in whole path, to realize more preferably business chain Path selection.
Description
Technical field
The present invention relates to data communication field, in particular to a kind of business chain resource regulating method and device.
Background technique
Business chain is one of NFV (Network Function Virtualization, network function virtualization) technology
Hot spot application scene.Current operation chain networking mode relatively flexibly-have string shape, star and mixed type.Due to business chain deployment with
For topology there are strong correlation, different networking modes will lead to different business chain deployment way.Business chain scheduling of resource is related to
Several factors: being that functional network element shifts to an earlier date preset or temporarily triggers configuration by client；When multiple equipment runs same functional network element,
Which device service user etc. should be selected.
Current business chain resource scheduling algorithm has Round Robin (poll), Least Load (minimum load) and
Random (random), it is overall fairly simple, resource use is not enough, especially, will lead to road under shape networking mode going here and there
Diameter is turned back problem, and link bandwidth resource between server is caused to waste.
Summary of the invention
In view of the above technical problem, the present invention provides a kind of business chain resource regulating method and devices, realize business
The optimum choice in chain path.
According to an aspect of the present invention, a kind of business chain resource regulating method is provided, comprising:
Obtain the business chain demand information of user, wherein business chain demand information includes appellative function network element and demand
Functional network element passes through sequence；
Passing through for functional network element sequentially determines all feasible paths according to demand；
Obtain the path length and path reception number of users of all feasible paths；
Number of users is received according to the path length of all feasible paths and path, selects user from all feasible paths
Business chain path.
In one embodiment of the invention, after the step of obtaining the business chain demand information of user, the method
Further include:
Judge whether the corresponding resource of appellative function network element is enough on current business chain；
If the corresponding resource of appellative function network element is enough on current business chain, passing through for functional network element according to demand is executed
Sequence determines the step of all feasible paths；
If the corresponding inadequate resource of appellative function network element on current business chain opens new virtual machine and installs new need
Functional network element is sought, executes the step of determining all feasible paths by sequence of functional network element according to demand later.
In one embodiment of the invention, number of users is received according to the path length of all feasible paths and path,
The step of business chain path of selection user, includes: from all feasible paths
According to the path length of all feasible paths, judge in all feasible paths with the presence or absence of path of not turning back；
It does not turn back path if existing in all feasible paths, path reception number of users is most in the path that selects not turn back
Business chain path of the path as user.
In one embodiment of the invention, number of users is received according to the path length of all feasible paths and path,
The step of business chain path of user is selected from all feasible paths further include:
If being corrected the business to determine user to feasible path there is no path of not turning back in all feasible paths
Chain path.
In one embodiment of the invention, the step of business chain path to determine user is corrected to feasible path
Include:
By all feasible paths, composition First ray is ranked up according to the sequence of path length from short to long；
Feasible path identical for path length in First ray, according to the sequence of path reception number of users from more to less
First ray sequence is become the second sequence by sequence；
According to the sequence of the second sequence, by way of newly-increased virtual machine, path correction is carried out to feasible path, will be turned back
Path correction is path of not turning back；
If the path correction success to a feasible path, stops the correction to later path, and selects to be entangled
Positive path is as business chain path；
If the path correction to all feasible paths fails, by first business as user in the second sequence
Chain path.
In one embodiment of the invention, by way of newly-increased virtual machine, path correction is carried out to feasible path, it will
Path correction of turning back is the step of not turning back path
Determine the server of newly-increased virtual machine, wherein the determination process of the server meets two constraint conditions: newly-increased
Virtual machine number it is minimum；In the server that can increase virtual machine newly, the least server of current virtual machine number is selected；
Increase virtual machine newly, on the server so that the path correction that will turn back is path of not turning back.
In one embodiment of the invention, obtain all feasible paths path reception number of users the step of include:
According to user to the surplus of the average consumption of virtual machine CPU and memory source and each virtual machine CPU and memory
Remaining stock number obtains the CPU reception number of users and memory reception number of users of each virtual machine；
Number of users is received to CPU and memory reception number of users is minimized, obtains the reception number of users of each virtual machine；
It minimizes to the reception number of users of virtual machine involved in each feasible path, obtains the path of the feasible path
Receive number of users.
In one embodiment of the invention, the method also includes:
Judge virtual functions network element whether is preset on serial networking equipment；
If presetting virtual functions network element on serial networking equipment, the step for obtaining the business chain demand information of user is executed
Suddenly；
If there is no preset virtual functions network element on serial networking equipment, according to the demand accounting of each virtual functions network element
Sequence from high to low successively places a virtual functions network element on different server, executes the business for obtaining user later
The step of chain demand information.
According to another aspect of the present invention, a kind of business chain resource scheduling device is provided, including demand obtains module, path
Primary election module, parameter acquisition module and path determination module, in which:
Demand obtains module, and for obtaining the business chain demand information of user, the business chain demand information includes demand
Functional network element and the appellative function network element pass through sequence；
Primary election module in path determines all feasible paths by sequence for functional network element according to demand；
Parameter acquisition module, for obtaining the path length and path reception number of users of all feasible paths；
Path determination module, for receiving number of users according to the path length of all feasible paths and path, from all
The business chain path of user is selected in feasible path.
In one embodiment of the invention, described device further includes that resource checks that module and resource increase module newly, in which:
Resource checks module, for judging whether the corresponding resource of appellative function network element is enough on current business chain；And
When the corresponding resource of appellative function network element is enough on current business chain, instruction path primary election module executes functional network element according to demand
The operation that all feasible paths are determined by sequence；
Resource increases module newly, for checking the judging result of module, the appellative function net on current business chain according to resource
It when first corresponding inadequate resource, opens new virtual machine and new appellative function network element is installed, indicate path primary election module later
Execute the operation that all feasible paths are determined by sequence of functional network element according to demand.
In one embodiment of the invention, path determination module includes identifying submodule and Path selection submodule,
In:
Identification submodule judges to whether there is in all feasible paths for the path length according to all feasible paths
It does not turn back path；
Path selection submodule exists in all feasible paths and does not roll over for the judging result according to identification submodule
When returning path, in the path that selects not turn back business chain path of the reception number of users most path in path as user.
In one embodiment of the invention, path determination module further includes path correction submodule, in which:
Path correction submodule, for the judging result according to identification submodule, there is no not in all feasible paths
Turn back path when, the business chain path to determine user is corrected to feasible path.
In one embodiment of the invention, path correction submodule includes the first sequencing unit, the second sequencing unit, road
Diameter corrects unit and path determining unit, in which:
First sequencing unit, for being ranked up structure according to the sequence of path length from short to long for all feasible paths
At First ray；
Second sequencing unit is used for feasible path identical for path length in First ray, receives and uses according to path
The sequence sequence of amount from more to less, becomes the second sequence for First ray sequence；
Path correction unit, for the sequence according to the second sequence, by way of newly-increased virtual machine, to feasible path into
Row path correction, the path correction that will turn back are path of not turning back；
Path determining unit, in path correction success of the path correction unit to feasible path, stopping pair
The correction in later path, and select to be repaired path as business chain path；And path correction unit to it is all can
When the path correction of walking along the street diameter fails, the business chain path by first in the second sequence as user.
In one embodiment of the invention, path correction unit includes that position determines that subelement and path correction are single
Member, in which:
Position determines subelement, for determining the server of newly-increased virtual machine, wherein the determination process of the server is full
Two constraint conditions of foot: newly-increased virtual machine number is minimum；In the server that can increase virtual machine newly, current virtual machine is selected
The least server of number；
Path correction subelement increases virtual machine newly on the determining server of subelement for determining in position, to roll over
Returning path correction is path of not turning back.
In one embodiment of the invention, parameter acquisition module receives number of users in the path for obtaining all feasible paths
When, for according to user to the surplus of the average consumption of virtual machine CPU and memory source and each virtual machine CPU and memory
Remaining stock number obtains the CPU reception number of users and memory reception number of users of each virtual machine；Number of users and memory are received to CPU
Reception number of users is minimized, and the reception number of users of each virtual machine is obtained；And to virtual machine involved in each feasible path
Reception number of users minimize, obtain the feasible path path reception number of users.
In one embodiment of the invention, described device further includes identification module and network element preset module, in which:
Identification module, for judging whether preset virtual functions network element on serial networking equipment；And it is set in serial networking
For when above presetting virtual functions network element, instruction demand obtains module and executes the operation for obtaining the business chain demand information of user；
Network element preset module does not have preset virtual for the judging result according to identification module on serial networking equipment
When functional network element, according to the sequence of the demand accounting of each virtual functions network element from high to low, successively put on different server
A virtual functions network element is set, indicates that demand obtains module and executes the operation for obtaining the business chain demand information of user later.
The present invention considers multiple resources optimization, to three kinds of link bandwidth between virtual machine CPU, virutal machine memory and server
Use is optimized in resource, and carries out load balancing from the angle in whole path, to realize more preferably business chain path
Selection.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of invention without any creative labor, may be used also for those of ordinary skill in the art
To obtain other drawings based on these drawings.
Fig. 1 is the schematic diagram of business chain resource regulating method one embodiment of the present invention.
Fig. 2 is the schematic diagram that acquisite approachs receives number of users in one embodiment of the invention.
Fig. 3 is the schematic diagram for selecting business chain path in one embodiment of the invention from feasible path.
Fig. 4 is the schematic diagram corrected to path of turning back in one embodiment of the invention to determine business chain path.
Fig. 5 is the schematic diagram of another embodiment of business chain resource regulating method of the present invention.
Fig. 6 is the schematic diagram that network element initialization is placed in one embodiment of the invention.
Fig. 7 is that server is selected in one embodiment of the invention to increase the schematic diagram of virtual machine newly.
Fig. 8 is to increase the schematic diagram after virtual machine in one embodiment of the invention newly.
Fig. 9 is the schematic diagram of business chain resource scheduling device one embodiment of the present invention.
Figure 10 is the schematic diagram of path determination module in one embodiment of the invention.
Figure 11 is the schematic diagram of path syndrome module in one embodiment of the invention.
Figure 12 is the schematic diagram of another embodiment of business chain resource scheduling device of the present invention.
Figure 13 is the Internet resources schematic diagram of the first specific embodiment of the invention.
Figure 14 is the Internet resources schematic diagram of the second specific embodiment of the invention.
Figure 15 is the Internet resources schematic diagram in the second specific embodiment of the invention after path correction.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.Below
Description only actually at least one exemplary embodiment be it is illustrative, never as to the present invention and its application or make
Any restrictions.Based on the embodiments of the present invention, those of ordinary skill in the art are not making creative work premise
Under every other embodiment obtained, shall fall within the protection scope of the present invention.
Unless specifically stated otherwise, positioned opposite, the digital table of the component and step that otherwise illustrate in these embodiments
It is not limited the scope of the invention up to formula and numerical value.
Simultaneously, it should be appreciated that for ease of description, the size of various pieces shown in attached drawing is not according to reality
Proportionate relationship draw.
Technology, method and apparatus known to person of ordinary skill in the relevant may be not discussed in detail, but suitable
In the case of, the technology, method and apparatus should be considered as authorizing part of specification.
It is shown here and discuss all examples in, any occurrence should be construed as merely illustratively, without
It is as limitation.Therefore, the other examples of exemplary embodiment can have different values.
It should also be noted that similar label and letter indicate similar terms in following attached drawing, therefore, once a certain Xiang Yi
It is defined in a attached drawing, then in subsequent attached drawing does not need that it is further discussed.
Fig. 1 is the schematic diagram of business chain resource regulating method one embodiment of the present invention.Preferably, the present embodiment can be by this
Invention business chain resource scheduling device executes.Method includes the following steps:
Step 101, obtain the business chain demand information of user, wherein business chain demand information include appellative function network element,
And appellative function network element pass through sequence.
The present invention is serviced for single user, is often carried out a user and is just carried out routing calculating.Each user
There is appellative function network element (functional network element that must pass through) and fixed by sequence, therefore the corresponding business chain of a user
Demand information, network need to select a business chain path for user.
In one embodiment of the invention, the appellative function network element of user may include DPI (Deep Packet
Inspection, deep-packet detection), FW (Firewall, firewall) and NAT (Network Address Translation,
Network address translation) etc. virtual functional units.Appellative function network element can be with by sequence are as follows: DPI- > FW- > NAT.
Step 102, according to demand functional network element by sequence, traverse current network service device in possess appellative function net
The virtual machine of member, determines all feasible paths.
Step 103, the path length and path reception number of users of all feasible paths are obtained.
In one embodiment of the invention, as shown in Fig. 2, in the step 103 of Fig. 1, the road of all feasible paths is obtained
Diameter receive number of users the step of may include:
Step 201, according to user to the average consumption of virtual machine CPU and memory source and each virtual machine CPU and
The surplus yield of memory receives number of users by the CPU that following formula obtains each virtual machine and memory receives number of users:
CPU receives number of users=VM CPU surplus resources/user to the average consumption of VM cpu resource；
Memory receives number of users=VM memory surplus resources/user to the average consumption of VM memory source.
Step 202, number of users is received to CPU and memory reception number of users is minimized, obtain connecing for each virtual machine VM
To number of users.
That is, virtual machine reception number of users=Min (CPU receives number, and memory receives number).
Step 203, it minimizes to the reception number of users of virtual machine involved in each feasible path, obtaining this can walking along the street
Receive number of users in the path of diameter.
Assuming that n virtual machine involved in a feasible path, then:
Receive number of users=Min in path (VM1 receives number of users ..., and VMn receives number of users).
Step 104, number of users is received according to the path length of all feasible paths and path, from all feasible paths
Select the business chain path of user.
In one embodiment of the invention, as shown in figure 3, the step 104 in Fig. 1 may include:
Step 301, according to the path length of all feasible paths, judge in all feasible paths with the presence or absence of road of not turning back
Diameter.If there is path of not turning back in all feasible paths, 302 are thened follow the steps；Otherwise, if there is no not in all feasible paths
It turns back path, thens follow the steps 303.
In one embodiment of the invention, it is going here and there under shape networking mode, path length of not turning back is fixed to be equal to a perseverance
Definite value (server number+1), therefore the path for being greater than this steady state value is necessarily path of turning back.
Step 302, select not turn back business chain path of the most path of path reception number of users in path as user,
Other steps of the present embodiment are no longer executed later.
Step 303, the business chain path to determine user is corrected to feasible path.
In one embodiment of the invention, as shown in figure 4, the step 303 in Fig. 3 may include:
Step 401, it by all feasible paths, is ranked up according to the sequence of path length from short to long and constitutes the first sequence
Column.
Step 402, feasible path identical for path length in First ray, according to path reception number of users by more to
First ray sequence is become the second sequence by few sequence sequence.
Step 403, it (is turned back by way of newly-increased virtual machine to each feasible path according to the sequence of the second sequence
Path) carry out path correction.
In one embodiment of the invention, step 403 can specifically include: determine the server of newly-increased virtual machine；With
And increase virtual machine newly on the server, so that the path correction that will turn back is path of not turning back.Wherein it is determined that in which service
When increasing virtual machine on device server newly, need to meet following two constraint condition: 1, VM newly-increased number is minimum；2, can be new
In the server for increasing VM, the current least server of VM number is selected.
Step 404, if the path correction to a feasible path is successful, stop the correction to later path, and
Select to be repaired path as business chain path.
It step 405, can walking along the street by first in the second sequence if the path correction to all feasible paths fails
Business chain path of the diameter (path length is most short) as user.
Based on the business chain resource scheduling device that the above embodiment of the present invention provides, passage path length determines feasible path
Whether turn back, and path of turning back is corrected by newly-increased virtual machine.Business chain path folding can be effectively prevented in the present invention as a result,
It returns, turns back the waste of link bandwidth resource between bring server to efficiently solve path.
Meanwhile the above embodiment of the present invention is selected according to the path length of all feasible paths and path reception number of users
Final business access path, it is contemplated that multiple resources optimization, wherein passage path reception number of users of the present invention considers virtual machine
Cpu resource and virutal machine memory resource, link bandwidth resource between considering server of being turned back by correction path.Therefore, this hair
Bright above-described embodiment has comprehensively considered resources of virtual machine and bandwidth resources, realizes to virtual machine CPU, virutal machine memory and service
The optimization of three kinds of resources of link bandwidth uses between device；And load balancing is carried out from the angle in whole path, realize physical services
The load balancing of device and VM, to realize more preferably business chain Path selection.
In one embodiment of the invention, before step 101, the method can also include: user arrive before,
Preset each virtual functions network element on string shape networking equipment.Wherein, preset each virtual functions network element on string shape networking equipment
The step of can specifically include: the demand accounting of each functional network element is inferred by historical data or empirical value；And press accounting
Descending sequence successively places a network element on different server.The present invention provides a set of advantages of simple as a result,
Virtual functions network element initialization scheme, this is that existing method does not have.
Fig. 5 is the schematic diagram of another embodiment of business chain resource regulating method of the present invention.Preferably, the present embodiment can be by this
Invention business chain resource scheduling device executes.Step 503, step 506- step 508 in the present embodiment respectively with it is real shown in Fig. 1
The step 101- step 104 applied in example is same or similar, is no longer described in detail below to step 503, step 506- step 508.
Method includes the following steps:
Step 501, judge virtual functions network element whether is preset on serial networking equipment.If preset on serial networking equipment
There is virtual functions network element, thens follow the steps 503；Otherwise, it if there is no preset virtual functions network element on serial networking equipment, executes
Step 502.
Step 502, the sequence according to the demand accounting of each virtual functions network element from high to low, successively in different server
One virtual functions network element of upper placement.
In one embodiment of the invention, step 502 may include: to be inferred each by historical data or empirical value
The demand accounting of functional network element；And a network element is successively placed on different server by the descending sequence of accounting.Assuming that
The demand accounting of tri- functional network elements of DPI, FW, NAT is sequentially reduced, then can according to the set-up mode of embodiment shown in fig. 6,
DPI1 is opened on the server, opens FW1 on a server 2, opens NAT1 on server 3.
Step 503, obtain the business chain demand information of user, wherein business chain demand information include appellative function network element,
And appellative function network element pass through sequence.
Step 504, judge whether the corresponding resource of appellative function network element is enough on current business chain.If on current business chain
The corresponding resource of appellative function network element is enough, thens follow the steps 506；Otherwise, if appellative function network element is corresponding on current business chain
Inadequate resource, then follow the steps 505.
Step 505, it opens new virtual machine and new appellative function network element is installed, execute step 506 later.Newly-increased VM's
Detailed process is as shown in Fig. 7, which illustrates the VM that select which platform server carrying newly-increased.
In one embodiment of the invention, it is assumed that the VM number that can be opened on every server is limited.Such as Fig. 7 institute
Show, the detailed process of newly-increased VM may include:
Step 701, judge whether the virtual machine quantity of local server reaches the upper limit, wherein local server refers to wrapping
Appellative function network element (such as DPI) but the server of the corresponding inadequate resource of the functional network element containing a certain user.If judgement
The virtual machine quantity of local server reaches the upper limit, thens follow the steps 703；Otherwise, if judging the virtual machine number of local server
Amount is not up to the upper limit, thens follow the steps 702.
Step 702, virtual machine is increased newly in local server, and according to new appellative function network element.If local server has
Multiple, then selection increases virtual machine newly on the few local server of existing virtual machine quantity.
In one embodiment of the invention, as shown in figure 8, if appellative function net on server 1 (local server)
First DPI1 inadequate resource then increases virtual machine VM2 newly and according to new appellative function network element DPI2 on the server.
In another embodiment of the invention, as shown in figure 13, it is assumed that the appellative function network element NAT1 kimonos on server 3
The equal inadequate resource of appellative function network element NAT2 being engaged on device 4, since virtual machine quantity existing on server 4 is less than server 3, because
This increases virtual machine VM2 newly on server 4 and according to new appellative function network element NAT3.
Step 703, judge whether the virtual machine quantity of neighbours' server (server adjacent with local server) reaches
The upper limit, if judging, the virtual machine quantity of neighbours' server reaches the upper limit, thens follow the steps 705；Otherwise, if judging neighbours' server
Virtual machine quantity be not up to the upper limit, then follow the steps 704.
Step 704, virtual machine is increased newly in neighbours' server, and according to new appellative function network element.If neighbours' server has
Multiple, then selection increases virtual machine newly on the few neighbours' server of existing virtual machine quantity.
Step 705, judge the virtual machine number of other servers (server in addition to local server and part server)
Whether amount reaches the upper limit, if the virtual machine quantity of other servers reaches the upper limit, thens follow the steps 706；Otherwise, if judging other
The virtual machine quantity of server is not up to the upper limit, thens follow the steps 707.
Step 706, virtual machine can not be increased newly, current ink is unable to satisfy user demand, and step executes the present embodiment later
Other steps.
Step 707, virtual machine is increased newly in other servers, and according to new appellative function network element.It is preferred that in adjacent service
New virtual machine is opened on device (apart from the closer server of local server).
Step 506, according to demand functional network element by sequence, traverse current network service device in possess appellative function net
The virtual machine of member, determines all feasible paths.
Step 507, the path length and path reception number of users of all feasible paths are obtained.
Step 508, number of users is received according to the path length of all feasible paths and path, from all feasible paths
Select the business chain path of user.
The above embodiment of the present invention provides the functional network element initialization scheme of a set of advantages of simple, to solve existing
In business chain resource scheduling scheme, when not presetting virtual functions network element on serial networking equipment, business chain can not be carried out
The problem of scheduling of resource.Meanwhile the above embodiment of the present invention additionally provides resource inspection and newly-increased mechanism, devises coping resources
The resource for exhausting situation increases mechanism newly, to obtain good resource expansion, it is therefore prevented that because of packet loss caused by inadequate resource
Or empty machine collapse phenomenon.
Fig. 9 is the schematic diagram of business chain resource scheduling device one embodiment of the present invention.As shown in figure 9, the business chain
Resource scheduling device includes that demand obtains module 100, path primary election module 200, parameter acquisition module 300 and path determination module
400, in which:
Demand obtains module 100, and for obtaining the business chain demand information of user, the business chain demand information includes needing
That asks functional network element and the appellative function network element passes through sequence.
Path primary election module 200 determines all feasible paths by sequence for functional network element according to demand.
Parameter acquisition module 300, for obtaining the path length and path reception number of users of all feasible paths.
In one embodiment of the invention, parameter acquisition module 300 is received in the path for obtaining all feasible paths and is used
When amount, can be used for according to user to the average consumption of virtual machine CPU and memory source and each virtual machine CPU and
The surplus yield of memory obtains the CPU reception number of users and memory reception number of users of each virtual machine；User is received to CPU
Several and memory reception number of users is minimized, and the reception number of users of each virtual machine is obtained；And to involved in each feasible path
The reception number of users of virtual machine minimize, obtain the path reception number of users of the feasible path.
Path determination module 400, for receiving number of users according to the path length of all feasible paths and path, from institute
There is the business chain path that user is selected in feasible path.
In one embodiment of the invention, as shown in Figure 10, the path determination module 400 in Fig. 9 may include identification
Submodule 410, Path selection submodule 420 and path correction submodule 430, in which:
Identify that submodule 410 judges whether deposit in all feasible paths for the path length according to all feasible paths
In path of not turning back.
Path selection submodule 420 is deposited in all feasible paths for the judging result according to identification submodule 410
When not turning back path, in the path that selects not turn back business chain path of the reception number of users most path in path as user.
Path correction submodule 430, for the judging result according to identification submodule 410, in all feasible paths not
In the presence of do not turn back path when, the business chain path to determine user is corrected to feasible path.
In one embodiment of the invention, as shown in figure 11, the path correction submodule 430 in Figure 10 may include
One sequencing unit 431, the second sequencing unit 432, path correction unit 433 and path determining unit 434, in which:
First sequencing unit 431, for being ranked up according to the sequence of path length from short to long by all feasible paths
Constitute First ray.
Second sequencing unit 432 is used for feasible path identical for path length in First ray, receives according to path
The sequence sequence of number of users from more to less, becomes the second sequence for First ray sequence.
Path correction unit 433, for the sequence according to the second sequence, by way of newly-increased virtual machine, to can walking along the street
Diameter carries out path correction, and the path correction that will turn back is path of not turning back.
Path determining unit 434, for determining final business chain path.Such as: in path correction unit 433 to one
When the path correction success of feasible path, path determining unit 434 is used to stop the correction to later path, and selects quilt
Path is corrected as business chain path；When path correction of the path correction unit 433 to all feasible paths fails, path
Determination unit 434 is for the business chain path by first in the second sequence as user.
Based on the business chain resource scheduling device that the above embodiment of the present invention provides, passage path length determines feasible path
Whether turn back, and path of turning back is corrected by newly-increased virtual machine.Business chain path folding can be effectively prevented in the present invention as a result,
It returns, turns back the waste of link bandwidth resource between bring server to efficiently solve path.
Meanwhile the above embodiment of the present invention is selected according to the path length of all feasible paths and path reception number of users
Final business access path, it is contemplated that multiple resources optimization, wherein passage path reception number of users of the present invention considers virtual machine
Cpu resource and virutal machine memory resource, link bandwidth resource between considering server of being turned back by correction path.Therefore, this hair
Bright above-described embodiment has comprehensively considered resources of virtual machine and bandwidth resources, realizes to virtual machine CPU, virutal machine memory and service
The optimization of three kinds of resources of link bandwidth uses between device；And load balancing is carried out from the angle in whole path, realize physical services
The load balancing of device and VM, to realize more preferably business chain Path selection.
In one embodiment of the invention, path correction unit 433 may include that position determines that subelement and path entangle
Syndromes unit, in which:
Position determines subelement, for determining the server of newly-increased virtual machine, wherein the determination process of the server is full
Two constraint conditions of foot: newly-increased virtual machine number is minimum；In the server that can increase virtual machine newly, current virtual machine is selected
The least server of number.
Path correction subelement increases virtual machine newly on the determining server of subelement for determining in position, to roll over
Returning path correction is path of not turning back.
Figure 12 is the schematic diagram of another embodiment of business chain resource scheduling device of the present invention.With embodiment phase shown in Fig. 9
Than in the embodiment shown in fig. 12, described device can also include identification module 500 and network element preset module 600, in which:
Identification module 500, for judging whether preset virtual functions network element on serial networking equipment；And in serial networking
When presetting virtual functions network element in equipment, instruction demand obtains module 100 and executes the business chain demand information for obtaining user
Operation.
Network element preset module 600, for the judging result according to identification module 500, without pre- on serial networking equipment
When setting virtual functions network element, according to the sequence of the demand accounting of each virtual functions network element from high to low, successively in different services
A virtual functions network element is placed on device, indicates that demand obtains module 100 and executes the business chain demand information for obtaining user later
Operation.
The above embodiment of the present invention provides the functional network element initialization scheme of a set of advantages of simple, to solve existing
In business chain resource scheduling scheme, when not presetting virtual functions network element on serial networking equipment, business chain can not be carried out
The problem of scheduling of resource.
In one embodiment of the invention, as shown in figure 12, described device can also include that resource checks 700 He of module
Resource increases module 800 newly, in which:
Resource checks module 700, for judging whether the corresponding resource of appellative function network element is enough on current business chain；And
When the corresponding resource of appellative function network element is enough on current business chain, instruction path primary election module 200 executes function according to demand
The operation that all feasible paths are determined by sequence of energy network element.
Resource increases module 800 newly, for checking the judging result of module 700, the demand on current business chain according to resource
It when the corresponding inadequate resource of functional network element, opens new virtual machine and new appellative function network element is installed, at the beginning of indicating path later
Modeling block 200 executes the operation that all feasible paths are determined by sequence of functional network element according to demand.
The above embodiment of the present invention provides resource inspection and newly-increased mechanism, devises the resource that coping resources exhaust situation
Newly-increased mechanism, to obtain good resource expansion, it is therefore prevented that because of packet loss or empty machine collapse phenomenon caused by inadequate resource.
Below by specific example, the present invention will be described:
First specific embodiment:
Figure 13 is the Internet resources schematic diagram of the first specific embodiment of the invention.As shown in figure 13, serial in the embodiment
Virtual functional units are preset on networking equipment, so without carrying out network function initialization operation.The industry of the present embodiment
Business chain resource regulating method specifically includes:
The business chain demand information of step 1. acquisition user.Wherein, appellative function network element pass through sequence are as follows: DPI- > FW-
>NAT。
The current CPU and memory usage of each VM are marked in attached drawing 13, it is assumed that money of the user to virtual functions network element
Source average consumption is as shown in the table:
| DPI | FW | NAT | |
| CPU | 0.3% | 0.2% | 0.15% |
| Memory | 0.25% | 0.1% | 0.1% |
Step 2. resource inspection.Compare in Figure 13 virtual function in the current CPU of each VM and memory usage and upper table
The resource average consumption of energy network element, can obtain current DPI, FW and NAT have resource.
Step 3. lists all feasible paths, and calculates path length.
| Path number | Path | Length |
| 1 | DPI2->FW3->NAT1 | 5 |
| 2 | DPI3->FW3->NAT1 | 7 (turning back) |
| 3 | DPI2->FW1->NAT1 | 5 |
| 4 | DPI3->FW1->NAT1 | 5 |
| 5 | DPI2->FW4->NAT1 | 5 |
| 6 | DPI3->FW4->NAT1 | 5 |
Step 4. calculates the number of users that path can receive
Path can receive number of users are as follows:
| Path number | Path | Receive number of users |
| 1 | DPI2->FW3->NAT1 | 116 |
| 3 | DPI2->FW1->NAT1 | 100 |
| 4 | DPI3->FW1->NAT1 | 100 |
| 5 | DPI2->FW4->NAT1 | 116 |
| 6 | DPI3->FW4->NAT1 | 100 |
Step 5. sorts according to the sequence of path reception number of users from more to less, if the path that path reception number of users is most
There are a plurality of (such as paths 1 and path 5 in upper table), then randomly choose one and be used as business chain path.
Outgoing traffic chain path: DPI2- > FW3- > NAT1.
Specific embodiment 2:
Figure 14 is the Internet resources schematic diagram of the second specific embodiment of the invention.As shown in figure 14, serial in the embodiment
Virtual functional units are preset on networking equipment, so without carrying out network function initialization operation.The industry of the present embodiment
Business chain resource regulating method specifically includes:
The business chain demand information of step 1. acquisition user.Wherein, appellative function network element pass through sequence are as follows: DPI- >
NAT->FW
The current CPU and memory usage of each VM are marked in attached drawing 14, it is assumed that money of the user to virtual functions network element
Source average consumption is as shown in the table:
| DPI | FW | NAT | |
| CPU | 0.3% | 0.2% | 0.15% |
| Memory | 0.25% | 0.1% | 0.1% |
Step 2. resource inspection.Compare in Figure 13 virtual function in the current CPU of each VM and memory usage and upper table
The resource average consumption of energy network element, can obtain current DPI, FW and NAT have resource.
Step 3. lists all feasible paths, and computational length.
| Path number | Path | Length |
| 1 | DPI3->NAT1->FW2 | 9 (turning back) |
| 2 | DPI3->NAT2->FW2 | 11 (turning back) |
| 3 | DPI3->NAT1->FW3 | 9 (turning back) |
| 4 | DPI3->NAT2->FW3 | 11 (turning back) |
Step 4. calculates the number of users that path can receive
Path can receive number of users are as follows:
| Path number | Path | Length | Receive number of users |
| 1 | DPI3->NAT1->FW2 | 9 | 40 |
| 2 | DPI3->NAT2->FW2 | 11 | 40 |
| 3 | DPI3->NAT1->FW3 | 9 | 20 |
| 4 | DPI3->NAT2->FW3 | 11 | 20 |
Ascending according to path length, the sequence sequence of reception number of users from more to less, the path of length connects if they are the same
It is also identical to number of users, then it is randomly ordered.
| Path number | Path | Length | Receive number of users |
| 1 | DPI3->NAT1->FW2 | 9 | 40 |
| 3 | DPI3->NAT1->FW3 | 9 | 20 |
| 2 | DPI3->NAT2->FW2 | 11 | 40 |
| 4 | DPI3->NAT2->FW3 | 11 | 20 |
Step 5. carries out correction of turning back since path 1.
As shown in figure 14, the correction of turning back in path 1 may be implemented using following three kinds of schemes for the present embodiment:
1, it increases VM newly on server 3 and places FW network element FW5 and just can solve path and turn back problem, constitute business chain path:
DPI3->NAT1->FW5。
2, it increases VM newly on server 4 and places FW network element FW5 and just can solve path and turn back problem, constitute business chain path:
DPI3->NAT1->FW5。
3, it increases VM newly on the server and places network element DPI4 and NAT3 and also can solve path and turn back problem, constitute business chain
Path: DPI4- > NAT3- > FW2.
But, it is contemplated that two constraint conditions of path correction: firstly, VM newly-increased number is minimum, needed in scheme 1,2
Increase 1 VM newly, scheme 3 need to increase 2 VM newly, thus be excluded that scheme 3.Meanwhile according in the server that can increase VM newly, select
The constraint condition of the current least server of VM number, as shown in figure 14, the current VM number of server 3 are 2, server 4 it is current
VM number is 1.
Therefore, selection scheme 2 increase VM placement FW network element FW5 progress path newly on server 4 and turn back as shown in figure 15
It corrects, outgoing traffic chain path: DPI3- > NAT1- > FW5.
Business chain resource scheduling device described above can be implemented as executing function described in the invention
General processor, programmable logic controller (PLC) (PLC), digital signal processor (DSP), specific integrated circuit (ASIC), scene
Programmable gate array (FPGA) either other programmable logic device, discrete gate or transistor logic, discrete hardware group
Part or it is any appropriately combined.
So far, the present invention is described in detail.In order to avoid covering design of the invention, it is public that this field institute is not described
The some details known.Those skilled in the art as described above, completely it can be appreciated how implementing technology disclosed herein
Scheme.
Those of ordinary skill in the art will appreciate that realizing that all or part of the steps of above-described embodiment can pass through hardware
It completes, relevant hardware can also be instructed to complete by program, the program can store in a kind of computer-readable
In storage medium, storage medium mentioned above can be read-only memory, disk or CD etc..
Description of the invention is given for the purpose of illustration and description, and is not exhaustively or will be of the invention
It is limited to disclosed form.Many modifications and variations are obvious for the ordinary skill in the art.It selects and retouches
It states embodiment and is to more preferably illustrate the principle of the present invention and practical application, and those skilled in the art is enable to manage
The solution present invention is to design various embodiments suitable for specific applications with various modifications.
Claims (14)
1. a kind of business chain resource regulating method characterized by comprising
Obtain the business chain demand information of user, wherein business chain demand information includes appellative function network element and appellative function
Network element passes through sequence；
Passing through for functional network element sequentially determines all feasible paths according to demand；
Obtain the path length and path reception number of users of all feasible paths；
Number of users is received according to the path length of all feasible paths and path, the industry of user is selected from all feasible paths
Business chain path；
Wherein, number of users is received according to the path length of all feasible paths and path, selects to use from all feasible paths
The step of business chain path at family further include:
If being corrected the service link to determine user to feasible path there is no path of not turning back in all feasible paths
Diameter；
Wherein, the step of business chain path to determine user is corrected to feasible path include:
By all feasible paths, composition First ray is ranked up according to the sequence of path length from short to long；
Feasible path identical for path length in First ray is arranged according to the sequence of path reception number of users from more to less
First ray sequence is become the second sequence by sequence；
According to the sequence of the second sequence, by way of newly-increased virtual machine, path correction is carried out to feasible path, by path of turning back
It is corrected as path of not turning back；
If the path correction success to a feasible path, stops the correction to later path, and selects to be repaired road
Diameter is as business chain path.
2. the method according to claim 1, wherein obtain user business chain demand information the step of it
Afterwards, further includes:
Judge whether the corresponding resource of appellative function network element is enough on current business chain；
If the corresponding resource of appellative function network element is enough on current business chain, execute functional network element according to demand passes through sequence
The step of determining all feasible paths；
If the corresponding inadequate resource of appellative function network element on current business chain, opens new virtual machine and new demand function is installed
Energy network element executes the step of determining all feasible paths by sequence of functional network element according to demand later.
3. method according to claim 1 or 2, which is characterized in that according to the path length of all feasible paths and road
Diameter receive number of users, from all feasible paths select user business chain path the step of include:
According to the path length of all feasible paths, judge in all feasible paths with the presence or absence of path of not turning back；
It does not turn back path if existing in all feasible paths, in the path that selects not turn back the most path of path reception number of users
Business chain path as user.
4. method according to claim 1 or 2, which is characterized in that corrected the industry to determine user to feasible path
The step of business chain path further include:
If the path correction to all feasible paths fails, by first service link as user in the second sequence
Diameter.
5. method according to claim 1 or 2, which is characterized in that by way of newly-increased virtual machine, to feasible path into
Row path correction, the path correction that will turn back, which is the step of not turning back path, includes:
Determine the server of newly-increased virtual machine, wherein the determination process of the server meets two constraint conditions: newly-increased void
Quasi- machine number is minimum；In the server that can increase virtual machine newly, the least server of current virtual machine number is selected；
Increase virtual machine newly, on the server so that the path correction that will turn back is path of not turning back.
6. method according to claim 1 or 2, which is characterized in that obtain the path reception number of users of all feasible paths
The step of include:
The average consumption of virtual machine CPU and memory source and the remaining of each virtual machine CPU and memory are provided according to user
Source amount obtains the CPU reception number of users and memory reception number of users of each virtual machine；
Number of users is received to CPU and memory reception number of users is minimized, obtains the reception number of users of each virtual machine；
It minimizes to the reception number of users of virtual machine involved in each feasible path, obtains the path reception of the feasible path
Number of users.
7. method according to claim 1 or 2, which is characterized in that further include:
Judge virtual functions network element whether is preset on serial networking equipment；
If the step of presetting virtual functions network element on serial networking equipment, executing the business chain demand information for obtaining user；
If there is no preset virtual functions network element on serial networking equipment, according to the demand accounting of each virtual functions network element by height
To low sequence, a virtual functions network element is successively placed on different server, the business chain for executing acquisition user later needs
The step of seeking information.
8. a kind of business chain resource scheduling device, which is characterized in that obtain module, path primary election module, parameter including demand and obtain
Modulus block and path determination module, in which:
Demand obtains module, and for obtaining the business chain demand information of user, the business chain demand information includes appellative function
Network element and the appellative function network element pass through sequence；
Primary election module in path determines all feasible paths by sequence for functional network element according to demand；
Parameter acquisition module, for obtaining the path length and path reception number of users of all feasible paths；
Path determination module, for receiving number of users according to the path length of all feasible paths and path, from all feasible
The business chain path of user is selected in path；
Wherein, path determination module further includes path correction submodule, in which:
Path correction submodule corrects feasible path when not turning back path for being not present in all feasible paths
To determine the business chain path of user；
Wherein, path correction submodule includes that the first sequencing unit, the second sequencing unit, path correction unit and path determine list
Member, in which:
First sequencing unit is ranked up composition the according to the sequence of path length from short to long for by all feasible paths
One sequence；
Second sequencing unit is used for feasible path identical for path length in First ray, receives number of users according to path
First ray sequence is become the second sequence by sequence sequence from more to less；
Path correction unit by way of newly-increased virtual machine, carries out road to feasible path for the sequence according to the second sequence
Diameter is corrected, and the path correction that will turn back is path of not turning back；
Path determining unit, for stopping to subsequent in path correction success of the path correction unit to a feasible path
The correction of feasible path, and select to be repaired path as business chain path.
9. device according to claim 8, which is characterized in that it further include that resource checks that module and resource increase module newly,
In:
Resource checks module, for judging whether the corresponding resource of appellative function network element is enough on current business chain；And current
When the corresponding resource of appellative function network element is enough in business chain, instruction path primary election module executes the logical of functional network element according to demand
Cross the operation that sequence determines all feasible paths；
Resource increases module newly, for checking the judging result of module, the appellative function network element pair on current business chain according to resource
It when the inadequate resource answered, opens new virtual machine and new appellative function network element is installed, indicate that primary election module in path executes later
The operation that all feasible paths are determined by sequence of functional network element according to demand.
10. device according to claim 8 or claim 9, which is characterized in that path determination module further includes identification submodule and road
Diameter selects submodule, in which:
Identify submodule, for the path length according to all feasible paths, judging, which whether there is in all feasible paths, does not roll over
Return path；
There is road of not turning back in all feasible paths for the judging result according to identification submodule in Path selection submodule
When diameter, in the path that selects not turn back business chain path of the reception number of users most path in path as user.
11. device according to claim 8 or claim 9, which is characterized in that
Path determining unit, for when path correction unit fails to the path corrections of all feasible paths, by the second sequence
First business chain path as user in column.
12. device according to claim 11, which is characterized in that path correction unit includes that position determines subelement and road
Diameter corrects subelement, in which:
Position determines subelement, for determining the server of newly-increased virtual machine, wherein the determination process of the server meets two
A constraint condition: newly-increased virtual machine number is minimum；In the server that can increase virtual machine newly, current virtual machine number is selected most
Few server；
Path correction subelement increases virtual machine newly on the determining server of subelement for determining in position, so as to the road that will turn back
Diameter is corrected as path of not turning back.
13. device according to claim 8 or claim 9, which is characterized in that
Parameter acquisition module is used for according to user when number of users is received in the path for obtaining all feasible paths to virtual machine CPU
With the average consumption of memory source and the surplus yield of each virtual machine CPU and memory, each virtual machine is obtained
CPU receives number of users and memory receives number of users；Number of users is received to CPU and memory reception number of users is minimized, is obtained every
The reception number of users of a virtual machine；And minimize to the reception number of users of virtual machine involved in each feasible path, it obtains
Receive number of users in the path of the feasible path.
14. device according to claim 8 or claim 9, which is characterized in that it further include identification module and network element preset module,
In:
Identification module, for judging whether preset virtual functions network element on serial networking equipment；And on serial networking equipment
When presetting virtual functions network element, instruction demand obtains module and executes the operation for obtaining the business chain demand information of user；
Network element preset module does not have preset virtual functions for the judging result according to identification module on serial networking equipment
When network element, according to the sequence of the demand accounting of each virtual functions network element from high to low, one is successively placed on different server
A virtual functions network element indicates that demand obtains module and executes the operation for obtaining the business chain demand information of user later.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510462802.9A CN106411768B (en) | 2015-07-31 | 2015-07-31 | Business chain resource regulating method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510462802.9A CN106411768B (en) | 2015-07-31 | 2015-07-31 | Business chain resource regulating method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106411768A CN106411768A (en) | 2017-02-15 |
| CN106411768B true CN106411768B (en) | 2019-08-23 |
Family
ID=58007496
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510462802.9A Active CN106411768B (en) | 2015-07-31 | 2015-07-31 | Business chain resource regulating method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106411768B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109639447B (en) * | 2017-10-09 | 2021-11-12 | 中兴通讯股份有限公司 | Method and device for mapping network function virtualization service chain under ring networking |
| CN111800348A (en) * | 2019-04-09 | 2020-10-20 | 中兴通讯股份有限公司 | Load balancing method and device |
| EP4024779A4 (en) * | 2019-09-16 | 2022-08-17 | Huawei Technologies Co., Ltd. | Communication method, device and system |
| CN114697253A (en) * | 2020-12-28 | 2022-07-01 | 华为技术有限公司 | Method for determining forwarding path of service chain and communication device |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1592217A (en) * | 2003-08-26 | 2005-03-09 | 大唐移动通信设备有限公司 | Managing method for resources in communication system |
| US8667171B2 (en) * | 2010-05-28 | 2014-03-04 | Microsoft Corporation | Virtual data center allocation with bandwidth guarantees |
| CN104079482A (en) * | 2013-03-26 | 2014-10-01 | 华为技术有限公司 | Method and device of selecting routing path |
| CN104283806A (en) * | 2014-10-31 | 2015-01-14 | 杭州华三通信技术有限公司 | Service link processing method and device |
| CN104636184A (en) * | 2014-12-29 | 2015-05-20 | 上海华为技术有限公司 | Deploying method, device and equipment of instances of virtual machine |
| CN104734955A (en) * | 2013-12-19 | 2015-06-24 | 华为技术有限公司 | Network function virtualization implementation method, wide-band network gateway and control device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9300585B2 (en) * | 2013-11-15 | 2016-03-29 | Cisco Technology, Inc. | Shortening of service paths in service chains in a communications network |
-
2015
- 2015-07-31 CN CN201510462802.9A patent/CN106411768B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1592217A (en) * | 2003-08-26 | 2005-03-09 | 大唐移动通信设备有限公司 | Managing method for resources in communication system |
| US8667171B2 (en) * | 2010-05-28 | 2014-03-04 | Microsoft Corporation | Virtual data center allocation with bandwidth guarantees |
| CN104079482A (en) * | 2013-03-26 | 2014-10-01 | 华为技术有限公司 | Method and device of selecting routing path |
| CN104734955A (en) * | 2013-12-19 | 2015-06-24 | 华为技术有限公司 | Network function virtualization implementation method, wide-band network gateway and control device |
| CN104283806A (en) * | 2014-10-31 | 2015-01-14 | 杭州华三通信技术有限公司 | Service link processing method and device |
| CN104636184A (en) * | 2014-12-29 | 2015-05-20 | 上海华为技术有限公司 | Deploying method, device and equipment of instances of virtual machine |
Non-Patent Citations (2)
| Title |
|---|
| 基于SDN和NFV的云数据中心网络服务;李晨 等;《网络技术》;20140630;全文 |
| 网络功能虚拟化中的网络转发性能优化技术研究;唐宏 等;《电信科学》;20141130;全文 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106411768A (en) | 2017-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108260169B (en) | QoS guarantee-based dynamic service function chain deployment method | |
| CN106411768B (en) | Business chain resource regulating method and device | |
| CN104488234B (en) | The system and method that IPv6 is scaled on the three-layer network framework at large-scale data center | |
| CN106656800B (en) | Path selection method and system, network acceleration node and network acceleration system | |
| CN105279027B (en) | A kind of virtual machine deployment method and device | |
| CN104272708B (en) | It is distributed with the stateless first order grouping to server farm and is distributed to the secondary data packets of the stateful second level grouping distribution of some server in group | |
| Yu et al. | Dynamic scaling of virtual clusters with bandwidth guarantee in cloud datacenters | |
| CN103391299B (en) | Load-balancing method and SiteServer LBS | |
| CN109040259A (en) | A kind of CDN node distribution method and system based on MEC | |
| CN103596066B (en) | Method and device for data processing | |
| CN104917659B (en) | A kind of mapping method of virtual network based on virtual network connection performance | |
| CN104935521B (en) | For realizing the Whole load equalizing method and server of mixed scheduling | |
| CN108989110A (en) | A kind of construction method and its relevant device of VPC network model | |
| CN106445473A (en) | Container deployment method and apparatus | |
| CN106100964A (en) | The method and apparatus that a kind of virtual network maps | |
| CN107979545A (en) | A kind of mapping method of virtual network based on nodal community | |
| CN108259372A (en) | A kind of multi-link load balance system and method | |
| Hsu et al. | Virtual network mapping algorithm in the cloud infrastructure | |
| CN106130926B (en) | A kind of processing method and processing device of message | |
| de Oliveira et al. | A tree‐based algorithm for virtual infrastructure allocation with joint virtual machine and network requirements | |
| CN110086724A (en) | Bandwidth adjusting method, device, electronic equipment and computer readable storage medium | |
| Chen et al. | Virtual network embedding with border matching | |
| Nguyen et al. | RT-VNE: A real-time strategy for Virtual Network Embedding towards resource efficiency | |
| CN105490959B (en) | Implementation method is embedded in based on the non-homogeneous bandwidth virtual data center that congestion is evaded | |
| CN104092678B (en) | A kind of configuration method and device of accesses control list |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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 |