Parking arcs on the circle with applications to one-dimensional communication networks

DOI10.1214/aoap/1177004905zbMath0812.60090OpenAlexW2074796179MaRDI QIDQ1345584

Bjorn Poonen, Edward G. jun. Coffman, Colin L. Mallows

Publication date: 14 May 1995

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1177004905

zbMATH Keywords

parkingpackingasymptotic analysisfragmentationopen problemsring networkstick breaking

Mathematics Subject Classification ID

Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items

Counting intervals in the packing process, Saturation in a Markovian parking process, Packing random intervals, Random maximal independent sets and the unfriendly theater seating arrangement problem, The dual tree of a recursive triangulation of the disk