Author:
Mathew Jasmine,Rejikumar K
Abstract
Abstract
Communication networks are modelled using graph structures. The efficiency of a network can be determined using the parameters of the graph model. The article reviews the modelling of various communication networks, their graph parameters, classical topologies and their available properties.
If the communication is in one direction, the model is known as simplex model. Its graphical representation requires directed graphs, a kind of generalized graphs. The large networks become complicated for analysis because of having large parametric values. To overcome this difficulty more generalized graphs called hypergraphs are required.
Subject
General Physics and Astronomy
Reference41 articles.
1. Messy broadcasting in networks;Ahlswede,1994
2. Large fault talerant interconnection networks;Bermond;Graphs and Combinatorics,1989
3. Broadcast time in Communication Networks;Farely;SIAM J Appl Math,1983
4. A survey on Knodel graphs;Fertin;Discrete Appl Math,2004
5. Walter Knodel, New Gossips and Telephones;Knodel;Discrete Math,1975