A distributed depth first search based algorithm for edge connectivity estimation

Basit Öğe Kaydı
dc.authorscopusid55335002500
dc.authorscopusid55750051600
dc.authorscopusid57221264335
dc.contributor.authorUğurlu, Onur
dc.contributor.authorAkram, Vahid Khalilpour
dc.contributor.authorEliiyi, Deniz Türsel
dc.date.accessioned2022-02-15T16:58:51Z
dc.date.available2022-02-15T16:58:51Z
dc.date.issued2020
dc.departmentBakırçay Üniversitesien_US
dc.description16th International Conference on Network and Service Management (CNSM) / 2nd International Workshop on Analytics for Service and Application Management (AnServApp) / 1st International Workshop on the Future Evolution of Internet Protocols (IPFuture) -- NOV 02-06, 2020 -- ELECTR NETWORKen_US
dc.description.abstractThe edge connectivity of a network is the minimum number of edges whose removal disconnect the network. The edge connectivity determines the minimum number of edge-disjoint paths between all nodes. Hence finding the edge connectivity can reveal useful information about reliability, alternative paths and bottlenecks. In this paper, we propose a cost-effective distributed algorithm that finds a lower bound for the edge connectivity of a network via finding at most c depth-first-search trees, where c is the edge connectivity. The proposed algorithm is asynchronous and does not need any synchronization between the nodes. In the proposed algorithm, the root node starts a distributed depth-first-search algorithm, and the nodes select next node in the tree based on their available edges to maximize the total number of established trees. The simulation results show that the proposed algorithm finds the edge connectivity with an average of 48% accuracy ratio.en_US
dc.description.sponsorshipIFIP, IEEE, FutureWei Technologies, IEEE Commun Soc, Dalhousie Univen_US
dc.identifier.isbn978-3-903176-31-7
dc.identifier.issn2165-9605
dc.identifier.scopus2-s2.0-85098641308en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.urihttps://hdl.handle.net/20.500.14034/476
dc.identifier.urihttps://doi.org/10.23919/CNSM50824.2020.9269062
dc.identifier.wosWOS:000612229200025en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.relation.journal2020 16Th International Conference On Network And Service Management (Cnsm)en_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectDistributed Algorithmsen_US
dc.subjectEdge Connectivityen_US
dc.subjectDepth First Searchen_US
dc.subjectSpanning Treeen_US
dc.subjectK-Connectivityen_US
dc.subjectMinimum Cuten_US
dc.titleA distributed depth first search based algorithm for edge connectivity estimationen_US
dc.typeConference Objecten_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
A Distributed Depth First Search based Algorithm for Edge Connectivity Estimation.pdf
Boyut:
921.73 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
İndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Endüstri Mühendisliği Bölümü Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu
Temel Bilimler Bölümü Bölümü Koleksiyonu