New Mechanism for Reservation in Cloud Computing

摘要: In this paper, we study the problem of designing new mechanism for selling reserved instances in cloud computing. Our goal is to maximize social welfare. We propose a prompt sense that acceptance and payment job determined at very moment its arrival. show mechanisms has competitive ratio O(ln (kT)) under some mild assumption, where k (res. T) maximum between per-instance-hour valuation length) any two jobs.We then prove no algorithm can achieve better than ln (2kT) same assumption. Therefore, our optimal within constant factor.