Tight bounds for synchronous communication of information using bits and silence

We establish worst-case and average-case lower bounds on the trade-off between the time and bit complexity for two-party communication in synchronous networks. We prove that the bounds are tight by presenting protocols whose bit-time complexity match the ones expressed by the lower bounds. We actual...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 129; no. 1; pp. 195 - 209
Main Authors O'Reilly, Una-May, Santoro, Nicola
Format Journal Article
LanguageEnglish
Published Elsevier B.V 15.06.2003
Online AccessGet full text
ISSN0166-218X
1872-6771
DOI10.1016/S0166-218X(02)00240-8

Cover

Abstract We establish worst-case and average-case lower bounds on the trade-off between the time and bit complexity for two-party communication in synchronous networks. We prove that the bounds are tight by presenting protocols whose bit-time complexity match the ones expressed by the lower bounds. We actually show that the algorithms are everywhere optimal: at any point of the trade-off and for any universe of data to be communicated, no other solution has better complexity to communicate any element of that universe (within a fixed relabeling). Similar results are derived when transmissions are subject to corruptions. In these results, the number of bits is a priori agreed upon. We also derive lower bounds on the worst case complexity of two-party communication when the number of bits is variable; the bounds prove that any improvement would be by an additive constant (even in presence of an oracle).
AbstractList We establish worst-case and average-case lower bounds on the trade-off between the time and bit complexity for two-party communication in synchronous networks. We prove that the bounds are tight by presenting protocols whose bit-time complexity match the ones expressed by the lower bounds. We actually show that the algorithms are everywhere optimal: at any point of the trade-off and for any universe of data to be communicated, no other solution has better complexity to communicate any element of that universe (within a fixed relabeling). Similar results are derived when transmissions are subject to corruptions. In these results, the number of bits is a priori agreed upon. We also derive lower bounds on the worst case complexity of two-party communication when the number of bits is variable; the bounds prove that any improvement would be by an additive constant (even in presence of an oracle).
Author Santoro, Nicola
O'Reilly, Una-May
Author_xml – sequence: 1
  givenname: Una-May
  surname: O'Reilly
  fullname: O'Reilly, Una-May
  email: unamay@ai.mit.edu
  organization: M.I.T., Artificial Intelligence Laboratory, Rm 933, 545 Technology Square, Cambridge, MA 02139, USA
– sequence: 2
  givenname: Nicola
  surname: Santoro
  fullname: Santoro, Nicola
  email: santoro@scs.carleton.ca
  organization: School of Computer Science, Carleton University, 358, Herzberg Building 1125 Colonel By Drive, Ottawa, K1S 5B6 Canada
BookMark eNqFUE1LAzEUDFLBtvoThBz1sJqPzSY3kaJVKChYwVvI5mXbSDeRZFfov3e3Fa9e3mNgZpiZGZqEGBxCl5TcUEKr27fhVAWj6uOKsGtCWEkKdYKmVElWVFLSCZr-Uc7QLOdPQggd0BS9rv1m2-E69gEybmLCeR_sNsUQ-4xtbNs-eGs6HwOODfZhoLRH2GcfNrj2XcYmAM5-54J15-i0MbvsLn7_HL0_PqwXT8XqZfm8uF8VlgnZFZxJARVXILgEUXIDJeOSS0sBeE0ASEO5U4YKYbgqFTADyjBbN0AFGMLnSBx9bYo5J9for-Rbk_aaEj3Oog-z6LGzJkwfZtFq0N0ddW4I9-1d0tn6MTj45GynIfp_HH4Aa9xthQ
Cites_doi 10.1006/jpdc.1996.0113
10.1007/BFb0020805
10.1145/48014.48247
10.1016/0020-0190(90)90187-3
10.1007/BF01783661
10.1007/BF02526036
ContentType Journal Article
Copyright 2002 Elsevier Science B.V.
Copyright_xml – notice: 2002 Elsevier Science B.V.
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/S0166-218X(02)00240-8
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1872-6771
EndPage 209
ExternalDocumentID 10_1016_S0166_218X_02_00240_8
S0166218X02002408
GroupedDBID -~X
6I.
AAFTH
ADEZE
AFTJW
AI.
ALMA_UNASSIGNED_HOLDINGS
FA8
FDB
OAUVE
VH1
WUQ
AAYXX
CITATION
ID FETCH-LOGICAL-c257t-3275d638d537d543ad423737c1dd3b0dd0f13e8a155a3848d2ad8a2cbfd15da03
IEDL.DBID .~1
ISSN 0166-218X
IngestDate Tue Jul 01 02:41:20 EDT 2025
Sat Apr 29 22:44:05 EDT 2023
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c257t-3275d638d537d543ad423737c1dd3b0dd0f13e8a155a3848d2ad8a2cbfd15da03
OpenAccessLink https://www.sciencedirect.com/science/article/pii/S0166218X02002408
PageCount 15
ParticipantIDs crossref_primary_10_1016_S0166_218X_02_00240_8
elsevier_sciencedirect_doi_10_1016_S0166_218X_02_00240_8
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2003-06-15
PublicationDateYYYYMMDD 2003-06-15
PublicationDate_xml – month: 06
  year: 2003
  text: 2003-06-15
  day: 15
