Výsledky vyhľadávania - Path computation algorithms

Performance Evaluation of Path Computation Algorithms in Generalized Multiprotocol Label-Switched Optical Networks

Autori: null Monika Simranjit Singh Amit Wason

Zdroj: Broadband Connectivity in 5G and Beyond ISBN: 9783031068652

Calculating the Shortest Path Using Dijkstra's Algorithm

Autori: Cevizci, Bekir (ORCID 0000-0002-2066-2971)

Zdroj: Journal of Inquiry Based Activities. 2018 8(2):70-85.

Peer Reviewed: Y

Počet strán: 16

Descriptors: Computation, Mathematics, Graphs, Mathematics Skills, Mathematics Activities, Mathematical Models, Problem Solving, Middle School Students

Word-processing-based routing for Cayley graphs

Autori: Aguirre Guerrero, Daniela

Prispievatelia: University/Department: Universitat de Girona. Departament d'Arquitectura i Tecnologia de Computadors, University/Department: Universitat de Girona. Institut d'Informàtica i Aplicacions

Thesis Advisors: Vilà Talleda, Pere, Fàbrega i Soler, Lluís

Zdroj: TDX (Tesis Doctorals en Xarxa)

Predmety: Fault-tolerant routing, Encaminamiento tolerante a fallos, Encaminament tolerant a fallades, Cayley graphs, Grafos de Cayley, Grafs de Cayley, Automatic group theory, Teoría de grupos automáticos, Teoria de grups automàtics, Path computation algorithms, Algoritmos de búsqueda de caminos, Algoritmes de cerca de camins

Popis súboru: application/pdf

Prístupová URL adresa: http://hdl.handle.net/10803/667410

Path computation in multi-layer networks: Complexity and algorithms

Autori: Lamali, Mohamed Lamine Fergani, Nasreddine Cohen, Johanne a ďalší

Prispievatelia: Lamali, Mohamed Lamine Fergani, Nasreddine Cohen, Johanne a ďalší

Zdroj: IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

Predmety: Path computation, Unified Control Plane, Computer Science - Networking and Internet Architecture, Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], Protocol heterogeneity, Multi-layer networks, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/pdf/1601.01786
http://arxiv.org/abs/1601.01786
https://hal.science/hal-01252609v2/document
https://hal.science/hal-01252609v2
http://dblp.uni-trier.de/db/conf/infocom/infocom2016.html#LamaliFCP16
https://hal.archives-ouvertes.fr/hal-01252609/document
https://arxiv.org/abs/1601.01786v2
https://ieeexplore.ieee.org/document/7524550/
http://ui.adsabs.harvard.edu/abs/2016arXiv160101786L/abstract
https://dblp.uni-trier.de/db/conf/infocom/infocom2016.html#LamaliFCP16

Selection of path computation algorithms in PCE based GMPLS controlled WSON

Autori: P. Selvaraj V. Nagarajan

Zdroj: 2015 International Conference on Computing and Communications Technologies (ICCCT). :199-204

Predmety: 13. Climate action, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: https://ieeexplore.ieee.org/document/7292745/

Multi-constrained path computation algorithms for Traffic Engineering over Wireless Mesh Networks

Autori: ADAMI, DAVIDE GARROPPO, ROSARIO GIUSEPPE GIORDANO, STEFANO a ďalší

Zdroj: 2009 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks & Workshops. :1-6

Predmety: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: https://arpi.unipi.it/handle/11568/200736
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005282424
http://dblp.uni-trier.de/db/conf/wowmom/wowmom2009.html#AdamiGGT09
https://hdl.handle.net/11568/200736
https://doi.org/10.1109/WOWMOM.2009.5282424

Distributed and Centralized Path Computation Algorithms: Implementation in NS2 and Performance Comparison

Autori: ADAMI, DAVIDE CALLEGARI, CHRISTIAN GIORDANO, STEFANO a ďalší

Zdroj: 2008 IEEE International Conference on Communications. :17-21

Predmety: 01 natural sciences, 0105 earth and related environmental sciences

Prístupová URL adresa: https://hdl.handle.net/11568/200092
https://doi.org/10.1109/ICC.2008.12

