Volume 3, Issue 3, March 2012

Improved Live VM Migration using LRU and Splay Tree Algorithm
Pages: 1-7 (7) | [Full Text] PDF (594 K)
Ei Phyu Zaw and Ni Lar Thein
University of Computer Studies, Yangon, Myanmar

Abstract -
Live migration is a technology with which an entire running virtual machine (VM) is moved from one physical machine to another. Migration at the level of an entire VM means that in-memory state can be transferred in a consistent and efficient fashion. In pre-copy approach that is mainly used in live migration, total migration time which affect on the performance of VM, is prolonged by iterative copy operations and the significant amount of transferred data during the whole migration process. In this paper, we presented a framework that includes pre-processing phase in traditional pre-copy based live migration for reducing the amount of transferred data. In pre-processing phase, we propose the prediction working set algorithm. Applying the proposed algorithm which combined LRU (Least Recent Used) cache with splay tree algorithm, the system can reduce the amount transferred memory page. We evaluated the effectiveness of the working set prediction algorithm with various workloads. Experiment demonstrates that compared with XEN’s default pre-copy based migration algorithm, the proposed framework can reduce 23.67% of the total data transferred during migration and 11.45% of total migration time on average.
 Index Terms - Least Recently Used (LRU), Pre-Copy Based Live Migration, Total Migration Time and Virtual Machine
Co-Scheduling in Lambda Grid Systems by using of Ant Colony Optimization
Pages: 8-14 (7) | [Full Text] PDF (785 K)
Debabrata Singh, Milu Acharya and Soumya Das
ITER, SOA University, Bhubaneswar, Orissa, India

Abstract -
Grid networks provide users with a transparent way to access computational and storage resources. The creation of high performance Communication capabilities in multiple organizations and their interconnection in to a high speed fiber communications mesh have been described as Lambda Grid. We propose a modified ACO-based algorithm which can provided on-demand and dynamically light paths on a grid system. Indeed, the proposed algorithm can schedule jobs by discovering processing and network resources on the grid, assigning the job to a specific system and executing the job. We also propose a co-scheduling lambda grid system for job routing in optical grid networks, based on the concept of ant colony optimization, which studies the behavior of ants for gathering food and the routing of packets inside a network. Simulated results show an increased performance of our algorithms over more classical co-scheduling protocols, even though this is accompanied by a slight increase in complexity.
 Index Terms - GMPLS-Controlled, ACO, RSVP-TE, BADR and CLL
Handover Decision Based on User Preferences in Heterogeneous Wireless Networks
Pages: 15-20 (6) | [Full Text] PDF (522 K)
Abdoul-Aziz Issaka Hassane, Li Renfa and Zeng Fanzi
College of Information Science and Engineering, Hunan University, China

Abstract -
A handover decision is a significant problem, in next generation of wireless networks (4G). This is exacerbated when the Handoff decision is driven by user preferences (mainly transmission cost and wireless interface power consumption), wireless environment constraints (access network availability and properties and client communication capabilities). In this paper we present a handoff decision based on user preferences which consider not only the traditional handover decision factor (RSS) but also user preferences, user profiles and other requirements. We introduce APBSW (Access Point Best Satisfied Weights) for selecting access network; our proposed methods, UPHO (User Preference Handoff) use a fuzzy logic-based inference system to process all appropriate context information, which satisfy the best user preferences. The simulation result show that UPHO algorithm performs better than other handover decision algorithm in terms of user preferences satisfaction.
 Index Terms - Always-Best-Satisfying (ABS), APBSW (Access Point Best Satisfied Weights), Heterogeneous Wireless Network, Fuzzy Logic-based Inference system and Vertical Handoff
Task Scheduling using Performance Effective Genetic Algorithm for Parallel Heterogeneous System
Pages: 21-26 (6) | [Full Text] PDF (541 K)
Jasbir Singh and Gurvinder Singh
Department of Computer Science and IT, Guru Gobind Singh Khalsa College, Sarhali (Tarn Taran), Punjab-India
Department of Computer Science and Engineering, Guru Nanak Dev University (Amritsar), Punjab-India

