CN104735167B - A kind of method and apparatus realized network scheduling function and opened - Google Patents
A kind of method and apparatus realized network scheduling function and opened Download PDFInfo
- Publication number
- CN104735167B CN104735167B CN201510173779.1A CN201510173779A CN104735167B CN 104735167 B CN104735167 B CN 104735167B CN 201510173779 A CN201510173779 A CN 201510173779A CN 104735167 B CN104735167 B CN 104735167B
- Authority
- CN
- China
- Prior art keywords
- scheduling
- scheduling strategy
- strategy
- network
- user
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
This application discloses a kind of method and apparatus realized network scheduling function and opened, wherein method includes:It is user's selection scheduling strategy from default scheduling strategy set according to current network state information and the dispatching requirement information after network side receives the dispatching requirement information of user configuration;According to selected scheduling strategy and the network state information, corresponding scheduling rule is generated;The scheduling rule is issued in the group of planes equipment involved by the rule, and the situation about issuing is fed back into the user as scheduling result.The dispatching requirement of request scheduling user can be met using the present invention.
Description
Technical field
The present invention relates to cloud computing technology, more particularly to a kind of method and apparatus realized network scheduling function and opened.
Background technology
With the rapid development of cloud computing technology, more and more people begin to use the service on cloud, and traditional service is more
Be " functionality " and " node ".Developer's also rental service device on cloud more and more simultaneously, builds network.Cloud meter
It calculates service facility and also meets the needs of developer providing detailed configuration mode as far as possible.Singly see network facet, manufacturer is general
Public network service, private network service, router virtual and the elastic service distributed of bandwidth are provided.
However for request of data, the request of especially multiple small data quantity, except bandwidth, the selection of routing also can shadow
Ring response speed.In the case where bandwidth is constant, the variation of routed path, the response time of request can equally change.Traditional net
Network is difficult to control routing.
At present major part scheduling scheme research point is all to propose in new dispatching algorithm, with meet news or
Person improves original algorithm.And in practical applications, there are a variety of situations for the dispatching requirement of user, it is impossible to have a kind of tune
Degree algorithm disclosure satisfy that all applicable cases, be optimal all targets.Therefore, the dispatching party of existing cloud platform
Case, can not ensure the dispatching requirement of user can be met.
The content of the invention
In view of this, it is a primary object of the present invention to provide a kind of method and dress for realizing the opening of network scheduling function
It puts, the dispatching requirement of request scheduling user can be met.
In order to achieve the above object, technical solution proposed by the present invention is:
A kind of method realized network scheduling function and opened, including:
After network side receives the dispatching requirement information of user configuration, according to current network state information and the tune
Demand information is spent, is user's selection scheduling strategy from default scheduling strategy set;
According to selected scheduling strategy and the network state information, corresponding scheduling rule is generated;
The scheduling rule is issued in the group of planes equipment involved by the rule, and using the situation about issuing as tune
Degree result feeds back to the user.
A kind of device realized network scheduling function and opened, including:
Strategy selection module, after the dispatching requirement information that user configuration is received for working as network side, according to current net
Network status information and the dispatching requirement information are user's selection scheduling strategy from default scheduling strategy set, and
It is sent to rule generation module;
Rule generation module, for according to selected scheduling strategy and the network state information, generating corresponding adjust
Metric is then;
Rule issues module, for being issued to the scheduling rule in the group of planes equipment involved by the rule, and by institute
It states situation about issuing and feeds back to the user as scheduling result.
In conclusion the method and apparatus proposed by the present invention realized network scheduling function and opened, network side can basis
With reference to current Network status, the optimal scheduling that can meet its needs is determined for it for the dispatching requirement information of user configuration
Strategy so as to realize the opening of network scheduling function, and then can overcome network side in existing scheme to fix one used
The problem of user demand present in kind scheduling scheme can not meet.
Description of the drawings
Fig. 1 is the method flow schematic diagram of the embodiment of the present invention one;
Fig. 2 is the apparatus structure schematic diagram of the embodiment of the present invention one.
Specific embodiment
To make the object, technical solutions and advantages of the present invention clearer, it is right below in conjunction with the accompanying drawings and the specific embodiments
The present invention is described in further detail.
The present invention core concept be:Network side can be according to the dispatching requirement information of user configuration, with reference to current net
Network situation selects the optimal scheduling strategy that can meet its needs, the tune current as the user from multiple scheduling strategies
Degree strategy in this way, the opening of network scheduling function can be realized, and then can overcome network side in existing scheme to fix what is used
The problem of a kind of user demand present in scheduling scheme can not meet.
Fig. 1 is the method flow schematic diagram of the embodiment of the present invention one, as shown in Figure 1, this method comprises the following steps:
Step 101, after network side receives the dispatching requirement information of user configuration, according to current network state information
It is user's selection scheduling strategy from default scheduling strategy set with the dispatching requirement information.
In this step, it is contemplated that the target of user may be various, it is necessary to select most suitable user in policy library
The scheduling strategy of dispatching requirement.In this way, network side after the dispatching requirement of user is received, it is necessary to first be scheduled according to its demand
The screening of strategy can most meet the dispatching method of its demand and be scheduled to be selected for it.
Specifically, network state information can include following information:Total bandwidth letter between network delay information, network node
Breath and idle bandwidth information and network topology structure.Prior art realization can be used in the acquisition of the network state information,
This is repeated no more.
The dispatching requirement information can include throughput, response speed, the information such as bandwidth stability, application type.
The scheduling strategy set in network side can be configured by those skilled in the art, as much as possible comprising adaptation
The scheduling strategy of different demands target, to meet the dynamic needs of user.
It is preferred that it is user's selection scheduling strategy from scheduling strategy set that following step, which may be employed,:
Step 1011, in the scheduling strategy set, find out the scheduling plan with the dispatching requirement information match
Slightly.
This step from scheduling strategy set for filtering out one group of scheduling strategy with dispatching requirement information match, so
Subsequent step is recycled therefrom to select optimal scheduling strategy afterwards and is allocated to user.
Specifically, here, judge scheduling strategy whether with the strategy of dispatching requirement information match can be:As long as meet
The target component of specified quantity m in dispatching requirement information can be considered matching, specified quantity m>=1, that is, meet partial target
Parameter can be identified as matching.
Step 1012, for each target component in the dispatching requirement information, determine each scheduling found out
Strategy is under current network state, to the matching degree of the target component, and according to the descending of the matching degree, to being looked into
All scheduling strategies gone out are ranked up.
In this step, determine each scheduling strategy under current network state to the specific side of target component matching degree
Method is grasped by those skilled in the art, and details are not described herein.
Step 1013, each scheduling strategy for being found out utilize its sequence sequence under each target component
Number and default each target component priority factor, calculate the comprehensive matching degree of the scheduling strategy.
In this step, using the priority factor of target component, each target component can be set in scheduling strategy matching
The proportion of aspect.
The priority factor of target component can be according to actual needs configured by those skilled in the art, no longer superfluous herein
It states.
It is preferred that for each scheduling strategy found out, following methods may be employed and calculate its comprehensive matching degree:
According toCalculate the comprehensive matching degree Z of i-th found out of scheduling strategyi, wherein, i is
Scheduling strategy sequence number, the sn,iFor the sequence sequence number of i-th of scheduling strategy under n-th of target component, pn,iFor
The priority factor of n-th of target component, N are the target component number in the dispatching requirement information.
Step 1014, using the highest scheduling strategy of comprehensive matching degree as the scheduling strategy of the user.
Consider each scheduling of the match condition of different target parameter to being found out in step 1011 using above-mentioned steps
The comprehensive matching degree of strategy is evaluated and tested, the then highest scheduling strategy of the reselection comprehensive matching degree scheduling current as user
Therefore strategy, can utmostly meet the current dispatching requirement of user.
Step 102, according to selected scheduling strategy and the network state information, generate corresponding scheduling rule.
In this step, in the case of given scheduling strategy and network state information, the specific of corresponding scheduling rule is generated
Method is grasped by those skilled in the art, and details are not described herein.
The scheduling rule is issued in the group of planes equipment involved by the rule by step 103, and by the feelings issued
Condition feeds back to the user as scheduling result.
Prior art realization may be employed in issuing for scheduling rule in this step, it is preferred that can be layered the network equipment
Management, upper layer device manage multiple infrastructure devices, and every layer is established index, in this way, can be by indexing rule by overlay device
Quickly it is distributed to underlying device.
Whether the situation about issuing, i.e. scheduling rule are successfully sent in corresponding group of planes equipment.
Fig. 2 be with the corresponding apparatus structure schematic diagram of the above method, as shown in Fig. 2, the device includes:
Strategy selection module, after the dispatching requirement information that user configuration is received for working as network side, according to current net
Network status information and the dispatching requirement information are user's selection scheduling strategy from default scheduling strategy set, and
It is sent to rule generation module;
Rule generation module, for according to selected scheduling strategy and the network state information, generating corresponding adjust
Metric is then;
Rule issues module, for being issued to the scheduling rule in the group of planes equipment involved by the rule, and by institute
It states situation about issuing and feeds back to the user as scheduling result.
It is preferred that the network state information includes:
The network state information includes the total bandwidth information and idle bandwidth information between network delay information, network node
And network topology structure.
It is preferred that the strategy selection module is further used in the scheduling strategy set, find out and the tune
The scheduling strategy that degree demand information matches;For each target component in the dispatching requirement information, determine what is found out
Each scheduling strategy is under current network state, to the matching degree of the target component, and according to the drop of the matching degree
Sequence is ranked up all scheduling strategies found;For each scheduling strategy found out, using it in each mesh
The priority factor of the sequence sequence number and default each target component under parameter is marked, calculates the comprehensive matching of the scheduling strategy
Degree;Using the highest scheduling strategy of comprehensive matching degree as the scheduling strategy of the user.
It is preferred that the strategy selection module, be further used for according toCalculate found out i-th
The comprehensive matching degree Z of a scheduling strategyi, wherein, i be scheduling strategy sequence number, the sn,iFor under n-th of target component
The sequence sequence number of i-th of scheduling strategy, pn,iFor the priority factor of n-th of target component, N believes for the dispatching requirement
Target component number in breath.
In conclusion the foregoing is merely a prefered embodiment of the invention, it is not intended to limit the scope of the present invention.
Within the spirit and principles of the invention, any modifications, equivalent replacements and improvements are made should be included in the present invention's
Within protection domain.
Claims (6)
- A kind of 1. method realized network scheduling function and opened, which is characterized in that including:After network side receives the dispatching requirement information of user configuration, according to current network state information and the scheduling need Information is sought, is user's selection scheduling strategy from default scheduling strategy set;According to selected scheduling strategy and the network state information, corresponding scheduling rule is generated;The scheduling rule is issued in the group of planes equipment involved by the rule, and is tied the situation about issuing as scheduling Fruit feeds back to the user;Described is that user's selection scheduling strategy includes from default scheduling strategy set:In the scheduling strategy set, the scheduling strategy with the dispatching requirement information match is found out;For each target component in the dispatching requirement information, each scheduling strategy for determining to be found out is in current net Under network state, to the matching degree of the target component, and according to the descending of the matching degree, to all scheduling plans found Slightly it is ranked up;For each scheduling strategy found out, its sequence sequence number under each target component and default each institute are utilized The priority factor of target component is stated, calculates the comprehensive matching degree of the scheduling strategy;Using the highest scheduling strategy of comprehensive matching degree as the scheduling strategy of the user.
- 2. according to the method described in claim 1, it is characterized in that, the network state information includes network delay information, net Total bandwidth information and idle bandwidth information and network topology structure between network node.
- 3. according to the method described in claim 1, it is characterized in that, each scheduling strategy for being found out, the calculating The comprehensive matching degree of the scheduling strategy includes:According toCalculate the comprehensive matching degree Z of i-th found out of scheduling strategyi, wherein, i is scheduling plan Slightly sequence number, the sn,iFor the sequence sequence number of i-th of scheduling strategy under n-th of target component, pn,iFor n-th of mesh The priority factor of parameter is marked, N is the target component number in the dispatching requirement information.
- 4. a kind of device realized network scheduling function and opened, which is characterized in that including:Strategy selection module, after the dispatching requirement information that user configuration is received for working as network side, according to current network-like State information and the dispatching requirement information are user's selection scheduling strategy from default scheduling strategy set, and send To rule generation module;Wherein, include for user's selection scheduling strategy:In the scheduling strategy set, find out with The scheduling strategy of the dispatching requirement information match;For each target component in the dispatching requirement information, institute is determined The each scheduling strategy found out is under current network state, to the matching degree of the target component, and according to the matching The descending of degree is ranked up all scheduling strategies found;For each scheduling strategy found out, using its The priority factor of sequence sequence number and default each target component under each target component, calculates the scheduling strategy Comprehensive matching degree;Using the highest scheduling strategy of comprehensive matching degree as the scheduling strategy of the user;Rule generation module, for according to selected scheduling strategy and the network state information, generating corresponding scheduling rule Then;Rule issues module, for the scheduling rule being issued in the group of planes equipment involved by the rule, and will be described under The situation of hair feeds back to the user as scheduling result.
- 5. device according to claim 4, which is characterized in that the network state information includes network delay information, net Total bandwidth information and idle bandwidth information and network topology structure between network node.
- 6. device according to claim 4, which is characterized in that the strategy selection module, be further used for according toCalculate the comprehensive matching degree Z of i-th found out of scheduling strategyi, wherein, i is scheduling strategy sequence number, The sn,iFor the sequence sequence number of i-th of scheduling strategy under n-th of target component, pn,iFor n-th of target component Priority factor, N be the dispatching requirement information in target component number.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510173779.1A CN104735167B (en) | 2015-04-13 | 2015-04-13 | A kind of method and apparatus realized network scheduling function and opened |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510173779.1A CN104735167B (en) | 2015-04-13 | 2015-04-13 | A kind of method and apparatus realized network scheduling function and opened |
Publications (2)
Publication Number | Publication Date |
---|---|
CN104735167A CN104735167A (en) | 2015-06-24 |
CN104735167B true CN104735167B (en) | 2018-06-05 |
Family
ID=53458593
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201510173779.1A Active CN104735167B (en) | 2015-04-13 | 2015-04-13 | A kind of method and apparatus realized network scheduling function and opened |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN104735167B (en) |
Families Citing this family (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106936883B (en) * | 2015-12-31 | 2020-03-20 | 伊姆西Ip控股有限责任公司 | Method and apparatus for cloud system |
CN115051920B (en) * | 2022-06-02 | 2023-07-18 | 北京邮电大学 | Method and system for expanding NFV capacity network element under capacity open architecture |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102495758A (en) * | 2011-12-05 | 2012-06-13 | 中南大学 | Scheduling method of real-time tasks in distributing type high performance calculation environment |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9119111B2 (en) * | 2011-08-12 | 2015-08-25 | Alcatel Lucent | Method and apparatus for controlling wireless uplink sessions |
-
2015
- 2015-04-13 CN CN201510173779.1A patent/CN104735167B/en active Active
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102495758A (en) * | 2011-12-05 | 2012-06-13 | 中南大学 | Scheduling method of real-time tasks in distributing type high performance calculation environment |
Also Published As
Publication number | Publication date |
---|---|
CN104735167A (en) | 2015-06-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105637925B (en) | Dynamic frequency and power resource allocation with refinement tactical management | |
Hong et al. | Achieving high utilization with software-driven WAN | |
Haider et al. | Challenges in resource allocation in network virtualization | |
Shuja et al. | Data center energy efficient resource scheduling | |
CN106471773A (en) | The distribution of integrated form global resource and load balance | |
Kotronis et al. | Stitching inter-domain paths over IXPs | |
CN104683488B (en) | Streaming computing system and its dispatching method and device | |
WO2016161127A1 (en) | Network management system with traffic engineering for a software defined network | |
CN104901989B (en) | A kind of Site Service offer system and method | |
WO2014119719A1 (en) | Resource control system, control pattern generation device, control device, resource control method and program | |
CN106533806A (en) | Method for providing cross-layer quality of service (QoS) based on application awareness in multi-tenant software defined network (SDN) | |
Alencar et al. | Dynamic microservice allocation for virtual reality distribution with qoe support | |
CN109347657B (en) | Method for constructing virtual data domain of scientific and technological service under SDN mode | |
Gomes et al. | Bandwidth-aware allocation of resilient virtual software defined networks | |
Cao et al. | Towards tenant demand-aware bandwidth allocation strategy in cloud datacenter | |
CN104735167B (en) | A kind of method and apparatus realized network scheduling function and opened | |
Wang et al. | A survey on resource scheduling for data transfers in inter-datacenter WANs | |
WO2021259246A1 (en) | Resource scheduling method and apparatus, electronic device, and computer-readable storage medium | |
Lu et al. | Elastic scaling of virtual clusters in cloud data center networks | |
CN105335376B (en) | A kind of method for stream processing, apparatus and system | |
Pentelas et al. | Network service embedding for cross-service communication | |
Zheng et al. | An RBF neural network–based dynamic virtual network embedding algorithm | |
Martini et al. | Design and evaluation of SDN-based orchestration system for cloud data centers | |
WO2021000694A1 (en) | Method for deploying services and scheduling apparatus | |
Wen et al. | Towards reliable virtual data center embedding in software defined networking |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |