Photonic fast packet switching

Several approaches to photonic fast packet switching systems are presented. The wavelength-, time-, code-, and space-division approaches, including free-space photonic fast packet switching, are discussed. These approaches to photonic fast packet switching systems show that the research in this area is still in its infancy. Among various solutions, those based on a wavelength-division transport network and an electronic controller are most mature     

Priority packet switching in multistage interconnection networks

The throughput performance of a priority strategy for packet switching in multistage interconnection networks is studied. In this strategy, when packets at two or more inputs of a switching element contend for the same output line, the high priority packet has a higher probability of being selected for this output. By tuning these probabilities for different priority packets, a wide variety of throughput performances can be obtained.<>     

KSMINs: knockout switch-based multistage interconnection networksfor high-speed packet switching

We propose knockout switch-based multistage interconnection networks (KSMINs) for fast packet switching, combining the well-known knockout switch and the concept of multistage interconnection networks. The main objective is to reduce the severe pin requirements of large knockout switches through a phased address filtering. We present an approximate Markov-chain model of KSMINs to study the performance of KSMINs with different numbers of address-filtering phases. The model is shown to be accurate within 5% for all the cases considered and within 20% for the meaningful cases of the buffer sizes ⩾4. For the (256×256) KSMIN, two-phase address filtering based on the (16×16) knockout switches is shown to perform very closely to the single-stage knockout switch for a reduced hardware cost     

Reconfigurable fault tolerant networks for fast packet switching

The authors consider the design and analysis of reconfigurable networks for fast packet switching. The design constraints resulting from the use of fast packet switching that affect fault-tolerant network design are carefully studied. A reconfigurable network with high link redundancy is then proposed. An abstract replacement model that characterizes the proposed reconfigurable network is presented. Network fault tolerance problems are transformed into well known assignment problems. Two practical designs based on feasible technology are presented. An appreciable reliability improvements is achieved and full bandwidth is maintained up to a tolerable level of failures, with relatively few spare switches     

Optimal queueing policies for fast packet switching of mixedtraffic

The power of ATM (asynchronous transfer mode) is its ability to provide bandwidth on demand, different sources can have different bandwidth requirements. Sources also differ in performance requirements, some ask for minimal delay variations, whereas others must have extremely low cell loss probabilities. It is shown how these complementary performance requirements can be explained with an LDOLL (low delay or low loss) queue, where sources get either service priority or storage priority. The space of possible LDOLL queuing policies is very large, even after a justified reduction, the size is still O (2^Q2), Q being the maximum number of ATM cells in the LDOLL queue. Using Markov decision theory and concepts of linear programming, only Q so-called efficient solutions are achieved. These are the LDOLL threshold policies, which are conceptually appealing, robust in performance, and practical from the implementation viewpoint     

The bypass queue in fast packet switching

The telecommunications networks of the future are likely to be packet switched networks consisting of wide bandwidth optical fiber transmission media, and large, highly parallel, self-routing switches. Recent considerations of switch architectures have focused on internally nonblocking networks with packet buffering at the switch outputs. These have optimal throughput and delay performance. The author considers a switch architecture consisting of parallel plans of low-speed internally blocking switch networks, in conjunction with input and output buffering. This architecture is desirable from the viewpoint of modularity and hardware cost, especially for large switches. Although this architecture is suboptimal, the throughput shortfall may be overcome by adding extra switch planes. A form of input queuing called bypass queuing can improve the throughput of the switch and thereby reduce the number of switch planes required. An input port controller is described which distributes packets to all switch planes according to the bypass policy, while preserving packet order for virtual circuits. Some simulation results for switch throughput are presented     

多维分组交换结构中的一种缓存设置方法

分析了在多维分组交换结构（MPSF, multi-dimensional packet switching fabric）中,采用传统的缓存设置方法时存在的缺陷.为此,提出了一种新的缓存设置方法.该方法可简化交换节点调度策略的实现,提升交换结构的吞吐量.分析和仿真结果验证,相比与传统的在MPP （massively parallel processor）中采用的缓存设置方法,采用新方法可获得更好的吞吐量性能,且降低实际开销.     

A survey of multistage interconnection networks in fast packet switches

This paper comprises a broad survey of multistage interconnection networks (MINs), which are incorporated into the underlying fabric of fast packet switches for use in broadband ATM networks. A general classification of MINs based on network functionality and blocking characteristics in the context of fast packet switches is presented in order to emphasize the fundamental principles which differentiate the network architectures. For each class of network, important theoretical results are given and the underlying design principles are explained with the best known explicit examples. Special emphasis is given to the implementation complexities and control strategies of individual approaches.     

Accuracy of traffic modeling in fast packet switching

Arrivals of calls, bursts, and packets to a fast packet switching system are governed by different time scales. This feature is used to break down the system performance analysis into layers. The impact of each layer on packet delay and blocking is investigated in isolation by assuming the global equilibrium in the next higher layer and deterministic flow of entities in all lower layers. The one-layer analytical model is developed and used to determine lower and upper estimates of a mean delay and blocking. Numerical results are compared with delays obtained from the multilayer simulation. Results of the analysis indicate that the channel utilization must be kept below a threshold value to avoid overload periods in the burst and call layers. Flow control techniques which can be used for that purpose are briefly discussed     

Simple switching technique for fast PLL frequency synthesisers

For PLL frequency synthesisers a simple circuit for a deadbeat control strategy is given; with the loop damping removed the initial frequency error is measured over half a cycle of loop oscillation, and then a corrective step of half this is made and the damping replaced.     

Frame relaying and the fast packet switching concepts and issues

High-speed networking based on frame relaying and fast packet switching are discussed, and the distinctions between the two technologies are clarified. Some of the recent International Consultative Committee for Telephone and Telegraph (CCITT) standards are examined, and the remaining issues for implementing these services are addressed. Particular attention is given to congestion control issues in ATM (asynchronous transfer mode) and frame relay networks. Some industry implementations are briefly reviewed     

Real-time packet switching: a performance analysis

The authors model the internal structure of a packet-switching node in a real-time system and characterize the tradeoff between throughput, delay, and packet loss as a function of the buffer size, switching speed, etc. They assume a simple shared-single-path switch fabric, though the analysis can be generalized to a wider class of switch fabrics. They show that with a small number of buffers the node will provide a guaranteed delay bound for high-priority traffic, a low average delay for low-priority traffic, no loss of packets at the input and low probability of packet loss at output     

Broadband packet switching: a personal perspective

The author's personal perspective on the development of broadband packet switching from 1980 to 1995 is presented in the context of the Internet's development during the same timeframe. The development of today's Internet is also placed into a 40-year perspective of a mature deployment of a national broadband packet infrastructure. A conclusion that today's Internet represents about 0.1 percent of the deployment of a national petabit per second capacity broadband packet network, and that we have moved roughly halfway through the development and deployment timeline is developed. Along the way, the author gives his personal perspective on the development of, and the researchers who developed, technologies like packet voice, Ethernet bridging, ATM, the CNRI gigabit testbeds, and local ATM. The article discusses the efforts at transitioning the Internet from academic to commercial service     

An advanced satellite communication system with on-board fast packet switching capabilities

This paper is focused on a satellite communication system having on-board fast packet switching capabilities. Different alternatives for the up-link access technique and for the architecture of the onboard switching fabric are considered. In particular an efficient time division multiple access technique with slots assigned on demand and a novel switching approach are proposed. Performances in terms of mean access delay and mean on-board switching delay are derived by analytical approaches and computer simulations.     

Scheduling algorithms for optical packet fabrics

Utilizing optical technologies to build packet fabrics for high-capacity switches and routers has several advantages in terms of scalability, power consumption, and cost. However, several technology related problems have to be overcome to be able to use such an approach. The reconfiguration times of optical crossbars are longer than those of electronic fabrics and end-to-end clock recovery in such systems add to the reconfiguration overheads. Both these problems can limit the efficiency of optical packet fabrics. In addition, existing work on input-buffered switches mostly assumes fixed size packets (referred as envelopes in this paper). When fixed size switching is used for Internet protocol networks where packets are of variable size, the incoming packets need to be fragmented to fit the fixed size envelopes. This fragmentation can lead to, possibly large loss of bandwidth and even instability. This paper addresses all of the above issues by presenting packetization and scheduling techniques that allow optical packet fabrics to be used within switches and routers. The proposed scheme aggregates multiple packets in a single envelope and when used in combination with proper scheduling algorithms, it can provide system stability as well as bandwidth and delay guarantees. As a result of the aggregation method, the reconfiguration frequency required from the optics is reduced, facilitating the use of optical technologies in implementing packet switch fabrics.     

PROTECTORATION: a fast and efficient multiple-failure recovery technique for resilient packet ring using dark fiber

The two protection methods wrapping and steering used in IEEE 802.17 resilient packet ring (RPR) provide fast but very inefficient and limited network failure recovery. Due to the increased length of the backup path, RPR suffers from high traffic loss, a decreased throughput-delay performance, and the lack of resilience against multiple link and/or node failures. To achieve an improved resilience, interconnecting a subset of the ring nodes by means of a dark-fiber single-hop star wavelength division multiplexing (WDM) network is proposed. In doing so, the ring network is divided into separate domains, each being fully recoverable from a single link or node failure without losing full network connectivity. A novel hybrid fault recovery technique, termed protectoration, is proposed and examined by means of probabilistic analysis and simulation in terms of stability, channel utilization, and throughput-delay performance. The proposed protectoration technique 1) combines the fast recovery time of protection and the bandwidth efficiency of restoration, 2) provides full recovery from multiple link and node failures, 3) builds on both wrapping and steering protection methods of RPR and, thus, allows for an evolutionary upgrade of existing RPR networks, and 4) does not require the convergence of routing protocols in response to failures and, thus, improves the routing stability and network availability. Numerical investigations in this paper show that the location of failures has a strong impact on the network performance. For a given failure location, the protectoration technique is able to accommodate multiple ring failures without significant performance loss.     

SLOB: a switch with large optical buffers for packet switching

Recently, optical packet switch architectures, composed of devices such as optical switches, fiber delay lines, and passive couplers, have been proposed to overcome the electromagnetic interference (EMI), pinout and interconnection problems that would be encountered in future large electronic switch cores. However, attaining the buffer size (buffer depth) in optical packet switches required in practice is a major problem; in this paper, a new solution is presented. An architectural concept is discussed and justified mathematically that relies on cascading many small switches to form a bigger switch with a larger buffer depth. The number of cascaded switches is proportional to the logarithm of the buffer depth, providing an economical and feasible hardware solution. Packet loss performance, control and buffer dimensioning are considered. The optical performance is also modeled, demonstrating the feasibility of buffer depths of several thousand, as required for bursty traffic     

Unified approaches to integrated-service networks–burst and fast packet switching

The increasing demand for communication services, coupled with recent technological advances in communication media and switching techniques, has resulted in a proliferation of new and expanded services. Currently, networks are needed which can transmit voice, data and video services in an application-independent fashion. Unified approaches employ a single switching technique across the entire network bandwidth, thus allowing services to be switched in an application-independent manner. This paper presents a taxonomy of integrated-service networks, including a look at NISDN, while focusing on unified approaches to integrated-service networks. The two most promising unified approaches are burst and fast packet switching. Burst switching is a circuit switching-based approach which allocates channel bandwidth to a connection only during the transmission of ‘bursts’ of information. Fast packet switching is a packet switching-based approach which can be characterized by very high transmission rates on network links and simple, hard-wired protocols which match the rapid channel speed of the network. Both approaches are being proposed as possible implementations for integrated-service networks. We survey these two approaches, and also examine the key performance issues found in fast packet switching. We then present the results of a simulation study of a fast packet switching network.     

Techniques for optical packet switching and optical burst switching

Wavelength-division multiplexing appears to be the solution of choice for providing a faster networking infrastructure that can meet the explosive growth of the Internet. Several different technologies have been developed so far for the transfer of data over WDM. We survey two new technologies which are still in the experimental stage-optical packet switching and optical burst switching-and comment on their suitability for transporting IP traffic     

A fully implemented 12 /spl times/ 12 data vortex optical packet switching interconnection network

A fully functional optical packet switching (OPS) interconnection network based on the data vortex architecture is presented. The photonic switching fabric uniquely capitalizes on the enormous bandwidth advantage of wavelength division multiplexing (WDM) wavelength parallelism while delivering minimal packet transit latency. Utilizing semiconductor optical amplifier (SOA)-based switching nodes and conventional fiber-optic technology, the 12-port system exhibits a capacity of nearly 1 Tb/s. Optical packets containing an eight-wavelength WDM payload with 10 Gb/s per wavelength are routed successfully to all 12 ports while maintaining a bit error rate (BER) of 10/sup -12/ or better. Median port-to-port latencies of 110 ns are achieved with a distributed deflection routing network that resolves packet contention on-the-fly without the use of optical buffers and maintains the entire payload path in the optical domain.