Reduction of response time by data placement reflecting co-occurrence structures in structured overlay networks
We propose a method to accelerate a response of structured overlay networks by reducing the number of hops required to answer multi-queries. In the proposed method, by copying data items to the redundant storage spaces in other storages, a good data placement reflecting co-occurrence structures in t...
Gespeichert in:
| Veröffentlicht in: | PloS one 2018-10, Vol.13 (10), p.e0205757-e0205757 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | e0205757 |
|---|---|
| container_issue | 10 |
| container_start_page | e0205757 |
| container_title | PloS one |
| container_volume | 13 |
| creator | Koizumi, Yusuke Watabe, Kohei Nakagawa, Kenji |
| description | We propose a method to accelerate a response of structured overlay networks by reducing the number of hops required to answer multi-queries. In the proposed method, by copying data items to the redundant storage spaces in other storages, a good data placement reflecting co-occurrence structures in the structured overlay network is achieved. We formulate the optimization problem of the data placement in the limited redundant space of the storages as an integer programming. A greedy approach to solve the optimization problem is also proposed. Through several simulations, it is confirmed that the proposed method can reduce the average number of hops required to answer multi-queries by about 30% at the maximum in our simulation settings. The reduction rate of the average number of hops depends on the level of co-occurrence. Further, the reduction of the computation time to solve the optimization problem with the greedy approach is evaluated. We also confirm that the proposed method does not affect load balancing of structured overlay networks. |
| doi_str_mv | 10.1371/journal.pone.0205757 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_plos_</sourceid><recordid>TN_cdi_plos_journals_2118789406</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A559617850</galeid><doaj_id>oai_doaj_org_article_d0dc7d1ef3c34053a8e7d09fcce341b5</doaj_id><sourcerecordid>A559617850</sourcerecordid><originalsourceid>FETCH-LOGICAL-c758t-2fd98bf291c6205420dd6fbf58dddcc32c0f4bedc665e18bf4ca678e284640233</originalsourceid><addsrcrecordid>eNqNk0tv1DAQxyMEoqXwDRBEQkJw2MWO48S5IFUVj5UqVSqPq-XY490Ub7zYTmG_PbPdtGxQD8iHOPZv_vPwTJY9p2ROWU3fXfkh9MrNN76HOSkIr3n9IDumDStmVUHYw4P9UfYkxitCOBNV9Tg7YoTRgrH6OPOXYAadOt_n3uYBIspFyFO3hrzd5kYllW-c0rCGPuG9dYB0v8y1n3mthxCg15DHFFBlQPu86__-mdxfQ3Bqm_eQfvnwIz7NHlnlIjwbvyfZt48fvp59np1ffFqcnZ7PdM1FmhXWNKK1RUM1xs_LghhT2dZyYYzRmhWa2LIFo6uKA0Wy1KqqBRSirEqCqZ1kL_e6G-ejHGsVZUGpqEVTkgqJxZ4wXl3JTejWKmylV528OfBhKVVInXYgDTG6NhQs06zEIioBtSGN1RpYSVuOWu9Hb0O7xqiwVkG5iej0pu9WcumvZUUFF6xBgTejQPA_B4hJrruowTnVgx9u4m7wMQu68_XqH_T-7EZqqTCBrrce_eqdqDzlvKloLThBan4PhcvAutPYWLbD84nB24kBMgl-p6UaYpSLL5f_z158n7KvD9gVKJdW0bth15hxCpZ7UAcfI_bjXZEpkbu5uK2G3M2FHOcCzV4cPtCd0e0gsD_Yegsb</addsrcrecordid><sourcetype>Open Website</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2118789406</pqid></control><display><type>article</type><title>Reduction of response time by data placement reflecting co-occurrence structures in structured overlay networks</title><source>DOAJ Directory of Open Access Journals</source><source>Public Library of Science (PLoS) Journals Open Access</source><source>EZB-FREE-00999 freely available EZB journals</source><source>PubMed Central</source><source>Free Full-Text Journals in Chemistry</source><creator>Koizumi, Yusuke ; Watabe, Kohei ; Nakagawa, Kenji</creator><contributor>Kanovsky, Igor</contributor><creatorcontrib>Koizumi, Yusuke ; Watabe, Kohei ; Nakagawa, Kenji ; Kanovsky, Igor</creatorcontrib><description>We propose a method to accelerate a response of structured overlay networks by reducing the number of hops required to answer multi-queries. In the proposed method, by copying data items to the redundant storage spaces in other storages, a good data placement reflecting co-occurrence structures in the structured overlay network is achieved. We formulate the optimization problem of the data placement in the limited redundant space of the storages as an integer programming. A greedy approach to solve the optimization problem is also proposed. Through several simulations, it is confirmed that the proposed method can reduce the average number of hops required to answer multi-queries by about 30% at the maximum in our simulation settings. The reduction rate of the average number of hops depends on the level of co-occurrence. Further, the reduction of the computation time to solve the optimization problem with the greedy approach is evaluated. We also confirm that the proposed method does not affect load balancing of structured overlay networks.</description><identifier>ISSN: 1932-6203</identifier><identifier>EISSN: 1932-6203</identifier><identifier>DOI: 10.1371/journal.pone.0205757</identifier><identifier>PMID: 30312337</identifier><language>eng</language><publisher>United States: Public Library of Science</publisher><subject>Analysis ; Big Data ; Computer and Information Sciences ; Computer networks ; Computer science ; Computer simulation ; Copying ; Engineering schools ; Ethernet ; Integer programming ; Internet ; Network switching ; Networks ; Optimization ; Peer to peer computing ; Physical Sciences ; Placement ; Queries ; Reduction ; Research and Analysis Methods ; Response time ; Semantic web ; Semantics ; Sensors ; Social Sciences ; Structure</subject><ispartof>PloS one, 2018-10, Vol.13 (10), p.e0205757-e0205757</ispartof><rights>COPYRIGHT 2018 Public Library of Science</rights><rights>2018 Koizumi et al. This is an open access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>2018 Koizumi et al 2018 Koizumi et al</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c758t-2fd98bf291c6205420dd6fbf58dddcc32c0f4bedc665e18bf4ca678e284640233</citedby><cites>FETCH-LOGICAL-c758t-2fd98bf291c6205420dd6fbf58dddcc32c0f4bedc665e18bf4ca678e284640233</cites><orcidid>0000-0002-9246-9740</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC6185839/pdf/$$EPDF$$P50$$Gpubmedcentral$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://www.ncbi.nlm.nih.gov/pmc/articles/PMC6185839/$$EHTML$$P50$$Gpubmedcentral$$Hfree_for_read</linktohtml><link.rule.ids>230,315,728,781,785,865,886,2103,2929,23870,27928,27929,53795,53797</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/30312337$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><contributor>Kanovsky, Igor</contributor><creatorcontrib>Koizumi, Yusuke</creatorcontrib><creatorcontrib>Watabe, Kohei</creatorcontrib><creatorcontrib>Nakagawa, Kenji</creatorcontrib><title>Reduction of response time by data placement reflecting co-occurrence structures in structured overlay networks</title><title>PloS one</title><addtitle>PLoS One</addtitle><description>We propose a method to accelerate a response of structured overlay networks by reducing the number of hops required to answer multi-queries. In the proposed method, by copying data items to the redundant storage spaces in other storages, a good data placement reflecting co-occurrence structures in the structured overlay network is achieved. We formulate the optimization problem of the data placement in the limited redundant space of the storages as an integer programming. A greedy approach to solve the optimization problem is also proposed. Through several simulations, it is confirmed that the proposed method can reduce the average number of hops required to answer multi-queries by about 30% at the maximum in our simulation settings. The reduction rate of the average number of hops depends on the level of co-occurrence. Further, the reduction of the computation time to solve the optimization problem with the greedy approach is evaluated. We also confirm that the proposed method does not affect load balancing of structured overlay networks.</description><subject>Analysis</subject><subject>Big Data</subject><subject>Computer and Information Sciences</subject><subject>Computer networks</subject><subject>Computer science</subject><subject>Computer simulation</subject><subject>Copying</subject><subject>Engineering schools</subject><subject>Ethernet</subject><subject>Integer programming</subject><subject>Internet</subject><subject>Network switching</subject><subject>Networks</subject><subject>Optimization</subject><subject>Peer to peer computing</subject><subject>Physical Sciences</subject><subject>Placement</subject><subject>Queries</subject><subject>Reduction</subject><subject>Research and Analysis Methods</subject><subject>Response time</subject><subject>Semantic web</subject><subject>Semantics</subject><subject>Sensors</subject><subject>Social Sciences</subject><subject>Structure</subject><issn>1932-6203</issn><issn>1932-6203</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>DOA</sourceid><recordid>eNqNk0tv1DAQxyMEoqXwDRBEQkJw2MWO48S5IFUVj5UqVSqPq-XY490Ub7zYTmG_PbPdtGxQD8iHOPZv_vPwTJY9p2ROWU3fXfkh9MrNN76HOSkIr3n9IDumDStmVUHYw4P9UfYkxitCOBNV9Tg7YoTRgrH6OPOXYAadOt_n3uYBIspFyFO3hrzd5kYllW-c0rCGPuG9dYB0v8y1n3mthxCg15DHFFBlQPu86__-mdxfQ3Bqm_eQfvnwIz7NHlnlIjwbvyfZt48fvp59np1ffFqcnZ7PdM1FmhXWNKK1RUM1xs_LghhT2dZyYYzRmhWa2LIFo6uKA0Wy1KqqBRSirEqCqZ1kL_e6G-ejHGsVZUGpqEVTkgqJxZ4wXl3JTejWKmylV528OfBhKVVInXYgDTG6NhQs06zEIioBtSGN1RpYSVuOWu9Hb0O7xqiwVkG5iej0pu9WcumvZUUFF6xBgTejQPA_B4hJrruowTnVgx9u4m7wMQu68_XqH_T-7EZqqTCBrrce_eqdqDzlvKloLThBan4PhcvAutPYWLbD84nB24kBMgl-p6UaYpSLL5f_z158n7KvD9gVKJdW0bth15hxCpZ7UAcfI_bjXZEpkbu5uK2G3M2FHOcCzV4cPtCd0e0gsD_Yegsb</recordid><startdate>20181012</startdate><enddate>20181012</enddate><creator>Koizumi, Yusuke</creator><creator>Watabe, Kohei</creator><creator>Nakagawa, Kenji</creator><general>Public Library of Science</general><general>Public Library of Science (PLoS)</general><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>IOV</scope><scope>ISR</scope><scope>3V.</scope><scope>7QG</scope><scope>7QL</scope><scope>7QO</scope><scope>7RV</scope><scope>7SN</scope><scope>7SS</scope><scope>7T5</scope><scope>7TG</scope><scope>7TM</scope><scope>7U9</scope><scope>7X2</scope><scope>7X7</scope><scope>7XB</scope><scope>88E</scope><scope>8AO</scope><scope>8C1</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>C1K</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>H94</scope><scope>HCIFZ</scope><scope>K9.</scope><scope>KB.</scope><scope>KB0</scope><scope>KL.</scope><scope>L6V</scope><scope>LK8</scope><scope>M0K</scope><scope>M0S</scope><scope>M1P</scope><scope>M7N</scope><scope>M7P</scope><scope>M7S</scope><scope>NAPCQ</scope><scope>P5Z</scope><scope>P62</scope><scope>P64</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>RC3</scope><scope>7X8</scope><scope>5PM</scope><scope>DOA</scope><orcidid>https://orcid.org/0000-0002-9246-9740</orcidid></search><sort><creationdate>20181012</creationdate><title>Reduction of response time by data placement reflecting co-occurrence structures in structured overlay networks</title><author>Koizumi, Yusuke ; Watabe, Kohei ; Nakagawa, Kenji</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c758t-2fd98bf291c6205420dd6fbf58dddcc32c0f4bedc665e18bf4ca678e284640233</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Analysis</topic><topic>Big Data</topic><topic>Computer and Information Sciences</topic><topic>Computer networks</topic><topic>Computer science</topic><topic>Computer simulation</topic><topic>Copying</topic><topic>Engineering schools</topic><topic>Ethernet</topic><topic>Integer programming</topic><topic>Internet</topic><topic>Network switching</topic><topic>Networks</topic><topic>Optimization</topic><topic>Peer to peer computing</topic><topic>Physical Sciences</topic><topic>Placement</topic><topic>Queries</topic><topic>Reduction</topic><topic>Research and Analysis Methods</topic><topic>Response time</topic><topic>Semantic web</topic><topic>Semantics</topic><topic>Sensors</topic><topic>Social Sciences</topic><topic>Structure</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Koizumi, Yusuke</creatorcontrib><creatorcontrib>Watabe, Kohei</creatorcontrib><creatorcontrib>Nakagawa, Kenji</creatorcontrib><collection>PubMed</collection><collection>CrossRef</collection><collection>Gale In Context: Opposing Viewpoints</collection><collection>Gale In Context: Science</collection><collection>ProQuest Central (Corporate)</collection><collection>Animal Behavior Abstracts</collection><collection>Bacteriology Abstracts (Microbiology B)</collection><collection>Biotechnology Research Abstracts</collection><collection>Nursing & Allied Health Database</collection><collection>Ecology Abstracts</collection><collection>Entomology Abstracts (Full archive)</collection><collection>Immunology Abstracts</collection><collection>Meteorological & Geoastrophysical Abstracts</collection><collection>Nucleic Acids Abstracts</collection><collection>Virology and AIDS Abstracts</collection><collection>Agricultural Science Collection</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Medical Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Public Health Database</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>Agricultural & Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>AIDS and Cancer Research Abstracts</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>Materials Science Database</collection><collection>Nursing & Allied Health Database (Alumni Edition)</collection><collection>Meteorological & Geoastrophysical Abstracts - Academic</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>Agricultural Science Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Algology Mycology and Protozoology Abstracts (Microbiology C)</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Nursing & Allied Health Premium</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Biotechnology and BioEngineering Abstracts</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>Environmental Science Collection</collection><collection>Genetics Abstracts</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><collection>DOAJ Directory of Open Access Journals</collection><jtitle>PloS one</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Koizumi, Yusuke</au><au>Watabe, Kohei</au><au>Nakagawa, Kenji</au><au>Kanovsky, Igor</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Reduction of response time by data placement reflecting co-occurrence structures in structured overlay networks</atitle><jtitle>PloS one</jtitle><addtitle>PLoS One</addtitle><date>2018-10-12</date><risdate>2018</risdate><volume>13</volume><issue>10</issue><spage>e0205757</spage><epage>e0205757</epage><pages>e0205757-e0205757</pages><issn>1932-6203</issn><eissn>1932-6203</eissn><abstract>We propose a method to accelerate a response of structured overlay networks by reducing the number of hops required to answer multi-queries. In the proposed method, by copying data items to the redundant storage spaces in other storages, a good data placement reflecting co-occurrence structures in the structured overlay network is achieved. We formulate the optimization problem of the data placement in the limited redundant space of the storages as an integer programming. A greedy approach to solve the optimization problem is also proposed. Through several simulations, it is confirmed that the proposed method can reduce the average number of hops required to answer multi-queries by about 30% at the maximum in our simulation settings. The reduction rate of the average number of hops depends on the level of co-occurrence. Further, the reduction of the computation time to solve the optimization problem with the greedy approach is evaluated. We also confirm that the proposed method does not affect load balancing of structured overlay networks.</abstract><cop>United States</cop><pub>Public Library of Science</pub><pmid>30312337</pmid><doi>10.1371/journal.pone.0205757</doi><tpages>e0205757</tpages><orcidid>https://orcid.org/0000-0002-9246-9740</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1932-6203 |
| ispartof | PloS one, 2018-10, Vol.13 (10), p.e0205757-e0205757 |
| issn | 1932-6203 1932-6203 |
| language | eng |
| recordid | cdi_plos_journals_2118789406 |
| source | DOAJ Directory of Open Access Journals; Public Library of Science (PLoS) Journals Open Access; EZB-FREE-00999 freely available EZB journals; PubMed Central; Free Full-Text Journals in Chemistry |
| subjects | Analysis Big Data Computer and Information Sciences Computer networks Computer science Computer simulation Copying Engineering schools Ethernet Integer programming Internet Network switching Networks Optimization Peer to peer computing Physical Sciences Placement Queries Reduction Research and Analysis Methods Response time Semantic web Semantics Sensors Social Sciences Structure |
| title | Reduction of response time by data placement reflecting co-occurrence structures in structured overlay networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-17T11%3A37%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_plos_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Reduction%20of%20response%20time%20by%20data%20placement%20reflecting%20co-occurrence%20structures%20in%20structured%20overlay%20networks&rft.jtitle=PloS%20one&rft.au=Koizumi,%20Yusuke&rft.date=2018-10-12&rft.volume=13&rft.issue=10&rft.spage=e0205757&rft.epage=e0205757&rft.pages=e0205757-e0205757&rft.issn=1932-6203&rft.eissn=1932-6203&rft_id=info:doi/10.1371/journal.pone.0205757&rft_dat=%3Cgale_plos_%3EA559617850%3C/gale_plos_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2118789406&rft_id=info:pmid/30312337&rft_galeid=A559617850&rft_doaj_id=oai_doaj_org_article_d0dc7d1ef3c34053a8e7d09fcce341b5&rfr_iscdi=true |