Journal ArticleDOI
Weighted round-robin cell multiplexing in a general-purpose ATM switch chip
Reads0
Chats0
TLDR
The authors present the architecture of a general-purpose broadband-ISDN (B-IS DN) switch chip and its novel feature: the weighted round-robin cell (packet) multiplexing algorithm and its implementation in hardware, thus proving the feasibility of the architecture.Abstract:
The authors present the architecture of a general-purpose broadband-ISDN (B-ISDN) switch chip and, in particular, its novel feature: the weighted round-robin cell (packet) multiplexing algorithm and its implementation in hardware. The flow control and buffer management strategies that allow the chip to operate at top performance under congestion are given, and the reason why this multiplexing scheme should be used under those circumstances is explained. The chip architecture and how the key choices were made are discussed. The statistical performance of the switch is analyzed. The critical parts of the chip have been laid out and simulated, thus proving the feasibility of the architecture. Chip sizes of four to ten links with link throughput of 0.5 to 1 Gb/s and with about 1000 virtual circuits per switch have been realized. The results of simulations of the chip are presented. >read more
Citations
More filters
Journal ArticleDOI
PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing
Runfang Zhou,Kai Hwang +1 more
TL;DR: A new fair scheduling technique, called OCGRR (output controlled grant-based round robin), for the support of DiffServ traffic in a core router, which reduces the intertransmission time from the same stream and achieves a smaller jitter and startup latency.
Journal ArticleDOI
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
Dimitrios Stiliadis,Anujan Varma +1 more
TL;DR: The theory of /spl Lscr//spl Rscr/ servers enables computation of tight upper bounds on end-to-end delay and buffer requirements in a heterogeneous network, where individual servers may support different scheduling architectures and under different traffic models.
Proceedings ArticleDOI
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
Dimitrios Stiliadis,Anujan Varma +1 more
TL;DR: The theory of LR-servers enables computation of tight upper-bounds on end-to-end delay and buffer requirements in a network of servers in which the servers on a path may not all use the same scheduling algorithm.
Journal ArticleDOI
Quality of service support in IEEE 802.16 networks
TL;DR: This article focuses on mechanisms that are available in an 802.16 system to support quality of service (QoS) and whose effectiveness is evaluated through simulation.
Journal ArticleDOI
Performance Evaluation of the IEEE 802.16 MAC for QoS Support
TL;DR: The results highlight that the rtPS scheduling service is a very robust scheduling service for meeting the delay requirements of multimedia applications.
References
More filters
Journal ArticleDOI
Analysis and simulation of a fair queueing algorithm
TL;DR: In this article, a fair gateway queueing algorithm based on an earlier suggestion by Nagle is proposed to control congestion in datagram networks, based on the idea of fair queueing.
Proceedings ArticleDOI
Analysis and simulation of a fair queueing algorithm
TL;DR: It is found that fair queueing provides several important advantages over the usual first-come-first-serve queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth and protection from ill-behaved sources.
Journal ArticleDOI
Virtual cut-through: A new computer communication switching technique
Parviz Kermani,Leonard Kleinrock +1 more
TL;DR: The analysis shows that cut-through switching is superior (and at worst identical) to message switching with respect to the above three performance measures.
Journal ArticleDOI
Fast packet switch architectures for broadband integrated services digital networks
TL;DR: In this article, three basic types of packet switches are identified: the shared-memory, shared-medium, and space-division types, and a set of definitions and a brief description of the functionality required of fast packet switches is given.
Journal ArticleDOI
Stochastic theory of a fluid model of producers and consumers coupled by a buffer
TL;DR: In this article, the authors derived efficient computational procedures and numerically investigated the following fluid model which is of interest in manufacturing and communications: m producing machines supply a buffer, n consuming machines feed off it, each machine independently alternates between exponentially distributed random periods in the ‘in service' and 'failed' states.
Related Papers (5)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
Abhay Parekh,Robert G. Gallager +1 more