Search Results - (( java implementation path algorithm ) OR ( using network caching algorithm ))

Search alternatives:

Refine Results
  1. 1
    Performance evaluation of caching placement algorithms in named data network for video on demand service

    Performance evaluation of caching placement algorithms in named data network for video on demand service by Abbas, Rasha Salem

    Published 2016
    “…There are two stages of activities resulted in the outcome of the study: The first is to determine the causes of delay performance in NDN cache algorithms used in VoD workload. The second activity is the evaluation of the seven cache placement algorithms on the cloud of video content in terms of the key performance metrics: delay time, average cache hit ratio, total reduction in the network footprint, and reduction in load. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Intelligent web proxy cache replacement algorithm based on adaptive weight ranking policy via dynamic aging

    Intelligent web proxy cache replacement algorithm based on adaptive weight ranking policy via dynamic aging by Olanrewaju, Rashidah Funke, Al-Qudah, Dua'a Mahmoud Mohammad, Azman, Amelia Wong, Yaacob, Mashkuri

    Published 2016
    “…This work proposes a hybrid method that optimize cache replacement algorithm using Naïve Bayes (NB) based approach. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Network bandwidth utilization based on collaborative web caching using machine learning algorithms in peer-to-peer systems for media web objects

    Network bandwidth utilization based on collaborative web caching using machine learning algorithms in peer-to-peer systems for media web objects by Mohammed, Waheed Yasin

    Published 2018
    “…Moreover, traditional web caching policies such as Least Recently Used (LRU) and Least Frequently Used (LFU) suffer from caching pollution (i.e. media objects that are stored in the cache are not frequently visited, which negatively affects on the performance of web proxy caching). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Intelligent Web caching using neurocomputing and particle swarm optimization algorithm

    Intelligent Web caching using neurocomputing and particle swarm optimization algorithm by Sulaiman, Sarina, Shamsuddin, Siti Mariyam, Forkan, Fadni, Abraham, Ajith

    Published 2008
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  5. 5
    Intelligent cooperative web caching policies for media objects based on J48 decision tree and naïve Bayes supervised machine learning algorithms in structured peer-to-peer systems

    Intelligent cooperative web caching policies for media objects based on J48 decision tree and naïve Bayes supervised machine learning algorithms in structured peer-to-peer systems by Ibrahim, Hamidah, Mohammed, Waheed Yasin, Udzir, Nur Izura, Abdul Hamid, Nor Asilah Wati

    Published 2016
    “…Moreover, traditional web caching policies such as Least Recently Used (LRU), Least Frequently Used (LFU), and Greedy Dual Size (GDS) suffer from caching pollution (i.e. media objects that are stored in the cache are not frequently visited which negatively affects on the performance of web proxy caching). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Intelligent cooperative web caching policies for media objects based on J48 decision tree and Naive bayes supervised machine learning algorithms in structured peer-to-peer systems

    Intelligent cooperative web caching policies for media objects based on J48 decision tree and Naive bayes supervised machine learning algorithms in structured peer-to-peer systems by Ibrahim, Hamidah, Yasin, Waheed, Udzir, Nur Izura, Abdul Hamid, Nor Asilah Wati

    Published 2016
    “…Moreover, traditional web caching policies such as Least Recently Used (LRU), Least Frequently Used (LFU), and Greedy Dual Size (GDS) suffer from caching pollution (i.e. media objects that are stored in the cache are not frequently visited which negatively affects on the performance of web proxy caching). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    A framework of rough cultural algorithms in optimizing mobile web caching performance

    A framework of rough cultural algorithms in optimizing mobile web caching performance by Sulaiman, Sarina, Shamsuddin, Siti Maryam, Abraham, Ajith, Sulaiman, Shahida

    Published 2007
    “…Consequently, The proposed caching scheme, Rough Cultural Algorithm (RCA) is developed to materialise the caching policies.…”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Intelligent cooperative web caching policies for media objects based on decision tree supervised machine learning algorithm

    Intelligent cooperative web caching policies for media objects based on decision tree supervised machine learning algorithm by Ibrahim, Hamidah, Yasin, Waheed, Abdul Hamid, Nor Asilah Wati, Udzir, Nur Izura

    Published 2014
    “…Furthermore, retrieving the same media object from the origin server many times consumes the network bandwidth. Moreover, cache pollution is a drawback of traditional web caching policies such as Least Frequently Used (LFU), Least Recently Used (LRU), and Greedy Dual Size (GDS) where web objects that are stored in the cache are not visited frequently. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Prospective use of bloom filter and muxing for information centric network caching

    Prospective use of bloom filter and muxing for information centric network caching by Abdullahi, Ibrahim, Hassan, Suhaidi, Arif, Suki

    Published 2015
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Reduction the Effect of Mobility in Link Transmitting Using Efficient DSR Route Cache for MANETs

    Reduction the Effect of Mobility in Link Transmitting Using Efficient DSR Route Cache for MANETs by Ayoob, Ayoob A., Norrozila, Sulaiman, Mohammed, Muamer N., Ghaida M., Abdilsahib

    Published 2014
    “…This paper presented a new algorithm using DSR routing cache technique to improve the routing between mobile nodes to reduction the effect of mobility in link transmitting that can solve link broken problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    A design of redirect link failure protocol based on dynamic source routing for mobile ad hoc networks

    A design of redirect link failure protocol based on dynamic source routing for mobile ad hoc networks by Ghazali, Osman, Hassan, Suhaidi, M. Kadhum, Mohammed

    Published 2011
    “…The characteristics of ad hoc networks are that they are decentralized, self-organized, self-deployed, and they possess dynamic network topology.All mobile nodes in ad hoc network communicate with each other directly or through intermediate nodes by using routing protocols algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  12. 12
    Content caching in ICN using Bee-Colony optimization algorithm

    Content caching in ICN using Bee-Colony optimization algorithm by Abdullahi, Ibrahim, Che Mohamed Arif, Ahmad Suki, Hassan, Suhaidi

    Published 2015
    “…Different caching issues has raised concern about the content flooded all over the Internet.In line with the challenges, Bee-Colony Optimization Algorithm (B-COA) has been proposed in this paper to avail content on the Internet with less referral cost and heavy monopoly of data on hosts.It is believed that the advantages of the grouping and waggle phase could be used to place the contents faster in ICN.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol

    Location-Based Approach for Route Maintenance in Dynamic Source Routing Protocol by Sjaugi, Muhammad Farhan

    Published 2008
    “…To facilitate communication within the network, a routing protocol is used to dis- cover routes between nodes. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Intelligent cooperative adaptive weight ranking policy via dynamic aging based on NB and J48 classifiers

    Intelligent cooperative adaptive weight ranking policy via dynamic aging based on NB and J48 classifiers by Al-Qudah,, Dua’A Mahmoud, Olanrewaju, Rashidah Funke, Azman, Amelia Wong

    Published 2017
    “…But, the cache size is limited, so cache replacement algorithms are used to remove pages from the cache when it is full. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Query proof structure caching for incremental evaluation of tabled prolog programs / Taher Muhammad Ali

    Query proof structure caching for incremental evaluation of tabled prolog programs / Taher Muhammad Ali by Taher Muhammad, Ali

    Published 2013
    “…When the same query is re-evaluated, the query engine collects the valid answers for the query at that moment and returns them by using the cached proof structure for the query. When the state of database is changed, the JTMS component propagates the effect of the change through its network to maintain the consistency of old proofs. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Secure multi-authority attribute-based encryption access control with cache-aware scheduling in mobile cloud computing

    Secure multi-authority attribute-based encryption access control with cache-aware scheduling in mobile cloud computing by Jamal, Fara

    Published 2021
    “…For the proposed scheme, the MTTD was very low which is 4.89 minutes, because of the consensus algorithm. Furthermore, by using the cache-aware scheduling, the proposed scheme managed to save 2.18% reads more than those of the existing work solution; this could reduce the time taken to access required data. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: