Paper Info
Title
Regular CC-banyan networks
Abstract
Construction algorithms for rectangular and nonrectangular CC-Banyan networks are presented. Routing algorithms for double and single-ended rectangular and non-rectangular CC-Banyan networks are also presented. The time complexities of the routing algorithms are O(l), where l is the number of stages in the network.
Year
DOI
Venue
1988
10.1145/633625.52437
ACM Sigarch Computer Architecture News
Keywords
Field
DocType
regular cc-banyan network,non-rectangular cc-banyan network,routing algorithm,nonrectangular cc-banyan network,construction algorithm,time complexity,computational complexity
Link-state routing protocol,Multipath routing,Banyan,Dynamic Source Routing,Computer science,Hierarchical routing,Static routing,Parallel computing,Destination-Sequenced Distance Vector routing,Routing table
Conference
Volume
Issue
ISBN
16
2
0-8186-0861-7
Citations 
PageRank 
References 
0
0.34
4
Authors
4
Name
Order
Citations
PageRank
Doug W. Kim100.34
G. Jack Lipovski2528293.80
Alfred C. Hartmann381.62
Roy M. Jenevein416049.68