Abstract: A method comprising: S1. dividing attack and defense processes associated with a computer network system into first one or more single-node attacks and second one or more link attacks based on attack granularity; S2. determining one or more single-node attack parameters associated with the computer network system based on configuration of the computer network system; S3. calculating (1) success probability and (2) time length of a single node attack by applying GSPN theory to mathematically analyze the determined one or more single-node attack parameters; S4. based on the success probability of the attacking single node as a parameter, using the Markov chain and the Martingale theory to calculate an average number of steps required for a successful link attack; and S5. calculating a total theoretical average attack time based on the average number of steps required for a successful link attack and the time length of a single node attack.

Abstract: New coding scheme to minimize the total local delay in the switching elements. Under the new coding scheme, the switching element can be optimized such that it can start to produce the first output bits of the output packets without having to wait for the complete arrival of all of the local routing bits, and hence reduces the local buffering delay. In practical switching applications, each switching element in a multistage switching network supporting multicasting is a bicast cell, and the concomitant new coding scheme can even achieve a minimum delay in each bicast cell. Hence the total latency of the overall switching network is minimized.

Abstract: A technique for accommodating packets of different lengths at minimal cost to hardware complexity with a self-routing switch primitive with an associated switching mechanism that accommodates packets of different lengths encapsulated in a new packet format. The switch primitive, along with a new packet format, effects the self-routing such packets through a switching fabric constructed from the interconnection of the self-routing switching primitives.

Abstract: A multicast concentrator to both concentrate and multicast packets, and the concomitant self-routing control mechanism for the switching of the packets in the multicast concentrator. An m-to-n multicast concentrator always guarantees that the total number of 0-bound and bicast signals routed to its 0-output group and the total number of 1-bound and bicast signals routed to its 1-output group are both the maximum possible. An m-to-n multicast concentrator can be easily adapted from an m-to-n concentrator by replacing each of the sorting cells in the concentrator by a bicast cell.

Abstract: A broadband packet switch that handles all packets that arrive within the same frame time by simultaneously bit-pipelining the packets into different sections of the one-stop packet buffer through an input switch. Each packet remains in is selected section until its eventual exit from the buffer through an output switch. Access to the memory storage in which the packet buffer resides is not through a memory bus or buses, thereby engendering massive parallel access.

Abstract: Equivalence among bit-permuting networks and the mechanisms for the conversion between equivalent networks. Multistage switching networks in the bit-permuting type and banyan-type can be classified into equivalence classes. One network can usually be replaced by another equivalent network in certain applications. This widens the choices of networks in meeting different requirements in applications.

Abstract: Broadband switching including the implementation of and control over a massive sub-microsecond switching fabric. To effect the attributes of the switching fabric, conditionally nonblocking components are used a building-blocks in an interconnection network which is recursively constructed. The properties of the interconnection network are preserved during each recursion to thereby configure the massive switching fabric from scalable circuitry.

Abstract: A method and apparatus for performing switching by multistage interconnection of switching elements with improved performance and low layout complexity is disclosed. The techniques of line grouping, concentrators, self-route control through sorting are applied to relieve the output contention problem and uneven incoming traffic. Further a new class of interconnection networks called the divide-and-conquer networks is disclosed, the networks have very modular structure and the optimal layout complexity amongst all multistage interconnection networks.

Abstract: Modifications to the 2-stage interconnection to allow flexible scalability. Different switching fabrics having a range of different sizes can be constructed out of the same set of I/O switching nodes through this modified 2-statge interconnection, which can further be recursively invoked to construct large switching fabrics with desirable sizes. The recursive construction incorporating the modified 2-stage interconnection can seamlessly be realized through the five hierarchical levels of physical implementation, including inside-chip implementation, PCB implementation, orthogonal packaging, interface-board packaging and fiber-array packaging. The routability of the resulting switching fabric is always guaranteed and self-routing mechanism is also pertained.

Abstract: A self-routing switching network composed of sorting cells interconnected as a bit-permuting network and, in particular, as a banyan-type network, and the concomitant general self-routing control mechanism for routing packets over such networks. The self-routing mechanism includes a theoretical approach of determining the routing tag of a packet from the guide of the network and the destination address of the packet, and accomplishes the self-routing of packets by the sorting of packets.

