Mathematics of Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


MATHEMATICS OF OPERATIONS RESEARCH
Vol. 32, No. 4, November 2007, pp. 890-918
DOI: 10.1287/moor.1070.0267
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Mikosch, T.
Right arrow Articles by Samorodnitsky, G.
Right arrow Search for Related Content

Scaling Limits for Cumulative Input Processes

Thomas Mikosch, Gennady Samorodnitsky

Laboratory of Actuarial Mathematics, University of Copenhagen, Universitetsparken 5, DK-2100 Copenhagen, Denmark
School of Operations Research and Information Engineering, Cornell University, Ithaca, New York 14853

mikosch{at}math.ku.dk
gennady{at}orie.cornell.edu

We study different scaling behavior of very general telecommunications cumulative input processes. The activities of a telecommunication system are described by a marked-point process ((Tn, Zn))nisinZ, where Tn is the arrival time of a packet brought to the system or the starting time of the activity of an individual source, and the mark Zn is the amount of work brought to the system at time Tn. This model includes the popular ON/OFF process and the infinite-source Poisson model. In addition to the latter models, one can flexibly model dependence of the interarrival times TnTn–1, clustering behavior due to the arrival of an impulse generating a flow of activities, but also dependence between the arrival process (Tn) and the marks (Zn). Similarly to the ON/OFF and infinite-source Poisson model, we can derive a multitude of scaling limits for the input process of one source or for the superposition of an increasing number of such sources. The memory in the input process depends on a variety of factors, such as the tails of the interarrival times or the tails of the distribution of activities initiated at an arrival Tn, or the number of activities starting at Tn. It turns out that, as in standard results on the scaling behavior of cumulative input processes in telecommunications, fractional Brownian motion or infinite-variance Lévy stable motion can occur in the scaling limit. However, the fractional Brownian motion is a much more robust limit than the stable motion, and many other limits may occur as well.

Key Words: telecommunications; cumulative input process; marked-point process; stable Lévy motion; fractional Brownian motion; scaling limits; long-range dependence
History: Received: April 11, 2006; revision received: September 6, 2006;





HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2007 by INFORMS.