Login | Register

A study of multiloop networks


A study of multiloop networks

Maraachlian, Edward (2006) A study of multiloop networks. Masters thesis, Concordia University.

[thumbnail of MR14329.pdf]
Text (application/pdf)
MR14329.pdf - Accepted Version


Multiloop networks is a family of network topologies which is an extension of the ring topology. In this thesis we study the structural properties of bipartite double loop networks using the plane tessellation technique. We also study the problem of broadcasting in the bipartite double loop networks and in triple loop networks. For the first kind of graphs we find that the broadcast time is d + 2 where d is the diameter of the graph. For the triple loop graphs, we give a d + 5 upper bound on the broadcast time by providing an algorithm that completes broadcasting in at most d + 5 time units. We also find a d + 2 lower bound for the optimal triple loop graphs, these are the graphs with maximum number of nodes given a diameter d . Finally we give an upper bound for the broadcast time of undirected Circulant (also called multiloop) graphs of degree 2 k which is d + 2 k - 1

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Masters)
Authors:Maraachlian, Edward
Pagination:viii, 69 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science and Software Engineering
Thesis Supervisor(s):Harutyunyan, Hovhannes
Identification Number:LE 3 C66C67M 2006 M37
ID Code:8885
Deposited By: Concordia University Library
Deposited On:18 Aug 2011 18:38
Last Modified:13 Jul 2020 20:05
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top