A Queueing Analysis of Hashing with Lazy Deletion

DOI10.1137/0216073zbMath0626.60101OpenAlexW2060392318WikidataQ56559673 ScholiaQ56559673MaRDI QIDQ3029974

Christopher J. Van Wyk, Lawrence A. Shepp, John A. Morrison

Publication date: 1987

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://repository.upenn.edu/statistics_papers/409

zbMATH Keywords

storagedynamic dictionaryfirst passge timeslazy deletion

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Queueing theory (aspects of probability theory) (60K25) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30)

Related Items (3)

Busy periods in a system with heterogeneous servers or channels ⋮ Busy periods in M/M/\(\infty\) systems with heterogeneous servers ⋮ Maximum queue size and hashing with lazy deletion

This page was built for publication: A Queueing Analysis of Hashing with Lazy Deletion