Earticle

An evolving fuzzy-neural rule with slack diversification is proposed in the present work to improve the performance of job dispatching in a wafer fabrication factory. The evolving fuzzy-neural rule is a modification from the two-factor tailored nonlinear fluctuation smoothing rule for mean cycle time (2f-TNFSMCT) by diversifying the slack values of jobs to be dispatched dynamically, which has been shown to be conducive to the performance in several previous studies. After evaluation of the proposed rule, some evidence was gained to support its effectiveness. Based on the findings in this research we also derived several directions that can be exploited in the future.

Scheduling independent tasks to homogeneous resources is an ineluctable issue to be dealt with. Load balancing of resources is a crucial matter of concern. This paper comes out with an enhancement of hierarchical load balancing algorithm. In this paper, to evaluate cluster imbalance, probability of deviation of average system load from average load of cluster is calculated and checked for confinement within a defined range of 0 to 1. The algorithm also compares the expected computing power of jobs with average computing power of clusters to allocate fittest resources to jobs. In addition to the load balancing and fittest resource allocation, the contribution of our algorithm is twofold. Our algorithm ensures that no cluster remain idle by employing random stealing and random pushing, whereby jobs are taken from other clusters and executed in cluster with empty queue such that the queue length remains within a fixed threshold. The contributions of augmented hierarchical load balancing with intelligence is that it reduces the makespan of algorithm execution together with balancing the overall system load and reduces the idle time of clusters.

As wireless technology widely spreads and invites its development with changes in wireless network system which supports rapid transmission, defects in security are, however, constantly witnessed. As a result, these problems have called for the needs to strengthen the hole in the technology. Though it seems that security issues between wireless communication are solved with the adoption of IEEE 802.11i as a standard, numerous attacks targeted for vulnerability of wireless mobile are increasing these days. When accesses to wireless AP from server-based, or client-based authentication, either of them determines an authorization status for use. A number of measures to prevent external attacks or information leakages are presented through the use of authorized wireless AP. Still, both server-based and client-based authentication have not only low confidentiality to external network but low solubility to a wireless AP packet which is unauthorized. In this paper, we use MAC Address to get authentication from an AP. It searches the NDIS Intermediate Driver from the wireless network card, and then controls the packets after operating the scope of IP and PORT. After having implemented the proposed model here, we came to conclusion that it is possible to solve the drawbacks of server-based authentication in security and cost. Also it showed that the proposed model enhances solubility and scalability of client-based authentication.

Users and resources frequently join and leave computational grid, hence the state of the grid changes dynamically. So, an effective job scheduling strategy is needed that consider the dynamically changed conditions in the grid. Most of the existing scheduling strategies are mainly based on selecting resources that have less resource response time or less grid bandwidth while these resources may be out of date at the scheduling time. This paper proposes a scheduling strategy with the objective of minimizing the effects of grid dynamism on the grid performance. The strategy schedules jobs to the resources according to status update timing combined with response time of the resources. The proposed strategy is compared with the time-based strategy in terms of the number of jobs executed successfully within the specified deadline and the makespan of user applications. Experimental results have shown that the proposed strategy can considerably improve the performance of the grid.

Broadcast Encryption(BE) have been widely used to pay TV, distributed systems and oth- ers. In general concept of this encryption, most BE schemes have to broadcast all packets to all network because of intermediate nodes cannot know accurate nodes needing broadcasted packets due to encryption. In this paper, we propose Half-Broadcast Encryption(HBE). Re- cently, a number of distributed systems have been designed as hierarchical model composed of several levels. In the model, HBE communicates as top-down with reducing logwgbn traf- c than general broadcast encryption. In the proposed scheme, intermediate nodes decides whether they broadcast received packets with protecting anonymity of destinations. For the reason, HBE can reduce the packets over the network to more than half due to exible broadcasting without any identity of destination.