• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Virtual clock: A new traffic control algorithm for packet switching networks (1990)

by Lixia Zhang
Venue:In Proc. ACM SIGCOMM
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 617
Next 10 →

Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks

by Hui Zhang - Proceedings of the IEEE , 1995
"... While today’s computer networks support only best-effort service, future packet-switching integrated-services networks will have to support real-time communication services that allow clients to transport information with performance guarantees expressed in terms of delay, delay jitter, throughput, ..."
Abstract - Cited by 609 (4 self) - Add to MetaCart
While today’s computer networks support only best-effort service, future packet-switching integrated-services networks will have to support real-time communication services that allow clients to transport information with performance guarantees expressed in terms of delay, delay jitter, throughput, and loss rate. An important issue in providing guaranteed performance service is the choice of the packet service discipline at switching nodes. In this paper, we survey several service disciplines that are proposed in the literature to provide per-connection end-to-end peqormance guarantees in packet-switching networks. We describe their mechanisms, their similarities and differences, and the performance guarantees they can provide. Various issues and tradeoffs in designing service disciplines for guaranteed performance service are discussed, and a general framework for studying and comparing these disciplines are presented. I.
(Show Context)

Citation Context

... service disciplines that are aimed to provide per-connection performance guarantees have been proposed in the context of high-speed packetswitching networks [12], [16], [21], [22], [26], [56], [62], =-=[67]-=-. Also, new analysis techniques have been proposed to address the performance issues of these disciplines [l], [51, VI, [SI, [341, [351, P71, WI, P21, [481, V91, [581, PROCEEDINGS OF THE IEEE, VOL. 83...

Fundamental Design Issues for the Future Internet

by Scott Shenker - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS , 1995
"... The Internet has been a startling and dramatic success. However, multimedia applications, with their novel traffic characteristics and service requirements, pose an interesting challenge to the technical foundations of the Internet. In this paper we address some of the fundamental architectural d ..."
Abstract - Cited by 471 (3 self) - Add to MetaCart
The Internet has been a startling and dramatic success. However, multimedia applications, with their novel traffic characteristics and service requirements, pose an interesting challenge to the technical foundations of the Internet. In this paper we address some of the fundamental architectural design issues facing the future Internet. In particular, we discuss whether the Internet should adopt a new service model, how this service model should be invoked, and whether this service model should include admission control. These architectural issues are discussed in a nonrigorous manner, through the use of a utility function formulation and some simple models. While we do advocate some design choices over others, the main purpose here is to provide a framework for discussing the various architectural alternatives.
(Show Context)

Citation Context

... new network designs and analyses of existing ones; we do not attempt to add to this body of knowledge here, nor to review it (see [21, [31, [91-[121, [151-[231, [261-[281, [311-[361, WI, [43], [46], =-=[47]-=- and the references therein for a sampling of the literature). Instead, our focus is on identifying the reasoning and assumptions behind various design approaches in the hope of illuminating some of t...

A self-clocked fair queueing scheme for broadband applications

by S. Jamaloddin Golestani - Proceedings of IEEE INFOCOM’94 , 1994
"... A n ef ic ient fa i r queueing scheme which is feasi-ble f o r broadband implementation i s proposed and i ts performance i s analyzed. W e define fairness in a self-contained manner, eliminating the need f o r the hypo-thetical fluid-flow reference sys tem used in the present state of art and ther ..."
Abstract - Cited by 449 (0 self) - Add to MetaCart
A n ef ic ient fa i r queueing scheme which is feasi-ble f o r broadband implementation i s proposed and i ts performance i s analyzed. W e define fairness in a self-contained manner, eliminating the need f o r the hypo-thetical fluid-flow reference sys tem used in the present state of art and thereby removing the associated com-putational complexity. The scheme i s based on the adoption of an internally generated virtual time as the index of work progress, hence the name self-clocked fair queueing. W e prove that the scheme possesses the desired fairness property and i s nearly optimal, in the sense that the maximum permissible disparity among the normalized services offered to the backlogged ses-sions is newer more than two t imes the corresponding figure in any packet-based queueing system. 1
(Show Context)

Citation Context

...processor shar-sing (GPS) and packet-by-packet generalized processorssharing (PGPS), respectively.sAnother work, which shall be cited in connectionswith fair queueing, is Zhang’s virtual clock schemes=-=[12]-=-. Even though this scheme, in spite of the declaredsobjective, does not provide fair services to the users,sthe notion of virtual clock, first adopted by her, hassproven to be an effective tool for fo...

Efficient Fair Queuing using Deficit Round Robin

by M. Shreedhar, George Varghese - SIGCOMM '95 , 1995
"... Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work required to process a packet in these schemes was ..."
Abstract - Cited by 359 (4 self) - Add to MetaCart
Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work required to process a packet in these schemes was O(log(n)), where n is the number of active flows. This is expensive at high speeds. On the other hand, cheaper approximations of fair queuing that have been reported in the literature exhibit unfair behavior. In this paper, we describe a new approximation of fair queuing, that we call Deficit Round Robin. Our scheme achieves nearly perfect fairness in terms of throughput, requires only O(1) work to process a packet, and is simple enough to implement in hardware. Deficit Round Robin is also applicable to other scheduling problems where servicing cannot be broken up into smaller units, and to distributed queues.
(Show Context)

Citation Context

...s about traffic distributions. Flows: Our intent is to provide firewalls between different packet streams. We formalize the intuitive notion of a packet stream using the more precise notion of a flow =-=[Zha91]-=-. A flow has two properties: ffl A flow is a stream of packets which traverse the same route from the source to the destination and that require the same grade of service at each router or gateway in ...

Fair Scheduling in Wireless Packet Networks

by Songwu Lu, Vaduvur Bharghavan, Rayadurgam Srikant - IEEE/ACM Transactions on Networking , 1997
"... Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not addressed effectively by most contemporary wireline fair scheduling algorithms because of two unique characteristics of wireless media: (a) bursty channel errors, and (b) location-dependent channel capacity and e ..."
Abstract - Cited by 338 (21 self) - Add to MetaCart
Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not addressed effectively by most contemporary wireline fair scheduling algorithms because of two unique characteristics of wireless media: (a) bursty channel errors, and (b) location-dependent channel capacity and errors. Besides, in packet cellular networks, the base station typically performs the task of packet scheduling for both downlink and uplink flows in a cell; however a base station has only a limited knowledge of the arrival processes of uplink flows. In this paper, we propose a new model for wireless fair scheduling based on an adaptation of fluid fair queueing to handle location-dependent error bursts. We describe an ideal wireless fair scheduling algorithm which provides a packetized implementation of the fluid model while assuming full knowledge of the current channel conditions. For this algorithm, we derive the worst-case throughput and delay bounds. Finally, we describe a practical wir...
(Show Context)

Citation Context

...f1 . The traditional fluid fair queueing model does not need to address this issue since in a wireline model, either all flows are permitted to transmit or none of them is. In the Virtual Clock model =-=[13]-=-, when a flow has nothing to transmit during a time window, it can reclaim its missed share of the channel capacity at a later time. Arguments have been made against allowing for such compensation, in...

The Design and Performance of a Real-time CORBA Event Service

by Timothy Harrison, David L. Levine, Douglas C. Schmidt - in Proceedings of OOPSLA '97, (Atlanta, GA), ACM , 1997
"... The CORBA Event Service provides a flexible model for asynchronous communication among objects. However, the standard CORBA Event Service specification lacks important features required by real-time applications. For instance, operational flight programs for fighter aircraft have complex realtime pr ..."
Abstract - Cited by 274 (91 self) - Add to MetaCart
The CORBA Event Service provides a flexible model for asynchronous communication among objects. However, the standard CORBA Event Service specification lacks important features required by real-time applications. For instance, operational flight programs for fighter aircraft have complex realtime processing requirements. This paper describes the design and performance of an object-oriented, real-time implementation of the CORBA Event Service that is designed to meet these requirements. This paper makes three contributions to the design and performance measurement of object-oriented real-time systems. First, it illustrates how to extend the CORBA Event Service so that it is suitable for real-time systems. These extensions support periodic rate-based event processing and efficient event filtering and correlation. Second, it describes how to develop object-oriented event dispatching and scheduling mechanisms that can provide real-time guarantees. Finally, the paper presents benchmarks tha...

High Speed Switch Scheduling for Local Area Networks

by Thomas E. Anderson, Susan S. Owicki, James B. Saxe, Charles P. Thacker - ACM Transactions on Computer Systems , 1993
"... Current technology trends make it possible to build communication networks that can support high performance distributed computing. This paper describes issues in the design of a prototype switch for an arbitrary topology point-to-point network with link speeds of up to one gigabit per second. The s ..."
Abstract - Cited by 246 (3 self) - Add to MetaCart
Current technology trends make it possible to build communication networks that can support high performance distributed computing. This paper describes issues in the design of a prototype switch for an arbitrary topology point-to-point network with link speeds of up to one gigabit per second. The switch deals in fixed-length ATM-style cells, which it can process at a rate of 37 million cells per second. It provides high bandwidth and low latency for datagram traffic. In addition, it supports real-time traffic by providing bandwidth reservations with guaranteed latency bounds. The key to the switch's operation is a technique called parallel iterative matching, which can quickly identify a set of conflict-free cells for transmission in a time slot. Bandwidth reservations are accommodated in the switch by building a fixed schedule for transporting cells from reserved flows across the switch; parallel iterative matching can fill unused slots with datagram traffic. Finally, we note that pa...

Pricing in computer networks: Motivation, formulation, and example

by Ron Cocchi, Scott Shenker, Deborah Estrin, Lixia Zhang - IEEE/ACM TRANSACTIONS ON NETWORKING , 1993
"... We study the role of pricing policies in multiple service class networks. We first argue that some form of serviceclass sensitive pricing is required for any multiclass service discipline ’ to attain the desired level of performance. Borrowing heavily from the Nash implementation paradigm in econom ..."
Abstract - Cited by 234 (3 self) - Add to MetaCart
We study the role of pricing policies in multiple service class networks. We first argue that some form of serviceclass sensitive pricing is required for any multiclass service discipline ’ to attain the desired level of performance. Borrowing heavily from the Nash implementation paradigm in economics, we then present an abstract formulation of service disciplines and pricing policies. This formulation allows us to describe more clearly the interplay between service disciplines and pricing policies in determining overall network performance. Effective mrdtichtss service disciplines allow networks to focus resources on performance sensitive applications, while effective pricing policies allow us to spread the benefits of multiple service classes around to all users, rather than just having these benefits remain exclusively with the users of applications that are performance sensitive. Furthermore, service disciplines and pricing policies combine to form the incentive system facing a user; these incentives must be carefully tuned so that user self-interest leads to optimaf overall network performance. Finally, we illustrate some of these concepts through simulation of several simple example networks. In our simulations, we find that it is possible to set the prices so that users of every application type are more satisfied with the combined cost and performance of a network with service-class sensitive prices. For some application types the performance penalty received for requesting a less-than-optimal service class is offset by the reduced price of the service. For the other application types the monetary penalty incurred by using the more expensive, higher-quality service classes is offset by the improved performance they receive.

Specification of guaranteed quality of service.

by S Shenker, C Partridge, R Guerin - IETF RFC , 1997
"... ..."
Abstract - Cited by 228 (7 self) - Add to MetaCart
Abstract not found

Latency-rate servers: A general model for analysis of traffic scheduling algorithms,”

by D Stiliadis, A Varma - IEEE/ACM Transaction on Networking, , 1998
"... ..."
Abstract - Cited by 227 (16 self) - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

... necessary to achieve deterministic bandwidth guarantees. Several service disciplines are known in the literature for providing bandwidth guarantees to individual sessions in output-buffered switches =-=[2, 3, 4, 5, 6, 7, 8, 9, 10]-=-. Many of these algorithms are also capable of providing deterministic delay guarantees when the burstiness of the session traffic is bounded (for example, shaped by a leaky bucket). In general, sched...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University