Hostname: page-component-7dd5485656-bvgqh Total loading time: 0 Render date: 2025-10-31T22:21:20.883Z Has data issue: false hasContentIssue false
  • English
  • Français

On a Model for the Storage of Files on a Hardware. II. Evolution of a Typical Data Block

Part of: Geometric probability and stochastic geometry Stochastic processes Markov processes

Published online by Cambridge University Press:  14 July 2016

Vincent Bansaye
Vincent Bansaye*
Affiliation:
Université Pierre et Marie Curie and CNRS
*
∗ Postal address: Laboratoire de Probabilités et Modèles Aléatoires, Université Pierre et Marie Curie, UMR 7599, 175 rue du Chevaleret, 75013 Paris, France. Email address: bansaye@ccr.jussieu.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We consider the generalized version in continuous time of the parking problem of Knuth introduced in Bansaye (2006). Files arrive following a Poisson point process and are stored on a hardware identified with the real line, at the right of their arrival point. Here we study the evolution of the endpoints of the data block straddling 0, which is empty at time 0 and is equal to R at a deterministic time.

Keywords

Parking problemdata storagerandom coveringPoisson point processLévy process

MSC classification

Secondary: 60D05: Geometric probability and stochastic geometry 60G55: Point processes 60J80: Branching processes (Galton-Watson, birth-and-death, etc.)

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 44 , Issue 4 , December 2007 , pp. 901 - 927
Copyright
Copyright © Applied Probability Trust 2007 

References

[1] Bansaye, V. (2006). On a model for the storage of files on a hardware I: statistics at a fixed time and asymptotics. Preprint, LPMA, Université Pierre et Marie Curie. Available at http://arxiv.org/abs/math/0611432.Google Scholar
[2] Bertoin, J. (1996). Lévy Processes (Cambridge Tracts Math. 121). Cambridge University Press.Google Scholar
[3] Bertoin, J. (1999). Subordinators: examples and applications. In Lectures on Probability Theory and Statistics (Saint-Flour, 1997; Lecture Notes Math. 1717), Springer, Berlin, pp. 1–91.CrossRefGoogle Scholar
[4] Bertoin, J. (2000). Subordinators, Lévy processes with no negative Jumps, and branching processes. Lecture notes for MaPhySto. Available at http://www.maphysto.dk/publications/MPS-LN/2000/8.pdf.Google Scholar
[5] Chassaing, P. and Flajolet, P. (2003). Hachage, arbres, chemins and graphes. Gazette Math. 95, 29–49.Google Scholar
[6] Chassaing, P. and Louchard, G. (2002). Phase transition for parking blocks, Brownian excursion and coalescence. Random Structures Algorithms 21, 76–119.Google Scholar
[7] Feller, W. (1971). An Introduction to Probability Theory and Its Applications, Vol. II, 2nd edn. John Wiley, New York.Google Scholar
[8] Flajolet, P., Poblete, P. and Viola, A. (1998). On the analysis of linear probing hashing. Algorithica 22, 490–515.Google Scholar
[9] Foata, D. and Riordan, J. (1974). Mappings of acyclic and parking functions. Aequationes Math. 10, 10–22.Google Scholar
[10] Kingman, J. F. C. (1993). Poisson Processes (Oxford Studies Prob. 3). Oxford University Press.Google Scholar
[11] Millar, P. W. (1977). Zero-one laws and the minimum of a Markov process. Trans. Amer. Math. Soc. 226, 365–391.Google Scholar
[12] Pitman, J. (2006). Combinatorial Stochastic Processes (Lecture Notes Math. 1875). Springer, Berlin.Google Scholar
[13] Sato, K. (1999). Lévy Processes and Infinitely Divisible Distributions (Cambridge Studies Adv. Math. 68). Cambridge University Press.Google Scholar
[14] Winkel, M. (2005). Electronic foreign-exchange markets and passage events of independent subordinators. J. Appl. Prob. 42, 138–152.Google Scholar