Search Results - path computation algorithm

A Case Study on Numerical Analysis of a Path Computation Algorithm

Authors: Boussu, Grégoire Kosmatov, Nikolai Védrine, Franck

Source: Electronic Proceedings in Theoretical Computer Science. 411:126-142

Subject Terms: Software Engineering (cs.SE), FOS: Computer and information sciences, Computer Science - Software Engineering, F.3.2, G.1.0

Access URL: http://arxiv.org/abs/2411.14372

Calculating the Shortest Path Using Dijkstra's Algorithm

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

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

Peer Reviewed: Y

Page Count: 16

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

Intelligent Critical Path Computation Algorithm Utilising Ant Colony Optimisation for Complex Project Scheduling

Authors: Xiaokang Han Wenzhou Yan Mei Lu

Source: Complexity, Vol 2021 (2021)

Subject Terms: Electronic computers. Computer science, 0202 electrical engineering, electronic engineering, information engineering, QA75.5-76.95, 02 engineering and technology

File Description: text/xhtml

Access URL: https://downloads.hindawi.com/journals/complexity/2021/9930113.pdf
https://doaj.org/article/5c690ed8a34b48d5902e387d5f0e48a4
https://downloads.hindawi.com/journals/complexity/2021/9930113.pdf
https://dblp.uni-trier.de/db/journals/complexity/complexity2021.html#HanYL21
http://downloads.hindawi.com/journals/complexity/2021/9930113.pdf
https://www.hindawi.com/journals/complexity/2021/9930113/

A Hybrid End-to-End QoS Path Computation Algorithm for PCE-Based Multi-Domain Networks

Authors: Frikha, Ahmed Lahoud, Samer Cousin, Bernard

Contributors: Frikha, Ahmed Lahoud, Samer Cousin, Bernard

Source: Journal of Network and Systems Management. 22:682-708

Subject Terms: pre-computation, crankback mechanisms, [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], routing, 0202 electrical engineering, electronic engineering, information engineering, on-demand computation, 02 engineering and technology, path computation element (PCE), 16. Peace & justice, inter-domain routing

File Description: application/pdf

Access URL: https://hal.archives-ouvertes.fr/hal-01134296/file/JNSM2013.pdf
https://hal.science/hal-01134296v1
https://doi.org/10.1007/s10922-013-9273-5
https://hal.science/hal-01134296v1/document

Distributed E2E QoS-Based Path Computation Algorithm over Multiple Inter-domain Routes

Authors: Djarallah, Nabil Bachir Le Sauze, Nicolas Pouyllau, Hélia et al.

Contributors: Djarallah, Nabil Bachir Le Sauze, Nicolas Pouyllau, Hélia et al.

Source: Proceedings-2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing, 3PGCIC 2011

Subject Terms: [INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI], QoS routing, Multi-domain Networks, 0202 electrical engineering, electronic engineering, information engineering, Route computation, 02 engineering and technology

File Description: application/pdf

Access URL: http://www.irisa.fr/prive/bcousin/Articles/Articles%202011/Distributed%20E2E%20QoS-Based%20Path%20Computation%20Algorithm%20Over%20Multiple%20Inter-Domain%20Routes.pdf
http://ieeexplore.ieee.org/document/6103155/
https://www.irisa.fr/prive/Bernard.Cousin/Articles/Articles%202011/Distributed%20E2E%20QoS-Based%20Path%20Computation%20Algorithm%20Over%20Multiple%20Inter-Domain%20Routes.pdf
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000006103155
https://hal.archives-ouvertes.fr/hal-01183777
https://ieeexplore.ieee.org/document/6103155/
https://hal.archives-ouvertes.fr/hal-01183777/document

A dynamic critical path computation algorithm for enterprise process cooperative scheduling

Authors: Yang, F. Tan, W. Shen, W. et al.

Source: The 2010 14th International Conference on Computer Supported Cooperative Work in Design. :606-610

Subject Terms: dynamic programming, critical path, business process simulation, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, dynamic critical path selection, 01 natural sciences, analytic hierarchy process

File Description: application/pdf

Access URL: https://nrc-publications.canada.ca/eng/view/accepted/?id=52aeebc2-e53a-4b41-8d8e-73ddf64576bc
http://dblp.uni-trier.de/db/conf/cscwd/cscwd2010.html#YangTSGX10
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005471902
https://dblp.uni-trier.de/db/conf/cscwd/cscwd2010.html#YangTSGX10
https://ieeexplore.ieee.org/document/5471902/
https://nrc-publications.canada.ca/eng/view/object/?id=52aeebc2-e53a-4b41-8d8e-73ddf64576bc
https://doi.org/10.1109/cscwd.2010.5471902

ADAPTIVE EVOLUTIONARY MULTITASKING TO SOLVE INTER-DOMAIN PATH COMPUTATION UNDER NODE-DEFINED DOMAIN UNIQUENESS CONSTRAINT: NEW SOLUTION ENCODING SCHEME.

