1990
DOI: 10.1145/99517.99525
|View full text |Cite
|
Sign up to set email alerts
|

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

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
101
0

Year Published

1998
1998
2018
2018

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 348 publications
(101 citation statements)
references
References 3 publications
0
101
0
Order By: Relevance
“…In wireline communication networks, a variety of schedulers are used 1, including the well‐known schemes for fair queuing 2, virtual clock 3, self‐clocked fair queuing 4, and earliest‐due‐date 5. However, these approaches are not directly applicable to wireless networks where link capacity is location‐dependent and time‐varying.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In wireline communication networks, a variety of schedulers are used 1, including the well‐known schemes for fair queuing 2, virtual clock 3, self‐clocked fair queuing 4, and earliest‐due‐date 5. However, these approaches are not directly applicable to wireless networks where link capacity is location‐dependent and time‐varying.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Since it employs rate-monotonic priority scheduling, the TCRM is simple enough to operate in highspeed networks like ATM compared to other packet-scheduling schemes which require timestamp-based sorting [1], [4], [7], [8] (see [9] for detailed implementation issues), while yielding network utilization close to that of a deadline-based scheduling which is known to be optimal in terms of network utilization [9]. However, the deterministic realtime communication service provided by the TCRM has two disadvantages due to its strict ªseparationº of real-time channels.…”
Section: Emulating Circuit-switching At the Cell-levelmentioning
confidence: 99%
“…It is impossible, however, to meet various QoS requirements for different real-time applications using the best-effort delivery service of conventional packet-switched networks, because their packet multiplexers do not differentiate between real-time and nonreal-time traffic, nor among real-time connections themselves. Several packet-multiplexing techniques have been proposed to provide different QoS for different real-time applications [1], [2], [3], [4], [5], [6], [7], [8], [9]. In particular, we proposed Traffic-Controlled Rate-Monotonic Priority Scheduling (TCRM) [9] as a cell-multiplexing scheme to achieve deterministic real-time communication in ATM networks.…”
Section: Introductionmentioning
confidence: 99%
“…GFR, which is (AAL 5) frame oriented, is intended to guarantee a minimum cell rate to a connection and to offer some fair share of the unused bandwidth in the network between the different connections. The service discipline in network buffers may be FIFO or based on WFQ (Weighted Fair Queueing)-like schemes (Self Clocked Fair Queueing 191, Virtual Clock [24], etc.). The performance of GFR for supporting TCP connections in a LAN (Local Area Network) environment has been studied in [5] via simulation.…”
Section: E L L Spacing For Tcp Regulationmentioning
confidence: 99%