Filters








1,630 Hits in 6.9 sec

Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree [chapter]

Paola Flocchini, Antonio Mesa Enriques, Linda Pagli, Giuseppe Prencipe, Nicola Santoro
IFIP International Federation for Information Processing  
We consider the problem of computing the optimal swap edges of a shortest-path tree.  ...  We present two simple and efficient distributed algorithms for computing the optimal swap edges of a shortest-path tree.  ...  Acknowledgments Part of this work was carried out while the the first and last authors were visited by the others at the University of Ottawa and at Carleton University.  ... 
doi:10.1007/1-4020-8141-3_14 dblp:conf/ifipTCS/FlocchiniEPPS04 fatcat:nt2czyv4v5gqlp2i7necdbyeby

Distributed Computation for Swapping a Failing Edge [chapter]

Linda Pagli, Giuseppe Prencipe, Tranos Zuva
2004 Lecture Notes in Computer Science  
We consider the problem of computing the best swap edges of a shortest-path tree Tr rooted in r.  ...  A distributed protocol exists only for finding swap edges, not necessarily optimal ones.  ...  This approach does not compute the new shortest path tree, but the selection of the swap edge is done according to some optimization criteria and allows, with a single global computation, to know in advance  ... 
doi:10.1007/978-3-540-30536-1_4 fatcat:a4u4tmcggncm3i4cigwzwhldjm

Page 7827 of Mathematical Reviews Vol. , Issue 2003j [page]

2003 Mathematical Reviews  
“In this paper we present efficient algorithms for the problem of finding a best swap edge, for each edge e of S(r), with respect to several objectives.  ...  Enrico (I-LAQL-I; L’Aquila) ; Proietti, Guido (I-LAQL-I; L’Aquila) ; Widmayer, Peter (CH-ETHZ-TI; Ziirich) Swapping a failing edge of a single source shortest paths tree is good and fast.  ... 

Computing all the best swap edges distributively

P. Flocchini, L. Pagli, G. Prencipe, N. Santoro, P. Widmayer
2008 Journal of Parallel and Distributed Computing  
In this paper we present protocols, based on a new strategy, that allow the efficient distributed computation of all the optimal swap edges under several optimization criteria.  ...  Recently great attention has been given to point-of-failure swap rerouting, an efficient technique for routing in presence of transient failures.  ...  In other words, the open question is whether or not Ω(n * ) is a lower bound on the number of data items that must be transferred. *******AGGIUNGERE ALCUNE REF A PAPER PIU' APPLICATIVI******  ... 
doi:10.1016/j.jpdc.2008.03.002 fatcat:esvgikbk5rb2xp7xc6vkggv5dy

Computing All the Best Swap Edges Distributively [chapter]

P. Flocchini, L. Pagli, G. Prencipe, N. Santoro, P. Widmayer, T. Zuva
2005 Lecture Notes in Computer Science  
In this paper we present protocols, based on a new strategy, that allow the efficient distributed computation of all the optimal swap edges under several optimization criteria.  ...  Recently great attention has been given to point-of-failure swap rerouting, an efficient technique for routing in presence of transient failures.  ...  In other words, the open question is whether or not Ω(n * ) is a lower bound on the number of data items that must be transferred. *******AGGIUNGERE ALCUNE REF A PAPER PIU' APPLICATIVI******  ... 
doi:10.1007/11516798_11 fatcat:kkgbc37ij5gqpj3afrokqibky4

Effective Edge-Fault-Tolerant Single-Source Spanners via Best (or Good) Swap Edges [chapter]

Davide Bilò, Feliciano Colella, Luciano Gualà, Stefano Leucci, Guido Proietti
2017 Lecture Notes in Computer Science  
Then, an all best swap edges (ABSE) problem is that of finding efficiently (in term of time complexity) a best swap edge for each tree edge.  ...  In such a framework, a key role has been played by the Shortest-Path Tree (SPT) structure, which is commonly used for implementing efficiently the broadcasting communication primitive.  ...  Computing all best swap edges (ABSE) of a spanning tree T of a given n-vertex and m-edge undirected and weighted graph G means to select, for each edge e of T , a corresponding non-tree edge f , in such  ... 
doi:10.1007/978-3-319-72050-0_18 fatcat:s4twvvdwn5fszpwwlqwbo3sqxu

Software Defined Mobile Multicast

Shunyi Xu, Chuan Wu, Zongpeng Li
2015 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems  
The algorithms are proven to achieve a constant competitive ratio against the offline optimal Steiner tree, with an amortized constant number of edge swaps per adjustment.  ...  Shortest path trees represent the status quo of multicast topology in real-world systems.  ...  Shortest path trees represent the status quo of multicast topology in real-world systems.  ... 
doi:10.1109/mass.2015.87 dblp:conf/mass/XuWL15 fatcat:m33pti7w2jg6lenpaduwoa7vti

Efficient Quantum Network Communication using Optimized Entanglement-Swapping Trees

Mohammad Ghaderibaneh, Caitao Zhan, Himanshu Gupta, C. R. Ramakrishnan
2022 IEEE Transactions on Quantum Engineering  
For the general setting, we develop an efficient iterative algorithm to compute a set of swapping trees.  ...  We develop a dynamic programming algorithm to select an optimal swapping tree for a single pair of nodes, under the given capacity and fidelity constraints.  ...  Now, to compute the optimal path for each path length, we can use a simple DP approach that run in O(mτ l ) time, where m is the number of edges and τ l is the constraint on the number of leaves.  ... 
doi:10.1109/tqe.2022.3168784 fatcat:rwgkz6qd3bd5tflsxdhhztmwau

