WEIGHTED ROUND-ROBIN CELL MULTIPLEXING IN A GENERAL-PURPOSE ATM SWITCH CHIP

被引:273
作者
KATEVENIS, M [1 ]
SIDIROPOULOS, S [1 ]
COURCOUBETIS, C [1 ]
机构
[1] FDN RES & TECHNOL HELLAS,INST COMP SCI,HERAKLION,GREECE
关键词
D O I
10.1109/49.105173
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We present the architecture of a general-purpose B-ISDN switch chip and, in particular, its novel feature: the cell (packet) multiplexing algorithm and its implementation in hardware. The chip is intended to be connected via its bit-parallel links, to other similar switch chips or to link-interface chips, providing maximum flexibility in building small or large networks. Our chip implements buffering, routing, flow control, cell scheduling, and cut-through all in hardware. We present a detailed design of how our chip implements its scheduling function consisting of a weighted round-robin multiplexing scheme, using a counter, frequency weights stored in reverse bit order, and a content-addressable memory. This algorithm allocates the available bandwidth to the virtual circuits that can use it, in proportion to the prescribed weights. Other features are chip-to-chip flow control with a built-in window mechanism, a pool of shared buffers, and a set of dedicated buffers, thus offering powerful buffer management capabilities. The above features are key for our chip to successfully switch traffic with different service requirements, such as real-time traffic and noninteractive data traffic. The mechanisms built into the chip can be used by the network manager to offer guaranteed service performance to the real-time traffic, and to fully utilize the spare capacity of the links by serving the lower-priority traffic without allowing congestion (fairly allocating buffers and bandwidth). We are currently designing this chip for a full-custom CMOS technology; its crucial parts have been laid out and simulated, thus proving its feasibility.
引用
收藏
页码:1265 / 1279
页数:15
相关论文
共 21 条
[12]  
MORGAN S, 1989, P INF 89, P711
[13]  
NAGLE J, 1984, RFC 896 JAN
[14]   ON PACKET SWITCHES WITH INFINITE STORAGE [J].
NAGLE, JB .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1987, 35 (04) :435-438
[15]  
OKAJIMI Y, 1991, FEB P IEEE INT SOL S
[16]  
TAMIR Y, 1988, 15TH P INT S COMP AR, V16, P343
[17]  
TANENBAUM AS, 1981, COMPUTER NETWORKS
[18]   FAST PACKET SWITCH ARCHITECTURES FOR BROAD-BAND INTEGRATED SERVICES DIGITAL NETWORKS [J].
TOBAGI, FA .
PROCEEDINGS OF THE IEEE, 1990, 78 (01) :133-167
[19]   ROUTING AND FLOW-CONTROL IN TYMNET [J].
TYMES, LRW .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1981, 29 (04) :392-398
[20]   A NEW TECHNIQUE FOR ANALYZING LARGE TRAFFIC SYSTEMS [J].
WEISS, A .
ADVANCES IN APPLIED PROBABILITY, 1986, 18 (02) :506-532