Path Computation Algorithms for Dynamic Service Provisioning With Protection and Inverse Multiplexing in SDH/SONET Networks

Autori: N. Usha Rani Madanagopal Ramachandran Timothy A. Gonsalves

Zdroj: IEEE/ACM Transactions on Networking. 18:1492-1504

Predmety: 0508 media and communications, 05 social sciences, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Path Computation Algorithms for Dynamic Service Provisioning in SDH Networks

Autori: R. Madanagopal N.U. Rani Timothy A. Gonsalves

Zdroj: 2007 10th IFIP/IEEE International Symposium on Integrated Network Management. :206-215

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: https://dblp.uni-trier.de/db/conf/im/im2007.html#MadanagopalRG07
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004258537
https://ieeexplore.ieee.org/document/4258537/

Link-Disjoint Shortest-Delay Path-Pair Computation Algorithms for Shared Mesh Restoration Networks

Autori: Hassan Naser Ming Gong

Zdroj: 2007 IEEE Symposium on Computers and Communications. :269-274

Predmety: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: https://ieeexplore.ieee.org/abstract/document/4381566
https://dblp.uni-trier.de/db/conf/iscc/iscc2007.html#NaserG07
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004381566

Path computation algorithms in NS2

Autori: ADAMI, DAVIDE CALLEGARI, CHRISTIAN GIORDANO, STEFANO a ďalší

Zdroj: Proceedings of the First International ICST Conference on Simulation Tools and Techniques for Communications Networks and Systems.

Predmety: CSPF, DBCTE, EBMP, MPBF, MPLS-TE, NS2, Path computation, Wang-Crowcroft

Prístupová URL adresa: http://eudl.eu/pdf/10.4108/ICST.SIMUTOOLS2008.2930
https://dblp.uni-trier.de/db/conf/simutools/simutools2008.html#AdamiGCP08
https://eudl.eu/doi/10.4108/ICST.SIMUTOOLS2008.2930
https://arpi.unipi.it/handle/11568/187000

Path computation algorithms for advanced traveller information system (ATIS)

Autori: A. Kohli M.S. Coyle Shashi Shekhar

Zdroj: Proceedings of IEEE 9th International Conference on Data Engineering. :31-39

Predmety: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Prístupová URL adresa: https://dblp.uni-trier.de/db/conf/icde/icde93.html#ShekharKC93
https://ieeexplore.ieee.org/document/344080/
https://experts.umn.edu/en/publications/path-computation-algorithms-for-advanced-traveller-information-sy

Exploring Path Computation Techniques in Software-Defined Networking: A Review and Performance Evaluation of Centralized, Distributed, and Hybrid Approaches

Autori: Mohit Chandra Saxena Munish Sabharwal Preeti Bajaj

Zdroj: International Journal on Recent and Innovation Trends in Computing and Communication. 11:553-567

A Transitive Closure Algorithm for Routing with Automatic Tunneling

Autori: Mouhoub, Noureddine Lamali, Mohamed Lamine Magoni, Damien a ďalší

Prispievatelia: Mouhoub, Noureddine Lamali, Mohamed Lamine Magoni, Damien a ďalší

Zdroj: ISSN: 1063-6692 ; IEEE/ACM Transactions on Networking ; https://hal.science/hal-04621115 ; IEEE/ACM Transactions on Networking, 2024, 32 (4), pp.3221-3236. ⟨10.1109/TNET.2024.3378717⟩.

Predmety: path computation, routing algorithm, tunneling, transitive closure, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]

Dostupnosť: https://hal.science/hal-04621115
https://hal.science/hal-04621115v1/document
https://hal.science/hal-04621115v1/file/mouhoub-ton2024.pdf
https://doi.org/10.1109/TNET.2024.3378717

An open GMPLS-enabled control plane testbed for remote development and experimentation of PCE-based path computation algorithms

Predmety: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Elements of dynamic and 2-SAT programming: paths, trees, and cuts

Autori: Bentert, Matthias

Predmety: graph diameter, shortest paths computation, flow and cut problems, resource allocation, computational biology, Algorithms and data structures

Popis súboru: application/pdf

Relation: Foundations of computing

Prístupová URL adresa: https://library.oapen.org/handle/20.500.12657/54061

