• Corpus ID: 12694332

Design of an ATM shaping multiplexer with guaranteed output burstiness

  title={Design of an ATM shaping multiplexer with guaranteed output burstiness},
  author={H. Jonathan Chao and Jun-Sik Hong},
  journal={Computer Systems: Science \& Engineering},
  • H. J. Chao, Jun-Sik Hong
  • Published 1 March 1997
  • Business, Computer Science
  • Computer Systems: Science & Engineering
In order to utilize network resources eeectively while providing satisfactory quality of service (QoS) to all users on the ATM network, it is necessary to control users' traac at the network edges. ATM traac may be controlled at the User-Network Interface (UNI) and Inter-Network Interface (INI) based on the traac contracts. We propose an ATM shaping multiplexer along with its implementation architecture for all ATM traac connections multiplexed in an output stream. These connections are to be… 

Figures from this paper

Architecture and Implementation of Traffic Shaper Integrating Networks-on-Chip and off-chip Networks

This work presents a shaper that achieves accurate shaping for large numbers of variable length packet flows with the capacity to treat homogeneously every traffic source and shows that it delivers high performance with very low computational complexity and memory requirements.

WF2Q-M: Worst-case fair weighted fair queueing with maximum rate control

Enhanced Weighted Round Robin Schedulers for Bandwidth Guarantees in Packet Networks

This paper presents two enhancements for WRR schedulers which solve the problems of burstiness and superimposition of a hierarchical structure, and defines an implementation of aWRR scheduler that substantially reduces the service burstiness with marginal additional complexity.

Minimum-latency dual-leaky-bucket shapers for packet multiplexers: theory and implementation

  • A. FranciniF. Chiussi
  • Computer Science
    2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)
  • 2000
The monolithic shaper-scheduler (MSS) is presented, which integrates the shaping and scheduling functions while preserving the bandwidth guarantees of the shaped flows, and can be easily implemented in practice, with minimal overhead with respect to a conventional GPS-related scheduler.

A weighted fair queueing scheduler with decoupled bandwidth and delay guarantees for the support of voice traffic

  • A. FranciniF. Chiussi
  • Computer Science
    GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)
  • 2001
The decoupled fair queueing (DFQ) server is presented, which is specifically designed for the support of voice traffic in packet-switched networks and maintains the very low implementation complexity of WFQ schedulers, yet it guarantees low delay to flows requesting relatively low bandwidth.

An improved fair traffic shaping algorithm for high speed packet switches

An improved fair traffic shaping algorithm for high speed packet switches that can reduce the shaping delay for high rate connections without increasing the total available bandwidth and give better fairness and flexibility in the bandwidth assignment.

TD/sup 2/FQ: an integrated traffic scheduling and shaping scheme for DiffServ networks

This paper proposes an integrated traffic scheduling and shaping scheme for DiffServ networks called TD/sup 2/FQ (token-driven delay-sensitive dynamic fair queueing), which can handle the aggregated traffic shaping and maintain the inter-flow fairness within each traffic class.

Real-Time Scheduling Using Credit-Controlled Static-Priority Arbitration

It is shown that CCSP belongs to the class of latency-rate servers and guarantees the allocated rate within a maximum latency, as required by hard real-time applications, and a hardware implementation of the arbiter is presented in the context of a DDR2 SDRAM controller.

Resource-Efficient Real-Time Scheduling Using Credit-Controlled Static-Priority Arbitration

A piecewise linear service guarantee that accurately captures bursty service provisioning is presented, and an equivalent dataflow model of the new service guarantee, which is an essential component to integrate the arbiter with dataflow-based system-level design techniques that analyze the worst-case latency and throughput of real-time applications.

A hierarchical traffic shaper for packet switches

  • S. ZengN. Uzun
  • Computer Science
    Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042)
  • 1999
The proposed hierarchical traffic shaper implementation not only can manage buffer and bandwidth resources effectively in large, high-speed ATM switches, but also can be implemented efficiently with off the shelf hardware technology.



Architecture design for regulating and scheduling user's traffic in ATM networks

A general, feasible architecture is proposed to implement the traffic shaper, regulator, and scheduler, at various places in the network, which contains a buffer to delay and shape the violating cells that do not comply with some agreed-upon traffic parameters.

Modeling and Performance Comparison of Policing Mechanisms for ATM Networks

  • E. Rathgeb
  • Computer Science
    IEEE J. Sel. Areas Commun.
  • 1991
Basic design objectives and requirements for a policing or usage parameter control function are described, which serve as a basis for the comparison of some of the mechanisms proposed so far, namely the leaky bucket, the jumping window, the triggered jumpingwindow, the moving window, and the exponentially weighted moving average mechanisms.

Spacing cells protects and enhances utilization of ATM network links

It is shown that peak cell rate policing can be combined with fast reservation protocols for achieving statistical multiplexing in asynchronous transfer mode (ATM) networks. A cell spacer-controller

Peak rate enforcement in ATM networks

The authors address peak rate enforcement in asynchronous transfer mode (ATM) networks by pick-up policing mechanisms and analyzes the impact of the cell multiplexing jitter on policing mechanism dimensioning.

VirtualClock: a new traffic control algorithm for packet-switched networks

A new algorithm is described, VirtualClock, for data traffic control in high-speed networks that maintains the statistical multiplexing flexibility of pocket switching while ensuring each data flow its reserved average throughput rate at the same time.

Rate-controlled static-priority queueing

  • Hui ZhangD. Ferrari
  • Computer Science
    IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings
  • 1993
The authors propose a service discipline, called the rate-controlled static-priority (RCSP) queuing discipline, that provides throughput, delay, delay jitter, and loss free guarantees in a

Design of leaky bucket access control schemes in ATM networks

  • H. J. Chao
  • Computer Science
    ICC 91 International Conference on Communications Conference Record
  • 1991
Depending on what enforcement action is taken and whether or not there is a 'shaping' buffer, four versions of the leaky bucket scheme are considered, and their cell loss performance is compared in

Congestion control through input rate regulation

  • M. SidiWen-Zu LiuI. CidonI. Gopal
  • Business
    IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond
  • 1989
An approach to congestion control based on open-loop regulation of the input is investigated, and the tradeoff between the smoothness of the departure process and packet waiting time is studied.

Congestion control through input rate regulation

Input-rate-regulation schemes are extensively studied from the viewpoint of smoothing and regulating effects of the incoming traffic, and the trade-off between smoothness of the departure process and packet waiting times is studied.

New directions in communications (or which way to the information age?)

  • J. Turner
  • Computer Science
    IEEE Communications Magazine
  • 1986
This article outlined some of the key elements of an integrated network technology, capable of supporting voice, data, and video communication and having the flexibility to accommodate new services as the need arose, and identified Integrated switching architectures, generalized connection signaling protocols, quality-of-service, multicast switching, and routing were all identified as key challenges to be addressed.