메뉴 건너뛰기




Volumn 31, Issue 3, 1999, Pages 169-189

Quality-of-service in packet networks: Basic mechanisms and directions

Author keywords

Aggregation; Buffer management; QoS mechanisms; Real time traffic; Scheduling

Indexed keywords


EID: 0001105910     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0169-7552(98)00261-X     Document Type: Article
Times cited : (165)

References (62)
  • 3
    • 0030259608 scopus 로고    scopus 로고
    • Hierarchical packet fair queueing algorithms
    • Stanford University, CA, August
    • J.C.R. Bennett, H. Zhang, Hierarchical packet fair queueing algorithms, in: Proc. SIGCOMM, Stanford University, CA, August 1996, pp. 143-156.
    • (1996) Proc. SIGCOMM , pp. 143-156
    • Bennett, J.C.R.1    Zhang, H.2
  • 4
    • 0029754778 scopus 로고    scopus 로고
    • 2Q: Worst-case fair weighted fair queueing
    • San Francisco, CA, March
    • 2Q: worst-case fair weighted fair queueing, in: Proc. INFOCOM, San Francisco, CA, March 1996, pp. 120-128.
    • (1996) Proc. INFOCOM , pp. 120-128
    • Bennett, J.C.R.1    Zhang, H.2
  • 6
    • 0003952766 scopus 로고    scopus 로고
    • L. Zhang, S. Berson, S. Herzog, S. Jamin, functional specification, Request for Comments (Proposed Standard) RFC 2205, Internet Engineering Task Force, September
    • R. Braden (Ed.), L. Zhang, S. Berson, S. Herzog, S. Jamin, Resource reservation Protocol (RSVP) version 1, functional specification, Request for Comments (Proposed Standard) RFC 2205, Internet Engineering Task Force, September 1997.
    • (1997) Resource Reservation Protocol (RSVP) Version 1
    • Braden, R.1
  • 8
  • 9
    • 0030125172 scopus 로고    scopus 로고
    • Adding service discrimination to the Internet
    • April
    • D. Clark, Adding service discrimination to the Internet, Telecommunications Policy 20 (3) (April 1996) 169-181.
    • (1996) Telecommunications Policy , vol.20 , Issue.3 , pp. 169-181
    • Clark, D.1
  • 11
    • 84974747184 scopus 로고
    • Service burstiness and dynamic burstiness measures: A framework
    • R.L. Cruz, Service burstiness and dynamic burstiness measures: a framework, J. High Speed Networks 1 (2) (1992) 105-127.
    • (1992) J. High Speed Networks , vol.1 , Issue.2 , pp. 105-127
    • Cruz, R.L.1
  • 12
    • 0029357395 scopus 로고
    • Quality of service guarantees in virtual circuit switched networks
    • August
    • R.L. Cruz, Quality of service guarantees in virtual circuit switched networks, IEEE J. Select. Areas Commun. 13 (6) (August 1995) 1048-1056.
    • (1995) IEEE J. Select. Areas Commun. , vol.13 , Issue.6 , pp. 1048-1056
    • Cruz, R.L.1
  • 17
    • 0031357219 scopus 로고    scopus 로고
    • Efficient admission control for EDF schedulers
    • Kobe, Japan, March
    • V. Firoiu, J. Kurose, D. Towsley, Efficient admission control for EDF schedulers, in: Proc. INFOCOM, Kobe, Japan, March 1997.
    • (1997) Proc. INFOCOM
    • Firoiu, V.1    Kurose, J.2    Towsley, D.3
  • 18
    • 0027647490 scopus 로고
    • Random early detection gateways for congestion avoidance
    • August
    • S. Floyd, V. Jacobson, Random early detection gateways for congestion avoidance, IEEE/ACM Trans Networking 1 (4) (August 1993) 397-413.
    • (1993) IEEE/ACM Trans Networking , vol.1 , Issue.4 , pp. 397-413
    • Floyd, S.1    Jacobson, V.2
  • 19
    • 0029356674 scopus 로고
    • Link-sharing and resource management models for packet networks
    • August
    • S. Floyd, V. Jacobson, Link-sharing and resource management models for packet networks, IEEE/ACM Trans. Networking 3 (4) (August 1995) 365-386.
    • (1995) IEEE/ACM Trans. Networking , vol.3 , Issue.4 , pp. 365-386
    • Floyd, S.1    Jacobson, V.2
  • 22
    • 0031236476 scopus 로고    scopus 로고
    • Optimal multiplexing on a single link: Delay and buffer requirements
    • September
    • L. Georgiadis, R. Guérin, A. Parekh, Optimal multiplexing on a single link: Delay and buffer requirements, IEEE Trans. Infor. Theory 43 (5) (September 1997) 1518-1535.
    • (1997) IEEE Trans. Infor. Theory , vol.43 , Issue.5 , pp. 1518-1535
    • Georgiadis, L.1    Guérin, R.2    Parekh, A.3
  • 23
    • 0030261086 scopus 로고    scopus 로고
    • Efficient support or delay and rate guarantees in an Internet
    • San Francisco, CA, August
    • L. Georgiadis, R. Guérin, V. Peris, R. Rajan, Efficient support or delay and rate guarantees in an Internet, in: Proc. SIGCOMM, San Francisco, CA, August 1996, pp. 106-116.
    • (1996) Proc. SIGCOMM , pp. 106-116
    • Georgiadis, L.1    Guérin, R.2    Peris, V.3    Rajan, R.4
  • 24
    • 0030211305 scopus 로고    scopus 로고
    • Efficient network QoS provisioning based on per node traffic shaping
    • August
    • L. Georgiadis, R. Guérin, V. Peris, K.N. Sivarajan, Efficient network QoS provisioning based on per node traffic shaping, IEEE/ACM Trans Networking 4 (4) (August 1996) 482-501.
    • (1996) IEEE/ACM Trans Networking , vol.4 , Issue.4 , pp. 482-501
    • Georgiadis, L.1    Guérin, R.2    Peris, V.3    Sivarajan, K.N.4
  • 25
    • 0001780638 scopus 로고
    • Effective bandwidths for the multitype UAS channel
    • September
    • R.J. Gibbens, P.J. Hunt, Effective bandwidths for the multitype UAS channel, Queueing Systems 9 (September 1991) 17-28.
    • (1991) Queueing Systems , vol.9 , pp. 17-28
    • Gibbens, R.J.1    Hunt, P.J.2
  • 26
    • 0028599989 scopus 로고
    • A self-clocked fair queueing scheme for broadband applications
    • Toronto, Canada, June
    • S.J. Golestani, A self-clocked fair queueing scheme for broadband applications, in: Proc. INFOCOM, Toronto, Canada, June 1994, pp. 636-646.
    • (1994) Proc. INFOCOM , pp. 636-646
    • Golestani, S.J.1
  • 27
    • 0029357396 scopus 로고
    • Network delay analysis of a class of fair queueing algorithms
    • August
    • S.J. Golestani, Network delay analysis of a class of fair queueing algorithms, IEEE J. Select. Areas Commun. 13 (6) (August 1995) 1057-1070.
    • (1995) IEEE J. Select. Areas Commun. , vol.13 , Issue.6 , pp. 1057-1070
    • Golestani, S.J.1
  • 28
    • 0030261623 scopus 로고    scopus 로고
    • Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks
    • Stanford University, CA, August
    • P. Goyal, H. Chen, H. Vin, Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks, in: Proc. SIGCOMM, Stanford University, CA, August 1996, pp. 157-168.
    • (1996) Proc. SIGCOMM , pp. 157-168
    • Goyal, P.1    Chen, H.2    Vin, H.3
  • 29
    • 0003766725 scopus 로고
    • Generalized guaranteed rate scheduling algorithms A framework
    • Department of Computer Sciences, University of Texas at Austin
    • P. Goyal, H. Vin, Generalized guaranteed rate scheduling algorithms A framework, Technical Report TR-95-30, Department of Computer Sciences, University of Texas at Austin, 1995.
    • (1995) Technical Report TR-95-30
    • Goyal, P.1    Vin, H.2
  • 30
    • 0030609313 scopus 로고    scopus 로고
    • Framework for robust measurement-based admission control
    • Sophia Antipolis, France, September
    • M. Grossglauser, D. Tse, Framework for robust measurement-based admission control, in: Proc. SIGCOMM, Sophia Antipolis, France, September 1997, pp. 237-248.
    • (1997) Proc. SIGCOMM , pp. 237-248
    • Grossglauser, M.1    Tse, D.2
  • 31
    • 0026225346 scopus 로고
    • Equivalent capacity and its application to bandwidth allocation in high-speed networks
    • September
    • R. Guérin, H. Ahmadi, M. Naghshineh, Equivalent capacity and its application to bandwidth allocation in high-speed networks, IEEE J. Select. Areas Commun. SAC-9 (7) (September 1991) 968-981.
    • (1991) IEEE J. Select. Areas Commun. , vol.SAC-9 , Issue.7 , pp. 968-981
    • Guérin, R.1    Ahmadi, H.2    Naghshineh, M.3
  • 33
    • 0032178134 scopus 로고    scopus 로고
    • Scalable QoS provision through buffer management
    • Vancouver, British Columbia, Canada, September
    • R. Guérin, S. Kamat, V. Peris, R. Rajan, Scalable QoS provision through buffer management, in: Proc. SIGCOMM, Vancouver, British Columbia, Canada, September 1998, pp. 29-40.
    • (1998) Proc. SIGCOMM , pp. 29-40
    • Guérin, R.1    Kamat, S.2    Peris, V.3    Rajan, R.4
  • 34
    • 0028056235 scopus 로고
    • An approximation method for capturing complex traffic behavior in high speed networks
    • January
    • L. Gün, An approximation method for capturing complex traffic behavior in high speed networks, Performance Evaluation 19 (1) (January 1994) 5-23.
    • (1994) Performance Evaluation , vol.19 , Issue.1 , pp. 5-23
    • Gün, L.1
  • 35
    • 0027662151 scopus 로고
    • Bandwidth management and congestion control framework of the broadband network architecture
    • September
    • L. Gün, R. Guérin, Bandwidth management and congestion control framework of the broadband network architecture, Computer Networks and ISDN Systems 26 (1) (September 1993) 61-78.
    • (1993) Computer Networks and ISDN Systems , vol.26 , Issue.1 , pp. 61-78
    • Gün, L.1    Guérin, R.2
  • 37
    • 0031079050 scopus 로고    scopus 로고
    • Measurement-based admission control algorithm for integrated service packet networks
    • February
    • S. Jamin, P.B. Danzig, S.J. Shenker, L. Zhang, Measurement-based admission control algorithm for integrated service packet networks, IEEE/ACM Trans. Networking 5 (1) (February 1997) 56-70.
    • (1997) IEEE/ACM Trans. Networking , vol.5 , Issue.1 , pp. 56-70
    • Jamin, S.1    Danzig, P.B.2    Shenker, S.J.3    Zhang, L.4
  • 38
    • 0019032785 scopus 로고
    • Analysis of shared finite storage in a computer network node environment under general traffic conditions
    • F. Kamoun, L. Kleinrock, Analysis of shared finite storage in a computer network node environment under general traffic conditions, IEEE Trans. Commun. COM-28 (1980) 992-1003.
    • (1980) IEEE Trans. Commun. , vol.COM-28 , pp. 992-1003
    • Kamoun, F.1    Kleinrock, L.2
  • 39
    • 0026243589 scopus 로고
    • Weighted round-robin cell multiplexing in a general-purpose ATM switch chip
    • October
    • M. Katevenis, S. Sidiropoulos, C. Courcoubetis, Weighted round-robin cell multiplexing in a general-purpose ATM switch chip, IEEE J. Select. Areas Commun. SAC-9 (8) (October 1991) 1265-1279.
    • (1991) IEEE J. Select. Areas Commun. , vol.SAC-9 , Issue.8 , pp. 1265-1279
    • Katevenis, M.1    Sidiropoulos, S.2    Courcoubetis, C.3
  • 40
    • 18344394570 scopus 로고
    • Effective bandwidth at multi-class queues
    • September
    • F.P. Kelly, Effective bandwidth at multi-class queues, Queueing Systems 9 (September 1991) 5-16.
    • (1991) Queueing Systems , vol.9 , pp. 5-16
    • Kelly, F.P.1
  • 41
    • 0006643865 scopus 로고    scopus 로고
    • Internet Draft, draft-kalevi-simple-media-access-01.txt, June Work in progress
    • K. Kilkki, Simple integrated media access (SIMA), Internet Draft, draft-kalevi-simple-media-access-01.txt, June 1997, Work in progress.
    • (1997) Simple Integrated Media Access (SIMA)
    • Kilkki, K.1
  • 43
    • 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. Infor. Theory 44 (3) (May 1998).
    • (1998) IEEE Trans. Infor. Theory , vol.44 , Issue.3
    • Le Boudec, J.-Y.1
  • 44
    • 0030609305 scopus 로고    scopus 로고
    • Dynamics of random early detection
    • September
    • D. Lin, R. Morris, Dynamics of random early detection, in: Proc. SIGCOMM, September 1997, pp. 127-137.
    • (1997) Proc. SIGCOMM , pp. 127-137
    • Lin, D.1    Morris, R.2
  • 45
    • 0027612043 scopus 로고
    • A generalized processor sharing approach to flow control in integrated services networks: The single-node case
    • June
    • A.K. Parekh, R.G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single-node case, IEEE/ACM Trans. Networking 1 (3) (June 1993) 344-357.
    • (1993) IEEE/ACM Trans. Networking , vol.1 , Issue.3 , pp. 344-357
    • Parekh, A.K.1    Gallager, R.G.2
  • 46
    • 0028407068 scopus 로고
    • A generalized processor sharing approach to flow control in integrated services networks: The multiple node case
    • April
    • A.K. Parekh, R.G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The multiple node case, IEEE/ACM Trans. Networking 2 (2) (April 1994) 137-150.
    • (1994) IEEE/ACM Trans. Networking , vol.2 , Issue.2 , pp. 137-150
    • Parekh, A.K.1    Gallager, R.G.2
  • 47
    • 0003519323 scopus 로고
    • Ph.D. thesis, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139, February No. LIDS-TH-2089
    • A.K.J. Parekh, A generalized processor sharing approach to flow control in integrated services networks, Ph.D. thesis, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, MA 02139, February 1992, No. LIDS-TH-2089.
    • (1992) A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks
    • Parekh, A.K.J.1
  • 49
    • 0004292408 scopus 로고
    • Request for Comments, RFC 791, (standard), Internet Engineering Task Force, September
    • J. Postel, Internet protocol, Request for Comments, RFC 791, (standard), Internet Engineering Task Force, September 1981.
    • (1981) Internet Protocol
    • Postel, J.1
  • 51
    • 0029306743 scopus 로고
    • Dynamics of TCP traffic over ATM networks
    • May
    • A. Romanow, S. Floyd, Dynamics of TCP traffic over ATM networks, IEEE J. Sel. Areas Commun. 13 (4) (May 1995) 633-641.
    • (1995) IEEE J. Sel. Areas Commun. , vol.13 , Issue.4 , pp. 633-641
    • Romanow, A.1    Floyd, S.2
  • 56
    • 0030171894 scopus 로고    scopus 로고
    • Efficient fair queuing using deficit round-robin
    • M. Shreedhar, G. Varghese, Efficient fair queuing using deficit round-robin, IEEE/ACM Trans Networking 4 (3) (1996) 375-385.
    • (1996) IEEE/ACM Trans Networking , vol.4 , Issue.3 , pp. 375-385
    • Shreedhar, M.1    Varghese, G.2
  • 57
    • 84925199489 scopus 로고    scopus 로고
    • Frame-based fair queueing: A new traffic scheduling algorithm for packet-switched networks
    • D. Stiliadis, A. Varma, Frame-based fair queueing: A new traffic scheduling algorithm for packet-switched networks, in: Proc. SIGMETRICS'96, 1996.
    • (1996) Proc. SIGMETRICS'96
    • Stiliadis, D.1    Varma, A.2
  • 58
    • 0029736365 scopus 로고    scopus 로고
    • Latency-rate servers A general model for analysis of traffic scheduling algorithms
    • San Francisco, CA, April
    • D. Stiliadis, A. Varma, Latency-rate servers A general model for analysis of traffic scheduling algorithms, in: Proc. INFOCOM, San Francisco, CA, April 1996, pp. 111-119.
    • (1996) Proc. INFOCOM , pp. 111-119
    • Stiliadis, D.1    Varma, A.2
  • 59
    • 0029755649 scopus 로고    scopus 로고
    • Maintaining high throughput during overload in ATM switches
    • San Francisco, CA, April
    • J. Turner, Maintaining high throughput during overload in ATM switches, in: Proc. INFOCOM, San Francisco, CA, April 1996, pp. 287-295.
    • (1996) Proc. INFOCOM , pp. 287-295
    • Turner, J.1
  • 61
    • 0003541833 scopus 로고    scopus 로고
    • Request for Comments (Proposed Standard) RFC 2210, Internet Engineering Task Force, September
    • J. Wroclawski, The use of RSVP with IETF integrated services, Request for Comments (Proposed Standard) RFC 2210, Internet Engineering Task Force, September 1997.
    • (1997) The Use of RSVP with IETF Integrated Services
    • Wroclawski, J.1
  • 62
    • 84974751550 scopus 로고
    • Rate-controlled service disciplines
    • H. Zhang, D. Ferrari, Rate-controlled service disciplines, J. High Speed Networks 3 (4) (1995) 389-412.
    • (1995) J. High Speed Networks , vol.3 , Issue.4 , pp. 389-412
    • Zhang, H.1    Ferrari, D.2


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