메뉴 건너뛰기




Volumn 12, Issue 1, 2002, Pages 1-22

A refinement of the Hunt-Kurtz theory of large loss networks, with an application to virtual partitioning

Author keywords

Functional law of large numbers; Liapounov function; Loss network; Partitioning; Trunk reservation

Indexed keywords


EID: 0036116140     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1015961154     Document Type: Article
Times cited : (12)

References (17)
  • 1
    • 0033184496 scopus 로고    scopus 로고
    • Three resource management policies for a resource with partition constraints
    • ALANYALI, M. (1999). Three resource management policies for a resource with partition constraints. Adv. Appl. Probab. 31 795-818.
    • (1999) Adv. Appl. Probab. , vol.31 , pp. 795-818
    • Alanyali, M.1
  • 2
    • 0000001335 scopus 로고
    • Asymptotic analysis of large single resource loss systems under heavy traffic, with applications to integrated networks
    • BEAN, N. G., GIBBENS, R. J. and ZACHARY, S. (1995). Asymptotic analysis of large single resource loss systems under heavy traffic, with applications to integrated networks. Adv. Appl. Probab. 27 273-292.
    • (1995) Adv. Appl. Probab. , vol.27 , pp. 273-292
    • Bean, N.G.1    Gibbens, R.J.2    Zachary, S.3
  • 3
    • 0031260676 scopus 로고    scopus 로고
    • Dynamic and equilibrium behavior of controlled loss networks
    • BEAN, N. G., GIBBENS, R. J. and ZACHARY, S. (1997). Dynamic and equilibrium behavior of controlled loss networks. Ann. Appl. Probab. 7 873-885.
    • (1997) Ann. Appl. Probab. , vol.7 , pp. 873-885
    • Bean, N.G.1    Gibbens, R.J.2    Zachary, S.3
  • 4
    • 0032095470 scopus 로고    scopus 로고
    • Virtual partitioning for robust resource sharing: Computational techniques for heterogeneous traffic
    • BORST, S. and MITRA, D. (1998). Virtual partitioning for robust resource sharing: computational techniques for heterogeneous traffic. IEEE Journal on Selected Areas in Communications 16 668-678.
    • (1998) IEEE Journal on Selected Areas in Communications , vol.16 , pp. 668-678
    • Borst, S.1    Mitra, D.2
  • 6
    • 21844515587 scopus 로고
    • Pathological behaviour in loss networks
    • HUNT, P. J. (1995). Pathological behaviour in loss networks. J. Appl. Probab. 32 519-533.
    • (1995) J. Appl. Probab. , vol.32 , pp. 519-533
    • Hunt, P.J.1
  • 8
    • 0031260683 scopus 로고    scopus 로고
    • Optimization via trunk reservation in single resource loss systems under heavy traffic
    • HUNT, P. J. and LAWS, C. N. (1997). Optimization via trunk reservation in single resource loss systems under heavy traffic. Ann. Appl. Probab. 7 1058-1079.
    • (1997) Ann. Appl. Probab. , vol.7 , pp. 1058-1079
    • Hunt, P.J.1    Laws, C.N.2
  • 9
    • 0000272473 scopus 로고
    • Blocking probabilities in large circuit-switched networks
    • KELLY, F. P. (1986). Blocking probabilities in large circuit-switched networks. Adv. Appl. Probab. 18 473-505.
    • (1986) Adv. Appl. Probab. , vol.18 , pp. 473-505
    • Kelly, F.P.1
  • 10
  • 11
    • 84971164241 scopus 로고
    • Optimal control and trunk reservation in loss networks
    • KEY, P. B. (1990). Optimal control and trunk reservation in loss networks. Probab. Engrg. Inform. Sci. 4 203-242.
    • (1990) Probab. Engrg. Inform. Sci. , vol.4 , pp. 203-242
    • Key, P.B.1
  • 12
    • 0031705014 scopus 로고    scopus 로고
    • Performance and fluid simulations of a novel shared buffer management system
    • IEEE, New York
    • KUMARAN, K. and MITRA, D. (1998). Performance and fluid simulations of a novel shared buffer management system. In Proceedings of IEEE INFOCOM 98 1449-1461. IEEE, New York.
    • (1998) Proceedings of IEEE INFOCOM , vol.98 , pp. 1449-1461
    • Kumaran, K.1    Mitra, D.2
  • 13
    • 84958061533 scopus 로고    scopus 로고
    • Virtual partitioning by dynamic priorities: A technique for fairly and efficiently sharing a resource between several services
    • (B. Plattner, ed.) Springer, New York
    • MITRA, D. and ZIEDINS, I. (1996). Virtual partitioning by dynamic priorities: a technique for fairly and efficiently sharing a resource between several services. In Broadband Communications, Proc. 1996 International Zurich Seminar (B. Plattner, ed.) 173-185. Springer, New York.
    • (1996) Broadband Communications, Proc. 1996 International Zurich Seminar , pp. 173-185
    • Mitra, D.1    Ziedins, I.2
  • 14
    • 0042534949 scopus 로고    scopus 로고
    • Robust admission control for heterogeneous ATM systems with both cell and call QoS requirements
    • (V. Ramaswami and P. E. Wirth, eds.) North-Holland, Amsterdam
    • MITRA, D., REIMAN, M. I. and WANG, J. (1997). Robust admission control for heterogeneous ATM systems with both cell and call QoS requirements. In Teletraffic Contributions for the Information Age (V. Ramaswami and P. E. Wirth, eds.) 1421-1432. North-Holland, Amsterdam.
    • (1997) Teletraffic Contributions for the Information Age , pp. 1421-1432
    • Mitra, D.1    Reiman, M.I.2    Wang, J.3
  • 16
    • 0002928857 scopus 로고    scopus 로고
    • The asymptotic behaviour of large loss networks
    • (F. P. Kelly, S. Zachary and I. Ziedins, eds.) Oxford University Press
    • ZACHARY, S. (1996). The asymptotic behaviour of large loss networks. In Stochastic Networks: Theory and Applications (F. P. Kelly, S. Zachary and I. Ziedins, eds.) 193-203. Oxford University Press.
    • (1996) Stochastic Networks: Theory and Applications , pp. 193-203
    • Zachary, S.1
  • 17
    • 0034337836 scopus 로고    scopus 로고
    • Dynamics of large uncontrolled loss networks
    • ZACHARY, S. (2000). Dynamics of large uncontrolled loss networks. J. Appl. Probab. 37 685-695.
    • (2000) J. Appl. Probab. , vol.37 , pp. 685-695
    • Zachary, S.1


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