Dynamic Bin Packing for On-Demand Cloud Resource Allocation DOTNET
Rs4,500.00
10000 in stock
SupportDescription
Dynamic Bin Packing (DBP) is a variant of classical bin packing, which assumes that items may arrive and depart at arbitrary times. Existing works on DBP generally aim to minimize the maximum number of bins ever used in the packing. In this paper, we consider a new version of the DBP problem, namely, the MinTotal DBP problem which targets at minimizing the total cost of the bins used over time. It is motivated by the request dispatching problem arising from cloud gaming systems.
Only logged in customers who have purchased this product may leave a review.
Reviews
There are no reviews yet.