A cache-based search algorithm in unstructured P2P networks
Abstract Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the ba...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Liu, Yuhua [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2011 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer Science+Business Media, LLC 2011 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of intelligent manufacturing - Springer US, 1990, 23(2011), 6 vom: 24. Nov., Seite 2101-2107 |
|---|---|
| Übergeordnetes Werk: |
volume:23 ; year:2011 ; number:6 ; day:24 ; month:11 ; pages:2101-2107 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10845-011-0603-8 |
|---|
| Katalog-ID: |
OLC2066771082 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2066771082 | ||
| 003 | DE-627 | ||
| 005 | 20230503115613.0 | ||
| 007 | tu | ||
| 008 | 200820s2011 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10845-011-0603-8 |2 doi | |
| 035 | |a (DE-627)OLC2066771082 | ||
| 035 | |a (DE-He213)s10845-011-0603-8-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 620 |a 004 |q VZ |
| 100 | 1 | |a Liu, Yuhua |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A cache-based search algorithm in unstructured P2P networks |
| 264 | 1 | |c 2011 | |
| 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 © Springer Science+Business Media, LLC 2011 | ||
| 520 | |a Abstract Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay. | ||
| 650 | 4 | |a P2P network | |
| 650 | 4 | |a Flooding | |
| 650 | 4 | |a Index cache | |
| 650 | 4 | |a Content cache | |
| 650 | 4 | |a Search algorithm | |
| 650 | 4 | |a Memory | |
| 700 | 1 | |a Wu, Shishun |4 aut | |
| 700 | 1 | |a Xiong, Naixue |4 aut | |
| 700 | 1 | |a Park, Jong Hyuk |4 aut | |
| 700 | 1 | |a Zhang, Maoyuan |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of intelligent manufacturing |d Springer US, 1990 |g 23(2011), 6 vom: 24. Nov., Seite 2101-2107 |w (DE-627)130892815 |w (DE-600)1041378-9 |w (DE-576)026321106 |x 0956-5515 |7 nnns |
| 773 | 1 | 8 | |g volume:23 |g year:2011 |g number:6 |g day:24 |g month:11 |g pages:2101-2107 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10845-011-0603-8 |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 | ||
| 912 | |a GBV_ILN_23 | ||
| 912 | |a GBV_ILN_26 | ||
| 912 | |a GBV_ILN_70 | ||
| 951 | |a AR | ||
| 952 | |d 23 |j 2011 |e 6 |b 24 |c 11 |h 2101-2107 | ||
| author_variant |
y l yl s w sw n x nx j h p jh jhp m z mz |
|---|---|
| matchkey_str |
article:09565515:2011----::cceaesacagrtmnntut |
| hierarchy_sort_str |
2011 |
| publishDate |
2011 |
| allfields |
10.1007/s10845-011-0603-8 doi (DE-627)OLC2066771082 (DE-He213)s10845-011-0603-8-p DE-627 ger DE-627 rakwb eng 620 004 VZ Liu, Yuhua verfasserin aut A cache-based search algorithm in unstructured P2P networks 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay. P2P network Flooding Index cache Content cache Search algorithm Memory Wu, Shishun aut Xiong, Naixue aut Park, Jong Hyuk aut Zhang, Maoyuan aut Enthalten in Journal of intelligent manufacturing Springer US, 1990 23(2011), 6 vom: 24. Nov., Seite 2101-2107 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:23 year:2011 number:6 day:24 month:11 pages:2101-2107 https://doi.org/10.1007/s10845-011-0603-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_26 GBV_ILN_70 AR 23 2011 6 24 11 2101-2107 |
| spelling |
10.1007/s10845-011-0603-8 doi (DE-627)OLC2066771082 (DE-He213)s10845-011-0603-8-p DE-627 ger DE-627 rakwb eng 620 004 VZ Liu, Yuhua verfasserin aut A cache-based search algorithm in unstructured P2P networks 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay. P2P network Flooding Index cache Content cache Search algorithm Memory Wu, Shishun aut Xiong, Naixue aut Park, Jong Hyuk aut Zhang, Maoyuan aut Enthalten in Journal of intelligent manufacturing Springer US, 1990 23(2011), 6 vom: 24. Nov., Seite 2101-2107 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:23 year:2011 number:6 day:24 month:11 pages:2101-2107 https://doi.org/10.1007/s10845-011-0603-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_26 GBV_ILN_70 AR 23 2011 6 24 11 2101-2107 |
| allfields_unstemmed |
10.1007/s10845-011-0603-8 doi (DE-627)OLC2066771082 (DE-He213)s10845-011-0603-8-p DE-627 ger DE-627 rakwb eng 620 004 VZ Liu, Yuhua verfasserin aut A cache-based search algorithm in unstructured P2P networks 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay. P2P network Flooding Index cache Content cache Search algorithm Memory Wu, Shishun aut Xiong, Naixue aut Park, Jong Hyuk aut Zhang, Maoyuan aut Enthalten in Journal of intelligent manufacturing Springer US, 1990 23(2011), 6 vom: 24. Nov., Seite 2101-2107 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:23 year:2011 number:6 day:24 month:11 pages:2101-2107 https://doi.org/10.1007/s10845-011-0603-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_26 GBV_ILN_70 AR 23 2011 6 24 11 2101-2107 |
| allfieldsGer |
10.1007/s10845-011-0603-8 doi (DE-627)OLC2066771082 (DE-He213)s10845-011-0603-8-p DE-627 ger DE-627 rakwb eng 620 004 VZ Liu, Yuhua verfasserin aut A cache-based search algorithm in unstructured P2P networks 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay. P2P network Flooding Index cache Content cache Search algorithm Memory Wu, Shishun aut Xiong, Naixue aut Park, Jong Hyuk aut Zhang, Maoyuan aut Enthalten in Journal of intelligent manufacturing Springer US, 1990 23(2011), 6 vom: 24. Nov., Seite 2101-2107 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:23 year:2011 number:6 day:24 month:11 pages:2101-2107 https://doi.org/10.1007/s10845-011-0603-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_26 GBV_ILN_70 AR 23 2011 6 24 11 2101-2107 |
| allfieldsSound |
10.1007/s10845-011-0603-8 doi (DE-627)OLC2066771082 (DE-He213)s10845-011-0603-8-p DE-627 ger DE-627 rakwb eng 620 004 VZ Liu, Yuhua verfasserin aut A cache-based search algorithm in unstructured P2P networks 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Science+Business Media, LLC 2011 Abstract Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay. P2P network Flooding Index cache Content cache Search algorithm Memory Wu, Shishun aut Xiong, Naixue aut Park, Jong Hyuk aut Zhang, Maoyuan aut Enthalten in Journal of intelligent manufacturing Springer US, 1990 23(2011), 6 vom: 24. Nov., Seite 2101-2107 (DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 0956-5515 nnns volume:23 year:2011 number:6 day:24 month:11 pages:2101-2107 https://doi.org/10.1007/s10845-011-0603-8 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_26 GBV_ILN_70 AR 23 2011 6 24 11 2101-2107 |
| language |
English |
| source |
Enthalten in Journal of intelligent manufacturing 23(2011), 6 vom: 24. Nov., Seite 2101-2107 volume:23 year:2011 number:6 day:24 month:11 pages:2101-2107 |
| sourceStr |
Enthalten in Journal of intelligent manufacturing 23(2011), 6 vom: 24. Nov., Seite 2101-2107 volume:23 year:2011 number:6 day:24 month:11 pages:2101-2107 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
P2P network Flooding Index cache Content cache Search algorithm Memory |
| dewey-raw |
620 |
| isfreeaccess_bool |
false |
| container_title |
Journal of intelligent manufacturing |
| authorswithroles_txt_mv |
Liu, Yuhua @@aut@@ Wu, Shishun @@aut@@ Xiong, Naixue @@aut@@ Park, Jong Hyuk @@aut@@ Zhang, Maoyuan @@aut@@ |
| publishDateDaySort_date |
2011-11-24T00:00:00Z |
| hierarchy_top_id |
130892815 |
| dewey-sort |
3620 |
| id |
OLC2066771082 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2066771082</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503115613.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10845-011-0603-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2066771082</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10845-011-0603-8-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">620</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Liu, Yuhua</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A cache-based search algorithm in unstructured P2P networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</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">© Springer Science+Business Media, LLC 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">P2P network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Flooding</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Index cache</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Content cache</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Search algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Shishun</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xiong, Naixue</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Park, Jong Hyuk</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Maoyuan</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of intelligent manufacturing</subfield><subfield code="d">Springer US, 1990</subfield><subfield code="g">23(2011), 6 vom: 24. Nov., Seite 2101-2107</subfield><subfield code="w">(DE-627)130892815</subfield><subfield code="w">(DE-600)1041378-9</subfield><subfield code="w">(DE-576)026321106</subfield><subfield code="x">0956-5515</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:23</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:6</subfield><subfield code="g">day:24</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:2101-2107</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10845-011-0603-8</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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">23</subfield><subfield code="j">2011</subfield><subfield code="e">6</subfield><subfield code="b">24</subfield><subfield code="c">11</subfield><subfield code="h">2101-2107</subfield></datafield></record></collection>
|
| author |
Liu, Yuhua |
| spellingShingle |
Liu, Yuhua ddc 620 misc P2P network misc Flooding misc Index cache misc Content cache misc Search algorithm misc Memory A cache-based search algorithm in unstructured P2P networks |
| authorStr |
Liu, Yuhua |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)130892815 |
| format |
Article |
| dewey-ones |
620 - Engineering & allied operations 004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0956-5515 |
| topic_title |
620 004 VZ A cache-based search algorithm in unstructured P2P networks P2P network Flooding Index cache Content cache Search algorithm Memory |
| topic |
ddc 620 misc P2P network misc Flooding misc Index cache misc Content cache misc Search algorithm misc Memory |
| topic_unstemmed |
ddc 620 misc P2P network misc Flooding misc Index cache misc Content cache misc Search algorithm misc Memory |
| topic_browse |
ddc 620 misc P2P network misc Flooding misc Index cache misc Content cache misc Search algorithm misc Memory |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of intelligent manufacturing |
| hierarchy_parent_id |
130892815 |
| dewey-tens |
620 - Engineering 000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Journal of intelligent manufacturing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)130892815 (DE-600)1041378-9 (DE-576)026321106 |
| title |
A cache-based search algorithm in unstructured P2P networks |
| ctrlnum |
(DE-627)OLC2066771082 (DE-He213)s10845-011-0603-8-p |
| title_full |
A cache-based search algorithm in unstructured P2P networks |
| author_sort |
Liu, Yuhua |
| journal |
Journal of intelligent manufacturing |
| journalStr |
Journal of intelligent manufacturing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology 000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2011 |
| contenttype_str_mv |
txt |
| container_start_page |
2101 |
| author_browse |
Liu, Yuhua Wu, Shishun Xiong, Naixue Park, Jong Hyuk Zhang, Maoyuan |
| container_volume |
23 |
| class |
620 004 VZ |
| format_se |
Aufsätze |
| author-letter |
Liu, Yuhua |
| doi_str_mv |
10.1007/s10845-011-0603-8 |
| dewey-full |
620 004 |
| title_sort |
a cache-based search algorithm in unstructured p2p networks |
| title_auth |
A cache-based search algorithm in unstructured P2P networks |
| abstract |
Abstract Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay. © Springer Science+Business Media, LLC 2011 |
| abstractGer |
Abstract Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay. © Springer Science+Business Media, LLC 2011 |
| abstract_unstemmed |
Abstract Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay. © Springer Science+Business Media, LLC 2011 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_23 GBV_ILN_26 GBV_ILN_70 |
| container_issue |
6 |
| title_short |
A cache-based search algorithm in unstructured P2P networks |
| url |
https://doi.org/10.1007/s10845-011-0603-8 |
| remote_bool |
false |
| author2 |
Wu, Shishun Xiong, Naixue Park, Jong Hyuk Zhang, Maoyuan |
| author2Str |
Wu, Shishun Xiong, Naixue Park, Jong Hyuk Zhang, Maoyuan |
| ppnlink |
130892815 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10845-011-0603-8 |
| up_date |
2024-07-04T05:15:39.047Z |
| _version_ |
1803624266116104192 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2066771082</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230503115613.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10845-011-0603-8</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2066771082</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10845-011-0603-8-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">620</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Liu, Yuhua</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A cache-based search algorithm in unstructured P2P networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</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">© Springer Science+Business Media, LLC 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Peer-to-Peer (P2P) network is an important component to implement next generation Internet, how to quickly and efficiently search the resources in P2P networks has become one of the most critical issues, at the same time, this is one of greatest concern to users. This paper describes the basic Flooding Peer-to-Peer network search method, followed by analysis of several new search methods pros and cons, and then further analysis of these algorithms is proposed based on a cache-based search algorithm: When a node of the remaining load capacity is high, it will become the center node, and form a joint topology area with the nearby nodes together, then the center node and ordinary nodes also need to store the index cache, at the local region the overheating resources will be copied to the local (that is, the contents cache). The simulation shows that the algorithm can effectively improve the hit rates of resources searching, reduce the query delay.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">P2P network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Flooding</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Index cache</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Content cache</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Search algorithm</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Shishun</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xiong, Naixue</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Park, Jong Hyuk</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Maoyuan</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of intelligent manufacturing</subfield><subfield code="d">Springer US, 1990</subfield><subfield code="g">23(2011), 6 vom: 24. Nov., Seite 2101-2107</subfield><subfield code="w">(DE-627)130892815</subfield><subfield code="w">(DE-600)1041378-9</subfield><subfield code="w">(DE-576)026321106</subfield><subfield code="x">0956-5515</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:23</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:6</subfield><subfield code="g">day:24</subfield><subfield code="g">month:11</subfield><subfield code="g">pages:2101-2107</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10845-011-0603-8</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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_26</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">23</subfield><subfield code="j">2011</subfield><subfield code="e">6</subfield><subfield code="b">24</subfield><subfield code="c">11</subfield><subfield code="h">2101-2107</subfield></datafield></record></collection>
|
| score |
7.4022093 |