PublicationDecade 2000
PublicationTitle Discrete Applied Mathematics
PublicationYear 2003
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Bar-Noi, Naor, Naor (BIB3) 1990; 4
Alimonti, Flocchini, Santoro (BIB1) 1996; 37
Bodlaender, Tel (BIB4) 1990; 36
U.M. O'Reilly, N. Santoro, Asynchronous-to-synchronous transformations, Proceedings of the Fourth International Conference on Principles of Distributed Systems, Paris, 2000, pp. 265–281.
N. Santoro, Computing with time: temporal dimensions in distributed computing, Proceedings of 28th Allerton Conference on Communication, Control and Computing, invited paper, Monticello, 1990, pp. 558–567.
N. Santoro, Synchronous distributed computing, Advanced Research School on Distributed Computing, University of Siena, 1999.
B. Schmeltz, Optimal tradeoffs between time and bit complexity in distributed synchronous rings, Proceedings of 8th Symposium on Theoretical Aspects of Computer Science, Hamburg, 1991, pp. 275–284.
Attiya, Snir, Warmuth (BIB2) 1988; 35
Overmars, Santoro (BIB6) 1997; 18
10.1016/S0166-218X(02)00240-8_BIB5
Bar-Noi (10.1016/S0166-218X(02)00240-8_BIB3) 1990; 4
10.1016/S0166-218X(02)00240-8_BIB7
Alimonti (10.1016/S0166-218X(02)00240-8_BIB1) 1996; 37
10.1016/S0166-218X(02)00240-8_BIB9
10.1016/S0166-218X(02)00240-8_BIB8
Bodlaender (10.1016/S0166-218X(02)00240-8_BIB4) 1990; 36
Attiya (10.1016/S0166-218X(02)00240-8_BIB2) 1988; 35
Overmars (10.1016/S0166-218X(02)00240-8_BIB6) 1997; 18
References_xml – reference: N. Santoro, Computing with time: temporal dimensions in distributed computing, Proceedings of 28th Allerton Conference on Communication, Control and Computing, invited paper, Monticello, 1990, pp. 558–567.
– reference: U.M. O'Reilly, N. Santoro, Asynchronous-to-synchronous transformations, Proceedings of the Fourth International Conference on Principles of Distributed Systems, Paris, 2000, pp. 265–281.
– volume: 18
  start-page: 246
  year: 1997
  end-page: 262
  ident: BIB6
  article-title: Improved bounds for electing a leader in a synchronous ring
  publication-title: Algorithmica
– volume: 4
  start-page: 3
  year: 1990
  end-page: 8
  ident: BIB3
  article-title: One bit algorithms
  publication-title: Distributed Comput.
– volume: 36
  start-page: 53
  year: 1990
  end-page: 56
  ident: BIB4
  article-title: Bit-optimal election in synchronous rings
  publication-title: Inform. Process. Lett.
– reference: B. Schmeltz, Optimal tradeoffs between time and bit complexity in distributed synchronous rings, Proceedings of 8th Symposium on Theoretical Aspects of Computer Science, Hamburg, 1991, pp. 275–284.
– volume: 35
  start-page: 845
  year: 1988
  end-page: 875
  ident: BIB2
  article-title: Computing on an anonymous ring
  publication-title: J. ACM
– volume: 37
  start-page: 123
  year: 1996
  end-page: 133
  ident: BIB1
  article-title: Finding the extrema of a distributed multiset of values
  publication-title: J. Parallel Distributed Comput.
– reference: N. Santoro, Synchronous distributed computing, Advanced Research School on Distributed Computing, University of Siena, 1999.
– volume: 37
  start-page: 123
  year: 1996
  ident: 10.1016/S0166-218X(02)00240-8_BIB1
  article-title: Finding the extrema of a distributed multiset of values
  publication-title: J. Parallel Distributed Comput.
  doi: 10.1006/jpdc.1996.0113
– ident: 10.1016/S0166-218X(02)00240-8_BIB5
– ident: 10.1016/S0166-218X(02)00240-8_BIB9
  doi: 10.1007/BFb0020805
– volume: 35
  start-page: 845
  year: 1988
  ident: 10.1016/S0166-218X(02)00240-8_BIB2
  article-title: Computing on an anonymous ring
  publication-title: J. ACM
  doi: 10.1145/48014.48247
