Efficient rollback recovery algorithm for distributed mobile computing systems

One major breakthrough on the communication society recently is the extension of networking from wired to wireless networks. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. Obviously, wireless networ...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE International Performance, Computing, and Communications Conference
Hlavní autoři: Juang, Tong-Ying Tony, Chen, Yuh-Shyan
Médium: Journal Article
Jazyk:angličtina
Vydáno: 01.01.2000
ISSN:1097-2641
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract One major breakthrough on the communication society recently is the extension of networking from wired to wireless networks. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. Obviously, wireless networks do have some fundamental differences from wired networks that need to be paid special attention of, such as lower communication bandwidth compared to wired networks, limited electrical power due to battery capacity, and mobility of processes. These new issues make traditional recovery algorithm unsuitable. In order to cope with these problems, the tasks of logging and recovery procedure are performed by the MSSs. In this paper, we propose an efficient algorithm with O(n sub(r)) message complexity where O(n sub(r)) is the total number of mobile hosts (MHs) related to the failed MH. In addition, these MHs only need to rollback once and can immediately resume its operation without waiting for any coordination message from other MHs. During normal operation, the application message needs O(1) additional information when it transmitted between MHs and mobile support stations (MSSs). Each MSS must keep an n sub(total_h)*n sub(cell_h) dependency matrix, where O(n sub(total_h)) is the total number of MHs in the system and n sub(cell_h) is the total number of MHs in its cell.
AbstractList One major breakthrough on the communication society recently is the extension of networking from wired to wireless networks. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. Obviously, wireless networks do have some fundamental differences from wired networks that need to be paid special attention of, such as lower communication bandwidth compared to wired networks, limited electrical power due to battery capacity, and mobility of processes. These new issues make traditional recovery algorithm unsuitable. In order to cope with these problems, the tasks of logging and recovery procedure are performed by the MSSs. In this paper, we propose an efficient algorithm with O(n sub(r)) message complexity where O(n sub(r)) is the total number of mobile hosts (MHs) related to the failed MH. In addition, these MHs only need to rollback once and can immediately resume its operation without waiting for any coordination message from other MHs. During normal operation, the application message needs O(1) additional information when it transmitted between MHs and mobile support stations (MSSs). Each MSS must keep an n sub(total_h)*n sub(cell_h) dependency matrix, where O(n sub(total_h)) is the total number of MHs in the system and n sub(cell_h) is the total number of MHs in its cell.
Author Chen, Yuh-Shyan
Juang, Tong-Ying Tony
Author_xml – sequence: 1
  givenname: Tong-Ying
  surname: Juang
  middlename: Tony
  fullname: Juang, Tong-Ying Tony
– sequence: 2
  givenname: Yuh-Shyan
  surname: Chen
  fullname: Chen, Yuh-Shyan
BookMark eNotzLlOwzAYAGAPRaItvIMntkg-kjgeUVUOqYKle-Xjd-viI9gOUt-eAaZv-zZolXKCFVpTIkXHxp7eo02tV0IIn5hYo4-9c954SA2XHIJW5gsXMPkHyg2rcM7Ft0vELhdsfW3F66WBxTFrHwCbHOel-XTG9VYbxPqA7pwKFR7_3aLjy_64e-sOn6_vu-dDN0vZusFJochoQVnqWM-0m0YrjWVAYCQjVz0ZqHNcaD5YQY0ZqFATZWxitldU8S16-mvnkr8XqO0UfTUQgkqQl3piYiCSM85_ARlYTg4
ContentType Journal Article
DBID 7SC
8FD
JQ2
L7M
L~C
L~D
DatabaseName Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
GroupedDBID 6IH
6IK
6IL
6IM
6IN
7SC
8FD
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CHZPO
IPLJI
JQ2
L7M
L~C
L~D
OCL
RIE
RIL
ID FETCH-LOGICAL-p99t-5f97a06dead1f242bf86d9cd2e0e6063a4051ff37b35d71cc517a812282d4a1a3
ISSN 1097-2641
IngestDate Fri Jul 11 06:27:03 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-p99t-5f97a06dead1f242bf86d9cd2e0e6063a4051ff37b35d71cc517a812282d4a1a3
Notes SourceType-Scholarly Journals-2
ObjectType-Feature-2
ObjectType-Conference Paper-1
content type line 23
SourceType-Conference Papers & Proceedings-1
ObjectType-Article-3
PQID 27509323
PQPubID 23500
ParticipantIDs proquest_miscellaneous_27509323
PublicationCentury 2000
PublicationDate 20000101
PublicationDateYYYYMMDD 2000-01-01
PublicationDate_xml – month: 01
  year: 2000
  text: 20000101
  day: 01
PublicationDecade 2000
PublicationTitle IEEE International Performance, Computing, and Communications Conference
PublicationYear 2000
SSID ssj0003827
Score 1.2824429
Snippet One major breakthrough on the communication society recently is the extension of networking from wired to wireless networks. This has made possible creating a...
SourceID proquest
SourceType Aggregation Database
Title Efficient rollback recovery algorithm for distributed mobile computing systems
URI https://www.proquest.com/docview/27509323
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Xplore
  issn: 1097-2641
  databaseCode: RIE
  dateStart: 19970101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://ieeexplore.ieee.org/
  omitProxy: false
  ssIdentifier: ssj0003827
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtZ3PT4MwFMcbNR70YPwZf9uD8bKQ0DFWejRmxsOCJmKynZa20G1RYY5h9L_3tSsM9aAevBBCBgQ-o_2-1_cDofM2Za4ShDsgVsFACSSMg4rDh-cloA-4Ai7SNJugYRj0euzO9svLTTsBmqbB2xub_CtqOAawdersH3BXF4UDsA_QYQvYYfsr8B1TFEIv8U-BseDysaGtXniO9wZ_GmbT8Wz0bKILY100V_e7AtH5nAkYH0yEeWEiofNaKXMrXrVh-MWFeLfIOzAu1_L0Mij0U_5JXssvrCJ3CuuwjrJ06PT1nWGv8vNf2eSRfjFy7kfv9q9ceincmpdiPrC6jOpoOrKYd8q19vB2cP3Q7Q6iTi-6mLw4uiOYXjm37VGW0bLntuaZedUc6wWmGW911W8zqZEH0SbasLoeX855bKGlJN1G67VqjzsorMjgkgwuyeCKDIb3iWtk8JwMrshgS2YXRded6OrGse0snAljM8dXjHK3HcOnSxQII6GCdsxk3EzcBKxIj4N0Jkp5VHh-TImUPqEc5BfYxHGLE-7toZU0S5N9hEWT-ZKQxKUiaHHpMl3Fhygh9Kpni5EDdFa-jQGMFnoJiKdJVuQDXc0fFLt3-OMvjtDaguMxWplNi-QErcrX2TifnhoaHwz6QKY
linkProvider IEEE
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+rollback+recovery+algorithm+for+distributed+mobile+computing+systems&rft.jtitle=IEEE+International+Performance%2C+Computing%2C+and+Communications+Conference&rft.au=Juang%2C+Tong-Ying+Tony&rft.au=Chen%2C+Yuh-Shyan&rft.date=2000-01-01&rft.issn=1097-2641&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1097-2641&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1097-2641&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1097-2641&client=summon