A Highly Parallelizable Algorithm for Routing With Automatic Tunneling

Autori: Mouhoub, Noureddine Lamali, Mohamed Lamine Magoni, Damien a ďalší

Prispievatelia: Mouhoub, Noureddine Lamali, Mohamed Lamine Magoni, Damien a ďalší

Zdroj: 2022 IFIP Networking Conference (IFIP Networking)
https://hal.science/hal-03916653
2022 IFIP Networking Conference (IFIP Networking), Jun 2022, Catania, Italy. pp.1-9, ⟨10.23919/IFIPNetworking55013.2022.9829784⟩

Predmety: Tunneling, Routing algorithms, Path computation algorithms, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]

Geografické téma: Catania, Italy

Dostupnosť: https://hal.science/hal-03916653
https://hal.science/hal-03916653v1/document
https://hal.science/hal-03916653v1/file/mouhoub-networking2022.pdf
https://doi.org/10.23919/IFIPNetworking55013.2022.9829784

Algorithmic and complexity aspects of path computation in multi-layer networks

Autori: Lamali, Mohamed Lamine Fergani, Nasreddine Cohen, Johanne a ďalší

Prispievatelia: Lamali, Mohamed Lamine Fergani, Nasreddine Cohen, Johanne a ďalší

Zdroj: ISSN: 1063-6692 ; IEEE/ACM Transactions on Networking ; https://hal.science/hal-01706362 ; IEEE/ACM Transactions on Networking, In press, 26 (6), pp.2787 - 2800. ⟨10.1109/TNET.2018.2878103⟩.

Predmety: Protocols, Encapsulation, Path computation, multi-layer networks, Complexity theory, automata theory, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]

Dostupnosť: https://hal.science/hal-01706362
https://hal.science/hal-01706362v2/document
https://hal.science/hal-01706362v2/file/TON_revised.pdf
https://doi.org/10.1109/TNET.2018.2878103

Calcul de chemins pour réseaux IP : routage de la patate chaude et froide lors de pannes & chemins multi-contraints pour segment routing ; Path computation algorithms in IP networks : reliable hot-potato routing & deployable multi-constrained tunnels

Autori: Luttringer, Jean-Romain Strasbourg Pelsser, Cristel

Prispievatelia: Luttringer, Jean-Romain Strasbourg Pelsser, Cristel

Predmety: Routage, Calcul de chemins, DCLC, Segment Routing, BGP, IGP, Qualité de Service, Ingénierie de Trafic, Routing, Path Computation, Quality of Service, Traffic Engineering, 004.6

Relation: http://www.theses.fr/2022STRAD038/document

Dostupnosť: http://www.theses.fr/2022STRAD038/document

Path computation algorithms in IP networks : reliable hot-potato routing & deployable multi-constrained tunnels ; Calcul de chemins pour réseaux IP : routage de la patate chaude et froide lors de pannes & chemins multi-contraints pour segment routing

Autori: Luttringer, Jean-Romain Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube) École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg) a ďalší

Prispievatelia: Luttringer, Jean-Romain Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie (ICube) École Nationale du Génie de l'Eau et de l'Environnement de Strasbourg (ENGEES)-Université de Strasbourg (UNISTRA)-Institut National des Sciences Appliquées - Strasbourg (INSA Strasbourg) a ďalší

Zdroj: https://theses.hal.science/tel-04089268 ; Other [cs.OH]. Université de Strasbourg, 2022. English. ⟨NNT : 2022STRAD038⟩.

Predmety: Routing, Path Computation, DCLC, Segment Routing, BGP, IGP, Quality of Service, Traffic Engineering, Routage, Calcul de chemins, Qualité de Service, Ingénierie de Trafic, [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]

Relation: NNT: 2022STRAD038; tel-04089268; https://theses.hal.science/tel-04089268; https://theses.hal.science/tel-04089268/document; https://theses.hal.science/tel-04089268/file/LUTTRINGER_Jean-Romain_2022_ED269.pdf

Dostupnosť: https://theses.hal.science/tel-04089268
https://theses.hal.science/tel-04089268/document
https://theses.hal.science/tel-04089268/file/LUTTRINGER_Jean-Romain_2022_ED269.pdf