By Topic

Architectures for arbitrarily connected synchronization 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

2 Author(s)
Lindsey, William C. ; LinCom Corporation 5110 W. Goldleaf Circle, Suite 330 Los Angeles, CA 90056; University of Southern California, Los Angeles, CA, 1998 ; Chen, Jeng-Hong

In a synchronization (sync) network1 containing N nodes, it is shown (Theorem 1c) that an arbitrarily connected sync network D is the union of a countable set of isolated connecting sync networks {Di, i = 1, 2, …, L}, i.e., D = ULi=1 Di. It is shown (Theorem 2e) that a connecting sync network is the union of a set of disjoint irreducible subnetworks having one or more nodes. It is further shown (Theorem 3a) that there exists at least one closed irreducible subnetwork in Di. It is further demonstrated that a connecting sync network is the union of both a mastergroup and a slave group of nodes. The master group is the union of closed irreducible subnetworks in Di. The slave group is the union of non-closed irreducible subnetworks in Di. The relationships between master-slave (MS), mutual synchronous (MUS) and hierarchical MS/MUS networks are clearly manifested [1]. Additionally, Theorem 5 shows that each node in the slave group is accessible by at least one node in the master group. This allows one to conclude that the synchronization information available in the master group can be reliably transported to each node in the slave group. Counting and combinatorial arguments are used to develop a recursive algorithm which counts the number An of arbitrarily connected sync network architectures in an N-nodal sync network and the number CN of isolated connecting sync networks in D. Examples for N=2, 3, 4, 5 and 6 are provided. Finally, network examples are presented which illustrate the results offered by the theorems. The notation used and symbol definitions are listed in Appendix A.

Published in:

Communications and Networks, Journal of  (Volume:1 ,  Issue: 2 )