article

Free access

Virtual clock: a new traffic control algorithm for packet switching networks

Author:

L. ZhangAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 20, Issue 4

Pages 19 - 29

https://doi.org/10.1145/99517.99525

Published: 01 August 1990 Publication History

PDF eReader

Abstract

A challenging research issue in high speed networking is how to control the transmission rate of statistical data flows. This paper describes a new algorithm, VirtualClock, for data traffic control in high-speed networks. VirtualClock maintains the statistical multiplexing flexibility of pocket switching while ensuring each data flow its reserved average throughput rate at the same time. The algorithm has been tested through simulation.

References

[1]

A. Demers, S. Keshav, and S. Shenker. Analysis and Simulation of a Fair Queueing Algorithm. In Proceedings of Symposium on Communication Architectures and Protocols. ACM SIG- COMM, September 1989.

Digital Library

Google Scholar

[2]

A. Deselous, Contention Probabilities in Packet Switching Networks with Strung lnput Processes, Teletraffc Congress 1988

Google Scholar

[3]

Ellen L. Hahne. Round Robin Scheduling for Fair Flow Control in Data Communication Networks. PhD thesis, Massachusetts Institute of Technology, December 1986.

Google Scholar

[4]

R. J ain and S. Routhier. Packet Trains- Measurements and a New Model for Computer Network Traffic. IEEE Journal on Selected Areas in Communicalions, SAC-4(6):986-995, September 1986.

Google Scholar

[5]

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 in the ARPA Internet.

Google Scholar

[6]

Utpal Mukherji. A Schedule-Based Approach for Flow-Control in Data Communication Networks. PhD thesis, Massachusetts Institute of Technology, February 1986.

Google Scholar

[7]

John Nagle. Congestion Control in TCP/IP Internetworks. A CM Computer Communications Review, 14(4), October 1984.

Digital Library

Google Scholar

[8]

E. P. Rathgeb. Comparison of Policing Mechanisms for ATM Networks. Submitted to IEEE INFO- COM'90, June 1990.

Google Scholar

[9]

Jonathan S. Turner. New Directions in Communications (or Which Way to the Information Age?). IEEE Communications Magazine, 24(10):8-15, October 1986.

Digital Library

Google Scholar

[10]

Lixia Zhang. A New Architecture for Packet Switching Network Protocols. PhD thesis, Massachusetts Institute of Technology, July 1989.

Google Scholar

Cited By

View all

Erickson JAnderson J(2022)Soft Real-Time SchedulingHandbook of Real-Time Computing10.1007/978-981-287-251-7_4(233-267)Online publication date: 9-Aug-2022
https://doi.org/10.1007/978-981-287-251-7_4
Luangsomboon NLiebeherr J(2021)HLS: A Packet Scheduler for Hierarchical Fairness2021 IEEE 29th International Conference on Network Protocols (ICNP)10.1109/ICNP52444.2021.9651972(1-11)Online publication date: 1-Nov-2021
https://doi.org/10.1109/ICNP52444.2021.9651972
Wang PJiang ZQi MDai LXu H(2021)Uncertainty-aware Weighted Fair Queueing for Routers Based on Deep Reinforcement Learning2021 IEEE 4th International Conference on Electronics and Communication Engineering (ICECE)10.1109/ICECE54449.2021.9674580(1-7)Online publication date: 17-Dec-2021
https://doi.org/10.1109/ICECE54449.2021.9674580
Show More Cited By

Index Terms

Virtual clock: a new traffic control algorithm for packet switching networks
1. Networks
2. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Virtual clock: a new traffic control algorithm for packet switching networks
SIGCOMM '90: Proceedings of the ACM symposium on Communications architectures & protocols

A challenging research issue in high speed networking is how to control the transmission rate of statistical data flows. This paper describes a new algorithm, VirtualClock, for data traffic control in high-speed networks. VirtualClock maintains the ...
Read More
Design and analysis of a new fast packet switching fabric supporting multimedia traffic
LCN '96: Proceedings of the 21st Annual IEEE Conference on Local Computer Networks

