Movatterモバイル変換


[0]ホーム

URL:


CN106411768A - Service chain resource scheduling method and apparatus - Google Patents

Service chain resource scheduling method and apparatus
Download PDF

Info

Publication number
CN106411768A
CN106411768ACN201510462802.9ACN201510462802ACN106411768ACN 106411768 ACN106411768 ACN 106411768ACN 201510462802 ACN201510462802 ACN 201510462802ACN 106411768 ACN106411768 ACN 106411768A
Authority
CN
China
Prior art keywords
path
feasible
network element
users
virtual machine
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201510462802.9A
Other languages
Chinese (zh)
Other versions
CN106411768B (en
Inventor
罗雨佳
欧亮
唐宏
王勇
刘汉江
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Telecom Corp Ltd
Original Assignee
China Telecom Corp Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Telecom Corp LtdfiledCriticalChina Telecom Corp Ltd
Priority to CN201510462802.9ApriorityCriticalpatent/CN106411768B/en
Publication of CN106411768ApublicationCriticalpatent/CN106411768A/en
Application grantedgrantedCritical
Publication of CN106411768BpublicationCriticalpatent/CN106411768B/en
Activelegal-statusCriticalCurrent
Anticipated expirationlegal-statusCritical

Links

Classifications

Landscapes

Abstract

The invention discloses a service chain resource scheduling method and apparatus. The method includes: obtaining service chain demand information of a user, wherein the service chain demand information comprises demand function network elements and a passing sequence of the demand function network elements; determining all feasible paths according to the passing sequence of the demand function network elements; obtaining the path lengths of all the feasible paths and the number of path reception users; and selecting a service chain path of the user from all the feasible paths according to the path lengths of all the feasible paths and the number of the path reception users. According to the method and apparatus, multi-resource optimization is considered, optimization usage of three resources referring to a virtual machine CPU, a virtual machine memory and a link bandwidth between servers is performed, load balance is performed from the perspective of the whole path, and a better service chain path selection is realized.

Description

Business chain resource regulating method and device
Technical field
The present invention relates to data communication field, particularly to a kind of business chain resource regulating method andDevice.
Background technology
Business chain is NFV (Network Function Virtualization, network function virtualizes)One hot spot application scene of technology.Current operation chain networking mode more flexibly has string shape, starShape and mixed type.Because business chain deployment and topology have strong correlation, different networking modes willLead to different business chain deployment way.Business chain scheduling of resource is related to several factors:It is function networkUnit is preset in advance or triggers configuration by client temporarily;When multiple equipment runs same functional network element,Should be selected which device service user etc..
Current business chain resource scheduling algorithm has Round Robin (poll), Least Load(minimum load) and Random (random), totally fairly simple, resource is used not abundant,Especially, path can be led to turn back problem under string shape networking mode, cause link band between serverThe wide wasting of resources.
Content of the invention
In view of above technical problem, the invention provides a kind of business chain resource regulating method and dressPut it is achieved that the optimized choice in business chain path.
According to an aspect of the present invention, a kind of business chain resource regulating method is provided, including:
Obtain the business chain demand information of user, wherein, business chain demand information includes demand work(Can network element and appellative function network element by order;
According to demand functional network element by order determine all feasible paths;
Obtain path and the path reception number of users of all feasible paths;
Path according to all feasible paths and path reception number of users, from all feasibleThe business chain path of user is selected in path.
In one embodiment of the invention, in the step of the business chain demand information obtaining userAfterwards, methods described also includes:
Judge on current business chain, whether the corresponding resource of appellative function network element is enough;
If the corresponding resource of appellative function network element enough, executes according to demand on current business chainThe step that all feasible paths are determined by order of functional network element;
If the corresponding inadequate resource of appellative function network element on current business chain, open new virtualMachine simultaneously installs new appellative function network element, execute afterwards functional network element according to demand by orderThe step determining all feasible paths.
In one embodiment of the invention, the path according to all feasible paths and roadNumber of users is received in footpath, selects the step in the business chain path of user to include from all feasible paths:
According to the path of all feasible paths, judge to whether there is not in all feasible pathsTurn back path;
If there is path of not turning back in all feasible paths, in the path that selects not turn back, path connectsTreat the most path of number of users as the business chain path of user.
In one embodiment of the invention, the path according to all feasible paths and roadNumber of users is received in footpath, selects the step in the business chain path of user also to wrap from all feasible pathsInclude:
If there is not path of not turning back in all feasible paths, feasible path is corrected withDetermine the business chain path of user.
In one embodiment of the invention, feasible path is corrected to determine the industry of userThe step in business chain path includes:
By all feasible paths, it is ranked up constituting according to path order from short to longOne sequence;
For path identical feasible path in First ray, receive number of users according to pathOrder sequence from more to less, First ray sequence is become the second sequence;
According to the order of the second sequence, by way of newly-increased virtual machine, feasible path is carried outPath correction, path correction of turning back is path of not turning back;
If the path correction success to a feasible path, stop later path is entangledJust, and select to be repaired path as business chain path;
If all failing to the path correction of all feasible paths, by first in the second sequenceBusiness chain path as user.
In one embodiment of the invention, by way of newly-increased virtual machine, to feasible pathCarry out path correction, path correction of turning back is that the do not turn back step in path includes:
Determine the server of newly-increased virtual machine, wherein, the determination process of described server meets twoIndividual constraints:Newly-increased virtual machine number is minimum;In the server that can increase virtual machine newly,Select the minimum server of current virtual machine number;
Described server increases virtual machine newly, so that path correction of turning back is path of not turning back.
In one embodiment of the invention, obtain the path reception number of users of all feasible pathsStep include:
According to the average consumption to virtual machine CPU and memory source for the user, and each is virtualMachine CPU and the surplus yield of internal memory, obtain each virtual machine CPU reception number of users andInternal memory receives number of users;
CPU is received with number of users and internal memory reception number of users is minimized, obtain each virtual machineReception number of users;
The reception number of users of the virtual machine being related in each feasible path is minimized, obtaining shouldThe path reception number of users of feasible path.
In one embodiment of the invention, methods described also includes:
Judge whether to preset virtual functions network element on serial networking equipment;
If presetting virtual functions network element on serial networking equipment, execution obtains the business of userThe step of chain demand information;
If preset virtual functions network element be there is no on serial networking equipment, according to each virtual functionsThe demand accounting of network element order from high to low, on different server, placement one is virtual successivelyFunctional network element, the step that execution obtains the business chain demand information of user afterwards.
According to a further aspect in the invention, provide a kind of business chain resource scheduling device, including demandAcquisition module, path primary election module, parameter acquisition module and path determination module, wherein:
Requirement Acquisition module, for obtaining the business chain demand information of user, described business chain needsAsk information include appellative function network element and described appellative function network element by order;
Path primary election module, is determined all feasible for functional network element according to demand by orderPath;
Parameter acquisition module, for obtaining path and the path reception of all feasible pathsNumber of users;
Path determination module, for the path according to all feasible paths and path receptionNumber of users, selects the business chain path of user from all feasible paths.
In one embodiment of the invention, described device also includes resource inspection module and resourceNewly-increased module, wherein:
Resource checks module, for judging the corresponding resource of appellative function network element on current business chainWhether enough;And when on current business chain, the corresponding resource of appellative function network element is enough, instructionPath primary election module execution according to demand functional network element by order determine all feasible pathsOperation;
Resource increases module newly, for checking the judged result of module according to resource, in current businessOn chain during the corresponding inadequate resource of appellative function network element, open new virtual machine and new need are installedSeek functional network element, afterwards instruction path primary election module execution according to demand functional network element by suitableSequence determines the operation of all feasible paths.
In one embodiment of the invention, path determination module includes identifying submodule and pathSelect submodule, wherein:
Identification submodule, for the path according to all feasible paths, judges all feasibleWhether there is path of not turning back in path;
Path selection submodule, for the judged result according to identification submodule, all feasibleExist in path when not turning back path, in the path that selects not turn back, path reception number of users is mostPath is as the business chain path of user.
In one embodiment of the invention, path determination module also includes path correction submodule,Wherein:
Path correction submodule, for the judged result according to identification submodule, all feasibleDo not exist in path when not turning back path, feasible path is corrected to determine the business of userChain path.
In one embodiment of the invention, path correction submodule include the first sequencing unit,Second sequencing unit, path correction unit and path determining unit, wherein:
First sequencing unit, for by all feasible paths, according to path from short to longOrder is ranked up constituting First ray;
Second sequencing unit, for for path identical feasible path in First ray,Receive number of users order sequence from more to less according to path, First ray sequence is become secondSequence;
Path correction unit, for the order according to the second sequence, by the side of newly-increased virtual machineFormula, carries out path correction to feasible path, and path correction of turning back is path of not turning back;
Path determining unit, for the path correction to a feasible path in path correction unitWhen successful, stop the correction to later path, and select to be repaired path as business chainPath;And when path correction unit all fails to the path correction of all feasible paths, willIn second sequence first is as the business chain path of user.
In one embodiment of the invention, path correction unit include position determination subelement andPath correction subelement, wherein:
Position determination subelement, for determining the server of newly-increased virtual machine, wherein, described clothesThe determination process of business device meets two constraintss:Newly-increased virtual machine number is minimum;CanIn the server of newly-increased virtual machine, select the minimum server of current virtual machine number;
Path correction subelement, for void newly-increased on the server that position determination subelement determinesPlan machine, so that path correction of turning back is path of not turning back.
In one embodiment of the invention, parameter acquisition module is obtaining all feasible pathsDuring the reception number of users of path, for averagely the disappearing to virtual machine CPU and memory source according to userConsumption, and the surplus yield of each virtual machine CPU and internal memory, obtain each virtual machineCPU reception number of users and internal memory reception number of users;CPU is received with number of users and internal memory receptionNumber of users is minimized, and obtains the reception number of users of each virtual machine;And to each feasible pathIn the reception number of users of virtual machine that is related to minimize, obtain the path reception of this feasible pathNumber of users.
In one embodiment of the invention, described device also includes identification module and network element is presetModule, wherein:
Identification module, for judging whether to preset virtual functions network element on serial networking equipment;And when virtual functions network element is preset on serial networking equipment, instruction Requirement Acquisition module executionObtain the operation of the business chain demand information of user;
Network element preset module, for the judged result according to identification module, in serial networking equipmentOn when there is no preset virtual functions network element, the demand accounting according to each virtual functions network element is by heightTo low order, place a virtual functions network element on different server successively, indicate afterwardsThe execution of Requirement Acquisition module obtains the operation of the business chain demand information of user.
The present invention considers multiple resources optimization, to virtual machine CPU, virutal machine memory kimonosBetween business device, three kinds of resources of link bandwidth are optimized use, and the angle from whole piece path is carried outLoad balancing, it is achieved thereby that more excellent business chain Path selection.
Brief description
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below willThe accompanying drawing of required use in embodiment or description of the prior art is briefly described it is clear thatGround, drawings in the following description are only some embodiments of the present invention, the common skill for this areaFor art personnel, without having to pay creative labor, can also be obtained according to these accompanying drawingsObtain other accompanying drawings.
Fig. 1 is the schematic diagram of one embodiment of business chain resource regulating method of the present invention.
Fig. 2 is the schematic diagram that in one embodiment of the invention, acquisition approach receives number of users.
Fig. 3 is the schematic diagram selecting business chain path in one embodiment of the invention from feasible path.
Fig. 4 is in one embodiment of the invention, path of turning back to be corrected to determine business chain pathSchematic diagram.
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 in one embodiment of the invention, network element initialization is placed.
Fig. 7 is to select server in one embodiment of the invention with the schematic diagram of newly-increased virtual machine.
Fig. 8 is the schematic diagram after newly-increased virtual machine in one embodiment of the invention.
Fig. 9 is the schematic diagram of one embodiment of business chain resource scheduling device 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 present invention first specific embodiment.
Figure 14 is the Internet resources schematic diagram of the present invention second specific embodiment.
Figure 15 is the Internet resources schematic diagram after path correction in the present invention second specific embodiment.
Specific embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, to the technical scheme in the embodiment of the present inventionIt is clearly and completely described it is clear that described embodiment is only present invention part realityApply example, rather than whole embodiments.Description at least one exemplary embodiment is actual belowOn be merely illustrative, never as any restriction to the present invention and its application or use.BaseEmbodiment in the present invention, those of ordinary skill in the art are not making creative work premiseLower obtained every other embodiment, broadly falls into the scope of protection of the invention.
Unless specifically stated otherwise, the part otherwise illustrating in these embodiments is relative with stepArrangement, numerical expression and numerical value do not limit the scope of the invention.
Simultaneously it should be appreciated that for the ease of description, the size of the various pieces shown in accompanying drawingIt is not to draw according to actual proportionate relationship.
May not make in detail for technology, method and apparatus known to person of ordinary skill in the relevantDiscuss, but in the appropriate case, described technology, method and apparatus should be considered to authorize descriptionA part.
In all examples with discussion shown here, any occurrence should be construed as merely and showExample property, not as restriction.Therefore, the other examples of exemplary embodiment can have notSame value.
It should be noted that:Similar label and letter represent similar terms in following accompanying drawing, therefore,Once being defined in a certain Xiang Yi accompanying drawing, then do not need it is entered to advance in subsequent accompanying drawingOne step discussion.
Fig. 1 is the schematic diagram of one embodiment of business chain resource regulating method of the present invention.Preferably,The present embodiment can be executed by business chain resource scheduling device of the present invention.The method comprises the following steps:
Step 101, obtains the business chain demand information of user, wherein, business chain demand informationIncluding appellative function network element and appellative function network element by order.
The present invention is serviced for unique user, often carrys out a user and just carries out a routing meterCalculate.Each user has appellative function network element (functional network element that must pass through) and fixing leading toCross order, therefore one user corresponds to a business chain demand information, and network needs to select for userSelect a business chain path.
In one embodiment of the invention, the appellative function network element of user can include DPI(Deep Packet Inspection, deep-packet detection), FW (Firewall, fire wall) and NATVirtual functional units such as (Network Address Translation, network address translation).DemandFunctional network element by order can be:DPI->FW->NAT.
Step 102, according to demand functional network element by order, travel through current network service deviceIn have the virtual machine of appellative function network element, determine all feasible paths.
Step 103, obtains path and the path reception number of users of all feasible paths.
In one embodiment of the invention, as shown in Fig. 2 in the step 103 of Fig. 1, obtainingThe step taking the path reception number of users of all feasible paths can include:
Step 201, according to the average consumption to virtual machine CPU and memory source for the user, withAnd the surplus yield of each virtual machine CPU and internal memory, each is obtained by formula below virtualThe CPU reception number of users of machine and internal memory reception number of users:
CPU receives the CPU surplus resources/user of number of users=VM to VM cpu resourceAverage consumption;
Reception number of users=VM internal memory surplus resources/user is average to VM memory source for internal memoryConsumption.
Step 202, receives number of users to CPU and internal memory reception number of users is minimized, and obtainsThe reception number of users of each virtual machine VM.
That is, virtual machine reception number of users=Min (CPU receives number, and internal memory receives number).
Step 203, asks minimum to the reception number of users of the virtual machine being related in each feasible pathValue, obtains the path reception number of users of this feasible path.
Assume to be related to n virtual machine, then in a feasible path:
Path reception number of users=Min (VM1 receives number of users ..., and VMn receives number of users).
Step 104, the path according to all feasible paths and path reception number of users,The business chain path of user is selected from all feasible paths.
In one embodiment of the invention, as shown in figure 3, the step 104 in Fig. 1 is permissibleIncluding:
Step 301, according to the path of all feasible paths, judges in all feasible pathsWith the presence or absence of path of not turning back.If there is path of not turning back in all feasible paths, execute stepRapid 302;Otherwise, if there is not path of not turning back, execution step 303 in all feasible paths.
In one embodiment of the invention, under string shape networking mode, path of not turning backFix and be equal to a steady state value (server number+1), the path being therefore more than this steady state value mustIt is so path of turning back.
Step 302, the path in path that selects not turn back receive the most path of number of users as withThe business chain path at family, no longer executes other steps of the present embodiment afterwards.
Step 303, is corrected to feasible path to determine the business chain path of user.
In one embodiment of the invention, as shown in figure 4, the step 303 in Fig. 3 is permissibleIncluding:
Step 401, all feasible paths are carried out according to path order from short to longSequence constitutes First ray.
Step 402, for path identical feasible path in First ray, according to pathThe order sequence from more to less of reception number of users, First ray sequence is become the second sequence.
Step 403, according to the order of the second sequence, by way of newly-increased virtual machine, to everyArticle one, feasible path (path of turning back) carries out path correction.
In one embodiment of the invention, step 403 specifically can include:Determine newly-increased voidThe server of plan machine;And increase virtual machine newly on described server, so that path of turning back is entangledIt is being just path of not turning back.Wherein it is determined that on which server during newly-increased virtual machine,Following two constraintss need to be met:1st, the VM number increasing newly is minimum;2nd, can be newIncrease in the server of VM, select the minimum server of current VM number.
Step 404, if to the success of the path correction of a feasible path, stops to subsequently may be usedThe correction in walking along the street footpath, and select to be repaired path as business chain path.
Step 405, if all failing to the path correction of all feasible paths, by the second sequenceIn first feasible path (path is the shortest) as user business chain path.
The business chain resource scheduling device being provided based on the above embodiment of the present invention, by path lengthDegree judges whether feasible path turns back, and corrects, by newly-increased virtual machine, path of turning back.Thus,The present invention can effectively prevent business chain path from turning back, and brings thus efficiently solving path and turning backServer between link bandwidth resource waste.
Meanwhile, the above embodiment of the present invention is according to the path of all feasible paths and pathReception number of users selects final business access path it is contemplated that multiple resources optimization, wherein, thisInvention is received number of users by path and is considered CPU resources of virtual machine and virutal machine memory resource,Turned back by correction path and consider link bandwidth resource between server.Therefore, the above-mentioned reality of the present inventionApply example and consider resources of virtual machine and bandwidth resources it is achieved that to virtual machine CPU, virtualBetween machine internal memory server, the optimization of three kinds of resources of link bandwidth uses;And the angle from whole piece pathDegree carries out load balancing it is achieved that the load balancing of physical server and VM, thus realizingMore excellent business chain Path selection.
In one embodiment of the invention, before step 101, methods described can also be wrappedInclude:Before user arrives, each virtual functions network element preset on string shape networking equipment.Wherein,On string shape networking equipment, the step of each virtual functions network element preset specifically can include:Pass throughHistorical data or empirical value infer the demand accounting of each functional network element;And it is descending by accountingOrder successively on different server place a network element.Thus, the invention provides a set of letterSingle rational 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 executed by business chain resource scheduling device of the present invention.Step 503 in the present embodiment,Step 506- step 508 identical with the step 101- step 104 in embodiment illustrated in fig. 1 respectively orSimilar, no longer step 503, step 506- step 508 are described in detail below.The method includesFollowing steps:
Step 501, judges whether to preset virtual functions network element on serial networking equipment.If stringVirtual functions network element is preset on row networking equipment, then execution step 503;Otherwise, if serialPreset virtual functions network element, then execution step 502 are not had on networking equipment.
Step 502, the order from high to low of the demand accounting according to each virtual functions network element,One virtual functions network element is placed successively on different server.
In one embodiment of the invention, step 502 can include:By historical data orPerson's empirical value infers the demand accounting of each functional network element;And by the descending order of accounting successivelyOne network element is placed on different server.Assume tri- functional network element of DPI, FW, NATDemand accounting is sequentially reduced, then can be according to the set-up mode of the embodiment shown in Fig. 6, in serviceDPI1 is opened on device 1, opens FW1 on a server 2, NAT1 is opened on server 3.
Step 503, obtains the business chain demand information of user, wherein, business chain demand informationIncluding appellative function network element and appellative function network element by order.
Step 504, judges on current business chain, whether the corresponding resource of appellative function network element is enough.If on current business chain, the corresponding resource of appellative function network element is enough, execution step 506;NoThen, if the corresponding inadequate resource of appellative function network element, execution step 505 on current business chain.
Step 505, opens new virtual machine and installs new appellative function network element, execute afterwardsStep 506.As shown in Figure 7, this figure illustrates select the idiographic flow of newly-increased VMWhich platform server carries newly-increased VM.
In one embodiment of the invention it is assumed that the VM that can open on every server is individualNumber is limited.As shown in fig. 7, the idiographic flow of newly-increased VM can include:
Step 701, judges whether the virtual machine quantity of home server reaches the upper limit, wherein originallyBut ground server refers to the appellative function network element (such as DPI) comprising a certain user shouldThe server of the corresponding inadequate resource of functional network element.If judging the virtual machine quantity of home serverReach the upper limit, then execution step 703;Otherwise, if judging the virtual machine quantity of home serverThe not up to upper limit, then execution step 702.
Step 702, increases virtual machine newly in home server, and according to new appellative function network element.If home server has multiple, select on the few home server of existing virtual machine quantity newIncrease virtual machine.
In one embodiment of the invention, if as shown in figure 8, server 1 (local serviceDevice) on appellative function network element DPI1 inadequate resource, then on the server increase newly virtual machineVM2 according to new appellative function network element DPI2.
In another embodiment of the invention, as shown in figure 13 it is assumed that demand on server 3The equal inadequate resource of appellative function network element NAT2 in functional network element NAT1 server 4, byOn server 4, existing virtual machine quantity is less than server 3, newly-increased therefore on server 4Virtual machine VM2 according to new appellative function network element NAT3.
Step 703, judges the void of neighbours' server (server adjacent with home server)Whether plan machine quantity reaches the upper limit, if judging, the virtual machine quantity of neighbours' server reaches the upper limit,Then execution step 705;Otherwise, if judging, the virtual machine quantity of neighbours' server is not up to the upper limit,Then execution step 704.
Step 704, increases virtual machine newly in neighbours' server, and according to new appellative function network element.If neighbours' server has multiple, select on the few neighbours' server of existing virtual machine quantity newIncrease virtual machine.
Step 705, judges other server (clothes in addition to home server and part serverBusiness device) virtual machine quantity whether reach the upper limit, if the virtual machine quantity of other server reachesThe upper limit, then execution step 706;Otherwise, if the virtual machine quantity of the other servers of judgement does not reachTo the upper limit, then execution step 707.
It is impossible to increase virtual machine newly, current ink cannot meet user's request, afterwards to step 706Step executes other steps of the present embodiment.
Step 707, increases virtual machine newly in other servers, and according to new appellative function network element.Preferably in neighbor server (server apart from home server is nearer), open new virtual machine.
Step 506, according to demand functional network element by order, travel through current network service deviceIn have the virtual machine of appellative function network element, determine all feasible paths.
Step 507, obtains path and the path reception number of users of all feasible paths.
Step 508, the path according to all feasible paths and path reception number of users,The business chain path of user is selected from all feasible paths.
The above embodiment of the present invention provides the functional network element initialization scheme of a set of advantages of simple,Thus solving in existing business chain resource scheduling scheme, not preset on serial networking equipmentHave during virtual functions network element it is impossible to carry out the problem of business chain scheduling of resource.Meanwhile, the present inventionAbove-described embodiment additionally provides resource inspection and newly-increased mechanism, devises coping resources and exhausts situationResource increase mechanism newly, thus having obtained good resource expansion it is therefore prevented that because of inadequate resourceThe packet loss causing or empty machine collapse phenomenon.
Fig. 9 is the schematic diagram of one embodiment of business chain resource scheduling device of the present invention.As Fig. 9 instituteShow, described business chain resource scheduling device includes Requirement Acquisition module 100, path primary election module200th, parameter acquisition module 300 and path determination module 400, wherein:
Requirement Acquisition module 100, for obtaining the business chain demand information of user, described businessChain demand information include appellative function network element and described appellative function network element by order.
Path primary election module 200, is determined all for functional network element according to demand by orderFeasible path.
Parameter acquisition module 300, for obtaining path and the path of all feasible pathsReception number of users.
In one embodiment of the invention, parameter acquisition module 300 obtain all can walking along the streetDuring the path reception number of users in footpath, can be used for according to user to virtual machine CPU and memory sourceAverage consumption, and the surplus yield of each virtual machine CPU and internal memory, obtain eachThe CPU reception number of users of virtual machine and internal memory reception number of users;To CPU reception number of users andInternal memory reception number of users is minimized, and obtains the reception number of users of each virtual machine;And to eachThe reception number of users of the virtual machine being related in feasible path is minimized, and obtains this feasible pathNumber of users is received in path.
Path determination module 400, for the path according to all feasible paths and pathReception number of users, selects the business chain path of user from all feasible paths.
In one embodiment of the invention, as shown in Figure 10, the path determination module in Fig. 9400 can include identifying submodule 410, Path selection submodule 420 and path correction submodule430, wherein:
Identification submodule 410, for the path according to all feasible paths, judges allWhether there is path of not turning back in feasible path.
Path selection submodule 420, for according to identification submodule 410 judged result,Exist in all feasible paths when not turning back path, reception user in path in the path that selects not turn backThe most path of number is as the business chain path of user.
Path correction submodule 430, for according to identification submodule 410 judged result,Do not exist in all feasible paths when not turning back path, feasible path is corrected to determine useThe business chain path at family.
In one embodiment of the invention, as shown in figure 11, path correction in Figure 10Module 430 can include the first sequencing unit 431, the second sequencing unit 432, path correction listUnit 433 and path determining unit 434, wherein:
First sequencing unit 431, for by all feasible paths, according to path by being short toLong order is ranked up constituting First ray.
Second sequencing unit 432, for can walking along the street for path identical in First rayFootpath, receives number of users order sequence from more to less according to path, First ray sequence is becomeSecond sequence.
Path correction unit 433, for the order according to the second sequence, by increasing virtual machine newlyMode, path correction is carried out to feasible path, path correction of turning back is not turn back path.
Path determining unit 434, for determining final business chain path.For example:In pathWhen correction unit 433 is successful to the path correction of a feasible path, path determining unit 434For stopping the correction to later path, and select to be repaired path as business chain path;When path correction unit 433 all fails to the path correction of all feasible paths, path determinesUnit 434 be used for using first in the second sequence as user business chain path.
The business chain resource scheduling device being provided based on the above embodiment of the present invention, by path lengthDegree judges whether feasible path turns back, and corrects, by newly-increased virtual machine, path of turning back.Thus,The present invention can effectively prevent business chain path from turning back, and brings thus efficiently solving path and turning backServer between link bandwidth resource waste.
Meanwhile, the above embodiment of the present invention is according to the path of all feasible paths and pathReception number of users selects final business access path it is contemplated that multiple resources optimization, wherein, thisInvention is received number of users by path and is considered CPU resources of virtual machine and virutal machine memory resource,Turned back by correction path and consider link bandwidth resource between server.Therefore, the above-mentioned reality of the present inventionApply example and consider resources of virtual machine and bandwidth resources it is achieved that to virtual machine CPU, virtualBetween machine internal memory server, the optimization of three kinds of resources of link bandwidth uses;And the angle from whole piece pathDegree carries out load balancing it is achieved that the load balancing of physical server and VM, thus realizingMore excellent business chain Path selection.
In one embodiment of the invention, path correction unit 433 can include position determinationSubelement and path correction subelement, wherein:
Position determination subelement, for determining the server of newly-increased virtual machine, wherein, described clothesThe determination process of business device meets two constraintss:Newly-increased virtual machine number is minimum;CanIn the server of newly-increased virtual machine, select the minimum server of current virtual machine number.
Path correction subelement, for void newly-increased on the server that position determination subelement determinesPlan machine, so that path correction of turning back 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 Fig. 9Shown embodiment is compared, and in the embodiment shown in fig. 12, described device can also include knowingOther module 500 and network element preset module 600, wherein:
Identification module 500, for judging whether to preset virtual functions net on serial networking equipmentUnit;And when virtual functions network element is preset on serial networking equipment, indicate Requirement Acquisition module100 execution obtain the operation of the business chain demand information of user.
Network element preset module 600, for the judged result according to identification module 500, in serialWhen preset virtual functions network element is not had on networking equipment, according to the demand of each virtual functions network elementAccounting order from high to low, places a virtual functions network element successively on different server,The execution of instruction Requirement Acquisition module 100 obtains the operation of the business chain demand information of user afterwards.
The above embodiment of the present invention provides the functional network element initialization scheme of a set of advantages of simple,Thus solving in existing business chain resource scheduling scheme, not preset on serial networking equipmentHave during virtual functions network element it is impossible to carry out the problem of business chain scheduling of resource.
In one embodiment of the invention, as shown in figure 12, described device can also include providingSource inspection module 700 and resource increase module 800 newly, wherein:
Resource checks module 700, for judging that on current business chain, appellative function network element is correspondingWhether resource is enough;And when on current business chain, the corresponding resource of appellative function network element is enough,Indicate path primary election module 200 execute functional network element according to demand by order determine all canThe operation in walking along the street footpath.
Resource increases module 800 newly, for checking the judged result of module 700 according to resource,On current business chain during the corresponding inadequate resource of appellative function network element, open new virtual machine and pacifyFill new appellative function network element, instruction path primary election module 200 executes function according to demand afterwardsThe operation determining all feasible paths by order of network element.
The above embodiment of the present invention provides resource inspection and newly-increased mechanism, devises coping resourcesExhaust situation resource increase newly mechanism, thus obtained good resource expansion it is therefore prevented that becausePacket loss or empty machine collapse phenomenon that inadequate resource causes.
Below by specific example, the present invention will be described:
First specific embodiment:
Figure 13 is the Internet resources schematic diagram of the present invention first specific embodiment.As shown in figure 13,Virtual functional units have been preset on serial networking equipment, so net need not be carried out in this embodimentNetwork function initialization operation.The business chain resource regulating method of the present embodiment specifically includes:
Step 1. obtains the business chain demand information of user.Wherein, appellative function network element is logicalCross and be sequentially:DPI->FW->NAT.
The current CPU of each VM and memory usage has been marked it is assumed that user in accompanying drawing 13As shown in the table to the resource average consumption of virtual functions network element:
DPIFWNAT
CPU0.3%0.2%0.15%
Internal memory0.25%0.1%0.1%
Step 2. resource inspection.In relatively Figure 13, the current CPU of each VM and internal memory useIn rate, and upper table, the resource average consumption of virtual functions network element, can obtain current DPI, FWAll there is resource with NAT.
Step 3. lists all feasible paths, and calculates path.
Path numberPathLength
1DPI2->FW3->NAT15
2DPI3->FW3->NAT17 (turning back)
3DPI2->FW1->NAT15
4DPI3->FW1->NAT15
5DPI2->FW4->NAT15
6DPI3->FW4->NAT15
Step 4. calculates the number of users that path can be received
Number of users can be received in path:
Path numberPathReception number of users
1DPI2->FW3->NAT1116
3DPI2->FW1->NAT1100
4DPI3->FW1->NAT1100
5DPI2->FW4->NAT1116
6DPI3->FW4->NAT1100
Step 5. receives number of users order sequence from more to less according to path, if path reception is usedThere is a plurality of (path 1 in such as upper table and path 5) in the most path of amount, then select at randomSelect one as business chain path.
Outgoing traffic chain path:DPI2->FW3->NAT1.
Specific embodiment 2:
Figure 14 is the Internet resources schematic diagram of the present invention second specific embodiment.As shown in figure 14,Virtual functional units have been preset on serial networking equipment, so net need not be carried out in this embodimentNetwork function initialization operation.The business chain resource regulating method of the present embodiment specifically includes:
Step 1. obtains the business chain demand information of user.Wherein, appellative function network element is logicalCross and be sequentially:DPI->NAT->FW
The current CPU of each VM and memory usage has been marked it is assumed that user in accompanying drawing 14As shown in the table to the resource average consumption of virtual functions network element:
DPIFWNAT
CPU0.3%0.2%0.15%
Internal memory0.25%0.1%0.1%
Step 2. resource inspection.In relatively Figure 13, the current CPU of each VM and internal memory useIn rate, and upper table, the resource average consumption of virtual functions network element, can obtain current DPI, FWAll there is resource with NAT.
Step 3. lists all feasible paths, and computational length.
Path numberPathLength
1DPI3->NAT1->FW29 (turning back)
2DPI3->NAT2->FW211 (turning back)
3DPI3->NAT1->FW39 (turning back)
4DPI3->NAT2->FW311 (turning back)
Step 4. calculates the number of users that path can be received
Number of users can be received in path:
Path numberPathLengthReception number of users
1DPI3->NAT1->FW2940
2DPI3->NAT2->FW21140
3DPI3->NAT1->FW3920
4DPI3->NAT2->FW31120
Ascending according to path, the order sequence from more to less of reception number of users, if identicalThe path reception number of users of length is also identical, then randomly ordered.
Path numberPathLengthReception number of users
1DPI3->NAT1->FW2940
3DPI3->NAT1->FW3920
2DPI3->NAT2->FW21140
4DPI3->NAT2->FW31120
Step 5. proceeds by, from path 1, correction of turning back.
As shown in figure 14, the present embodiment adopts following three kinds of schemes all can be with the folding of realizing route 1Return correction:
1st, on server 3, newly-increased VM places FW network element FW5 and just can solve path and turns backProblem, constitutes business chain path:DPI3->NAT1->FW5.
2nd, on server 4, newly-increased VM places FW network element FW5 and just can solve path and turns backProblem, constitutes business chain path:DPI3->NAT1->FW5.
3rd, increase VM placement network element DPI4 and NAT3 on the server newly and also can solve pathTurn back problem, constitute business chain path:DPI4->NAT3->FW2.
But it is contemplated that the two of path correction constraintss:First, newly-increased VM numberMinimum, need newly-increased 1 VM in scheme 1,2, scheme 3 need to increase 2 VM newly, becauseThis exclusion program 3.Meanwhile, current according to, in the server that can increase VM newly, selectingThe constraints of the minimum server of VM number, as shown in figure 14, the current VM of server 3Number is 2, and the current VM number of server 4 is 1.
Therefore, selection scheme 2, as shown in figure 15, on server 4, newly-increased VM placesFW network element FW5 carries out path and turns back correction, outgoing traffic chain path:DPI3->NAT1->FW5.
Business chain resource scheduling device described above can be implemented as executing thisThe general processor of bright described function, programmable logic controller (PLC) (PLC), digital signalProcessor (DSP), special IC (ASIC), field programmable gate array (FPGA)Or other PLDs, discrete gate or transistor logic, discrete hardware groupPart or it is arbitrarily appropriately combined.
So far, the present invention is described in detail.In order to avoid covering the design of the present invention, do not haveSome details known in the field are described.Those skilled in the art as described above, completelyIt can be appreciated how implementing technical scheme disclosed herein.
One of ordinary skill in the art will appreciate that realizing all or part of step of above-described embodimentCan be completed it is also possible to the hardware being instructed correlation by program is completed by hardware, describedProgram can be stored in a kind of computer-readable recording medium, and storage medium mentioned above is permissibleIt is read only memory, disk or CD etc..
Description of the invention is given for the sake of example and description, and is not exhaustivelyOr limit the invention to disclosed form.Many modifications and variations are for the common skill of this areaIt is obvious for art personnel.Select and describe the principle that embodiment is in order to the present invention is more preferably describedAnd practical application, and make those of ordinary skill in the art it will be appreciated that the present invention is thus design is suitableIn the various embodiments with various modifications for the special-purpose.

Claims (16)

CN201510462802.9A2015-07-312015-07-31Business chain resource regulating method and deviceActiveCN106411768B (en)

Priority Applications (1)

Application NumberPriority DateFiling DateTitle
CN201510462802.9ACN106411768B (en)2015-07-312015-07-31Business chain resource regulating method and device

Applications Claiming Priority (1)

Application NumberPriority DateFiling DateTitle
CN201510462802.9ACN106411768B (en)2015-07-312015-07-31Business chain resource regulating method and device

Publications (2)

Publication NumberPublication Date
CN106411768Atrue CN106411768A (en)2017-02-15
CN106411768B CN106411768B (en)2019-08-23

Family

ID=58007496

Family Applications (1)

Application NumberTitlePriority DateFiling Date
CN201510462802.9AActiveCN106411768B (en)2015-07-312015-07-31Business chain resource regulating method and device

Country Status (1)

CountryLink
CN (1)CN106411768B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN109639447A (en)*2017-10-092019-04-16中兴通讯股份有限公司The method and device of network function virtualization service chain mapping under annular networking
WO2020207148A1 (en)*2019-04-092020-10-15中兴通讯股份有限公司Load balancing method and apparatus
CN114342332A (en)*2019-09-162022-04-12华为技术有限公司 A communication method, device and system
WO2022143597A1 (en)*2020-12-282022-07-07华为技术有限公司Method for determining forwarding path of service chain and communication apparatus

Citations (7)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN1592217A (en)*2003-08-262005-03-09大唐移动通信设备有限公司Managing method for resources in communication system
US8667171B2 (en)*2010-05-282014-03-04Microsoft CorporationVirtual data center allocation with bandwidth guarantees
CN104079482A (en)*2013-03-262014-10-01华为技术有限公司Method and device of selecting routing path
CN104283806A (en)*2014-10-312015-01-14杭州华三通信技术有限公司Service link processing method and device
CN104636184A (en)*2014-12-292015-05-20上海华为技术有限公司Deploying method, device and equipment of instances of virtual machine
US20150138973A1 (en)*2013-11-152015-05-21Cisco Technology, Inc.Shortening of service paths in service chains in a communications network
CN104734955A (en)*2013-12-192015-06-24华为技术有限公司Network function virtualization implementation method, wide-band network gateway and control device

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN1592217A (en)*2003-08-262005-03-09大唐移动通信设备有限公司Managing method for resources in communication system
US8667171B2 (en)*2010-05-282014-03-04Microsoft CorporationVirtual data center allocation with bandwidth guarantees
CN104079482A (en)*2013-03-262014-10-01华为技术有限公司Method and device of selecting routing path
US20150138973A1 (en)*2013-11-152015-05-21Cisco Technology, Inc.Shortening of service paths in service chains in a communications network
CN104734955A (en)*2013-12-192015-06-24华为技术有限公司Network function virtualization implementation method, wide-band network gateway and control device
CN104283806A (en)*2014-10-312015-01-14杭州华三通信技术有限公司Service link processing method and device
CN104636184A (en)*2014-12-292015-05-20上海华为技术有限公司Deploying method, device and equipment of instances of virtual machine

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
唐宏 等: "网络功能虚拟化中的网络转发性能优化技术研究", 《电信科学》*
李晨 等: "基于SDN和NFV的云数据中心网络服务", 《网络技术》*

Cited By (8)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN109639447A (en)*2017-10-092019-04-16中兴通讯股份有限公司The method and device of network function virtualization service chain mapping under annular networking
WO2019072171A1 (en)*2017-10-092019-04-18中兴通讯股份有限公司Method and apparatus for network functions virtualization service chain mapping in annular network
CN109639447B (en)*2017-10-092021-11-12中兴通讯股份有限公司Method and device for mapping network function virtualization service chain under ring networking
WO2020207148A1 (en)*2019-04-092020-10-15中兴通讯股份有限公司Load balancing method and apparatus
CN114342332A (en)*2019-09-162022-04-12华为技术有限公司 A communication method, device and system
CN114342332B (en)*2019-09-162023-07-07华为技术有限公司Communication method, device and system
US12348373B2 (en)2019-09-162025-07-01Huawei Technologies Co., Ltd.Communication method, apparatus, and system
WO2022143597A1 (en)*2020-12-282022-07-07华为技术有限公司Method for determining forwarding path of service chain and communication apparatus

Also Published As

Publication numberPublication date
CN106411768B (en)2019-08-23

Similar Documents

PublicationPublication DateTitle
CN108260169B (en) A Dynamic Deployment Method of Service Function Chain Based on QoS Guarantee
CN106411768A (en)Service chain resource scheduling method and apparatus
CN103051564B (en)The method and apparatus of dynamic resource allocation
CN104683488B (en)Streaming computing system and its dispatching method and device
CN105681153B (en) A virtual network mapping method and device
JP6470426B2 (en) Resource allocation device and resource allocation method
Wang et al.Virtual network mapping with traffic matrices
WO2015028931A1 (en)A method and system to allocate bandwidth based on task deadline in cloud computing networks
CN106100964B (en)A kind of method and apparatus of virtual network mapping
CN103559084A (en)Virtual machine migration method of energy-saving data center
CN104202241A (en)Deflection fault-tolerant routing algorithm for network-on-chip with 2D-Mesh topology structure
CN106411678A (en)Bandwidth guarantee type virtual network function (VNF) deployment method
CN104917659B (en)A kind of mapping method of virtual network based on virtual network connection performance
Yao et al.A network-aware virtual machine allocation in cloud datacenter
Zu et al.Resource aware chaining and adaptive capacity scaling for service function chains in distributed cloud network
Lin et al.VNF embedding and assignment for network function parallelism
CN104581820B (en)Slot allocation method and device based on subregion
Yin et al.Aggregation service function chain mapping plan based on beetle antennae search algorithm
CN105490959B (en) Implementation method of non-uniform bandwidth virtual data center embedding based on congestion avoidance
WO2017100987A1 (en)Embedding implementation method for non-uniform bandwidth virtual data centre based on congestion avoidance
Nguyen et al.RT-VNE: A real-time strategy for Virtual Network Embedding towards resource efficiency
Chen et al.Virtual network embedding with border matching
Chen et al.Algorithm for virtual nodes reconfiguration on network virtualization
CN105553725B (en)A kind of dispositions method of multi-tenant data center software middleware
Quang et al.QAAV: Quality of service-aware adaptive allocation of virtual network functions in wireless network

Legal Events

DateCodeTitleDescription
C06Publication
PB01Publication
SE01Entry into force of request for substantive examination
SE01Entry into force of request for substantive examination
GR01Patent grant
GR01Patent grant

[8]ページ先頭

©2009-2025 Movatter.jp