Matches in SemOpenAlex for { <https://semopenalex.org/work/W4255432856> ?p ?o ?g. }
Showing items 1 to 77 of
77
with 100 items per page.
- W4255432856 abstract "Previous chapter Next chapter Full AccessProceedings Proceedings of the 2016 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and RobustnessMichael A. Bender, Jeremy T. Fineman, Seth Gilbert, and Maxwell YoungMichael A. Bender, Jeremy T. Fineman, Seth Gilbert, and Maxwell Youngpp.636 - 654Chapter DOI:https://doi.org/10.1137/1.9781611974331.ch47PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract Randomized exponential backoff is a widely deployed technique for coordinating access to a shared resource. A good backoff protocol should, arguably, satisfy three natural properties: (i) it should provide constant throughput, wasting as little time as possible; (ii) it should require few failed access attempts, minimizing the amount of wasted effort; and (iii) it should be robust, continuing to work efficiently even if some of the access attempts fail for spurious reasons. Unfortunately, exponential backoff has some well-known limitations in two of these areas: it provides poor (sub-constant) throughput (in the worst case), and is not robust (to adversarial disruption). The goal of this paper is to “fix” exponential backoff by making it scalable, particularly focusing on the case where processes arrive in an on-line, worst-case fashion. We present a relatively simple backoff protocol, Re-Backoff, that has, at its heart, a version of exponential backoff. It guarantees expected constant throughput with dynamic process arrivals and requires only an expected polylogarithmic number of access attempts per process. Re-Backoff is also robust to periods where the shared resource is unavailable for a period of time. If it is unavailable for D time slots, Re-Backoff provides the following guarantees. When the number of packets is a finite n, the average expected number of access attempts for successfully sending a packet is O(log2(n + D)). In the infinite case, the average expected number of access attempts for successfully sending a packet is O(log2(η + D)) where η is the maximum number of processes that are ever in the system concurrently. Previous chapter Next chapter RelatedDetails Published:2016eISBN:978-1-61197-433-1 https://doi.org/10.1137/1.9781611974331Book Series Name:ProceedingsBook Code:PRDA16Book Pages:viii + 2106" @default.
- W4255432856 created "2022-05-12" @default.
- W4255432856 creator A5000038347 @default.
- W4255432856 creator A5011772692 @default.
- W4255432856 creator A5042520814 @default.
- W4255432856 creator A5068761590 @default.
- W4255432856 date "2015-12-21" @default.
- W4255432856 modified "2023-09-26" @default.
- W4255432856 title "How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness" @default.
- W4255432856 doi "https://doi.org/10.1137/1.9781611974331.ch47" @default.
- W4255432856 hasPublicationYear "2015" @default.
- W4255432856 type Work @default.
- W4255432856 citedByCount "13" @default.
- W4255432856 countsByYear W42554328562016 @default.
- W4255432856 countsByYear W42554328562017 @default.
- W4255432856 countsByYear W42554328562018 @default.
- W4255432856 countsByYear W42554328562019 @default.
- W4255432856 countsByYear W42554328562020 @default.
- W4255432856 countsByYear W42554328562021 @default.
- W4255432856 countsByYear W42554328562022 @default.
- W4255432856 countsByYear W42554328562023 @default.
- W4255432856 crossrefType "proceedings-article" @default.
- W4255432856 hasAuthorship W4255432856A5000038347 @default.
- W4255432856 hasAuthorship W4255432856A5011772692 @default.
- W4255432856 hasAuthorship W4255432856A5042520814 @default.
- W4255432856 hasAuthorship W4255432856A5068761590 @default.
- W4255432856 hasBestOaLocation W42554328561 @default.
- W4255432856 hasConcept C104317684 @default.
- W4255432856 hasConcept C134306372 @default.
- W4255432856 hasConcept C151376022 @default.
- W4255432856 hasConcept C157764524 @default.
- W4255432856 hasConcept C185592680 @default.
- W4255432856 hasConcept C199360897 @default.
- W4255432856 hasConcept C2777027219 @default.
- W4255432856 hasConcept C30777684 @default.
- W4255432856 hasConcept C31258907 @default.
- W4255432856 hasConcept C33923547 @default.
- W4255432856 hasConcept C41008148 @default.
- W4255432856 hasConcept C48044578 @default.
- W4255432856 hasConcept C55493867 @default.
- W4255432856 hasConcept C555944384 @default.
- W4255432856 hasConcept C63479239 @default.
- W4255432856 hasConcept C76155785 @default.
- W4255432856 hasConcept C77088390 @default.
- W4255432856 hasConceptScore W4255432856C104317684 @default.
- W4255432856 hasConceptScore W4255432856C134306372 @default.
- W4255432856 hasConceptScore W4255432856C151376022 @default.
- W4255432856 hasConceptScore W4255432856C157764524 @default.
- W4255432856 hasConceptScore W4255432856C185592680 @default.
- W4255432856 hasConceptScore W4255432856C199360897 @default.
- W4255432856 hasConceptScore W4255432856C2777027219 @default.
- W4255432856 hasConceptScore W4255432856C30777684 @default.
- W4255432856 hasConceptScore W4255432856C31258907 @default.
- W4255432856 hasConceptScore W4255432856C33923547 @default.
- W4255432856 hasConceptScore W4255432856C41008148 @default.
- W4255432856 hasConceptScore W4255432856C48044578 @default.
- W4255432856 hasConceptScore W4255432856C55493867 @default.
- W4255432856 hasConceptScore W4255432856C555944384 @default.
- W4255432856 hasConceptScore W4255432856C63479239 @default.
- W4255432856 hasConceptScore W4255432856C76155785 @default.
- W4255432856 hasConceptScore W4255432856C77088390 @default.
- W4255432856 hasLocation W42554328561 @default.
- W4255432856 hasOpenAccess W4255432856 @default.
- W4255432856 hasPrimaryLocation W42554328561 @default.
- W4255432856 hasRelatedWork W1525643724 @default.
- W4255432856 hasRelatedWork W1809257372 @default.
- W4255432856 hasRelatedWork W2131694803 @default.
- W4255432856 hasRelatedWork W2302028273 @default.
- W4255432856 hasRelatedWork W2320205417 @default.
- W4255432856 hasRelatedWork W2353611517 @default.
- W4255432856 hasRelatedWork W2364921833 @default.
- W4255432856 hasRelatedWork W2385771421 @default.
- W4255432856 hasRelatedWork W773289785 @default.
- W4255432856 hasRelatedWork W1585470534 @default.
- W4255432856 isParatext "false" @default.
- W4255432856 isRetracted "false" @default.
- W4255432856 workType "article" @default.