Double auctions are considered to be effective price-scheduling mechanisms to resolve cloud resource allocation and service pricing problems. Most of the classical double auction models use price-based mechanisms in which determination of the winner is based on the prices offered by the agents in the market. In cloud ecosystems, the services offered by cloud service providers are inherently time-constrained and if they are not sold, the allocated resources for the unsold services are wasted. Furthermore, cloud service users have time constraints to complete their tasks, otherwise, they would not need to request these services. These features, perishability and time-criticality, have not received much attention in most classical double auction models. In this paper, we propose a cloud priority-based dynamic online double auction mechanism (PB-DODAM), which is aligned with the dynamic nature of cloud supply and demand and the agents’ time constraints. In PB-DODAM, a heuristic algorithm which prioritizes the agents’ asks and bids based on their overall condition and time constraints for resource allocation and price-scheduling mechanisms is proposed. The proposed mechanism drastically increases resource allocation and traders’ profits in both low-risk and high-risk market conditions by raising the matching rate. Moreover, the proposed mechanism calculates the precise defer time to wait for any urgent or high-priority request without sacrificing the achieved performance in resource allocation and traders’ profits. Based on experimental results in different scenarios, the proposed mechanism outperforms the classical price-based online double auctions in terms of resource allocation efficiency and traders’ profits while fulfilling the double auction’s truthfulness pillar.

中文翻译：

---

基于云优先级的动态在线双重拍卖机制（PB-DODAM）

两次拍卖被认为是解决云资源分配和服务定价问题的有效价格计划机制。大多数经典的双重拍卖模型都使用基于价格的机制，在这种机制中，获胜者的确定取决于市场代理商的价格。在云生态系统中，云服务提供商提供的服务本质上受时间限制，如果不出售它们，则会浪费分配给未售出服务的资源。此外，云服务用户有时间限制来完成其任务，否则，他们将不需要请求这些服务。这些特性，易腐性和时间紧迫性在大多数经典的双向拍卖模型中并未得到太多关注。在本文中，我们提出了一种基于云优先级的动态在线双重拍卖机制（PB-DODAM），该机制与云供求的动态性质以及代理商的时间限制相吻合。在PB-DODAM中，提出了一种启发式算法，该算法基于代理商的整体情况和时间约束来优先考虑代理商的要价和出价，以进行资源分配和价格调度机制。通过提高匹配率，该机制在低风险和高风险市场条件下都大大增加了资源分配和交易者的利润。此外，所提出的机制可计算出精确的延迟时间，以等待任何紧急或高优先级的请求，而不会牺牲已实现的资源分配和交易者的利润。根据不同情况下的实验结果，