Most recent issue published online in the International Journal of Web and Grid Services.
International Journal of Web and Grid Services
http://www.inderscience.com/browse/index.php?journalID=47&year=2023&vol=19&issue=4
Inderscience Publishers Ltd
en-uk
support@inderscience.com
International Journal of Web and Grid Services
1741-1106
1741-1114
© 2023 Inderscience Enterprises Ltd.
© 2023 Inderscience Publishers Ltd
editor@inderscience.com
International Journal of Web and Grid Services
https://www.inderscience.com/images/files/coverImgs/ijwgs_scoverijwgs.jpg
http://www.inderscience.com/browse/index.php?journalID=47&year=2023&vol=19&issue=4
-
Efficient renewable energy-based geographical load balancing algorithms for green cloud computing
http://www.inderscience.com/link.php?id=135576
The cloud marketplace is continuously rising as enterprises desire to streamline their processes. As adaptability increases, CSPs expand their data centres to handle any UR size. It increases the fossil fuels consumed in each data centre, increasing the overall cost. Therefore, CSPs are looking for economical ways to reduce fossil fuels. Consequently, three benchmark algorithms were developed in the literature for GLB using renewable energy sources. However, they present the UR using the processor without considering memory. This paper presents two algorithms, PM-FABEF and PM-HAREF, for GCC by incorporating both processor and memory. PM-FABEF determines the processor and memory costs for assigning URs to the data centres and assigns them to the least cost data centre. PM-HAREF determines the highest renewable energy resource slots in processor and memory for assigning the URs. The proposed algorithms are compared with three algorithms using ten datasets to show their superiority in terms of three performance metrics.
Efficient renewable energy-based geographical load balancing algorithms for green cloud computing
Slokashree Padhi; R.B.V. Subramanyam
International Journal of Web and Grid Services, Vol. 19, No. 4 (2023) pp. 401 - 426
The cloud marketplace is continuously rising as enterprises desire to streamline their processes. As adaptability increases, CSPs expand their data centres to handle any UR size. It increases the fossil fuels consumed in each data centre, increasing the overall cost. Therefore, CSPs are looking for economical ways to reduce fossil fuels. Consequently, three benchmark algorithms were developed in the literature for GLB using renewable energy sources. However, they present the UR using the processor without considering memory. This paper presents two algorithms, PM-FABEF and PM-HAREF, for GCC by incorporating both processor and memory. PM-FABEF determines the processor and memory costs for assigning URs to the data centres and assigns them to the least cost data centre. PM-HAREF determines the highest renewable energy resource slots in processor and memory for assigning the URs. The proposed algorithms are compared with three algorithms using ten datasets to show their superiority in terms of three performance metrics.]]>
10.1504/IJWGS.2023.135576
International Journal of Web and Grid Services, Vol. 19, No. 4 (2023) pp. 401 - 426
Slokashree Padhi
R.B.V. Subramanyam
Department of Computer Science and Engineering, National Institute of Technology Warangal, Warangal †506004, Telangana, India ' Department of Computer Science and Engineering, National Institute of Technology Warangal, Warangal †506004, Telangana, India
cloud computing
geographical load balancing
GLB
renewable energy
non-renewable energy
user request
data centre
overall cost
2023-12-18T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
19
4
401
426
2023-12-18T23:20:50-05:00
-
A fairness aware service recommendation method in service ecosystem
http://www.inderscience.com/link.php?id=135573
With the rapid development of internet technology, the number of services with the same or similar functions on the internet has increased explosively. How to provide users with more accurate service recommendation is one of the hot issues in academia and industry. However, most of the existing recommendation methods tend to recommend popular services to users, which result into serious polarisation and become a barrier for the unpopular services to startup and growth. To solve this problem, we propose a fairness aware service recommendation (FASR), which pays attention to the fair treatment of unpopular services in the process of service recommendation. FASR addresses both accuracy and fairness, and designs different recommendation algorithms for popular and unpopular services respectively. A large number of experiments and analyses show that FASR can significantly improve the fairness of recommendations with little impact on accuracy in the evolving service ecosystem.
A fairness aware service recommendation method in service ecosystem
Qiliang Zhu; Yaoling Fan; Shangguang Wang
International Journal of Web and Grid Services, Vol. 19, No. 4 (2023) pp. 427 - 445
With the rapid development of internet technology, the number of services with the same or similar functions on the internet has increased explosively. How to provide users with more accurate service recommendation is one of the hot issues in academia and industry. However, most of the existing recommendation methods tend to recommend popular services to users, which result into serious polarisation and become a barrier for the unpopular services to startup and growth. To solve this problem, we propose a fairness aware service recommendation (FASR), which pays attention to the fair treatment of unpopular services in the process of service recommendation. FASR addresses both accuracy and fairness, and designs different recommendation algorithms for popular and unpopular services respectively. A large number of experiments and analyses show that FASR can significantly improve the fairness of recommendations with little impact on accuracy in the evolving service ecosystem.]]>
10.1504/IJWGS.2023.135573
International Journal of Web and Grid Services, Vol. 19, No. 4 (2023) pp. 427 - 445
Qiliang Zhu
Yaoling Fan
Shangguang Wang
College of Information Engineering, North China University of Water Resources and Electric Power, Zhengzhou 450046, China ' College of Information Engineering, North China University of Water Resources and Electric Power, Zhengzhou 450046, China ' The State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
fairness
service recommendation
service ecosystem
bias matrix factorisation
2023-12-18T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
19
4
427
445
2023-12-18T23:20:50-05:00
-
An energy-aware negotiation protocol for live migration of virtual machines
http://www.inderscience.com/link.php?id=135581
The energy consumption of information systems, especially scalable systems like clouds is required to be reduced to realise green computing systems. In an approach, the energy consumption of servers is decreased by the migration of virtual machines to more energy-efficient guest servers. We take a distributed approach that each server autonomously negotiates with other servers on the live migration of virtual machines. In this paper, we newly propose a migration negotiation for virtual machines (MNVM) protocol for doing the negotiation on the migration of virtual machines among servers. We propose NRB and NEA algorithms to do the energy-efficient live migration of virtual machines by taking advantage of the MNVM protocol. In the evaluation, the total energy consumption of the servers and the average execution time of processes are shown to be smaller in the NRB and NEA algorithms than non-migration algorithms.
An energy-aware negotiation protocol for live migration of virtual machines
Dilawaer Duolikun; Tomoya Enokido; Makoto Takizawa
International Journal of Web and Grid Services, Vol. 19, No. 4 (2023) pp. 446 - 462
The energy consumption of information systems, especially scalable systems like clouds is required to be reduced to realise green computing systems. In an approach, the energy consumption of servers is decreased by the migration of virtual machines to more energy-efficient guest servers. We take a distributed approach that each server autonomously negotiates with other servers on the live migration of virtual machines. In this paper, we newly propose a migration negotiation for virtual machines (MNVM) protocol for doing the negotiation on the migration of virtual machines among servers. We propose NRB and NEA algorithms to do the energy-efficient live migration of virtual machines by taking advantage of the MNVM protocol. In the evaluation, the total energy consumption of the servers and the average execution time of processes are shown to be smaller in the NRB and NEA algorithms than non-migration algorithms.]]>
10.1504/IJWGS.2023.135581
International Journal of Web and Grid Services, Vol. 19, No. 4 (2023) pp. 446 - 462
Dilawaer Duolikun
Tomoya Enokido
Makoto Takizawa
Hosei University, Tokyo, Japan ' Faculty of Business Administration, Rissho University, Tokyo, Japan ' RCCMS, Hosei University, Tokyo, Japan
green computing systems
live migration of virtual machine
energy consumption
MNVM protocol
MLE algorithm
2023-12-18T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
19
4
446
462
2023-12-18T23:20:50-05:00
-
Providing data security using DNA computing in the cloud computing environment
http://www.inderscience.com/link.php?id=135587
With the exponential growth of data in the digital era, storing and accessing sensitive information securely has become a paramount concern. As a result, it is important to explore new and innovative ways to secure data in a cloud computing environment by utilising advanced encryption and decryption techniques. Recently, deoxyribonucleic acid (DNA) computing has emerged as a promising field that has the potential to revolutionise the way data are processed and stored. In this paper, a novel approach using DNA computing is proposed to improve data security in the cloud computing environment. Here, a 512-bit DNA-based secret key is generated by the data owners, which is utilised for data encryption before outsourcing it to the cloud server. Several encoding rules and operations are employed to make the data encryption process secure. Experimental performance analysis and security analysis of the proposed scheme show its efficiency over the existing schemes.
Providing data security using DNA computing in the cloud computing environment
Tarun Kumar; Suyel Namasudra; Prabhat Kumar
International Journal of Web and Grid Services, Vol. 19, No. 4 (2023) pp. 463 - 486
With the exponential growth of data in the digital era, storing and accessing sensitive information securely has become a paramount concern. As a result, it is important to explore new and innovative ways to secure data in a cloud computing environment by utilising advanced encryption and decryption techniques. Recently, deoxyribonucleic acid (DNA) computing has emerged as a promising field that has the potential to revolutionise the way data are processed and stored. In this paper, a novel approach using DNA computing is proposed to improve data security in the cloud computing environment. Here, a 512-bit DNA-based secret key is generated by the data owners, which is utilised for data encryption before outsourcing it to the cloud server. Several encoding rules and operations are employed to make the data encryption process secure. Experimental performance analysis and security analysis of the proposed scheme show its efficiency over the existing schemes.]]>
10.1504/IJWGS.2023.135587
International Journal of Web and Grid Services, Vol. 19, No. 4 (2023) pp. 463 - 486
Tarun Kumar
Suyel Namasudra
Prabhat Kumar
Department of Computer Science and Engineering, National Institute of Technology Patna, Bihar, India ' Department of Computer Science and Engineering, National Institute of Technology Patna, Bihar, India ' Department of Computer Science and Engineering, National Institute of Technology Patna, Bihar, India
DNA-based cryptography
Morse pattern
decimal encoding rules
ASCII values
DNA-based XOR operation
2023-12-18T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
19
4
463
486
2023-12-18T23:20:50-05:00
-
Web service selection method based on blockchain smart contracts
http://www.inderscience.com/link.php?id=135589
In recent years, as more services become available on the internet, selecting the best quality services from a group of similar web services and ensuring their authenticity remains a challenge. This paper proposes a blockchain-based service selection method that combines blockchain and service selection to provide a decentralised and trustworthy service selection platform. A smart contract is designed and deployed on the blockchain to help solve service selection problems and prevent information tampering. The moth-flame optimisation algorithm is improved by introducing the mutation and crossover of the differential evolution algorithm for service selection on the blockchain. The experimental results demonstrate that the proposed method effectively prevents service quality tampering and reduces service prices compared to traditional service selection methods and other metaheuristic algorithms.
Web service selection method based on blockchain smart contracts
Yingying Ning; Jing Li; Ming Zhu
International Journal of Web and Grid Services, Vol. 19, No. 4 (2023) pp. 487 - 515
In recent years, as more services become available on the internet, selecting the best quality services from a group of similar web services and ensuring their authenticity remains a challenge. This paper proposes a blockchain-based service selection method that combines blockchain and service selection to provide a decentralised and trustworthy service selection platform. A smart contract is designed and deployed on the blockchain to help solve service selection problems and prevent information tampering. The moth-flame optimisation algorithm is improved by introducing the mutation and crossover of the differential evolution algorithm for service selection on the blockchain. The experimental results demonstrate that the proposed method effectively prevents service quality tampering and reduces service prices compared to traditional service selection methods and other metaheuristic algorithms.]]>
10.1504/IJWGS.2023.135589
International Journal of Web and Grid Services, Vol. 19, No. 4 (2023) pp. 487 - 515
Yingying Ning
Jing Li
Ming Zhu
College of Computer Science and Technology, Shandong University of Technology, Zibo, China ' College of Computer Science and Technology, Shandong University of Technology, Zibo, China ' College of Computer Science and Technology, Shandong University of Technology, Zibo, China
blockchain
smart contract
service selection
quality of service
QoS
moth-flame optimisation
MFO
web service
2023-12-18T23:20:50-05:00
Copyright © 2023 Inderscience Enterprises Ltd.
19
4
487
515
2023-12-18T23:20:50-05:00