Abstract -
The scheduling problem deals with the optimal assignment of a set of tasks onto parallel multiprocessor system and orders their execution so that the total completion time is minimized. The efficient execution of the schedule on parallel multiprocessor system takes the structure of the application and the performance characteristics of the proposed algorithm. Many heuristics and approximation algorithms have been proposed to fulfill the scheduling task. It is well known NP-complete problem. This study proposes a genetic based approach to schedule parallel tasks on heterogeneous parallel multiprocessor system. The scheduling problem considered in this study includes - next to search for an optimal mapping of the task and their sequence of execution and also search for an optimal configuration of the parallel system. An approach for the simultaneous optimization of all these three components of scheduling method using performance effective genetic algorithm is presented and its performance is evaluated in comparison with the First Come First Serve (FCFS), Shortest Job First (SJF) and Round Robin (RR) scheduling methods.
 Index Terms - First Come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), Performance Effective Genetic Algorithm (PEGA), Directed Acyclic Graph (DAG), Heterogeneous Processor and Simultaneous Optimization
Chaos Based Secure Real Time Protocol (CSRTP)
Pages: 27-35 (9) | [Full Text] PDF (524 K)
Mazen Tawfik Mohammed, Alaa Eldin Rohiem and Ali El-moghazy
MTC College, Egypt

Abstract -
Secure Real-time Transport Protocol (SRTP) provides confidentiality, message authentication, and replay protection for the Real-time Transport Protocol (RTP) traffic. There are common encryption algorithms that have been developed to protect data such as advanced encryption algorithm (AES). Chaotic encryption is new trend in cryptography based on chaos theory. Chaos is a class of complex behaviors that can emerge from nonlinear dynamical systems. A distinctive and readily observable property of chaotic systems is sensitive dependence on initial conditions. The main purpose of this paper is to propose an alternative scheme to provide confidentiality in SRTP using chaotic systems. The proposed scheme is implemented using Microsoft open source project for conference. The Chaos Based SRTP (CSRTP) is tested using StsGui NIST Statistical suite and Cryptool software [3] for security while Wireshark [4] is used for quality of service (QoS) analysis. The results related to CSRTP shows its superiority in terms of confidentiality and quality of service (QoS) compared with conventional SRTP protocol.
 Index Terms - Chaos, Real-Time Transport Protocol (RTP), Real-Time Transport Control Protocol (RTCP), Secure Real-time Transport Protocol (SRTP), Advanced Encryption Standard (AES), Authentication and Integrity
Evolution of Grid-GIS Systems
Pages: 36-40 (5) | [Full Text] PDF (226 K)
Hari Singh and Seema Bawa
N.C. College of Engineering, Panipat, Haryana, India
Thapar University, Patiala, Punjab, India

Abstract -
Grid is the collection of heterogeneous resources, providing good opportunities for the users of virtual organizations forming a Grid for coordinated resource sharing and problem sharing. Much Grid middleware software exists for implementing a Grid framework. Apart from many application areas of Grid Computing, Geographic Information System has been an emerging application area for Grid Technology in recent time. In this paper, the developments in the field of Grid-GIS are discussed after a brief overview of Grid Computing and GIS separately. Some observations are also discussed in the concluding section of the paper.
 Index Terms - Grid Computing, GIS, Web-GIS and Grid-GIS
Ubiquitous Computing (UC) for Discovery Service Technologies used in Location Detection and Self Therapeutic Services for Healthcare Systems in u-Health
Pages: 41-43 (3) | [Full Text] PDF (339 K)
B.Shanmugasundaram, E. Udaya Sanakara Reddy and B. Janani
Department of CSE, Gojan School of Business and Technology, Chennai, India