We propose a new ATM switch architecture with output queueing. The proposed switch, FBSF (FAB Banyan switching fabrics) can deliver up to 2r packets simultaneously destined for the same outlet in a single time slot. Unlike the existing switches with ...
Read More
An integrated network traffic control system for high-speed packet-switched wide-area networks
Read More

Comments

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 20, Issue 4

Sep. 1990

316 pages

ISSN:0146-4833

DOI:10.1145/99517

Editor:
Phil Karn

Issue’s Table of Contents

SIGCOMM '90: Proceedings of the ACM symposium on Communications architectures & protocols
August 1990
318 pages
ISBN:0897914058
DOI:10.1145/99508
Chairman:
Phil Karn

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 August 1990

Published in SIGCOMM-CCR Volume 20, Issue 4

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

480
Total Citations
View Citations
3,713
Total Downloads

Downloads (Last 12 months)117
Downloads (Last 6 weeks)11

Other Metrics

View Author Metrics

Citations

Cited By

View all

Erickson JAnderson J(2022)Soft Real-Time SchedulingHandbook of Real-Time Computing10.1007/978-981-287-251-7_4(233-267)Online publication date: 9-Aug-2022
https://doi.org/10.1007/978-981-287-251-7_4
Luangsomboon NLiebeherr J(2021)HLS: A Packet Scheduler for Hierarchical Fairness2021 IEEE 29th International Conference on Network Protocols (ICNP)10.1109/ICNP52444.2021.9651972(1-11)Online publication date: 1-Nov-2021
https://doi.org/10.1109/ICNP52444.2021.9651972
Wang PJiang ZQi MDai LXu H(2021)Uncertainty-aware Weighted Fair Queueing for Routers Based on Deep Reinforcement Learning2021 IEEE 4th International Conference on Electronics and Communication Engineering (ICECE)10.1109/ICECE54449.2021.9674580(1-7)Online publication date: 17-Dec-2021
https://doi.org/10.1109/ICECE54449.2021.9674580
Dickson AThomas C(2021)Analysis of UNSW-NB15 Dataset Using Machine Learning ClassifiersMachine Learning and Metaheuristics Algorithms, and Applications10.1007/978-981-16-0419-5_16(198-207)Online publication date: 6-Feb-2021
https://doi.org/10.1007/978-981-16-0419-5_16
Yin JSethumurugan SEckert YPatel CSmith AMorton EOskin MEnright Jerger NLoh G(2020)Experiences with ML-Driven Design: A NoC Case Study2020 IEEE International Symposium on High Performance Computer Architecture (HPCA)10.1109/HPCA47549.2020.00058(637-648)Online publication date: Feb-2020
https://doi.org/10.1109/HPCA47549.2020.00058
Domżał JWójcik RJajszczyk ADomżał JWójcik RJajszczyk A(2020)Flow-Oriented ApproachesGuide to Flow-Aware Networking10.1007/978-3-030-57153-5_1(1-52)Online publication date: 27-Oct-2020
https://doi.org/10.1007/978-3-030-57153-5_1
Kanellopoulos D(2019)Recent Progress on QoS Scheduling for Mobile Ad Hoc NetworksJournal of Organizational and End User Computing10.4018/JOEUC.201907010331:3(37-66)Online publication date: Jul-2019
https://doi.org/10.4018/JOEUC.2019070103
Huang SChang L(2018)Providing SLO Compliance on NVMe SSDs Through Parallelism ReservationACM Transactions on Design Automation of Electronic Systems10.1145/317486723:3(1-26)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1145/3174867
Liebeherr J(2018)A Fluid-Flow Interpretation of SCED Scheduling2018 30th International Teletraffic Congress (ITC 30)10.1109/ITC30.2018.10057(25-30)Online publication date: Sep-2018
https://doi.org/10.1109/ITC30.2018.10057
Zhang JRangineni KGhodsi ZGarg S(2018)ThUnderVolt: Enabling Aggressive Voltage Underscaling and Timing Error Resilience for Energy Efficient Deep Learning Accelerators2018 55th ACM/ESDA/IEEE Design Automation Conference (DAC)10.1109/DAC.2018.8465918(1-6)Online publication date: Jun-2018
https://doi.org/10.1109/DAC.2018.8465918
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Abstract

References

Cited By

Index Terms

Recommendations