Download presentation

Presentation is loading. Please wait.

Published byNadia Newby Modified over 2 years ago

1
Anthony Sulistio 1, Kyong Hoon Kim 2, and Rajkumar Buyya 1 Managing Cancellations and No-shows of Reservations with Overbooking to Increase Resource Revenue 1 Dept. of Computer Science and Software Eng. The University of Melbourne, Australia 2 Dept. of Information Science Gyeongsang National University, Korea Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (CCGRID) Presented by: minglung

2
Outline Introduction Overview of Revenue Management Overbooking Policies Capacity Allocation with Overbooking Reservation, Penalty, Denied Cost Performance Evaluation Conclusion and Future Work

3
Introduction (1/2) In Grid, advance reservation (AR) is proposed to ensure the specified resources are available for application’s consumption when needed Problem In reality, users may cancel their reservations before starting time or by not submitting at all (no-show) This causes income loss and lower system utilization Overbooking offers a solution Allowing the resource provider to accept more reservations than the capacity

4
Introduction (2/2) This paper consider two challenging issues Determining the appropriate number of excess reservations Minimizing total compensation cost The contribution of this paper is Introducing three overbooking models to find an ideal overbooking limit that exceeds the maximum capacity Introducing three strategies for selecting which bookings to deny Investigating the impact of the models and strategies on the net resource revenue

5
Overview of Revenue Management (1/2) Why use Revenue Management (RM) ? RM has been widely adopted in various industries with limited and perishable capacity, such as airlines, hotels, and car rentals Grid computing is also suitable since computing powers or nodes are considered to be perishable Market segmentation in Grids (Table 1) VO means Virtual Organizations Price of class i: p i, and p 1 > p 2 > p 3

6
Overview of Revenue Management (2/2) We assume that class 3 users reserve before class 2 users before class 1 users (Figure 1) y i : protection level Protect reservations of class 1, 2 b i : booking limit maxCN: maximum capacity to be reserved The data structure used to administering reservations is a time-slotted data structure

7
Overbooking Policies(1/10) Overbooking can protect a resource provider against cancellation and no-shows (Figure 2) Cancellation: a reservation that is terminated by a user before the service or starting time t s No-show: a reservation that fails to arrive and run on the resource on t s

8
Overbooking Policies(2/10) ob: the overbooking limit Needs to be updated and evaluated frequently as t s approaches The ideal overbooking limit is calculated using… A probability-based policy A risk-based policy A service-level policy And some assumptions should be made Cancellations and no-shows are independent of the number of total bookings The probability of a cancellation only depends on the current time No-shows are treated as cancellations on t s Hence, we can define q(t) as a show rate that reservations show up from the time remaining until t s

9
Overbooking Policies(3/10) A probability-based policy ob is determined statistically based on the probability of shows A risk-based policy Aims to balance the expected cost of denied service with the revenue by accepting more bookings The cost of denied service refers to the compensation money given to users who got rejected at the service time

10
Overbooking Policies(4/10) The cost of denied service is denoted as cost ds and is usually higher than the resource price p A(x): the probability that the demand of users is less than or equal to x, the number of bookings F x (y): the probability that the number of bookings that will show up at the time of service is less than or equal to y Assuming the current booking limit and the capacity are b and C, the expected revenue change by increasing the booking limit from b to b+1 can be derived: Only if demand > b causes revenue change The case that the number of shows ≦ C The case that the number of shows > C

11
Overbooking Policies(5/10) Algorithm 1 calculates the booking limit using risk-based policy The booking limit increases while the expected revenue change is positive

12
Overbooking Policies(6/10) In multiple fare classes, the increased revenue from having an additional booking can not be easily calculated A suitable approach is to determine a weighted average price based on the mean demands μ in each user class Assuming that each customer’s showing probabilities are independent, the show distribution F x (y) at time t is as follows:

13
Overbooking Policies(7/10) A service-level policy Consider the negative impact from the users who got rejected Define a service-level threshold and try not to exceed the threshold B(x): the number of shows for a given x bookings s(x): the service level of x bookings, defined by EQ5 If we use a binomial distribution for show demands… 1 / E[B(x)]E[(B(x) – C) + ]

