Weighted Independent Directed Acyclic Graphs for Resilient and Efficient Multipath Routing

2013 ◽  
Vol 3 (3) ◽  
pp. 1
Author(s):  
M. Ramakrishnan ◽  
Sowmya Swaminathan ◽  
Jayaganesan Chandresekaran
Keyword(s):  
Multipath Routing ◽  
Directed Acyclic Graphs ◽  
Acyclic Graphs

Independent Directed Acyclic Graphs for Resilient Multipath Routing

2012 ◽  
Vol 20 (1) ◽  
pp. 153-162 ◽  
Author(s):  
Sangman Cho ◽  
Theodore Elhourani ◽  
Srinivasan Ramasubramanian
Keyword(s):  
Multipath Routing ◽  
Directed Acyclic Graphs ◽  
Acyclic Graphs

scholarly journals Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing

2014 ◽  
Vol 2014 ◽  
pp. 1-11
Author(s):  
Katarzyna Kalinowska-Górska ◽  
Fernando Solano Donado
Keyword(s):  
Optimization Algorithm ◽  
Multipath Routing ◽  
Directed Acyclic Graphs ◽  
Significant Issue ◽  
Equitable Distribution ◽  
Acyclic Graphs ◽  
Routing Methods ◽  
Single Path

Extensive research in the field of telecommunications has been done on the techniques of multipath routing, as they offer many advantages over conventional single-path routing methods. Some of these techniques make use of the so-called Destination-Oriented Directed Acyclic Graphs (DODAGs) which are constructed on the networks, usually in a distributed way. However, while defining methods of forming DODAGs, the authors of multipath algorithms tend to overlook a possibly significant issue which could, in a way, define the quality of a given DODAG in the context of multipath routing, namely, providing an equitable distribution of the paths between the nodes in the newly created DODAG. In this paper, a few requirements for constructing a “fair” DODAG are identified in the context of multipath routing. An optimization algorithm that tries to find an equitable solution according to these requirements is also presented. Three DODAG-creation algorithms that appear in the literature are simulated and compared against this equitable solution, and none of them is getting close to it in terms of fairness in the distribution of the paths. Moreover, two interesting properties of equitable solutions are revealed in the simulations.

A Nettree for Simple Paths with Length Constraint and the Longest Path in Directed Acyclic Graphs

2012 ◽  
Vol 35 (10) ◽  
pp. 2194 ◽  
Author(s):  
Yan LI ◽  
Le SUN ◽  
Huai-Zhong ZHU ◽  
You-Xi WU
Keyword(s):  
Directed Acyclic Graphs ◽  
Length Constraint ◽  
Acyclic Graphs ◽  
Longest Path ◽  
Simple Paths

scholarly journals Directed acyclic graphs: An under-utilized tool for child maltreatment research

2019 ◽  
Vol 91 ◽  
pp. 78-87 ◽  
Author(s):  
Anna E. Austin ◽  
Tania A. Desrosiers ◽  
Meghan E. Shanahan
Keyword(s):  
Child Maltreatment ◽  
Directed Acyclic Graphs ◽  
Acyclic Graphs

scholarly journals On directed analogues of expander and hyperfinite graph sequences

2021 ◽  
pp. 1-14
Author(s):  
Endre Csóka ◽  
Łukasz Grabowski
Keyword(s):  
Directed Acyclic Graphs ◽  
Acyclic Graphs ◽  
Probabilistic Construction

Abstract We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call ‘extender’ and ‘hypershallow’ graph sequences, respectively. Our main result is a probabilistic construction of non-hypershallow graph sequences.

Efficient coding of labeled directed acyclic graphs

2003 ◽  
Vol 7 (5) ◽  
pp. 350-356 ◽  
Author(s):  
B. Steinsky
Keyword(s):  
Directed Acyclic Graphs ◽  
Efficient Coding ◽  
Acyclic Graphs
Sign in / Sign up

Export Citation Format

Share Document