A CLASS OF ODD-RADIX CHORDAL RING NETWORKS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

PARHAMI BEHROOZ

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING Year:2006 | Volume:4 | Issue:2-4 (B) Page(s): 1-9

Download Full-Text

Persian Verion

View:

610

Download:

Cites:

Information Journal Paper

Title

A CLASS OF ODD-RADIX CHORDAL RING NETWORKS

Author(s)

PARHAMI BEHROOZ | Issue Writer Certificate

Keywords

BISECTION WIDTHQ4

CONNECTIVITYQ4

DIAMETERQ4

EMBEDDINGQ4

FAULT DDIAMETERQ4

FAULT TOLERANCEQ4

HIERARCHICAL NETWORKQ4

OPTIMAL ROUTINGQ4

SYMMETRIC NETWORKQ4

Abstract

An n-node network, with its nodes numbered from - ën/2û to én/2ù - 1, is a chordal ring with chord lengths 1=s0<s1<...<sk-1<n/2 when an arbitrary node j - ën/2û £ j< én/2ù) is connected to each of the 2k nodes j ± t ai mod n (0£ i<k) via an undirected link, where "mod" represents (nearly) symmetric residues in [- ën/2û, én/2ù - 1].We study a class of chordal rings in which the chord length si is a power of an odd "radix" r, that is, si=ri, for r=2a+1 ³ 3. We show that this class of chordal rings, with their nodes indexed by radix-r integers using the symmetric digit set [-a, a], are easy to analyze and offer a number of advantages in tenns of static network parameters and dynamic performance for many application contexts. In particular, these networks allow a very simple optimal (shortest-path) routing algorithm that generates balanced traffic. We then briefly discuss FAULT TOLERANCE properties of our networks and point out a number of variations and extensions to the basic structure.

Cites

No record.

References

No record.

Cite

APA: Copy

PARHAMI, BEHROOZ. (2006). A CLASS OF ODD-RADIX CHORDAL RING NETWORKS. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, 4(2-4 (B)), 1-9. SID. https://sid.ir/paper/70652/en

Vancouver: Copy

PARHAMI BEHROOZ. A CLASS OF ODD-RADIX CHORDAL RING NETWORKS. THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING[Internet]. 2006;4(2-4 (B)):1-9. Available from: https://sid.ir/paper/70652/en

IEEE: Copy

BEHROOZ PARHAMI, “A CLASS OF ODD-RADIX CHORDAL RING NETWORKS,” THE CSI JOURNAL ON COMPUTER SCIENCE AND ENGINEERING, vol. 4, no. 2-4 (B), pp. 1–9, 2006, [Online]. Available: https://sid.ir/paper/70652/en

Related Journal Papers