An Algorithm for Distributed Connectivity Decomposition and its Applications in Information Dissemination, M.Sc. Thesis Sharif University of Technology ; Izadi, Mohammad (Supervisor) ; Kavousi, Kaveh (Co-Advisor)
Abstract
The fundamental goal of communication networks is to transfer messages across the network between the nodes. Often, maximizing the information flow which is limited by connectivity of the network could be interesting. The concept of connectivity is divided into edge and vertex connectivity. If our focus were on the vertex-connectivity, connected dominating sets (CDS) could be a valuable tool. Obtaining (fractionally) vertex-disjoint connected dominating sets which are called fractional CDS packing presents a backbone to get an information flow matching the size of connectivity. In this thesis, we will present a distributed algorithm that is given a communication network with n nodes and...
Cataloging briefAn Algorithm for Distributed Connectivity Decomposition and its Applications in Information Dissemination, M.Sc. Thesis Sharif University of Technology ; Izadi, Mohammad (Supervisor) ; Kavousi, Kaveh (Co-Advisor)
Abstract
The fundamental goal of communication networks is to transfer messages across the network between the nodes. Often, maximizing the information flow which is limited by connectivity of the network could be interesting. The concept of connectivity is divided into edge and vertex connectivity. If our focus were on the vertex-connectivity, connected dominating sets (CDS) could be a valuable tool. Obtaining (fractionally) vertex-disjoint connected dominating sets which are called fractional CDS packing presents a backbone to get an information flow matching the size of connectivity. In this thesis, we will present a distributed algorithm that is given a communication network with n nodes and...
Find in contentBookmark |
|