Search Results - Path computation algorithms

Refine Results
  1. 1

    Efficient Algorithms for Temporal Path Computation by Huanhuan Wu, Cheng, James, Yiping Ke, Silu Huang, Yuzhen Huang, Hejun Wu

    ISSN: 1041-4347, 1558-2191
    Published: New York IEEE 01.11.2016
    “… We propose efficient algorithms to compute minimum temporal paths and verified their efficiency using large real-world temporal graphs…”
    Get full text
    Journal Article
  2. 2

    A survey on multi-constrained optimal path computation: Exact and approximate algorithms by Garroppo, Rosario G., Giordano, Stefano, Tavanti, Luca

    ISSN: 1389-1286, 1872-7069
    Published: Kidlington Elsevier B.V 03.12.2010
    “… In the present work, we draw the state of the art of exact and approximate MCOP computation algorithms, with particular attention to the networking…”
    Get full text
    Journal Article
  3. 3
  4. 4

    Intelligent Critical Path Computation Algorithm Utilising Ant Colony Optimisation for Complex Project Scheduling by Han, Xiaokang, Yan, Wenzhou, Lu, Mei

    ISSN: 1076-2787, 1099-0526
    Published: Hoboken Hindawi 2021
    Published in Complexity (New York, N.Y.) (2021)
    “… Therefore, an algorithm with a faster convergence is needed to improve the efficiency of the critical path computation…”
    Get full text
    Journal Article
  5. 5

    Atomic Column Generation for Consensus Between Algorithms: Application to Path Computation by Martin, Sebastien, Bauguion, Pierre, Magnouche, Youcef, Leguay, Jérémie

    ISSN: 0028-3045, 1097-0037
    Published: Hoboken, USA John Wiley & Sons, Inc 01.06.2025
    Published in Networks (01.06.2025)
    “… Usually, efficient algorithms to handle a restricted subset of these additional constraints already exist or can be easily derived, but combining them together is difficult…”
    Get full text
    Journal Article
  6. 6

    Path Computation Algorithms for Dynamic Service Provisioning With Protection and Inverse Multiplexing in SDH/SONET Networks by Ramachandran, Madanagopal, Usha Rani, N, Gonsalves, Timothy A

    ISSN: 1063-6692, 1558-2566
    Published: New York IEEE 01.10.2010
    Published in IEEE/ACM transactions on networking (01.10.2010)
    “… Dynamic service provisioning requires the use of online algorithms that automatically compute the path to be taken to satisfy the given service request…”
    Get full text
    Journal Article
  7. 7

    A dynamic path-computation algorithm for a GMPLS-enabled multi-layer network by Bukva, A., Casellas, R., Martinez, R., Munoz, R.

    ISSN: 1943-0620, 1943-0639
    Published: Piscataway IEEE 01.06.2012
    “…In this paper, we propose a path-computation algorithm for a dynamic virtual network topology (VNT) configuration…”
    Get full text
    Journal Article
  8. 8

    A Hybrid End-to-End QoS Path Computation Algorithm for PCE-Based Multi-Domain Networks by Frikha, Ahmed, Lahoud, Samer, Cousin, Bernard

    ISSN: 1064-7570, 1573-7705
    Published: Boston Springer US 01.10.2014
    Published in Journal of network and systems management (01.10.2014)
    “… In this paper, we propose a novel hybrid end-to-end QoS path computation algorithm, named HID-MCP, for PCE-based networks…”
    Get full text
    Journal Article
  9. 9

    A Particle Swarm Optimization and Variable Neighborhood Search based multipopulation algorithm for Inter-Domain Path Computation problem by Anh, Do Tuan, Binh, Huynh Thi Thanh, Thai, Nguyen Duc, Thanh, Pham Dinh

    ISSN: 1568-4946, 1872-9681
    Published: Elsevier B.V 01.03.2023
    Published in Applied soft computing (01.03.2023)
    “… This paper focuses on the Inter-Domain Path Computation under Node-defined Domain Uniqueness Constraint (IDPC-NDU…”
    Get full text
    Journal Article
  10. 10

    An adaptive amoeba algorithm for shortest path tree computation in dynamic graphs by Zhang, Xiaoge, Chan, Felix T.S., Yang, Hai, Deng, Yong

    ISSN: 0020-0255, 1872-6291
    Published: Elsevier Inc 01.09.2017
    Published in Information sciences (01.09.2017)
    “…In today’s Internet, the shortest path tree (SPT) construction is an important issue in data exchange…”
    Get full text
    Journal Article
  11. 11

    A Case Study on Numerical Analysis of a Path Computation Algorithm by Boussu, Grégoire, Kosmatov, Nikolai, Védrine, Franck

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 21.11.2024
    Published in arXiv.org (21.11.2024)
    “… implementation of the fast marching algorithm, a popular path computation algorithm frequently used for trajectory computation…”
    Get full text
    Paper
  12. 12

    A Cooperative Evolutionary Computation Algorithm for Dynamic Multiobjective Multi-AUV Path Planning by Liu, Xiao-Fang, Fang, Yongchun, Zhan, Zhi-Hui, Jiang, Yun-Liang, Zhang, Jun

    ISSN: 1551-3203, 1941-0050
    Published: Piscataway IEEE 01.01.2024
    “… Thus, this paper models the problem as a dynamic multiobjective optimization problem and proposes a cooperative evolutionary computation algorithm to provide diverse and high-quality solutions for decision makers…”
    Get full text
    Journal Article
  13. 13

    Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet by Sobrinho, J.L.

    ISSN: 1063-6692, 1558-2566
    Published: New York IEEE 01.08.2002
    Published in IEEE/ACM transactions on networking (01.08.2002)
    “… can be computed with a generalization of E.W. Dijkstra's algorithm (see Numer. Math., vol.1, p.269-71, 1959). We define an algebra of weights which contains a binary operation, for the composition of link weights into path weights, and an order relation…”
    Get full text
    Journal Article
  14. 14
  15. 15

    A new robot navigation algorithm for dynamic unknown environments based on dynamic path re-computation and an improved scout ant algorithm by Zhu, Qingbao, Hu, Jun, Cai, Wenbin, Henschen, Larry

    ISSN: 1568-4946, 1872-9681
    Published: Elsevier B.V 01.12.2011
    Published in Applied soft computing (01.12.2011)
    “…A difficult issue in robot navigation or path planning in an unknown environment with static or dynamic obstacles is to find a globally optimal path from the start to the target point and at the…”
    Get full text
    Journal Article
  16. 16

    New dynamic algorithms for shortest path tree computation by Narvaez, P., Kai-Yeung Siu, Hong-Yi Tzeng

    ISSN: 1063-6692, 1558-2566
    Published: New York IEEE 01.12.2000
    Published in IEEE/ACM transactions on networking (01.12.2000)
    “…The open shortest path first (OSPF) and IS-IS routing protocols widely used in today's Internet compute a shortest path tree (SPT…”
    Get full text
    Journal Article
  17. 17

    Efficient Recovery Path Computation for Fast Reroute in Large-Scale Software-Defined Networks by Qiu, Kun, Zhao, Jin, Wang, Xin, Fu, Xiaoming, Secci, Stefano

    ISSN: 0733-8716, 1558-0008
    Published: New York IEEE 01.08.2019
    “… However, the traditional FRR path computation algorithms could lead to a poor performance in large-scale SDN…”
    Get full text
    Journal Article
  18. 18
  19. 19

    Distributed and Centralized Path Computation Algorithms: Implementation in NS2 and Performance Comparison by Adami, D., Callegari, C., Giordano, S., Pagano, M.

    ISSN: 1550-3607
    Published: IEEE 01.05.2008
    “… This paper deals with on-line and offline path computation algorithms and, more specifically, introduces and compares the performance of three novel offline path computation algorithms which aim…”
    Get full text
    Conference Proceeding
  20. 20

    A New Path Computation Algorithm and Its Implementation in NS2 by Adami, D., Callegari, D.C., Giordano, S., Pagano, M.

    ISBN: 9781424403530, 1424403537
    ISSN: 1550-3607
    Published: IEEE 01.06.2007
    “… In this paper, we introduce a novel path computation procedure which aims at improving the performance of the well-known Wang-Crowcroft algorithm by means of some heuristics…”
    Get full text
    Conference Proceeding