{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:13:21Z","timestamp":1753881201693,"version":"3.41.2"},"reference-count":19,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2009,6,14]],"date-time":"2009-06-14T00:00:00Z","timestamp":1244937600000},"content-version":"vor","delay-in-days":164,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer Networks and Communications"],"published-print":{"date-parts":[[2009,1]]},"abstract":"<jats:p>We have addressed the complex problem of recovery for concurrent failures in distributed computing environment. We have proposed a new approach in which we have effectively dealt with both orphan and lost messages. The proposed checkpointing and recovery approaches enable each process to restart from its recent checkpoint and hence guarantee the least amount of recomputation after recovery. It also means that a process needs to save only its recent local checkpoint. In this regard, we have introduced two new ideas. First, the proposed value of the common checkpointing interval is such that it enables an initiator process to log the minimum number of messages sent by each application process. Second, the determination of the lost messages is always done a priori by an initiator process; besides it is done while the normal distributed application is running. This is quite meaningful because it does not delay the recovery approach in any way.<\/jats:p>","DOI":"10.1155\/2009\/409873","type":"journal-article","created":{"date-parts":[[2009,6,15]],"date-time":"2009-06-15T06:13:50Z","timestamp":1245046430000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Low\u2010Overhead Recovery Approach for  Distributed Systems"],"prefix":"10.1155","volume":"2009","author":[{"given":"B.","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Rahimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2009,6,14]]},"reference":[{"key":"e_1_2_7_1_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1987.232562"},{"key":"e_1_2_7_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00038-7"},{"key":"e_1_2_7_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/214451.214456"},{"key":"e_1_2_7_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/12.588059"},{"key":"e_1_2_7_5_2","doi-asserted-by":"publisher","DOI":"10.1049\/ip-cdt:20020410"},{"key":"e_1_2_7_6_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cdt:20060102"},{"key":"e_1_2_7_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-7315(02)00005-9"},{"key":"e_1_2_7_8_2","doi-asserted-by":"crossref","unstructured":"ElnozahyE. N. JohnsonD. B. andZwaenepoelW. The performance of consistent checkpointing Proceedings of the 11th Symposium on Reliable Distributed Systems (RELDIS \u203292) October 1992 Houston Tex USA 86\u201395 https:\/\/doi.org\/10.1109\/RELDIS.1992.235144.","DOI":"10.1109\/RELDIS.1992.235144"},{"key":"e_1_2_7_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.737697"},{"key":"e_1_2_7_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.910871"},{"key":"e_1_2_7_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.584092"},{"volume-title":"Advanced Concepts in Operating Systems","year":"1994","author":"Singhal M.","key":"e_1_2_7_12_2"},{"volume-title":"Fault Tolerance in Distributed Systems","year":"1994","author":"Jalote P.","key":"e_1_2_7_13_2"},{"key":"e_1_2_7_14_2","doi-asserted-by":"crossref","unstructured":"PowellM. L.andPresottoD. L. Publishing: a reliable broadcast communication mechanism Proceedings of the 9th ACM Symposium on Operating Systems Principles (SOSP \u203283) October 1983 Bretton Woods NH USA 100\u2013109 https:\/\/doi.org\/10.1145\/800217.806618.","DOI":"10.1145\/800217.806618"},{"key":"e_1_2_7_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2008.08.003"},{"key":"e_1_2_7_16_2","unstructured":"JohnsonD. B.andZwaenepoelW. Sender-based message logging Proceedings of the 17th International Symposium on Fault-Tolerant Computing (FTCS \u203287) July 1987 Pittsburgh Pa USA 14\u201319."},{"key":"e_1_2_7_17_2","doi-asserted-by":"crossref","unstructured":"DamaniO. P.andGargV. K. How to recover efficiently and asynchronously when optimism fails Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS \u203296) May 1996 Hong Kong 108\u2013115 https:\/\/doi.org\/10.1109\/ICDCS.1996.507907.","DOI":"10.1109\/ICDCS.1996.507907"},{"key":"e_1_2_7_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3959.3962"},{"key":"e_1_2_7_19_2","doi-asserted-by":"crossref","unstructured":"JuangT.-Y.andVenkatesanS. Efficient algorithm for crash recovery in distributed systems Proceedings of the 10th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS \u203290) December 1990 Bangalore India 349\u2013361.","DOI":"10.1007\/3-540-53487-3_56"}],"container-title":["Journal of Computer Networks and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2009\/409873.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jcnc\/2009\/409873.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2009\/409873","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T14:12:45Z","timestamp":1718633565000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2009\/409873"}},"subtitle":[],"editor":[{"given":"Urs","family":"Bapst","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10.1155\/2009\/409873"],"URL":"https:\/\/doi.org\/10.1155\/2009\/409873","archive":["Portico"],"relation":{},"ISSN":["2090-7141","2090-715X"],"issn-type":[{"type":"print","value":"2090-7141"},{"type":"electronic","value":"2090-715X"}],"subject":[],"published":{"date-parts":[[2009,1]]},"assertion":[{"value":"2008-11-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-03-31","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"409873"}}