{'fraction_non_alphanumeric': 0.025961538461538463, 'fraction_numerical': 0.01730769230769231, 'mean_word_length': 4.783333333333333, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
GaAs VLSI implementation of a 2.5 Gb/s ATM label translator

Routing tables for communication networks can be designed using several approaches, including table look-up, content-addressable Memory (CAM), hashing, and tries. This paper presents a GaAs VLSI implementation of an efficient table lookup algorithm for 2.5 Gb/s ATM switching systems. This algorithm presents some very promising features such as the number of Virtual Channels which can reach 30000 possible connections. An extra header of three bytes is attached to the cell header which contains policing and priorities information for use inside the switch. Routing information is performed by using the Virtual Path Identifier (VPI) and the Virtual Channel Identifier (VCI) in the incoming cell to access the header translation table. The VLSI chip is fabricated using 0.6 /spl mu/m gate GaAs MESFETs, by VITESSE Semiconductor and it is housed in a 132 pin LDCC package. The Label Translator chip is expected to operate at 311 MHz with an associated power dissipation of 4 W.