메뉴 건너뛰기




Volumn , Issue , 2007, Pages 225-230

Approximate solution of multiclass queueing networks with region constraints

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTER NETWORKS; FUNCTIONS; METROPOLITAN AREA NETWORKS; QUEUEING THEORY; TELECOMMUNICATION; TELECOMMUNICATION SYSTEMS;

EID: 57849165451     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASCOTS.2007.10     Document Type: Conference Paper
Times cited : (6)

References (18)
  • 4
    • 0021480262 scopus 로고    scopus 로고
    • A. BRANDWAJN AND W. M. MCCORM.ACK, Efficient approximation for models of multiprogramming with shared domains, in Proc. ACM SIGMETRICS 1984, NY, USA, 1984, pp. 186-194.
    • A. BRANDWAJN AND W. M. MCCORM.ACK, Efficient approximation for models of multiprogramming with shared domains, in Proc. ACM SIGMETRICS 1984, NY, USA, 1984, pp. 186-194.
  • 6
    • 9944228938 scopus 로고    scopus 로고
    • Performance analysis for e-business: Impact of long range dependence., El
    • N. GAUTAM AND S. SESHADRI, Performance analysis for e-business: Impact of long range dependence., El. Co. Res., 2 (2002), pp. 233-253.
    • (2002) Co. Res , vol.2 , pp. 233-253
    • GAUTAM, N.1    SESHADRI, S.2
  • 7
    • 0020155162 scopus 로고
    • A generalization of norton's theorem for multiclass queueing networks
    • P. KRITZINGER, S. V. WYK, AND A. KRZESINSKI, A generalization of norton's theorem for multiclass queueing networks, Perf. Eval., 2 (1982), pp. 98-107.
    • (1982) Perf. Eval , vol.2 , pp. 98-107
    • KRITZINGER, P.1    WYK, S.V.2    KRZESINSKI, A.3
  • 8
    • 84976687548 scopus 로고
    • Multiclass queueing networks with population constrained subnetworks
    • A. E. KRZESINSKI AND P. TEUNISSEN, Multiclass queueing networks with population constrained subnetworks., in SIGMETRICS, 1985, pp. 128-139.
    • (1985) SIGMETRICS , pp. 128-139
    • KRZESINSKI, A.E.1    TEUNISSEN, P.2
  • 10
    • 57849105251 scopus 로고    scopus 로고
    • Simple analytic modeling of software contention
    • D. A. M.ENASCÉ, Simple analytic modeling of software contention, SIGMETRICS Perf. Eval. Rev., 29 (2002), pp. 24-30.
    • (2002) SIGMETRICS Perf. Eval. Rev , vol.29 , pp. 24-30
    • M.ENASCÉ, D.A.1
  • 11
    • 0034318160 scopus 로고    scopus 로고
    • A method for design and performance modeling of client/server systems
    • D. A. MENASCÉ AND H. GOMAA, A method for design and performance modeling of client/server systems, IEEE Trans. Softw. Eng., 26 (2000), pp. 1066-1085.
    • (2000) IEEE Trans. Softw. Eng , vol.26 , pp. 1066-1085
    • MENASCÉ, D.A.1    GOMAA, H.2
  • 12
    • 0029373016 scopus 로고
    • Software bottlenecking in client-server systems and rendezvous networks
    • J. E. NEILSON, C. M. WOODSIDE, D. C. PETRIU, AND S. MAJUMDAR, Software bottlenecking in client-server systems and rendezvous networks, IEEE Tr. Soft. Eng., 21 (1995), pp. 776-782.
    • (1995) IEEE Tr. Soft. Eng , vol.21 , pp. 776-782
    • NEILSON, J.E.1    WOODSIDE, C.M.2    PETRIU, D.C.3    MAJUMDAR, S.4
  • 14
    • 0019635078 scopus 로고    scopus 로고
    • C. H. SAUER, Approximate solution of queueing networks with simultaneous resource possession, IBM J. R. and D., 25 (1981).
    • C. H. SAUER, Approximate solution of queueing networks with simultaneous resource possession, IBM J. R. and D., 25 (1981).
  • 18
    • 0036298895 scopus 로고    scopus 로고
    • Qos-centric stateful resource management in information systems
    • N. YE, Qos-centric stateful resource management in information systems, Inf. Systems Frontiers, 4 (2002), pp. 149-160.
    • (2002) Inf. Systems Frontiers , vol.4 , pp. 149-160
    • YE, N.1


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