Filters








5,966 Hits in 5.2 sec

An Optimal Inherently Stabilizing 2-Neighborhood Crash Resilient Protocol for Secure and Reliable Routing in Hypercube Networks

M. H. Karaata, O. Sinanoglu, B. AlBdaiwi
2011 Computer journal  
In this paper, we present a simple novel stabilizing and inherently stabilizing algorithm to route messages over all node-disjoint paths of optimal length from one non-faulty process to another in at most  ...  a disjoint path and the distance between any two failed processes/links is at least three.  ...  A stabilizing and inherently stabilizing distributed algorithm for finding node-disjoint paths in star networks [8] and in hypercube networks [9] have been proposed.  ... 
doi:10.1093/comjnl/bxr095 fatcat:ifljvzdavzcrvma3522ydvxkre

Self-stabilizing Byzantine Resilient Topology Discovery and Message Delivery [chapter]

Shlomi Dolev, Omri Liba, Elad M. Schiller
2013 Lecture Notes in Computer Science  
Self-stabilizing algorithms for finding vertex disjoint paths for at most two paths between 1 Section 4 considers cases in which r and the node degree, ∆, are constants.  ...  We propose self-stabilizing Byzantine resilient procedures for finding f + 1 vertex disjoint paths in 2f + 1-connected graphs.  ...  Theorem 8 (Self-stabilization) Let R be a fair execution of Algorithm 1 that starts in an arbitrary configuration and p i ∈ C be a correct node.  ... 
doi:10.1007/978-3-642-40148-0_4 fatcat:bwvujvjg3fd45preod6kcw7w3a

Self-stabilizing Byzantine Resilient Topology Discovery and Message Delivery [chapter]

Shlomi Dolev, Omri Liba, Elad M. Schiller
2013 Lecture Notes in Computer Science  
Self-stabilizing algorithms for finding vertex disjoint paths for at most two paths between 1 Section 4 considers cases in which r and the node degree, ∆, are constants.  ...  We propose self-stabilizing Byzantine resilient procedures for finding f + 1 vertex disjoint paths in 2f + 1-connected graphs.  ...  Theorem 8 (Self-stabilization) Let R be a fair execution of Algorithm 1 that starts in an arbitrary configuration and p i ∈ C be a correct node.  ... 
doi:10.1007/978-3-319-03089-0_27 fatcat:g3xn6htj2rcita35z6etb324im

A Self-stabilizing One-To-Many Node Disjoint Paths Routing Algorithm in Star Networks [chapter]

Rachid Hadid, Vincent Villain
2020 Lecture Notes in Computer Science  
Two paths in a network are said to be node disjoint if they do not share any nodes except for the endpoints. Our proposed algorithm works on n-dimensional star networks Sn.  ...  The purpose of the paper is to present the first self-stabilizing algorithm for finding n−1 one-to-many node-disjoint paths in message passing model.  ...  A new self-stabilizing algorithm for finding two one-to-one node disjoint paths problem in arbitrary network was proposed in [12] .  ... 
doi:10.1007/978-3-030-50323-9_12 fatcat:grnpinnghjg75njmkxyp5xqk6a

An Optimal Inherently Stabilizing Algorithm for Routing over All Node-Disjoint Paths in Exchanged Hypercubes

Thamer Alsulaiman, Mehmet Hakan Karaata
2015 Journal of Advances in Computer Networks  
Two paths between a source node and a destination node in a network are node-disjoint if they do not share any nodes except the end points.  ...  In this paper, we propose a distributed algorithm that is both stabilizing and inherently stabilizing to route messages over all node-disjoint paths in an exchanged hypercube network.  ...  In this paper, we propose a stabilizing and inherently stabilizing algorithm for routing over all node-disjoint paths between any two nodes in an exchanged hypercube.  ... 
doi:10.7763/jacn.2015.v3.138 fatcat:kaoove3oyjfljmpfuzv2ezaque

Fast and Compact Distributed Verification and Self-Stabilization of a DFS Tree [article]

Shay Kutten, Chhaya Trehan
2014 arXiv   pre-print
In contrast, our algorithm has a space complexity of O( n) bits per node, which is optimal for silent-stabilizing spanning trees and runs in O(n) time.  ...  We present algorithms for distributed verification and silent-stabilization of a DFS(Depth First Search) spanning tree of a connected network.  ...  Acknowledgements This research was supported in part by a grant from ISF and Technion TASP center.  ... 
arXiv:1408.0384v2 fatcat:4mr7c6yekjclbc4bivcnxrf54u

Optimization of Disjoints Using WDM-PON in an Optical Network

K. Sasi Kala Rani, A. Renuga Devi, J. Suganthi
2016 Circuits and Systems  
In case of a failure or disjoint Ant Colony Optimization (ACO) algorithm is used to find the optimized shortest path for re-routing.  ...  A polynomial time algorithm Wavelength Division Multiplexing-Passive Optical Networking (WDM-PON) computes disjoints of an optical network and reduces the count of disjoints that occur in the network by  ...  Output: A back-up path for link disjoint Steps 1) Compute the reduced 2-tree a) Find the dislinks occurred in the network b) Isolate the network which has degree more than two c) Update the nodes which  ... 
doi:10.4236/cs.2016.79192 fatcat:smm5izqf5nawrpkvpt3hazysxa

Ant Colony Based Node Disjoint Hybrid Multi-path Routing for Mobile Ad Hoc Network

