Computer Science And Technology - Master Dissertation

Permanent URI for this collection

http://10.2.3.109/handle/32116/80

Browse

Now showing 1 - 18 of 18

A Novel Approach for Information Hiding in Punjabi Language
(Central University of Punjab, 2016) Kumar, Arun; Kaur, Amandeep
The Internet is global in scope and rapidly growing. With this growth, internet security threats are also increasing. The Internet is the global information exchange media, which is open and insecure, needs more and better security provision. In the era of computer network virtually all business, government and academic organizations interconnect their local area network with a collection of interconnected networks. Data transmission in a public communication system is not secure because of interception and improper manipulation by an opponent Therefore, the attractive solution for this problem is steganography, which is the art and science of writing concealed messages in such a way that no one, apart from the sender and intend recipient, can notice the existence of the message. Thus, confidentiality and integrity principle of security can be achieved. There have been wide ranges of algorithms introduced using a text file as cover media. This thesis explains a two layered hiding technique that provides high security than other techniques. The use of local language ensures more security to the information exchange as the awareness of the local language is limited. The proposed approach uses the local language Punjabi as cover text. In proposed approach, the cover media is pre-existing media, not system generated media. Therefore, a user will be free to use the cover media taken from any Punjabi newspaper, magazine or book and the syntax of a sentence and sequence of sentence both will be true grammatically. Even though the opponent has a very good command on the Punjabi language, they will not found any suspicious.
Devising a Feature Matching Algorithm for Pharmacophore Modelling.
(Central University of Punjab, 2015) Mahato, Suchismita; Jain, AK
Feature Matching is one of the central issues of model-based recognition and an important component of most object recognition systems. The feature matching technique can be applied in image alignment, 3D secure reconstruction, motion tracking, object recognition and in pharmacophore based molecular alignment. Even though numerous algorithms exist for feature recognition and search yet the efficiency of these have considerable room for improvement. This has necessitated a continuous search for better performing algorithms. The combination of geometric hashing technique and tolerance limits for a given set of known interactions can be used for the pharmacophore modelling based search. The algorithm proposed is precise as compared with the previous existing algorithms. This algorithm is better in its runtime complexity.
DWT-SVD Based robust digital image watermarking using adaptive median filter
(Central University of Punjab, 2013) Kumar, Ashok; Brar, Sukhreet Singh
Feature Matching is one of the central issues of model-based recognition and an important component of most object recognition systems. The feature matching technique can be applied in image alignment, 3D secure reconstruction, motion tracking, object recognition and in pharmacophore based molecular alignment. Even though numerous algorithms exist for feature recognition and search yet the efficiency of these have considerable room for improvement. This has necessitated a continuous search for better performing algorithms. The combination of geometric hashing technique and tolerance limits for a given set of known interactions can be used for the pharmacophore modelling based search. The algorithm proposed is precise as compared with the previous existing algorithms. This algorithm is better in its runtime complexity.
Performance analysis of aodv for wormhole attack using different mobility models
(Central University of Punjab, 2014) Kaur, Gurmeet; Kaur, Amanpreet
Mobile Ad-Hoc Network (MANET) is a type of temporary wireless network, in which the nodes are mobile and have dynamic network topology. According to structural arrangement, wireless networks are classified into two main types: fixed infrastructure wireless networks and non-infrastructure wireless networks. Mobile Ad-Hoc Networks (MANETs) fall under the type of infrastructure less wireless networks. Mobile nodes can communicate to each other through wireless links in this type of an autonomous system. At any time, whenever required nodes can join or leave the network as nodes are free to move. Although various routing protocols are used in the communication process but those protocols have numerous security complexities. An intruder can perform many attacks (both active and passive attacks) through different security flaws. Wormhole attack is an active attack in the context of mobile ad-hoc networks that disrupts the normal routing functioning of any routing protocol. In this work, an attempt has been made to analyze and compare the performance of demand oriented or reactive routing protocol: Ad-hoc On Demand Distance Vector (AODV) with two approaches: AODV without wormhole attack and AODV under attack using two mobility models viz. Random Way Point Model and Reference Point Group Mobility Model. Evaluation of two examined approaches has been done in terms of performance metrics such as Average Throughput, PDR (Packet Delivery Ratio), Jitter, Average End to End Delay and Packet Drop Rate. An approach has also been used to analyze participated malicious nodes in the wormhole peer list. Along with this, the attack has been detected with the help of metrics such as Average Throughput, Average End to End Delay, Jitter and Packet Delivery Ratio.
Performance evaluation of manet routing protocols dsdv, tora enhanced tora
(Central University of Punjab, 2014) Kaur, Amandeep; Meenakshi
Wireless Networking has become the phrase du jour these days because of an attractive number of benefits it offers to the end users, by enabling them to access and share a wide pool of resources and information across the globe. Mobile ad hoc networks (MANETs) are a kind of infrastructure less wireless networks in which all the nodes act as peers and themselves configure the network. Mobile ad hoc networks are an open area of research because of its applicability in a number of areas like tactical networks, emergency services and education. One of the major challenges in networking is the efficient, accurate, reliable, secure and immediate delivery of data from source to destination. Therefore, the efficient routing of data across the mobile ad hoc network is a major concern of researchers all over the world. Several routing protocols have been developed to send data efficiently across mobile ad hoc networks. These protocols have been divided into three categories- Proactive, Reactive and Hybrid. The performance evaluation of these protocols has been going on since a long time. Most of the current research focuses on the pause times, simulation times and network size to measure the performance of various mobile ad hoc network routing protocols. A very few work has been done on the performance analysis of protocols by varying the underlying mobility models and traffic patterns. This dissertation work is focused on the improvement of the poor performance of TORA with the rise in number of traffic connections. This behavior has been credited to the link sensing mechanism of Internet MANET Encapsulation protocol (IMEP). IMEP is a multi-purpose network-layer protocol that supports the operation of many routing protocols including TORA. It provides mechanism for sensing the status of links in TORA. This link sensing mechanism has been investigated and proposed modification by K. H. Lim and A. Datta has been implemented to observe improvement in the overall performance of Enhanced-TORA protocol in comparison with original TORA. iv Through this research, investigations have been made into the behavior of DSDV, and TORA mobile ad hoc routing protocols by varying the underlying mobility models (Random Waypoint, Random Direction and Manhattan Grid model) and Traffic patterns (FTP, TELNET, HTTP). The metrics used to analyze the performance are Throughput, Average End to End delay, Routing overhead, Packet Delivery Ratio and Packet Loss. This research draws an analysis whether under which mobility model and traffic pattern combination these protocols give the best performance. Results show that DSDV gives best performance under Manhattan Grid Mobility model and FTP traffic pattern. Whereas, TORA and Enhanced-TORA give best performance under Random Direction Mobility model and FTP traffic. The performance of Enhanced-TORA is then compared with original TORA using 10 traffic connections under Random Direction mobility model and FTP Traffic and it was observed that Enhanced-TORA outperformed original TORA thereby eliminating the problem of performance degradation with rise in number of connections
Performance evaluation of AODV based congestion control protocols in manet
(Central University of Punjab, 2014) Bhatia, Bandana; Sood, Neha
The network in which the users communicate with each other by forming a temporary network without any centralized administration is known as ad hoc network. Every node in ad hoc network acts both as a host as well as a router. The topology of these networks is highly deployable, dynamic and self-configurable. Because of the dynamic topology of Mobile Ad hoc Networks (MANETs), routing is an extremely challenging task in them. For ensuring reliable and efficient routing in MANETs, different routing protocols are defined. These routing protocols may follow proactive, reactive or hybrid approach. As many number of mobile nodes are transmitting the packets over the network, the chances of losing the packets over the network increases to a great extent due to link failures or may be due to congestion over the network because of large traffic flowing over the network. Also, when the size of data packets increases, it may lead to the congestion over the network which ultimately leads to the loss of packets. The existing routing protocols for MANETs do not support congestion control as they are not congestion adaptive. Many authors have proposed protocols based on Ad hoc On demand Distance Vector Routing Protocol (AODV) which are congestion adaptive and deal with the congestion over the network. This dissertation work discusses the congestion control protocols in MANETs and focuses on two congestion control protocols, AODV-I and EDAODV. Simulation results are gathered for AODV, AODV-I and EDAODV by varying the number of nodes and size of the data packets for four performance metrics, namely, routing overhead, throughput, end- to-end delay and packet delivery ratio (PDR).
Performance analysis of spin protocol under different security threats in wireless sensor networks
(Central University of Punjab, 2014) Choudhary, Rohit; Kaur, Amanpreet
The wireless sensor network consists of homogenous sensor nodes with limited energy and computational power which are self organisable. These nodes use radio frequency channels to communicate with each other wirelessly. Besides that wireless sensor networks are resource constrained with low energy and low bandwidth along with shorter communication range. The evolution of VLSI circuit technology has also enabled the development of wireless sensor networks. The ease of deployment and low cost availability of sensor devices has attracted much advancement in wireless sensor networks. The nodes with capabilities of sensing and computing help the administrator to observe particular environment like battle field, climatic conditions and weather forecasting in remote areas etc. This dissertation research is about the study of performance challenges in wireless sensor networks using Sensor Protocol for Information via Negotiation(SPIN) protocol under various security threats and to analyse their impact on SPIN. The empirical study has been carried to validate the issues studied in literature review by simulating the scenarios. On the basis of achieved observations the inference is drawn about the better protocol in sensor network and future recommendations are made for the analysis and enhancement.
To verify the data integrity and third party auditor at user side in cloud computing
(Central University of Punjab, 2014) Goyal, Renuka; Sidhu, Navjoot
Now-a-days the concept of Cloud Computing is one of the major theories in the world of IT. Its services are now being applied to several IT scenarios. Cloud Computing is the Internet based computing which provides users with a number of services. One of the services provided by the cloud computing is data storage. Users store their data in the cloud without the burden of local data storage. But as every technology has some drawbacks, cloud computing also has some drawbacks. The main drawback of cloud computing is the security issues that are associated with it. The security issue with which this dissertation is dealing is the threat to data integrity. As the user no longer has physical possession of data so the integrity of data stored on cloud server become the major concern in the cloud computing. Data stored on the cloud server may be getting corrupted and sometimes even the cloud service provider for his own benefit like for more space on data centre can discard the user data which is not used for a longer time. In order to maintain the integrity of data, the user takes the assistance of a Third Party Auditor (TPA). The Third Party Auditor checks the integrity of data on user demand and the released audit reports not only helps the user to evaluate the risk of their services but also helps the cloud service provider to improve their security mechanism. As a part of verification it is assumed that Third Party Auditor is reliable and independent which does not mean that there is no space for the Third Party Auditor to cheat. So there is need to check the integrity and Third Party Auditor at user side. This dissertation highlights the basics of cloud computing, general model and different approaches used for Third Party Auditor. The model to verify the data integrity and Third Party Auditor is implemented in this dissertation and the results found are good according to the user data.
A fault tolerable load balancing technique in cloud computing
(Central University of Punjab, 2014) Shiny; Khurana, Surinder.K
As the IT industry is growing day by day, the need of computing and data storage is increasing rapidly. The process of this increasing mass of data requires more computer equipment to meet the various needs of the organizations. To better capitalize their investment, the over-equipped organizations open their infrastructures to others by exploiting the Internet and other important technologies such as virtualization by creating a new computing model: the cloud computing. Cloud computing is one of the significant milestones in recent times in the history of computers. However, there are number of technical challenges that need to be tackled which include reliability, resource provisioning, fault tolerance, load balancing and efficient mechanism to increase the service level agreement (SLA) and better use of the resources. The main purpose of this dissertation report is to provide a preface of the topic and to work on the various issues involved in the field of load balancing and fault tolerance i.e. load computation and the distribution of load. Load balancing and fault tolerance in cloud computing have a great impact on the performance of the system. Good load balancing makes cloud computing more efficient by provisioning of resources to cloud users on demand basis in pay-as-you-say manner. Load balancers are used for assigning load to different virtual machines in such a way that none of the nodes gets loaded heavily or lightly. When many clients request the server simultaneously, server is overloaded which causes fault. There are many load balancing algorithms and fault tolerance techniques in order to settle down these issues, but these techniques further had some drawbacks. Das and Khilar (2013) discussed a load balancing technique for virtualization and fault tolerance in cloud computing (LBVFT) to assign the task to the virtual nodes depending upon the success rates (SR) and the previous load history. This v technique tolerates not only the faults but also reduce the chance of future faults by not assigning tasks to virtual nodes of physical servers whose success rates are very low and loads are very high. But there is still a need to provide an efficient load balancing, load migration, load calculation and fault handling technique to make the VFT model more effective.
Analysis of leach protocol for lifetime optimization of wireless sensor networks
(Central University of Punjab, 2014) Maurya, Prashant; Kaur, Amanpreet
A Wireless Sensor Network (WSN) is an emerging field comprised of sensor nodes with limited resources like power, memory etc. It is used to monitor the remote areas where recharging or replacing the battery power of sensor nods is not possible. So, energy is a most challenging issue in case of WSN. Low-Energy Adaptive Clustering Hierarchy (LEACH) is most significant protocol which consumes less amount of energy while routing the data to the base station (BS). All descendents protocols of LEACH have been discussed in Literature review chapter. Each descendants of LEACH has its merits and demerits which needs improvement. In this research work RCH-LEACH protocol (LEACH protocol using Relay Cluster Head Node) has been proposed using a relay cluster head node (RCH node) in each cluster. RCH-LEACH protocol has been simulated on MATLAB with fixed location of base station and with fixed percentage of cluster heads in the network. Results of RCH-LEACH has been analyzed using parameters like Energy Consumption per Round, Round when First Node Dies (FND), Round when half of Nodes Die (HND), Round when Last Node Dies (LND) and throughput. Analysis of results represent that FND, HND, LND and Throughput of RCH-LEACH are higher and Energy consumption per Round is lower than that of LEACH protocol. So, it can be concluded that RCH-LEACH outperforms LEACH protocol. This RCH model used in RCH-LEACH protocol can be further extended and implemented on other descendant protocols of LEACH to improve them as a part of future work.
Effect of improved IEEE 802.11 DCF on the performance of manets
(Central University of Punjab, 2014) Hans, Shifali; Sood, Neha
Wireless networks have become the most crucial aspect of the today's wireless communication and information exchange. The rapid advancements in the wireless networking technologies have drastically modified our communication and networking world and have led us to the new direction of 'Infrastructure-less networking i.e. Mobile ad hoc Networks'. Mobile ad hoc networks (MANETs) are the wireless infrastructure less networks that do not require any sort of central access point. Nodes in MANETs are connected by the wireless links and they are free to move arbitrarily in any direction. The attractive features of MANETs help to set up a network in emergency situations where the infrastructure is not available or not possible. Even though MANETs have emerged to be attractive, and they hold great promises for our future, but there are several challenges that need to be addressed. The wireless medium is the open shareable; so many-a-times nodes compete among themselves for the medium access, and the conflict arises. In order to resolve the medium contention among nodes there are medium access control techniques. IEEE 802.11 DCF is the de-facto medium access protocol. However there are some problems in IEEE 802.11 DCF which need to be attended for the better MANET performance. The objective of the dissertation work is to study the IEEE 802.11 DCF performance. The performance of 802.11 have been deduced and analysed by running a simulation in NS2 and then have been comparing to the performance of the modified IEEE 802.11 DCF with AODV and DSR routing protocol.
Improved 2ACK scheme for reducing routing overhead in manet's
(Central University of Punjab, 2014) Dhiman, Deepika; Sood,Neha
An autonomous collection of mobile nodes communicating with each other via wireless links either directly or indirectly or relying on other nodes forms the mobile adhoc network (MANET). The routing protocols in MANET are designed based on the assumption that all the participating nodes co-operate. Due to certain issues like open structure and limited energy supply, the nodes sometimes misbehave and act in a selfish manner. 2ACK scheme serves as an add-on technique on few routing protocols (e.g. DSR) to detect such misbehaviour and to mitigate their adverse effect. The major limitation of this 2ACK scheme is additional routing overhead due to authenticated 2ACK packets. Thus, this dissertation work focuses on reducing the routing overhead and end-to-end delay by modifying the authentication mechanism in existing 2ACK scheme. Analytical and simulation results have been presented for evaluating the performance of the work done.
Improved and rule scheme to increase lifetime of wireless sensor networks
(Central University of Punjab, 2014) Saini, Swati; Khurana, Surinder.K
Wireless sensor network (WSN) is a network of small light weight wireless nodes which are highly distributed and deployed in large numbers. The sensor nodes scan the environment and provide useful information to the user through sink node. One of the major issues in wireless sensor networks is developing an energy-efficient routing technique which has a significant impact on the overall lifetime of the sensor network. Our dissertation work focuses on increasing lifetime of wireless sensor networks. This is done by improving the existing Divide and Rule Scheme which is based on dividing network area into logical divisions to reduce distance for intra cluster and inter cluster communications. Improvement of Divide and Rule Scheme is done by developing a new scheme called Segregated Receive and Relay Scheme in which addition of relay nodes is done in inner and middle regions. The Proposed Scheme results in around 50% increase in lifetime of inner region nodes and leading to overall increase in lifetime of the network. Other parameters such as Delay, Throughput and Packet loss also shows better results in new Scheme.
Security analysis of AODV, ARAN and improved mobile adhoc networks routing protocols
(Central University of Punjab, 2014) Goel, Ruby; Meenakshi
Wireless networks use wireless connections to provide a communication environment between the communicating devices using their radio transmission range. Wireless network doesn?t require any pre-established infrastructure. Adhoc network is an infrastructure-less network which allow nodes to communicate beyond their direct wireless transmission range by introducing cooperation in mobile nodes. Wireless communication is guided by routing protocols. Wireless routing protocols come under different categories like- On-demand, Table-driven and secure routing protocols. Wireless networks face many challenges due to limited resources, dynamic topologies and lack of physical security, due to which variety of attacks have been identified that target both the on-demand and table- driven routing protocols. By attacking the routing protocols attacker can absorb network traffic, or can inject the false traffic in the network. Due to this attacks like- Blackhole, IP-Spoofing, False message fabrication, Denial of service, etc. are possible in adhoc networks. Many secure routing protocols have been developed that can deal with these attacks. One of them is Authenticated Routing for Adhoc Network (ARAN) which introduces authentication, message integrity and non- repudiation as part of its security policy and provides security against various network attacks like- Message modification, false message fabrication and impersonation attack. But ARAN is vulnerable to Distributed Denial of Service (DDOS) attack because legitimate nodes can send large amount of unnecessary packets in the network and can create congestion and thus prevent other legitimate nodes to access the network. In this research work security aspects of ARAN have been analyzed with respect to Adhoc On-Demand Distance Vector (AODV) routing protocol under Blackhole and IP-Spoofing attack. Further a technique has been proposed for ARAN to resist DDOS attack by limiting the number of packets per unit of time each node can send in the network and this enhanced ARAN in this research work is called as improved ARAN (i-ARAN). By implementing the proposed technique i- ARAN is able to prevent DDOS attack. Various performance metrics like- Packet Delivery ratio, Average Path Length, Average end-to-end delay and Throughput; iv are calculated under Glomosim-2.03 simulator. Results show that ARAN is safe against Blackhole and IP-Spoofing attack, but AODV is highly vulnerable to both the attacks. Also results of i-ARAN under DDOS attack show that the attack can be prevented by the proposed technique as it provides constant Packet delivery ratio from all the source nodes and throughput of i-ARAN is also approximately constant. By using i-ARAN there is no congestion in the network so average end- to-end delay of i-ARAN is less than the ARAN.
Securing virtualization to mitigate TCP-DDOS between multiple tenants on the same physical host in cloud computing
(Central University of Punjab, 2014) Kanika; Sidhu, Navjoot
Cloud computing is the fastest growing technology in the IT world. The technology offers reduced IT costs and provides on the demand services to the individual users as well as organizations over the Internet. The means of cloud computing is obtained by the virtualization of the resources such as hardware, platform, operating system and storage devices. Virtualization permits multiple operating systems to run on the same physical machine. Multiple tenants are unaware of the presence of the other tenant with whom they are sharing the resources. The co-existence of multiple virtual machines can be exploited to gain the access over other tenant's data or attack to deny of services. The significant concern is insuring the security and providing isolation between multiple operating systems. Denial-of-Service (DoS) attack poses a serious network security challenge to the virtualized cloud computing. All the virtual machines and the host machine shares common resources over the cloud computing. A malicious virtual machine can exhaust the common resources by flooding the co- existing VM with high rate of unreasonable network traffic. The threat of DoS attack becomes even more severe with DDoS (Distributed Denial-of-Service) attack. Other virtual machines are compromised on the virtualized cloud to perform DDoS attack. The dissertation aims to provide an analysis of the different attacks raised by the multi-tenancy and the virtualization in an IaaS cloud. The research focuses on the threats arises from malicious tenants to the co-existing tenants on the same physical host. As part of the aim of this research, the terms of cloud computing, multi-tenancy and virtualization are analysed. The vulnerability of the DDoS attack by a malicious virtual machine over co-existing virtual machine in the private cloud infrastructure is explored along with a mechanism on how to approach it. The research approaches to provide a security model to mitigate the effect of denial of service attack from the virtualized cloud computing.
Security in AODV protocol using and hybrid cryptography
(Central University of Punjab, 2014) Singh, Khushmeet; Kaur, Amanpreet
A mobile Ad hoc network (MANET) is a wireless decentralized self-configuring network in which nodes communicate with each other either directly or through intermediate nodes. These unique features (self-configuring, infrastructure-less, decentralized) make MANET suitable for use in emergency situations, military operations, education, entertainment, sensor networks etc. Besides the various advantages, the open medium, rapidly changing topology and lack of centralized monitoring make MANETs vulnerable to various attacks. This dissertation work focuses on network layer attacks. Network layer attacks in MANET are categorized into two basic types namely active and passive. In active attack, an attacker disrupts the regular operation of the network, change the data or harm the system. In passive attack, the attacker does not disturb the operation of network but attempts to seek some valuable information. So, it is vital to develop some security mechanism to protect MANETs from attacks. This dissertation work focuses on providing solution to prevent MANETs from two active attacks namely Blackhole and Malicious Packet Dropping and one passive attack namely Eavesdroping attack. The existing AODV Protocol is modified to prevent these attacks. Solution is proposed and simulated to prevent Blackhole and Eavesdropping attack. Malicious packet dropping attack is prevented by using Watchdog Intrusion Detection System (IDS). Performance of AODV and Modified AODV protocol is analysed with respect to Packet Delivery Ratio, Average End-to-End Delay and Routing Overhead. To prevent Eavesdropping attack, a hybrid cryptography technique has been developed which combines best features of both symmetric key cryptography and asymmetric key cryptography i.e. speed and security. Simulation has been done in Network Simulator version 2.35.
Extended stable election protocol with advance probability method in wireless sensor networks
(Central University of Punjab, 2014) Singh, Mandeep; Sidhu, Navjoot
Wireless sensor network is an emerging research field. It has gained a lot of attention from industry and academia. Mainly it is used for monitoring and data aggregation from the field. Data is most important in this process as it gives us the useful information. There are lots of techniques to gather data from the field. These techniques or can be said protocols must be energy efficient as this is a main constraint for the sensor nodes having limited battery. Lot of protocols have been designed for this process. LEACH (Low Energy Adaptive Clustering Hierarchy) is a basic protocol that uses clustering. It has significantly increased the life-time of network as compared to old flat protocols. There are various advancements in LEACH. Heterogeneity is also an important matter in sensor network as all the nodes do not lose energy uniformly. SEP (Stable Election Protocol) is a heterogeneous aware protocol based on LEACH and increases the lifetime of the network. ESEP (Extended Stable Election Protocol) is an extended version of the SEP that adds more heterogeneity by adding one more type of nodes. In heterogeneous aware protocols, each type of node has different amount of initial energy. There is a problem that when nodes left with the same amount of residual energy, the probability remains according to initial energy. So a changed ESEP protocol has been proposed. Simulation has been done in MATLAB and proposed protocol gives better performance in terms of first node dies and total number of packets delivered.
Service level agreement aware energy efficient approach for virtual machine placement in clous data center
(Central University of Punjab, 2014) Kaur, Nirmaljeet; Khurana, Surinder.K
Generally, the growth of computing systems has been concentrate on performance improvement or fast processing of applications from the view point of customer, scientific and business perspective. However, this type of computing increases energy consumption. It is continue to consume large amount of energy in the form of electrical power. In cloud computing data center hosting of cloud applications consume huge amount of energy. Optimization of the energy requirements of data center is a very challenging task. This dissertation report describes the energy efficiency of minimization of migration policy in IaaS environment. In this policy VM migration, energy consumption, SLA violations are calculated. VM migration directly influences resource utilization and Quality of Service (QoS) parameters provided by the system. The effect of disturbance cause server overloads, resource shortage, performance degradation etc. So, one of the challenging task is, the placement of VMs, like where, when, which VM could be migrated for saving energy and less SLA violations, with minimum number of migration. In this research work a new approach has been proposed to select VMs to migrate from the over utilized host. Approach migrates those VMs that belongs to the higher category so that that the resources allocated to these VMs have less cost penalties for SLA violations. Proposed approach results are compared to the simulated Minimization of Migration Policy (Beloglazov et al., 2012) and compared its energy requirements, virtual machine migration and SLA violation with Minimum Migration Time and Random Selection policies.

Browse

Recent Submissions