Search Results - (( network selection path algorithm ) OR ( java application using algorithm ))

Refine Results
  1. 1

    Path Selection With Critical Switch-Aware For Software Defined Networking by Isyaku, B., Bakar, K.B.A., Ghaleb, F.A., Zahid, M.S.M.

    Published 2021
    “…However, the traditional path selection algorithms failed to consider the switch role during the path selection process. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

    Published 2013
    “…Such an in-band probing algorithm reduces measurement overhead on the selected overlay path. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…It calculates the appropriate adjustments for the control parameters such as selection and crossover rate. Possible attack paths are then identified and evaluated based on an attack graph representing the network under study. …”
    Get full text
    Get full text
    Article
  4. 4

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…It calculates the appropriate adjustments for the control parameters such as selection and crossover rate. Possible attack paths are then identified and evaluated based on an attack graph representing the network under study. …”
    Get full text
    Get full text
    Article
  5. 5

    An adaptive relay selection scheme for enhancing network stability in VANETs by Al-Kharasani, Ameen Mohammed Abdulkarem, Ahmad Zukarnain, Zuriati, Subramaniam, Shamala, Mohd Hanapi, Zurina

    Published 2020
    “…The results show that the proposed algorithm can improve network performance effectively relative to other algorithms.…”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques by Salem S. M. Khalifa

    Published 2024
    “…By contrast, the results of the safe path selection model were compared with the results obtained using Dijkstra's algorithm and the Floyd-Warshall algorithm. …”
    thesis::doctoral thesis
  7. 7

    AUTOMATIC ROUTE FINDER FOR NEW VISITORS by ADNAN, MOHD SHIHAM

    Published 2006
    “…Shortest path finding algorithms are necessary in road network of a city or country for tourists and visitors. …”
    Get full text
    Get full text
    Final Year Project
  8. 8

    The performance effect due to varying network topologies on a software-defined network employing the k-shortest path by Linsheng, R., Derahman, M. N., Kadir, M. F. A., Mohamed, M. A., Kamarudin, S.

    Published 2022
    “…SDN controller uses the Dijkstra algorithm to find the shortest path calculated from the source node to the destination node. …”
    Get full text
    Get full text
    Article
  9. 9
  10. 10

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…This study also introduces a new probe-based procedure for discovery and setup QoS path for real-time traffic. The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  12. 12

    A O(|E|) Time Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs by Qureshi, M.A., Hassan, M.F., Safdar, S., Akhbar, R.

    Published 2010
    “…The algorithm completes its execution in O(|E|) for all graphs except few in which longer path (in terms of number of edges) from source to some node makes it best selection for that node.…”
    Get full text
    Get full text
    Article
  13. 13

    Shortest Path Routing Using Heuristic Search by Alaiwan, Ahmed Omran A.

    Published 2006
    “…In this project A* algorithm was used, to suggest shortest path model between two selected points to find the fastest and shortest route on Malaysia map. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Identification of least congested and shortest distance path in traffic network by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…Therefore, a suggested approach in this study was to change the driver's behavior in selecting the best path. The shortest path may not be the best path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    A new routing mechanism for energy-efficient in bluetooth mesh-low power nodes based on wireless sensor network by Almuslehi, Hussein Saad Mohammed

    Published 2023
    “…Pheromone trails mark efficient routes, reinforcing paths with higher pheromone concentrations. This optimizes data transmission, enhances energy efficiency, and extends network longevity. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    A comprehensive overview of classical and modern route planning algorithms for self-driving mobile robots by Wan Daud, Wan Mohd Bukhari, Abu, Nur Syuhadah, Omar, Siti Nashayu, Sohaimeh, Shahirul Ashraf, Adli,, M. H.

    Published 2022
    “…Classical or traditional methods, such as Roadmaps (Visibility Graph and Voronoi Diagram), Potential Fields, and Cell Decomposition, and modern methodologies such as heuristic-based (Dijkstra Method, A* Algorithms, and D* Algorithms), metaheuristics algorithms (such as PSO, Bat Algorithm, ACO, and Genetic Algorithm), and neural systems such as fuzzy neural networks or fuzzy logic (FL) and Artificial Neural Networks (ANN) are described in this report. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Enchancing QoS protection in MPLS networks by Hanshi, Sabri M., Al-Khateeb, Wajdi Fawzi Mohammed

    Published 2010
    “…In this work, we proposed the traffic splitter to split the protected traffic after failure, in case the available bandwidth in the alternative path is not enough to deliver the traffic. Finally, alternative path selection is updated based on current network resource availability. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  18. 18

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…Results show that for the same network load, DLBR outperforms the shortest path in terms of the average delay and packet loss. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Delay-based load-balancing routing (DLBR) algorithm for wireless ad-hoc networks by Habib, I., Badruddin, N., Drieberg, M.

    Published 2015
    “…Results show that for the same network load, DLBR outperforms the shortest path in terms of the average delay and packet loss. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20