메뉴 건너뛰기




Volumn 12, Issue 5, 2004, Pages 865-878

Optimal call admission control on a single link with a GPS scheduler

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; FREQUENCY ALLOCATION; OPTIMIZATION; QUALITY OF SERVICE; TELECOMMUNICATION TRAFFIC;

EID: 7244256225     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2004.836133     Document Type: Article
Times cited : (9)

References (14)
  • 1
    • 0027612043 scopus 로고
    • A generalized processor sharing approach to flow control in integrated services networks: The single-node case
    • June
    • A. Parekh and R. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The single-node case," IEEE/ACM Trans. Networking, vol. 1, pp. 344-57, June 1993.
    • (1993) IEEE/ACM Trans. Networking , vol.1 , pp. 344-357
    • Parekh, A.1    Gallager, R.2
  • 2
    • 0028407068 scopus 로고
    • A generalized processor sharing approach to flow control in integrated services networks: The multiple node case
    • Apr
    • A. Parekh and R. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The multiple node case," IEEE/ACM Trans. Networking, vol. 2, pp. 137-150, Apr. 1994.
    • (1994) IEEE/ACM Trans. Networking , vol.2 , pp. 137-150
    • Parekh, A.1    Gallager, R.2
  • 3
    • 0033884558 scopus 로고    scopus 로고
    • Call admission control in generalized processor sharing (GPS) schedulers using nonrate proportional weighting of sessions
    • Mar
    • R. Szabó, P. Barta, F. Németh, and J. Biró, " Call admission control in generalized processor sharing (GPS) schedulers using nonrate proportional weighting of sessions," in Proc. IEEE INFOCOM, vol. 3, Mar. 2000, pp. 1243-1252.
    • (2000) Proc. IEEE INFOCOM , vol.3 , pp. 1243-1252
    • Szabó, R.1    Barta, P.2    Németh, F.3    Biró, J.4
  • 4
    • 0032623515 scopus 로고    scopus 로고
    • Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes
    • Mar
    • A. Elwalid and D. Mitra, "Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes," in Proc. IEEE INFOCOM, Mar. 1999, pp. 1220-1230.
    • (1999) Proc. IEEE INFOCOM , pp. 1220-1230
    • Elwalid, A.1    Mitra, D.2
  • 5
    • 84974742513 scopus 로고
    • Statistical analysis of the generalized processor sharing scheduling discipline
    • Sept
    • Z. Zhang, D. Towsley, and J. Kurose, "Statistical analysis of the generalized processor sharing scheduling discipline," in Proc. ACM SIGCOMM, Sept. 1994.
    • (1994) Proc. ACM SIGCOMM
    • Zhang, Z.1    Towsley, D.2    Kurose, J.3
  • 7
    • 0031673338 scopus 로고    scopus 로고
    • Closed-form deterministic end-to-end performance bounds for the generalized processor sharing scheduling discipline
    • Z. Zhang, Z. Liu, and D. Towsley, "Closed-form deterministic end-to-end performance bounds for the generalized processor sharing scheduling discipline," J. Combinatorial Optimization (Special Issue Scheduling), vol. 1, no. 4, 1998.
    • (1998) J. Combinatorial Optimization (Special Issue Scheduling) , vol.1 , Issue.4
    • Zhang, Z.1    Liu, Z.2    Towsley, D.3
  • 8
    • 0032072324 scopus 로고    scopus 로고
    • Application of network calculus to guaranteed service networks
    • May
    • J.-Y. Le Boudec, "Application of network calculus to guaranteed service networks," IEEE Trans. Inform. Theory, vol. 44, pp. 1087-1096, May 1998.
    • (1998) IEEE Trans. Inform. Theory , vol.44 , pp. 1087-1096
    • Le Boudec, J.-Y.1
  • 9
    • 0030211305 scopus 로고    scopus 로고
    • Efficient network QoS provisioning based on per node traffic shaping
    • Aug
    • L. Georgiadis, R. Guérin, V. Peris, and K. Sivarajan, " Efficient network QoS provisioning based on per node traffic shaping," IEEE/ACM Trans. Networking, vol. 4, pp. 482-501, Aug. 1996.
    • (1996) IEEE/ACM Trans. Networking , vol.4 , pp. 482-501
    • Georgiadis, L.1    Guérin, R.2    Peris, V.3    Sivarajan, K.4
  • 10
    • 7244240271 scopus 로고    scopus 로고
    • An efficient weight assignment process for GPS servers
    • G. Urvoy and G. Hébuterne, "An efficient weight assignment process for GPS servers," in Proc. ECUMN, 2000, pp. 171-178.
    • (2000) Proc. ECUMN , pp. 171-178
    • Urvoy, G.1    Hébuterne, G.2
  • 11
    • 0028574006 scopus 로고    scopus 로고
    • Generalized processor sharing networks with exponentially bounded burstiness arrivals
    • Jan
    • O. Yaron and M. Sidi, "Generalized processor sharing networks with exponentially bounded burstiness arrivals," in Proc. INFOCOM, Jan. 1996, pp. 628-634.
    • (1996) Proc. INFOCOM , pp. 628-634
    • Yaron, O.1    Sidi, M.2
  • 12
    • 0029754216 scopus 로고    scopus 로고
    • Bandwidth allocation for multiple qualities of service using generalized processor sharing
    • Jan
    • G. de Veciana and G. Kesidis, "Bandwidth allocation for multiple qualities of service using generalized processor sharing," IEEE Trans. Inform. Theory, vol. 42, pp. 268-72, Jan. 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 268-272
    • de Veciana, G.1    Kesidis, G.2
  • 13
    • 0033904290 scopus 로고    scopus 로고
    • Novel techniques for the design and control of generalized processor sharing schedulers for multiple QoS classes
    • K. Kumaran, G. E. Margrave, D. Mitra, and K. R. Stanley, "Novel techniques for the design and control of generalized processor sharing schedulers for multiple QoS classes," in Proc. IEEE INFOCOM, 2000.
    • (2000) Proc. IEEE INFOCOM
    • Kumaran, K.1    Margrave, G.E.2    Mitra, D.3    Stanley, K.R.4


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