[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/115992.116004acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free access

Comparison of rate-based service disciplines

Published: 01 August 1991 Publication History
First page of PDF

References

[1]
Randy Brown. Calendar queues: A fast O(1) priority queue implementation for the simulation event set problem. Cornmunications ofthe ACM, 31 (10):1220-1227, October 1988.]]
[2]
Alan Demers, Srinivasan Keshav, and Scott Shenker. Analysis and simulation of a fair queueing algorithm, in Journal oflnternetworking Researchand Experience, pages 3-26, October 1990. Also in Proc. ACM SIGCOMM'89, pp 3-12.]]
[3]
Domenico Ferrari. Client requirements for real-time communication services. IEEE Communications Magazine, 28(11), November 1990. also RFC 1193.]]
[4]
Domenico Ferrari and Dinesh Verma. A scheme for realtime channel establishment in wide-area networks. Technical Report TR-89-036, International Computer Science Institute, Berkeley, California, May 1989.]]
[5]
Domenico Ferrari and Dinesh Verma. Quality of service and admission control in ATM networks. Technical Report TR- 90-064, International Computer Science Institute, Berkeley, California, December 1990.]]
[6]
Domenico Ferrari and Dinesh Verma. A scheme for real-time channel establishment in wide-area networks. IEEE Journal on Selected Areas in Communications, 8(3):368-379, April 1990.]]
[7]
S, Jamaloddin Golestani. Congestion-free transmission of real-time traffic in packet networks. In Proceedings of IEEE INFOCOM'90, pages 527-542, San Francisco, California, June 1990. IEEE Computer and Communication Societies.]]
[8]
S, $amaloddin Golestani. A stop-and-go queueing framework for congestion management. In SIGCOMM'90 Symposium, Communications Architecture & Protocols, pages 8- 18, Philadelphia Pennsylvania, September 1990. ACM SiG- COMM.]]
[9]
S. Jamaloddin Golestani. Duration-limited statistical multiplexing of delay-sensitive traffic in packet networks, April 1991.]]
[10]
Albert Greenberg and Neil Madras. How fair is fair queueing? Proc. Performance '90, 1990.]]
[11]
Charles R. Kalmanek, Hemant Kanakia, and Srinivasan Keshay. Rate controlled servers for very high-speed networks. In IEEE Global TeIecomminications Conference, San Diego, California, December 1990.]]
[12]
Srinivasan Keshav. On the efficient implementation of fair queueing, 1991. To appear in Journal of Internetworking Research and Experience.]]
[13]
M. Sidi, W.~Z. Liu, I Cidon, and I Gopal. Congestion control through input rate regulation. In IEEE Global Telecomminications Conference, December 1989.]]
[14]
Dinesh Verma, Hui Zhang, and Domenico Ferrari. Guaranteeing delay jitter bounds in packet switching networks. In Proceedings of Tricomm'91, Chapel Hill, North Carolina, April 1991.]]
[15]
Abel Weinrib and L.T. Wu. Virtual clocks and leaky buckets: Flow control protocols for high speed networks, in Second IFIP International Workshop on Protocols For High-Speed Networks, Palo Alto, California, November 1990.]]
[16]
Lixia Zhang. A New Architecture for Packet Switched Network Protocols. PhD dissertation, Massachusetts institute of Technology, July 1989.]]
[17]
Lixia Zhang. A comparison of traffic control algorithms for high-speed networks. In The 2nd Annual Workshop on Very High Speed Networks, Proceedings Supplement, Greenbelt, Maryland, March 1991.]]

Cited By

View all
  • (2019)Preemptive Multi-Queue Fair QueuingProceedings of the 28th International Symposium on High-Performance Parallel and Distributed Computing10.1145/3307681.3326605(147-158)Online publication date: 17-Jun-2019
  • (2016)PhaseNoCIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2015.248849035:5(844-857)Online publication date: 1-May-2016
  • (2015)SiloACM SIGCOMM Computer Communication Review10.1145/2829988.278747945:4(435-448)Online publication date: 17-Aug-2015
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SIGCOMM '91: Proceedings of the conference on Communications architecture & protocols
August 1991
336 pages
ISBN:0897914449
DOI:10.1145/115992
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1991

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

SIGCOMM 91
Sponsor:

Acceptance Rates

Overall Acceptance Rate 462 of 3,389 submissions, 14%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)86
  • Downloads (Last 6 weeks)8
Reflects downloads up to 01 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2019)Preemptive Multi-Queue Fair QueuingProceedings of the 28th International Symposium on High-Performance Parallel and Distributed Computing10.1145/3307681.3326605(147-158)Online publication date: 17-Jun-2019
  • (2016)PhaseNoCIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2015.248849035:5(844-857)Online publication date: 1-May-2016
  • (2015)SiloACM SIGCOMM Computer Communication Review10.1145/2829988.278747945:4(435-448)Online publication date: 17-Aug-2015
  • (2015)SiloProceedings of the 2015 ACM Conference on Special Interest Group on Data Communication10.1145/2785956.2787479(435-448)Online publication date: 17-Aug-2015
  • (2015)On the rate-jitter performance of jitter-buffer in TDMoPSNPhotonic Network Communications10.1007/s11107-015-0486-230:1(108-130)Online publication date: 1-Aug-2015
  • (2013)BibliographyMulticore Technology10.1201/b15268-20(409-450)Online publication date: 18-Jul-2013
  • (2013)Novel rate-jitter control algorithms for TDMoIP2013 National Conference on Communications (NCC)10.1109/NCC.2013.6488028(1-5)Online publication date: Feb-2013
  • (2013)Analysis of BSCFQ: A Modified Version of SCFQ to Support Bursty TrafficWireless Personal Communications10.1007/s11277-013-1476-275:4(2449-2466)Online publication date: 31-Oct-2013
  • (2012)A scheduling algorithm for controlling of service rate and burst2012 18th International Conference on Advanced Computing and Communications (ADCOM)10.1109/ADCOM.2012.6563580(25-32)Online publication date: Dec-2012
  • (2010)Energy-efficient algorithmsCommunications of the ACM10.1145/1735223.173524553:5(86-96)Online publication date: 1-May-2010
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media