Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing
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...
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Hindawi Limited
2014-01-01
|
| Schriftenreihe: | Journal of Applied Mathematics |
| Online Zugang: | http://dx.doi.org/10.1155/2014/948521 |
| _version_ | 1827083520896401408 |
|---|---|
| author | Katarzyna Kalinowska-Górska Fernando Solano Donado |
| author_facet | Katarzyna Kalinowska-Górska Fernando Solano Donado |
| author_sort | Katarzyna Kalinowska-Górska |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2025-03-20T03:50:27Z |
| format | Article |
| id | doaj.art-a5ffc44be5e941fe98fc1036b3c7a200 |
| institution | Directory Open Access Journal |
| issn | 1110-757X 1687-0042 |
| language | English |
| last_indexed | 2025-03-20T03:50:27Z |
| publishDate | 2014-01-01 |
| publisher | Hindawi Limited |
| record_format | Article |
| series | Journal of Applied Mathematics |
| spelling | doaj.art-a5ffc44be5e941fe98fc1036b3c7a2002024-10-03T05:57:34ZengHindawi LimitedJournal of Applied Mathematics1110-757X1687-00422014-01-01201410.1155/2014/948521948521Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath RoutingKatarzyna Kalinowska-Górska0Fernando Solano Donado1Faculty of Electronics and Information Technology, Warsaw University of Technology, ul. Nowowiejska 15/19, 00-665 Warsaw, PolandFaculty of Electronics and Information Technology, Warsaw University of Technology, ul. Nowowiejska 15/19, 00-665 Warsaw, PolandExtensive 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.http://dx.doi.org/10.1155/2014/948521 |
| spellingShingle | Katarzyna Kalinowska-Górska Fernando Solano Donado Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing Journal of Applied Mathematics |
| title | Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing |
| title_full | Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing |
| title_fullStr | Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing |
| title_full_unstemmed | Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing |
| title_short | Constructing Fair Destination-Oriented Directed Acyclic Graphs for Multipath Routing |
| title_sort | constructing fair destination oriented directed acyclic graphs for multipath routing |
| url | http://dx.doi.org/10.1155/2014/948521 |
| work_keys_str_mv | AT katarzynakalinowskagorska constructingfairdestinationorienteddirectedacyclicgraphsformultipathrouting AT fernandosolanodonado constructingfairdestinationorienteddirectedacyclicgraphsformultipathrouting |