By Topic

Broadcasting Algorithm on Large Chordal Ring of Degree Six Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Abbas, A. ; Fac. of Eng. & Comput. Sci., Nottingham Univ., Semenyih

The study of loop networks has been motivated mainly by conception problems in the construction of local area networks and in the design of topologies for parallel processing computer systems. This paper discusses the degree-diameter problem for chordal ring of degree six networks. We focus upon maximizing the number of vertices in the graph for given diameter and degree. We improve the result of Yebra et al. (1985) by finding that the family of triple loop graphs of the form G(4k 2 + 2k + 1;2k + 1;2k2) has a larger number of nodes for diameter k than the family G(3k2 + 3k + 1;3k + 1;3k + 2) given by Yebra et al. (1985). Moreover, a broadcasting algorithm is defined for the largest chordal ring of degree six networks. It is shown that all nodes in the network can receive the message by time at most d+3 where d is the diameter of the graph

Published in:

Information and Communication Technologies, 2006. ICTTA '06. 2nd  (Volume:2 )

Date of Conference:

0-0 0