We consider a traffic model where a single source generates traffic having J (J/spl ges/2) quality of service (QoS) classes, QoS in this case described by a cell loss probability objective /spl epsiv//sub j/ for QoS class j. We assume that /spl epsiv//sub 1//spl ges//spl epsiv//sub 2//spl ges/.../spl ges//spl epsiv//sub J/, in other words, class J has the most stringent QoS requirements and class 1 the least. The traffic from K such independent heterogeneous Markov-modulated fluid sources is multiplexed into a single buffer of size B. There are J-1 thresholds.>

Traffic consisting of two classes (0 and 1) arrives at a buffer in a bursty fashion. The type-0 traffic is always admitted into the buffer (of size B/sub 0/) as long as there is space for it. Type-1 traffic is admitted to the buffer only if the buffer content does not exceed a threshold B/sub 1spl les/B/sub 0/. The authors develop an analytical model to determine the bandwidth allocation in order to ensure that the packet loss probability of type-i traffic does not exceed /spl epsisub i/, where 0>

The leaky bucket, a credit management system that allows cells to enter the network only if sufficient credit is available, is considered. Motivation for an in-depth study of dynamic control algorithms, to avoid congestion in high-speed networks under time varying traffic statistics, is provided. The need for real-time traffic measurements and dynamic control actions for long-lived connections is demonstrated. In particular, it is shown through simulations that implementing access control algorithms based on the bandwidth allocation procedures only at connection setup is not sufficient for congestion-free operation of the network. It is further shown that if the bandwidth allocation and the leaky bucket parameters are not dynamically adjusted, the performances of the connections depend on their initial parameters and can be very undesirable as the traffic parameters change over time. Moreover, if corrective actions are not taken, congestion may build up in the network even in the presence of leaky buckets. The simple dynamic approach proposed limits the congestion periods in the network to the time scales of the connection-level controls. Therefore, the probability of many connections sending excess traffic into the network at the same time is greatly reduced, alleviating the congestion problem.>

article Free AccessParallel queues with resequencing Authors: Alain Jean-Marie INRIA, Valbonne, France INRIA, Valbonne, FranceView Profile , Levent Gün IBM, Research Triangle Park, NC IBM, Research Triangle Park, NCView Profile Authors Info & Claims Journal of the ACMVolume 40Issue 5Nov. 1993 pp 1188–1208https://doi.org/10.1145/174147.169748Published:01 November 1993Publication History 42citation575DownloadsMetricsTotal Citations42Total Downloads575Last 12 Months10Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

The authors present an approach to computing access control parameters as a function of both source characteristics and bandwidth allocation in the network. The technique relies on a fluid-flow model for the source, the leaky bucket rate control system, and the bandwidth allocation process. The methodology is suitable for any high-speed packet switching architecture. The approach allows for the real-time setting of the access control at a connection setup. It ensures that the access control mechanism is near transparent as long as connections behave as expected, while protecting the network from most misbehaving connections. Although some extreme cases have the potential to affect the network, they are essentially due to limitations inherent in the leaky bucket itself.>