Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
The Channel Assignment Algorithm on RP(k) Networks
verfasst von : Fang’ai Liu, Xinhua Wang, Liancheng Xu
Erschienen in: Advances in Computer Systems Architecture
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Embedding and channel assignment is a key topic in optical interconnection networks. Based on RP(k) network, a scheme to embed a hypercube into RP(k) is given and the wavelength assignment of realizing the Hypercube communication on RP(k) network is discussed in this paper. By introducing the reverse order of Hypercube, an algorithm to embed the n-Dimension Hypercube into RP(k) is designed, which multiplexes at most max{2,
$\lfloor5 * {N} / 96 \rfloor\}$
wavelengths. An algorithm to embed the n-Dimension Hypercube into the ring network is also proposed, with its congestion equal to
$\lfloor{ N} / 3 + {N} / 12 \rfloor$
. It is a better improvement than the known result, which is equal to
$\lfloor{N} / 3 + { N} / 4 \rfloor$
. The analyses prove that it is easier to realize the Hypercube communication on RP(k) network.