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

Refine Results
  1. 1

    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
  2. 2
  3. 3

    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
  4. 4
  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 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
  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 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
  7. 7

    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
  8. 8

    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
  9. 9
  10. 10

    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
  11. 11

    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
  12. 12

    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
  13. 13

    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
  14. 14

    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
  15. 15

    RSA Encryption & Decryption using JAVA by Ramli, Marliyana

    Published 2006
    “…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
    Get full text
    Get full text
    Final Year Project
  16. 16

    Provider independent cryptographic tools by Ibrahim, Subariah, Salleh, Mazleena, Abdul Aziz, Shah Rizan

    Published 2003
    “…The library is implemented by using Java cryptographic service provider framework that conforms to Java Cryptographic Architecture (JCA) and Java Cryptographic Extension (JCE). …”
    Get full text
    Get full text
    Get full text
    Monograph
  17. 17

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm by Norulazmi, Kasim

    Published 2008
    “…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…We hyave used the CPU profiler of Oracle JavaTM VisualVM to monitor the execution of LRE-TL as well as USG algorithms. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    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