메뉴 건너뛰기




Volumn , Issue , 2006, Pages

A bandwidth bargain model based on adaptive weighted fair queueing

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; BANDWIDTH; INTERNET; PACKET NETWORKS; QUALITY OF SERVICE; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

EID: 37649031202     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (18)
  • 4
    • 0004105908 scopus 로고    scopus 로고
    • Stateless core: A scalable approach for quality of service in the internet,
    • Ph.D. dissertation, Carnegie Mellon University, December
    • I. Stoica, "Stateless core: A scalable approach for quality of service in the internet," Ph.D. dissertation, Carnegie Mellon University, December 2000.
    • (2000)
    • Stoica, I.1
  • 6
    • 33646551310 scopus 로고    scopus 로고
    • On Achieving Fairness in the Joint Allocation of Processing and Bandwidth Resources
    • Berkeley, CA, USA, June
    • Y. Zhou and H. Sethu, "On Achieving Fairness in the Joint Allocation of Processing and Bandwidth Resources," in Proceedings of 11th International Workshop on Quality of Service, Berkeley, CA, USA, June 2003, pp. 97-114.
    • (2003) Proceedings of 11th International Workshop on Quality of Service , pp. 97-114
    • Zhou, Y.1    Sethu, H.2
  • 7
    • 0035149461 scopus 로고    scopus 로고
    • SLA management in federated environments
    • January
    • P. Bhoj, S. Singhal, and S. Chutani, "SLA management in federated environments," Computer Networks, vol. 35, no. 1, pp. 5-24, January 2001.
    • (2001) Computer Networks , vol.35 , Issue.1 , pp. 5-24
    • Bhoj, P.1    Singhal, S.2    Chutani, S.3
  • 8
    • 34250647583 scopus 로고    scopus 로고
    • Design and Implementation of a Bandwidth Bargain Model,
    • M.Sc. Thesis, University of Guelph
    • L. Wang, "Design and Implementation of a Bandwidth Bargain Model," M.Sc. Thesis, University of Guelph, 2005.
    • (2005)
    • Wang, L.1
  • 9
    • 0024889726 scopus 로고
    • Analysis and Simulation of a Fair Queueing Algorithm
    • Austin, Texas, United States
    • A. Demers, S. Keshav, and S. Shenker, "Analysis and Simulation of a Fair Queueing Algorithm," in Proceedings of ACM SIGCOMM'89, Austin, Texas, United States, 1989, pp. 3-12.
    • (1989) Proceedings of ACM SIGCOMM'89 , pp. 3-12
    • Demers, A.1    Keshav, S.2    Shenker, S.3
  • 10
    • 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 Transactions on Networking, vol. I, pp. 344-357, June 1993.
    • (1993) IEEE/ACM Transactions on Networking , vol.1 , pp. 344-357
    • Parekh, A.1    Gallager, R.2
  • 17
    • 84939061075 scopus 로고
    • Traffic Modeling For Telecommunications Networks
    • March
    • V. S. Frost and B. Melamed, "Traffic Modeling For Telecommunications Networks," IEEE Communications, vol. 32, no. 3, pp. 70-81, March 1994.
    • (1994) IEEE Communications , vol.32 , Issue.3 , pp. 70-81
    • Frost, V.S.1    Melamed, B.2
  • 18
    • 0034781942 scopus 로고    scopus 로고
    • Srr: An o(1) time complexity packet scheduler for flows in multi-service packet networks
    • San Diego, California, United States, August
    • G. Chuanxiong, "Srr: An o(1) time complexity packet scheduler for flows in multi-service packet networks," in Proceedings of ACM SIGCOMM'01, San Diego, California, United States, August 2001, pp. 211-222.
    • (2001) Proceedings of ACM SIGCOMM'01 , pp. 211-222
    • Chuanxiong, G.1


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