[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

VirtualClock: a new traffic control algorithm for packet-switched networks

Published: 01 May 1991 Publication History

Abstract

One of the challenging research issues in building high-speed packet-switched networks is how to control the transmission rate of statistical data flows. This paper describes a new traffic control algorithm, VirtualClock, for high-speed network applications. VirtualClock monitors the average transmission rate of statistical data flows and provides every flow with guaranteed throughput and low queueing delay. It provides firewall protection among individual flows, as in a TDM system, while retaining the statistical multiplexing advantages of packet switching. Simulation results show that the VirtualClock algorithm meets all its design goals.

References

[1]
CHERITON, D. VMTP: A transport protocol for the next generation of communication systems. In the Proceedings ofSIGCOMM'86 (Stowe, Vt., Aug. 1986).
[2]
CLARK, D., LAMBERT, M., AND ZHANG, L. A high throughput bulk data transfer protocol. In the Proceedings of SIGCOMM'$7 (Stowe, Vt., Aug. 1987).
[3]
DEMERS, A., KESHAV, S., AND SHENKER, S. Analysis and simulation of a fair queueing algorithm. In the Proceedings of SIGCOMM'89 (Austin, Tx., Sept. 1989).
[4]
DESCLOUS, A. Contention probabilities in packet switching networks with strung input processes. In Proceedings of the 12th Teletraffic Congress (Turin, 1988), 51A. 1.1-1.7.
[5]
FERRARI, D. Real-time communication in packet-switching wide-area networks. Tech. Rep. TR~89-022, International Computer Science Institute, Berkeley, Calif., May 1989.
[6]
FERRARI, D., AND VERMA D. A scheme ibr real-time channel establishment in wide-area networks. IEEE J. Selected Areas Commun. 8, 3 (Apr. 1990), 368-389.
[7]
FERRARI, D. Client requirements for real-time communication services. IEEE Commun. Mag. 28, 11 (Nov. 1990), 65-72.
[8]
HAHNE, E. L. Round robin scheduling for fair flow control in data communication networks. Ph.D. thesis, MIT, Dec. 1986.
[9]
GROVER, G., AND BYIARATH-KUMAR, K. Windows in the sky--Flow control in SNA networks with satellite links. IBM Syst. J. 22, 4 (1983), 451-463.
[10]
JAIN, e., AND ROUTHIER, S. Packet trains--Measurements and a new model for computer network traffic. IEEE J. Selected Areas Commun. SAC4, 6 (Sept. 1986), 986-995.
[11]
JAIN, e., RAMAKRISHNAN, K., AND CHIU, D. Congestion avoidance in computer networks with a connectionless network layer. In Ir~r~ovation6 in lnternetworking, Artech House, 1988.
[12]
KALMANEK, C., KANAKIA, H., AND KESHAV, S. Rate controlled servers for very high speed networks. In the Proceedings of GLOBCOM'90 (San Diego, Cali~, Dec. 1990), 12-20.
[13]
LAMBERT, M. An end-point adaptive rate control strategy for the NETBLT protocol. Unpublished research notes, MIT Lab for Computer Science, May 1988.
[14]
MUKHERJI, U. A schedule-based approach for flow-control in data communication networks. Ph.D. thesis, MIT, Feb. 1986.
[15]
NAGLE, J. Congestion control in TCP/IP internetworks. ACM Cornput. Commun. Rev 14, 4 (Oct 1984).
[16]
PETR, D., DASmvA, L., AND FROST, V. Priority discarding of speech in integrated packet networks. IEEE J. Selected Areas Commun. 7, 5 (June 1989), 644-656.
[17]
RATHOEB, E. P Comparison of policing mechanisms for ATM networks. In Proceedings of the 3rd RACE Workshop (Paris, Oct. 1989). Paper 21.1
[18]
SEN, P., MAGLARIS, B., RIKLI, N., AND ANASTASSIOU, D Models for packet switching of variable-bit-rate video sources IEEE J. Selected Areas Commun. 7, 5 (June, 1989), 865-869.
[19]
TCP-IP mailing list. TCP-IP mailing list is a special-interest-group mailing list moderated by the Network Information Center (NIC) located at SRI. In TCP-IP mail discussion, there have been numerous observations of malfunctioning hosts m the ARPA Internet.
[20]
TURNER, J. New directions in communications (or Which way to the information age?). IEEE Commun. Mag. 24, 10 (Oct. 1986), 8 15.
[21]
TURNER, J. Personal communication, 1989.
[22]
TYMES, L. Routing and flow control in Tymnet. IEEE Trans. Commun. COM-29, 4 (April 1981), 392-398.
[23]
WEINRm, A VirtualClock and Leaky-Bucket: Flow control protocols for high-speed networks. In the Proceedings of International Workshop on Protocols for High-Speed Networks (Nov 1990).
[24]
ZHANG, L. Some thoughts on the packet network architecture. Comput. Commun. Rev. 17, 1&2 (Jam/Apr. 1987), 3-17
[25]
ZHA~G, L. A new architecture for packet switching network protocols. Ph.D. thesis, Dept. of Electrical Engineering and Computer Science, MIT, July 1989.

Cited By

View all

Recommendations

Reviews

Robert Bruce McLaughlin

The author puts forward a scheme to use virtual clocks to control the flow of data packets in a high-speed packet switched network. The scheme requires each user to request an allocation for the amount of traffic the user expects. By stamping the packets and then placing them in a queue based on the values of their virtual time-stamps, the author expects to get higher packet throughput. The scheme in and of itself does not provide any way to correct and detect errors. The author indicates that the scheme expects a level 4 transport layer, which means that it will not support X.25 without major modification. The scheme is similar to standard TDM schemes and to several schemes that are used and have been proposed for packet satellite transmissions. For some reason, no comparison to similar packet multiplexing is made. The paper ends with a brief review of expected performance based on limited experiments with a SUN network. The performance is improved over other schemes, but a lot of work is required before any decision on use of the method can be made.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Computer Systems
ACM Transactions on Computer Systems  Volume 9, Issue 2
May 1991
98 pages
ISSN:0734-2071
EISSN:1557-7333
DOI:10.1145/103720
Issue’s Table of Contents
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: 01 May 1991
Published in TOCS Volume 9, Issue 2

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. data traffic control
  2. performance guarantee
  3. rate-based flow-control algorithms
  4. statistical multiplexing
  5. time-division-multiplexing

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)98
  • Downloads (Last 6 weeks)15
