LCS Publication Details
Publication Title: ON CONCENTRATION AND CONNECTION NETWORKS
Publication Author: Bhatt, Sandeep, Nautam
Additional Authors:
LCS Document Number: MIT-LCS-TM-196
Publication Date: 3-1-1981
LCS Group: No Group Specified
Additional URL: No URL Given
Abstract:
This thesis deals with the structural complexity of switching networks which realize concentration and connection requests when operated in a rearrangeable or incremental manner. Some of the results and constructions are briefly reviewed. On the basis of non-constructive proof techniques used to obtain linear upper bounds on the complexity of rearrangeable concentrators, it is shown that not only are certain random graphs very likely to be rearrangeable non-blocking concentrators, but that if a randomly constructed graph is not-blocking, then, on the average, only a constant number of edges need be added to the graph to make it non-blocking.
To obtain this publication:

    To purchase a printed copy of this publication please contact MIT Document Services.