Fast network decomposition

Baruch Awerbuch; Bonnie Berger; Lenore Cowen; David Peleg

doi:10.1145/135419.135456

Fast network decomposition

Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg

Massachusetts Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

21 Scopus citations

Abstract

This paper obtains the first deterministic sublinear-time algorithm for network decomposition. The second contribution of this paper is an in-depth discussion and survey of all existing definitions of network decomposition. We also present a new reduction that efficiently transforms a weak-diameter version of the problem to a strong one. Thus our algorithm speeds up all alternate notions of network decomposition. Most importantly for the network applications, we obtain the first fast algorithm for constructing a sparse neighborhood cover of a network, thereby improving the distributed preprocessing time for all-pairs shortest paths, load balancing, broadcast, and bandwidth management.

Original language	English
Title of host publication	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
Publisher	Publ by ACM
Pages	169-177
Number of pages	9
ISBN (Print)	0897914953, 9780897914956
DOIs	https://doi.org/10.1145/135419.135456
State	Published - 1992
Externally published	Yes
Event	Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing - Vancouver, BC, Can Duration: 10 Aug 1992 → 12 Aug 1992

Publication series

Name	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference	Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing
City	Vancouver, BC, Can
Period	10/08/92 → 12/08/92

Access to Document

10.1145/135419.135456

Cite this

@inproceedings{551e7a1c8b954abf9c8f10c57a139040,

title = "Fast network decomposition",

abstract = "This paper obtains the first deterministic sublinear-time algorithm for network decomposition. The second contribution of this paper is an in-depth discussion and survey of all existing definitions of network decomposition. We also present a new reduction that efficiently transforms a weak-diameter version of the problem to a strong one. Thus our algorithm speeds up all alternate notions of network decomposition. Most importantly for the network applications, we obtain the first fast algorithm for constructing a sparse neighborhood cover of a network, thereby improving the distributed preprocessing time for all-pairs shortest paths, load balancing, broadcast, and bandwidth management.",

author = "Baruch Awerbuch and Bonnie Berger and Lenore Cowen and David Peleg",

year = "1992",

doi = "10.1145/135419.135456",

language = "אנגלית",

isbn = "0897914953",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Publ by ACM",

pages = "169--177",

booktitle = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

note = "Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing ; Conference date: 10-08-1992 Through 12-08-1992",

}

Awerbuch, B, Berger, B, Cowen, L & Peleg, D 1992, Fast network decomposition. in Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Publ by ACM, pp. 169-177, Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing, Vancouver, BC, Can, 10/08/92. https://doi.org/10.1145/135419.135456

Fast network decomposition. / Awerbuch, Baruch; Berger, Bonnie; Cowen, Lenore et al.
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Publ by ACM, 1992. p. 169-177 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Fast network decomposition

AU - Awerbuch, Baruch

AU - Berger, Bonnie

AU - Cowen, Lenore

AU - Peleg, David

PY - 1992

Y1 - 1992

N2 - This paper obtains the first deterministic sublinear-time algorithm for network decomposition. The second contribution of this paper is an in-depth discussion and survey of all existing definitions of network decomposition. We also present a new reduction that efficiently transforms a weak-diameter version of the problem to a strong one. Thus our algorithm speeds up all alternate notions of network decomposition. Most importantly for the network applications, we obtain the first fast algorithm for constructing a sparse neighborhood cover of a network, thereby improving the distributed preprocessing time for all-pairs shortest paths, load balancing, broadcast, and bandwidth management.

AB - This paper obtains the first deterministic sublinear-time algorithm for network decomposition. The second contribution of this paper is an in-depth discussion and survey of all existing definitions of network decomposition. We also present a new reduction that efficiently transforms a weak-diameter version of the problem to a strong one. Thus our algorithm speeds up all alternate notions of network decomposition. Most importantly for the network applications, we obtain the first fast algorithm for constructing a sparse neighborhood cover of a network, thereby improving the distributed preprocessing time for all-pairs shortest paths, load balancing, broadcast, and bandwidth management.

UR - http://www.scopus.com/inward/record.url?scp=0026965766&partnerID=8YFLogxK

U2 - 10.1145/135419.135456

DO - 10.1145/135419.135456

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0026965766

SN - 0897914953

SN - 9780897914956

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 169

EP - 177

BT - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

PB - Publ by ACM

T2 - Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing

Y2 - 10 August 1992 through 12 August 1992

ER -

Fast network decomposition

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this