Quantum Game Application to Recovery Problem in Mobile Database

Magda M Madbouly,Saad M Darwish,Yasser F Mokhtar

doi:10.3390/sym13111984

Magda M Madbouly, Saad M Darwish + Show 1 more

Open Access

https://doi.org/10.3390/sym13111984

Copy DOI

Abstract

Mobile Computing (MC) is a relatively new concept in the world of distributed computing that is rapidly gaining traction. Due to the dynamic nature of mobility and the limited bandwidth available on wireless networks, this new computing environment for mobile devices presents significant challenges in terms of fault-tolerant system development. As a consequence, traditional fault-tolerance techniques are inherently inapplicable to these systems. External circumstances often expose mobile systems to failures in communication or data storage. In this article, a quantum game theory-based recovery model is proposed in the case of a mobile host’s failure. Several of the state-of-the-art recovery protocols are selected and analyzed in order to identify the most important variables influencing the recovery mechanism, such as the number of processes, the time needed to send messages, and the number of messages logged-in time. Quantum game theory is then adapted to select the optimal recovery method for the given environment variables using the proposed utility matrix of three players. Game theory is the study of mathematical models of situations in which intelligent rational decision-makers face conflicting interests (alternative recovery procedures). The purpose of this study is to present an adaptive algorithm based on quantum game theory for selecting the most efficient context-aware computing recovery procedure. The transition from a classical to a quantum domain is accomplished in the proposed model by treating strategies as a Hilbert space rather than a discrete set and then allowing for the existence of linear superpositions between classical strategies; this naturally increases the number of possible strategic choices available to each player from a numerable to a continuous set. Numerical data are provided to demonstrate feasibility.

Highlights

The mobile database system (MDS) is a client/server database management system provided via the internet that allows for the mobility of the whole processing environment.While the database itself may be static and spread across many sites, data processing nodes such as laptops, PDAs, and cell phones may be mobile and access required data from any place and at any time
Main Results: A As shown in Table 5, the suggested game theory-based recovery model delivers a faster execution time while increasing file size in a variety of mobile settings, depending on the simulation’s changing nature. One reason for these results is that, since the proposed model is based on a knowledge base that was developed after the pre-implementation of each chosen recovery protocol in various simulated settings, it chooses the best appropriate recovery protocol for the present circumstance
Since the proposed model is based on a knowledge base that was created after the pre-implementation of each chosen recovery protocol in various simulated environments, it automatically picks the most appropriate recovery procedure for the present situation

Summary

Introduction

The mobile database system (MDS) is a client/server database management system provided via the internet that allows for the mobility of the whole processing environment.While the database itself may be static and spread across many sites, data processing nodes such as laptops, PDAs, and cell phones may be mobile and access required data from any place and at any time. Client-server application failure recovery needs significant attention due to the scope of its usage. When applied to the mobile computing environment, traditional recovery methods such as checkpointing, logging, and rollback recovery suffer from many limitations [1,2,3,4,5]. Using checkpoint and message logging techniques, the mobile application may roll back to the last reliably stored state and resume execution with recovery assurances. The process for a mobile checkpoint may be coordinated or uncoordinated. Because the MH can independently checkpoint its local state, uncoordinated protocols are preferred for mobile applications [7,8,9]. When an MH attempts to recover from a failure, it makes use of the checkpoint and any previously stored log data. The survey [1,9] compared performance with and without logging

Objectives

Results

Discussion

Conclusion