Authors: Thanh PHAM DINH¹ thanhpd05@gmail.com

Source: Computing & Informatics. 2023, Vol. 42 Issue 1, p98-125. 28p.

Subject Terms: Evolutionary algorithms, Encoding, Evolutionary computation, Computer multitasking, Algorithms

Selection of path computation algorithms in PCE based GMPLS controlled WSON

Authors: P. Selvaraj V. Nagarajan

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

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

Access URL: https://ieeexplore.ieee.org/document/7292745/

A dynamic on-line path computation algorithm for VNT configuration in GMPLS controlled multi-layer (Ethernet/WSON) network

Authors: Bukva A. Casellas R. Martinez R. et al.

Source: 2011 IEEE 12th International Conference on High Performance Switching and Routing, HPSR 2011

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: https://dblp.uni-trier.de/db/conf/hpsr/hpsr2011.html#BukvaCMM11

A New Path Computation Algorithm and Its Implementation in NS2

Authors: ADAMI, DAVIDE CALLEGARI, CHRISTIAN GIORDANO, STEFANO et al.

Source: 2007 IEEE International Conference on Communications. :536-541

Subject Terms: 0203 mechanical engineering, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: https://hdl.handle.net/11568/197350

A Fast Heuristic Path Computation Algorithm for the Batch Bandwidth Constrained Routing Problem in SDN

Authors: Peng Yang Ke Tang Dongjun Qian

Source: Lecture Notes in Computer Science ISBN: 9783319973036

Access URL: https://link.springer.com/chapter/10.1007%2F978-3-319-97304-3_38
https://doi.org/10.1007/978-3-319-97304-3_38
http://doi.org/10.1007/978-3-319-97304-3_38
https://dblp.uni-trier.de/db/conf/pricai/pricai2018a.html#QianYT18
https://rd.springer.com/chapter/10.1007/978-3-319-97304-3_38

An on-line path computation algorithm for a protected GMPLS enabled multi-layer network

Authors: Raul Munoz Anica Bukva Ramon Casellas et al.

Source: 2012 17th European Conference on Networks and Optical Communications. :1-6

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: http://ieeexplore.ieee.org/iel5/6242426/6249906/06249933.pdf
http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=6249933

A new dynamic path computation algorithm for multi-domain optical networks

Authors: S. Dandu Jaspal Subhlok Nasir Ghani et al.

Source: 2008 2nd ICTON Mediterranean Winter. :1-6

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004773100
https://ieeexplore.ieee.org/document/4773100/

Novel constrained-path computation algorithm for failure recovery and CAC in GMPLS optical networks

Authors: A. Mribah T. Eido T. Atmaca

Source: 2008 23rd International Symposium on Computer and Information Sciences. :1-6

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: https://ieeexplore.ieee.org/document/4717858/

Improved agent based explicit path computation algorithm for MPLS-TE

Authors: S. Ladhe Satish Devane M. Chatterjee

Source: 2008 16th IEEE International Conference on Networks. :1-5

Subject Terms: 02 engineering and technology, 0210 nano-technology, 01 natural sciences, 0104 chemical sciences

Access URL: https://ieeexplore.ieee.org/document/4772636/
https://dblp.uni-trier.de/db/conf/icon/icon2008.html#LadheDC08
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004772636
http://ieeexplore.ieee.org/document/4772636/

A multi-population multi-tasking variable neighborhood search algorithm with diversity enhancements for inter-domain path computation problem.

Authors: Anh, Do Tuan Binh, Huynh Thi Thanh Bang, Ban Ha et al.

Source: Swarm & Evolutionary Computation. Apr2024, Vol. 86, pN.PAG-N.PAG. 1p.

Subject Terms: Search algorithms, Tabu search algorithm, NP-hard problems, Metaheuristic algorithms, Evolutionary algorithms, Knowledge transfer

Intelligent Critical Path Computation Algorithm Utilising Ant Colony Optimisation for Complex Project Scheduling.

Authors: Han, Xiaokang Yan, Wenzhou Lu, Mei

Source: Complexity; 7/2/2021, p1-8, 8p

Subject Terms: ANT algorithms, TRAVELING salesman problem, ALGORITHMS, PLANT engineering, ANTS, SCHEDULING

A dynamic path computation algorithm for e2e dedicated protection in a GMPLS controlled multilayer (Ethernet/WSON) network

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Development of fast computation algorithm for load transfer Ustar (U*) calculation in structures with slidable supports / スライド可能な支持点を持つ構造物の荷重伝達 Ustar(U*)計算における高速化アルゴリズムの開発

Authors: Kunihiro TAKAHASHI Masaki OMIYA Tetsuo MAKI et al.

Source: 日本機械学会論文集 / Transactions of the JSME (in Japanese). 2019, 85(870):18-00374

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

Authors: Bentert, Matthias

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

File Description: application/pdf

Relation: Foundations of computing

Access URL: https://library.oapen.org/handle/20.500.12657/54061