Abstract: Application of the technique of statistical line grouping to banyan-type networks to practically alleviate the problems of output contention, traffic fluctuation, burstiness, and so forth without incurring additional preprocessing and buffering on the input traffic by introducing alternate-routing ingredient to the unique-routing banyan-type network, but without complicating the switching control too much through alternate routing. The multicast concentrator, a concentrator with the capability of multicasting, composed of interconnected bicast cells is employed to fill in each of the dilated nodes of the banyan-type network to give a hybrid network. An extremely simple self-routing control mechanism over the hybrid network which is the natural melting of the self-routing control inside the multicast concentrators and the self-routing control over the banyan-type network is presented.

Abstract: Physical implementation of the switching fabric of a massive broadband switching network constructed from recursive 2-stage interconnection. The recursive 2-stage construction is realized through a hierarchical levels of implementation, including inside-chip implementation, PCB implementation, orthogonal packaging, interface-board packaging and fiber-array packaging. Smaller switches resulted from lower levels can be employed as the switching elements in the construction of a larger switch at a higher level of implementation. Such a hierarchical levels of implementation provides great flexibility and scalability in the physical realization of switching fabric and hence yields indefinitely large-scaled switches.

Abstract: A generalized divide-and-conquer network and concomitant methodology for recursively constructing large-scaled switching fabrics to meet the need for present-day broadband switching. Such a network achieves optimal layout complexity among the class of banyan-type networks under the 2-layer Manhattan model with reserved layers, which has been the most popular layout model for CMOS technologies. Moreover, the network achieves optimal structure modularity that minimizes the number of different components required at each step of the recursive construction. The recursive construction of a 2n×2n generalized divide-and-conquer network can be readily mapped by an n-leaf balanced binary tree.

Abstract: Application of the technique of statistical line grouping to banyan-type networks to practically alleviate the problems of output contention, traffic fluctuation, burstiness, and so forth without incurring additional preprocessing and buffering on the input traffic by introducing alternate-routing ingredient to the unique-routing banyan-type network, but does not complicate the switching control too much through alternate routing. The concentrator composed of interconnected routing cells is employed to fill in each of the dilated nodes of the banyan-type network to give a hybrid network. An extremely simple self-routing control mechanism over the hybrid network which is the natural melting of the self-routing control inside the concentrators and the self-routing control over the banyan-type network is presented.

Abstract: Broadband switching including the implementation of and control over a massive sub-microsecond switching fabric. To effect the attributes of the switching fabric, conditionally nonblocking components are used a building-blocks in an interconnection network which is recursively constructed. The properties of the interconnection network are preserved during each recursion to thereby configure the massive switching fabric from scalable circuitry.

Abstract: A self-routing multicast switching network composed of bicast cells interconnected as a bit-permuting network and, in particular, as a banyan-type network, and the concomitant general self-routing control mechanism for multicasting the packets over such networks. The self-routing mechanism includes the approach of determining the routing tag of a packet from the guide of the network and the destination addresses of the packet, and accomplishes the self-routing of the packets by the sorting of the packets.

Abstract: Broadband switching including the implementation of and control over a massive sub-microsecond switching fabric. To effect the attributes of the switching fabric, conditionally nonblocking components are used a building-blocks in an interconnection network which is recursively constructed. The properties of the interconnection network are preserved during each recursion to thereby configure the massive switching fabric from scalable circuitry.

Abstract: Broadband switching including the implementation of and control over a massive sub-microsecond switching fabric. To effect the attributes of the switching fabric, conditionally nonblocking components are used a building-blocks in an interconnection network which is recursively constructed. The properties of the interconnection network are preserved during each recursion to thereby configure the massive switching fabric from scalable circuitry.

Abstract: Broadband switching including the implementation of and control over a massive sub-microsecond switching fabric. To effect the attributes of the switching fabric, conditionally nonblocking components are used a building-blocks in an interconnection network which is recursively constructed. The properties of the interconnection network are preserved during each recursion to thereby configure the massive switching fabric from scalable circuitry.

Abstract: Broadband switching including the implementation of and control over a massive sub-microsecond switching fabric. To effect the attributes of the switching fabric, conditionally nonblocking components are used a building-blocks in an interconnection network which is recursively constructed. The properties of the interconnection network are preserved during each recursion to thereby configure the massive switching fabric from scalable circuitry.