| Virtual clock: a new traffic control algorithm for packet switching networks |
| Full text |
Pdf
(1.19 MB)
|
| Source
|
Applications, Technologies, Architectures, and Protocols for Computer Communication
archive
Proceedings of the ACM symposium on Communications architectures & protocols
table of contents
Philadelphia, Pennsylvania, United States
Pages: 19 - 29
Year of Publication: 1990
ISBN:0-89791-405-8
Also published in ...
|
|
Author
|
|
L. Zhang
|
XEROX Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 24, Downloads (12 Months): 241, Citation Count: 75
|
|
|
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
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
A. Demers , S. Keshav , S. Shenker, Analysis and simulation of a fair queueing algorithm, Symposium proceedings on Communications architectures & protocols, p.1-12, September 25-27, 1989, Austin, Texas, United States
|
| |
2
|
A. Deselous, Contention Probabilities in Packet Switching Networks with Strung lnput Processes, Teletraffc Congress 1988
|
| |
3
|
Ellen L. Hahne. Round Robin Scheduling for Fair Flow Control in Data Communication Networks. PhD thesis, Massachusetts Institute of Technology, December 1986.
|
| |
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.
|
| |
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.
|
| |
6
|
Utpal Mukherji. A Schedule-Based Approach for Flow-Control in Data Communication Networks. PhD thesis, Massachusetts Institute of Technology, February 1986.
|
 |
7
|
|
| |
8
|
E. P. Rathgeb. Comparison of Policing Mechanisms for ATM Networks. Submitted to IEEE INFO- COM'90, June 1990.
|
| |
9
|
Jonathan S. Turner. New Directions in Communications (or Which Way to the Information Age?). IEEE Communications Magazine, 24(10):8-15, October 1986.
|
| |
10
|
Lixia Zhang. A New Architecture for Packet Switching Network Protocols. PhD thesis, Massachusetts Institute of Technology, July 1989.
|
CITED BY 75
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Micah Adler , Ramesh K. Sitaraman , Arnold L. Rosenberg , Walter Unger, Scheduling time-constrained communication in linear networks, Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, p.269-278, June 28-July 02, 1998, Puerto Vallarta, Mexico
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Micah Adler , Sanjeev Khanna , Rajmohan Rajaraman , Adi Rosén, Time-constrained scheduling of weighted packets on trees and meshes, Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures, p.1-12, June 27-30, 1999, Saint Malo, France
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Michael A. Bender , Soumen Chakrabarti , S. Muthukrishnan, Flow and stretch metrics for scheduling continuous job streams, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.270-279, January 25-27, 1998, San Francisco, California, United States
|
|
|
|
|
|
John Bruno , Eran Gabber , Banu Özden , Abraham Silberschatz, Move-to-rear list scheduling: a new scheduling algorithm for providing QoS guarantees, Proceedings of the fifth ACM international conference on Multimedia, p.63-73, November 09-13, 1997, Seattle, Washington, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Ron Cocchi , Scott Shenker , Deborah Estrin , Lixia Zhang, Pricing in computer networks: motivation, formulation, and example, IEEE/ACM Transactions on Networking (TON), v.1 n.6, p.614-627, Dec. 1993
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Sriram Ramabhadran , Joseph Pasquale, Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay, Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, August 25-29, 2003, Karlsruhe, Germany
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|