A Highly Parallelizable Algorithm for Routing With Automatic Tunneling
Most current routing protocols are based on path computation algorithms in graphs (e.g., Dijkstra, Bellman-Ford, etc.). These algorithms have been studied for a long time and are very well understood, both in a centralized and distributed context, as long as they are applied to a network having a si...
Gespeichert in:
| Veröffentlicht in: | IFIP Networking Conference S. 1 - 9 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IFIP
13.06.2022
|
| Schlagworte: | |
| ISSN: | 1861-2288 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Most current routing protocols are based on path computation algorithms in graphs (e.g., Dijkstra, Bellman-Ford, etc.). These algorithms have been studied for a long time and are very well understood, both in a centralized and distributed context, as long as they are applied to a network having a single communication protocol. The problem becomes more complex in the multi-protocol case, where there is a possibility of encapsulation of some network protocols into others, therefore inducing nested tunnels. The classic algorithms cited above no longer work in this case because they cannot manage the protocol encapsulations and the corresponding protocol stacks. In this work, we propose a highly parallelizable algorithm that takes into account protocol encapsulations as well as protocol conversions in order to compute shortest paths in a multi-protocol network. To achieve this computation efficiently, we study the transitive closure between sub-paths (i.e., the concatenation of two sub-paths to obtain a longer one) in the case where each sub-path induces a protocol stack, and thus tunnels. Leveraging on Software-Defined Networks with a controller having a highly parallel architecture enables us to compute the routing tables of all nodes in a very efficient way. Experimentation results on both random and realistic topologies show that our algorithm outperforms the previous solutions proposed in the literature. |
|---|---|
| AbstractList | Most current routing protocols are based on path computation algorithms in graphs (e.g., Dijkstra, Bellman-Ford, etc.). These algorithms have been studied for a long time and are very well understood, both in a centralized and distributed context, as long as they are applied to a network having a single communication protocol. The problem becomes more complex in the multi-protocol case, where there is a possibility of encapsulation of some network protocols into others, therefore inducing nested tunnels. The classic algorithms cited above no longer work in this case because they cannot manage the protocol encapsulations and the corresponding protocol stacks. In this work, we propose a highly parallelizable algorithm that takes into account protocol encapsulations as well as protocol conversions in order to compute shortest paths in a multi-protocol network. To achieve this computation efficiently, we study the transitive closure between sub-paths (i.e., the concatenation of two sub-paths to obtain a longer one) in the case where each sub-path induces a protocol stack, and thus tunnels. Leveraging on Software-Defined Networks with a controller having a highly parallel architecture enables us to compute the routing tables of all nodes in a very efficient way. Experimentation results on both random and realistic topologies show that our algorithm outperforms the previous solutions proposed in the literature. |
| Author | Magoni, Damien Mouhoub, Noureddine Lamali, Mohamed Lamine |
| Author_xml | – sequence: 1 givenname: Noureddine surname: Mouhoub fullname: Mouhoub, Noureddine email: noureddine.mouhoub@u-bordeaux.fr organization: Université de Bordeaux,LaBRI - CNRS,Talence,France – sequence: 2 givenname: Mohamed Lamine surname: Lamali fullname: Lamali, Mohamed Lamine email: mohamed-lamine.lamali@u-bordeaux.fr organization: Université de Bordeaux,LaBRI - CNRS,Talence,France – sequence: 3 givenname: Damien surname: Magoni fullname: Magoni, Damien email: damien.magoni@u-bordeaux.fr organization: Université de Bordeaux,LaBRI - CNRS,Talence,France |
| BookMark | eNotj8FLwzAYxaMoOOf-Ai-5euhMviRtcizDbYWhQyYeRxq_tNGsla5F5l9vwZ0e78HvPd4tuWraBgl54GwOwnDzWCyL7TP2P233FZpKKcbFHBjA3GgwmZYXZDaKMEzwLJVaXZIJ1ylPALS-IbPj8ZMxJoBJkGpCljldh6qOJ7q1nY0RY_i1ZUSax6rtQl8fqG87-toO_bhG38eE5kPfHmwfHN0NTTMSTXVHrr2NR5yddUrelk-7xTrZvKyKRb5JauBcJkoywNJxx1EY771OteWjA5k5n2ZOGCVL6VVpGDr0xn-UI2GAuRKNTa2Ykvv_3oCI--8uHGx32p-fiz-Ly1Py |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.23919/IFIPNetworking55013.2022.9829784 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9783903176485 3903176486 |
| EISSN | 1861-2288 |
| EndPage | 9 |
| ExternalDocumentID | 9829784 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: French National Research Agency - HERA project grantid: ANR-18-CE25-0002 funderid: 10.13039/501100001665 |
| GroupedDBID | 6IE 6IF 6IL 6IN AAJGR AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK OCL RIE RIL |
| ID | FETCH-LOGICAL-h2114-5402ebc1c1e39fff868a11c1247cf67c3954b4f5b90ecef9fdb402920cbe9a6a3 |
| IEDL.DBID | RIE |
| IngestDate | Wed Aug 27 02:25:34 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-h2114-5402ebc1c1e39fff868a11c1247cf67c3954b4f5b90ecef9fdb402920cbe9a6a3 |
| OpenAccessLink | https://hal.science/hal-03916653 |
| PageCount | 9 |
| ParticipantIDs | ieee_primary_9829784 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-June-13 |
| PublicationDateYYYYMMDD | 2022-06-13 |
| PublicationDate_xml | – month: 06 year: 2022 text: 2022-June-13 day: 13 |
| PublicationDecade | 2020 |
| PublicationTitle | IFIP Networking Conference |
| PublicationTitleAbbrev | IFIP NETWORKING |
| PublicationYear | 2022 |
| Publisher | IFIP |
| Publisher_xml | – name: IFIP |
| SSID | ssj0003204245 |
| Score | 1.8331 |
| Snippet | Most current routing protocols are based on path computation algorithms in graphs (e.g., Dijkstra, Bellman-Ford, etc.). These algorithms have been studied for... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Encapsulation Measurement Multicast algorithms Network topology Path computation algorithms Routing Routing algorithms Routing protocols Tunneling |
| Title | A Highly Parallelizable Algorithm for Routing With Automatic Tunneling |
| URI | https://ieeexplore.ieee.org/document/9829784 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3NS8MwFMDDHCKeVDbxmxy8CHZrPto0xyEWBzJ6mLjbaLIXJ8xV5ir43_uSjongxVu-afMILy_5vTxCrlNlQVsVR5CCiaRluKTkjEdGCXBZVpaukfSjGo2yyUQXLXK79YUBgACfQc8nw13-rLK1Pyrra-8HmskdsqNU2vhqbc9TBA-XeHvkJtDNmun-MB8WowamRjWAW3Em0CDkvLcZ51dAlaBP8oP_fckh6f445tFiq3KOSAuWHZIPqKc1Fl-0KFc-NEogtRZAB4uXCm3_-RvFnSn17A92os9YQgf1ugqPtdJx7UkXrOiSp_x-fPcQbcIjRHO02qRHGjgYyywDoZ1zWZqVDHNcKutQBkIn0kiXGB2DBafdzGAPzWNrQJdpKY5Je1kt4YTQBGxqlMpAcSFjbMgd06USaL8CxC45JR0_B9P35gWM6eb3z_4uPif7fpo9UMXEBWmvVzVckl37uX79WF0FsX0D532atA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3NS8MwFMDDnKKeVDbx2xy8CHY2H22a4xDLhrP0MHG30WQvTpirzFXwvzfJykTw4q1Jm5LkEV7ey-_lIXQVCw1SizCAGFTANbFLik9ooAQDkyRFYVaSHogsS0YjmTfQzToWBgA8fAYd9-jP8ielrpyr7Fa6ONCEb6BNlzmrjtZae1QY9cd42-ja882SyNt-2s-zFU5tFYHdjBNmTUJKO_WffqVU8Rol3ftfX_ZR-yc0D-drpXOAGjBvobSLHa8x-8J5sXDJUTyrNQPcnb2U1vqfvmG7N8WO_rGN8LOtwd1qWfrrWvGwcqyLfdFGT-n98K4X1AkSgqm127iDGigoTTQBJo0xSZwUxJYoF9pYKTAZccVNpGQIGow0E2VbSBpqBbKIC3aImvNyDkcIR6BjJUQCgjIe2g-pIbIQzFqwAKGJjlHLzcH4fXUHxrge_snf1Zdopzd8HIwH_ezhFO26KXd4FWFnqLlcVHCOtvTn8vVjceFF-A0mnp39 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=IFIP+Networking+Conference&rft.atitle=A+Highly+Parallelizable+Algorithm+for+Routing+With+Automatic+Tunneling&rft.au=Mouhoub%2C+Noureddine&rft.au=Lamali%2C+Mohamed+Lamine&rft.au=Magoni%2C+Damien&rft.date=2022-06-13&rft.pub=IFIP&rft.eissn=1861-2288&rft.spage=1&rft.epage=9&rft_id=info:doi/10.23919%2FIFIPNetworking55013.2022.9829784&rft.externalDocID=9829784 |