메뉴 건너뛰기




Volumn 3, Issue 4, 1988, Pages 347-361

Two competing discrete-time queues with priority

Author keywords

competing queues; Discrete time queues; priority systems; random access

Indexed keywords


EID: 0004744354     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/BF01157855     Document Type: Article
Times cited : (15)

References (10)
  • 7
    • 84935773138 scopus 로고    scopus 로고
    • G. Fayolle and R. Iasnogorodski, Two coupled processors-the reduction to a Riemann-Hilbert problem, Wahrscheinlichkeitstheorie (1979) 1–27.
  • 10
    • 84935764186 scopus 로고    scopus 로고
    • P. Nain, Analysis of a two-node ALOHA network with infinite capacity buffers, preprint, 1986.


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