Delays for customers from different arrival streams to a queueALBIN, S. L.Management science. 1986, Vol 32, Num 3, pp 329-340, issn 0025-1909Article

A CLOSURE APPROXIMATION FOR THE NONSTATIONARY M/M/S QUEUEROTHKOPF MH; OREN SS.1979; MANAG. SCI.; USA; DA. 1979; VOL. 25; NO 6; PP. 522-534; BIBL. 28 REF.Article

Message delay analysis for TDMA schemes using contiguous-slot assignmentsRUBIN, I; ZHENSHENG ZHANG.IEEE transactions on communications. 1992, Vol 40, Num 4, pp 730-737, issn 0090-6778Article

Inequalities between arrival averages and time averages in stochastic processes arising from queeing theorySHUN-CHEN NIU.Operations research. 1984, Vol 32, Num 4, pp 785-795, issn 0030-364XArticle

Analysis of a queueing system with Server's walking process and with batch arrivalFUKAGAWA, Y; FUJII, S; YOSHIDA, S et al.International journal on policy and information. 1984, Vol 8, Num 1, pp 97-108, issn 0251-1266Article

CHEBYSHEV-LIKE INEQUALITIES FOR DAM MODELSTURNBULL BW.1972; J. APPL. PROBABIL.; G.B.; DA. 1972; VOL. 9; NO 3; PP. 617-629; BIBL. 12 REF.Serial Issue

A QUENING MODEL WITH VARIABLE ARRIVAL RATES.HADIDI N.1975; PERIOD. MATH. HUNGAR.; HONGR.; DA. 1975; VOL. 6; NO 1; PP. 39-47; BIBL. 11 REF.Article

Further transient analysis of the BMAP/G/1 queueLUCANTONI, D.Communications in statistics. Stochastic models. 1998, Vol 14, Num 1-2, pp 461-478, issn 0882-0287Article

Inequalities for queues with a learning serverPEKÖZ, Erol A; LAPRE, Michael.Queueing systems. 2001, Vol 37, Num 4, pp 337-347, issn 0257-0130Article

Markov MECO : A simple markovian model for approximating nonrenewal arrival processesJOHNSON, M. A.Communications in statistics. Stochastic models. 1998, Vol 14, Num 1-2, pp 419-442, issn 0882-0287Article

A queueing theoretic methodology for the analysis of separable conflict resolution algorithms with variable length elementary eventsPOLYZOS, G. C; MOLLE, M. L.Queueing systems. 1994, Vol 16, Num 3-4, pp 339-361, issn 0257-0130Article

Accuracy of traffic modeling in fast packet switchingFILIPIAK, J.IEEE transactions on communications. 1992, Vol 40, Num 4, pp 835-846, issn 0090-6778Article

Distributions of unexpended services in a D-node Markov-Renewal network distinguished by customer classPATTERSON, R. L.Applied mathematics and computation. 1992, Vol 52, Num 1, pp 67-82, issn 0096-3003Article

The cμ rule revisitedBUYUKKOC, C; VARAIYA, P; WALRAND, J et al.Advances in applied probability. 1985, Vol 17, Num 1, pp 237-238, issn 0001-8678Article

Burstiness descriptors for Markov renewal processes and Markovian arrival processesJOHNSON, M. A; LIU, D; NARAYANA, S et al.Communications in statistics. Stochastic models. 1997, Vol 13, Num 3, pp 619-646, issn 0882-0287Article

Some comments on the simple queueRAVICHANDRAN, N; GRAVEY, A.Advances in applied probability. 1984, Vol 16, Num 4, pp 933-935, issn 0001-8678Article

Stochastic modelling of random early detection based congestion control mechanism for bursty and correlated trafficGUAN, L; AWAN, I. U; WOODWARD, M. E et al.IEE Proceedings - Software (Print). 2004, Vol 151, Num 5, pp 240-247, issn 1462-5970, 8 p.Conference Paper

A convexity result for single-server exponential loss systems with non-stationary arrivalsSVORONOS, A; GREEN, L.Journal of applied probability. 1988, Vol 25, Num 1, pp 224-227, issn 0021-9002Article

DIE KOSTENMINIMALE BELASTUNG OFFENER WARTESYSTEME MIT POISSON-INPUT DER FORDERUNGEN. = LE CHARGEMENT DE COUT MINIMAL DES SYSTEMES D'ATTENTE OUVERTS AVEC DEMANDES POISSONNIENNESRUNGE W.1976; ZASTOSOW. MAT.; POLSKA; DA. 1976; VOL. 15; NO 1; PP. 7-15; ABS. POL.; BIBL. 5 REF.Article

ON A COMPUTATIONAL APPROACH TO SOME VALUE FUNCTIONS IN AN M/E_Z/1 QUEUE.MOORE SC; NARAYAN BHAT U.1975; A.I.I.E. TRANS.; U.S.A.; DA. 1975; VOL. 7; NO 1; PP. 73-76; BIBL. 9 REF.Article

PARTICOLARI PROCESSI MARKOFFIANI D'ARRIVO CHE SI ARRESTANO IN INTERVALLI FINITI DI TEMPO ECHE PRESENTANO LA SCAMBIABILITA DEGLI INCREMENTI. = PROCESSUS D'ARRIVEE MARKOVIENS AVEC ARRET DANS DES INTERVALLES DE TEMPS FINIS ET INCREMENTS ECHANGEABLESSIGALOTTI L.1975; R.C. IST. MAT. UNIV. TRIESTE; ITAL.; DA. 1975; VOL. 7; NO 2; PP. 173-181; ABS. ANGL.; BIBL. 5 REF.Article

TRANSIENT/STEADY-STATE SOLUTION OF A SINGLE CHANNEL QUEIRE WITH BULK ARRIVALS AND INTERMITTENTLY AVAILABLE SERVER.CHAUDHRY ML.1974; MATH. OPER.-FORSCH. STATIST.; DTSCH.; DA. 1974; VOL. 5; NO 4-5; PP. 307-314; ABS. ALLEM. FR.; BIBL. 9 REF.Article

THE ANALYSIS OF A STATISTICAL MULTIPLEXER WITH NON INDEPENDENT ARRIVALS AND ERRORSTOWSLEY D.1980; I.E.E.E. TRANS. COMMUNIC.; USA; DA. 1980; VOL. 28; NO 1; PP. 65-72; BIBL. 10 REF.Article

Efficient Window Processing over Disordered Data StreamsKIM, Hyeon-Gyu; KANG, Woo-Lam; KIM, Myoung-Ho et al.IEICE transactions on information and systems. 2010, Vol 93, Num 3, pp 635-638, issn 0916-8532, 4 p.Article

Characterization of the burst aggregation process in optical burst switchingMOUNTROUIDOU, Xenia; PERROS, Harry G.Lecture notes in computer science. 2006, pp 752-764, issn 0302-9743, isbn 3-540-34192-7, 1Vol, 13 p.Conference Paper