메뉴 건너뛰기




Volumn 27, Issue 3, 1979, Pages 556-562

The Single Server Queue with Periodic Arrival Process and Deterministic Service Times

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY - QUEUEING THEORY;

EID: 0018440986     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOM.1979.1094425     Document Type: Article
Times cited : (66)

References (13)
  • 1
    • 0005744578 scopus 로고
    • Superposition of Point Processes
    • (P. A. W. Lewis, ed.) Wiley
    • E. Cinlar, “Superposition of Point Processes,” Stochastic point Processes (P. A. W. Lewis, ed.) Wiley, 1972, pp. 549–606.
    • (1972) Stochastic point Processes , pp. 549-606
    • Cinlar, E.1
  • 2
    • 0016917525 scopus 로고
    • An Approximate Time-Delay Analysis for Packet-Switching Switching Communication Networks
    • I. Rubin, “An Approximate Time-Delay Analysis for Packet-Switching Switching Communication Networks,” IEEE Trans. Comm., COM-24 (1976), pp. 210–222.
    • (1976) IEEE Trans. Comm., COM-24( , pp. 210-222
    • Rubin, I.1
  • 3
    • 0343451110 scopus 로고
    • The Output of a Buffered Data Communication System
    • M. Rubinovitch, “The Output of a Buffered Data Communication System,” Stoch. Proc. Appl., 1 (1973), pp. 375–382.
    • (1973) Stoch. Proc. Appl., 1( , pp. 375-382
    • Rubinovitch, M.1
  • 4
    • 0003057550 scopus 로고
    • Superimposed Renewal Processes and Storage with Gradual Input
    • J. W. Cohen, “Superimposed Renewal Processes and Storage with Gradual Input,” Stoch. Proc. Appl., 2 (1974), pp. 31–58.
    • (1974) Stoch. Proc. Appl., 2( , pp. 31-58
    • Cohen, J.W.1
  • 5
    • 0002017742 scopus 로고
    • The Stochastic Behavior of a Buffer with Non-Identical Input Lines
    • H. Kaspi and M. Rubinovitch, “The Stochastic Behavior of a Buffer with Non-Identical Input Lines,” Stoch. Proc. Appl., 3 (1975), pp. 73–88.
    • (1975) Stoch. Proc. Appl., 3( , pp. 73-88
    • Kaspi, H.1    Rubinovitch, M.2
  • 6
    • 0000861722 scopus 로고
    • A Proof for the Queueing Formula: L = λW
    • J. D. C. Little, “A Proof for the Queueing Formula: L = λ W,” Op. Res., 9 (1961), pp. 383–387.
    • (1961) Op. Res. , vol.9 , pp. 383-387
    • Little, J.D.C.1
  • 7
    • 52549096923 scopus 로고
    • Problemes stochastiques poses par le phenomene de formation d'une queue d'attente a un quichet et par des phenomenes apparentes
    • Gauthier-Villars, Paris
    • F. Pollaczek, “Problemes stochastiques poses par le phenomene de formation d'une queue d'attente a un quichet et par des phenomenes apparentes,” Mémorial des Sciences Mathématiques Gauthier-Villars, Paris, 1957.
    • (1957) Mémorial des Sciences Mathématiques
    • Pollaczek, F.1
  • 10
    • 84939011332 scopus 로고
    • Stationary Single-Server Queuing Processes with a Finite Number of Sources
    • G. Harrison, “Stationary Single-Server Queuing Processes with a Finite Number of Sources,” Op. Res., 7 (1959), pp. 458–467.
    • (1959) Op. Res. , vol.7 , pp. 458-467
    • Harrison, G.1
  • 12
    • 84939053104 scopus 로고    scopus 로고
    • On the Accuracy of Modeling System Components as M/G/1 Queues
    • submitted for publication
    • A. E. Eckberg, “On the Accuracy of Modeling System Components as M/G/ 1 Queues,” submitted for publication.
    • Eckberg, A.E.1
  • 13
    • 84915079327 scopus 로고
    • Analysis of Complex Queuing Networks by Decomposition
    • Melbourne
    • P. J. Kuehn, “Analysis of Complex Queuing Networks by Decomposition,” Proc. 8th I.T.C., Melbourne, 1976, pp. 236–1 to 236–8.
    • (1976) Proc. 8th I.T.C. , pp. 2361to-232368
    • Kuehn, P.J.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.