Nonblocking Multirate Distribution Networks

This paper generalized known results for nonblocking distribution networks (also known as generalized connection networks) to the multirate environment, where different user connections share a switch\u27s internal data paths in arbitrary fractions of the total capacity. In particular, we derived conditions under which networks due to Ofman and Thompson, Pippenger, and Turner lead to multirate distribution networks. Our results include both rearrangeable multirate networks exceeds that of the corresponding space division network by a log log factor while the complexity of the wide sense nonblocking networks in within a factor of two the corresponding space division networks

Research Proposal: Design and Analysis of Practical Switching Networks

At the heart of any communication system is the switching system for supporting connections between sets of endpoints. A switching system consists of one or more switching networks connected by communication links. Effective design of switching networks is critical to the success of a communication system. This paper proposes the study of three problems in the design of switching networks: design of nonblocking multirate distribution, evaluation of blocking probability in distributors and quantitative comparison of architectures. Each of these problems is significant in the design of practical networks and lacks broad analytic treatment

Path switching over multirate Benes network.

Mui Sze Wai.Thesis (M.Phil.)--Chinese University of Hong Kong, 2003.Includes bibliographical references (leaves 62-65).Abstracts in English and Chinese.Chapter 1. --- Introduction --- p.1Chapter 1.1 --- Evolution of Multirate Networks --- p.2Chapter 1.2 --- Some Results from Previous Work --- p.2Chapter 1.3 --- Multirate Traffic on Benes Network --- p.5Chapter 1.4 --- Organization --- p.7Chapter 2. --- Background Knowledge on Benes Network and Path Switching --- p.8Chapter 2.1 --- Benes Network --- p.9Chapter 2.1.1 --- Construction of Large Switching Fabrics --- p.9Chapter 2.1.2 --- Routing in Benes Network --- p.11Chapter 2.1.3 --- Performance when Operated as a Large Switch Fabric --- p.13Chapter 2.2 --- Path Switching --- p.14Chapter 2.2.1 --- Basic Concept of Path Switching --- p.14Chapter 2.2.2 --- Capacity Allocation and Route Assignment --- p.15Chapter 3. --- Path Switching over Benes Network --- p.20Chapter 3.1 --- The Model of path-switched Benes Network --- p.21Chapter 3.2 --- Module-to-Module Implementation --- p.21Chapter 3.2.1 --- The First Stage (Input Module) --- p.22Chapter 3.2.2 --- The Middle Stage (Central Module) --- p.23Chapter 3.2.3 --- The Last Stage (Output Module) --- p.24Chapter 3.3 --- Port-to-Port Implementation --- p.24Chapter 3.3.1 --- Uniform Traffic --- p.25Chapter 3.3.2 --- Mult irate Traffic --- p.26Chapter 3.4 --- Closing remarks --- p.29Chapter 4. --- Performance Analysis --- p.31Chapter 4.1 --- Traffic Constraints and Perform- ance Guarantees --- p.32Chapter 4.1.1 --- Arrival Curve and Service Curve --- p.33Chapter 4.1.2 --- Delay Bound and Backlog Bound --- p.36Chapter 4.2 --- Service Guarantees --- p.39Chapter 4.3 --- Deterministic Bounds --- p.42Chapter 4.3.1 --- Delay --- p.42Chapter 4.3.2 --- Backlog at Input Module --- p.44Chapter 4.3.3 --- Backlog at Output Module --- p.47Chapter 5. --- Simulation Results --- p.52Chapter 5.1 --- Uniform Traffic --- p.53Chapter 5.2 --- Multirate Traffic --- p.55Chapter 6. --- Conclusions and Future Research --- p.59Chapter 6.1 --- Suggestions for future research --- p.61Bibliography --- p.6

The Strict-Sense Nonblocking Multirate l

This paper considers the nonblocking conditions for a multirate logd(N,0,p) switching network at the connection level. The necessary and sufficient conditions for the discrete bandwidth model, as well as sufficient and, in particular cases, also necessary conditions for the continuous bandwidth model, were given. The results given for dn-1/2f0≥f1+1 in the discrete bandwidth model are the same as those proposed by Hwang et al. (2005); however, in this paper, these results were extended to other values of f0, f1, and d. In the continuous bandwidth model for B+b>1, the results given in this paper are also the same as those by Hwang et al. (2005); however, for B+b≤1, it was proved that a smaller number of vertically stacked logdN switching networks are needed

Satellite B-ISDN traffic analysis

The impact of asynchronous transfer mode (ATM) traffic on the advanced satellite broadband integrated services digital network (B-ISDN) with onboard processing is reported. Simulation models were built to analyze the cell transfer performance through the statistical multiplexer at the earth station and the fast packet switch at the satellite. The effectiveness of ground ATM cell preprocessing was established, as well as the performance of several schemes for improving the down-link beam utilization when the space segment employs a fast packet switch

Routing algorithm for multirate circuit switching in quantized Clos network.