B. Kalaavathi, K. Duraiswam
2008 Journal of Computer Science  
This research introduces node disjoint multi-path property to AntHocNet routing algorithm.  ...  Multi-path routing represents a promising routing method for mobile ad hoc network. Multi-path routing achieves load balancing and is more resilient to route failures.  ...  It has been found [10] that in moderately dense networks, there may only exist a small number of node disjoint routes between any two arbitrary nodes, especially as the distance between the nodes increases  ... 
doi:10.3844/jcssp.2008.80.86 fatcat:pphrbdm7nnhexalczw3d3bloz4

Multipath QoS Routing for Traffic Splitting in MANETs

Ch. Niranjan Kumar, N. Satyanarayana
2015 Procedia Computer Science  
To overcome these issues, in this paper, we propose a Multipath QoS Routing protocol for traffic splitting in MANET.  ...  In this protocol, initially multiple disjoint paths are discovered and the data packets are transmitted through the path which satisfies the routing constraints based on bandwidth, delay and path stability  ...  Algorithm for Maximum route Disjointness if (no path has been chosen previously) then choose the first shortest path; else {find the shortest node disjoint path; if (not found) then find the shortest link  ... 
doi:10.1016/j.procs.2015.04.115 fatcat:ljgjbwa4zfbftcgexfhaehxu4u

Self-Stabilizing Byzantine Resilient Topology Discovery and Message Delivery [article]

Shlomi Dolev and Omri Liba and Elad M. Schiller
2013 arXiv   pre-print
Traditional Byzantine resilient algorithms use 2f+1 vertex disjoint paths to ensure message delivery in the presence of up to f Byzantine nodes.  ...  Distributed algorithms for topology discovery cope with a never ending task, dealing with frequent changes in the network topology and unpredictable transient faults.  ...  Self-stabilizing algorithms for finding vertex-disjoint paths for at most two paths between any pair of nodes, and for all vertex-disjoint paths in anonymous mesh networks appear in [? ] and in [?  ... 
arXiv:1208.5620v3 fatcat:guhlvyen65b5lnk6a4qyo5hy3q

Price of Stability in Survivable Network Design [chapter]

Elliot Anshelevich, Bugra Caskurlu
2009 Lecture Notes in Computer Science  
In this model, players attempt to connect to a common source node in a network by purchasing edges, and sharing their costs with other players.  ...  For the special case where each node represents a player, we show that Nash equilibria are guaranteed to exist and price of stability is 1, i.e., there always exists a stable solution that is as good as  ...  Though it may not be possible to find node-disjoint connection paths for all players in a feasible network, the following theorem states that there always exists an equivalent graph where each player has  ... 
doi:10.1007/978-3-642-04645-2_19 fatcat:7ruklni7fbbufhhvh3srttmj5m

Price of Stability in Survivable Network Design

Elliot Anshelevich, Bugra Caskurlu
2011 Theory of Computing Systems  
In this model, players attempt to connect to a common source node in a network by purchasing edges, and sharing their costs with other players.  ...  For the special case where each node represents a player, we show that Nash equilibria are guaranteed to exist and price of stability is 1, i.e., there always exists a stable solution that is as good as  ...  Though it may not be possible to find node-disjoint connection paths for all players in a feasible network, the following theorem states that there always exists an equivalent graph where each player has  ... 
doi:10.1007/s00224-011-9317-8 fatcat:wbwztgyrlfad7d7i4p55irir4q

Data Transmission Over Networks for Estimation and Control

V. Gupta, A.F. Dana, J.P. Hespanha, R.M. Murray, B. Hassibi
2009 IEEE Transactions on Automatic Control  
The algorithm is optimal for any packet-dropping process and at every time step, even though it is recursive and hence requires a constant amount of memory, processing and transmission at every node in  ...  We then determine the optimal information processing strategy that should be followed by each node in the network so that the estimator is able to compute the best possible estimate in the minimum mean  ...  For this we consider another algorithm in which we assume that estimates on the disjoint paths in are routed separately.  ... 
doi:10.1109/tac.2009.2024567 fatcat:uhle2qpemffhzebidyuwvrdvzm

Utility-Aware Enhanced Reliable Opportunistic Routing Protocol for Mobile Adhoc Networks

2019 International journal of recent technology and engineering  
As a result, an allocation of unbalanced traffic among nodes may increase the power dissipation in the overloaded nodes and path failures that degrade the network lifetime.  ...  Usually, the nodes in Mobile Adhoc Networks (MANET) are bounded with the limited power resources to interact with each other nodes without any backbone infrastructures.  ...  This protocol utilizes a new cost function for finding a multiple node-disjoint power and load aware optimal routes to their destinations that extends the operational life of nodes and maximizes the network  ... 
doi:10.35940/ijrte.b3322.078219 fatcat:hwxfscnvirbk3dzhdyuu2lpfni

A New Efficient Multi-path Routing Protocol for Mobile Ad hoc Networks

Phu Hung Le
2017 IJARCCE  
In node-disjoint multi-path when nodes in a path move, they do not affect the other paths.  ...  However, in a quite sparse network, node-disjoint multi-paths are difficult to be established. In contrary, Link-disjoint multi-path can be formed in a dense and quite sparse network.  ...  The weight of each arc is the interference level of the corresponding link. 3)Algorithm of link-disjoint multi-path To build the link-disjoint multi-path algorithm for OLSR, we perform the following  ... 
doi:10.17148/ijarcce.2017.6454 fatcat:pxp6f4gesvhv5g2uyshv5nmu5y
« Previous Showing results 1 — 15 out of 5,966 results