Abstract -
Ubiquitous computing introduces inimitable requirements for the discovery technique prototype, which lets services and devices become aware of each other without explicit human administration. The vision of ubiquitous computing has been described in terms of the disappearing computer. In this vision, we are free to focus on the interactions of daily life in various domain, rather than attending to the technology assisting us in those interactions, for example in UC discovery service technologies used in location detection and self therapeutic services in healthcare systems. The machine (while perhaps not literally invisible) becomes a tool much like a hammer or pen, easily appropriated and used as second nature. Discovery lets services and devices spontaneously become aware of the availability and capability of peers on the network without explicit administration. In practice, this means that a client can discover and potentially use a device without prior knowledge of it. Although discovery is a necessary component of ubiquitous computing, the wide range of discovery systems in use today reflects the varied needs of the communities from which they originated.
 Index Terms - Ubiquitous Computing, Service Technologies, u-Health Care and Health BAN
Layered Secure Pattern for Amending Intrusion Detection
Pages: 44-50 (7) | [Full Text] PDF (604 K)
Subha Sree Mallela and Sravan Kumar Jonnalagadda
Department of CSE, DMSSVH College of Engineering, Machilipatnam, AP., India
Department of IT, DMSSVH College of Engineering, Machilipatnam, AP., India

Abstract -
The growth of data communications has involved an increase in unauthorized accesses and data manipulation with the resulting security violations. Many methods have been developed to secure the network infrastructure and communication over the Internet. Since it is impossible to predict and identify all the vulnerabilities of a network, and penetration into a system by malicious intruders cannot always be prevented, intrusion detection systems (IDSs) are essential entities for ensuring the security of a networked system. An IDS is software (or hardware) designed to detect unwanted attempts at accessing, manipulating, or disabling of computer systems, mainly through a network. However, an accurate system that cannot handle large amount of network traffic and is slow in decision making will not fulfil the purpose of an intrusion detection system. In this paper, we present a layered framework for building intrusion detection systems which can detect a wide variety of attacks reliably and efficiently when compared to the traditional network intrusion detection systems. Another advantage of this Layer based Intrusion Detection System (LIDS) framework is that it is very general and easily customizable depending upon the specific requirements of individual networks. We, thus, address these shortcomings and develop better intrusion detection systems which are accurate in attack detection, efficient in operation and have wide attack detection coverage.
 Index Terms - Intrusion Detection, Hybrid System, Anomaly, Layered Approach, Probe Attack and Logging System
Approach to Software Maintainability Prediction versus Performance
Pages: 51-54 (4) | [Full Text] PDF (228 K)
Ram Kumar Singh, Amit Asthana and Deepak Kumar Singh
S.I.T.E, Swami Vivekanand Subharti University, Meerut, India

Abstract -
The value of a software system results from the interaction between its functionality and quality attribute (performance, reliability and security) and the market-place. The software maintainability is viewed considered as an inevitable evolution procedure driven through maintenance demeanor. Traditional product cost model have focused on the short term development cost of the software product. A Hidden Markov Model is applied to simulate the maintenance demeanor demonstrated as their potential occurrence probabilities. The software metric function is the measurement of the software quality products and its measurements results of a software product existence delivered combined to from health index of the software product. When the occurrence probabilities of maintenance demeanor reach certain number which is calculate as the denotation of worsening position of software product, the software product can be considered as obsolete. The longer time, more beneficial the maintainability would be. We believe on the architectural approach to price-modeling will be able to capture these concerns so that the software can reason about the risk I the system and price of mitigating them.
 Index Terms - Software Maintainability, Hidden Markov Model, Performance Modes between Availability and Software Metrics
Automatic Generation Control of Multi Area Power System using ANN Controller
Pages: 55-59 (5) | [Full Text] PDF (355 K)
Akanksha Sharma, K.P. Singh Parmar and Dr.S.K. Gupta
Deenbandhu Chottu Ram University of Science and Technology, Murthal, Sonipat, Haryana, India
Centre for Advanced Management & Power Studies, National Power Training Institute, Faridabad, Haryana, India
Electrical Department, Deenbandhu Chottu Ram University of Science and Technology, Murthal, Sonipat, Haryana, India

