DocumentCode
632454
Title
Message rearrange theory in message recovery protocol
Author
Jing Cai ; Shenfa Gao
Author_Institution
Comput. Sci. & Technol., Shandong Univ., Jinan, China
fYear
2013
fDate
27-28 March 2013
Firstpage
293
Lastpage
297
Abstract
In optimistic message protocols, the receiving order of not logged messages and their payloads may be lost because of process failures. To address the lost order of received but not logged messages, our paper proposes a message rearranging theory with improved logic clock. With improved logic clock, our protocol rearranges lost messages as an equivalent message receiving sequence on the assumption of PWD. Once process failures occur, our recovery protocol first determines the lost messages with message number check theory and then restores them by logging files. Then the recovery protocol rearranges those lost messages, forms an equivalent message sequence and replaces the original one during failure-free process execution. There are two main advantages of our protocol: first only failed processes rollback and not failed processes can ongoing; second our protocol can deal with more than one failure.
Keywords
message passing; protocols; PWD assumption; failure-free process execution; logged message; logic clock; message number check theory; message rearrange theory; message recovery protocol; message sequence; optimistic message protocol; Clocks; Computer science; Conferences; Economic indicators; Information technology; Protocols; Reliability; distributed system; message logging; rollback rcoverye;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Information Technology (CSIT), 2013 5th International Conference on
Conference_Location
Amman
Type
conf
DOI
10.1109/CSIT.2013.6588794
Filename
6588794
Link To Document