메뉴 건너뛰기




Volumn 1, Issue , 2003, Pages 421-428

How smooth is Smoothed Round Robin?

Author keywords

Delay performance; Packet scheduling; Round robin scheduler; Time stamp based scheduler

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; MATRIX ALGEBRA; PACKET NETWORKS; QUALITY OF SERVICE;

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

References (16)
  • 1
    • 0347094747 scopus 로고    scopus 로고
    • SRR: An O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks
    • C. Guo, SRR: An O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks, in Proc. ACM Sigcomm 2001.
    • (2001) Proc. ACM Sigcomm 2001
    • Guo, C.1
  • 2
    • 0024889726 scopus 로고
    • Analysis and Simulation of a Fair Queuing Algorithm
    • 2] A. Demers, S. Keshav, and S. Shenker. "Analysis and Simulation of a Fair Queuing Algorithm," in Proc. SIGCOMM'89, 1989.
    • (1989) Proc. SIGCOMM'89
    • Demers, A.1    Keshav, S.2    Shenker, S.3
  • 5
    • 0028599989 scopus 로고
    • A Self-Clocked Fair Queueing Scheme for Broadband Applications
    • Toronto, Canada, Jun.
    • S. Golestani, "A Self-Clocked Fair Queueing Scheme for Broadband Applications," in Proc. IEEE Infocom'94, Toronto, Canada, Jun. 1994.
    • (1994) Proc. IEEE Infocom'94
    • Golestani, S.1
  • 6
    • 0029388337 scopus 로고
    • Service Disciplines For Guaranteed Performance Service in Packet-Switching Networks
    • Oct
    • H. Zhang, "Service Disciplines For Guaranteed Performance Service in Packet-Switching Networks", Proceedings of the IEEE, 83(10), Oct 1995.
    • (1995) Proceedings of the IEEE , vol.83 , Issue.10
    • Zhang, H.1
  • 7
    • 0029754778 scopus 로고    scopus 로고
    • WF2Q: Worst case fair weighted fair queueing
    • J. Bennet, and H. Zhang, "WF2Q: worst case fair weighted fair queueing," in Proc. Infocom'96, 1996.
    • (1996) Proc. Infocom'96
    • Bennet, J.1    Zhang, H.2
  • 8
  • 9
    • 0023329886 scopus 로고
    • On packet switches with infinite Storage
    • Apr.
    • John Nagle, "On packet switches with infinite Storage," IEEE Trans. Commun., vol. COM-35, no. 4, Apr. 1987.
    • (1987) IEEE Trans. Commun. , vol.COM-35 , Issue.4
    • Nagle, J.1
  • 10
    • 85013295511 scopus 로고
    • Efficient Fair Queuing using Deficit Round Robin
    • M. Shreedhar and G. Varghese, "Efficient Fair Queuing using Deficit Round Robin," in Proc. SIGCOMM'95, 1995.
    • (1995) Proc. SIGCOMM'95
    • Shreedhar, M.1    Varghese, G.2
  • 12
    • 0033296628 scopus 로고    scopus 로고
    • RRR: Recursive round robin scheduler
    • Rahul Garg, Xiaoqiang Chen, "RRR: recursive round robin scheduler," Computer Networks, vol. 31, no. 18, 1999.
    • (1999) Computer Networks , vol.31 , Issue.18
    • Garg, R.1    Chen, X.2
  • 15
    • 0004194997 scopus 로고    scopus 로고
    • The VINT Project, "ns Notes and Documentation", from http://www-mash.cs.berkeley.edu/ns/nsDoc.ps.gz
    • ns Notes and Documentation
  • 16
    • 0002047452 scopus 로고    scopus 로고
    • The Triumph of the Light
    • January
    • Gary Stix, "The Triumph of the Light", Scientific American, January 2001.
    • (2001) Scientific American
    • Stix, G.1


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