skip to main content
10.1145/115992.116004acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

Comparison of rate-based service disciplines

Authors Info & Claims
Published:01 August 1991Publication History
First page image

References

  1. 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.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Domenico Ferrari. Client requirements for real-time communication services. IEEE Communications Magazine, 28(11), November 1990. also RFC 1193.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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.]]Google ScholarGoogle Scholar
  5. 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.]]Google ScholarGoogle Scholar
  6. 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.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 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.]]Google ScholarGoogle ScholarCross RefCross Ref
  8. 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.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.S. Jamaloddin Golestani. Duration-limited statistical multiplexing of delay-sensitive traffic in packet networks, April 1991.]]Google ScholarGoogle Scholar
  10. 10.Albert Greenberg and Neil Madras. How fair is fair queueing? Proc. Performance '90, 1990.]]Google ScholarGoogle Scholar
  11. 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.]]Google ScholarGoogle ScholarCross RefCross Ref
  12. 12.Srinivasan Keshav. On the efficient implementation of fair queueing, 1991. To appear in Journal of Internetworking Research and Experience.]]Google ScholarGoogle Scholar
  13. 13.M. Sidi, W.~Z. Liu, I Cidon, and I Gopal. Congestion control through input rate regulation. In IEEE Global Telecomminications Conference, December 1989.]]Google ScholarGoogle ScholarCross RefCross Ref
  14. 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.]]Google ScholarGoogle Scholar
  15. 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.]]Google ScholarGoogle Scholar
  16. 16.Lixia Zhang. A New Architecture for Packet Switched Network Protocols. PhD dissertation, Massachusetts institute of Technology, July 1989.]]Google ScholarGoogle Scholar
  17. 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.]]Google ScholarGoogle Scholar

Index Terms

  1. Comparison of rate-based service disciplines

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • 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

        Copyright © 1991 ACM

        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]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 August 1991

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate554of3,547submissions,16%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader