Abstract:
The present invention relates to an N-input, N-output &#34;Knockout&#34; packet switch (11) which uses decentralized control and distributed routing for routing high-speed, time-multiplexed, variable-length packets of information from the N inputs to the N outputs. More particularly, within the switch, the N input signals are separately synchronized such that the start of each arbitrarily arriving variable-length packet is synchronized to the start of a next mini time period of a sequence of mini time periods common to all inputs. The synchronized N input signals then propagate along separate broadcast buses (14) to each of N bus interface units (15) which include N packet filters (20), a concentrator (21) and a shared buffer (22) capable of processing variable-length packets. Each bus interface unit is associated with a separate one of the N outputs (12) of the switch, and the N packet filters therein are each associated with a separate one of the N broadcast buses for detecting if a packet on the associated bus is destined for the associated switch output. The concentrator is used to (a) reduce the number of separate buffers needed to receive packets which may arrive simultaneously and are destined for the associated output, and (b) only directs a maximum of L concurrently arriving packets to the shared buffer while discarding, or &#34;knocking&#34; out, the remainder. Contending packets at the output of the concentrator are stored in the shared buffer before placement on the output line on a first-in, first-out basis. The discarded packet rate of the &#34;knockout&#34; switch can be made as small as desired and latency of packets in the switch is the smallest achievable by any comparable switch.