14
Overbooking Policies(8/10) Algorithm 2 calculates the booking limit using service-level policy The booking limit increases while the service-level not exceeds the threshold

15
Overbooking Policies(9/10) Overbooking limit calculation Price, p = 100 Capacity, C = 50 Denied cost, cost ds : 125 ~ 175 Show-rate, q: 0.60 ~ 0.95 Expected net revenue (ENR) is calculated by EQ7

16
Overbooking Policies(10/10) The service-level policy produces a lower denied- service rate compared to the probability- and risk- based policy

17
Capacity Allocation with Overbooking (1/3) The capacity allocation problem in RM is to decide the booking limit for each class user, in order to maximize the overall expected total revenue Expected marginal seat revenue (EMSR) heuristic is used to determine the booking limits of the three user class (algorithm 3)

18
Capacity Allocation with Overbooking (2/3) Fi(x) denotes the probability that the demand of a class i user is less than or equal to x BookingLimit finds the booking limit of a lower class user

19
Capacity Allocation with Overbooking (3/3) BookingLimit algorithm Expected revenue increase from b l -1 to b l

20
Reservation, Penalty, Denied Cost (1/5) Initial Cost of A Reservation For non-AR jobs dur: duration numCN: the number of CNs used bcost: the base cost of running a job at one time unit For AR jobs numSlot: the total number of reserved slots bcost AR : the cost of running the AR job at one time slot τ : a constant factor ( τ >1) to differentiate the pricing δ : the length of a slot

21
Reservation, Penalty, Denied Cost (2/5) Penalty Cost Penalty rate: α p Penalty cost: α p * (the price for each reservation) 0 ≦ α p ≦ 1 α p = 0: reservation is fully refundable α p = 1: not refundable In multiple fare classes, α p1 < α p2 < α p3

22
Reservation, Penalty, Denied Cost (3/5) Denied cost We use EQ9 to determine cost ds τ ds depends on the agreement or policy set by the resource provider to a particular user class, τ ds > τ Denied-booking strategies Lottery (algorithm 4)

23
Reservation, Penalty, Denied Cost (4/5) Denied Cost First (DCF) (algorithm 5)

24
Reservation, Penalty, Denied Cost (5/5) Lower Class DCF (algorithm 6)

25
Performance Evaluation (1/7) Simulation by GridSim toolkit Simulation setups MIPSExponentialPoisson

26
Performance Evaluation (2/7) Objective: examine the impact of the overbooking policies and the denied-booking strategies on the net revenue of a resource, where cancellations and no-shows are allowed Exponential

27
Performance Evaluation (3/7) Experimental result Negative effect of unanticipated cancellations and no-shows

28
Performance Evaluation (4/7) 6-9% increase in net profits using overbooking strategies On average, DCF gives the highest total amount of income, followed by LC-DCF and then Lottery

29
Performance Evaluation (5/7) The SL policy is the most conservative of all

30
Performance Evaluation (6/7) Lottery strategy works best in reducing total denied bookings From the compensation cost’s point of view, Lottery is the least desirable DCF seems to be a better choice than LC-DCF

31
Performance Evaluation (7/7) LC-DCF has the lowest number of denied Premium users To minimize the negative effects from high-paying users who have been denied access, the combination of SL and LC-DCF policies is a better solution in the long run

32
Conclusion and Future Work Conclusion DCF is best since it has the lowest cost ds and the highest net revenue associated with the SL policy Future work Cancellations and no-shows are dependent of the number of total booking Handling a group cancellation for batch reservations

Similar presentations

OK

Service Level Agreement based Allocation of Cluster Resources: Handling Penalty to Enhance Utility Chee Shin Yeo and Rajkumar Buyya Grid Computing and.

Service Level Agreement based Allocation of Cluster Resources: Handling Penalty to Enhance Utility Chee Shin Yeo and Rajkumar Buyya Grid Computing and.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on taj hotel mumbai Poster templates free download ppt on pollution Download ppt on iron and steel industry in india Ppt on 4th and 5th state of matter Ppt on management by objectives theory Ppt on area of parallelogram and triangles in geometry Free download ppt on nitrogen cycle Ppt on time management for engineering students Ppt on employee engagement strategy Ppt on lower bound theory