#	Pagina
attuale pagina	/open-h2020/projects/212699/index.html

Opendata, web and dolomites

BANDWIDTH SIGNED

The cost of limited communication bandwidth in distributed computing

Total Cost €

EC-Contrib. €

Partnership

Views

BANDWIDTH project word cloud

Explore the words cloud of the BANDWIDTH project. It provides you a very rough idea of what is the project "BANDWIDTH" about.

understand practical limited spot lower environment heart fact literature underlie algorithms gaps local stronger messages brings amazingly informally unlimited components colors fundamental prime upper relatively form theory family blind mere larger symmetry abundance nodes producing topology computing break holds distributed sending valid unpredictable assumptions network infrastructure technologies central behavior restriction provably huge limitations internet restricted foundations hops backed lack zooms complexity fast cornerstone giving incapable communication modern bounds unknown bandwidth coincidence powerful coloring dynamic small theoretical

Project "BANDWIDTH" data sheet

The following table provides information about the project.

Coordinator	TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY Organization address address: SENATE BUILDING TECHNION CITY city: HAIFA postcode: 32000 website: www.technion.ac.il contact info title: n.a. name: n.a. surname: n.a. function: n.a. email: n.a. telephone: n.a. fax: n.a.
Coordinator Country	Israel [IL]
Total cost	1˙486˙480 €
EC max contribution	1˙486˙480 € (100%)
Programme	1. H2020-EU.1.1. (EXCELLENT SCIENCE - European Research Council (ERC))
Code Call	ERC-2017-STG
Funding Scheme	ERC-STG
Starting year	2018
Duration (year-month-day)	from 2018-06-01 to 2023-05-31

Partnership

Take a look of project's partnership.

#	participants	country	role	EC contrib. [€]
1	TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY TECHNION - ISRAEL INSTITUTE OF TECHNOLOGY Organization address address: SENATE BUILDING TECHNION CITY city: HAIFA postcode: 32000 website: www.technion.ac.il contact info title: n.a. name: n.a. surname: n.a. function: n.a. email: n.a. telephone: n.a. fax: n.a.	IL (HAIFA)	coordinator	1˙486˙480.00

Map

Project objective

Distributed systems underlie many modern technologies, a prime example being the Internet. The ever-increasing abundance of distributed systems necessitates their design and usage to be backed by strong theoretical foundations.

A major challenge that distributed systems face is the lack of a central authority, which brings many aspects of uncertainty into the environment, in the form of unknown network topology or unpredictable dynamic behavior. A practical restriction of distributed systems, which is at the heart of this proposal, is the limited bandwidth available for communication between the network components.

A central family of distributed tasks is that of local tasks, which are informally described as tasks which are possible to solve by sending information through only a relatively small number of hops. A cornerstone example is the need to break symmetry and provide a better utilization of resources, which can be obtained by the task of producing a valid coloring of the nodes given some small number of colors. Amazingly, there are still huge gaps between the known upper and lower bounds for the complexity of many local tasks. This holds even if one allows powerful assumptions of unlimited bandwidth. While some known algorithms indeed use small messages, the complexity gaps are even larger compared to the unlimited bandwidth case. This is not a mere coincidence, and in fact the existing theoretical infrastructure is provably incapable of giving stronger lower bounds for many local tasks under limited bandwidth.

This proposal zooms in on this crucial blind spot in the current literature on the theory of distributed computing, namely, the study of local tasks under limited bandwidth. The goal of this research is to produce fast algorithms for fundamental distributed local tasks under restricted bandwidth, as well as understand their limitations by providing lower bounds.

Publications

List of publications.
year	authors and title	journal	last update
2018	Censor-Hillel, Keren; Paz, Ami; Ravid, Noam The Sparsest Additive Spanner via Multiple Weighted BFS Trees published pages: , ISSN: , DOI: 10.4230/lipics.opodis.2018.7	OPODIS2018 1	2020-02-28
2019	Censor-Hillel, Keren; Rabie, MikaÃ«l Distributed reconfiguration of maximal independent sets published pages: , ISSN: 1868-8969, DOI: 10.4230/LIPIcs.ICALP.2019.135	ICALP2019 1	2020-02-28
2019	Keren Censor-Hillel, Bernhard Haeupler, D. Ellis Hershkowitz and Goran Zuzic Erasure Correction for Noisy Radio Networks published pages: , ISSN: , DOI: 10.4230/lipics.disc.2019.10	DISC2019	2020-02-28
2019	Matthias Bonne, Keren Censor-Hillel Distributed Detection of Cliques in Dynamic Networks published pages: 132:1--132:15, ISSN: , DOI: 10.4230/lipics.icalp.2019.132	ICALP 2019	2020-02-28
2020	Keren Censor-Hillel, Dean Leitersdorf, Elia Turner Sparse matrix multiplication and triangle listing in the Congested Clique model published pages: 45-60, ISSN: 0304-3975, DOI: 10.1016/j.tcs.2019.11.006	Theoretical Computer Science 809	2020-02-28

Are you the coordinator (or a participant) of this project? Plaese send me more information about the "BANDWIDTH" project.

For instance: the website url (it has not provided by EU-opendata yet), the logo, a more detailed description of the project (in plain text as a rtf file or a word file), some pictures (as picture files, not embedded into any word file), twitter account, linkedin page, etc.

Send me an email (fabio@fabiodisconzi.com) and I put them in your project's page as son as possible.

Thanks. And then put a link of this page into your project's website.

The information about "BANDWIDTH" are provided by the European Opendata Portal: CORDIS opendata.