FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2982289069> ?p ?o ?g. }

• W2982289069 abstract "A shared communication channel (also known as a multiple access channel) is among the most popular and widely studied models of communication and distributed computing. In this model, stations are able to communicate by transmitting and listening to a shared channel. A fundamental problem, called contention resolution, is to allow any station to successfully deliver its message by resolving the conflicts that arise when several stations transmit simultaneously on the channel. Despite a long history, many fundamental questions remain open in the realistic scenario when up to k stations out of n join the channel at different times. In this work we explore the impact of asynchrony, knowledge (or linear estimate) of contenders, and acknowledgments, on latency and channel utilization of non-adaptive deterministic algorithms. We show that if the number of contenders k (or a linear upper bound on it) is known and the stations switch-off after acknowledgment of their successful transmissions, the channel admits efficient solutions. In the same settings, we show that the ignorance of contention k makes the channel nearly quadratically less efficient, even if the stations could switch-off after acknowledgments. We present an algorithm which nearly matches this complexity (for unknown k) which is achieved even if acknowledgments are not provided. We show how the above algorithm could be further improved if stations could switch off upon acknowledgment. Surprisingly, our results imply an exponential impact of knowledge of contention on deterministic utilization of asynchronous channel by deterministic algorithms - it is known that for synchronized channel this feature does not influence asymptotically the channel utilization. The second implication concerns the impact of acknowledgments - they exponentially improve deterministic channel utilization if (some estimate of) k is known, unlike in the case of randomized algorithms where the improvement is only polynomial, while they are not particularly helpful in case of unknown contention. Finally, note that non-adaptive algorithms use fixed transmission schedules, which could be naturally translate into codes in the radio or beeping model - in this context our results indicate under which conditions such codes could be efficient." @default.
• W2982289069 created "2019-11-08" @default.
• W2982289069 creator A5012249678 @default.
• W2982289069 creator A5080318892 @default.
• W2982289069 creator A5087104329 @default.
• W2982289069 date "2019-07-01" @default.
• W2982289069 modified "2023-10-06" @default.
• W2982289069 title "Deterministic Contention Resolution on a Shared Channel" @default.
• W2982289069 cites W186304936 @default.
• W2982289069 cites W1935531700 @default.
• W2982289069 cites W1965978478 @default.
• W2982289069 cites W1983915440 @default.
• W2982289069 cites W1992784553 @default.
• W2982289069 cites W2028314380 @default.
• W2982289069 cites W2036925455 @default.
• W2982289069 cites W2039953096 @default.
• W2982289069 cites W2060305232 @default.
• W2982289069 cites W2066321007 @default.
• W2982289069 cites W2095247492 @default.
• W2982289069 cites W2096401441 @default.
• W2982289069 cites W2098243917 @default.
• W2982289069 cites W2116736083 @default.
• W2982289069 cites W2129648658 @default.
• W2982289069 cites W2137922115 @default.
• W2982289069 cites W2146468366 @default.
• W2982289069 cites W2414686050 @default.
• W2982289069 cites W2738031659 @default.
• W2982289069 cites W4235162847 @default.
• W2982289069 cites W4252364404 @default.
• W2982289069 cites W764027259 @default.
• W2982289069 doi "https://doi.org/10.1109/icdcs.2019.00054" @default.
• W2982289069 hasPublicationYear "2019" @default.
• W2982289069 type Work @default.
• W2982289069 sameAs 2982289069 @default.
• W2982289069 citedByCount "7" @default.
• W2982289069 countsByYear W29822890692020 @default.
• W2982289069 countsByYear W29822890692021 @default.
• W2982289069 countsByYear W29822890692022 @default.
• W2982289069 crossrefType "proceedings-article" @default.
• W2982289069 hasAuthorship W2982289069A5012249678 @default.
• W2982289069 hasAuthorship W2982289069A5080318892 @default.
• W2982289069 hasAuthorship W2982289069A5087104329 @default.
• W2982289069 hasConcept C11413529 @default.
• W2982289069 hasConcept C120314980 @default.
• W2982289069 hasConcept C127162648 @default.
• W2982289069 hasConcept C151319957 @default.
• W2982289069 hasConcept C179145077 @default.
• W2982289069 hasConcept C198104137 @default.
• W2982289069 hasConcept C2779019669 @default.
• W2982289069 hasConcept C31258907 @default.
• W2982289069 hasConcept C41008148 @default.
• W2982289069 hasConcept C76155785 @default.
• W2982289069 hasConcept C80444323 @default.
• W2982289069 hasConcept C82876162 @default.
• W2982289069 hasConceptScore W2982289069C11413529 @default.
• W2982289069 hasConceptScore W2982289069C120314980 @default.
• W2982289069 hasConceptScore W2982289069C127162648 @default.
• W2982289069 hasConceptScore W2982289069C151319957 @default.
• W2982289069 hasConceptScore W2982289069C179145077 @default.
• W2982289069 hasConceptScore W2982289069C198104137 @default.
• W2982289069 hasConceptScore W2982289069C2779019669 @default.
• W2982289069 hasConceptScore W2982289069C31258907 @default.
• W2982289069 hasConceptScore W2982289069C41008148 @default.
• W2982289069 hasConceptScore W2982289069C76155785 @default.
• W2982289069 hasConceptScore W2982289069C80444323 @default.
• W2982289069 hasConceptScore W2982289069C82876162 @default.
• W2982289069 hasLocation W29822890691 @default.
• W2982289069 hasOpenAccess W2982289069 @default.
• W2982289069 hasPrimaryLocation W29822890691 @default.
• W2982289069 hasRelatedWork W1504873071 @default.
• W2982289069 hasRelatedWork W2033005483 @default.
• W2982289069 hasRelatedWork W2038013988 @default.
• W2982289069 hasRelatedWork W2139676651 @default.
• W2982289069 hasRelatedWork W2144172854 @default.
• W2982289069 hasRelatedWork W2168346544 @default.
• W2982289069 hasRelatedWork W2298102683 @default.
• W2982289069 hasRelatedWork W2364921833 @default.
• W2982289069 hasRelatedWork W2805004358 @default.
• W2982289069 hasRelatedWork W3022658242 @default.
• W2982289069 isParatext "false" @default.
• W2982289069 isRetracted "false" @default.
• W2982289069 magId "2982289069" @default.
• W2982289069 workType "article" @default.