CN109327422A - A kind of the tenant's partition method and device of multi-tenant - Google Patents
A kind of the tenant's partition method and device of multi-tenant Download PDFInfo
- Publication number
- CN109327422A CN109327422A CN201710647616.1A CN201710647616A CN109327422A CN 109327422 A CN109327422 A CN 109327422A CN 201710647616 A CN201710647616 A CN 201710647616A CN 109327422 A CN109327422 A CN 109327422A
- Authority
- CN
- China
- Prior art keywords
- tenant
- request
- copy
- local data
- service
- 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
- 238000000034 method Methods 0.000 title claims abstract description 31
- 238000005192 partition Methods 0.000 title claims abstract description 16
- 238000002955 isolation Methods 0.000 abstract description 24
- 238000005516 engineering process Methods 0.000 description 11
- 230000007246 mechanism Effects 0.000 description 10
- 241000282813 Aepyceros melampus Species 0.000 description 8
- 238000010586 diagram Methods 0.000 description 3
- 241001269238 Data Species 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000010076 replication Effects 0.000 description 2
- 230000006399 behavior Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/02—Network architectures or network communication protocols for network security for separating internal from external traffic, e.g. firewalls
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5061—Partitioning or combining of resources
- G06F9/5072—Grid computing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5013—Request control
Abstract
The present invention provides the tenant's partition method and device of a kind of multi-tenant, which includes: tenant's partition method of multi-tenant, which is characterized in that the described method includes: receiving the scheduling of resource service request of multiple tenants；The scheduling of resource service request at least carries the service of tenant request and the service arrangement node of tenant request；According to the scheduling of resource service request, n copy of the local data is disposed on the service arrangement node for the tenant request for needing local data according to target copy Distribution Strategy；According to the scheduling of resource service request, scheduling of resource service strategy corresponding with the service of the tenant request is disposed respectively on the service arrangement node of each tenant request；The isolation that the embodiment of the present invention realizes multi-tenant also achieves the data sharing between multi-tenant.
Description
Technical field
The present invention relates to business support fields, more particularly to the tenant's partition method and device of a kind of multi-tenant.
Background technique
With the extensive use of big data technology, (it by Apache (is the world using ranking that Hadoop is one to Hadoop
One web server software) foundation exploitation distributed system infrastructure) have become in current big data field most often
Data storage, processing and the analytical technology seen.Current Hadoop platform is usually that multiple tissues and department's progress are public, is needed
The multi-tenant mechanism of Hadoop is become into big data project, mutually isolated resource is realized, is independent of each other.
At present there are mainly two types of multi-tenant technologies: one is utilize Hadoop itself multi-tenant ability, that is, Hadoop
The multi-tenants isolation technology such as Yarn (Yet Another Resource Negotiator, another resource coordination person), also referred to as
For component level isolation technology.Another kind is IaaS (the Infrastructure as a using virtual machine technique or container technique
Service, i.e. infrastructure are serviced) the progress bottom isolation of layer ability, also referred to as platform class isolation technology.
There are respective disadvantage is as follows for above two multi-tenant technology.
(1) Hadoop multi-tenant mechanism must rely on Yarn operation, and all applications operated on Yarn belong to certain
A tenant's (or being called job queue).Yarn be substantially be provided with for multiple tenants the resources such as storage, memory the upper limit and
Priority rule when multi-tenant resource contention.Tenant each in this way has respective resource quota, is achieved that Hadoop platform
Internal more families isolation.The disadvantages of this solution is: there is only the limitation for the operating system for relying on bottom, and resources by Yarn
Inaccurate isolation also cannot achieve the isolation of platform class (for example, can not such as accomplish that multiple tenants carry out service upgrade, again respectively
It opens, close).
(2) the multi-tenant mechanism of IaaS layers of ability does not depend on Hadoop and its component capability, in OS (operating system) or
The rank of the virtual OS of person realizes isolation.It specifically refers in virtual machine or is holding using IaaS layers of abilities realization multi-tenant mechanism
Different Hadoop examples is disposed on device, gets rid of the limitation of Hadoop itself multi-tenant ability.The solution of this multi-tenant,
Independent of the ability of Hadoop, it is isolated more thorough.The disadvantages of this solution is: the program relies on the ability of IaaS, deployment
IaaS manages platform software, not only increases cost, and deploy multiple Hadoop clusters, and it is total to cannot achieve bottom data
It enjoys.
In conclusion problem of the prior art is: there is only the behaviour for relying on bottom for Hadoop multi-tenant mechanism (Yarn)
Make the limitation of system, and resource isolation is inaccurate, also cannot achieve the isolation of platform class；Utilize more rents of IaaS layers of ability
Family mechanism must rely on the ability of IaaS, and deployment IaaS manages platform software, not only increases cost, and deploy multiple
It is shared to cannot achieve bottom data for Hadoop cluster.
Summary of the invention
The tenant's partition method and device for being designed to provide a kind of multi-tenant of the embodiment of the present invention, to solve existing skill
There is only the limitations for the operating system for relying on bottom for Hadoop multi-tenant mechanism (Yarn) in art, and realize inaccurate
Ground resource isolation also cannot achieve the isolation of platform class；The energy of IaaS must be relied on using the multi-tenant mechanism of IaaS layers of ability
Power, deployment IaaS manage platform software, not only increase cost, and deploy multiple Hadoop clusters, cannot achieve bottom
The problem of data sharing.
To achieve the goals above, tenant's partition method of a kind of multi-tenant provided in an embodiment of the present invention, the method
Include:
Receive the scheduling of resource service request of multiple tenants；The scheduling of resource service request at least carries tenant request
The service arrangement node of service and tenant request；
According to the scheduling of resource service request, according to target copy Distribution Strategy in the tenant request for needing local data
Service arrangement node on dispose n copy of the local data；Wherein, n is the integer more than or equal to 2；
According to the scheduling of resource service request, on the service arrangement node of each tenant request respectively deployment with it is described
The corresponding scheduling of resource service strategy of the service of tenant request.
Wherein, the scheduling of resource service request also carries the instruction information whether instruction tenant needs local data；
It is described according to the scheduling of resource service request, on the service arrangement node for the tenant request for needing local data
The step of disposing n copy of the local data according to target copy Distribution Strategy, comprising:
According to the instruction information, the quantity N for needing the tenant of local data is determined；
The quantity N of the tenant of local data as needed and the service arrangement section for the tenant request for needing local data
Point configures target copy Distribution Strategy；Wherein, the target copy Distribution Strategy includes: the deployment of the quantity n, copy of copy
Node；
Dispose the copy of local data respectively on the deployment node of the copy.
Wherein, the quantity N of the tenant of the local data as needed and the tenant request for needing local data
The step of service arrangement node, configuration target copy Distribution Strategy, comprising:
If desired the service arrangement node of the first tenant request of local data includes the second tenant for needing local data
Whole service arrangement nodes of request obtain the quantity of the second tenant；
The quantity n of configuration copy is equal to the quantity for needing the quantity N of the tenant of local data to subtract the second tenant；
The service arrangement node division that the tenant request of local data will be needed each of other than the second tenant is one
A logical groups obtain m logical groups, and wherein m is equal to n；
It configures and stores a copy in each logical groups, and any one service arrangement node in the logical groups is institute
State the deployment node of copy.
Wherein, if the quantity n of the copy is less than 3, which comprises
Institute is disposed respectively on any n-3 node of all service arrangement nodes for the tenant request for needing local data
State copy.
Wherein, described according to the scheduling of resource service request, on the service arrangement node of each tenant request respectively
After the step of disposing scheduling of resource service strategy corresponding with the service of the tenant request, the method also includes:
The target copy Distribution Strategy and scheduling of resource service strategy correspondence are sent to the multiple tenant.
The embodiment of the present invention also provides a kind of tenant's isolating device of multi-tenant, and described device includes:
Request receiving module, for receiving the scheduling of resource service request of multiple tenants；The scheduling of resource service request
At least carry the service of tenant request and the service arrangement node of tenant request；
Copy deployment module, for being needed according to target copy Distribution Strategy according to the scheduling of resource service request
N copy of the local data is disposed on the service arrangement node of the tenant request of local data；Wherein, n be greater than or
Integer equal to 2；
Scheduling deployment module is used for according to the scheduling of resource service request, in the service arrangement section of each tenant request
Scheduling of resource service strategy corresponding with the service of the tenant request is disposed on point respectively.
Wherein, the scheduling of resource service request also carries the instruction information whether instruction tenant needs local data；
The copy deployment module includes:
First determines submodule, for determining the quantity N for needing the tenant of local data according to the instruction information；
Strategy configuration submodule, the quantity N of the tenant for local data as needed and needs local data
The service arrangement node of tenant request configures target copy Distribution Strategy；Wherein, the target copy Distribution Strategy includes: pair
The deployment node of quantity n originally, copy；
Copy disposes submodule, for disposing the copy of local data respectively on the deployment node of the copy.
Wherein, the strategy configuration submodule includes:
Acquiring unit, the service arrangement node of the first tenant request for if desired local data include to need local number
According to the second tenant request whole service arrangement nodes, obtain the second tenant quantity；
Configuration unit, the quantity n for configuring copy, which is equal to, needs the quantity N of the tenant of local data to subtract second
The quantity of tenant；
Division unit, for the service arrangement of the tenant request of local data will to be needed each of other than the second tenant
Node division is a logical groups, obtains m logical groups, and wherein m is equal to n；
Configuration unit stores a copy for configuring in each logical groups, and any one clothes in the logical groups
Business deployment node is the deployment node of the copy.
Wherein, described device further include:
Deployment unit, if the quantity n for the copy less than 3, in all clothes for the tenant request for needing local data
The copy is disposed respectively on any n-3 node of business deployment node.
Wherein, described device further include:
Sending module, for the target copy Distribution Strategy and scheduling of resource service strategy correspondence to be sent to institute
State multiple tenants.
The above-mentioned technical proposal of the embodiment of the present invention has the beneficial effect that:
In the scheme of the embodiment of the present invention, after each tenant proposes scheduling of resource service request, according to tenant whether needs
Local data does not depend on Yarn bottleneck to need the tenant of local data that target copy Distribution Strategy is arranged and disposing copy, real
Existing data are shared；Different scheduling of resource service strategies is disposed for each tenant simultaneously, the isolation of resource is realized, utilizes in this way
Existing Hadoop technology, under the premise of not depending on lass platform capabilities, the tenant's isolation for accomplishing platform class, and make full use of
Existing Hadoop investment, does not increase lass platform investment budgey.
Detailed description of the invention
Fig. 1 is the flow diagram of tenant's partition method of the multi-tenant of the embodiment of the present invention；
Fig. 2 is the flow diagram of a concrete application in tenant's isolation of the multi-tenant of the embodiment of the present invention；
Fig. 3 is the structural schematic diagram of tenant's isolating device of the multi-tenant of the embodiment of the present invention.
Specific embodiment
To keep the technical problem to be solved in the present invention, technical solution and advantage clearer, below in conjunction with attached drawing and tool
Body embodiment is described in detail.
As shown in Figure 1, the embodiment of the present invention provides a kind of tenant's partition method of multi-tenant, which comprises
Step 11, the scheduling of resource service request of multiple tenants is received；The scheduling of resource service request at least carries rent
The service of family request and the service arrangement node of tenant request.
In this step, scheduling of resource service request, which can be user and log in, to be initiated after multi-tenant manager, can also be with
It is that user is initiated by certain signalings or information, is not specifically limited herein.
Wherein, the service of tenant request includes but is not limited to be distributed merger to calculate MR, distributed memory system Hbase, big
Data query engine Hive, memory iterative calculation frame Spark, big data inquiry library Impala, another resource coordination person
Yarn etc..
Step 12, according to the scheduling of resource service request, local data is being needed according to target copy Distribution Strategy
N copy of the local data is disposed on the service arrangement node of tenant request；Wherein, n is whole more than or equal to 2
Number.
In this step, the effect of copy is also to be further ensured that each local data that needs to guarantee data security
Tenant is able to access that local data, realizes the data sharing between different tenants.It should be noted that n copy needs to dispose
On n service arrangement node.
Step 13, according to the scheduling of resource service request, portion is distinguished on the service arrangement node of each tenant request
Affix one's name to scheduling of resource service strategy corresponding with the service of the tenant request.
In this step, it is the corresponding scheduling of resource service strategy of service arrangement of each tenant request, realizes different tenants
Between data isolation.
To sum up, after each tenant proposes scheduling of resource service request in the above embodiment of the present invention, according to tenant whether
Local data is needed, to need the tenant of local data that target copy Distribution Strategy is arranged and disposing copy, does not depend on Yarn bottles
Neck realizes the shared of data；Different scheduling of resource service strategies is disposed for each tenant simultaneously, realizes the isolation of resource, this
Sample utilizes existing Hadoop technology, under the premise of not depending on lass platform capabilities, the tenant's isolation for accomplishing platform class, and fill
Divide and invested using existing Hadoop, does not increase lass platform investment budgey
Specifically, in the above embodiment of the present invention, the scheduling of resource service request also carries whether instruction tenant needs
Want the instruction information of local data.
Such as after multiple tenants propose scheduling of resource service request, summarize specific requirement required for each tenant, have
The requirement of body is stored in an array service Request (), and wherein service Request is defined as follows:
class service Request()
{
// the service needed, including but not limited to MR, Hbase, Hive, Spark, Impala
String[]service Name；
// instruction information, indicates whether the tenant needs local data
Boolean is Local Data；
Which service arrangement node the // service needs to be deployed on, is usually indicated with host name or IP
String[]nodes；
}
Correspondingly, step 12 includes:
Step 121, according to the instruction information, the quantity N for needing the tenant of local data is determined；
Step 122, the clothes of the quantity N of the tenant of local data as needed and the tenant request for needing local data
Business deployment node, configures target copy Distribution Strategy；Wherein, the target copy Distribution Strategy includes: the quantity n of copy, pair
This deployment node；
Step 123, the copy of local data is disposed respectively on the deployment node of the copy.
Preferably, step 122 in the above embodiment of the present invention, comprising:
If desired the service arrangement node of the first tenant request of local data includes the second tenant for needing local data
Whole service arrangement nodes of request obtain the quantity of the second tenant；That is the service arrangement node of the second tenant request is first
The subset of the service arrangement node of tenant request.For example, according to the service arrangement section of each tenant request for needing local data
The quantity sequence from small to large (or from big to small) of point successively compares the service arrangement node of each tenant request, to determine the
The quantity of two tenants.
For another example the service arrangement node of the first tenant is 1-5 node, the service arrangement node of the second tenant is 1-3
Number node, then the service arrangement node of the second tenant request is the subset of the service arrangement node of the first tenant request.
For example, the specific algorithm of n is as follows:
1.1: setting n=1；
1.2: circuiting sequentially each tenant from small to large according to the number of the service arrangement node of each tenant request.
1.21: if the service department of any one tenant request before currently the service arrangement node of tenant request includes
Affix one's name to node, that is to say, that the service arrangement node of any one tenant request before is the service arrangement section of current tenant request
The subset of point, then this circulation section end, jumps to 1.2；
1.3:n++.
The quantity n of configuration copy is equal to the quantity for needing the quantity N of the tenant of local data to subtract the second tenant；If
The quantity of second tenant is 0, then the quantity n of copy is equal to the quantity N for needing the tenant of local data.
The service arrangement node division that the tenant request of local data will be needed each of other than the second tenant is one
A logical groups obtain m logical groups, and wherein m is equal to n；
It configures and stores a copy in each logical groups, and any one service arrangement node in the logical groups is institute
State the deployment node of copy.
Specifically, every part of local data generates n copy, needs all service arrangement nodes of local data to be divided into m and patrol
Volume group (m is equal to n), includes all service arrangement nodes of corresponding tenant request in each logical groups, when deployment each logic
At least provided with a copy of local data in group.
It should be noted that the data safety in order to guarantee local data, the quantity of copy need to be more than or equal to 3；But
If being (to need the tenant of local data less than 3 according to the quantity n of the copy obtained by the above method provided by the present application
Quantity N subtract value that the quantity of the second tenant obtains less than 3), which comprises
Institute is disposed respectively on any n-3 node of all service arrangement nodes for the tenant request for needing local data
State copy.3-n i.e. other copy is randomly dispersed on any service arrangement node.
Further, in the above embodiment of the present invention after step 13, the method also includes:
The target copy Distribution Strategy and scheduling of resource service strategy correspondence are sent to the multiple tenant.
Corresponding strategy, which is sent a tenant, enables tenant to define which partial data can be shared, which part resource is real
Isolation is showed.
To sum up, this programme accomplishes platform class under the premise of not depending on IaaS platform capabilities using existing Hadoop technology
Tenant isolation.This programme makes full use of existing Hadoop to invest, and does not increase IaaS platform investment budgey.And this programme can
To accomplish the resource isolation of platform class, independent of Yarn bottleneck.In addition, the abundant shared data of this programme, avoids multiple clusters
Isolated data can not share.
As shown in Fig. 2, the application flow of the embodiment of the present invention is exemplified below.
Step 201, user logs in.
Step 202, it chooses whether to need local data.
Step 203, the service needed is selected.
Step 204, the service arrangement node Configuration Type needed according to selection, then specifies specific service arrangement section
Point.
Step 205, apply successfully, user obtains the access entrance address URL, client and the strategy of various services of cluster
Inventory.
The overall flow of the embodiment of the present invention is exemplified below.
Assuming that three tenants respectively represent tri- fields B, O, M, it is used in conjunction with a Hadoop cluster, to realize that data are total
The component enjoyed and respectively used strictly is isolated, and the demand that three tenants propose is summarized as follows first according to the process of this paper:
//Bss tenant wants deployment Yarn, Hive, Impala, Spark, needs local data, resource is strictly limited in 1-
On No. 5 nodes
Bss Service Request(){
String service Name={ Yarn, Hive, Impala, Spark }；
Boolean is Local Data=true；
String [] nodes={ 10.1.1.1,10.1.1.2,10.1.1.3,10.1.1.4,10.1.1.5 }；}
//Oss tenant ratio Bss tenant's multi-section affixes one's name to Hbase, needs local data, resource is strictly limited on 6-11 node
Oss Service Request(){
String service Name={ Yarn, Hive, Impala, Spark, Hbase }；
Boolean is Local Data=true；
String [] nodes=10.1.1.6,10.1.1.7,10.1.1.8,10.1.1.9,10.1.1.10,
10.1.1.11}；}
//Mss tenant only disposes Yarn and Hive, does not need local data, and resource is strictly limited on 1-3 node
Mss Service Request(){
String service Name={ Yarn, Hive }；
Boolean is Local Data=false；
String [] nodes={ 10.1.1.1,10.1.1.2,10.1.1.3 }；}
Firstly, determining the only Bss and Oss tenant for needing local data according to the method for the offer of the embodiment of the present invention；
And the service arrangement node of Oss tenant request and the service arrangement node of Bss tenant request are not mutually subset, the then quantity of copy
N=needs quantity=2 of the tenant of local data, then the quantity m of logical groups is also 2, the service arrangement that a logical groups include
Node is 1-5 node, and the service arrangement node that another logical groups includes is 6-11 node.Then first copy is deployed in
On any one node of 1-5 node, second copy is deployed on any one node of 6-11 node, due to this Shen
It middle please provide that copy amount is more than or equal to 3, then when n is less than 3, using 3 replication policies；Specifically, third copy portion
Administration is determined by the way of random distribution on any one node of 1-11 node, guarantees that it is evenly distributed.
Secondly, disposing the service respectively needed respectively according to the node requirements that each tenant proposes.
After the completion of disposing in this way, three tenant datas can be shared, while various components are independent of each other, independently of each other.Together
When, each tenant still has the mechanism of Yarn, can distribute resource to each user inside tenant.
It assumes again that three tenants respectively represent tri- fields B, O, M, is used in conjunction with a Hadoop cluster, to realize data
Component that is shared and respectively using strictly is isolated, and the demand that three tenants propose is summarized as follows first according to the process of this paper:
//Bss tenant wants deployment Yarn, Hive, Impala, Spark, needs local data, resource is strictly limited in 1-
On No. 5 nodes
Bss Service Request(){
String service Name={ Yarn, Hive, Impala, Spark }；
Boolean is Local Data=true；
String [] nodes={ 10.1.1.1,10.1.1.2,10.1.1.3,10.1.1.4,10.1.1.5 }；}
//Oss tenant ratio Bss tenant's multi-section affixes one's name to Hbase, needs local data, resource is strictly limited on 6-11 node
Oss Service Request(){
String service Name={ Yarn, Hive, Impala, Spark, Hbase }；
Boolean is Local Data=true；
String [] nodes=10.1.1.6,10.1.1.7,10.1.1.8,10.1.1.9,10.1.1.10,
10.1.1.11}；}
//Mss tenant only disposes Yarn and Hive, needs local data, and resource is strictly limited on 1-3 node
Mss Service Request(){
String service Name={ Yarn, Hive }；
Boolean is Local Data=true；
String [] nodes={ 10.1.1.1,10.1.1.2,10.1.1.3 }；}
Only Bss tenant, the Oss of local data is needed to rent firstly, determining according to the method for the offer of the embodiment of the present invention
Family and Mss tenant, but the service arrangement node of Mss tenant request is the subset of the service arrangement node of Bss tenant request,
I.e. the quantity of the second tenant is 1；Then the quantity n=of copy need the quantity of the second tenant of quantity N- of the tenant of local data=
2.Then the quantity m of logical groups is also 2, and the service arrangement node that a logical groups include is 1-5 node, another logical groups packet
The service arrangement node contained is 6-11 node.Then first copy is deployed on any one node of 1-5 node, and second
A copy is deployed on any one node of 6-11 node, due to providing that copy amount is more than or equal to 3 in the application,
Then when n is less than 3, using 3 replication policies；Specifically, third copy is deployed on any one node of 1-11 node,
It is determined by the way of random distribution, guarantees that it is evenly distributed.
Secondly, disposing the service respectively needed respectively according to the node requirements that each tenant proposes.
After the completion of disposing in this way, three tenant datas can be shared, while various components are independent of each other, independently of each other.Together
When, each tenant still has the mechanism of Yarn, can distribute resource to each user inside tenant.
As shown in figure 3, the embodiment of the present invention also provides a kind of tenant's isolating device of multi-tenant, described device includes:
Request receiving module 31, for receiving the scheduling of resource service request of multiple tenants；The scheduling of resource service is asked
Seek the service arrangement node of the service and tenant request that at least carry tenant request；
Copy deployment module 32, for being needed according to target copy Distribution Strategy according to the scheduling of resource service request
Want the n copy that the local data is disposed on the service arrangement node of the tenant request of local data；Wherein, n be greater than or
Person is equal to 2 integer；
Scheduling deployment module 33 is used for according to the scheduling of resource service request, in the service arrangement of each tenant request
Scheduling of resource service strategy corresponding with the service of the tenant request is disposed on node respectively.
Specifically, in the above embodiment of the present invention, the scheduling of resource service request also carries whether instruction tenant needs
Want the instruction information of local data；
The copy deployment module includes:
First determines submodule, for determining the quantity N for needing the tenant of local data according to the instruction information；
Strategy configuration submodule, the quantity N of the tenant for local data as needed and needs local data
The service arrangement node of tenant request configures target copy Distribution Strategy；Wherein, the target copy Distribution Strategy includes: pair
The deployment node of quantity n originally, copy；
Copy disposes submodule, for disposing the copy of local data respectively on the deployment node of the copy.
Specifically, in the above embodiment of the present invention, the strategy configuration submodule includes:
Acquiring unit, the service arrangement node of the first tenant request for if desired local data include to need local number
According to the second tenant request whole service arrangement nodes, obtain the second tenant quantity；
Configuration unit, the quantity n for configuring copy, which is equal to, needs the quantity N of the tenant of local data to subtract second
The quantity of tenant；
Division unit, for the service arrangement of the tenant request of local data will to be needed each of other than the second tenant
Node division is a logical groups, obtains m logical groups, and wherein m is equal to n；
Configuration unit stores a copy for configuring in each logical groups, and any one clothes in the logical groups
Business deployment node is the deployment node of the copy.
Specifically, in the above embodiment of the present invention, described device further include:
Deployment unit, if the quantity n for the copy less than 3, in all clothes for the tenant request for needing local data
The copy is disposed respectively on any n-3 node of business deployment node.
Specifically, in the above embodiment of the present invention, described device further include:
Sending module, for the target copy Distribution Strategy and scheduling of resource service strategy correspondence to be sent to institute
State multiple tenants.
In the scheme of the embodiment of the present invention, after each tenant proposes scheduling of resource service request, according to tenant whether needs
Local data does not depend on Yarn bottleneck to need the tenant of local data that target copy Distribution Strategy is arranged and disposing copy, real
Existing data are shared；Different scheduling of resource service strategies is disposed for each tenant simultaneously, the isolation of resource is realized, utilizes in this way
Existing Hadoop technology, under the premise of not depending on lass platform capabilities, the tenant's isolation for accomplishing platform class, and make full use of
Existing Hadoop investment, does not increase lass platform investment budgey.
It should be noted that tenant's isolating device of multi-tenant provided in an embodiment of the present invention is to be able to carry out above-mentioned more rents
Tenant's isolating device of tenant's partition method at family, then all embodiments of tenant's partition method of above-mentioned multi-tenant are suitable for
The device, and can reach the same or similar friendship effect.
The above is a preferred embodiment of the present invention, it is noted that for those skilled in the art
For, without departing from the principles of the present invention, it can also make several improvements and retouch, these improvements and modifications
It should be regarded as protection scope of the present invention.
Claims (10)
1. a kind of tenant's partition method of multi-tenant, which is characterized in that the described method includes:
Receive the scheduling of resource service request of multiple tenants；The scheduling of resource service request at least carries the service of tenant request
With the service arrangement node of tenant request；
According to the scheduling of resource service request, according to target copy Distribution Strategy the tenant request for needing local data clothes
N copy of the local data is disposed on business deployment node；Wherein, n is the integer more than or equal to 2；
According to the scheduling of resource service request, disposed and the tenant respectively on the service arrangement node of each tenant request
The corresponding scheduling of resource service strategy of the service of request.
2. tenant's partition method according to claim 1, which is characterized in that the scheduling of resource service request, which also carries, to be referred to
Show whether tenant needs the instruction information of local data；
It is described according to the scheduling of resource service request, on the service arrangement node for the tenant request for needing local data according to
The step of target copy Distribution Strategy disposes n copy of the local data, comprising:
According to the instruction information, the quantity N for needing the tenant of local data is determined；
The quantity N of the tenant of local data as needed and the service arrangement node for the tenant request for needing local data,
Configure target copy Distribution Strategy；Wherein, the target copy Distribution Strategy includes: the deployment section of the quantity n of copy, copy
Point；
Dispose the copy of local data respectively on the deployment node of the copy.
3. tenant's partition method according to claim 2, which is characterized in that the rent of the local data as needed
The step of service arrangement node of the quantity N at family and the tenant request for needing local data, configuration target copy Distribution Strategy, packet
It includes:
If desired the service arrangement node of the first tenant request of local data includes the second tenant request for needing local data
Whole service arrangement nodes, obtain the second tenant quantity；
The quantity n of configuration copy is equal to the quantity for needing the quantity N of the tenant of local data to subtract the second tenant；
It is one for the service arrangement node division for needing the tenant request of local data each of other than the second tenant to patrol
Group is collected, m logical groups are obtained, wherein m is equal to n；
It configures and stores a copy in each logical groups, and any one service arrangement node in the logical groups is the pair
This deployment node.
4. tenant's partition method according to claim 3, which is characterized in that described if the quantity n of the copy is less than 3
Method includes:
The pair is disposed respectively on any n-3 node of all service arrangement nodes for the tenant request for needing local data
This.
5. tenant's partition method according to claim 1, which is characterized in that described to be asked according to the scheduling of resource service
It asks, disposes scheduling of resource clothes corresponding with the service of the tenant request respectively on the service arrangement node of each tenant request
It is engaged in after the step of strategy, the method also includes:
The target copy Distribution Strategy and scheduling of resource service strategy correspondence are sent to the multiple tenant.
6. a kind of tenant's isolating device of multi-tenant, which is characterized in that described device includes:
Request receiving module, for receiving the scheduling of resource service request of multiple tenants；The scheduling of resource service request is at least
Carry the service of tenant request and the service arrangement node of tenant request；
Copy deployment module, for needing local according to target copy Distribution Strategy according to the scheduling of resource service request
N copy of the local data is disposed on the service arrangement node of the tenant request of data；Wherein, n is more than or equal to 2
Integer；
Scheduling deployment module is used for according to the scheduling of resource service request, on the service arrangement node of each tenant request
Scheduling of resource service strategy corresponding with the service of the tenant request is disposed respectively.
7. tenant's isolating device according to claim 6, which is characterized in that the scheduling of resource service request, which also carries, to be referred to
Show whether tenant needs the instruction information of local data；
The copy deployment module includes:
First determines submodule, for determining the quantity N for needing the tenant of local data according to the instruction information；
Strategy configuration submodule, the quantity N of the tenant for local data as needed and the tenant for needing local data
The service arrangement node of request configures target copy Distribution Strategy；Wherein, the target copy Distribution Strategy includes: copy
The deployment node of quantity n, copy；
Copy disposes submodule, for disposing the copy of local data respectively on the deployment node of the copy.
8. tenant's isolating device according to claim 7, which is characterized in that the strategy configures submodule and includes:
Acquiring unit, the service arrangement node of the first tenant request for if desired local data include to need local data
Whole service arrangement nodes of second tenant request obtain the quantity of the second tenant；
Configuration unit, the quantity n for configuring copy, which is equal to, needs the quantity N of the tenant of local data to subtract the second tenant
Quantity；
Division unit, for the service arrangement node of the tenant request of local data will to be needed each of other than the second tenant
A logical groups are divided into, m logical groups are obtained, wherein m is equal to n；
Configuration unit stores a copy for configuring in each logical groups, and any one service department in the logical groups
Affix one's name to the deployment node that node is the copy.
9. tenant's isolating device according to claim 8, which is characterized in that described device further include:
Deployment unit, if the quantity n for the copy less than 3, in all service departments for the tenant request for needing local data
It affixes one's name to and disposes the copy respectively on any n-3 node of node.
10. tenant's isolating device according to claim 6, which is characterized in that described device further include: sending module is used
The multiple tenant is sent in corresponding to the target copy Distribution Strategy and the scheduling of resource service strategy.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710647616.1A CN109327422B (en) | 2017-08-01 | 2017-08-01 | Multi-tenant isolation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710647616.1A CN109327422B (en) | 2017-08-01 | 2017-08-01 | Multi-tenant isolation method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109327422A true CN109327422A (en) | 2019-02-12 |
| CN109327422B CN109327422B (en) | 2021-04-02 |
Family
ID=65246025
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710647616.1A Active CN109327422B (en) | 2017-08-01 | 2017-08-01 | Multi-tenant isolation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109327422B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110296000A1 (en) * | 2010-05-28 | 2011-12-01 | James Michael Ferris | Systems and methods for exporting usage history data as input to a management platform of a target cloud-based network |
| CN102340533A (en) * | 2011-06-17 | 2012-02-01 | 中兴通讯股份有限公司 | Multi-tenant system and method for accessing data thereof |
| CN104104513A (en) * | 2014-07-22 | 2014-10-15 | 浪潮电子信息产业股份有限公司 | Safety isolation method for cloud side multi-tenant data storage |
| CN104142864A (en) * | 2014-08-07 | 2014-11-12 | 浪潮电子信息产业股份有限公司 | Multi-tenant performance isolation framework based on virtualization technology |
| CN104270421A (en) * | 2014-09-12 | 2015-01-07 | 北京理工大学 | Multi-user cloud platform task scheduling method supporting bandwidth guarantee |
| CN105827523A (en) * | 2016-06-03 | 2016-08-03 | 无锡华云数据技术服务有限公司 | Virtual gateway capable of dynamically adjusting bandwidths of multiple tenants in cloud storage environment |
| US20160371307A1 (en) * | 2013-01-23 | 2016-12-22 | Microsoft Technology Licensing, Llc | Isolating Resources and Performance in a Database Management System |
| CN106569895A (en) * | 2016-10-24 | 2017-04-19 | 华南理工大学 | Construction method of multi-tenant big data platform based on container |
-
2017
- 2017-08-01 CN CN201710647616.1A patent/CN109327422B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110296000A1 (en) * | 2010-05-28 | 2011-12-01 | James Michael Ferris | Systems and methods for exporting usage history data as input to a management platform of a target cloud-based network |
| CN102340533A (en) * | 2011-06-17 | 2012-02-01 | 中兴通讯股份有限公司 | Multi-tenant system and method for accessing data thereof |
| US20160371307A1 (en) * | 2013-01-23 | 2016-12-22 | Microsoft Technology Licensing, Llc | Isolating Resources and Performance in a Database Management System |
| CN104104513A (en) * | 2014-07-22 | 2014-10-15 | 浪潮电子信息产业股份有限公司 | Safety isolation method for cloud side multi-tenant data storage |
| CN104142864A (en) * | 2014-08-07 | 2014-11-12 | 浪潮电子信息产业股份有限公司 | Multi-tenant performance isolation framework based on virtualization technology |
| CN104270421A (en) * | 2014-09-12 | 2015-01-07 | 北京理工大学 | Multi-user cloud platform task scheduling method supporting bandwidth guarantee |
| CN105827523A (en) * | 2016-06-03 | 2016-08-03 | 无锡华云数据技术服务有限公司 | Virtual gateway capable of dynamically adjusting bandwidths of multiple tenants in cloud storage environment |
| CN106569895A (en) * | 2016-10-24 | 2017-04-19 | 华南理工大学 | Construction method of multi-tenant big data platform based on container |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109327422B (en) | 2021-04-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107579931B (en) | A kind of block chain, that is, Service Source adaptation method based on Kubernetes | |
| US11442762B2 (en) | Systems and methods for introspective application reporting to facilitate virtual machine movement between cloud hosts | |
| CN105354076B (en) | Application deployment method and device | |
| US11218364B2 (en) | Network-accessible computing service for micro virtual machines | |
| US20190332511A1 (en) | Tracking cloud installation information using cloud-aware kernel of operating system | |
| US6597956B1 (en) | Method and apparatus for controlling an extensible computing system | |
| AU769928B2 (en) | Extensible computing system | |
| US8307362B1 (en) | Resource allocation in a virtualized environment | |
| US8819230B2 (en) | Virtual private storage array service for cloud servers | |
| US8606897B2 (en) | Systems and methods for exporting usage history data as input to a management platform of a target cloud-based network | |
| US10705818B2 (en) | Self-moving operating system installation in cloud-based network | |
| US8954564B2 (en) | Cross-cloud vendor mapping service in cloud marketplace | |
| US7146233B2 (en) | Request queue management | |
| US8364744B2 (en) | Software application striping | |
| US20150334696A1 (en) | Resource provisioning method | |
| WO2018205325A1 (en) | Method and system for use in constructing content delivery network platform on heterogeneous resources | |
| CN108924268A (en) | A kind of container cloud service system and pod creation method, device | |
| US20200028911A1 (en) | Data Storage Method and Apparatus | |
| EP2525532A1 (en) | Method and apparatus of connectivity discovery between network switch and server based on vlan identifiers | |
| CN107145380A (en) | Virtual resource method of combination and device | |
| CN109067827A (en) | Based on Kubernetes and OpenStack container cloud platform multi-tenant construction method, medium, equipment | |
| WO2014036717A1 (en) | Virtual resource object component | |
| US10891148B2 (en) | Methods and systems for identifying application components in distributed computing facilities | |
| CN113821268A (en) | Kubernetes network plug-in method fused with OpenStack Neutron | |
| CN109327422A (en) | A kind of the tenant's partition method and device of multi-tenant |
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 | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 310006 No. 288 North Ring Road, Zhejiang, Hangzhou Patentee after: CHINA MOBILE GROUP ZHEJIANG Co.,Ltd. Patentee after: CHINA MOBILE COMMUNICATIONS GROUP Co.,Ltd. Address before: 310006 No. 288 North Ring Road, Zhejiang, Hangzhou Patentee before: CHINA MOBILE GROUP ZHEJIANG Co.,Ltd. Patentee before: CHINA MOBILE COMMUNICATIONS Corp. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231218 Address after: 310006 No. 288 North Ring Road, Zhejiang, Hangzhou Patentee after: CHINA MOBILE GROUP ZHEJIANG Co.,Ltd. Patentee after: China Mobile (Zhejiang) Innovation Research Institute Co.,Ltd. Patentee after: CHINA MOBILE COMMUNICATIONS GROUP Co.,Ltd. Address before: 310006 No. 288 North Ring Road, Zhejiang, Hangzhou Patentee before: CHINA MOBILE GROUP ZHEJIANG Co.,Ltd. Patentee before: CHINA MOBILE COMMUNICATIONS GROUP Co.,Ltd. |