Consensus-based data replication protocol for distributed cloud
Abstract Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file and storing them on well-distributed distinct servers. The more the number of copies, the more is the availability. Considering...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Maheshwari, Rashmi [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2021 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 |
|---|
| Übergeordnetes Werk: |
Enthalten in: The journal of supercomputing - Springer US, 1987, 77(2021), 8 vom: 25. Jan., Seite 8653-8673 |
|---|---|
| Übergeordnetes Werk: |
volume:77 ; year:2021 ; number:8 ; day:25 ; month:01 ; pages:8653-8673 |
| Links: |
|---|
| DOI / URN: |
10.1007/s11227-021-03619-5 |
|---|
| Katalog-ID: |
OLC2126673928 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2126673928 | ||
| 003 | DE-627 | ||
| 005 | 20230505120524.0 | ||
| 007 | tu | ||
| 008 | 230505s2021 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s11227-021-03619-5 |2 doi | |
| 035 | |a (DE-627)OLC2126673928 | ||
| 035 | |a (DE-He213)s11227-021-03619-5-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |a 620 |q VZ |
| 100 | 1 | |a Maheshwari, Rashmi |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Consensus-based data replication protocol for distributed cloud |
| 264 | 1 | |c 2021 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 | ||
| 520 | |a Abstract Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file and storing them on well-distributed distinct servers. The more the number of copies, the more is the availability. Considering a distributed cloud scenario with multiple data copies, a file update operation may be performed at any server containing a copy of the data file. Allowing parallel file updates by different users on various servers may incur inconsistent views of the data file among readers. A data replication protocol ensures that a file will remain consistent throughout the network. The existing data replication protocols did not explicitly address the server confidence about when the updated file version will be ready for read. In this work, we propose a consensus-based file replication protocol considering the message passing model that addresses the server confidence issue of the existing protocols. In the proposed protocol, the updated data file will be immediately accessible to the readers without any ambiguity after consensus is made. The proposed protocol is analyzed and compared with the similar protocols. The protocol is implemented, and the experimental results are verified with the analytical results. | ||
| 650 | 4 | |a Consensus | |
| 650 | 4 | |a Data replication | |
| 650 | 4 | |a Availability | |
| 650 | 4 | |a Data consistency | |
| 700 | 1 | |a Kumar, Naveen |4 aut | |
| 700 | 1 | |a Shadi, Monal |4 aut | |
| 700 | 1 | |a Tiwari, Shailesh |0 (orcid)0000-0002-1306-1246 |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t The journal of supercomputing |d Springer US, 1987 |g 77(2021), 8 vom: 25. Jan., Seite 8653-8673 |w (DE-627)13046466X |w (DE-600)740510-8 |w (DE-576)018667775 |x 0920-8542 |7 nnns |
| 773 | 1 | 8 | |g volume:77 |g year:2021 |g number:8 |g day:25 |g month:01 |g pages:8653-8673 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s11227-021-03619-5 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a SSG-OLC-MAT | ||
| 951 | |a AR | ||
| 952 | |d 77 |j 2021 |e 8 |b 25 |c 01 |h 8653-8673 | ||
| author_variant |
r m rm n k nk m s ms s t st |
|---|---|
| matchkey_str |
article:09208542:2021----::osnubsdaaelctopooofri |
| hierarchy_sort_str |
2021 |
| publishDate |
2021 |
| allfields |
10.1007/s11227-021-03619-5 doi (DE-627)OLC2126673928 (DE-He213)s11227-021-03619-5-p DE-627 ger DE-627 rakwb eng 004 620 VZ Maheshwari, Rashmi verfasserin aut Consensus-based data replication protocol for distributed cloud 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 Abstract Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file and storing them on well-distributed distinct servers. The more the number of copies, the more is the availability. Considering a distributed cloud scenario with multiple data copies, a file update operation may be performed at any server containing a copy of the data file. Allowing parallel file updates by different users on various servers may incur inconsistent views of the data file among readers. A data replication protocol ensures that a file will remain consistent throughout the network. The existing data replication protocols did not explicitly address the server confidence about when the updated file version will be ready for read. In this work, we propose a consensus-based file replication protocol considering the message passing model that addresses the server confidence issue of the existing protocols. In the proposed protocol, the updated data file will be immediately accessible to the readers without any ambiguity after consensus is made. The proposed protocol is analyzed and compared with the similar protocols. The protocol is implemented, and the experimental results are verified with the analytical results. Consensus Data replication Availability Data consistency Kumar, Naveen aut Shadi, Monal aut Tiwari, Shailesh (orcid)0000-0002-1306-1246 aut Enthalten in The journal of supercomputing Springer US, 1987 77(2021), 8 vom: 25. Jan., Seite 8653-8673 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:77 year:2021 number:8 day:25 month:01 pages:8653-8673 https://doi.org/10.1007/s11227-021-03619-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 77 2021 8 25 01 8653-8673 |
| spelling |
10.1007/s11227-021-03619-5 doi (DE-627)OLC2126673928 (DE-He213)s11227-021-03619-5-p DE-627 ger DE-627 rakwb eng 004 620 VZ Maheshwari, Rashmi verfasserin aut Consensus-based data replication protocol for distributed cloud 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 Abstract Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file and storing them on well-distributed distinct servers. The more the number of copies, the more is the availability. Considering a distributed cloud scenario with multiple data copies, a file update operation may be performed at any server containing a copy of the data file. Allowing parallel file updates by different users on various servers may incur inconsistent views of the data file among readers. A data replication protocol ensures that a file will remain consistent throughout the network. The existing data replication protocols did not explicitly address the server confidence about when the updated file version will be ready for read. In this work, we propose a consensus-based file replication protocol considering the message passing model that addresses the server confidence issue of the existing protocols. In the proposed protocol, the updated data file will be immediately accessible to the readers without any ambiguity after consensus is made. The proposed protocol is analyzed and compared with the similar protocols. The protocol is implemented, and the experimental results are verified with the analytical results. Consensus Data replication Availability Data consistency Kumar, Naveen aut Shadi, Monal aut Tiwari, Shailesh (orcid)0000-0002-1306-1246 aut Enthalten in The journal of supercomputing Springer US, 1987 77(2021), 8 vom: 25. Jan., Seite 8653-8673 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:77 year:2021 number:8 day:25 month:01 pages:8653-8673 https://doi.org/10.1007/s11227-021-03619-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 77 2021 8 25 01 8653-8673 |
| allfields_unstemmed |
10.1007/s11227-021-03619-5 doi (DE-627)OLC2126673928 (DE-He213)s11227-021-03619-5-p DE-627 ger DE-627 rakwb eng 004 620 VZ Maheshwari, Rashmi verfasserin aut Consensus-based data replication protocol for distributed cloud 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 Abstract Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file and storing them on well-distributed distinct servers. The more the number of copies, the more is the availability. Considering a distributed cloud scenario with multiple data copies, a file update operation may be performed at any server containing a copy of the data file. Allowing parallel file updates by different users on various servers may incur inconsistent views of the data file among readers. A data replication protocol ensures that a file will remain consistent throughout the network. The existing data replication protocols did not explicitly address the server confidence about when the updated file version will be ready for read. In this work, we propose a consensus-based file replication protocol considering the message passing model that addresses the server confidence issue of the existing protocols. In the proposed protocol, the updated data file will be immediately accessible to the readers without any ambiguity after consensus is made. The proposed protocol is analyzed and compared with the similar protocols. The protocol is implemented, and the experimental results are verified with the analytical results. Consensus Data replication Availability Data consistency Kumar, Naveen aut Shadi, Monal aut Tiwari, Shailesh (orcid)0000-0002-1306-1246 aut Enthalten in The journal of supercomputing Springer US, 1987 77(2021), 8 vom: 25. Jan., Seite 8653-8673 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:77 year:2021 number:8 day:25 month:01 pages:8653-8673 https://doi.org/10.1007/s11227-021-03619-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 77 2021 8 25 01 8653-8673 |
| allfieldsGer |
10.1007/s11227-021-03619-5 doi (DE-627)OLC2126673928 (DE-He213)s11227-021-03619-5-p DE-627 ger DE-627 rakwb eng 004 620 VZ Maheshwari, Rashmi verfasserin aut Consensus-based data replication protocol for distributed cloud 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 Abstract Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file and storing them on well-distributed distinct servers. The more the number of copies, the more is the availability. Considering a distributed cloud scenario with multiple data copies, a file update operation may be performed at any server containing a copy of the data file. Allowing parallel file updates by different users on various servers may incur inconsistent views of the data file among readers. A data replication protocol ensures that a file will remain consistent throughout the network. The existing data replication protocols did not explicitly address the server confidence about when the updated file version will be ready for read. In this work, we propose a consensus-based file replication protocol considering the message passing model that addresses the server confidence issue of the existing protocols. In the proposed protocol, the updated data file will be immediately accessible to the readers without any ambiguity after consensus is made. The proposed protocol is analyzed and compared with the similar protocols. The protocol is implemented, and the experimental results are verified with the analytical results. Consensus Data replication Availability Data consistency Kumar, Naveen aut Shadi, Monal aut Tiwari, Shailesh (orcid)0000-0002-1306-1246 aut Enthalten in The journal of supercomputing Springer US, 1987 77(2021), 8 vom: 25. Jan., Seite 8653-8673 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:77 year:2021 number:8 day:25 month:01 pages:8653-8673 https://doi.org/10.1007/s11227-021-03619-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 77 2021 8 25 01 8653-8673 |
| allfieldsSound |
10.1007/s11227-021-03619-5 doi (DE-627)OLC2126673928 (DE-He213)s11227-021-03619-5-p DE-627 ger DE-627 rakwb eng 004 620 VZ Maheshwari, Rashmi verfasserin aut Consensus-based data replication protocol for distributed cloud 2021 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 Abstract Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file and storing them on well-distributed distinct servers. The more the number of copies, the more is the availability. Considering a distributed cloud scenario with multiple data copies, a file update operation may be performed at any server containing a copy of the data file. Allowing parallel file updates by different users on various servers may incur inconsistent views of the data file among readers. A data replication protocol ensures that a file will remain consistent throughout the network. The existing data replication protocols did not explicitly address the server confidence about when the updated file version will be ready for read. In this work, we propose a consensus-based file replication protocol considering the message passing model that addresses the server confidence issue of the existing protocols. In the proposed protocol, the updated data file will be immediately accessible to the readers without any ambiguity after consensus is made. The proposed protocol is analyzed and compared with the similar protocols. The protocol is implemented, and the experimental results are verified with the analytical results. Consensus Data replication Availability Data consistency Kumar, Naveen aut Shadi, Monal aut Tiwari, Shailesh (orcid)0000-0002-1306-1246 aut Enthalten in The journal of supercomputing Springer US, 1987 77(2021), 8 vom: 25. Jan., Seite 8653-8673 (DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 0920-8542 nnns volume:77 year:2021 number:8 day:25 month:01 pages:8653-8673 https://doi.org/10.1007/s11227-021-03619-5 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT AR 77 2021 8 25 01 8653-8673 |
| language |
English |
| source |
Enthalten in The journal of supercomputing 77(2021), 8 vom: 25. Jan., Seite 8653-8673 volume:77 year:2021 number:8 day:25 month:01 pages:8653-8673 |
| sourceStr |
Enthalten in The journal of supercomputing 77(2021), 8 vom: 25. Jan., Seite 8653-8673 volume:77 year:2021 number:8 day:25 month:01 pages:8653-8673 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Consensus Data replication Availability Data consistency |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
The journal of supercomputing |
| authorswithroles_txt_mv |
Maheshwari, Rashmi @@aut@@ Kumar, Naveen @@aut@@ Shadi, Monal @@aut@@ Tiwari, Shailesh @@aut@@ |
| publishDateDaySort_date |
2021-01-25T00:00:00Z |
| hierarchy_top_id |
13046466X |
| dewey-sort |
14 |
| id |
OLC2126673928 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2126673928</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505120524.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230505s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11227-021-03619-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2126673928</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11227-021-03619-5-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Maheshwari, Rashmi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Consensus-based data replication protocol for distributed cloud</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file and storing them on well-distributed distinct servers. The more the number of copies, the more is the availability. Considering a distributed cloud scenario with multiple data copies, a file update operation may be performed at any server containing a copy of the data file. Allowing parallel file updates by different users on various servers may incur inconsistent views of the data file among readers. A data replication protocol ensures that a file will remain consistent throughout the network. The existing data replication protocols did not explicitly address the server confidence about when the updated file version will be ready for read. In this work, we propose a consensus-based file replication protocol considering the message passing model that addresses the server confidence issue of the existing protocols. In the proposed protocol, the updated data file will be immediately accessible to the readers without any ambiguity after consensus is made. The proposed protocol is analyzed and compared with the similar protocols. The protocol is implemented, and the experimental results are verified with the analytical results.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Consensus</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data replication</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Availability</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data consistency</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kumar, Naveen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shadi, Monal</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tiwari, Shailesh</subfield><subfield code="0">(orcid)0000-0002-1306-1246</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The journal of supercomputing</subfield><subfield code="d">Springer US, 1987</subfield><subfield code="g">77(2021), 8 vom: 25. Jan., Seite 8653-8673</subfield><subfield code="w">(DE-627)13046466X</subfield><subfield code="w">(DE-600)740510-8</subfield><subfield code="w">(DE-576)018667775</subfield><subfield code="x">0920-8542</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:77</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:8</subfield><subfield code="g">day:25</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:8653-8673</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11227-021-03619-5</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">77</subfield><subfield code="j">2021</subfield><subfield code="e">8</subfield><subfield code="b">25</subfield><subfield code="c">01</subfield><subfield code="h">8653-8673</subfield></datafield></record></collection>
|
| author |
Maheshwari, Rashmi |
| spellingShingle |
Maheshwari, Rashmi ddc 004 misc Consensus misc Data replication misc Availability misc Data consistency Consensus-based data replication protocol for distributed cloud |
| authorStr |
Maheshwari, Rashmi |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)13046466X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0920-8542 |
| topic_title |
004 620 VZ Consensus-based data replication protocol for distributed cloud Consensus Data replication Availability Data consistency |
| topic |
ddc 004 misc Consensus misc Data replication misc Availability misc Data consistency |
| topic_unstemmed |
ddc 004 misc Consensus misc Data replication misc Availability misc Data consistency |
| topic_browse |
ddc 004 misc Consensus misc Data replication misc Availability misc Data consistency |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
The journal of supercomputing |
| hierarchy_parent_id |
13046466X |
| dewey-tens |
000 - Computer science, knowledge & systems 620 - Engineering |
| hierarchy_top_title |
The journal of supercomputing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)13046466X (DE-600)740510-8 (DE-576)018667775 |
| title |
Consensus-based data replication protocol for distributed cloud |
| ctrlnum |
(DE-627)OLC2126673928 (DE-He213)s11227-021-03619-5-p |
| title_full |
Consensus-based data replication protocol for distributed cloud |
| author_sort |
Maheshwari, Rashmi |
| journal |
The journal of supercomputing |
| journalStr |
The journal of supercomputing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2021 |
| contenttype_str_mv |
txt |
| container_start_page |
8653 |
| author_browse |
Maheshwari, Rashmi Kumar, Naveen Shadi, Monal Tiwari, Shailesh |
| container_volume |
77 |
| class |
004 620 VZ |
| format_se |
Aufsätze |
| author-letter |
Maheshwari, Rashmi |
| doi_str_mv |
10.1007/s11227-021-03619-5 |
| normlink |
(ORCID)0000-0002-1306-1246 |
| normlink_prefix_str_mv |
(orcid)0000-0002-1306-1246 |
| dewey-full |
004 620 |
| title_sort |
consensus-based data replication protocol for distributed cloud |
| title_auth |
Consensus-based data replication protocol for distributed cloud |
| abstract |
Abstract Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file and storing them on well-distributed distinct servers. The more the number of copies, the more is the availability. Considering a distributed cloud scenario with multiple data copies, a file update operation may be performed at any server containing a copy of the data file. Allowing parallel file updates by different users on various servers may incur inconsistent views of the data file among readers. A data replication protocol ensures that a file will remain consistent throughout the network. The existing data replication protocols did not explicitly address the server confidence about when the updated file version will be ready for read. In this work, we propose a consensus-based file replication protocol considering the message passing model that addresses the server confidence issue of the existing protocols. In the proposed protocol, the updated data file will be immediately accessible to the readers without any ambiguity after consensus is made. The proposed protocol is analyzed and compared with the similar protocols. The protocol is implemented, and the experimental results are verified with the analytical results. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 |
| abstractGer |
Abstract Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file and storing them on well-distributed distinct servers. The more the number of copies, the more is the availability. Considering a distributed cloud scenario with multiple data copies, a file update operation may be performed at any server containing a copy of the data file. Allowing parallel file updates by different users on various servers may incur inconsistent views of the data file among readers. A data replication protocol ensures that a file will remain consistent throughout the network. The existing data replication protocols did not explicitly address the server confidence about when the updated file version will be ready for read. In this work, we propose a consensus-based file replication protocol considering the message passing model that addresses the server confidence issue of the existing protocols. In the proposed protocol, the updated data file will be immediately accessible to the readers without any ambiguity after consensus is made. The proposed protocol is analyzed and compared with the similar protocols. The protocol is implemented, and the experimental results are verified with the analytical results. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 |
| abstract_unstemmed |
Abstract Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file and storing them on well-distributed distinct servers. The more the number of copies, the more is the availability. Considering a distributed cloud scenario with multiple data copies, a file update operation may be performed at any server containing a copy of the data file. Allowing parallel file updates by different users on various servers may incur inconsistent views of the data file among readers. A data replication protocol ensures that a file will remain consistent throughout the network. The existing data replication protocols did not explicitly address the server confidence about when the updated file version will be ready for read. In this work, we propose a consensus-based file replication protocol considering the message passing model that addresses the server confidence issue of the existing protocols. In the proposed protocol, the updated data file will be immediately accessible to the readers without any ambiguity after consensus is made. The proposed protocol is analyzed and compared with the similar protocols. The protocol is implemented, and the experimental results are verified with the analytical results. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT |
| container_issue |
8 |
| title_short |
Consensus-based data replication protocol for distributed cloud |
| url |
https://doi.org/10.1007/s11227-021-03619-5 |
| remote_bool |
false |
| author2 |
Kumar, Naveen Shadi, Monal Tiwari, Shailesh |
| author2Str |
Kumar, Naveen Shadi, Monal Tiwari, Shailesh |
| ppnlink |
13046466X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s11227-021-03619-5 |
| up_date |
2024-07-04T07:57:50.843Z |
| _version_ |
1803634470650118144 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">OLC2126673928</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230505120524.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">230505s2021 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s11227-021-03619-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2126673928</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s11227-021-03619-5-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Maheshwari, Rashmi</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Consensus-based data replication protocol for distributed cloud</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2021</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Data availability ensures efficient data accessibility by the readers anytime and from anywhere. It can be addressed by creating multiple copies of each data file and storing them on well-distributed distinct servers. The more the number of copies, the more is the availability. Considering a distributed cloud scenario with multiple data copies, a file update operation may be performed at any server containing a copy of the data file. Allowing parallel file updates by different users on various servers may incur inconsistent views of the data file among readers. A data replication protocol ensures that a file will remain consistent throughout the network. The existing data replication protocols did not explicitly address the server confidence about when the updated file version will be ready for read. In this work, we propose a consensus-based file replication protocol considering the message passing model that addresses the server confidence issue of the existing protocols. In the proposed protocol, the updated data file will be immediately accessible to the readers without any ambiguity after consensus is made. The proposed protocol is analyzed and compared with the similar protocols. The protocol is implemented, and the experimental results are verified with the analytical results.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Consensus</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data replication</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Availability</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data consistency</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kumar, Naveen</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shadi, Monal</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tiwari, Shailesh</subfield><subfield code="0">(orcid)0000-0002-1306-1246</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The journal of supercomputing</subfield><subfield code="d">Springer US, 1987</subfield><subfield code="g">77(2021), 8 vom: 25. Jan., Seite 8653-8673</subfield><subfield code="w">(DE-627)13046466X</subfield><subfield code="w">(DE-600)740510-8</subfield><subfield code="w">(DE-576)018667775</subfield><subfield code="x">0920-8542</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:77</subfield><subfield code="g">year:2021</subfield><subfield code="g">number:8</subfield><subfield code="g">day:25</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:8653-8673</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s11227-021-03619-5</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">77</subfield><subfield code="j">2021</subfield><subfield code="e">8</subfield><subfield code="b">25</subfield><subfield code="c">01</subfield><subfield code="h">8653-8673</subfield></datafield></record></collection>
|
| score |
7.4019384 |