NDLI: Asynchronous Shared Channel

Please wait, while we are loading the content...

Some Sequential Algorithms are Almost Always Parallel

Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks

Analyzing Contention and Backoff in Asynchronous Shared Memory

LCL Problems on Grids

Blockchains and the Future of Distributed Computing

A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities

Recoverable Mutual Exclusion in Sub-logarithmic Time

Effectiveness of Delaying Timestamp Computation

Verifiable Outsourced Computation: A Survey

FruitChains: A Fair Blockchain

Greedy Routing and the Algorithmic Small-World Phenomenon

Towards Efficient Verification of Population Protocols

The Space Requirement of Local Forwarding on Acyclic Networks

A Layered Architecture for Erasure-Coded Consistent Distributed Storage

On the Multiparty Communication Complexity of Testing Triangle-Freeness

Distributed Approximation of Maximum Independent Set and Maximum Matching

Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model

Symmetry Breaking with Noisy Processes

Coordination Without Prior Agreement

Triangle Finding and Listing in CONGEST Networks

Clocked Population Protocols

Communication Primitives in Cognitive Radio Networks

Seeing is Believing: A Client-Centric Specification of Database Isolation

What Can be Sampled Locally?

Deterministic Distributed (Delta + o(Delta))-Edge-Coloring, and Vertex-Coloring of Graphs with Bounded Diversity

Transactional Lock Elision Meets Combining

The Power of Choice in Priority Scheduling

Ignore or Comply?: On Breaking Symmetry in Consensus

Asynchronous Shared Channel

A Distributed Learning Dynamics in Social Groups

Broadcasting in Noisy Radio Networks

Space Complexity of Fault-Tolerant Register Emulations

Distributed MST and Routing in Almost Mixing Time

Optimal Distance Labeling Schemes for Trees

On Using Time Without Clocks via Zigzag Causality

A Template for Implementing Fast Lock-free Trees Using HTM

Life Beyond Set Agreement

Self-organized Segregation on the Grid

Brief Announcement: Population Protocols for Leader Election and Exact Majority with $O(log^{2}$ n) States and $O(log^{2}$ n) Convergence Time

Gossip in a Smartphone Peer-to-Peer Network

Brief Announcement: Readers of Wait-Free Unbounded Registers Must Write

Distributed MIS via All-to-All Communication

Brief Announcement: How Large is your Graph?

Brief Announcement: Proust: A Design Space for Highly-Concurrent Transactional Data Structures

Adding Concurrency to Smart Contracts

Brief Announcement: Hierarchical Consensus

Brief Announcement: Efficient Self-Stabilizing 1-Maximal Matching Algorithm for Arbitrary Networks

Brief Announcement: Byzantine-Tolerant Machine Learning

Brief Announcement: Fast Shared Counting using (O(n)) Compare-and-Swap Registers

Brief Announcement: Optimal Address-Oblivious Epidemic Dissemination

Brief Announcement: Distributed Approximation for Tree Augmentation

Brief Announcement: Gossiping with Latencies

Brief Announcement: Statement Voting and Liquid Democracy

Brief Announcement: Secure Self-Stabilizing Computation

Brief Announcement: Certified Multiplicative Weights Update: Verified Learning Without Regret

Brief Announcement: Fence Insertion for Straight-line Programs is in P

Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control

Brief Announcement: A Probabilistic Performance Model and Tuning Framework for Eventually Consistent Distributed Storage Systems

Brief Announcement: Rapid Asynchronous Plurality Consensus

Stateless Computation

Brief Announcement: Symmetry Breaking in the CONGEST Model: Time- and Message-Efficient Algorithms for Ruling Sets

Brief Announcement: Object Oriented Consensus

Asynchronous Shared Channel

Content Provider	ACM Digital Library
Author	Stachowiak, Grzegorz De Marco, Gianluca
Abstract	In this work we address the question whether a simple shared channel could be efficiently utilized, that is, with a constant throughput and linear packet latency. A shared channel (also called a multiple access channel), introduced nearly 50 years ago in the context of the Ethernet [36], is among the most popular and widely studied models of communication and distributed computing. In a nutshell, a number of stations is able to communicate by transmitting and listening to a shared channel, and a message is successfully delivered to all stations if and only if its source station is the only transmitter at a time. Despite of a vast amount of work in the last decades, many fundamental questions remain open, such as: What is the impact of asynchrony on channel utilization? How important is the knowledge/estimate of the number of contenders? Could non-adaptive protocols (i.e., random codes) be asymptotically as efficient as adaptive protocols? In this work we present a broad picture of results answering the above mentioned questions for a fundamental problem of contention resolution, in which each of the contending stations needs to broadcast successfully its message. We show that adaptive algorithms or algorithms with the knowledge of contention size k (i.e., random codes with knowledge of k) achieve constant channel throughput and linear message latency even for very weak channels, i.e., with feedback restricted to simple acknowledgments and in the absence of synchronization. This asymptotically optimal performance cannot be extended to other settings --- we prove that there is no non-adaptive algorithm without the knowledge of contention size k achieving throughput \omega((\log\log k)^2/(\log k)) and/or admitting latency o(k\log k/(\log\log k)^2). This means, in particular, that coding (even random) with acknowledgments is not very efficient on a shared channel without synchronization or estimate of contention size. We also present a non-adaptive algorithm with no knowledge of contention size that almost matches these two complexities. More specifically, it achieves latency O(k\log^2 k) and channel utilization \Omega(1/\log^2 k) even if stations do not switch off after successful transmissions (and thus, could disturb other stations in succeeding), and could be improved by factor \Theta(\log\log k) if stations switch off after acknowledgment. Despite the absense of a collision detection mechanism, our algorithms are also efficient in terms of energy. The maximum number of channel accesses (including transmissions and listenings) for our non-adaptive solutions, with and without knowledge of k, is respectively O(\log k) and O(\log^2 k) whp. Regarding the adaptive algorithm, we argue that a simple modification of our protocol preserves constant throughput and linear latency while achieving O(\log k) maximum number of channel accesses per station whp.
Starting Page	391
Ending Page	400
Page Count	10
File Format	PDF
ISBN	9781450349925
DOI	10.1145/3087801.3087831
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2017-07-25
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Lower bound Multiple-access channel Shared channel Randomized algorithms Contention resolution Distributed algorithms
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in