Multi-tenant fair share in NoSQL data stores

NoSQL data stores see considerable attention today in big data, cloud hosted environments because of their fault tolerance, distribution and high availability. Shared NoSQL data stores are preferred for their ability to serve multiple tenants simultaneously which can improve resource utilization and lower management costs. Fair share in this setting can be a problem in that NoSQL data stores can be weak in preventing interference between tenants. We propose a methodology for multi-tenant fair share in a NoSQL store, in particular Cassandra. The approach uses an extended version of the deficit round robin algorithm to schedule tenant requests, and has local weight adjustment and slow tenant handling to improve the system throughput. Empirical results show that our approach is able to provide fair share for multi-tenancy.