Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
On-line algorithms for path selection in a nonblocking network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On broadcast switching networks
On broadcast switching networks
Journal of the ACM (JACM)
Multicast ATM switches: survey and performance evaluation
ACM SIGCOMM Computer Communication Review
A Class of Interconnection Networks for Multicasting
IEEE Transactions on Computers
The Necessary Conditions for Clos-Type Nonblocking Multicast Networks
IEEE Transactions on Computers
A New Self-Routing Multicast Network
IEEE Transactions on Parallel and Distributed Systems
A New Conference Network for Group Communication
IEEE Transactions on Computers
A Class of Interconnection Networks for Multicasting
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
The Necessary Conditions for Clos-Type Nonblocking Multicast Networks
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Recent developments in optical multistage networks
Optical networks
A New Self-Routing Multicast Network
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
A Service-Centric Multicast Architecture and Routing Protocol
IEEE Transactions on Parallel and Distributed Systems
Locality-preserving randomized multicast routing on k-ary n-cube
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
An analytical model for the performance of buffered multicast banyan networks
Computer Communications
Design issues for multicast ATM switches
Computer Communications
| Hi-index | 14.99 |
In this paper we will present a constructive design of a new class of cascaded network structures for broadcast applications called ring sandwich networks. These ring sandwich networks are rearrangeable in the sense that a request for a connection between a sender and a receiver can sometimes be realized only by first rearranging other existing connection paths through the network. We will present analytical results which permit the average rearrangeability of ring sandwich networks to be evaluated on the basis of fundamental structural parameters associated with the ring sandwich design so that the trade-off between the network rearrangeability and the network cost can be determined. It will be shown that the average number of rearrangements to satisfy a broadcast connection request relative to the subnetwork of the cascaded ring sandwich structure providing fanout can be reduced to O(1); this is in contrast to O(N) for other existing cascaded designs. We will give detailed connecting algorithms that can be used to satisfy connection requests. We will also support our analytically derived results with corroborating simulation data. This work provides an analytical framework for a class of low-cost broadcast networks currently being employed by government and industry in both broadcasting and conferencing applications wherein only a limited degree of rearrangements can be tolerated.