Reverse Poisson Counting Process with Random Observations

This paper introduces the Reverse Poisson Counting Process (RPCP), a stochastic model derived from the Poisson counting process with limited and random capacity, characterized by counting backward from a defined maximum level. Explicit analytical formulas are developed for key stochastic properties, including the probability mass function and mean, specifically for scenarios involving random capacity. The model is shown to represent extreme cases of established stochastic processes, such as the M/M/1 queue with instant service completion and the death-only process. Practical applications are discussed, focusing on enhancing streaming service availability and modeling transaction validation in decentralized networks with dynamic node populations on lightweight devices. Analysis under Binomial random capacity demonstrates the impact of node accountability on MSER and network reliability, highlighting the value of incorporating stochastic variations for optimizing system performance. The explicit formulas facilitate straightforward analysis and optimization of system functionals.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-11-10
DOI
https://doi.org/10.3390/math13223597
Primary Topic
Advanced Queuing Theory Analysis
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reverse Poisson Counting Process with Random Observations

Song-Kyoo Kim
Mathematics
Advanced Queuing Theory Analysis
article

Reverse Poisson Counting Process with Random Observations

Song-Kyoo Kim
article en

Abstract

This paper introduces the Reverse Poisson Counting Process (RPCP), a stochastic model derived from the Poisson counting process with limited and random capacity, characterized by counting backward from a defined maximum level. Explicit analytical formulas are developed for key stochastic properties, including the probability mass function and mean, specifically for scenarios involving random capacity. The model is shown to represent extreme cases of established stochastic processes, such as the M/M/1 queue with instant service completion and the death-only process. Practical applications are discussed, focusing on enhancing streaming service availability and modeling transaction validation in decentralized networks with dynamic node populations on lightweight devices. Analysis under Binomial random capacity demonstrates the impact of node accountability on MSER and network reliability, highlighting the value of incorporating stochastic variations for optimizing system performance. The explicit formulas facilitate straightforward analysis and optimization of system functionals.

MathematicsVol. 13(22)
Macao Polytechnic University (MO)
Openalex Percentile: Top 47%
Advanced Queuing Theory Analysis
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.