– volume: 36
  start-page: 53
  year: 1990
  ident: 10.1016/S0166-218X(02)00240-8_BIB4
  article-title: Bit-optimal election in synchronous rings
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(90)90187-3
– ident: 10.1016/S0166-218X(02)00240-8_BIB7
– volume: 4
  start-page: 3
  year: 1990
  ident: 10.1016/S0166-218X(02)00240-8_BIB3
  article-title: One bit algorithms
  publication-title: Distributed Comput.
  doi: 10.1007/BF01783661
– ident: 10.1016/S0166-218X(02)00240-8_BIB8
– volume: 18
  start-page: 246
  year: 1997
  ident: 10.1016/S0166-218X(02)00240-8_BIB6
  article-title: Improved bounds for electing a leader in a synchronous ring
  publication-title: Algorithmica
  doi: 10.1007/BF02526036
SSID ssj0001218
ssj0000186
ssj0006644
Score 1.6386796
Snippet We establish worst-case and average-case lower bounds on the trade-off between the time and bit complexity for two-party communication in synchronous networks....
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 195
Title Tight bounds for synchronous communication of information using bits and silence
URI https://dx.doi.org/10.1016/S0166-218X(02)00240-8
Volume 129
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Complete Freedom Collection [SCCMFC]
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 20210915
  omitProxy: true
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: ACRLP
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: .~1
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals [SCFCJ]
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 20210415
  omitProxy: true
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: AIKHN
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect
  customDbUrl:
  eissn: 1872-6771
  dateEnd: 20211003
  omitProxy: true
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: IXB
  dateStart: 19790901
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1872-6771
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001218
  issn: 0166-218X
  databaseCode: AKRWK
  dateStart: 19790901
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELaqspQB8RTlUXlggMFt_IjjjqUCtSAqJFqpW2T7EtQlrUgZWPjt2HnQIiEGRlvyKTrHd5-T775D6EpansrIcuLFrIiIpCUq4YIAS5UyqQUGBUF2Ikcz8TAP5w00rGthPK2yiv1lTC-idTXTq7zZWy0WvRcHVqRLUPOAlUJdvoJdSE_r637SLQkpr4_Wqj-6bP4xuFwrKuVvSbydTX1PabuYvA7YTWGeqN8z11Y2ut9HexWMxIPySQ9QI8kO0e7TtwZrfoSep_7ejY3vm5Rjh01x_pFZr4XrLvvYbheG4GWKKwXVYujJ8K_YLNY51hngfFFUJh2j2f3ddDgiVf8EYt1BXBPOohDc-YKQRxAKrsFzYHhkKQA3AUCQUp4o7SCF5kooYBqUZtakQEPQAT9BzWyZJacIO5wnDaVRogUV2tq-ERCagNvUbbHq0zbq1r6JV6VMRrzFH5My9s6MAxYXzoxVG6nag_GP_Y5dKP976dn_l56jFivbJxIaXqDm-u09uXSgYm06xVvTQTuD8eNo4kbj-e0XSCvF2Q
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV09T8MwELVKGSgD4lOUTw8MMJgmtuO4IyCqFtoKiVbqZtm-BHVJK1IG_j12ktIiIQbGWPIpOtt3z8m7dwhdCctSEVtGvJgV4bGwRCaME6CplCa1QKEgyA5Fd8yfJtGkhh6WtTCeVlnF_jKmF9G6GmlV3mzNp9PWqwMrwiWoSUBLoa4NtOnQQOB5Xb3J_ZqGlBdIayy_uqx-Mrhkyyvpb0G8oVWBT2m8GLwO6E1hn8jfU9daOursop0KR-K78lX3UC3J9tH24FuENT9ALyN_8cbGN07KsQOnOP_MrBfDdbd9bNcrQ_AsxZWEavHo2fBv2EwXOdYZ4HxalCYdonHncfTQJVUDBWLdSVwQRuMI3AGDiMUQcabBk2BYbEMAZgKAIA1ZIrXDFJpJLoFqkJpak0IYgQ7YEapnsyw5RtgBPWHCME40D7m2tm04RCZgNnVrLNthE90ufaPmpU6GWiOQCaG8M1VAVeFMJZtILj2ofiy4crH876kn_596iba6o0Ff9XvD51PUoGUvRRJGZ6i-eP9Izh3CWJiLYgd9AXw_xnI
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Tight+bounds+for+synchronous+communication+of+information+using+bits+and+silence&rft.jtitle=Discrete+Applied+Mathematics&rft.au=O%27Reilly%2C+Una-May&rft.au=Santoro%2C+Nicola&rft.date=2003-06-15&rft.pub=Elsevier+B.V&rft.issn=0166-218X&rft.eissn=1872-6771&rft.volume=129&rft.issue=1&rft.spage=195&rft.epage=209&rft_id=info:doi/10.1016%2FS0166-218X%2802%2900240-8&rft.externalDocID=S0166218X02002408
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0166-218X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0166-218X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0166-218X&client=summon