000			04847ntm a2200373 i 4500
999			_c99311 _d99317
003			MY-KuUP
005			20251125110724.0
006			t||||fr|||| 000 0
007			ta
008			230404t20222022my a|||fr|||| 000 0 eng d
020			_aTHE0009558 (Local) _qHardback
040			_aUMP _beng _cUMP _erda
090			_aFKOM .A23 2022 r Thesis
100	0		_aAbdullah Fairuzullah Ahmad Tajuddin, _eauthor.
245	1	0	_aBinary vote assignment grid quorum with load balancing algorithm for managing replication in distributed database systems / _cAbdullah Fairuzullah Bin Ahmad Tajuddin
264		1	_aKuantan, Pahang : _bUMP, _c2022
264		1	_c© 2022
300			_axiv, 184 pages : _billustrations (some color) ; _c30 cm. + _e1 CD-ROM
336			_2rdacontent _atext
336			_2rdacontent _atext
337			_2rdamedia _aunmediated
337			_2rdamedia _acomputer
338			_2rdacarrier _avolume
338			_2rdacarrier _acomputer disc
347			_2rda _atext file _bPDF
500			_aFaculty of Computing
502			_aThesis (Doctor of Philosophy) -- Universiti Malaysia Pahang – 2022
504			_aIncludes bibliographical references
520	3		_aDistributed Database Systems deals with the efficient data management, placement and replication of large scale of data. There is a common need to be able to manage large facilities. One way to preserve data availability and reliability is through replication. The research problems that arise are how to derive the mechanisms to ensure the availability optimistic replication, where all concurrent updates are allowed to go through, with inconsistencies possibly created, and the results are merged or resolved later. different replicated servers sae time. The updates are propagated towards the other replicas called secondary copies. The problem with this technique is that it uses asynchronous replication. Thus, the technique cannot support critical data in real-time grid computing applications. Binary Vote Assignment Grid Quorum (BVAGQ) Transaction Semantic combines replication and transaction in distributed databases without considering data velocity and load balancing. The existed BVAGQ Algorithm only manage replication and distributed transactions without handle load balancing mechanism to handle high transaction and preserve data availability through synchronous replication. BVAGQ algorithm has been proposed by adopting the Firefly Algorithm to manage the high-speed transactions and replication of distributed databases. This research proposes a Binary Vote Assignment Grid Quorum with Load Balancing (BVAGQ-LB) and analyzes the performance of the proposed algorithm to ensure correctness. This is because the existing BVAGQ algorithm only manages replication and distributed transactions without handling load balancing mechanism to manage data velocity and preserve data availability through synchronous replication. This research methodology expand and modified the three definitions of Firefly Algorithm (FA), which are: add Metadata Library(ML) and modify the distance and attractiveness of fireflies. The outcome of this research is the BVAGQ-LB algorithm, which can manage replication with load balancing in distributed database environments. Experimental results show that BVAGQ-LB produced more competitive results compared to the existing load balancing algorithms such as Round Robin (RR), First Come First Serve (FCFS), Particle Swarm Optimization (PSO) and original Firefly Algorithm (FA). Thus, BVAGQ-LB provides three times more cost saving feature compared to the others. They are three contribution of the research. The first one is the new load balancing technique for for BVAGQ called Binary Vote Assignment Grid Quorum with Load Balancing (BVAGQ-LB). The second contribution is that BVAGQ-LB was developed for managing high-speed transactions and replication in distributed databases which minimizes the makespan, hence, balances the load of computer resources. The third contribution is that the experimental results show BVAGQ-LB to produce more competitive results compared to the existing load balancing algorithms such as Round Robin (RR), First Come First Serve (FCFS), Particle Swarm Optimization (PSO) and Firefly Algorithm (FA). BVAGQ-LB provides three times cost saving compared to the others. This research try to minimize the task execution time by reducing the nodes’ idle time. This Research also evaluate the proposed methods in different scenarios by using BVAGQ-LB Evaluations results show that proposed methods decrease idle time significantly while being scalable to network size and applicable in heterogeneous networks with dynamic resources and configuration.
610	2	0	_aFaculty of Computing _xDissertations
650		0	_aUniversities and colleges _xDissertations
650		0	_aTheses
942			_2lcc _cRESTRICT