Efficient Quantum Network Communication using Optimized Entanglement-Swapping Trees [article]

Mohammad Ghaderibaneh, Caitao Zhan, Himanshu Gupta, C.R. Ramakrishnan
2021 arXiv   pre-print
For the general setting, we develop an efficient iterative algorithm to compute a set of swapping trees.  ...  We develop a dynamic programming algorithm to select an optimal swapping-tree for a single pair of nodes, under the given capacity and fidelity constraints.  ...  Now, to compute the optimal path for each path-length, we can use a simple dynamic programming approach that run in O(mτ l ) time where m is the number of edges and τ l is the constraint on number of leaves  ... 
arXiv:2112.11002v1 fatcat:ossaqrfn3vdldh27wnwdcfuns4

Pre-Distribution of Entanglements in Quantum Networks [article]

Mohammad Ghaderibaneh, Himanshu Gupta, C.R. Ramakrishnan, Ertai Luo
2022 arXiv   pre-print
In this paper, we appropriately formulate the above optimization problem and design two efficient algorithms, one of which is a greedy approach based on an approximation algorithm for a special case.  ...  To reduce EP generation latency, prior works have looked at selection of efficient entanglement-routing paths and simultaneous use of multiple such paths for EP generation.  ...  As mentioned before, for a given SL (and a corresponding path), we compute the optimal swapping-tree using techniques in [20] .  ... 
arXiv:2205.04036v1 fatcat:r6r5hp7jxnarrdo5lt3mfjvc3i

Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures [chapter]

Enrico Nardelli, Guido Proietti, Peter Widmayer
1998 Lecture Notes in Computer Science  
As a natural extension, the allbest-swaps (ABS) problem is the problem of finding a best swap for every edge of the MDST.  ...  When a transient edge failure occurs, it is important to choose a temporary replacement edge which minimizes the diameter of a new spanning tree. Such an optimal replacement is called a best swap.  ...  Acknowledgments The authors would like to thank Dagmar Handke for asking the question treated in Section 4, and the referees for the suggestions that helped to improve the presentation of the paper.  ... 
doi:10.1007/3-540-68530-8_5 fatcat:gb4i2dglcrg6fmqav5fkc2zvtu

Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures

Enrico Nardelli, Guido Proietti, Peter Widmayer
2001 Journal of Graph Algorithms and Applications  
As a natural extension, the allbest-swaps (ABS) problem is the problem of finding a best swap for every edge of the MDST.  ...  When a transient edge failure occurs, it is important to choose a temporary replacement edge which minimizes the diameter of a new spanning tree. Such an optimal replacement is called a best swap.  ...  Acknowledgments The authors would like to thank Dagmar Handke for asking the question treated in Section 4, and the referees for the suggestions that helped to improve the presentation of the paper.  ... 
doi:10.7155/jgaa.00039 fatcat:lj5vawnezfar3pj3gxv2mng6wy

Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures [chapter]

Enrico Nardelli, Guido Proietti, Peter Widmayer
2004 Graph Algorithms and Applications 2  
As a natural extension, the allbest-swaps (ABS) problem is the problem of finding a best swap for every edge of the MDST.  ...  When a transient edge failure occurs, it is important to choose a temporary replacement edge which minimizes the diameter of a new spanning tree. Such an optimal replacement is called a best swap.  ...  Acknowledgments The authors would like to thank Dagmar Handke for asking the question treated in Section 4, and the referees for the suggestions that helped to improve the presentation of the paper.  ... 
doi:10.1142/9789812794741_0020 fatcat:gzxqadmpnbc2teyb7tbflwy4ja

Multiple Constraints for Ant Based Multicast Routing in Mobile Ad Hoc Networks

A. Sabari, K. Duraiswamy
2009 Journal of Computer Science  
Problem statement: A Mobile Ad hoc Network (MANET) is one of the challenging environments for multicast.  ...  The main disadvantage of this approach is the need of a predefined upper bound that can isolate good trees from the final solution.  ...  Algorithm for constraint based tree construction: Form the cluster V i with cluster member v i and maximum out-degree N by optimizing the shortest path tree and such that each node has a parent closer  ... 
doi:10.3844/jcssp.2009.1020.1027 fatcat:w72yr4trtzgzflvlzkc4ygvyba

QuNet: Cost vector analysis multi-path entanglement routing in quantum networks [article]

Hudson Leone, Nathaniel R. Miller, Deepesh Singh, Nathan K. Langford, Peter P. Rohde
2021 arXiv   pre-print
We outline the differences that arise because of this, demonstrate some elementary formalisms for 'multi-path entanglement routing', and discuss the philosophical differences that arise when comparing  ...  The act of purifying multiple noisy entangled states into a single one of higher quality has no analogue in classical networking and as such, this transforms the way in which we will consider future algorithms  ...  Specifi- any shortest-path algorithm over those weights to find cally, our channels are weighted with vectors of additive the optimal solution.  ... 
arXiv:2105.00418v2 fatcat:l36jad5t4zfdtlt657gcayl62q
« Previous Showing results 1 — 15 out of 1,630 results