Distributed distance computation and routing with small messages
Abstract We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Lenzen, Christoph [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2018 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s) 2018 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Distributed computing - Springer Berlin Heidelberg, 1986, 32(2018), 2 vom: 13. Feb., Seite 133-157 |
|---|---|
| Übergeordnetes Werk: |
volume:32 ; year:2018 ; number:2 ; day:13 ; month:02 ; pages:133-157 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00446-018-0326-6 |
|---|
| Katalog-ID: |
OLC2054812315 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2054812315 | ||
| 003 | DE-627 | ||
| 005 | 20230403073113.0 | ||
| 007 | tu | ||
| 008 | 200819s2018 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00446-018-0326-6 |2 doi | |
| 035 | |a (DE-627)OLC2054812315 | ||
| 035 | |a (DE-He213)s00446-018-0326-6-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 082 | 0 | 4 | |a 620 |q VZ |
| 100 | 1 | |a Lenzen, Christoph |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Distributed distance computation and routing with small messages |
| 264 | 1 | |c 2018 | |
| 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) 2018 | ||
| 520 | |a Abstract We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$-bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications. | ||
| 650 | 4 | |a CONGEST model | |
| 650 | 4 | |a Source detection | |
| 650 | 4 | |a Skeleton spanner | |
| 650 | 4 | |a Compact routing | |
| 650 | 4 | |a All-pairs shortest paths | |
| 650 | 4 | |a Single-souce shortest paths | |
| 700 | 1 | |a Patt-Shamir, Boaz |4 aut | |
| 700 | 1 | |a Peleg, David |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Distributed computing |d Springer Berlin Heidelberg, 1986 |g 32(2018), 2 vom: 13. Feb., Seite 133-157 |w (DE-627)13042885X |w (DE-600)635600-X |w (DE-576)01592789X |x 0178-2770 |7 nnns |
| 773 | 1 | 8 | |g volume:32 |g year:2018 |g number:2 |g day:13 |g month:02 |g pages:133-157 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00446-018-0326-6 |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_70 | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_2244 | ||
| 912 | |a GBV_ILN_4126 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4318 | ||
| 912 | |a GBV_ILN_4319 | ||
| 951 | |a AR | ||
| 952 | |d 32 |j 2018 |e 2 |b 13 |c 02 |h 133-157 | ||
| author_variant |
c l cl b p s bps d p dp |
|---|---|
| matchkey_str |
article:01782770:2018----::itiuedsaccmuainnruigi |
| hierarchy_sort_str |
2018 |
| publishDate |
2018 |
| allfields |
10.1007/s00446-018-0326-6 doi (DE-627)OLC2054812315 (DE-He213)s00446-018-0326-6-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Lenzen, Christoph verfasserin aut Distributed distance computation and routing with small messages 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2018 Abstract We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$-bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications. CONGEST model Source detection Skeleton spanner Compact routing All-pairs shortest paths Single-souce shortest paths Patt-Shamir, Boaz aut Peleg, David aut Enthalten in Distributed computing Springer Berlin Heidelberg, 1986 32(2018), 2 vom: 13. Feb., Seite 133-157 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:32 year:2018 number:2 day:13 month:02 pages:133-157 https://doi.org/10.1007/s00446-018-0326-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 AR 32 2018 2 13 02 133-157 |
| spelling |
10.1007/s00446-018-0326-6 doi (DE-627)OLC2054812315 (DE-He213)s00446-018-0326-6-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Lenzen, Christoph verfasserin aut Distributed distance computation and routing with small messages 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2018 Abstract We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$-bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications. CONGEST model Source detection Skeleton spanner Compact routing All-pairs shortest paths Single-souce shortest paths Patt-Shamir, Boaz aut Peleg, David aut Enthalten in Distributed computing Springer Berlin Heidelberg, 1986 32(2018), 2 vom: 13. Feb., Seite 133-157 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:32 year:2018 number:2 day:13 month:02 pages:133-157 https://doi.org/10.1007/s00446-018-0326-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 AR 32 2018 2 13 02 133-157 |
| allfields_unstemmed |
10.1007/s00446-018-0326-6 doi (DE-627)OLC2054812315 (DE-He213)s00446-018-0326-6-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Lenzen, Christoph verfasserin aut Distributed distance computation and routing with small messages 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2018 Abstract We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$-bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications. CONGEST model Source detection Skeleton spanner Compact routing All-pairs shortest paths Single-souce shortest paths Patt-Shamir, Boaz aut Peleg, David aut Enthalten in Distributed computing Springer Berlin Heidelberg, 1986 32(2018), 2 vom: 13. Feb., Seite 133-157 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:32 year:2018 number:2 day:13 month:02 pages:133-157 https://doi.org/10.1007/s00446-018-0326-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 AR 32 2018 2 13 02 133-157 |
| allfieldsGer |
10.1007/s00446-018-0326-6 doi (DE-627)OLC2054812315 (DE-He213)s00446-018-0326-6-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Lenzen, Christoph verfasserin aut Distributed distance computation and routing with small messages 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2018 Abstract We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$-bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications. CONGEST model Source detection Skeleton spanner Compact routing All-pairs shortest paths Single-souce shortest paths Patt-Shamir, Boaz aut Peleg, David aut Enthalten in Distributed computing Springer Berlin Heidelberg, 1986 32(2018), 2 vom: 13. Feb., Seite 133-157 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:32 year:2018 number:2 day:13 month:02 pages:133-157 https://doi.org/10.1007/s00446-018-0326-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 AR 32 2018 2 13 02 133-157 |
| allfieldsSound |
10.1007/s00446-018-0326-6 doi (DE-627)OLC2054812315 (DE-He213)s00446-018-0326-6-p DE-627 ger DE-627 rakwb eng 004 VZ 620 VZ Lenzen, Christoph verfasserin aut Distributed distance computation and routing with small messages 2018 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2018 Abstract We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$-bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications. CONGEST model Source detection Skeleton spanner Compact routing All-pairs shortest paths Single-souce shortest paths Patt-Shamir, Boaz aut Peleg, David aut Enthalten in Distributed computing Springer Berlin Heidelberg, 1986 32(2018), 2 vom: 13. Feb., Seite 133-157 (DE-627)13042885X (DE-600)635600-X (DE-576)01592789X 0178-2770 nnns volume:32 year:2018 number:2 day:13 month:02 pages:133-157 https://doi.org/10.1007/s00446-018-0326-6 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 AR 32 2018 2 13 02 133-157 |
| language |
English |
| source |
Enthalten in Distributed computing 32(2018), 2 vom: 13. Feb., Seite 133-157 volume:32 year:2018 number:2 day:13 month:02 pages:133-157 |
| sourceStr |
Enthalten in Distributed computing 32(2018), 2 vom: 13. Feb., Seite 133-157 volume:32 year:2018 number:2 day:13 month:02 pages:133-157 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
CONGEST model Source detection Skeleton spanner Compact routing All-pairs shortest paths Single-souce shortest paths |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Distributed computing |
| authorswithroles_txt_mv |
Lenzen, Christoph @@aut@@ Patt-Shamir, Boaz @@aut@@ Peleg, David @@aut@@ |
| publishDateDaySort_date |
2018-02-13T00:00:00Z |
| hierarchy_top_id |
13042885X |
| dewey-sort |
14 |
| id |
OLC2054812315 |
| 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">OLC2054812315</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403073113.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2018 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00446-018-0326-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054812315</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00446-018-0326-6-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="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lenzen, Christoph</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed distance computation and routing with small messages</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</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) 2018</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$-bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">CONGEST model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Source detection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Skeleton spanner</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compact routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">All-pairs shortest paths</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Single-souce shortest paths</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Patt-Shamir, Boaz</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Peleg, David</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Distributed computing</subfield><subfield code="d">Springer Berlin Heidelberg, 1986</subfield><subfield code="g">32(2018), 2 vom: 13. Feb., Seite 133-157</subfield><subfield code="w">(DE-627)13042885X</subfield><subfield code="w">(DE-600)635600-X</subfield><subfield code="w">(DE-576)01592789X</subfield><subfield code="x">0178-2770</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:32</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:2</subfield><subfield code="g">day:13</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:133-157</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00446-018-0326-6</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">32</subfield><subfield code="j">2018</subfield><subfield code="e">2</subfield><subfield code="b">13</subfield><subfield code="c">02</subfield><subfield code="h">133-157</subfield></datafield></record></collection>
|
| author |
Lenzen, Christoph |
| spellingShingle |
Lenzen, Christoph ddc 004 ddc 620 misc CONGEST model misc Source detection misc Skeleton spanner misc Compact routing misc All-pairs shortest paths misc Single-souce shortest paths Distributed distance computation and routing with small messages |
| authorStr |
Lenzen, Christoph |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)13042885X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 620 - Engineering & allied operations |
| delete_txt_mv |
keep |
| author_role |
aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0178-2770 |
| topic_title |
004 VZ 620 VZ Distributed distance computation and routing with small messages CONGEST model Source detection Skeleton spanner Compact routing All-pairs shortest paths Single-souce shortest paths |
| topic |
ddc 004 ddc 620 misc CONGEST model misc Source detection misc Skeleton spanner misc Compact routing misc All-pairs shortest paths misc Single-souce shortest paths |
| topic_unstemmed |
ddc 004 ddc 620 misc CONGEST model misc Source detection misc Skeleton spanner misc Compact routing misc All-pairs shortest paths misc Single-souce shortest paths |
| topic_browse |
ddc 004 ddc 620 misc CONGEST model misc Source detection misc Skeleton spanner misc Compact routing misc All-pairs shortest paths misc Single-souce shortest paths |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Distributed computing |
| hierarchy_parent_id |
13042885X |
| dewey-tens |
000 - Computer science, knowledge & systems 620 - Engineering |
| hierarchy_top_title |
Distributed computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)13042885X (DE-600)635600-X (DE-576)01592789X |
| title |
Distributed distance computation and routing with small messages |
| ctrlnum |
(DE-627)OLC2054812315 (DE-He213)s00446-018-0326-6-p |
| title_full |
Distributed distance computation and routing with small messages |
| author_sort |
Lenzen, Christoph |
| journal |
Distributed computing |
| journalStr |
Distributed computing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 600 - Technology |
| recordtype |
marc |
| publishDateSort |
2018 |
| contenttype_str_mv |
txt |
| container_start_page |
133 |
| author_browse |
Lenzen, Christoph Patt-Shamir, Boaz Peleg, David |
| container_volume |
32 |
| class |
004 VZ 620 VZ |
| format_se |
Aufsätze |
| author-letter |
Lenzen, Christoph |
| doi_str_mv |
10.1007/s00446-018-0326-6 |
| dewey-full |
004 620 |
| title_sort |
distributed distance computation and routing with small messages |
| title_auth |
Distributed distance computation and routing with small messages |
| abstract |
Abstract We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$-bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications. © The Author(s) 2018 |
| abstractGer |
Abstract We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$-bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications. © The Author(s) 2018 |
| abstract_unstemmed |
Abstract We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$-bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications. © The Author(s) 2018 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_2244 GBV_ILN_4126 GBV_ILN_4277 GBV_ILN_4318 GBV_ILN_4319 |
| container_issue |
2 |
| title_short |
Distributed distance computation and routing with small messages |
| url |
https://doi.org/10.1007/s00446-018-0326-6 |
| remote_bool |
false |
| author2 |
Patt-Shamir, Boaz Peleg, David |
| author2Str |
Patt-Shamir, Boaz Peleg, David |
| ppnlink |
13042885X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00446-018-0326-6 |
| up_date |
2024-07-04T00:28:49.355Z |
| _version_ |
1803606220452397056 |
| 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">OLC2054812315</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403073113.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2018 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00446-018-0326-6</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054812315</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00446-018-0326-6-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="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Lenzen, Christoph</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Distributed distance computation and routing with small messages</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</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) 2018</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We consider shortest paths computation and related tasks from the viewpoint of network algorithms, where the n-node input graph is also the computational system: nodes represent processors and edges represent communication links, which can in each time step carry an $$\mathcal {O}(\log n)$$-bit message. We identify several basic distributed distance computation tasks that are highly useful in the design of more sophisticated algorithms and provide efficient solutions. We showcase the utility of these tools by means of several applications.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">CONGEST model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Source detection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Skeleton spanner</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Compact routing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">All-pairs shortest paths</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Single-souce shortest paths</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Patt-Shamir, Boaz</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Peleg, David</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Distributed computing</subfield><subfield code="d">Springer Berlin Heidelberg, 1986</subfield><subfield code="g">32(2018), 2 vom: 13. Feb., Seite 133-157</subfield><subfield code="w">(DE-627)13042885X</subfield><subfield code="w">(DE-600)635600-X</subfield><subfield code="w">(DE-576)01592789X</subfield><subfield code="x">0178-2770</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:32</subfield><subfield code="g">year:2018</subfield><subfield code="g">number:2</subfield><subfield code="g">day:13</subfield><subfield code="g">month:02</subfield><subfield code="g">pages:133-157</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00446-018-0326-6</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_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">32</subfield><subfield code="j">2018</subfield><subfield code="e">2</subfield><subfield code="b">13</subfield><subfield code="c">02</subfield><subfield code="h">133-157</subfield></datafield></record></collection>
|
| score |
7.4007425 |