CN109617811A - The quick migration method of mobile application in a kind of cloud network - Google Patents
The quick migration method of mobile application in a kind of cloud network Download PDFInfo
- Publication number
- CN109617811A CN109617811A CN201910084329.3A CN201910084329A CN109617811A CN 109617811 A CN109617811 A CN 109617811A CN 201910084329 A CN201910084329 A CN 201910084329A CN 109617811 A CN109617811 A CN 109617811A
- Authority
- CN
- China
- Prior art keywords
- migration
- path
- short
- migration path
- point
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/125—Shortest path evaluation based on throughput or bandwidth
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
- H04L41/5054—Automatic deployment of services triggered by the service manager, e.g. service implementation by automatic configuration of network components
-
- 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/56—Provisioning of proxy services
- H04L67/563—Data redirection of data network streams
Abstract
The invention discloses the quick migration methods in mobile application in a kind of cloud network, to improve the service quality of user, realize service seamless migration as primary and foremost purpose, farthest shorten the transit time of SFC, in addition the successful and reasonability to guarantee services migrating, the costs such as operation overhead and the resource consumption of migration are comprehensively considered, the method of the present invention is not only efficient, quick, and the synthesis optimality of migration scheme can be realized in conjunction with current network state.
Description
Technical field
The invention belongs to Data Transference Technology fields, and in particular to the fast transferring side of mobile application in a kind of cloud network
Method.
Background technique
With the rapid development of wireless communication technique and quick universal, the Information Mobile Service number of requests day of all kinds of mobile devices
Increase severely and add, more and more users are intended to whenever and wherever possible, flexibly can easily access their service request.Mobile network's function
The application of the virtualization of energy and mobile cloud computing further promotes this point, but in today of the unprecedented abruptly increase of mobile application, fortune
Battalion quotient must rethink the Managed Solution of Information Mobile Service, especially for long-distance and/or high-speed mobile user (such as vehicle and
Sub- bullet train).When the user is mobile, SFC needs to change service path in time according to the on-position of user's time-varying to guarantee
The continuation of service, this just to the SFC based on NFV can dynamic change and have adaptivity propose demand and challenge.
The basis of the virtualization and its execution on a virtual machine of service function has been established in network function virtualization.Any clothes
Business request can be indicated that SFC is one group suitable according to giving by service function chain (Service Function Chain, SFC)
The virtual network function (Virtualization Network Function, VNF) of sequence execution function.The operation of VNFs needs
The instantiation of VNF example (Virtualization Network Function Instance, VNFI), these examples are usually
The software module executed on VM.
Similar to mobile call, compared with most start to call is not turned on, people are more difficult to endure the unexpected of call
It interrupts.Service disruption can not only reduce user experience, make the disappointing complaint of user, may more seriously interrupt important file and pass
The important affairs such as defeated, service request, business meeting and cooperation transaction, and miss important moment of cooperation or cause huge economy
Loss.Therefore more and more users wish no matter when and where, mobile or static can quickly and easily access, continue him
Request.I.e. when the user is mobile, SFC needs to change service path in time according to the on-position of user's time-varying, adjusts again
The deployment strategy of whole SFC come guarantee service continuation, this just to the SFC based on NFV can dynamic change and have adaptivity
Propose demand and challenge.And the appearance of SFC migrating technology, it can solve this problem to a certain extent.Sorry
It is how to realize migration to be only focused on mostly to the research of SFC migration at present, and also all only rest on the research layer of static SFC
Face, and have ignored the basic goal of migration: fast quick-recovery online service avoids the unexpected interruption of service.When user is moved to original
When except the coverage of beginning access point server, to avoid ongoing service disruption, quickly the SFC of user should be carried out
Migration, service continuity when ensuring that user is mobile, realizes seamless services migrating (not interrupting ongoing service).
Occur having some algorithms about SFC migration at present, it is real for the load balancing of Treated Base network node
Migration of the row to VNF develops a kind of SFC dispositions method to respond continually changing workload, and VNFI is integrated into the greatest extent
On the server that may lack, to reduce energy consumption；This method only considered the offline migration of static SFC.And the static portion SFC
Management side case will use the path suboptimum between family and its VNFs, not only result in unnecessary bandwidth consumption, can also reduce user
Experience, without practical application value.In addition propose the migration strategy of VNFIs a kind of, the strategy consider transition process in due to
The information that occurs loses and gives the loss of user's bring in investment loss and transition process caused by QoS is reduced, and target is
Minimize as QoS degenerate and caused by energy consumption and revenue losses；This method VNFIs that only gives a trial lecture is moved to as far as possible
On few server, energy consumption is reduced, and does not account for the online mobile bring migration demand of user at all, in movement
The today being skyrocketed through is requested, this method has been unable to meet demand, therefore without too big research significance.Have scholar also proposed as
What carries out SFC deployment and adjustment in a dynamic environment, and user SFC is disposed with trading-off resources developing algorithm in the server again
Consumption and operational overhead optimize the deployment and the adjustment of heart user SFC in service of new user SFC jointly；Although this method
The mobile problem for considering online user, whenever having new user's access request or new user movement request, system is all
All SFC in all networks of meeting are disposed and are adjusted again, but regrettably this way is complicated to sacrifice the huge time
Degree is cost, is lost more than gain in practical application, and this method robustness is very poor, the network state when this moment is not enough to prop up
When supportting the access request of current time all new users with the migration request of user in service, entire algorithmic system will sink into paralysis
Paralysis.
Summary of the invention
For above-mentioned deficiency in the prior art, the quick migration method solution of mobile application in cloud network provided by the invention
Having determined in traditional moving method, bandwidth consumption is big, time-consuming and problem complicated for operation.
In order to achieve the above object of the invention, the technical solution adopted by the present invention are as follows: mobile application is fast in a kind of cloud network
A kind of fast moving method, comprising the following steps: the quick migration method of mobile application in cloud network, comprising the following steps:
The access state of user's request in S1, real time inspection cloud network；
S2, when user request access state in servicing function request SRmPosition when changing, obtain the service
Function requests SRmIn movement after source point smAnd the point of destination t after movementmOn-position；
S3, the bottom-layer network N in cloud networkGMiddle determining user requests the portion of the last one virtual network function VNF in SFC
Administration's pointWith the point of destination t after movementmBetween most short migration pathAnd enter step S4；
S4, the most short migration path of judgementIt is whether reachable；
If so, entering step S5；
If it is not, entering step S7；
S5, will most short migration pathIt is chosen to be servicing function request SRmCorresponding best migration path pathm
Composition subpath, enter step S6；
S6, most short migration path is calculatedCorresponding bandwidth consumption, and the balance parameters k of while being arranged m- bandwidth,
JudgementIt is whether true；
Wherein, bandwidth consumption includes most short migration pathThe bandwidth consumption of corresponding whole migration pathWith
Most short migration pathThe bandwidth consumption of corresponding end migration path
If so, entering step S8；
If it is not, then entering step S7；
S7, the bottom-layer network N in cloud networkGMiddle determining servicing function request SRmSource point s after middle movementmTo after movement
Point of destination tmMost short migration pathAnd enter step S9；
The selected composition subpath of S8, basisDetermine servicing function request SRmCorresponding best migration path
pathm, and enter step S13；
S9, the most short migration path of judgementIt is whether reachable；
If so, entering step S10；
If it is not, then entering step S11；
S10, most short migration path is determinedIn gross migration expenseMost short migration pathIn
Gross migration expenseJudgementIt is whether true；
If so, return step S8；
If it is not, then entering step S12；
User in S11, detection cloud network in service requests SFC, cancels overdue user and requests SFC, gives back physics
ResourceAnd return step S1；
S12, will most short migration pathAs servicing function request SRmCorresponding best migration path pathm, and
Enter step S13；
S13, according to determining best migration path pathmIt completes current service function and requests SRmMigration, realize movement
The fast transferring of application.
The invention has the benefit that
(1) migration is efficient, quick.It is proposed for the uncertainty and flexibility of user location movement, the method for the present invention
P1-MP migration scheme is able to achieve the quick online migration of SFC, first consideration user experience, minimizes transit time expense, realizes
The seamless connection of service request.
(2) network resource utilization is high.What the method for the present invention considered is Dynamical Deployment and the migration of online SFC, to not
The service request for the SFCs that timing reaches, there is respective online life span, when reaching this time, will be removed
Pin, while discharging and calculating occupied resource, it is used to continue subsequent SFCs altogether.
(3) migration success rate is high.The present invention proposes that the single-minded optimization of P2-MP migration scheme complementation P1-MP migration scheme is moved
The characteristics of shift time, has comprehensively considered the bearing capacity of physical network and the finiteness of resource, when P1-MP migration scheme can not be returned
When returning effective migration path or too big gained path bandwidth expense, for the successful for guaranteeing migration, P1-MP migration scheme will be
SFC finds reasonable, the minimum migration path of cost.
Detailed description of the invention
Fig. 1 is the quick migration method implementation flow chart of medium cloud Network Mobility of the present invention application.
Fig. 2 is that most short migration path is determined in the present inventionMethod implementation flow chart.
Fig. 3 is that most short migration path is determined in the present inventionMethod implementation flow chart.
When Fig. 4 is that user location changes in the present invention, two kinds of situation schematic diagrams requesting in service.
Specific embodiment
A specific embodiment of the invention is described below, in order to facilitate understanding by those skilled in the art this hair
It is bright, it should be apparent that the present invention is not limited to the ranges of specific embodiment, for those skilled in the art,
As long as various change is in the spirit and scope of the present invention that the attached claims limit and determine, these variations are aobvious and easy
See, all are using the innovation and creation of present inventive concept in the column of protection.
As shown in Figure 1, in a kind of cloud network mobile application quick migration method, comprising the following steps:
The access state of user's request in S1, real time inspection cloud network；
S2, when user request access state in servicing function request SRmPosition when changing, obtain the service
Function requests SRmIn movement after source point smAnd the point of destination t after movementmOn-position；
S3, the bottom-layer network N in cloud networkGMiddle determining user requests the portion of the last one virtual network function VNF in SFC
Administration's pointWith the point of destination t after movementmBetween most short migration pathAnd enter step S4；
S4, the most short migration path of judgementIt is whether reachable；
If so, entering step S5；
If it is not, entering step S7；
S5, will most short migration pathIt is chosen to be servicing function request SRmCorresponding best migration path pathm
Composition subpath, enter step S6；
S6, most short migration path is calculatedCorresponding bandwidth consumption, and the balance parameters k of while being arranged m- bandwidth,
JudgementIt is whether true；
Wherein, bandwidth consumption includes most short migration pathThe bandwidth consumption of corresponding whole migration pathWith
Most short migration pathThe bandwidth consumption of corresponding end migration path
If so, entering step S8；
If it is not, then entering step S7；
S7, the bottom-layer network N in cloud networkGMiddle determining servicing function request SRmSource point s after middle movementmTo after movement
Point of destination tmMost short migration pathAnd enter step S9；
The selected composition subpath of S8, basisDetermine servicing function request SRmCorresponding best migration path
pathm, and enter step S13；
S9, the most short migration path of judgementIt is whether reachable；
If so, entering step S10；
If it is not, then entering step S11；
S10, most short migration path is determinedIn gross migration expenseMost short migration pathIn
Gross migration expenseJudgementIt is whether true；
If so, return step S8；
If it is not, then entering step S12；
User in S11, detection cloud network in service requests SFC, cancels overdue user and requests SFC, gives back physics
ResourceAnd return step S1；
S12, will most short migration pathAs servicing function request SRmCorresponding best migration path pathm, and
Enter step S13；
S13, according to determining best migration path pathmIt completes current service function and requests SRmMigration, realize movement
The fast transferring of application.
User service requests SR=(SF,LF,RF, s, t) and indicate that a user requests (SFC), every SFC is by a series of tools
It is made of the virtual network function (VNF) of certain order of connection, each VNF represents a kind of network function (such as intrusion detection system
Unite IDS, firewall etc.)
Servicing function request SR in above-mentioned steps S2mFor SRm=(SF,LF,RF,sm,tm)；
Wherein, SFThe set of several virtual network functions VNF in SFC, and S are requested for a userF={ f1,
f2,...f|SF|, | SF | it is the quantity of virtual network function VNF；
LFTo connect the virtual link between two adjacent virtual network function VNF, and LF={ l1,l2,...l|LF|},|LF
| the number of links of SFC is requested for a user；
RFThe required total resources of SFC is requested for whole user；
smFor source point of the user after mobile；
tmFor point of destination of the user after mobile；
Bottom-layer network is made of various physical equipments (such as server and router) and connecting link (such as optical fiber), and respectively
There are corresponding Resource Properties, therefore we use non-directed graph NGIt indicates bottom-layer network (physical network), therefore the bottom in step S3
Layer network NGAre as follows:
NG={ VG,EG,RG}
Wherein, VGFor bottom-layer network NGIn node set；VG={ v1,v2,...v|VG|, | VG | it is bottom-layer network NGIn
Number of nodes；
EGFor VGFor bottom-layer network NGIn link set, EG={ E1,E2,...E|EG|, | EG | it is bottom-layer network NGIn
Number of links；
RGFor bottom-layer network NGThe total resources that can be provided.
For ease of description and understand, we set:
1, a physical node can dispose different types of VNF；
2, a VNF can only be deployed in the same physical node；
3, multiple VNFs in the same SFC are not for a physical node；
4, the VNFs of difference SFC allows to be deployed in same physical node in the enough situations of resource.
In the methods of the invention, it can be selected according to the service request and current network service condition of different user for SFC
Optimal migration path, first the method for the present invention can constantly check the access state of active user's request, judge whether there is new use
Family request accesses or position change occurs for user in service, if two kinds of situations occur simultaneously, in order to guarantee in service
User service continue, the preferential SFC for selecting fast transferring in service user, then dispose the request of new user, otherwise, then according to
The sequencing that request occurs is handled, therefore as the servicing function request SR in the access state of user's requestmPosition occurs
When setting variation, as shown in Fig. 2, step S3 specifically:
S31, servicing function request SR is obtainedmIn the last one virtual network function point flastPoint of destination after to movement
tmBandwidth demand
S32, traversal bottom-layer network NGIn each of the links, leave out bottom-layer network NGThe bandwidth of middle surplus resourcesIt is small
In bandwidth demandCorresponding link et, obtain bottom-layer network NGSubgraph NSG；
Wherein, et∈EG；NSG=NG-et, obtain NSGPurpose be reduce shortest path search space, save the time；
S33, in subgraph NSGMiddle determining user requests the deployment point of the last one virtual network function VNF in SFCWith
Point of destination t after movementmBetween most short migration path
Wherein, subgraph NSGIn each of the links all meet the last one virtual network function point flastPurpose after to movement
Point tmBandwidth demand
Above-mentioned steps S4 specifically:
Judge most short migration pathCorresponding gross migration expenseIt is whether true；
If so, most short migration pathIt is unreachable, enter step S7；
If it is not, then most short migration pathIt is reachable, enter step S5；
Wherein, gross migration expenseCalculation formula are as follows:
In formula,For most short migration pathCorresponding bandwidth consumption；
For most short migration pathCorresponding pathfinding time loss.
The bandwidth consumption of whole migration path in above-mentioned steps S6Calculation formula are as follows:
In formula,For servicing function request SRmBandwidth consumption before migration；
For servicing function request SRmThe bandwidth consumption of terminal end path before migration；
For will most short migration pathAs best migration path pathmService function is asked in transition process
Seek SRmBandwidth consumption.
As shown in figure 3, above-mentioned steps S7 specifically:
S71, traverse service function request SRmIn all virtual network function VNF, and judge virtual network function VNF
Set SFIn virtual network function point fiIt whether is intermediate function point；
Wherein, fi∈SF；
If so, entering step S72；
If it is not, then entering step S74；
S72, the current bottom-layer network N of traversalGIn each node, determine bottom-layer network NGIn node vmAnd its it is corresponding
Shortest path subpath, and enter step S73；
Wherein, vm∈VG, node vmFor bottom-layer network NGThe middle migration place point v arranged apart from upper onejRecently and meet
Virtual network function point fiResource requirement node；
S73, by node vmAs virtual network function point fiMigration place point, and by node vmAnd its corresponding shortest path
Diameter subpath is added to most short migration path as intermediate pathIn, obtain servicing function request SRmIt is corresponding most
Short migration pathEnter step S9；
S74, traversal bottom-layer network NGIn each node, determine by deployment pointShortest path subpath, and
Enter step S75；
Wherein, deployment pointMeet the last one virtual network function point flastResource requirement；
S75, by deployment pointAs the last one virtual network function point flastMigration place point, and by deployment pointAnd its corresponding shortest path subpath is added to most short migration path as intermediate pathIn, it is serviced
Function requests SRmCorresponding most short migration pathEnter step S9.
Best migration path path in above-mentioned steps S8mAre as follows:
In formula, pathbeforeTo carry out servicing function request SRmDeployment path before migration；
For servicing function request SRmThe deployment path of terminal end path before migration；
The deployment point of the last one virtual network function VNF in SFC is requested for userWith the mesh after movement
Point tmBetween migration path.
Above-mentioned steps S9 specifically:
Judge most short migration pathCorresponding gross migration expenseIt is whether true；
If so, most short migration pathIt is unreachable, enter step S11；
If it is not, then most short migration pathIt is reachable, enter step S10；
Wherein, gross migration expenseCalculation formula are as follows:
In formula,For most short migration pathCorresponding bandwidth consumption；
For most short migration pathCorresponding migration operation consumption；
For most short migration pathCorresponding pathfinding time loss；
For most short migration pathCorresponding time loss.
In above-mentioned steps S13, as servicing function request SRmBest migration path pathmFor most short migration pathWhen corresponding migration path, servicing function request SRmMoving method specifically:
A1, the best migration path path of traversalmWith sending servicing function request SRmPreceding deployment path pbeforeIn every chain
The deployment scenario on road；
Judge best migration path pathmWith sending servicing function request SRmPreceding deployment path pbeforeIn whether have phase
Same virtual link lnIt is corresponding with same link et；
Wherein, ln∈LF, et∈EG；
If so, entering step A2；
If it is not, then entering step A3；
A2, directly according to best migration path pathmDirectly carry out servicing function request SRmMigration；
It is not repeated to carry out release and the deduction of resource in the transition process；
A3, from bottom-layer network NGMiddle deduction pathmInCorresponding bandwidth resources, and discharge user and issue clothes
Function of being engaged in requests SRmBeforeOccupied bandwidth resources, then according to best migration path pathmDirectly taken
Function of being engaged in requests SRmMigration；
As servicing function request SRmBest migration path pathmFor most short migration pathWhen, service function is asked
Seek SRmMoving method specifically:
B1, the best migration path of traversalWith sending servicing function request SRmPreceding deployment path pbeforeIn it is every
The deployment scenario of a node and link judges best migration pathWith sending servicing function request SRmPreceding deployment road
Diameter pbeforeIn with the presence or absence of there is identical virtual network function point fiCorresponding identical node vmOr there is identical virtual link lnIt is right
There should be same link etThe case where；
If so, entering step B2；
If it is not, then entering step B3；
B2, directly according to best migration pathDirectly carry out servicing function request SRmMigration；
It is not repeated to carry out release and the deduction of resource in the transition process；
B3, from bottom-layer network NGMiddle deductionCorresponding node and bandwidth resourcesAnd discharge user's hair
Servicing function request SR outmPreceding pathbeforeOccupied node and its corresponding bandwidth resources, then according to best migration road
DiameterDirectly carry out servicing function request SRmMigration；
Wherein, bandwidth resourcesAre as follows:
In formula,For best migration path pathmFor most short migration pathWhen corresponding migration path, clothes
Function of being engaged in requests SRmThe bandwidth resources consumed when migration；
In above-mentioned steps S10；
The physical resource given backAre as follows:
In formula,For bottom-layer network NGIn remaining physical resource；
For there is no all users of migration to request the occupied physical resource of SFCs；
For as best migration path pathmFor most short migration pathWhen corresponding migration path, institute
There is user to request the occupied physical resource of SFCs；
For as best migration path pathmFor most short migration pathWhen corresponding migration path, institute
There is user to request the occupied physical resource of SFCs.
It, can be by two kinds of determining migration paths in the method for the present invention in order to preferably request user to carry out fast transferring
Method is divided into P1-MP migration scheme and P2-MP migration scheme, and P1-MP migration scheme is to determine most short migration path
And then determine best migration path pathmMethod, P2-MP migration scheme is to determine most short migration pathAnd then really
Fixed best migration path pathmMethod；
Wherein, P1-MP migration scheme is a kind of quick migration method, and purport is put in the first place in by user experience, utmostly
Shorten SR in groundmTransit time, realize quick, the efficient migration of SFC；P1-MP migration scheme is quickly embodied in the following:
1, at the beginning of pathfinding, P1-MP migration scheme is first to bottom-layer network NGIn remaining bandwidth resource judged, go
Except being unsatisfactory for flast→tmThe link e of bandwidth demandt, obtain subgraph NSG, the search space of pathfinding algorithm is reduced, is greatly saved and seeks
The road time；
2, the deployment point of P1-MP migration scheme direct search the last one VNF of SFCWith the point of destination t after movementmIt
Between migration path, without change SFC before deployment path；
3, the deployment for not needing to carry out VNF only needs to not have to the resource service condition for considering node during path-search
Consider that bandwidth resources constrain；
4, without the concern for the migration of VNF, thus the different releases for carrying out former deployment node resource and new migration node money
The deduction in source, it is only necessary to by flast→tmMove to new route, largely shorten transit time.
Do not change all deployment before the last one VNF of SFC due to P1-MP migration scheme, works as and search
flast→tmMigration pathWhen, whole SRmMigration path be also determined as therewithIt thus eliminates to whole SRmThe search of best migration path, former deployment
The release of path interior joint/bandwidth resources and new migration path interior joint/bandwidth resources deduction, and only need to consider last
Section virtual link flast→tmMigration.
What P1-MP migration scheme was more concerned about is to minimize SRmTransit time, when user location occurs mobile, P1-MP
Migration scheme only needs the access point of migrated users, and then is SRmIn sm→f1Or flast→tmFind nearest migration pathDeployed position without changing each VNF in SFC, therefore P1-MP migration scheme is suitable for user
The relatively high SFC of important service request or delay requirement；
For j-th strip SFC:
The migration overhead of P1-MP migration scheme are as follows:
In formula,WithThe respectively gross migration expense of P1-MP migration scheme, bandwidth consumption and pathfinding time disappear
Consumption.For bottom-layer network, since migration can't change SFC to the occupancy of node resource, in computation migration expense
When, we do not consider the expense of node resource.
The bandwidth consumption of P1-MP migration scheme are as follows:
Wherein,It is link etBandwidth consumption；
The pathfinding time overhead of P1-MP migration scheme are as follows:
The last one virtual network function in SFC is requested for user in P1-MP migration scheme
The deployment point of energy VNFWith the point of destination t after movementmBetween pathfinding time overhead；
The total resources of P1-MP migration scheme consume are as follows:
Wherein,For j-th strip SFC
In, it is in migration path in P1-MP migration scheme to have the occupied node resource of VNF more,For the node resource of a VNF fi
Occupancy.
P2-MP migration scheme carries out the determination of best migration path, P2- under the premise of P2-MP migration scheme is inaccessible
MP migration scheme considers SRmOverall condition, again according to the bottom-layer network N at current timeGMiddle resource service condition is SRm
The optimal migration path of resource is found, when the position of user, which occurs to increase, to be changed, if not by SRmBulk migration, it will
Lead to that SFC mapping path is too long, resource occupying is excessively high, and lengthen the transmission delay between source/mesh node, it is negative to increase network
Load.For this purpose, comprehensively considering SR while P2-MP migration scheme seeks to fill that user's movement demandmTo the occupancy feelings of underlying resource
Condition is SRmThe minimum transition path of comprehensive expense (including moving costs and transmission cost) is found, to guarantee that user location changes
Service afterwards can succession and reasonability, be mainly reflected in the following:
1, due to the limitation for resource of providing a loan, NGIn may not haveReachable path, need to call P2- this moment
MP migration scheme；
2, the balance parameters k of a time and bandwidth are provided in P1-MP migration scheme, if P1-MP migration scheme is fast
Quick-recovery must be to sacrifice more bandwidth as cost, it is contemplated that NGResource it is nervous, P2-MP migration scheme can be called；
3, the SFC after face degree position change, P2-MP migration scheme are according to current bottom-layer network NGService condition be SRm
The s re-searched form→tmShortest path, therefore underlying resource occupies minimum, SRmMigration path and current network state
With degree highest；
P2-MP migration scheme is complementary with P1-MP migration scheme, and P2-MP migration scheme has comprehensively considered the money of migration path
Source expense, migration operation expense, pathfinding time overhead, transit time expense are carried out whole SFC and are migrated.It is obvious that P2-MP
Migration scheme purport reduces while reducing service time delay as far as possible in the compromise for realizing QoS of customer and resource consumption
SRmTo the occupancy of Internet resources.Therefore, P2-MP migration scheme is more suitable for user to delay requirement less harshness and network
Resource and more nervous situation.
For j-th strip SFC:
The gross migration expense of P2-MP migration scheme are as follows:
In formula,
For most short migration pathCorresponding bandwidth consumption；
For most short migration pathCorresponding migration operation consumption；
For most short migration pathCorresponding pathfinding time loss；
For most short migration pathCorresponding transit time consumption.
The bandwidth demand of P2-MP migration scheme are as follows:
In formula,
The migration operation expense of P2-MP migration scheme are as follows:
Wherein, For the migration operation expense of single VNF；
The pathfinding time overhead of P2-MP migration scheme are as follows:
In formula,
WithRespectively P2-MP migration scheme is for SFCsm→tm, fi-1→fiPathfinding time overhead；
The transit time expense of P2-MP migration scheme are as follows:
In formula,
The total resources of P2-MP migration scheme consume:
In formula,
The relationship of P1-MP migration scheme and P2-MP migration scheme is shown below:
When system detection is mobile to user location, the method for the present invention can pay the utmost attention to P1-MP migration scheme, only when
P1-MP migration scheme can not find active path or migration overheadWhen, P2-MP migration scheme is just enabled, and it is right
In P1-MP migration scheme: it is not related to the migration of VNF, itIt is zero；But for P2-MP migration scheme:And whole link sm→tmPathfinding time overhead be centainly greater than sm→f1Or flast→tmSeek
Road time overhead；The bandwidth consumption of apparent P2-MP migration scheme is centainly less than P1-MP migration scheme, this is because for dynamic
The Internet resources of state variation, it is SR that P2-MP migration scheme, which is according to the behaviour in service of current time network,mThe most short migration found
Path.
In one embodiment of the invention, it additionally provides using the method for the present invention to SRmWhen being migrated, bottom-layer network
Occupy the calculation method of resource；
For bottom-layer network, a certain moment, there may be the SFC that user is planted in 3, that is, were respectively that position shifting does not occur
When dynamic, the service request of migration is carried out with P1-MP migration scheme and with P2-MP migration scheme, they are to physical network resource
It occupies are as follows:
In formula,Be respectively SFC do not occur migration,
Use p1- MP migration scheme uses p2The resource consumption of-MP migration scheme；Unm,Up1,Up2,UmIt is not migrate, make respectively
Use p1- MP migration scheme uses p2- MP migration scheme, the user's number of requests migrated；
Total node resource consumption in bottom-layer network are as follows:
In formula,Migration does not occur for respectively SFC, using p1- MP migration scheme uses p2- MP is moved
The node resource demand of shifting scheme；
Total resources link consumes in bottom-layer network are as follows:
In formula,Migration does not occur for respectively SFC, using p1- MP migration scheme uses p2The migration side-MP
The bandwidth resources demand of case.
In one embodiment of the invention, additionally provide optimization aim when being migrated using the method for the present invention and its
Constraint condition:
Wherein, optimization aim (to the overhead of all request migrations) are as follows:
The total resources constraint condition of optimization aim are as follows:
In formula,For binary number, indicate service request SR whether in bottom-layer network deployment success
The node resource of optimization aim constrains are as follows:
Wherein,
One VNF point can only be deployed on a physical node；I.e.Same
During the deployment of SFC request, the function that a physical points n can only at most be disposed on a service function chain (avoids ring
Appearance), and used the server for deployment node (forward node) that the forward node of same SFC cannot be re-used as
(deployment node), i.e.,
In one embodiment of the invention, it provides the example for calculating the fast transferring of cloud network mobile application: counting
Calculate cloud network in, the mobility and uncertainty of mobile subscriber may cause network performance and be remarkably decreased, in addition interrupt into
Capable service request, therefore, it is difficult to guarantee the continuity of service.And services migrating has very big dive in terms of solving these problems
Power, it determine user migration and changes in demand after when, where, which kind of method migrate these services.In face of servicing
The mobile service request of middle user, two kinds of solutions of P1-MP migration scheme and P2-MP migration scheme, it is intended to pay the utmost attention to take
The minimum of business migration time delay, is improved QoS of customer (QoS), prevents the interruption serviced in carrying out, meanwhile, it can be connect in user
In the time delay range received, comprehensively considers the operation overhead of SFC migration and the reasonable utilization of bottom-layer network resource, realize SFC jointly
The high efficiency of migration, reasonability, practicability and optimality.As shown in figure 4, the service request SFC1 of 3 users is illustrated,
SFC2, SFC3.
Initial, the access point of their source mesh node is access point 2 respectivelyAccess point 3, access point 7Access point
4, access point 1Access point 4；Corresponding deployment path is 2 → server of access point3 → access point of server 3, access
7 → server of point5 → server of server, 4 → access point 4, access point 1 → server, 1 → server3 → server of server, 4 → access point 4；Later, the user location of SFC2 and SFC3 moves that (SFC1 does not have
Have change), the access point of SFC2 source point s2 becomes access point 2, and the access point of SFC3 point of destination t3 becomes access point 6, empty on the way
After line indicates that user is mobile, the variation of access point is requested, therefore, the deployment path needs of corresponding SR change.
The online mobile problem such in face of user, for fast quick-recovery user service, we take P1-MP to migrate first
Scheme is that ongoing SFC finds migration path, and P1-MP migration scheme do not change the original deployment point of VNF, only new in SFC
Shortest path is found between access point and the set-point of its nearest VNF through as SRmThe migration path of subpath, to shorten SRm's
The pathfinding time.Certainly, target migration path must satisfy bandwidth resources constraint with it is current corresponding when m- bandwidth balance join
Number k requirement.Such as SFC2, access point has changed to access point 2 from access point 7, and P1-MP migration scheme is only by access point 7 → service
Mapping subpath between device 7 is changed to access pointServer 7 (server 2 is herein only as forwarding point), and do not have
Have to carry out VNF and migrate, from without VNF migration operation expense and transit time expense, greatly reduces the service recovery time；
When P1-MP migration scheme can not return to effective migration path or need a large amount of bandwidth resources as cost,
We employ P2-MP migration scheme.Complementary with P1-MP migration scheme, P2-MP migration scheme has comprehensively considered transit time and has opened
Pin, operation overhead, bandwidth resources expense overall cost are SRmFind optimal migration path.Such as SFC3, access point is from access
Point 4 has changed to access point 6, due to the limitation of network topology and resource, p2- MP will be whole SRmAgain migration path is found.This
It carving, SFC3 will migrate into path 6 → access point of access point 1 → server, 1 → server, 2 → server, 7 → server 6, wherein
The deployment point of VNF4 and VNF6 is migrated, and can bring certain transit time consumption and operation overhead thus, but migrate
New route be current time network matching SRmShortest path, occupy bandwidth resources it is minimum.Conversely, if this moment we
P1-MP migration scheme is still used, then will cause a large amount of resource consumption between 4 → server of server, 6 path.
In one embodiment of the invention, the implementation management side of the fast transferring of mobile application in cloud network is provided
Method: the quick migration method in mobile cloud computing proposed by the invention can be deployed in the control routing of SDN by network operator
On control layer in device, SDN control router can dispatch the control management function itself having and collect entire bottom-layer network
Information, obtain network in all nodes and link circuit resource the case where and node between connection topology situation.Pass through this
The control mode of the kind centralization router can obtain the topological and corresponding resource information of the whole network.When having in service
User location when changing, the present invention first quickly moves the SFC implementation that source mesh node changes using P1-MP migration scheme
It moves, improves the service quality of user, to guarantee the fund profit income of operator.Meanwhile P2-MP migration scheme considers bottom
The particular condition in use of layer network resource comprehensively considers the migration overhead of service, network resource consumption and transit time expense,
The minimum optimal path of cost is found in the receptible range of user.
The invention has the benefit that
(1) migration is efficient, quick.It is proposed for the uncertainty and flexibility of user location movement, the method for the present invention
P1-MP migration scheme is able to achieve the quick online migration of SFC, first consideration user experience, minimizes transit time expense, realizes
The seamless connection of service request.
(2) network resource utilization is high.What the method for the present invention considered is Dynamical Deployment and the migration of online SFC, to not
The service request for the SFCs that timing reaches, there is respective online life span, when reaching this time, will be removed
Pin, while discharging and calculating occupied resource, it is used to continue subsequent SFCs altogether.
(3) migration success rate is high.The complementary P1-MP migration scheme single-minded optimization of P2-MP migration scheme migrates in the present invention
The characteristics of time, has comprehensively considered the bearing capacity of physical network and the finiteness of resource, when P1-MP migration scheme can not return
When effective migration path or too big gained path bandwidth expense, for the successful for guaranteeing migration, P1-MP migration scheme will be
SFC finds reasonable, the minimum migration path of cost.
Claims (10)
1. the quick migration method of mobile application in a kind of cloud network, which comprises the following steps:
The access state of user's request in S1, real time inspection cloud network；
S2, when user request access state in servicing function request SRmPosition when changing, obtain the service function
Request SRmIn movement after source point smAnd the point of destination t after movementmOn-position；
S3, the bottom-layer network N in cloud networkGMiddle determining user requests the deployment point of the last one virtual network function VNF in SFC
Vi flastWith the point of destination t after movementmBetween most short migration pathAnd enter step S4；
S4, the most short migration path of judgementIt is whether reachable；
If so, entering step S5；
If it is not, entering step S7；
S5, will most short migration pathIt is chosen to be servicing function request SRmCorresponding best migration path pathmGroup
At subpath, S6 is entered step；
S6, most short migration path is calculatedCorresponding bandwidth consumption, and the balance parameters k of while being arranged m- bandwidth, judgementIt is whether true；
Wherein, bandwidth consumption includes most short migration pathThe bandwidth consumption of corresponding whole migration pathIt is most short
Migration pathThe bandwidth consumption of corresponding end migration path
If so, entering step S8；
If it is not, then entering step S7；
S7, the bottom-layer network N in cloud networkGMiddle determining servicing function request SRmSource point s after middle movementmPurpose after to movement
Point tmMost short migration pathAnd enter step S9；
The selected composition subpath of S8, basisDetermine servicing function request SRmCorresponding best migration path pathm,
And enter step S13；
S9, the most short migration path of judgementIt is whether reachable；
If so, entering step S10；
If it is not, then entering step S11；
S10, most short migration path is determinedIn gross migration expenseMost short migration pathIn it is total
Migration overheadJudgementIt is whether true；
If so, return step S8；
If it is not, then entering step S12；
User in S11, detection cloud network in service requests SFC, cancels overdue user and requests SFC, gives back physical resourceAnd return step S1；
S12, will most short migration pathAs servicing function request SRmCorresponding best migration path pathm, and enter
Step S13；
S13, according to determining best migration path pathmIt completes current service function and requests SRmMigration, realize mobile application
Fast transferring.
2. the quick migration method of mobile application in cloud network according to claim 1, which is characterized in that the step S2
Middle servicing function request SRmFor SRm=(SF,LF,RF,sm,tm)；
Wherein, SFThe set of several virtual network functions VNF in SFC, and S are requested for a userF={ f1,f2,
...f|SF|, | SF | it is the quantity of virtual network function VNF；
LFTo connect the virtual link between two adjacent virtual network function VNF, and LF={ l1,l2,...l|LF|, | LF | be
One user requests the number of links of SFC；
RFThe required total resources of SFC is requested for whole user；
smFor source point of the user after mobile；
tmFor point of destination of the user after mobile；
Bottom-layer network N in the step S3GAre as follows:
NG={ VG,EG,RG}
Wherein, VGFor bottom-layer network NGIn node set；VG={ v1,v2,...v|VG|, | VG | it is bottom-layer network NGIn node
Number；
EGFor VGFor bottom-layer network NGIn link set, EG={ E1,E2,...E|EG|, | EG | it is bottom-layer network NGIn link
Number；
RGFor bottom-layer network NGThe total resources that can be provided.
3. the quick migration method of mobile application in cloud network according to claim 2, which is characterized in that the step S3
Specifically:
S31, servicing function request SR is obtainedmIn the last one virtual network function point flastPoint of destination t after to movementm's
Bandwidth demand
S32, traversal bottom-layer network NGIn each of the links, leave out bottom-layer network NGThe bandwidth of middle surplus resourcesLess than band
Wide demandCorresponding link et, obtain bottom-layer network NGSubgraph NSG；
Wherein, et∈EG；
S33, in subgraph NSGMiddle determining user requests the deployment point V of the last one virtual network function VNF in SFCi flastWith movement
Point of destination t afterwardsmBetween most short migration path
4. the quick migration method of mobile application in cloud network according to claim 2, which is characterized in that the step S4
Specifically:
Judge most short migration pathCorresponding gross migration expenseIt is whether true；
If so, most short migration pathIt is unreachable, enter step S7；
If it is not, then most short migration pathIt is reachable, enter step S5；
Wherein, gross migration expenseCalculation formula are as follows:
In formula,For most short migration pathCorresponding bandwidth consumption；
For most short migration pathCorresponding pathfinding time loss.
5. the quick migration method of mobile application in cloud network according to claim 2, which is characterized in that the step S6
In whole migration path bandwidth consumptionCalculation formula are as follows:
In formula,For servicing function request SRmBandwidth consumption before migration；
For servicing function request SRmThe bandwidth consumption of terminal end path before migration；
For will most short migration pathAs best migration path pathmServicing function request SR in transition processm
Bandwidth consumption.
6. the quick migration method of mobile application in cloud network according to claim 2, which is characterized in that the step S7
Specifically:
S71, traverse service function request SRmIn all virtual network function VNF, and judge the set of virtual network function VNF
SFIn virtual network function point fiIt whether is intermediate function point；
Wherein, fi∈SF；
If so, entering step S72；
If it is not, then entering step S74；
S72, the current bottom-layer network N of traversalGIn each node, determine bottom-layer network NGIn node vmAnd its it is corresponding most short
Path subpath, and enter step S73；
Wherein, vm∈VG, node vmFor bottom-layer network NGThe middle migration place point v arranged apart from upper onejRecently and meet virtual
Network function point fiResource requirement node；
S73, by node vmAs virtual network function point fiMigration place point, and by node vmAnd its corresponding shortest path
Subpath is added to most short migration path as intermediate pathIn, obtain servicing function request SRmIt is corresponding most short
Migration pathEnter step S9；
S74, traversal bottom-layer network NGIn each node, determine by deployment point Vi flastShortest path subpath, and enter
Step S75；
Wherein, deployment point Vi flastMeet the last one virtual network function point flastResource requirement；
S75, by deployment point Vi flastAs the last one virtual network function point flastMigration place point, and by deployment point Vi flast
And its corresponding shortest path subpath is added to most short migration path as intermediate pathIn, obtain service function
Request SRmCorresponding most short migration pathEnter step S9.
7. the quick migration method of mobile application in cloud network according to claim 2, which is characterized in that the step S8
In best migration path pathmAre as follows:
In formula, pathbeforeTo carry out servicing function request SRmDeployment path before migration；
For servicing function request SRmThe deployment path of terminal end path before migration；
The deployment point V of the last one virtual network function VNF in SFC is requested for useri flastWith the point of destination after movement
tmBetween migration path.
8. the quick migration method of mobile application in cloud network according to claim 1, which is characterized in that the step S9
Specifically:
Judge most short migration pathCorresponding gross migration expenseIt is whether true；
If so, most short migration pathIt is unreachable, enter step S11；
If it is not, then most short migration pathIt is reachable, enter step S10；
Wherein, gross migration expenseCalculation formula are as follows:
In formula,For most short migration pathCorresponding bandwidth consumption；
For most short migration pathCorresponding migration operation consumption；
For most short migration pathCorresponding pathfinding time loss；
For most short migration pathCorresponding transit time consumption.
9. the quick migration method of mobile application in cloud network according to claim 2, which is characterized in that the step
In S13, as servicing function request SRmBest migration path pathmFor most short migration pathCorresponding migration path
When, servicing function request SRmMoving method specifically:
A1, the best migration path path of traversalmWith sending servicing function request SRmPreceding deployment path pbeforeMiddle each of the links
Deployment scenario；
Judge best migration path pathmWith sending servicing function request SRmPreceding deployment path pbeforeIn whether have it is identical
Virtual link lnIt is corresponding with same link et；
Wherein, ln∈LF, et∈EG；
If so, entering step A2；
If it is not, then entering step A3；
A2, directly according to best migration path pathmDirectly carry out servicing function request SRmMigration；
A3, from bottom-layer network NGMiddle deduction pathmInCorresponding bandwidth resources, and discharge user and issue service function
Request SRmBeforeOccupied bandwidth resources, then according to best migration path pathmService function is directly carried out to ask
Seek SRmMigration；
As servicing function request SRmBest migration path pathmFor most short migration pathWhen, servicing function request
SRmMoving method specifically:
B1, the best migration path of traversalWith sending servicing function request SRmPreceding deployment path pbeforeIn each node
With the deployment scenario of link, best migration path is judgedWith sending servicing function request SRmPreceding deployment path
pbeforeIn with the presence or absence of there is identical virtual network function point fiCorresponding identical node vmOr there is identical virtual link lnIt is corresponding
There is same link etThe case where；
If so, entering step B2；
If it is not, then entering step B3；
B2, directly according to best migration pathDirectly carry out servicing function request SRmMigration；
B3, from bottom-layer network NGMiddle deductionCorresponding node and bandwidth resources, and discharge user and issue service function
Request SRmPreceding pathbeforeOccupied node and its corresponding bandwidth resources, then according to good migration pathDirectly
Carry out servicing function request SRmMigration.
10. the quick migration method of mobile application in cloud network according to claim 2, which is characterized in that the step
The physical resource given back in S11Are as follows:
In formula,For bottom-layer network NGIn remaining physical resource；
For there is no all users of migration to request the occupied physical resource of SFCs；
For as best migration path pathmFor most short migration pathWhen corresponding migration path, institute is useful
Request the occupied physical resource of SFCs in family；
For as best migration path pathmFor most short migration pathWhen corresponding migration path, institute is useful
Request the occupied physical resource of SFCs in family.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910084329.3A CN109617811B (en) | 2019-01-29 | 2019-01-29 | Rapid migration method for mobile application in cloud network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910084329.3A CN109617811B (en) | 2019-01-29 | 2019-01-29 | Rapid migration method for mobile application in cloud network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109617811A true CN109617811A (en) | 2019-04-12 |
| CN109617811B CN109617811B (en) | 2020-06-30 |
Family
ID=66020983
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910084329.3A Expired - Fee Related CN109617811B (en) | 2019-01-29 | 2019-01-29 | Rapid migration method for mobile application in cloud network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109617811B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112737854A (en) * | 2020-12-30 | 2021-04-30 | 国网河南省电力公司信息通信公司 | Service chain migration method and device based on energy consumption and service quality |
| CN113038520A (en) * | 2021-03-31 | 2021-06-25 | 广东电网有限责任公司电力调度控制中心 | Topology-aware virtual network service fault recovery method and system |
| CN113163018A (en) * | 2021-01-15 | 2021-07-23 | 郑州轻工业大学 | Virtual network online migration method and device with time delay, resource and energy consumption perception |
| CN114124796A (en) * | 2021-10-26 | 2022-03-01 | 清华大学 | Service chain deployment processing method and device, computer storage medium and terminal |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107332913A (en) * | 2017-07-04 | 2017-11-07 | 电子科技大学 | A kind of Optimization deployment method of service function chain in 5G mobile networks |
| CN107562510A (en) * | 2016-06-30 | 2018-01-09 | 华为技术有限公司 | The management method and management equipment of a kind of application example |
| CN108076156A (en) * | 2017-12-27 | 2018-05-25 | 北京航空航天大学 | A kind of mixing cloud system based on Chinese cloud product |
| CN109104313A (en) * | 2018-08-20 | 2018-12-28 | 电子科技大学 | A kind of SFC dynamic deployment method with flow consciousness with energy perception |
| CN109117321A (en) * | 2018-07-27 | 2019-01-01 | 山东师范大学 | A kind of full link application moving method of cloud platform based on label figure |
| CN109257399A (en) * | 2017-07-13 | 2019-01-22 | 上海擎感智能科技有限公司 | Cloud platform application management method and management platform, storage medium |
-
2019
- 2019-01-29 CN CN201910084329.3A patent/CN109617811B/en not_active Expired - Fee Related
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107562510A (en) * | 2016-06-30 | 2018-01-09 | 华为技术有限公司 | The management method and management equipment of a kind of application example |
| CN107332913A (en) * | 2017-07-04 | 2017-11-07 | 电子科技大学 | A kind of Optimization deployment method of service function chain in 5G mobile networks |
| CN109257399A (en) * | 2017-07-13 | 2019-01-22 | 上海擎感智能科技有限公司 | Cloud platform application management method and management platform, storage medium |
| CN108076156A (en) * | 2017-12-27 | 2018-05-25 | 北京航空航天大学 | A kind of mixing cloud system based on Chinese cloud product |
| CN109117321A (en) * | 2018-07-27 | 2019-01-01 | 山东师范大学 | A kind of full link application moving method of cloud platform based on label figure |
| CN109104313A (en) * | 2018-08-20 | 2018-12-28 | 电子科技大学 | A kind of SFC dynamic deployment method with flow consciousness with energy perception |
Non-Patent Citations (2)
| Title |
|---|
| UTTAM MANDAL: "Bandwidth Provisioning for Virtual Machine", 《IEEE TRANSACTIONS ON CLOUD COMPUTING》 * |
| 卢占翔: "自组织网络环境下基于遗传蚁群算法的计算迁移技术研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112737854A (en) * | 2020-12-30 | 2021-04-30 | 国网河南省电力公司信息通信公司 | Service chain migration method and device based on energy consumption and service quality |
| CN113163018A (en) * | 2021-01-15 | 2021-07-23 | 郑州轻工业大学 | Virtual network online migration method and device with time delay, resource and energy consumption perception |
| CN113038520A (en) * | 2021-03-31 | 2021-06-25 | 广东电网有限责任公司电力调度控制中心 | Topology-aware virtual network service fault recovery method and system |
| CN114124796A (en) * | 2021-10-26 | 2022-03-01 | 清华大学 | Service chain deployment processing method and device, computer storage medium and terminal |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109617811B (en) | 2020-06-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109617811A (en) | The quick migration method of mobile application in a kind of cloud network | |
| WO2022021176A1 (en) | Cloud-edge collaborative network resource smooth migration and restructuring method and system | |
| CN107332913B (en) | Optimized deployment method of service function chain in 5G mobile network | |
| CN106789648B (en) | Software defined network route decision method based on content storage and Network status | |
| CN107666412B (en) | The virtual network function dispositions method of service function chain | |
| CN110557732B (en) | Vehicle edge computing network task unloading load balancing system and balancing method | |
| CN102710489B (en) | Dynamic shunt dispatching patcher and method | |
| CN108173761A (en) | A kind of method for optimizing resources of SDN and NFV fusions | |
| CN109981438A (en) | A kind of satellite network load-balancing method towards SDN and NFV cooperation deployment frame | |
| CN108156041B (en) | Differentiated virtual optical network mapping method based on security perception | |
| CN107147530B (en) | Virtual network reconfiguration method based on resource conservation | |
| CN106789329B (en) | A kind of distributed multilayer satellite interruption tolerant network contact plan design method | |
| CN103475566A (en) | Real-time message exchange platform and distributed cluster establishment method | |
| Qu et al. | Traffic engineering for service-oriented 5G networks with SDN-NFV integration | |
| CN104917659B (en) | A kind of mapping method of virtual network based on virtual network connection performance | |
| CN104539744B (en) | A kind of the media edge cloud dispatching method and device of two benches cooperation | |
| CN108600103A (en) | The ant group algorithm of more QoS route restrictions of oriented multilayer grade network | |
| Wang et al. | Designing efficient high performance server-centric data center network architecture | |
| CN108449269A (en) | Data center network load-balancing method based on SDN | |
| CN109067920A (en) | A kind of load balancing and method for routing for server content update | |
| CN104767778A (en) | Task processing method and device | |
| Key et al. | Distributed dynamic routing schemes | |
| Ouamri et al. | Load balancing optimization in software-defined wide area networking (SD-WAN) using deep reinforcement learning | |
| Nguyen et al. | Efficient virtual network embedding with node ranking and intelligent link mapping | |
| CN110535705A (en) | A kind of service function chain building method of adaptive user delay requirement |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200630 Termination date: 20210129 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |