Knockout packet loss probability analysis of SCWP optical packet switching wavelength distributed knockout architecture

The deployment of Optical Packet Switching (OPS) in Dense Wavelength Division Multiplexing (DWDM) backbone networks is perceived as a medium term promising alternative. Scalability restrictions imply that conventional switching architectures are unfeasible in this large-scale scenario. In a previous paper, the wavelength-distributed knockout architecture was proposed as a cost-effective scaling strategy for OPS switching fabrics. In this paper, this growable architecture is applied to OPS switching fabrics able to emulate output buffering. We also propose an scheduling algorithm which provides optimum performance if knockout packet losses are made negligible. The mathematical analysis to evaluate the knockout packet loss probability of this architecture is obtained, under uniform and non-uniform traffic patterns. To complement the switch dimensioning process, an upper bound assuring 0-knockout packet losses is compared with the exact analytical results.This research has been funded by Spanish MCyT grants TEC2004-05622-C04-01/TCM (CAPITAL) and TEC2004-05622-C04-02/TCM (ARPaq) and Xunta de Galicia grant PGIDIT04TIC322003PR

Optical Switching and Routing Architectures for Fiber-optic Computer Communication Networks

Optical technology has become a significant part of communication networks. We propose an Optical Interface Message Processor (OPTIMP) that exploits high-bandwidth, parallelism, multi-dimensional capability, and high storage density offered by optics. The most time consuming operations such as switching and routing in communication networks are performed in optical domain in the proposed system. Our design does not suffer from the optical/electrical conversion bottlenecks and can perform switching and routing in the range of Gigabits/s. The proposed design can have significant impact in high-speed communication networks as well as high-speed interconnection networks for parallel computers. The source-destination (S-D) information from a message is first converted to the spatial domain. The routing table stores all S-D codes and the corresponding control codes for the switching module. Using a cylindrical system, the routing table is searched in parallel (single step) and control signals corresponding to the matched S-D row from the table are used to control the switching module. The switching module, based on the SEED array technology, can be reconfigured in GHz range and provide high bandwidth

Concentrators in ATM switching.

by Lau Chu Man.Thesis (M.Phil.)--Chinese University of Hong Kong, 1995.Includes bibliographical references (leaves 76-83).Chapter 1 --- Introduction --- p.1Chapter 2 --- Basic Notions --- p.13Chapter 3 --- Fast Knockout --- p.19Chapter 3.1 --- The Algorithm of Fast Knockout --- p.20Chapter 3.2 --- Complexity of the Fast Knockout Algorithm --- p.29Chapter 3.3 --- Summary --- p.35Chapter 4 --- k-Sortout --- p.36Chapter 4.1 --- A Brief Review of k-Sorting --- p.37Chapter 4.2 --- The Algorithm of k-Sortout --- p.47Chapter 4.3 --- Complexity of the k- Sortout Algorithm --- p.53Chapter 4.4 --- Summary --- p.58Chapter 5 --- General Sortout --- p.59Chapter 5.1 --- The General Algorithm of Sortout --- p.59Chapter 5.2 --- Complexity of Concentrators by the General Algorithm --- p.64Chapter 5.3 --- Summary --- p.69Chapter 6 --- Concluding Remarks --- p.70Chapter 6.1 --- Summary of Results --- p.70Chapter 6.2 --- Directions for Further Research --- p.73Bibliography --- p.7

Dynamic Optical Networks for Data Centres and Media Production

This thesis explores all-optical networks for data centres, with a particular focus on network designs for live media production. A design for an all-optical data centre network is presented, with experimental verification of the feasibility of the network data plane. The design uses fast tunable (< 200 ns) lasers and coherent receivers across a passive optical star coupler core, forming a network capable of reaching over 1000 nodes. Experimental transmission of 25 Gb/s data across the network core, with combined wavelength switching and time division multiplexing (WS-TDM), is demonstrated. Enhancements to laser tuning time via current pre-emphasis are discussed, including experimental demonstration of fast wavelength switching (< 35 ns) of a single laser between all combinations of 96 wavelengths spaced at 50 GHz over a range wider than the optical C-band. Methods of increasing the overall network throughput by using a higher complexity modulation format are also described, along with designs for line codes to enable pulse amplitude modulation across the WS-TDM network core. The construction of an optical star coupler network core is investigated, by evaluating methods of constructing large star couplers from smaller optical coupler components. By using optical circuit switches to rearrange star coupler connectivity, the network can be partitioned, creating independent reserves of bandwidth and resulting in increased overall network throughput. Several topologies for constructing a star from optical couplers are compared, and algorithms for optimum construction methods are presented. All of the designs target strict criteria for the flexible and dynamic creation of multicast groups, which will enable future live media production workflows in data centres. The data throughput performance of the network designs is simulated under synthetic and practical media production traffic scenarios, showing improved throughput when reconfigurable star couplers are used compared to a single large star. An energy consumption evaluation shows reduced network power consumption compared to incumbent and other proposed data centre network technologies

Architectures of new switching systems.

by Lam Wan.Thesis submitted in: November 1997.Thesis (M.Phil.)--Chinese University of Hong Kong, 1998.Includes bibliographical references (leaves 96-102).Abstract also in Chinese.Part IChapter 1 --- Introduction to Integrated Intelligent Personal Communication System --- p.1Chapter 2 --- The Switching Architecture --- p.5Chapter 2.1 --- The Overall Switching Architecture --- p.6Chapter 2.2 --- Switching Module --- p.10Chapter 2.2.1 --- Traffic Routing in Switching Module --- p.11Chapter 2.2.2 --- Structure of Switching Module --- p.15Chapter 2.2.3 --- Wireless Base Interface --- p.16Chapter 2.2.4 --- Trunk Interface --- p.18Chapter 2.2.5 --- Analog Interfaces --- p.18Chapter 2.3 --- Network Intelligence --- p.19Chapter 2.4 --- Wireless Part --- p.21Chapter 2.4.1 --- Call-Setup in IIPCS --- p.24Chapter 2.4.2 --- Handoff --- p.25Chapter 2.4.3 --- Wireless Base --- p.27Chapter 2.5 --- Downstream Wired Extensions --- p.28Chapter 2.6 --- Upstream Wired Part --- p.28Chapter 2.7 --- Voice System --- p.28Chapter 2.8 --- Features of the IIPCS --- p.29Chapter 3 --- Concluding Remarks --- p.33Chapter 3.1 --- Summary --- p.35Chapter 3.2 --- Directions for Further Research --- p.36Part IIChapter 4 --- Introduction to Next-Generation Switch --- p.37Chapter 5 --- Architecture of Next-Generation Switch --- p.41Chapter 5.1 --- Overall Architecture of Next-Generation Switch --- p.42Chapter 5.1.1 --- Interface module --- p.44Chapter 5.1.2 --- Packetizer --- p.46Chapter 5.2 --- Concentration Fabric --- p.50Chapter 5.3 --- Shared-Buffer Memory Switch --- p.53Chapter 6 --- Concentration Networks --- p.56Chapter 6.1 --- Background of Concentration Networks --- p.56Chapter 6.2 --- k-Sorting --- p.63Chapter 6.3 --- Concentrator --- p.72Chapter 6.3.1 --- Nk-to-k Concentrator --- p.73Chapter 6.3.2 --- Match between Circles with Cost Reduction --- p.75Chapter 6.4 --- The Structure of a Molecule --- p.78Chapter 6.5 --- Summary --- p.81Chapter 7 --- Lock-Latch Algorithm --- p.82Chapter 8 --- Performance Evaluation --- p.88Chapter 9 --- Concluding Remarks --- p.93Chapter 9.1 --- LSI Implementation --- p.94Chapter 9.2 --- Summary --- p.95Bibliograph

Switching techniques for broadband ISDN

The properties of switching techniques suitable for use in broadband networks have been investigated. Methods for evaluating the performance of such switches have been reviewed. A notation has been introduced to describe a class of binary self-routing networks. Hence a technique has been developed for determining the nature of the equivalence between two networks drawn from this class. The necessary and sufficient condition for two packets not to collide in a binary self-routing network has been obtained. This has been used to prove the non-blocking property of the Batcher-banyan switch. A condition for a three-stage network with channel grouping and link speed-up to be nonblocking has been obtained, of which previous conditions are special cases. A new three-stage switch architecture has been proposed, based upon a novel cell-level algorithm for path allocation in the intermediate stage of the switch. The algorithm is suited to hardware implementation using parallelism to achieve a very short execution time. An array of processors is required to implement the algorithm The processor has been shown to be of simple design. It must be initialised with a count representing the number of cells requesting a given output module. A fast method has been described for performing the request counting using a non-blocking binary self-routing network. Hardware is also required to forward routing tags from the processors to the appropriate data cells, when they have been allocated a path through the intermediate stage. A method of distributing these routing tags by means of a non-blocking copy network has been presented. The performance of the new path allocation algorithm has been determined by simulation. The rate of cell loss can increase substantially in a three-stage switch when the output modules are non-uniformly loaded. It has been shown that the appropriate use of channel grouping in the intermediate stage of the switch can reduce the effect of non-uniform loading on performance