Reflects downloads up to 18 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Multi-Thread Real-Time Control Based on Event-Triggered MechanismElectronics10.3390/electronics1209212912:9(2129)Online publication date: 6-May-2023
  • (2023)Further results on exponential stability of switched systemsComputational and Applied Mathematics10.1007/s40314-022-02181-x42:1Online publication date: 18-Jan-2023
  • (2022)Congestion control in machine learning clustersProceedings of the 21st ACM Workshop on Hot Topics in Networks10.1145/3563766.3564115(235-242)Online publication date: 14-Nov-2022
  • (2022)Real-Time Dynamic Configuration of Firewall Rules for High-Speed IoT Networks2022 IEEE 4th Eurasia Conference on IOT, Communication and Engineering (ECICE)10.1109/ECICE55674.2022.10042899(89-94)Online publication date: 28-Oct-2022
  • (2022)ReferencesNetwork Algorithmics10.1016/B978-0-12-809927-8.00028-2(541-557)Online publication date: 2022
  • (2022)Scheduling packetsNetwork Algorithmics10.1016/B978-0-12-809927-8.00021-X(383-428)Online publication date: 2022
  • (2021)Observer-Based Adaptive Neural Output Feedback Constraint Controller Design for Switched Systems Under Average Dwell TimeIEEE Transactions on Circuits and Systems I: Regular Papers10.1109/TCSI.2021.309332668:9(3901-3912)Online publication date: Sep-2021
  • (2020)BaoverlayProceedings of the 11th ACM Symposium on Cloud Computing10.1145/3419111.3421291(90-104)Online publication date: 12-Oct-2020
  • (2020)NFVnice: Dynamic Backpressure and Scheduling for NFV Service ChainsIEEE/ACM Transactions on Networking10.1109/TNET.2020.296997128:2(639-652)Online publication date: 15-Apr-2020
  • (2018)Bidirectional LiFi Attocell Access Point Slicing SchemeIEEE Transactions on Network and Service Management10.1109/TNSM.2018.284205515:3(909-922)Online publication date: Sep-2018
  • 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

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media