Call for Papers:Vol.11 Issue.6

Submission
Last date		 28-Dec-2025
Acceptance Status In One Day
Paper Publish In Two Days
Submit ManuScript

News & Updates

Submit Article

Dear Authors, Article publish in our journal for Volume-11,Issue-6. For article submission on below link: Submit Manuscript


Join As Board

Dear Reviewer, You can join our Reviewer team without given any charges in our journal. Submit Details on below link: Join As Board


Paper Publication Charges

IJARIIE APP
Download Android App

For Authors

Archives

IJARIIE Board

Downloads

Android App

Download IJARIIE APP

Authors

Title: :  A Distributed Algorithm for Finding All Best Swap Edges Of a Minimum Diameter Spanning Tree*
PaperId: :  2973
Published in:   International Journal Of Advance Research And Innovative Ideas In Education
Publisher:   IJARIIE
e-ISSN:   2395-4396
Volume/Issue:    Volume 2 Issue 4 2016
DUI:    16.0415/IJARIIE-2973
Licence: :   IJARIIE is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Author NameAuthor Institute
MR. DIPAK GOVARDHAN BHUSARIADITYA ENGINEERING COLLEGE, BEED
Mr. Prasad Ramkrishna KulkarniAditya polytechnic college Beed.

Abstract

COMPUTER SCIENCE AND ENGINEERING
MIST
Communication in networks suffers if a link fails. When the links are edge of a tree that has been chosen from an underlying graph of all possible links, a broken link even disconnect the network. Most often, the link is restored quickly. A good policy to deal with this sort of transient link failures is swap rerouting s, where the temporarily broken link is replaced by a single swap link from the underlying graphs. A rapid replacement of a broken link by a swap link is only possible if all swap links have been precomputed. Then the selection of high quality swap links is essential; it must follow the same objective as the originally chosen communication subnetwork. We are interested in a minimum diameter tree in a graph with edge weights (so as to minimize the maximum travel time of messages). Hence, each swap link must minimize (among all possible swaps) the diameter of the tree that results from swapping. We advice a distributed algorithm that efficiently computes all of these swap links and we explain, how to route message across swap edges with a compact routing scheme. lastly, we consider the computation of swap edges in an arbitrary spanning tree, where swap edges are chosen to reduce the time required to adapt routing in case of a failures, and give efficient distributed algorithms for two variants of this problem.

Citations

Copy and paste a formatted citation or use one of the links to import into a bibliography manager and reference.

