Browsing by Author "Aderounmu, Ganiyu A."

Now showing 1 - 7 of 7
  • No Thumbnail Available
    Item
    Open Access
    An adaptive fuzzy Information Retrieval model to improve response time perceived by e-commerce clients
    (2010-01) Ajayi, Anuoluwapo Olanrewaju; Aderounmu, Ganiyu A.; Soriyan, H.A.
    In this paper, an adaptive fuzzy logic-based information retrieval model is presented to enable users retrieve exact and specific information they sort after. The proposed IR model takes into consideration the limited bandwidth between ISP and its users; and the characteristics (processor speed, memory size, resolution, availability of anti-virus, etc.) of clients’ devices in ensuring that a customer has a fruitful and eventful session while conducting business online. The model was designed using unified modelling language and implemented using Borland JBuilder. A performance evaluation of the proposed information retrieval system using two evaluation measures was conducted. The experimental result indicated that the model has an acceptable performance.
  • No Thumbnail Available
    Item
    Open Access
    Developing a Feedback Model for Managing Congestion in Packet Switched Wide Area Networks.
    (Springer Link, 2010-01) Ogbimi, E.F.; Aderounmu, Ganiyu A.; Oluwatope, Ayodeji
    The objectives of the paper was to design a feedback model for congestion control in packet switched WAN and carry out the performance evaluation of the model. A feedback approach was generated by designing a feedback model. Control theory was used to assess the stability of thebandwidth. The stability of flow of bandwidth was determined by finding the transfer function of the routers. A fluid flow model was developed using a queuing model. Secondly, the flow of bandwidth was optimized and the stability was checked. The conditions for stability in a packet switched WAN were established.
  • Thumbnail Image
    Item
    Open Access
    A Dynamic Traffic Shaping Technique for a Scalable QoS in ATM Networks
    (The International Arab Journal of Information Technologyj, 2008-10) Ogwu, Francis Joseph; Mohammad, Talib; Aderounmu, Ganiyu A.; Onifade, Olufade Falade Williams
    Traffic shaping function becomes imperative for the new broadband services that are being deployed in order to avoid information loss, to provide the end users multiple traffic options in terms of bandwidth and to ensure optimal use of the communication channels. To simultaneously manage the amount of cell loss and delay experienced by two or more classes of service categories constant bit rate/ variable bit rate, we developed a new buffer partitioning scheme tagged complete sharing with gradual release. The proposed model was combined with a scheduling method known as weighted round robin with absolute increment. An analytical model was developed for the proposed buffer partition to dynamically monitor and determine the output mean rate of the classes of service present, and the individual mean rate of the class of service. The model was simulated and performance evaluation carried out. The result thus obtained depicts a better performance as a method of traffic shaper in a multi-quality of service traffic over asynchronous transfer mode networks.
  • No Thumbnail Available
    Item
    Open Access
    An Improved Data Clustering Algorithm for Mining Web Documents
    (2010-12) Odukoya, O. H.; Aderounmu, Ganiyu A.; Adagunodo, E. R.
    This paper formulates, simulates and assess an improved data clustering algorithm for mining web documents with a view to preserving their conceptual similarities and eliminating the problem of speed while increasing accuracy. The improved data clustering algorithm was formulated using the concept of K-means algorithm. Real and artificial datasets were used to test the proposed and existing algorithm. The proposed algorithm was simulated using the fuzzy logic and statistical toolbox in Matlab 7.0. The simulated results were compared with the existing data clustering algorithm using accuracy, response time, adjusted rand index and entropy as performance parameters. The results show an improved data clustering algorithm with a new initialization method based on finding a set of medians extracted from a dimension with maximum variances. The results of the simulation showed that the accuracy is at its peak when the number of clusters is 3 and reduces as the number of clusters increases. When compared with existing algorithm, the proposed clustering algorithm showed an accuracy of 89.3% while the existing had an accuracy of 88.9%. The entropy was stable for both algorithms with a value of 0.2485 at k = 3. This also decreases as the number of clusters increase until when the number of clusters reached eight where it increased slightly. The adjusted rand index values varied from 0 to 1 for both clustering algorithms. The existing method achieved a value of 53% as compared with the proposed method which achieved an adjusted rand index value of 63.7%, when the number of clusters was five. In addition, the response time decreased from 0.0451 seconds to 0.0439 seconds when the number of clusters was three. This showed that the proposed data clustering algorithm decreased by 2.7% in response time as compared to the K-means data clustering. This study has shown that the proposed data clustering algorithm could be adapted by web search engine developers for more efficient web sea- - rch result clustering.
  • Thumbnail Image
    Item
    Open Access
    Lightweight Agents, Intelligent Mobile Agent and RPC Schemes: A Comparative Analysis.
    (2010-01) Olajubu, Emmanuel; Ajayi, Anuoluwapo Olanrewaju; Aderounmu, Ganiyu A.
    This paper presents the performance comparison of Lightweight Agents, Single Mobile Intelligent Agents and Remote Procedure Call which are tools for implementing communication in a distributed computing environment. Routing algorithms for each scheme is modeled based on TSP. The performance comparison among the three schemes is based on bandwidth overhead with retransmission, system throughput and system latency. The mathematical model for each performance metric is presented, from which mathematical model is derived for each scheme for comparison. The simulation results show that the LWAs has better performance than the other two schemes in terms of small bandwidth retransmission overhead, high system throughput and low system latency. The Bernoulli random variable is used to model the failure rate of the simulated network which is assumed to have probability of success p = 85% and the probability of failure q = 15%. The network availability is realized by multiplicative pseudorandom number generator during the simulation. The results of simulation are presented.
  • Thumbnail Image
    Item
    Open Access
    A Load Balancing Policy for Distributed Web Service
    (Scientific Research, 2010-01) Eludiora, Safiriyu Ijiyemi; Aderounmu, Ganiyu A.; Abiona, Olatunde; Oluwatope, Ayodeji; Onime, Clement E.; Kehinde, L. O.
    he proliferation of web services; and users appeal for high scalability, availability and reliability of web servers to provide rapid response and high throughput for the Clients’ requests occurring at anytime. Distributed Web Servers (DWSs) provide an effective solution for improving the quality of web services. This paper addresses un-regulated jobs/tasks migration among the servers. Considering distributed web services with several servers running, a lot of bandwidth is wasted due to unnecessary job migration. Having considered bandwidth optimization, it is important to develop a policy that will address the bandwidth consumption while loads/tasks are being transferred among the servers. The goal of this work is to regulate this movement to minimize bandwidth consumption. From literatures, little or no attention was given to this problem, making it difficult to implement some of these policies/schemes in bandwidth scarce environment. Our policy “Cooperative Adaptive Symmetrical Initiated Dynamic/Diffusion (CASID)” was developed using Java Development Environment (JADE) a middle ware service oriented environment which is agent-based. The software was used to simulate events (jobs distribution) on the servers. With no job transfer allowed when all servers are busy, any over loaded server process jobs internally to completion. We achieved this by having two different agents; static cognitive agents and dynamic cognitive agents. The results were compared with the existing schemes. CASID policy outperforms PLB scheme in terms of response time and system throughput.
  • No Thumbnail Available
    Item
    Open Access
    Network resources management in a multi-agent system: A simulative approach
    (2010-10) Olajubu, Emmanuel; Aderounmu, Ganiyu A.; Adagunodo, Emmanuel R.
    Multi-agent systems (i.e. systems comprising many agents) have been proposed for many Internet and distributed applications. The proposed systems have little or no consideration of the effects of this multi-agent approach on network resources. In this paper, we presented a simulation assessment of the effect of multi-agent systems on network resources. The routing scheme of the agents was formulated based on the travelling salesman problem. Lightweight agent (LWA) controller was modelled using a fuzzy logic toolbox in the MATLAB environment. The performance metrics of bandwidth usage, response time and throughput were used to compare the network resources usage by different groups of LWAs (10 LWAs, 40 LWAs, 100 LWAs, 150 LWAs) during their computational task on the network. Java programs were written for the implementation of lightweight agents in the simulation. The inputs to the system were realised by multiplicative pseudorandom number generation during the simulation. The simulation result analysis was carried out based on the performance metrics stated above for the four groups of agents. Increasing the number of LWAs in a simulated multi-agent system decreased the response time but increased the throughput and the bandwidth usage. All these performance measures should be considered for developing countries with bandwidth shortages, because having too many agents in a multi-agent system could result in bandwidth wastages.