Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/18791
Title: Fault tolerance using token ring checkpointing in distributed mobile computing systems
Researcher: Kanmani P
Guide(s): Anitha R
Keywords: Computer Science
Upload Date: 29-May-2014
University: Mother Teresa Womens University
Completed Date: 14/03/2013
Abstract: Mobile Computing represents a new paradigm that aims to provide continuous network connectivity to users regardless of their location. The vast computing potential of mobile distributed systems is often hampered by their susceptibility to failures. These failures lead to faults. The goal of designing the fault tolerance sys tem is to ensure that the system as a whole continues to function correctly, even in the presence of faults. Therefore, many techniques have been developed to add reliability and high vailability to distributed systems. Checkpointing is an attractive approach for transparently adding faulttolerance to distributed applications. Checkpointing is primarily used to avoid losing all the useful processing done before a fault has occurred. Checkpointing consists of intermittently saving the state of a program in a reliable storage medium. Mobile computing introduces new challenges in designing checkpointing algorithms that are used to make distributed applications fault-tolerant. Compared to traditional distributed environments, wireless networks are typically slower, providing lower throughput and latency. Additional constraints of lack of stable storage, low bandwidth, limited battery life and disconnections drastically hamper the performance of such algorithms. Recently, more attention has been paid to providing checkpointing protocols for mobile systems. Some of these protocols have been adopted from the traditional distributed environment, while others have been created from scratch for mobile systems.The goal of this research work is to design and implement an efficient non-blocking checkpointing algorithm suitable for distributed mobile systems. The proposed work uses the token ring concept in the checkpointing process. This helps the checkpointing process to minimize the amount of dependent details passed through the network and terminate the process. The token is considered as a checkpoint request message. The checkpoint request is passed through the network.
Pagination: 150p.
URI: http://hdl.handle.net/10603/18791
Appears in Departments:Department of Computer Science

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File8.31 kBAdobe PDFView/Open
02_certificate.pdf8.04 kBAdobe PDFView/Open
03_abstract.pdf22.91 kBAdobe PDFView/Open
04_declaration.pdf6.73 kBAdobe PDFView/Open
05_acknowledgement.pdf10.96 kBAdobe PDFView/Open
06_contents.pdf14.76 kBAdobe PDFView/Open
07_list of tables.pdf7.34 kBAdobe PDFView/Open
08_list of figures.pdf9.91 kBAdobe PDFView/Open
09_abbreviations.pdf8.57 kBAdobe PDFView/Open
10_chapter 1.pdf267.75 kBAdobe PDFView/Open
11_chapter 2.pdf125.6 kBAdobe PDFView/Open
12_chapter 3.pdf68.23 kBAdobe PDFView/Open
13_chapter 4.pdf41.66 kBAdobe PDFView/Open
14_chapter 5.pdf2.75 MBAdobe PDFView/Open
15_chapter 6.pdf48.69 kBAdobe PDFView/Open
16_conclusion.pdf24.63 kBAdobe PDFView/Open
17_bibliography.pdf56.95 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: