Low-cost coordinated nonblocking checkpointing in mobile computing systems

A mobile computing system consists of mobile and stationary nodes. Checkpointing in mobile systems faces many new challenges, such as low wireless bandwidth, frequent disconnections and lack of stable storage at mobile nodes. Previously proposed checkpoint algorithms for mobile environments do not t...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Weigang Ni, Vrbsky, S.V., Ray, S.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Bandwidth Checkpointing Computer applications Computer science Distributed computing Joining processes Mobile communication Mobile computing Personal digital assistants Wireless communication
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	1434 vol.2
container_issue
container_start_page	1427
container_title
container_volume
creator	Weigang Ni Vrbsky, S.V. Ray, S.
description	A mobile computing system consists of mobile and stationary nodes. Checkpointing in mobile systems faces many new challenges, such as low wireless bandwidth, frequent disconnections and lack of stable storage at mobile nodes. Previously proposed checkpoint algorithms for mobile environments do not take into consideration the coordinating message overhead of the mobile participants. In this paper, we propose a new checkpoint algorithm for mobile distributed systems. Our algorithm is nonblocking and minimizes the number of checkpoint participants. We propose a new idea called proxy coordinator. By using proxy coordinator, mobile participants' coordinating message overhead is minimized to O(1), which can otherwise be as high as O(n) in other proposed algorithms.
doi_str_mv	10.1109/ISCC.2003.1214313
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1214313</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1214313</ieee_id><sourcerecordid>1214313</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-728954204dfaa328e38843ce541e735f9ecc8b4b6ea4ca48b8fc5ca09b40ba453</originalsourceid><addsrcrecordid>eNotkMtKxDAYhYMXsI7zAOKmL5Caa5MspXgZKbhQ10OS_tU4bVKaiszbe5vV4XwcvsVB6JKSilJirjfPTVMxQnhFGRWc8iNUsFowrLg2x2htlCaqNpKamtYnqKCSE0y5qM_Qec4fhBAtmSrQY5u-sE95KX1KcxeiXaArY4puSH4X4lvp38HvphTi8ttCLMfkwgA_-3H6_GN5nxcY8wU67e2QYX3IFXq9u31pHnD7dL9pblocqJILVkwbKRgRXW8tZxq41oJ7kIKC4rI34L12wtVghbdCO9176S0xThBnheQrdPXvDQCwneYw2nm_PdzAvwEQ51Ba</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Low-cost coordinated nonblocking checkpointing in mobile computing systems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Weigang Ni ; Vrbsky, S.V. ; Ray, S.</creator><creatorcontrib>Weigang Ni ; Vrbsky, S.V. ; Ray, S.</creatorcontrib><description>A mobile computing system consists of mobile and stationary nodes. Checkpointing in mobile systems faces many new challenges, such as low wireless bandwidth, frequent disconnections and lack of stable storage at mobile nodes. Previously proposed checkpoint algorithms for mobile environments do not take into consideration the coordinating message overhead of the mobile participants. In this paper, we propose a new checkpoint algorithm for mobile distributed systems. Our algorithm is nonblocking and minimizes the number of checkpoint participants. We propose a new idea called proxy coordinator. By using proxy coordinator, mobile participants' coordinating message overhead is minimized to O(1), which can otherwise be as high as O(n) in other proposed algorithms.</description><identifier>ISSN: 1530-1346</identifier><identifier>ISBN: 9780769519616</identifier><identifier>ISBN: 076951961X</identifier><identifier>EISSN: 2642-7389</identifier><identifier>DOI: 10.1109/ISCC.2003.1214313</identifier><language>eng</language><publisher>IEEE</publisher><subject>Bandwidth ; Checkpointing ; Computer applications ; Computer science ; Distributed computing ; Joining processes ; Mobile communication ; Mobile computing ; Personal digital assistants ; Wireless communication</subject><ispartof>Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003, 2003, p.1427-1434 vol.2</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1214313$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4048,4049,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1214313$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Weigang Ni</creatorcontrib><creatorcontrib>Vrbsky, S.V.</creatorcontrib><creatorcontrib>Ray, S.</creatorcontrib><title>Low-cost coordinated nonblocking checkpointing in mobile computing systems</title><title>Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003</title><addtitle>ISCC</addtitle><description>A mobile computing system consists of mobile and stationary nodes. Checkpointing in mobile systems faces many new challenges, such as low wireless bandwidth, frequent disconnections and lack of stable storage at mobile nodes. Previously proposed checkpoint algorithms for mobile environments do not take into consideration the coordinating message overhead of the mobile participants. In this paper, we propose a new checkpoint algorithm for mobile distributed systems. Our algorithm is nonblocking and minimizes the number of checkpoint participants. We propose a new idea called proxy coordinator. By using proxy coordinator, mobile participants' coordinating message overhead is minimized to O(1), which can otherwise be as high as O(n) in other proposed algorithms.</description><subject>Bandwidth</subject><subject>Checkpointing</subject><subject>Computer applications</subject><subject>Computer science</subject><subject>Distributed computing</subject><subject>Joining processes</subject><subject>Mobile communication</subject><subject>Mobile computing</subject><subject>Personal digital assistants</subject><subject>Wireless communication</subject><issn>1530-1346</issn><issn>2642-7389</issn><isbn>9780769519616</isbn><isbn>076951961X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2003</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotkMtKxDAYhYMXsI7zAOKmL5Caa5MspXgZKbhQ10OS_tU4bVKaiszbe5vV4XwcvsVB6JKSilJirjfPTVMxQnhFGRWc8iNUsFowrLg2x2htlCaqNpKamtYnqKCSE0y5qM_Qec4fhBAtmSrQY5u-sE95KX1KcxeiXaArY4puSH4X4lvp38HvphTi8ttCLMfkwgA_-3H6_GN5nxcY8wU67e2QYX3IFXq9u31pHnD7dL9pblocqJILVkwbKRgRXW8tZxq41oJ7kIKC4rI34L12wtVghbdCO9176S0xThBnheQrdPXvDQCwneYw2nm_PdzAvwEQ51Ba</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>Weigang Ni</creator><creator>Vrbsky, S.V.</creator><creator>Ray, S.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2003</creationdate><title>Low-cost coordinated nonblocking checkpointing in mobile computing systems</title><author>Weigang Ni ; Vrbsky, S.V. ; Ray, S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-728954204dfaa328e38843ce541e735f9ecc8b4b6ea4ca48b8fc5ca09b40ba453</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Bandwidth</topic><topic>Checkpointing</topic><topic>Computer applications</topic><topic>Computer science</topic><topic>Distributed computing</topic><topic>Joining processes</topic><topic>Mobile communication</topic><topic>Mobile computing</topic><topic>Personal digital assistants</topic><topic>Wireless communication</topic><toplevel>online_resources</toplevel><creatorcontrib>Weigang Ni</creatorcontrib><creatorcontrib>Vrbsky, S.V.</creatorcontrib><creatorcontrib>Ray, S.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Weigang Ni</au><au>Vrbsky, S.V.</au><au>Ray, S.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Low-cost coordinated nonblocking checkpointing in mobile computing systems</atitle><btitle>Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003</btitle><stitle>ISCC</stitle><date>2003</date><risdate>2003</risdate><spage>1427</spage><epage>1434 vol.2</epage><pages>1427-1434 vol.2</pages><issn>1530-1346</issn><eissn>2642-7389</eissn><isbn>9780769519616</isbn><isbn>076951961X</isbn><abstract>A mobile computing system consists of mobile and stationary nodes. Checkpointing in mobile systems faces many new challenges, such as low wireless bandwidth, frequent disconnections and lack of stable storage at mobile nodes. Previously proposed checkpoint algorithms for mobile environments do not take into consideration the coordinating message overhead of the mobile participants. In this paper, we propose a new checkpoint algorithm for mobile distributed systems. Our algorithm is nonblocking and minimizes the number of checkpoint participants. We propose a new idea called proxy coordinator. By using proxy coordinator, mobile participants' coordinating message overhead is minimized to O(1), which can otherwise be as high as O(n) in other proposed algorithms.</abstract><pub>IEEE</pub><doi>10.1109/ISCC.2003.1214313</doi></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 1530-1346
ispartof	Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003, 2003, p.1427-1434 vol.2
issn	1530-1346 2642-7389
language	eng
recordid	cdi_ieee_primary_1214313
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Bandwidth Checkpointing Computer applications Computer science Distributed computing Joining processes Mobile communication Mobile computing Personal digital assistants Wireless communication
title	Low-cost coordinated nonblocking checkpointing in mobile computing systems
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T16%3A19%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Low-cost%20coordinated%20nonblocking%20checkpointing%20in%20mobile%20computing%20systems&rft.btitle=Proceedings%20of%20the%20Eighth%20IEEE%20Symposium%20on%20Computers%20and%20Communications.%20ISCC%202003&rft.au=Weigang%20Ni&rft.date=2003&rft.spage=1427&rft.epage=1434%20vol.2&rft.pages=1427-1434%20vol.2&rft.issn=1530-1346&rft.eissn=2642-7389&rft.isbn=9780769519616&rft.isbn_list=076951961X&rft_id=info:doi/10.1109/ISCC.2003.1214313&rft_dat=%3Cieee_6IE%3E1214313%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1214313&rfr_iscdi=true