Description:
TECHNICAL FIELD 
     The present invention relates to a switching arrangement for routing high-speed, time-multiplexed variable-length packets of information from N inputs to N outputs in a high-performance packet switching system. More particularly, the present switch uses distributed control and a fully interconnectable configuration to route arbitrarily arriving variable-length packets from the N switch inputs to their appropriate outputs using a single stage of switching which includes a minimum amount of buffering and provides the lowest packet latency in any switching arrangement. 
     DESCRIPTION OF THE PRIOR ART 
     Every type of communication network interconnecting more than two users depends on some form of switching to efficiently route information among the various users. In such switches, the traffic presented at two or more inputs may be destined for a common output. There are basically only two ways that such a situation can be managed. 
     First, the switch may require a controller that schedules the arrivals of packets to avoid conflict. The classic Time-Space-Time switch shown in FIG. 3.6 at page 95 of the book by H. Inose entitled &#34;An Introduction To Digital Integrated Communications Systems&#34;, University of Tokyo Press, Tokyo, Japan, 1979, falls into this category. There, each input to the switch is preceded by a Time Slot Interchange to rearrange the time sequence of the time-multiplexed traffic so that, when presented to the switch, the data appearing at the N inputs are, at all times, destined for distinct separate outputs. However, scheduling is a difficult task, as shown by T. Inukai in IEEE Transactions on Communications, Vol. COM-27. No. 10, October 1979 at pages 1449-1455 and, although feasible and adequate for circuit switching, requires too much time to determine permissible input/output combinations to be applicable for packet switching. 
     The second way, and perhaps the more attractive approach for managing contention, employs decentralized control and distributed routing wherein each packet or burst of traffic contains a header bearing the destination port of the switch for that packet, where the header is used in routing the packet through the switch. Without the coordination afforded by the central scheduler, the switch must now recognize conflict among its inputs and internally store, or buffer, all but at most one of several simultaneous arriving packets destined for a common output, thereby leading to statistical delay, or latency, within the switch. Such self-scheduling switches, as shown in the article by D. M. Dias et al. in GLOBECOM &#39;84, Vol. 1, Atlanta, Ga., Nov. 26-29, 1984, pages 5.2.1-5.2.7, typically employ binary switching elements appropriately interconnected and arranged to form a multistage switch. These switches have tended to emphasize a reduction in the number of switch elements needed to a value below that of a fully connected arrangement, one wherein each input has a dedicated path to each output and thereby requiring N 2  elements. In addition to congestion at the outputs, these element-efficient switches can also congest at each of the binary switch points, thereby requiring that additional measures be taken, such as buffering within each element. Because these autonomous buffers cannot be shared among elements, the complexity of the buffering is typically much greater than that of the binary switching elements themselves. Moreover, the delay encountered within the network is greater than the unavoidable component caused by destination congestion alone. 
     The problem remaining in the prior art is to provide a switch which (a) can be used to switch packets which arrive arbitrarily at the N inputs of the switch and include variable lengths and (b) avoids (1) the scheduling problems encountered with switches requiring controllers, and (2) the buffering complexity and delays encountered by the decentralized control and distributed routing switches. 
     SUMMARY OF THE INVENTION 
     The foregoing problem in the prior art has been solved in accordance with the present invention which relates to a switching arrangement for routing high-speed, time-multiplexed variable-length packets of information from N inputs to N outputs in a high-performance packet switching system. The present switch uses distributed control and a fully interconnectable configuration to passively route arriving variable-length packets to their appropriate outputs using a single stage of switching. 
     It is an aspect of the present invention to provide a switching arrangement for routing multiple variable-length high-speed, time-multiplexed packets of information from the N inputs to the N outputs using decentralized control and distributed routing. The switching arrangement comprises two basic characteristics: (1) each input has a separate broadcast bus, and (2) each output has access to the packets of information arriving on all inputs. More particularly, each output passively interfaces to the complete set of N input buses and provides several important features. First, no switch blocking occurs where packets destined for one output interfere with packets going to other outputs. Second, the broadcast buses can reside on an equipment backplane with the circuitry for each of the N input/output pairs placed on a single plug-in circuit card. Third, with each bus being driven by only one input it allows for a higher transmission rate on the buses than found with a shared parallel bus accessed by all inputs. Lastly, since every input is available at the interface to every output, arriving packets can be addressed to, and received by, multiple outputs and thereby lends itself to broadcast and multicast features. 
     It is a further aspect of the present invention to provide a &#34;Knockout&#34; switching arrangement for routing variable-length, high-speed, time-multiplexed packets of information from N inputs to N outputs using decentralized control and distributed routing. Structurally, each of the N input signals has the start of each of its arbitrarily arriving variable-length packet synchronized to the start of a next mini time period of sequential mini time periods common to all inputs, where each mini time period is less that the length of any packet of information. The N input signals propagate along separate buses to each of N bus interface units which include N packet filters, a concentrator and a shared buffer. Each bus interface unit is associated with a separate one of the N outputs, and the N packet filters therein are each associated with a separate one of the N buses for detecting if a packet on the associated bus is destined for the associated output using an address disposed in the packet during a first mini-time period. The concentrator is used at each output to reduce the number of separate buffers needed to receive simultaneously arriving packets. The contending packets are stored in the shared buffer before placement on the output line on a first-in, first-out basis. 
     Other and further aspects of the present invention will become apparent during the course of the following description and by reference to the accompanying drawings. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     Referring, now to the drawings in which like numerals represent like parts in the several views: 
     FIG. 1 illustrates a block diagram of an N-input, N-output time slotted packet switching arrangement in accordance with the present invention including typical different length packets arriving in a time-slotted sequence at the N inputs and routed to the appropriate N outputs; 
     FIG. 2 is a block diagram of one of the N bus interface units of the switching arrangement of FIG. 1; 
     FIG. 3 illustrates an exemplary packet format received by an input interface module of FIG. 1; 
     FIG. 4 illustrates an exemplary packet format at the output of an input interface module in FIG. 1; 
     FIG. 5 is a block diagram of an exemplary arrangement of the concentrator of FIG. 2: 
     FIG. 6 shows an exemplary arrangement of a contention interface in the concentrator arrangement of FIG. 5; 
     FIG. 7 illustrates a exemplary arrangement of the N:L data switch in the exemplary concentrator arrangement of FIG. 5; 
     FIG. 8 is a block diagram of an exemplary block diagram of the contention circuitry in the exemplary concentrator arrangement of FIG. 5; 
     FIG. 9 shows an exemplary block diagram of a shared buffer arrangement in the bus interface unit of FIG. 2; and 
     FIG. 10 is an block diagram of an exemplary alternative arrangement for the shared buffer in the bus interface unit of FIG. 2. 
    
    
     DETAILED DESCRIPTION 
     The switching arrangement in accordance with the present invention includes an N-input, N-output packet switch using decentralized control and distributed routing with all inputs and outputs operating at the same bit rate. Variable-length packets arrive at the N inputs 10 1  to 10 N  of the present N-by-N switch 11 in a manner in which each input includes sequential packets having destinations as determined by the individual remote N transmitters sending the packets, as shown in the exemplary sequences of FIG. 1. Each packet in such arrangement contains, somewhere therein, the address of its destination output as shown in the exemplary packet format of FIG. 3. 
     Aside from having control over the average number of packet arrivals destined for a given output, no control over the specific arrival times of packets on the inputs and their associated output addresses is assumed. In other words, there is no sequential specific scheduling that prevents two or more packets from arriving at different inputs in the same or overlapping time period and destined for the same output, as shown in FIG. 1 for the arriving inputs 10 1 , 10 2  and 10 N  which include overlapping packets that are destined for output 12 1 . The addressing information included in each packet is used by N-by-N packet switch 11 to route the incoming packets to their appropriate outputs 12 1  to 12 N . Hence, to avoid lost packets, or at least provide a sufficiently small probability thereof, at a minimum, packet buffering must be provided in switch 11 to smooth fluctuations in packet arrivals destined for the same output. 
     The interconnection arrangement for N-by-N packet switch 11 has two basic characteristics: (1) each input 10 1  to 10 N  is associated with a separate broadcast bus 14 1  to 14 N , respectively, and (2) each output 12 1  to 12 N  has access to all packets arriving on all inputs. As shown in FIG. 1, packets arriving at each of the N inputs 10 i  are processed by a separate input interface module 16 i  and placed directly on a separate broadcast bus 14 i , and each output 12 1  to 12 N  of switch 11 passively interfaces to the complete set of N buses 14 via a separate bus interface unit 15 1  to 15 N , respectively and then respective output interface modules 17 1  to 17 N . This simple structure provides several important features within switch 11. First, with each input having a direct path to every output, no switch blocking occurs where packets destined for one output interfere with (i.e., delay or block) packets going to other outputs. The only congestion in the switch takes place at the bus interface unit 15 i  to each output 12 i , where packets can arrive concurrently on different input lines 10 destined for the same output 12 i . Without a priori scheduling of packet arrivals, this type of congestion is unavoidable, and dealing with it typically represents the greatest source of complexity within a packet switch. This complexity is minimized by the present N-by-N packet switching arrangement 11. 
     The input and output modules 16 i  and 17 i  are usually necessary in practical applications because of the large variety of line signals and packet protocols available, where the present &#34;Knockout&#34; switch is proposed to be compatible with most of them. The input interface modules 16 i  are each designed to accept a digital stream at a high-speed rate of R Mb/s, where, for example, R=45 Mb/s hereinafter. Each of these exemplary 45 Mb/s lines may carry incoming packets of different lengths, and different lines may carry packets of different protocols. An important function of the input interface module 16 i  is to recognize the beginning and the end of each arriving packet from the associated line. For example, as shown in FIG. 3, a typical packet format may include a flag 26 in the beginning, followed by a control field 27 comprising address information plus some other control bits, then a number of information bits, some error control bits and finally terminated by a flag 28 at the end. In order to make the flags 26 and 28 unique in the digital sequence, it is customary to add &#34;stuffing bits&#34; to the original data. As an exemplary standard procedure, the input interface module 16 i  should first strip off the framing flags 26 and 28 and then remove the stuffing bits. After doing so, the unframed and de-stuffed packet length is assumed to be an integer multiple of bytes. To the beginning of each of these bytes from the original packet, it is preferred that input interface module 16 i  insert, for example, a single bit &#34;0&#34; to form exemplary successive 9-bit words. Furthermore, each input interface module 16 i  attaches two exemplary 9-bit control words preceding this entire data sequence and appends an exemplary single 9-bit control word at its end as shown in FIG. 4. Because of the additional bit added to each byte in this process, the bit rate at the output of each input interface module 16 i  is increased from the exemplary 45 Mb/s rate to the exemplary R o  =9R/8 Mb/s, or 9(45)/8=50.6 Mb/s. This is done to facilitate the features of supporting self-routing and variable-length packets as will be described hereinafter. 
     In the newly formatted packet shown in FIG. 4, the three control words are seen to frame the original data bytes which have been expanded into exemplary 9-bit words with prefixed zeros. The first two control words span an 18-bit field which is called the control header and is marked uniquely by, for example, two leading 1&#39;s. The rest of the field preferably contains two pieces of special data comprising a 10-bit sequence called a local address and 6-bit sequence called a modular packet length. The local address denotes the specific output of &#34;Knockout&#34; switch 11 for which the packet is destined. With 10 bits available, up to 1024 outputs may be specified which is assumed to be the maximum switch dimensions. This local address is derived simply by looking at the address information in the original packet and then performing an address translation with a virtual circuit table. The modular packet length, on the other hand, is generally something that is not available in prior art packet protocols. Although this information is not absolutely required for present &#34;Knockout&#34; switch 11, it is suggested that the information be included. 
     A number of possibilities for including the modular packet length information exists. For example, the original packet protocol can usually be modified to carry one more control word at the packet originating source; or some packet length information can be added during its passing through an intermediate store-and-forward node. In any event, if the packet length information is available to input interface module 16 i , it will be translated into an exemplary 6-bit digital word called the Modular Packet Length for insertion after the local address as shown in FIG. 4. This translation amounts to deciding which of the exemplary 64 predetermined packet sizes the current packet belongs to, and its actual implementation could be very simple. For example, if the maximum packet length is assumed to be 512 bytes, every packet length can be represented as a 9-bit digital word, and the Modular Packet Length can be defined as the most significant 6 bits of this 9-bit word. If the packet length is not available to the Input Interface Module, the default value becomes the maximum allowable packet size in the system. During high congestion periods, the smaller packets will have a higher probability of getting through switch 11 while the maximal length packets will stand the first chance to be dropped upon a buffer overflow. 
     After adding the two leading 9-bit control words to a newly arrived packet, the input interface module 16 i  is ready to send data (in exemplary 9-bit words) to &#34;Knockout&#34; switch 11. But module 16 i  has to do so in a synchronous manner governed by a clock (not shown) associated with switch 11. For example, bit synchronization is provided by a clock associated with switch 11 at the R o  (exemplary 50.6 Mb/s) rate with word framing done at the exemplary R o  /9 rate. Moreover, the leading control words for each packet must be synchronized with the start of message clock which may be a clock pulse mark every 27 bits (or three 9-bit words), i.e., at the R o  /27 rate. More particularly, the start of each packet is synchronized with the next clock pulse mark after its arrival. Therefore, the transmissions from all input interface modules 16 i  are done synchronously while the incoming packets arrive at the different input interface modules asynchronously. This implies that an elastic buffer has to built into each input interface module 16 i . At the end of each packet transmission, the input interface module 16 i  is also shown to append a single 9-bit control word in which the first bit is set to &#34;1&#34; to denote control; the second bit is set to &#34;0&#34; to denote end-of-transmission; and the remaining  7-bit field carries the Next-Packet address which is added inside switch 11 as will be explained hereinafter. 
     The output interface module 17 i  is quite simple. It merely removes both the three control words framing each packet and the additional control bit added to each data byte. The net result is a packet as originally received minus the stuffing bits and flags. The packet can then be easily stuffed and flagged according to the specific protocol required for the output device or communication link. The physical transmissions from output interface module 17 i  can then be matched to some external clock. 
     The broadcast bus structure of switch 11 in FIG. 1 has the desirable characteristic that each bus 14 i  is driven by only one input 10 i  from an associated Input Interface Module 16 i . This allows for a higher transmission rate on the buses and a design more tolerant of faults compared with a shared parallel bus accessed by all inputs. In addition, the packet buffering and bus access control circuitry of the known shared parallel bus architecture is replaced in the present switch 11 by, at most, an elastic buffer at each input which is used to synchronize the time slots from the individual input lines. 
     FIG. 2 is a block diagram of an exemplary bus interface unit 15 i  associated with each output 12 i  of N-by-N packet switch 11. The bus interface unit 15 i  shown has three major components. First there is a row of N packet filters 20 1  to 20 N , with each packet filter receiving the packets propagating on a separate one of broadcast buses 14 1  to 14 N . In each packet filter 20 i , the Local Address of each packet coming to its input is examined and a distinction between valid and invalid packets for the associated output is declared. In so doing, packet filter 20 i  reduces the control header for all packets from the exemplary 18 bits to 9 bits. If the Local Address agrees with the associated output line number, the packet is valid and its control header will contain two leading 1&#39;s, with the rest of the space filled by the exemplary 6-bit Modular Packet length information plus a spare bit. For a mismatched or invalid packet, its new 9-bit control header will contain two leading 0&#39;s instead of 1&#39;s. The rest of the packet, however, will be completely unaltered. Although invalid packets are not physically blocked, they are in fact marked to be discarded in later stages by virtue of having two leading 0&#39;s in their control headers. Because all packets must synchronize their beginnings to the start-of-message clock, the checking of addresses can be done conveniently with, for example, only one shift register storing the relevant output line number. 
     The minimum delay from input to output through a packet filter 20 i  is, for example, 12 bits, where 9 bit are from the first word of the original control header plus the leading 3 bits of the control header&#39;s second word. In practice, however, it might be advantageous to deliberately lengthen the delay to be exactly the exemplary 18 bits of the control header, or two 9-bit words, for easy maintenance of the synchronous clocks in the entire system. In any case, the N outputs carrying the packets with the short control headers are delivered to a concentrator 21 forming the second component of each bus interface unit. 
     Concentrator 21 receives the outputs of all associated packet filters 20 1  to 20 N  at separate inputs and achieves an N-to-L (L&lt;&lt;N) concentration of the input lines, where up to L concurrently received packets destined for an output making it through the packet filters emerge at the L outputs of concentrator 21. Therefore, concentrator 21 only has to deal with valid packets destined for an associated output, the number of which may conceivable vary from 0 to N. Concentrator 21, however, must be able to account for variable length packets. More particularly, once a connection is granted for a packet within concentrator 21, then it must be guaranteed for the entire duration of the packet, and contention for that path, or output, in concentrator 21 cannot be resumed until the completion of that packet&#39;s transmission. 
     To minimized hardware complexity, the constraint is added that all packets, although of different lengths, must start at the beginning of some narrow time slot, and thus the necessity of the start-of-message clock mentioned earlier. For circuit speed at the exemplary 50 Mb/s, N=128 and L=8, the minimum contention time required would be about 23 bit periods or approximately 460 nsec. By setting the start-of-message message clock to be R o  /27, i.e., each cycle contains three 9-bit words, it should be more than adequate to account for the contention required. A block diagram for an exemplary 128:8 concentrator 21 is shown in FIG. 5. 
     As shown in FIG. 5, the packets entering concentrator 21 are first passed through contention interfaces 30 1  to 30 N . Each contention interface performs two simple tasks: (1) it continuously looks for the pattern of two consecutive 1&#39;s in the beginning of each start-of-message cycle which signifies the arrival of a valid packet and reports the result to contention circuitry 31; and (2) it provides a fixed delay or, for example, D bits to the entire incoming bit stream. This delay D represents the combined total of the detection time for each valid packet arrival, the contention time required by contention circuitry 31 and the control set-up time needed by an exemplary 128:8 Data switch 32 before a reconfiguration. The contention and set-up times are, in turn, determined by the specific designs adopted. In the present arrangement, D is chosen to be, for example, 32 bits and it should be noted that the bit streams propagating through the contention interfaces are totally unchanged. 
     A contention interface 30 i  can be implemented in a straight-forward manner as shown in FIG. 6. In FIG. 6, the input from the associated packet filter 20 i  is received at a delay means 34 which provides the necessary delay D as explained above. Concurrent therewith, the input signal is received in a 1-bit delay circuit 35 and an AND gate 36. This combination looks for the two leading 1s indicating a valid packet and generates an enable signal, C&#39;, to a second AND gate 37. Such enable signal permits an 8-bit code word, C, comprising a leading activity bit &#34;1&#34; and a 7-bit input line number (the one of the exemplary 128) to be transmitted from circuit 38 to contention circuit 31, where the input line number is its own input 10 i  from which the valid packet was received. Therefore, output P is merely the delayed version of the input bit stream, and output C serves to signal contention circuitry 31 for the arrival of a valid packet that needs to enter immediate contention for subsequent transmission through the 128:8 data switch 32. The exact signal format for signal C again depends on the specific design of contention circuitry 31. The detection time for signal C to become active after a packet has entered contention interface 30 i  should be no more than, for example, 2 bits because only the pattern of two consecutive 1&#39;s has to be matched for the present exemplary header bits. All C outputs are connected to contention circuitry 31 and the P outputs are connected to data switch 32. Contention circuitry 31 has the responsibility of resolving conflicts between multiple packet arrivals by deciding which of the inputs are to be connected to the 8 outputs through the exemplary 128:8 data switch 32. 
     The exemplary 128:8 data switch 32 is essentially a space-division switch which connects specific inputs to the 8 outputs upon command by the contention circuitry 31. New updates on its configuration are allowed at instants marked by the start-of-message clock, i.e, every 27 bits. Once a valid packet is granted a path through data switch 32 the same path is guaranteed for the entire duration of the packet. Various implementations are possible for data switch 32 as, for example, using a cross-bar type N:L switch, or using a separate 1:L for each input to access any output. Each of such implementations may provide a disadvantage of excessive signal delay or a cumbersome switch. The design shown in FIG. 7 overcomes some of these disadvantages and uses eight 128:1 multiplexers 40 1  to 40 L , responsive to control signals from contention circuitry 31, which permits any one of the N inputs to access the appropriate associated output as is well known in the art. 
     An exemplary design for contention circuitry 31 is shown in FIG. 8. When the arrival of a valid packet is detected in an associated contention interface 30 i , its C output generates a digital word denoting its own input line number preceded by an activity bit of &#34;1&#34; as described hereinbefore. This is carried out at the onset of each start-of-message cycle which occurs every 27 bits in accordance with the exemplary arrangement proposed before. The activity bit in the C word is set to &#34;0&#34; for all cases other than the fresh arrival of a valid packet as can be seen from FIG. 6. These 8-bit words generated at the C outputs of contention interfaces 30 are supplied to contention circuitry 31 where they are regarded as individual packets for contention. These C words from the N contention interfaces 30 1  to 30 N  enter an N:L &#34;knockout&#34; concentrator 50 from which 8 winners are derived out of the 128 possible contenders. 
     An arrangement for an exemplary &#34;Knockout&#34; concentrator which can be used for concentrator 50 is described in the copending patent application filed for A. Acampora et al. concurrent with the present application. In a first section of such arrangement, the N inputs from the associated contention interfaces 30 are paired and enter a row of N/2 switching elements. This may be viewed as a first round of a tournament with N players, where the winner of each match emerges from a predetermined side of 2×2 switching elements and the loser from the other side. The N/2 winners from the first round advance to the second round where they compete in pairs as before using a row of N/4 2×2 switching elements. The winners in the second round advance to the third round and this continues until two compete for the championship; that is the right to exit the first output of concentrator 50. The losers from the first section of concentrator 50 can begin competing in a subsequent section before competition is finished in the next previous section. Delay elements can also be included to compensate for an odd number of players in any section. In such manner, L outputs can be derived from the N inputs. A packet losing L times, however, is &#34;knocked out&#34; of the competition and is discarded by concentrator 50 in its last section. In all cases, packets are only lost if more than L packets arrive concurrently at any time, which can be designed to be a low probability occurrence. 
     The winning line numbers from &#34;Knockout&#34; concentrator 50 are first stored in a set of registers 51 1  to 51 L  designated Winning Registers (WR). Winning Registers 51 1  to 51 L  are connected in parallel to another duplicate set of Control Registers (CR) 52 1  to 52 L , respectively, through a set of respective transfer control switches 53 1  to 53 L  under the control of End-of-Packet Transmission detectors 54 1  -54 L  respectively. As shown in FIG. 8, control register 52 1  is only connected to winning register 51 1 , but control register 52 2  may be connected to winning registers 51 1  or 51 2  via control switch 53 2 , and control register 52 L  may be connected to any of the L winning registers 51 1  to 51 L  via control switch 53 L . Control registers 52 1  to 52 L  receive the data from the winning registers 51, and the data are precisely the line numbers needed to set proper connections for Data switch 32. The data transfers between these registers can only occur at intervals synchronous to the start-of-message clock, or when Data Switch 32 can be updated because of the variable length packets passing therethrough. 
     For purposes of discussion, assume that at some moment of time all eight paths in the exemplary 128:8 Data switch 32 are active with valid packet data coming through. This implies that the activity bits in all eight control registers 52 are 1&#39;s. For each control register 52, as long as its activity bit is a &#34;1&#34;, it would not accept any transfer from winning registers 51. The activity bit can only be reversed to a &#34;0&#34; upon detection of the end of a packet by each of the End-Of-Packet Transmission detectors 54 1  to 54 L , which detectors 54 are responsive to such signal formed by the 9-bit appended control word of FIG. 4 received from the N:L data switch 32. In such case, the particular control register 52 i  involved has to decide from which of the winning registers 51 it should receive its next connection line number. Such transfer arrangement reflects the intentional priority technique that control register 52 1  is entitled to the first winning line number, and register 52 1  can take winning register 51 1  only if control register 52 1  does not ask for a transfer at the same time, otherwise register 52 2  takes the line number from winning register 51 2 . With such logic, for i=2 to 8, each control register 52 i  has to look at its predecessors, namely control registers 52 1  to 52 i-1  and count low many of them are asking for a transfer. Then control register 52 i  will receive a transfer from the next one. 
     In a data transfer, the activity bit in a control register 52 is automatically carried over from the winning register 51, which could actually be a &#34;0&#34; in the event that no valid packet was available. The implementation required for such control is straightforward and involves only simple logic gates, flip-flops and adders. The control set-up time and the data transfer time between registers should be designed to be no more than, for example, 5 bits. Various delay requirements may be, for example: (1) the checking time for a valid packet arrival is 2 bits; (2) the contention time through &#34;Knockout&#34; concentrator 50 is 23 bits; and (3) the data switch 32 set-up time is 5 bits. Thus the exemplary delay totals 30 bits and a delay D of 32 bits in delay 34 of contention interface 30 i  should, therefore, provide a reasonable margin to satisfy the timing requirements. It should also be noted that when the end of a valid packet under transmission through the exemplary 128:8 data switch 32 is detected, i.e., after the leading &#34;10&#34; of the last 9-bit control word of FIG. 4 has exited data switch 32, the next two bits in this past word are already in transit inside data switch 32, and only 5 bits remain before the next configuration for this particular output might have to take effect. For this reason, it is important to design the switch control set-up time and data transfer between the winning registers 51 1  to 51 L  and control registers 52 1  to 52 L  to be within 5 bits as suggested above. 
     The L concentrator outputs then enter a shared buffer 22 which can comprise the exemplary arrangement shown in FIG. 9. In FIG. 9, shared buffer 22 is shown as comprising an LXL switch 60, a plurality of L First-In, First-Out (FIFO) buffers 61 1  to 61 L , and a control section including an input control 62, a log 2  L bit wide FIFO 63, and an output control 64. More particularly, shared buffer 22 receives the L data lines from concentrator 21 and feeds one output data line to the output interface module 17 i . All of the shared buffer&#39;s input and output lines operate at the same data rate, e.g., the exemplary 50 Mb/s. If each switch output is modeled as an M/M/l/K queue as indicated in the book by L. Kleinrock entitled Queueing Systems, Vol. 1: Theory, John Wiley &amp; Sons, N.Y., N.Y., 1975, at page 130, the buffer must be sized, for example, to hold approximately 60 packets to keep the overflow probability below 10 -5  with an 85-percent load on the switch 11. The most demanding characteristic of shared buffer 22 is that it must preserve the first-in, first-out discipline as the variable-length packets come through. The arrangement of FIG. 9 accomplishes such task. 
     In the arrangement of FIG. 9, the L input line of switch 60 can be connected to any one of L FIFO buffers 61 1  to 61 L . When a new packet arrives from one of the input lines, an input controller 62 has to decide which of the L FIFOs this packet should go based on the Modular Packet Length of the new packet, as found in the second control word shown in FIG. 4, as well as the buffer occupancy status of the system. After making this connection, the input control 62 stores the FIFO number assigned for this packet in a separate FIFO 63 which has to be, for example, 3 bits wide if L=8. This latter FIFO 63 can be called the Packet Order FIFO as it contains the specific ordering of successive packets as they come into the system. The unloading of packets from the data buffers 61 is done according to the 3-bit word from packet order FIFO 63 via output control 64 so that the first-in, first-out discipline can be maintained. In other words, the output controller 64 fetches an exemplary 3-bit word from Packet Order FIFO 63 to direct the output to read a packet from a particular data buffer 61 i . Then upon detection of the end of packet via the end control word of FIG. 4, output control 64 fetches another exemplary 3-bit address from FIFO 63 for pinpointing the next packet location in buffers 61 1  to 61 L . The main advantage of this technique is the ease of implementation with FIFO buffers. The disadvantage is that the FIFO buffers are usually slower in speed than random access memories (RAMs). 
     It is to be understood that various approaches can be used for implementing shared buffer 22, and that the present invention is not limited to the arrangement of FIG. 9. For example, an alternative arrangement for shared buffer 22 can comprise the arrangement shown in FIG. 10. FIG. 10 is a block diagram with parallel random access memories to realize the equivalent of a circular buffer. The L input lines, each running at the same data rate, are individually connected to a separate corresponding one of serial-to-parallel (S/P) converters 70 1  to 70 L . For ease of illustration, 9 bits will be selected as an example for the S/P converter length and hereinafter L&#39; will be considered as equal to 9. The serial 9-bit words as received are converted to 9 bits in parallel. The first bits of all the input lines are collected through the multiplexers 71 1  to 71 L , to go into the first connected RAM in a serial manner at the input data rate. Similarly the other bits from the various inputs are also grouped correspondingly for writing onto separate RAMs as shown. 
     As a result, if one looks at the parallel RAMs 72 1  to 72 L , at a given instant in time during the write cycle, the RAMs are accepting a 9-bit word from the same input line. In other words, the simultaneous 9-bit parallel words from the L input lines are stacked across the L&#39; (9) parallel RAMs (or equivalently one 9-bit wide RAM) one after another in time. Their write addresses are not contiguous as they must follow the assigned positions for their packet locations. It should be noted that it takes only L write cycles at the input data rate to finish the recording of the L input words. Where L=8 and L&#39;=9, this leave one cycle vacant in the 9-cycle period for the nine parallel RAMs, and it can conveniently be used for reading. The read addresses for consecutive read cycles are contiguous, except at the end of each packet where a jump might be required. The output from RAMs 72 1  to 72 L , is parallel-to-serially (P/S) converted in P/S converter 73 to provide serial data to the output interface module 17 i . A key characteristic of this implementation is that the RAM speed required is precisely that of the input data rate. 
     By using the Modular Packet Length control word, as shown in FIG. 4, in the control header, the memory space can be allocated as sensibly as the up-to-date status permits. In fact if an incoming packet fails to declare its approximate length, there is no choice but to assume the maximum in its storage allocation. It is easy to see that under high congestion conditions, a packet declared to be small will have a much better chance to enter into the buffer than an undeclared or, therefore, a maximum-sized one. When the huge disparity between large and small packets are taken into account, e.g., 10 bytes versus 512 bytes, it make sense to drop a large packet under high congestion first so that a considerable number of the small ones can get through. 
     It is to be understood that the abovedescribed embodiments are simply illustrative of the principles of the invention. Various other modifications and changes may be made by those skilled in the art which will embody the principles of the invention and fall within the spirit and scope thereof. For example, it should also be noted that the interconnection architecture of the present &#34;Knockout&#34; switch 11 lends itself to broadcast and multicast features. Since every input 10 is available at the bus interface units 15 to every output 12, arriving packets can be addressed to, and received by, multiple outputs. Additionally, the present switch can also grow modularly in the manner described for the fixed-length packet &#34;Knockout&#34; switch in the copending patent application filed for A. Acampora et al. on the same day as the present application.