oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 47 )

2018 ( 65 )

2017 ( 74 )

2016 ( 96 )

Custom range...

Search Results: 1 - 10 of 5481 matches for " SUHAIDI HASSAN "
All listed articles are free for downloading (OA Articles)
Page 1 /5481
Display every page Item
Analytical Comparison of Fairness Principles for Resource Sharing in Packet-Based Communication Networks
Yaser Miaji,Suhaidi Hassan
International Journal of Computer Science and Information Security , 2010,
Abstract: Current Internet users are enormously increased and application that they are using is magnificently bandwidth devoured. With this manner, Internet is no longer a fair and protective environment. The diversity in the Internet applications required a reconsideration of the mechanisms used to deliver each packet pass through a router in order to provide better fairness and more protective place. Furthermore, the observer of the Internet packet could easily identify the purpose of the delay which is indeed caused by the queuing in the output buffer of the router. Therefore, to reduce such delay for those sensitive applications such as real-time applications, scholars develop many fairness principle which by turn could improve the QoS and hence the fairness and the protection aspect. This study highlight most famous fairness principles used in the literature and some other novel ideas in the concept of fairness. The analytical comparison of these principles shows the weakness and the strength of each principle. Furthermore, it illuminates which fairness principle is more appropriate in which environment.
Breaking the Legend: Maxmin Fairness notion is no longer effective
Yaser Miaji,Suhaidi Hassan
International Journal on Applications of Graph Theory in Wireless ad hoc Networks and Sensor Networks , 2010,
Abstract: In this paper we analytically propose an alternative approach to achieve better fairness in schedulingmechanisms which could provide better quality of service particularly for real time application. Our proposaloppose the allocation of the bandwidth which adopted by all previous scheduling mechanism. It rather adopt theopposition approach be proposing the notion of Maxmin-charge which fairly distribute the congestion.Furthermore, analytical proposition of novel mechanism named as Just Queueing is been demonstrated.
Breaking the Legend: Maxmin Fairness notion is no longer effective
Yaser Miaji,Suhaidi Hassan
Computer Science , 2010, DOI: 10.5121/jgraphoc.2010.2203
Abstract: In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of the bandwidth which adopted by all previous scheduling mechanism. It rather adopt the opposition approach be proposing the notion of Maxmin-charge which fairly distribute the congestion. Furthermore, analytical proposition of novel mechanism named as Just Queueing is been demonstrated.
Breaking the Legend: Maxmin Fairness notion is no longer effective
Yaser Miaji,Suhaidi Hassan
Computer Science , 2010,
Abstract: In this paper we analytically propose an alternative approach to achieve better fairness in scheduling mechanisms which could provide better quality of service particularly for real time application. Our proposal oppose the allocation of the bandwidth which adopted by all previous scheduling mechanism. It rather adopt the opposition approach be proposing the notion of Maxmin-charge which fairly distribute the congestion. Furthermore, analytical proposition of novel mechanism named as Just Queueing is been demonstrated.
A NEW CONGESTION MANAGEMENT MECHANISM FOR NEXT GENERATION ROUTERS
MOHAMMED M. KADHUM,SUHAIDI HASSAN
Journal of Engineering Science and Technology , 2008,
Abstract: While computer networks go towards dealing with varied traffic types with different service requirements, there is a necessity for modern network control mechanisms that can control the network traffic to meet the users' service requirements. Optimizing the network utilization by improving the network performance can help to accommodate more users and thus increase operators’ profits. Controlling the congestion at the gateway leads to better performance of the network. Sending congestion signal sooner can be of great benefit to the TCP connection. In this paper, we propose Fast Congestion Notification (FCN) mechanism which is a new method for managing the gateway queues and fast sending of congestion signal to the sender. We tested our mechanism on Explicit Congestion Notification (ECN) packets which have higher priority; we achieved good results in terms of faster congestion signal propagation and better network utilization. Our analysis and simulations results show that the use of FCN over TCP connections sharing one bottleneck can improve the throughput, having less loss, less delay time, and better network utilization.
The Uniformization Process of the Fast Congestion Notification (FN)
Mohammed M. Kadhum,Suhaidi Hassan
Computer Science , 2009,
Abstract: Fast Congestion Notification (FN) is one of the proactive queue management mechanisms that practices congestion avoidance to help avoid the beginning of congestion by marking or dropping packets before the routers queue gets full; and exercises congestion control, when congestion avoidance fails, by increasing the rate of packet marking or dropping. Technically, FN avoids the queue overflows by controlling the instantaneous queue size below the optimal queue size, and control congestion by keeping the average arrival rate close to the outgoing link capacity. Upon arrival of each packet, FN uses the instantaneous queue size and the average arrival rate to calculate the packet marking or dropping probability. FN marks or drops packets at fairly regular intervals to avoid long intermarking intervals and clustered packet marks or drops. Too many marked or dropped packets close together can cause global synchronization, and also too long packet intermarking times between marked or dropped packets can cause large queue sizes and congestion. This paper shows how FN controls the queue size, avoids congestion, and reduces global synchronization by uniformizing marked or dropped packet intervals.
Survey on the Event Orderings Semantics Used for Distributed System
Yaser Miaji Osman Gazali,Suhaidi Hassan
International Journal of Computer Science & Information Technology , 2010,
Abstract: Event ordering in distributed system (DS) is disputable and proactive subjectin DS particularly with the emergence of multimedia synchronization. According to theliterature, different type of event ordering is used for different DS mode such asasynchronous or synchronous. Recently, there are several novel implementation of thesetypes introduced to fulfill the demand for establishing a certain order according to aspecific criterion in DS with lighter complexity.
Survey on the Event Orderings Semantics Used for Distributed System
Yaser Miaji Osman Gazali,Suhaidi Hassan
Computer Science , 2010, DOI: 10.5121/ijcsit.2010.2311
Abstract: Event ordering in distributed system (DS) is disputable and proactive subject in DS particularly with the emergence of multimedia synchronization. According to the literature, different type of event ordering is used for different DS mode such as asynchronous or synchronous. Recently, there are several novel implementation of these types introduced to fulfill the demand for establishing a certain order according to a specific criterion in DS with lighter complexity.
Trust Management in Cloud Computing: A Critical Review
Mohamed Firdhous,Osman Ghazali,Suhaidi Hassan
Computer Science , 2012,
Abstract: Cloud computing has been attracting the attention of several researchers both in the academia and the industry as it provides many opportunities for organizations by offering a range of computing services. For cloud computing to become widely adopted by both the enterprises and individuals, several issues have to be solved. A key issue that needs special attention is security of clouds, and trust management is an important component of cloud security. In this paper, the authors look at what trust is and how trust has been applied in distributed computing. Trust models proposed for various distributed system has then been summarized. The trust management systems proposed for cloud computing have been investigated with special emphasis on their capability, applicability in practical heterogonous cloud environment and implementabilty. Finally, the proposed models/systems have been compared with each other based on a selected set of cloud computing parameters in a table.
COGRADNET: UBIQUITOUS HETEROGENEOUS WIRELESS NETWORKS
MOHD HASBULLAH OMAR,SUHAIDI HASSAN,AHMAD HANIS MOHD SHABLI
Journal of Engineering Science and Technology , 2009,
Abstract: Mobile radio systems have shown rapid growth and hence increase the awareness for more efficient use of spectrum. With the advancements of technology, the development of radio systems that is dynamic and efficient in terms of spectrum usage can be realized. Cognitive radio system is one of the advancement that enhanced the adaptive capabilities of the systems that make the usage of spectrum more efficient, versatile and flexible. It also able to adapt their operations based on its internal and external factors by sensing its environment. The cognitive radio systems may be a solution for the spectrum scarcity faced by developer to tackle the issue of signal propagation and bigger coverage for broadband internet access. This paper will addressed the cognitive radio technology for ubiquitous broadband wireless internet access.
Page 1 /5481
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.