IJARIIE MR. DIPAK GOVARDHAN BHUSARI, and Mr. Prasad Ramkrishna Kulkarni. "A Distributed Algorithm for Finding All Best Swap Edges Of a Minimum Diameter Spanning Tree*" International Journal Of Advance Research And Innovative Ideas In Education Volume 2 Issue 4 2016 Page 922-927
MLA MR. DIPAK GOVARDHAN BHUSARI, and Mr. Prasad Ramkrishna Kulkarni. "A Distributed Algorithm for Finding All Best Swap Edges Of a Minimum Diameter Spanning Tree*." International Journal Of Advance Research And Innovative Ideas In Education 2.4(2016) : 922-927.
APA MR. DIPAK GOVARDHAN BHUSARI, & Mr. Prasad Ramkrishna Kulkarni. (2016). A Distributed Algorithm for Finding All Best Swap Edges Of a Minimum Diameter Spanning Tree*. International Journal Of Advance Research And Innovative Ideas In Education, 2(4), 922-927.
Chicago MR. DIPAK GOVARDHAN BHUSARI, and Mr. Prasad Ramkrishna Kulkarni. "A Distributed Algorithm for Finding All Best Swap Edges Of a Minimum Diameter Spanning Tree*." International Journal Of Advance Research And Innovative Ideas In Education 2, no. 4 (2016) : 922-927.
Oxford MR. DIPAK GOVARDHAN BHUSARI, and Mr. Prasad Ramkrishna Kulkarni. 'A Distributed Algorithm for Finding All Best Swap Edges Of a Minimum Diameter Spanning Tree*', International Journal Of Advance Research And Innovative Ideas In Education, vol. 2, no. 4, 2016, p. 922-927. Available from IJARIIE, https://ijariie.com/AdminUploadPdf/A_Distributed_Algorithm_for_Finding_All_Best_Swap_Edges_Of_a_Minimum_Diameter_Spanning_Tree__ijariie2973.pdf (Accessed : 12 January 2017).
Harvard MR. DIPAK GOVARDHAN BHUSARI, and Mr. Prasad Ramkrishna Kulkarni. (2016) 'A Distributed Algorithm for Finding All Best Swap Edges Of a Minimum Diameter Spanning Tree*', International Journal Of Advance Research And Innovative Ideas In Education, 2(4), pp. 922-927IJARIIE [Online]. Available at: https://ijariie.com/AdminUploadPdf/A_Distributed_Algorithm_for_Finding_All_Best_Swap_Edges_Of_a_Minimum_Diameter_Spanning_Tree__ijariie2973.pdf (Accessed : 12 January 2017)
IEEE MR. DIPAK GOVARDHAN BHUSARI, and Mr. Prasad Ramkrishna Kulkarni, "A Distributed Algorithm for Finding All Best Swap Edges Of a Minimum Diameter Spanning Tree*," International Journal Of Advance Research And Innovative Ideas In Education, vol. 2, no. 4, pp. 922-927, Jul-Aug 2016. [Online]. Available: https://ijariie.com/AdminUploadPdf/A_Distributed_Algorithm_for_Finding_All_Best_Swap_Edges_Of_a_Minimum_Diameter_Spanning_Tree__ijariie2973.pdf [Accessed : 12 January 2017].
Turabian MR. DIPAK GOVARDHAN BHUSARI, and Mr. Prasad Ramkrishna Kulkarni. "A Distributed Algorithm for Finding All Best Swap Edges Of a Minimum Diameter Spanning Tree*." International Journal Of Advance Research And Innovative Ideas In Education [Online]. volume 2 number 4 (12 January 2017).
Vancouver MR. DIPAK GOVARDHAN BHUSARI, and Mr. Prasad Ramkrishna Kulkarni. A Distributed Algorithm for Finding All Best Swap Edges Of a Minimum Diameter Spanning Tree*. International Journal Of Advance Research And Innovative Ideas In Education [Internet]. 2016 [Cited : 12 January 2017]; 2(4) : 922-927. Available from: https://ijariie.com/AdminUploadPdf/A_Distributed_Algorithm_for_Finding_All_Best_Swap_Edges_Of_a_Minimum_Diameter_Spanning_Tree__ijariie2973.pdf
BibTex EndNote RefMan RefWorks

Number Of Downloads


Last download on 1/12/2017 11:20:06 AM

Save in Google Drive

Similar-Paper

TitleArea of ResearchAuther NameAction
SHADOW THE WEB BROWSERComputer Science and EngineeringLakshmi Narayan S Download
SECUHIRE – AI-POWERED INTERVIEW DETECTION SYSTEMComputer Engineering Tharun R Download
Early Detection Of Electrical Fault Line Using Artificial IntelligenceElectrical Engineering , Computer Science , Artificial IntelligenceRakshitha R Download
Real Time Object Detection Tracking using YOLO and Deep SORTInformation science and engineeringNandan M R Download
An AI-Integrated Intelligent Health Advisory System with Machine-Learning-Based Ayurvedic Formulation RecommendationInformation Science EngineeringSrinidhi G Download
Blockchain-Based Decentralized Medical Health Management System using Smart Contracts and IPFS Information Science and EngineeringVarun V Download
Precision Agriculture Using Machine Learning and IOTComputer Science and EngineeringRamesh B E Download
A Secure Blockchain Based Voting SystemComputer Science and EngineeringSagar K R Download
Chatbot based helpdesk for Government employee and departmentsComputer science & Engineering(Cyber Security Engineerting)Dr. Shanthi S Download
Zero Trust ArchitectureComputer EngineeringAditya Yanna Download
Intelligent IoT Security Monitoring: Enhancing Optimum-Path Forest Classifiers with Fuzzy Logic:A Comprehensive ReviewComputer science and engineeringK Vijay kumar Download
Towards Efficient Resource Allocation and Request Scheduling in Quantum NetworksComputer Engineering Prajna Download
NEURAL NETWORK APPROACHES FOR DDOS ATTACK EFFECT ASSESSMENT: A SYSTEMATIC REVIEWComputer EngineeringAniketh Download
SMART TRAFFIC MANAGEMENT AND CONTROL SYSTEM BASED ON IOTComputer Science EngineeringPriyanka K Download
VOICE COMMAND CALCULATORInformation Science and EngineeringS M Rachana Download
12