by Wai-Hung Kwok.Thesis (M.Phil.)--Chinese University of Hong Kong, 1997.Chapter 1 --- Introduction --- p.1Chapter 2 --- Preliminaries - Routing in Classical Circuit Switching Clos Net- work --- p.9Chapter 2.1 --- Formulation of route assignment as bipartite multigraph coloring problem --- p.10Chapter 2.1.1 --- Definitions --- p.10Chapter 2.1.2 --- Problem formulation --- p.11Chapter 2.2 --- Edge-coloring of bipartite graph --- p.12Chapter 2.3 --- Routing algorithm - Paull's matrix --- p.15Chapter 3 --- Principle of Routing Algorithm --- p.18Chapter 3.1 --- Definitions --- p.18Chapter 3.1.1 --- Bandwidth quantization --- p.18Chapter 3.1.2 --- Connection splitting --- p.20Chapter 3.2 --- Non-blocking conditions --- p.20Chapter 3.2.1 --- Rearrangeably non-blocking condition --- p.21Chapter 3.2.2 --- Strictly non-blocking condition --- p.22Chapter 3.3 --- Formulation of route assignment as weighted bipartite multigraph coloring problem --- p.23Chapter 3.4 --- Edge-coloring of weighted bipartite multigraph with edge splitting --- p.25Chapter 3.4.1 --- Procedures --- p.25Chapter 3.4.2 --- Example --- p.27Chapter 3.4.3 --- Validity of the color rearrangement procedure --- p.29Chapter 4 --- Routing Algorithm --- p.32Chapter 4.1 --- Capacity allocation matrix --- p.32Chapter 4.2 --- Connection setup --- p.34Chapter 4.2.1 --- Non-splitting stage --- p.35Chapter 4.2.2 --- Splitting stage --- p.36Chapter 4.2.3 --- Recursive rearrangement stage --- p.37Chapter 4.3 --- Connection release --- p.40Chapter 4.4 --- Realization of route assignment in packet level --- p.42Chapter 5 --- Performance Studies --- p.45Chapter 5.1 --- External blocking probability --- p.45Chapter 5.1.1 --- Reduced load approximation --- p.46Chapter 5.1.2 --- Comparison of external blocking probabilities --- p.48Chapter 5.2 --- Connection splitting probability --- p.50Chapter 5.3 --- Recursive rearrangement probability --- p.50Chapter 6 --- Conclusions --- p.5

Information Switching Processor (ISP) contention analysis and control

Future satellite communications, as a viable means of communications and an alternative to terrestrial networks, demand flexibility and low end-user cost. On-board switching/processing satellites potentially provide these features, allowing flexible interconnection among multiple spot beams, direct to the user communications services using very small aperture terminals (VSAT's), independent uplink and downlink access/transmission system designs optimized to user's traffic requirements, efficient TDM downlink transmission, and better link performance. A flexible switching system on the satellite in conjunction with low-cost user terminals will likely benefit future satellite network users

Multicast cross-path ATM switches: principles, designs and performance evaluations.

by Lin Hon Man.Thesis (M.Phil.)--Chinese University of Hong Kong, 1998.Includes bibliographical references (leaves 59-[63]).Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Organization of Thesis --- p.3Chapter 2 --- Principles of Multicast Cross-Path Switches --- p.4Chapter 2.1 --- Introduction --- p.4Chapter 2.2 --- Unicast Cross-Path switch --- p.5Chapter 2.2.1 --- Routing properties in Clos networks --- p.5Chapter 2.2.2 --- Quasi-static routing procedures --- p.5Chapter 2.2.3 --- Capacity and Route Assignment --- p.7Chapter 2.3 --- Multicast Cross-Path Switch --- p.8Chapter 2.3.1 --- Scheme 1 - Cell replication performed at both input and output stages --- p.10Chapter 2.3.2 --- Scheme 2 - Cell replication performed only at the input stage --- p.10Chapter 3 --- Architectures --- p.14Chapter 3.1 --- Introduction --- p.14Chapter 3.2 --- Input Module Design (Scheme 1) --- p.16Chapter 3.2.1 --- Input Header Translator --- p.16Chapter 3.2.2 --- Input Module Controller --- p.17Chapter 3.2.3 --- Input Replication Network (Scheme 1) --- p.19Chapter 3.2.4 --- Routing Network --- p.23Chapter 3.3 --- Central Modules --- p.24Chapter 3.4 --- Output Module Design (Scheme 1) --- p.24Chapter 3.5 --- Input Module Design (Scheme 2) --- p.25Chapter 3.5.1 --- Input Header Translator (Scheme 2) --- p.26Chapter 3.5.2 --- Input Module Controller (Scheme 2) --- p.27Chapter 3.5.3 --- Input Replication Network (Scheme 2) --- p.28Chapter 3.6 --- Output Module Design (Scheme 2) --- p.29Chapter 4 --- Performance Evaluations --- p.31Chapter 4.1 --- Introduction --- p.31Chapter 4.2 --- Traffic characteristics --- p.31Chapter 4.2.1 --- Fanout distribution --- p.31Chapter 4.2.2 --- Middle stage traffic load and its calculation --- p.32Chapter 4.3 --- Throughput Performance --- p.34Chapter 4.4 --- Delay Performance --- p.37Chapter 4.4.1 --- Input Stage Delay --- p.38Chapter 4.4.2 --- Output Stage Delay --- p.39Chapter 4.5 --- Cell Loss Performance --- p.43Chapter 4.5.1 --- Cell Loss due to Buffer Overflow --- p.44Chapter 4.5.2 --- Cell Loss Due to Output Contention --- p.45Chapter 4.6 --- Complexities --- p.50Chapter 5 --- Conclusions --- p.57Bibliography --- p.5