Double Auction Protocols for Resource Allocation in Grids
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Profitable services in an uncertain world
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Why markets could (but don't currently) solve resource allocation problems in systems
HOTOS'05 Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10
Using Revenue Management to Determine Pricing of Reservations
E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing
Routing and wavelength assignment of scheduled lightpath demands
IEEE Journal on Selected Areas in Communications
Towards an optimized abstracted topology design in cloud environment
Future Generation Computer Systems
An economic agent maximizing cloud provider revenues under a pay-as-you-book pricing model
GECON'12 Proceedings of the 9th international conference on Economics of Grids, Clouds, Systems, and Services
| Hi-index | 0.00 |
Grid services provisioning requires the definition of suited business models taking into account the expectations of both end-users and service providers. Traditional resource management techniques mainly deal with end-users requirements but neglect the benefit that service providers may expect from the sharing of their equipments. In this paper, we propose a fairer management algorithm defending the interests of both end-users and service providers. We consider scheduled jobs in the context of layer-2 Virtual Private Networks (VPN). In practice, the instant of activation of a scheduled job may vary over a certain time window. Depending on the requirements and the budgets of end-users, the size of this time window may fluctuate, the job computing delay being fixed a priori. Our motivation is two-fold. First, we expect to serve a higher number of end-users while respecting each user's job utility. Second, we aim to increase as best as possible the benefit of service providers. For that purpose, we introduce a weighted cost function enabling a service differentiation relying on time constraints disparity of the submitted jobs. Two approaches are considered to solve this problem: an exact Integer Linear Programming (ILP) formulation and a metaheuristic inspired from the Simulated Annealing (SA) algorithm. The obtained numerical results outline the impact of the flexible time window on the system performance, namely the number of executed jobs and the gain of the service provider.