An operational view on renewal theory

Authors:
Wolfgang Kowalk
Affiliations:
Fachbereich Informatik der Uüiversiät Hamburg, Rothenbaumchaussee 67/69, 2000 Hamburg 13, West Germany.
Venue:
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1983

Citing 4
Cited 0

Fundamentals of queueing theory (2nd ed.).

Fundamentals of queueing theory (2nd ed.).
The Operational Analysis of Queueing Network Models

ACM Computing Surveys (CSUR)
Operational Analysis of Queueing Networks

Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
Extensions of Operational Analysis

Messung, Modellierung und Bewertung von Rechensystemen, GI/NTG-Fachtagung

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we derive a formula for the moments of the residual life in operational context, and show that the Paradox of Residual Life holds also in a finite queueing model. In addition, we prove the renewal theorem, show that forward and backward times are independent, and state the memoryless property. As applications we point out how to derive Takàcs recurrence formula for the moments of the waiting time and how to base the Markovian state theory on this.