An improved PBMM Algorithm by Reduce Cloud Data Traffic and Transfer Costs in Cloud of Things
Abdulrahman Mohammed Hussein Obaid1, Santyyosh Kumar Pani2, Prasant Kumar Pattnaik3,

1Abdulrahman Mohammed Hussein Obaid*, School of Computer Science and Engineering in KIIT University, India.
2Santosh Kumar Pani, School of Computer Science and Engineering in KIIT University, India.
3Prasant Kumar Pattnaik, School of Computer Science and Engineering in KIIT University, India, 

Manuscript received on October 14, 2019. | Revised Manuscript received on 23 October, 2019. | Manuscript published on November 10, 2019. | PP: 2688-2699 | Volume-9 Issue-1, November 2019. | Retrieval Number: A4839119119/2019©BEIESP | DOI: 10.35940/ijitee.A4839.119119
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: Cloud computing has been widely studied over the recent years. Researchers have developed different algorithms for improving the performance and minimizing the cost. This paper proposes a new algorithm to improve and enhance the PBMM algorithm (Priority Based on Min-Min Algorithm). The proposed algorithm works with the aid of one of the Cloud of Things (CoT) services; this service is Sensing and Actuation as a Service (SAaaS). The proposed Algorithm works on third-party broker. However, it has two-phase: the first phase is Sensing: in this phase, the sensor observes the throughput for all tasks and compares it with the link capacity. The Second phase is Actuation: depending on the comparison in the first phase, the priority of all the takes will change depending on the link capacity, all tasks will have the same priority if the throughput is low (Green throughput). All tasks will have two priority levels (high, low) if the throughput medium (Yellow throughput), and finally, if the throughput is high (red throughput) all tasks will have a default priority which assigned to them when they are created. However, the efficiency and performance of the IPBMM algorithm depend on the capacity of the link. If capacity is high (traffic in the network is high), the performance is very good and the costly, but if the capacity is medium (traffic in the network is medium), the performance is good as well as the cost. While if the capacity is low (traffic in the network is low), the performance is good and the cost is free. Therefore, the outcomes of the proposed algorithm experiment given 30% better results than the PBMM algorithm and other state-of-the-art algorithms.
Keywords: Cloud Computing, Cloud of Things, Cloud Task Scheduling, PBMM Algorithm, User-Priority.
Scope of the Article: Cloud Computing