Abstract -
In this paper an Artificial Neural Network (ANN) based controller is presented for the Automatic Generation Control (AGC) of a five area interconnected power system with reheat turbines. The control scheme guarantees that steady state error of the area frequencies and inadvertent interchange of tie-lines are maintained in a given tolerance limit. ANN controller controls the inputs of each area in the power system together. In this study, back propagation algorithm is used as neural network learning rule. The performance of the power system is evaluated by comparing with conventional Integral controller. The ANN controller gives much better results as compared to that of Integral controller.
 Index Terms - Automatic Generation Control (AGC), Artificial Neural Network (ANN), Back Propagation Algorithm and Power System
A Survey of Wireless Sensor Network- Software Architecture Design Issues
Pages: 60-63 (4) | [Full Text] PDF (260 K)
Zaheer Aslam, Nauman Qamar, Noor Khan, Shehzad Rizwan, Kamal Ahmad, Noor Zaman, Shafiullah and Rashid Zubair
Gandhara University of Sciences, Peshawar, Pakistan

Abstract -
Since Wireless Sensor Networks (WSN) formulate the recent research into some advances to enable progression in the field of software and hardware technologies. Hence, in this research work, we study the performance and behavior of wireless sensor networks (WSN) in terms of effectiveness of system requirements on the resulting software architecture. As WSN currently faces a challenge due to rapid development in software technology and thus requires some new techniques for programming and tools.
 Index Terms - WSN, Architecture, Issues, Analysis and Software
Performance Evaluation of Geographical Routing Protocol under Different Traffic Scenario
Pages: 64-67 (4) | [Full Text] PDF (314 K)
Tamizhselvi. A., and R. S. D. Wahida Banu
Anna University of Technology, Coimbatore, India
Government College of Engineering, Bargur, Tamil Nadu, India

Abstract -
Vehicular Adhoc Network (VANET) has attracted lot of research effort due to its applicability in the areas of road safety, infotainment and driving experience obtainable at a very low cost. Being a wireless network, issues in VANET domain include random packet loss in transport layer and in data link layer for a given end to end connection. The losses are dependent on the speed at which the nodes are moving within the network, the routing protocol used and the available channel. In this paper it is proposed to investigate the performance of Geographical Routing Protocol (GRP) under random mobility with voice and traffic.
 Index Terms - VANET, MANET, Mobility Models, Throughput and End-to-End Delay
Mobile Multimedia Storage: A Mobile Cloud Computing Application and Analysis
Pages: 68-71 (4) | [Full Text] PDF (244 K)
Muhammad Shahab Khan, Nauman Qamar, Muhammad Asif Khan, Fahad Masood, Muhammad Sohaib, Noor Khan, Mujahid Shah and Syed Aytizaz Ahmed
Gandhara University of Sciences, Peshawar, Pakistan

Abstract -
During the last few years, there is a revolutionary development in the field of mobile computing, multimedia communication and wireless technology. In this paper, we present study and comparative analyses of different technologies used for mobile multimedia storage and address different issues regarding its architecture and design; especially in cloud computing environment and suggest some solution for its improvements.
 Index Terms - Application, Analysis, Cloud Computing, Storage and Multimedia
A Reliable Data Transmission Approach to Prevent Black Hole Attack in MANET
Pages: 72-76 (5) | [Full Text] PDF (415 K)
K. Selvavinayaki and Dr. E. Karthikeyan
Bharathiar university, Coimbatore, India
Department of Computer Science, Govt. Arts College, Udumalpet, India

Abstract -
The dynamic nature of infrastructure in Manet makes security as a critical issue. The security of the network can be improved by preventing the black hole attack in manet by enhancing the data confidentiality and reliability . One of the way to achieve this is to protect the messages from being compromised when they are delivered over the insecure network .This paper focuses on protecting the data from compromised nodes by dividing the data in to multiple shares. Each message is encoded by a public key and then transferred over multiple paths. Destination receiving the multiple shares will integrate into original message. The optimal option of multiple path routing protocol is MAOMDV where the secret sharing schemes and message shares can be optimally allocated on each path to provide maximum security. The Algorithm is implemented on NS2 simulator. The results show that algorithm implemented on MAOMDV is more secure and provide high degree of reliability.
 Index Terms - Black Hole Attack, MAOMDV, Secret Sharing Scheme and Reliability