메뉴 건너뛰기




Volumn 48, Issue 2, 2005, Pages 137-154

Statistical admission control for real-time services under earliest deadline first scheduling

Author keywords

Call admission control; Deadline violation probability; Dominant time scale; Earliest deadline first; Quality of service

Indexed keywords

ASYMPTOTIC STABILITY; PROBABILITY; QUALITY OF SERVICE; SCHEDULING; STATISTICAL PROCESS CONTROL; TELECOMMUNICATION TRAFFIC;

EID: 16644395594     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2004.10.017     Document Type: Article
Times cited : (9)

References (36)
  • 1
    • 0027612043 scopus 로고
    • A generalized processor sharing approach to flow control in integrated services networks: The single-node case
    • A.K. Parekh, and R.G. Gallager A generalized processor sharing approach to flow control in integrated services networks: the single-node case IEEE/ACM Trans. Network. 1 3 1993 344 357
    • (1993) IEEE/ACM Trans. Network. , vol.1 , Issue.3 , pp. 344-357
    • Parekh, A.K.1    Gallager, R.G.2
  • 2
    • 0025419309 scopus 로고
    • A scheme for real-time channel establishment in wide-area networks
    • D. Ferrari, and D. Verma A scheme for real-time channel establishment in wide-area networks IEEE J. Select. Areas Commun. 8 3 1990 368 379
    • (1990) IEEE J. Select. Areas Commun. , vol.8 , Issue.3 , pp. 368-379
    • Ferrari, D.1    Verma, D.2
  • 3
  • 4
    • 0030398312 scopus 로고    scopus 로고
    • Exact admission control for networks with a bounded delay service
    • J. Liebeherr, D.E. Wrege, and D. Ferrari Exact admission control for networks with a bounded delay service IEEE/ACM Trans. Network. 4 6 1996 885 901
    • (1996) IEEE/ACM Trans. Network. , vol.4 , Issue.6 , pp. 885-901
    • Liebeherr, J.1    Wrege, D.E.2    Ferrari, D.3
  • 5
    • 0031236476 scopus 로고    scopus 로고
    • Optimal multiplexing on a single link: Delay and buffer requirements
    • L. Georgiadis, R. Guerin, and A.K. Parekh Optimal multiplexing on a single link: delay and buffer requirements IEEE Trans. Inform. Theory 43 5 1997 1518 1535
    • (1997) IEEE Trans. Inform. Theory , vol.43 , Issue.5 , pp. 1518-1535
    • Georgiadis, L.1    Guerin, R.2    Parekh, A.K.3
  • 6
    • 70349178807 scopus 로고    scopus 로고
    • Achieving high utilization in guaranteed services networks using earliest-deadline-first scheduling
    • Napa, CA, USA, May
    • F.M. Chiussi, V. Sivaraman, Achieving high utilization in guaranteed services networks using earliest-deadline-first scheduling, in: Proceedings of International Workshop on Quality of Service, Napa, CA, USA, May 1998
    • (1998) Proceedings of International Workshop on Quality of Service
    • Chiussi, F.M.1    Sivaraman, V.2
  • 7
    • 0033876311 scopus 로고    scopus 로고
    • Probabilistic end-to-end delay bounds for earliest deadline first scheduling
    • Tel-Aviv, Israel, March
    • M. Andrews, Probabilistic end-to-end delay bounds for earliest deadline first scheduling, in: Proceedings of the IEEE INFOCOM'00, Tel-Aviv, Israel, March 2000
    • (2000) Proceedings of the IEEE INFOCOM'00
    • Andrews, M.1
  • 8
    • 0035009497 scopus 로고    scopus 로고
    • End-to-end statistical delay service under GPS and EDF scheduling: A comparison study
    • Anchorage, AK, USA, April
    • V. Sivaraman, F.M. Chiussi, M. Gerla, End-to-end statistical delay service under GPS and EDF scheduling: a comparison study, in: Proceedings of the IEEE INFOCOM'01, Anchorage, AK, USA, April 2001
    • (2001) Proceedings of the IEEE INFOCOM'01
    • Sivaraman, V.1    Chiussi, F.M.2    Gerla, M.3
  • 9
    • 0031121271 scopus 로고    scopus 로고
    • D-BIND: An accurate traffic model for providing QoS guarantees to VBR traffic
    • E. Knightly, and H. Zhang D-BIND: an accurate traffic model for providing QoS guarantees to VBR traffic IEEE/ACM Trans. Network. 5 2 1997 219 231
    • (1997) IEEE/ACM Trans. Network. , vol.5 , Issue.2 , pp. 219-231
    • Knightly, E.1    Zhang, H.2
  • 10
    • 0032183484 scopus 로고    scopus 로고
    • Efficient admission control of piecewise linear traffic envelopes at EDF schedulers
    • V. Firoiu, J. Kurose, and D. Towsley Efficient admission control of piecewise linear traffic envelopes at EDF schedulers IEEE/ACM Trans. Network. 6 5 1998 558 570
    • (1998) IEEE/ACM Trans. Network. , vol.6 , Issue.5 , pp. 558-570
    • Firoiu, V.1    Kurose, J.2    Towsley, D.3
  • 11
    • 0029357589 scopus 로고
    • A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node
    • A. Elwalid, D. Mitra, and R.H. Wentworth A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM node IEEE J. Select. Areas Commun. 13 6 1995 1115 1127
    • (1995) IEEE J. Select. Areas Commun. , vol.13 , Issue.6 , pp. 1115-1127
    • Elwalid, A.1    Mitra, D.2    Wentworth, R.H.3
  • 12
    • 0032623515 scopus 로고    scopus 로고
    • Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes
    • A. Elwalid, D. Mitra, Design of generalized processor sharing schedulers which statistically multiplex heterogeneous QoS classes, in: Proceedings of the IEEE INFOCOM'99, New York, USA, March 1999
    • (1999) Proceedings of the IEEE INFOCOM'99
    • Elwalid, A.1    Mitra, D.2
  • 13
    • 0033904290 scopus 로고    scopus 로고
    • Novel techniques for the design and control of generalized processor sharing schedulers for multiple QoS classes
    • Tel-Aviv, Israel, March
    • K. Kumaran, G.E. Margrave, D. Mitra, K.R. Stanley, Novel techniques for the design and control of generalized processor sharing schedulers for multiple QoS classes, in: Proceedings of the IEEE INFOCOM'00, Tel-Aviv, Israel, March 2000
    • (2000) Proceedings of the IEEE INFOCOM'00
    • Kumaran, K.1    Margrave, G.E.2    Mitra, D.3    Stanley, K.R.4
  • 15
    • 0032651126 scopus 로고    scopus 로고
    • Inter-class resource sharing using statistical service envelopes
    • New York, NY, March
    • J. Qiu, E. Knightly, Inter-class resource sharing using statistical service envelopes, in: Proceedings of the IEEE INFOCOM'99, New York, NY, March 1999
    • (1999) Proceedings of the IEEE INFOCOM'99
    • Qiu, J.1    Knightly, E.2
  • 16
    • 0032136812 scopus 로고    scopus 로고
    • Effective bandwidths with priorities
    • A.W. Berger, and W. Whitt Effective bandwidths with priorities IEEE/ACM Trans. Network. 6 4 1998 447 460
    • (1998) IEEE/ACM Trans. Network. , vol.6 , Issue.4 , pp. 447-460
    • Berger, A.W.1    Whitt, W.2
  • 17
    • 0037971651 scopus 로고    scopus 로고
    • Priority queueing analysis for self-similar traffic in high-speed networks
    • Anchorage, AK, USA, May
    • Z. Quan, J.-M. Chung, Priority queueing analysis for self-similar traffic in high-speed networks, in: Proc. IEEE ICC'03, Anchorage, AK, USA, May 2003
    • (2003) Proc. IEEE ICC'03
    • Quan, Z.1    Chung, J.-M.2
  • 18
    • 0029358794 scopus 로고
    • Statistical analysis of generalized processor sharing scheduling discipline
    • Z.-L. Zhang, D. Towsley, and J. Kurose Statistical analysis of generalized processor sharing scheduling discipline IEEE J. Select. Areas Commun. 13 6 1995 1071 1080
    • (1995) IEEE J. Select. Areas Commun. , vol.13 , Issue.6 , pp. 1071-1080
    • Zhang, Z.-L.1    Towsley, D.2    Kurose, J.3
  • 20
    • 0033169478 scopus 로고    scopus 로고
    • Statistical analysis of delay bound violations at an earliest deadline first (EDF) scheduler
    • V. Sivaraman, and F.M. Chiussi Statistical analysis of delay bound violations at an earliest deadline first (EDF) scheduler Perform. Evaluat. 36-37 1999 457 470
    • (1999) Perform. Evaluat. , vol.36-37 , pp. 457-470
    • Sivaraman, V.1    Chiussi, F.M.2
  • 23
    • 0242364205 scopus 로고    scopus 로고
    • A statistical framework for EDF scheduling
    • Z. Quan, and J.-M. Chung A statistical framework for EDF scheduling IEEE Commun. Lett. 7 10 2003 493 495
    • (2003) IEEE Commun. Lett. , vol.7 , Issue.10 , pp. 493-495
    • Quan, Z.1    Chung, J.-M.2
  • 24
    • 0032182693 scopus 로고    scopus 로고
    • A central-limit-theorem based approach for analyzing queue behavior in high-speed networks
    • J. Choe, and N.B. Shroff A central-limit-theorem based approach for analyzing queue behavior in high-speed networks IEEE/ACM Trans. Network. 6 5 1998 659 671
    • (1998) IEEE/ACM Trans. Network. , vol.6 , Issue.5 , pp. 659-671
    • Choe, J.1    Shroff, N.B.2
  • 25
    • 0032667028 scopus 로고    scopus 로고
    • Admission control for statistical QoS: Theory and practice
    • E.W. Knightly, and N.B. Shroff Admission control for statistical QoS: theory and practice IEEE Network 13 2 1999 20 29
    • (1999) IEEE Network , vol.13 , Issue.2 , pp. 20-29
    • Knightly, E.W.1    Shroff, N.B.2
  • 26
    • 0037687496 scopus 로고    scopus 로고
    • A measurement-analytic approach for QoS estimation in a network based on the dominant time scale
    • D.-Y. Eun, and N.B. Shroff A measurement-analytic approach for QoS estimation in a network based on the dominant time scale IEEE/ACM Trans. Network. 11 2 2003 222 235
    • (2003) IEEE/ACM Trans. Network. , vol.11 , Issue.2 , pp. 222-235
    • Eun, D.-Y.1    Shroff, N.B.2
  • 27
    • 84971179977 scopus 로고
    • Large deviations and overflow probabilities for the general single server queue, with applications
    • N.G. Duffield, and N. O'Connell Large deviations and overflow probabilities for the general single server queue, with applications Proc. Cambridge. Philos. Soc. 118 1995 363 374
    • (1995) Proc. Cambridge. Philos. Soc. , vol.118 , pp. 363-374
    • Duffield, N.G.1    O'Connell, N.2
  • 28
    • 0141770796 scopus 로고
    • Logarithmic asymptotics for steady-state tail probabilities in a single server queue
    • P.W. Glynn, and W. Whitt Logarithmic asymptotics for steady-state tail probabilities in a single server queue J. Appl. Prob. 31 1994 131 155
    • (1994) J. Appl. Prob. , vol.31 , pp. 131-155
    • Glynn, P.W.1    Whitt, W.2
  • 29
    • 0033238255 scopus 로고    scopus 로고
    • Cell loss asymptotics for buffers fed with a large number of independent stationary sources
    • N. Likhanov, and R.R. Mazumdar Cell loss asymptotics for buffers fed with a large number of independent stationary sources J. Appl. Prob. 36 1 1999 86 96
    • (1999) J. Appl. Prob. , vol.36 , Issue.1 , pp. 86-96
    • Likhanov, N.1    Mazumdar, R.R.2
  • 30
    • 84959708559 scopus 로고
    • The stability of a queue with non-independent inter-arrival and service times
    • R.M. Loynes The stability of a queue with non-independent inter-arrival and service times Proc. Cambridge Philos. Soc. 58 1962 497 520
    • (1962) Proc. Cambridge Philos. Soc. , vol.58 , pp. 497-520
    • Loynes, R.M.1
  • 31
    • 0035510001 scopus 로고    scopus 로고
    • MPEG-4 and H.263 video traces for network performance evaluation
    • F.H.P. Fitzek, and M. Reisslein MPEG-4 and H.263 video traces for network performance evaluation IEEE Network 15 6 2001 40 54
    • (2001) IEEE Network , vol.15 , Issue.6 , pp. 40-54
    • Fitzek, F.H.P.1    Reisslein, M.2
  • 32
    • 0032674803 scopus 로고    scopus 로고
    • A framework for robust measurement-based admission control
    • M. Grossglauser, and D.N. Tse A framework for robust measurement-based admission control IEEE/ACM Trans. Network. 7 3 1999 293 309
    • (1999) IEEE/ACM Trans. Network. , vol.7 , Issue.3 , pp. 293-309
    • Grossglauser, M.1    Tse, D.N.2
  • 33
    • 0036554082 scopus 로고    scopus 로고
    • Traffic equivalence and subistution in a multiplexer with applications to dynamic available capacity estimation
    • C. Courcoubetis, A. Dimakis, and G.D. Stamoulis Traffic equivalence and subistution in a multiplexer with applications to dynamic available capacity estimation IEEE/ACM Trans. Network. 10 2 2002 217 231
    • (2002) IEEE/ACM Trans. Network. , vol.10 , Issue.2 , pp. 217-231
    • Courcoubetis, C.1    Dimakis, A.2    Stamoulis, G.D.3
  • 34
    • 0033892665 scopus 로고    scopus 로고
    • Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping
    • Tel-Aviv, Israel, March
    • V. Sivaraman and F. Chiussi, Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping, in: Proceedings of the IEEE INFOCOM'00, Tel-Aviv, Israel, March 2000
    • (2000) Proceedings of the IEEE INFOCOM'00
    • Sivaraman, V.1    Chiussi, F.2
  • 36
    • 0036956228 scopus 로고    scopus 로고
    • Coordinated multihop scheduling: A framework for end-to-end services
    • C. Li, and E. Knightly Coordinated multihop scheduling: a framework for end-to-end services IEEE/ACM Trans. Network. 10 6 2002 776 789
    • (2002) IEEE/ACM Trans. Network. , vol.10 , Issue.6 , pp. 776-789
    • Li, C.1    Knightly, E.2


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