메뉴 건너뛰기




Volumn 41, Issue 3, 2002, Pages 241-270

Scheduling multiclass packet streams to minimize weighted loss

Author keywords

Deadlines; EDF; Multiclass; Scheduling; SP; Throughput optimality; Weighted loss

Indexed keywords

SCHEDULING;

EID: 0036283887     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/A:1015890105072     Document Type: Article
Times cited : (14)

References (18)
  • 1
    • 0032178346 scopus 로고    scopus 로고
    • Uniform versus priority dropping for layered video
    • S. Bajaj, L. Breslau and S. Shenker, Uniform versus priority dropping for layered video, ACM Comput. Comm. Rev. 28 (1998) 131-143.
    • (1998) ACM Comput. Comm. Rev. , vol.28 , pp. 131-143
    • Bajaj, S.1    Breslau, L.2    Shenker, S.3
  • 4
    • 0027851079 scopus 로고
    • Pricing in computer networks: Motivation, formulation, and example
    • R. Cocchi, S. Shenker, D. Estrin and L. Zhang, Pricing in computer networks: Motivation, formulation, and example, IEEE/ACM Trans. Net. 1(6) (1993) 614-627.
    • (1993) IEEE/ACM Trans. Net. , vol.1 , Issue.6 , pp. 614-627
    • Cocchi, R.1    Shenker, S.2    Estrin, D.3    Zhang, L.4
  • 7
    • 0003311938 scopus 로고    scopus 로고
    • Characteristics of TCP connection arrivals
    • eds. K. Park and W. Willinger (Wiley, New York)
    • A. Feldmann, Characteristics of TCP connection arrivals, in: Self-similar Network Traffic and Performance Evaluation, eds. K. Park and W. Willinger (Wiley, New York, 2000) pp. 367-399.
    • (2000) Self-Similar Network Traffic and Performance Evaluation , pp. 367-399
    • Feldmann, A.1
  • 9
    • 0032594135 scopus 로고    scopus 로고
    • Promoting the use of end-to-end congestion control in the Internet
    • S. Floyd and K. Fall, Promoting the use of end-to-end congestion control in the Internet, IEEE/ACM Trans. Net. 7(4) (1999) 458-472.
    • (1999) IEEE/ACM Trans. Net. , vol.7 , Issue.4 , pp. 458-472
    • Floyd, S.1    Fall, K.2
  • 10
    • 0029356674 scopus 로고
    • Link-sharing and resource management models for packet networks
    • S. Floyd and V. Jacobson, Link-sharing and resource management models for packet networks, IEEE/ACM Trans. Net. 3(4) (1995) 365-386.
    • (1995) IEEE/ACM Trans. Net. , vol.3 , Issue.4 , pp. 365-386
    • Floyd, S.1    Jacobson, V.2
  • 12
    • 84873010595 scopus 로고    scopus 로고
    • Lex-optimal multiclass scheduling with deadlines
    • submitted to
    • B. Hajek and P. Seri, Lex-optimal multiclass scheduling with deadlines, submitted to Math. Oper. Res.
    • Math. Oper. Res.
    • Hajek, B.1    Seri, P.2
  • 14
    • 0014571702 scopus 로고
    • A functional equation and its application to resource allocation and sequencing problems
    • E.L. Lawler and J.M. Moore, A functional equation and its application to resource allocation and sequencing problems, Managm. Sci. 16 (1969) 77-84.
    • (1969) Managm. Sci. , vol.16 , pp. 77-84
    • Lawler, E.L.1    Moore, J.M.2
  • 15
    • 0029780010 scopus 로고    scopus 로고
    • Scheduling real-time traffic in ATM network
    • T.L. Ling and N. Shroff, Scheduling real-time traffic in ATM network, in: Proc. IEEE INFOCOM, 1996, pp. 198-205.
    • (1996) Proc. IEEE INFOCOM , pp. 198-205
    • Ling, T.L.1    Shroff, N.2
  • 16
    • 0005184581 scopus 로고
    • Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
    • J.M. Peha, Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time, J. Comput. Oper. Res. 22(10) (1995) 1089-1100.
    • (1995) J. Comput. Oper. Res. , vol.22 , Issue.10 , pp. 1089-1100
    • Peha, J.M.1
  • 17
    • 0025535075 scopus 로고
    • Evaluating scheduling algorithms for traffic with heterogeneous performance objectives
    • J.M. Peha and F.A. Tobagi, Evaluating scheduling algorithms for traffic with heterogeneous performance objectives, in: Proc. of IEEE GLOBECOM, 1990, pp. 21-27.
    • (1990) Proc. of IEEE GLOBECOM , pp. 21-27
    • Peha, J.M.1    Tobagi, F.A.2
  • 18
    • 0016883405 scopus 로고
    • Algorithms for scheduling independent tasks
    • S. Sahni, Algorithms for scheduling independent tasks, J. ACM 23 (1976) 116-127.
    • (1976) J. ACM , vol.23 , pp. 116-127
    • Sahni, S.1


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