Abstract
We provide solution techniques for the analysis of multiplexers with periodic arrival streams, which accurately account for the effects of active and idle periods and of gradual arrival. In the models considered in this paper, it is assumed that each source alternates (periodically) between active and idle periods of fixed durations. Incoming packets are transmitted on the network link and excess information is stored in the multiplexing buffer when the aggregate input rate exceeds the capacity of the link. We are interested in the probability distribution of the buffer content for a given network link speed as a function of the number of sources and their characteristics, i.e., rate and duration of idle and active periods. We derive this distribution from two models: discrete time and continuous time systems. Discrete time systems operate in a slotted fashion, with a slot defining the base unit for data generation and transmission. In particular, in each slot the link is capable of transmitting one data unit and conversely an active source generates one data unit in that time. The continuous time model of the paper falls in the category of fluid models. Compared to previous works we allow a more general model for the periodic packet arrival process of each source. In discrete time, this means that the active period of a source can now extend over several consecutive slots instead of a single slot as in previous models. In continuous time, packet arrivals are not required to be instantaneous, but rather the data generation process can now take place over the entire duration of the active period. In both cases, these generalizations allow us to account for the progressive arrival of source data as a function of both the source speed and the amount of data it generates in an active period.
Similar content being viewed by others
References
C. Partridge,Gigabit Networking (Addison-Wesley, 1994).
J.W. Roberts (ed.),COST 224: Performance Evaluation and Design of Multiservice Networks, Vol. EUR 14152 of Information Technologies and Sciences (Commission of the European Communities, 1992).
I. Cidon, I. Gopal, P.M. Gopal, R. Guérin, J. Janniello and M. Kaplan, The plaNET/ORBIT high speed network, J. High Speed Networks 2(3) (1993) 1–38.
K. Kvols and S. Blaabjerg, Bounds and approximations for the period on/off queue with applications to ATM traffic control,Proc. Infocom '92, Florence, Italy (1992) pp. 487–493.
J.W. Roberts, B. Bensaou and Y. Canetti, A traffic control framework for high speed data transmission,Proc. IFIP Workshop on Modelling and Performance Evaluation of ATM Technology, La Martinique (1993).
Framework for providing additional packet mode bearer services, CCITT recommendation I.122, CCITT Subworking Party XVIII/1-2 (1988).
L. Kosten, Stochastic theory of a multi-entry buffer (i), Delft Progress Report: Math. Eng. Math, and Inf. Eng. 1 (1974) 10–18.
L. Kosten, Liquid models for a type of information storage problems, Delft Progress Report: Math. Eng. Math, and Inf. Eng. 11 (1986) 71–86.
D. Mitra, Stochastic theory of a fluid model of producers and consumers coupled by a buffer, Adv. Appl. Prob. 20 (1988) 646–676.
T.E. Stern and A.I. Elwalid, Analysis of separable Markov-modulated models for informationhandling systems, Adv. Appl. Prob. (1991) 105–139.
D. Anick, D. Mitra and M.M. Sondhi, Stochastic theory of a data-handling system with multiple sources, Bell Syst. Tech. J. 61 (1982) 1871–1894.
A.E. Eckberg, The single server queue with periodic arrival process and deterministic service times, IEEE Trans. Commun. COM-27 (1979) 556–562.
B. Sengupta, A queue with superposition of arrival streams with an application to packet voice technology,Proc. Performance '90, eds. P.J.B. King, I. Mitrani and R.J. Pooley (Elsevier Science Publ., 1990) pp. 53–59.
A. Gravey, Temps d'attente et nombre de clients dans une file nD/D/1, Ann. Inst. Henri Poincaré, Prob. et Stat. 20 (1984) 53–73.
I. Cidon and M. Sidi, Performance analysis of asynchronous transfer mode (ATM) systems, Technical Report RC 14395, IBM Research Division, T.J. Watson Research Center, Yorktown Heights, New York (1989).
A. Bhargava, P. Humblet and M.G. Hluchyj, Queueing analysis of continuous bit-stream transport in packet networks,Proc. Globecom '89, Dallas (1989) pp. 903–907.
J.W. Roberts and J.T. Virtamo, The superposition of periodic cell arrival streams in an ATM multiplexer, IEEE Trans. Commun. 39 (1991) 298–303 (see alsoProc. Globecom '89).
L. Takacs,Combinatorial Methods in the Theory of Stochastic Processes (Wiley, New York, 1967).
V.E. Benes,General Stochastic Processes in the Theory of Queues (Addison Wesley, Reading, MA, 1963).
I. Norros, J.W. Roberts, A. Simonian and J.T. Virtamo, The superposition of variable bit rate sources in an ATM multiplexer, IEEE J. Select. Areas Commun. 9 (1991) 378–387.
J.-R. Louvion, J. Boyer and J.-B. Gravereaux, Statistical multiplexing of VBR sources in ATM networks,Proc. 3rd IEEE CAMAD, Torino, Italy (1990).
B. Bensaou, J. Guibert, J.W. Roberts and A. Simonian, Fluid queueing models for and ATM multiplex handling on/off sources, submitted to Ann. Oper. Res. (seeProc. 7th ITC Seminar, Morristown, NJ (1990)).
G. Ramamurthy and R.S. Dighe, Distributed source control: A network access control for integrated broadband packet networks, IEEE J. Select. Areas Commun. 9 (1991) 990–1002.
P.A. Humblet, A. Bhargava and M.G. Hluchyj, Ballot theorems applied to the transient analysis of nD/D/1 queues, IEEE Trans. Networking 1 (1993) 81–95.
Author information
Authors and Affiliations
Additional information
This work was done while at the IBM T.J. Watson Research Center.
This work was done while at the IBM T.J. Watson Research Center.
Part of the work was done while visiting the IBM T.J. Watson Research Center.
Rights and permissions
About this article
Cite this article
Cidon, I., Guérin, R., Kessler, I. et al. Analysis of a statistical multiplexer with generalized periodic sources. Queueing Syst 20, 139–169 (1995). https://doi.org/10.1007/BF01158435
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158435