Performance analysis of the ATM shuffleout switch under arbitrary nonuniform traffic patterns

The authors describe a model for the performance evaluation of the Shuffleout asynchronous transfer mode (ATM) switch under arbitrary nonuniform traffic patterns. Shuffleout is a blocking multistage structure using shortest path routing with deflection, in which output queues are connected to all the stages. The analytical model developed computes the load on each interstage link by tracing all the paths that a packet can follow to reach the addressed switch outlet, that is, by taking into account all the deflections from its shortest path it can receive. Such a model allows the computation not only of the average load per stage but also its distribution over the different links belonging to the interstage pattern. Thus fairness in packet switching by Shuffleout is provided by the model. >

A terabit/second hierarchically multiplexing photonic asynchronous transfer mode (ATM) switch network architecture, called Terahipas, is proposed. It combines the advantages of photonics (a large bandwidth for transport of cells) and electronics (advanced logical functions for controlling, processing, and routing). It uses a hierarchical photonic multiplexing structure in which several tens of channels with a relatively low bit rate, say 2.4 Gb/s, are first time-multiplexed on an optical highway by shrinking the interval between optical pulses, then a number of optical highways are wavelength-multiplexed (or space-division multiplexed). As a result, the switch capacity can be expanded from the order of 100 Gb/s to the order of 10 Tb/s in a modular fashion. A new implementation scheme for cell buffering is used for eliminating the bottleneck when receiving and storing concurrent optical cells at bit rates as high as 100 Gb/s. This new architecture can serve as the basis of a modular, expandable, high-performance ATM switching system for future broad band integrated service digital networks (B-ISDN's). >

An analytical model for the performance analysis of a multiple input queued asynchronous transfer mode (ATM) switch is presented. The interconnection network of the ATM switch is internally nonblocking and each input port maintains a separate queue of cells for each output port. The switch uses parallel iterative matching (PIM) to find the maximal matching between the input and output ports of the switch. A closed-form solution for the maximum throughput of the switch under saturated conditions is derived. It is found that the maximum throughput of the switch exceeds 99% with just four iterations of the PIM algorithm. Using the tagged input queue approach, an analytical model for evaluating the switch performance under an independent identically distributed Bernoulli traffic with the cell destinations uniformly distributed over all output ports is developed. The switch throughput, mean cell delay, and cell loss probability are computed from the analytical model. The accuracy of the analytical model is verified using simulation.

General models for a class of nonblocking architectures of asynchronous transfer mode (ATM) switches are described. Hardware aspects are discussed to show the implementation feasibility of the proposed switch architectures by means of the current technology. Performance issues are studied to point out the traffic bottlenecks of the different structures. It is shown that the classification of queueing is the main concept that enables the classification of nonblocking ATM switches. Three main packet queueing strategies can be adopted in the switching fabric: input queueing, shared queueing, and output queueing. Switch architectures adopting only one of these strategies are described. The ways in which two strategies can be jointly adopted in a switching fabric to result in the mixed queueing strategies input-output queueing, input-shared queueing, and shared-output queueing are also discussed. >

A possible network architecture for a microcellular mobile telecommunication system based on packet transmission and ATM (Asynchronous Transfer Mode) switching is proposed. A full integration and internetworking with Broadband Integrated Services Digital Network are assumed. The performance of a generic nonblocking ATM switch under input traffic patterns that consider the effect of handovers is evaluated. Special attention is paid to the preservation of packet sequence integrity on a virtual channel. The generic ATM switch architecture has been analyzed under simplified network architecture assumptions by means of computer simulation.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

The authors examine a growable architecture for broadband packet (asynchronous transfer mode) switching, consisting of a memoryless, self-routing interconnect fabric and modest-size packet switch modules, proposed by K.U. Eng et al. (1989). They focus on the cell loss probability, because the architecture attains the best possible delay-throughput performance if the packet switch modules use output queueing. They compute an upper bound on the cell loss probability for arbitrary patterns of independent cell arrivals, possibly including isochronous circuit connections, and show that both sources of cell loss can be made negligibly small. For example, to guarantee a cell loss probability of less than 10/sup -9/, this growable architecture requires packet switch modules of dimension 47*16, 45*16, 42*16, and 39*16 for 100%, 90%, 80%, and 70% traffic loads, respectively. The analytic techniques used to bound the cell loss probabilities are applicable to other output queueing architectures. >

The asynchronous transfer mode (ATM) has become the subject of intense interest across all segments of the telecommunications and computer industry. State-of-the-art multiplexing and switching technologies form the basis of ATM's ability to deliver different types of information (e.g., voice, data, audio, video and graphics) at gigabit speeds. ATM networks rely heavily on the efficiency and speed of their switching fabrics. In the last few years, heavy research has been conducted in the design of new ATM switching fabrics. We examine the B-tree fault-tolerant ATM switch, acknowledged to be one of the most efficient ATM switch. We show several of its shortcomings, one of which is that it does not resolve internal conflicts of data packets. We (1) extensively study the B-tree switch (2) analyze the different buffering methods that would be suitable for our design, (3) analyze the different traffic models to reflect real-time traffic, (4) exploit the information from above to design a more fault-tolerant switch, and (5) conduct extensive simulation to prove the efficacy of our design.

Many 'output scheduling' algorithms have been proposed for improving the performance of input-queued asynchronous transfer mode (ATM) switches, whereby cells from different random-access input queues destined for the same output can be scheduled for non-conflicting transmissions. An optimal output scheduling algorithm, with full coordination of transmission to all outputs, can approach the performance of output queueing. Because of the complexity of such an optimal scheduler, the output schedulers proposed in the literature are without such coordination. We propose a simple way to incorporate such a full coordination in output scheduling with very simple hardware. The throughput of the input queuing switch thus approaches that of the output queueing switch, without speed-up, input/ouput grouping or complicated hardware. To make the output scheduling algorithm fast enough, we incorporate parallelism and pipelining. We perform a detailed simulation study of the performance of the input queueing switch with the proposed scheduling algorithm.

Switch design for ATM (Asynchronous Transfer Mode) networks needs to take a fresh approach in order to support ABR (Available Bit Rate) services efficiently. In particular, ATM switches designed for data communications should implement flow control functions to prevent data loss while minimizing required memory. These new requirements make the design of ATM switches fundamentally different from that of traditional switch design.

Since the asynchronous transfer mode (ATM) has been strongly promoted as the transport structure for broadband integrated services digital networks, a variety of ATM switching architectures have been proposed. The knockout switch, which is one of the well known ATM switches, has a single-stage architecture and adopts an output buffering method. It has excellent traffic performance (cell loss probability, maximum throughput and delay, etc.), but needs many switch elements and buffers. The authors propose an ATM switch, called a knockout switch with input buffers. The proposed switch has almost the same traffic performance as the existing knockout switch but needs fewer switch elements and buffers than the existing knockout switch. The authors analyse the traffic performance and complexity (i.e. the number of switch elements and buffers required) of the proposed architecture by discrete-time Markov chain models and compare them with those of the existing knockout switch. It is found that the proposed architecture could reduce the need for over 40% of the switch elements and over 30% of the buffers while satisfying the given loss requirements.

This paper presents the architecture of a very high performance 4-input, 4-output asynchronous transfer mode (ATM) switch that has been designed as part of the ARPA-sponsored Thunder and Lightning project at the University of California, Santa Barbara. This research project is focused on the design and prototype demonstration of ATM links and switches operating at or above 40 gigabits per second per TDM link, with potential scalability to 100 Gbps. Such aggressive link rates place severe requirements on switch architecture, particularly the buffering scheme. In this paper we present the ATM switch structure and justify the main design choices.

An efficient adaptive bus arbitration scheme for scalable shared-medium ATM switch

An ultra-high-speed asynchronous transfer mode (ATM) switching module having a highway throughput of 9.6 Gb/s using a HEMT process switch IC and a ceramic multichip substrate was developed. The switch IC operates at 1.2 Gb/s. This module provides a 4*4 switch, corresponding to a switching capacity of 256 channels at 156 Mb/s. High-speed switching is essential for constructing a large switching system with small volume and low power consumption. A simulation of both cell buffer operation and line characteristic is presented. The experimental results are shown. >

In an earlier paper, the authors proposed an asynchronous transfer mode (ATM) switch (called the MSM switch) in which several shared memory modules were placed in parallel with every input and every output having access to every one of the switch modules. Here the effort is toward building distributed control schemes for the MSM switch to achieve the same performance. In the distributed control scheme the MSM switch has a set of module controllers instead of a centralized one that schedules each arriving packet and keeps track of all the packets stored in the switch. Each controller is associated with a module and keeps information about packets stored in its module. It is first shown that there exists a distributed scheduling algorithm that yields an optimal switch scheme. They then develop a decentralized control scheme which, with a batch processing technique and a ring connection of module controllers, is able to schedule arriving packets optimally. >

The authors propose the utilization of an asynchronous transfer mode (ATM) switch as a hub in a tactical communication environment. After addressing the special needs of tactical users, they describe how communications would be controlled in this environment by the ATM hub, which acts as a gateway for personnel radios, various local area networks (LANs), and high-speed radio links. An evolution plan for wideband tactical networks is described. >