Paging against a distribution and IP networking

DOI10.1006/jcss.1997.1498zbMath0938.68011OpenAlexW1982664128MaRDI QIDQ1305939

Nick Reingold, Steven J. Phillips, Carstent Lund

Publication date: 22 September 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/41c56b77153c9aa25ed93043329cfd38ae4f1550

zbMATH Keywords

pagingdistributional pagingIP-paging

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (2)

Competitive caching of query results in search engines ⋮ A universal online caching algorithm based on pattern matching

Cites Work

• Unnamed Item
• Competitive paging with locality of reference
• Finite state Markovian decision processes
• Some Distribution-Free Aspects of Paging Algorithm Performance
• Competitive paging algorithms
• Locality in Page Reference Strings
• Empirically Derived Micromodels for Sequences of Page Exceptions

This page was built for publication: Paging against a distribution and IP networking