CitedEvidence
User Settings
Open AccessDissertation

Problems related to broadcasting in graphs

Hayk Grigoryan-2013-09-06-Spectrum Research Repository (Concordia University)

TL;DRAbstract

The data transmission delays become the bottleneck on modern high speed interconnection networks utilized by high performance computing or enterprise data centers. This motivates the study directed towards finding more efficient interconnection topologies as well as more efficient algorithms for information exchange between the nodes of the given network. 
\n
\nBroadcasting is the process of distributing a message 
\nfrom a node, called the originator, to all other nodes of a communication network. Broadcasting is used as a basic communication primitive by many higher level network operations, which involve a set of nodes in distributed systems. Therefore, it is one the most important operations, which can determine the total efficiency of a given distributed system. 
\n 
\n We study interconnection networks via modeling them as graphs. The results described in this work can be used for efficient message routing algorithms in switch based interconnection networks as

Chat with Paper

AI Agents for this Paper

The data transmission delays become the bottleneck on modern high speed interconnection networks utilized by high performance computing or enterprise data centers. This motivates the study directed towards finding more efficient interconnection topologies as well as more efficient algorithms for information exchange between the nodes of the given network. 
\n
\nBroadcasting is the process of distributing a message 
\nfrom a node, called the originator, to all other nodes of a communication network. Broadcasting is used as a basic communication primitive by many higher level network operations, which involve a set of nodes in distributed systems. Therefore, it is one the most important operations, which can determine the total efficiency of a given distributed system. 
\n 
\n We study interconnection networks via modeling them as graphs. The results described in this work can be used for efficient message routing algorithms in switch based interconnection networks as

Keywords

Computer scienceBroadcasting (networking)InterconnectionNetwork topologyComputer networkDistributed computingBottleneckBroadcast communication network

Chat

Click to start Chat