Search

Cloud computing is a type of grid computing which is a form of distributed computing and distributed computing is a special type of parallel computing. Presently a lot of services are growing under the single umbrella that is known as cloud computing. Cloud computing gain popularity in the several area due its property of everything-as -a-service( XaaS), includes SaaS, PaaS and IaaS. Many problems have been arising when we go for implementation development. Workflow scheduling and appropriate allocation of resources is one of among problems that will decrease the Quality of Service (QoS) of cloud computing. There are many algorithms to automate the workflows in a way to satisfy the Quality of service (QoS) of the user. This paper is the survey of some workflow scheduling algorithms that have been proposed for cloud computing.

The ad-hoc networks are the temporarily established wireless networks which does not require fixed infrastructure it is also called as infrastructure less network. There is no central control authority in ad-hoc network. Because of some flaws of ad-hoc network such as shared wireless medium and lack of any central coordination makes them more prone to attacks in comparison with the wired network. It is peer to peer network. Among all the attacks wormhole attack is the most severe attack. In this attack an attacker capture the packets at one location in the network and send it to another attacker at a distant location through tunnels which is established through different ways like packet encapsulation, using high power transmission or by using direct antennas. This tunnel between two colluding attackers is virtual and it is called as a wormhole. The wormhole attack is possible even if the attacker has not comprised any hosts, and all communication provides authenticity and confidentiality. By using the various approaches for finding the solution over wormhole attack, the dynamic information of the packets could still be modified. So in order to give more robust protection in some special scenario like battlefields, which requires highly secured information, there is need of developing some secured mechanism for wormhole detection. Taking into consideration this problem the proposed scheme is developed. This paper discusses proposed works on wormhole attack along with comparison of different wormhole detection techniques in adhoc wireless network.

Peer-to-Peer (P2P) [1] are widely used for file sharing purposes. This type of usage provides decentralized solutions over centralized complex architecture. Peer-to-Peer networks are gaining attention from both the scientific perspective as well as the large Internet community. Popular applications utilizing this new technology offer many attractive features to a growing number of users. P2P is an architecture which is all-together a different class of applications that use the concept of distributed resources to perform an important crucial function in a decentralized manner. The popularity and bandwidth consumption attributed to current Peer-to-Peer filesharing applications makes the operation of these distributed systems very important for the Internet community. Efficiently discovering the queried resource is the initial and most important step in establishing an efficient peer-to-peer communication. Here, we will be describing and analyzing the performances of some existing search mechanisms deployed for the peer discovery and the content look up.