An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
Optical networks: a practical perspective
Optical networks: a practical perspective
Jitter control in QoS networks
IEEE/ACM Transactions on Networking (TON)
Switching using parallel input-output queued switches with no speedup
IEEE/ACM Transactions on Networking (TON)
A note on models for non-probabilistic analysis of packet switching networks
Information Processing Letters
Analysis of the parallel packet switch architecture
IEEE/ACM Transactions on Networking (TON)
Current issues in packet switch design
ACM SIGCOMM Computer Communication Review
A near optimal scheduler for switch-memory-switch routers
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Characterizing Traffic Behavior and Providing End-to-End Service Guarantees within ATM Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Providing qos guarantees in input-buffered crossbar switches with speedup
Providing qos guarantees in input-buffered crossbar switches with speedup
Delay bounds for combined input-output switches with low speedup
Performance Evaluation - Internet performance symposium (IPS 2002)
Randomization does not reduce the average delay in parallel packet switches
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On the speedup required for combined input- and output-queued switching
Automatica (Journal of IFAC)
Providing end-to-end performance guarantees using non-work-conserving disciplines
Computer Communications
A parallel packet switch with multiplexors containing virtual input queues
Computer Communications
On the speedup required for work-conserving crossbar switches
IEEE Journal on Selected Areas in Communications
Strictly nonblocking f-cast photonic networks
IEEE/ACM Transactions on Networking (TON)
A New Dimension Analysis on Blocking Behavior in Banyan-Based Optical Switching Networks
IEICE - Transactions on Information and Systems
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
| Hi-index | 0.00 |
Banyan networks are attractive for serving as the optical switch architectures due to their nice properties of small depth and absolutely signal loss uniformity. Combining the horizontal expansion and vertical stacking of optical banyan networks is a general scheme for constructing banyan-based optical switching networks. The resulting horizontally expanded and vertically stacked optical banyan (HVOB) networks usually take either a high hardware cost or a large network depth to guarantee the nonblocking property. Blocking behavior analysis is an effective approach to studying network performance and finding a graceful compromise among hardware cost, network depth, and blocking probability; however, little has been done to analyze the blocking behavior of general HVOB networks. In this paper, we study the overall blocking behavior of general HVOB networks, where an upper bound on the blocking probability of a HVOB network is developed with respect to the number of planes (stacked copies) and the number of stages. The upper bound accurately depicts the overall blocking behavior of a HVOB network as verified by an extensive simulation study, and it agrees with the strictly nonblocking condition of the network. The derived upper bound is significant because it reveals the inherent relationship among blocking probability, network depth, and network hardware cost, so that a desirable tradeoff can be made among them. In particular, our bound gives network developers an effective tool to estimate the maximum blocking probability of a HVOB network, in which different routing strategies can be applied with a guaranteed performance in terms of blocking probability, hardware cost and network depth. Our upper bound model predicts some unobvious qualitative behaviors of HVOB networks, and it draws an important conclusion that a very low blocking probability (e.g., less than 0.001 percent) can be achieved in a HVOB network without introducing either a significantly high hardware cost or a large network depth.