Browsing by Author "Talib, M."
Now showing items 1-4 of 4
-
Abusukhon, A.; Talib, M. (The Science and Information Organization Inc., http://ijacsa.thesai.org/, NaN, 2011)[more][less]
Abstract: In parallel (IR) systems, where a large-scale collection is indexed and searched, the query response time is limited by the time of the slowest node in the system. Thus distributing the load equally across the nodes is very important issue. Mainly there are two methods for collection indexing, namely document-based and term-based indexing. In term-based partitioning, the terms of the global index of a large-scale data collection are distributed or partitioned equally among nodes, and then a given query is divided into sub-queries and each sub-query is then directed to the relevant node. This provides high query throughput and concurrency but poor parallelism and load balance. In this paper, we introduce new methods for terms partitioning and then we compare the results from our methods with the results from the previous work with respect to load balance and query response time. URI: http://hdl.handle.net/10311/1068 Files in this item: 1
Talib_IJACSA_2011.pdf (325.8Kb) -
Ogwu, F.J.; Talib, M.; Aderounmu, G.A. (Science Publications, http://www.scipub.org/scipub/c4p.php?j_id=JCS, NaN, 2007)[more][less]
Abstract: This study presents a technique for improving the quality of service (QoS) guarantee in an ATM network. In the proposed model, it was assumed that high priority traffic have been allocated a switch resource to guarantee a given QoS and low priority cells are allowed to enter the buffer, to improve the exploitation of reserved resources. The proposed technique was backed up with an exact analytical model for evaluating the cell loss probability of high and low priority cells. The performance of the proposed model was evaluated using C++ programming language. The results of the simulation shows that the loss probability of both high and low cells reduces as the buffer capacity increase and that the performance of high priority cell is better than that of low priority cell. URI: http://hdl.handle.net/10311/818 Files in this item: 1
Ogwu_JCS11_2007.pdf (556.8Kb) -
Ogwu, F.J.; Talib, M.; Aderounmu, G.A. (Science Publications, http://www.scipub.org/scipub/c4p.php?j_id=JCS, NaN, 2007)[more][less]
Abstract: Recent works on Available Bit Rate (ABR) traffic control have generated efficient control schemes for ABR traffic on Asynchronous Transfer Mode (ATM) network. This study examines the improved performance envisaged if these control schemes adjust dynamically to the varying ABR bandwidth capacity in a stochastic manner instead of conventional deterministic approach. The performance difference between setting explicit rate deterministically for transmitting ABR sources and doing the same stochastically using a learning automaton is of particular interest. The learning automaton used is the Stochastic Estimator Learning Automaton (SELA). The performance difference is measured by comparing the congestion levels of the SELA-based control scheme with the reference deterministic control mechanism. Simulation results show that the stochastic estimator gives a better performance. The higher average congestion level experienced by the conventional deterministic approach is mainly due to the propagation time delay in the closed-loop feedback control schemes. URI: http://hdl.handle.net/10311/817 Files in this item: 1
Ogwu_JCS_2007.pdf (502.1Kb) -
Om, S.; Talib, M. (The Science and Information Organization Inc., www.ijacsa.thesai.org, NaN, 2011)[more][less]
Abstract: Security is always a major concern and a topic of hot discussion to users of Wireless Mesh Networks (WMNs). The open architecture of WMNs makes it very easy for malicious attackers to exploit the loopholes in the routing protocol. Cooperative Black-hole attack is a type of denial-of-service attack that sabotages the routing functions of the network layer in WMNs. In this paper we have focused on improving the security of one of the popular routing protocols among WMNs, Ad-hoc on demand distance vector (AODV) routing protocol and present a probable solution to this attack using Merkle hash tree. URI: http://hdl.handle.net/10311/1067 Files in this item: 1
Om_IJACSA_2011.pdf (294.4Kb)
Now showing items 1-4 of 4