This paper introduces a new class of interconnection scheme based on the Cayley graph of the alternating group. It is shown that this class of graphs are edge symmetric and 2-transitive. We then describe an algorithm for (a) packet routing based on the shortest path analysis, (b) finding a Hamiltoni
A Shuffle-Based Alternative to the ADM Interconnection Architecture
β Scribed by K. Padmanabhan
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 801 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Current strong demands on computer communication services like Internet access services require economical solutions to provide broadband capabilities to access network. Several approaches to broadening the so-called access bottleneck have been proposed and tested: HFC using cable modems, ADSL using
## Abstract ChemInform is a weekly Abstracting Service, delivering concise information at a glance that was extracted from about 100 leading journals. To access a ChemInform Abstract of an article which was published elsewhere, please select a βFull Textβ option. The original article is trackable v