Abstract

Cloud computing is the emerging technology now a days. Many organizations are providing the services through the cloud which helps in avoiding the problems with data carrying. In the past,lots of research has been done in cloud computing. The main advantage of this is the data security. The data in cloud has no hindrances and can be accessed from anywhere at any time. This made the technology very useful. As the cloud has more clients that are accessing the cloud, it has to manage the tasks that are performed by the clients on the server machine. There are several algorithms that are used to schedule the tasks in cloud computing. This paper gives a brief idea about various task scheduling algorithms used in  cloud computing.

Abstract

In present scenario Internet has become an integral part of every one's life, as many services like mail, news, chat are available and huge amounts of information on almost any subject is available. However, in most cases the bandwidth to connect to the Internet is limited. It needs to be used efficiently and more importantly productively. Generally, bandwidth is distributed among groups of users based on some policy constraints. However, it turns out that the users do not always use the entire allocated bandwidth at all times. Also, some times they need more bandwidth than the bandwidth allocated to them. But when it is abundant then any kind of use can be permitted provided it is in consonance with the policy. The bandwidth usage patterns of users vary with time of the day, time of the year hence to stabilize this,a dynamic allocation of bandwidth that satisfies the requirements of the users is needed.

To maximize productive usage, a need to implement control access policies has to be implemented which prevents unproductive use but at the same time does not, to the extent possible, impose censorship. Squid proxy server is a an example of the same. Squid provides many mechanisms to set access control policies. However, deciding which policies to im¬plement requires experimentation and usage statistics that must be processed to obtain useful data. The proposed architecture elaborated in this paper is based on machine learning to de¬termine policies depending on the content of current URLs being visited. The main component in this architecture is the Squid Traffic Analyzer, which classifies the traffic and generates URL lists. The concept of delay priority will also be introduced which gives more options to system administrators in setting policies for bandwidth management.

Abstract

A set of test vectors that detects all single stuck-at faults on all primary inputs of a fanout free combinational logic circuit will detect all single stuck –at faults in that circuit . A set of test vectors that detect all single stuck-at faults on all primary inputs and all fanout branches of a combinational logic circuit will detect all single stuck-at faults in that circuit. Design of logic integrated circuits in CMOS technology is becoming more and more complex since VLSI is the interest of many electronic IC users and manufactures . A common problem to be solved by designers, manufactures and users is the testing of these Ics. Testing can be expressed by checking if the outputs of a function systems (functional block, integrated circuits , printed circuit board or a complete systems) correspond to the inputs applied to it . If the test of this function system is positive , then the system is good for use. If the outputs are different than expected. Then the system has a problem : so either the system is rejected (go/no go test) , or a diagnosis is applied to it , in order to point out and probably eliminate the problem’s causes.

Abstract

Topology mismatch problem is the most vital barrier to the growth of P2P(Peer-to-Peer) networks. The random joining and leaving of nodes and the formation of the P2P overlay without considering the underlying physical network causes redundant traffic in the network which affects the performance of searching, forwarding and replying the queries. By using the Nodes Network Positioning, the system tries to form an overlay that reduces the network latency between the nodes and in turn reducing the unwanted traffic. The system is evaluated with proper simulations and the findings show improvement in the total system performance.

Abstract

The revolution of the internet is based on the ability to transport data from source or origin to a destination. This revolution over the last three decades has seen unprecedented growth rate and it is expected to grow much higher especially with the emergence of smart mobile devices and internet penetration into the developing world. However, the transport of data has never been without challenges. Some of these challenges include: loss of data, collisions and delay in sending data and inefficient routing algorithms. In this work, the researcher proposes an algorithm that will not only find the shortest possible path but also able to find the most efficient path for data routing. The researcher seeks to use Dijkstra’s algorithm that will be used to find the shortest path from a named source to a destination and to explore the logic behind Carrier Sense Multiple Access with Collision Detection (CSMA/CD) to investigate how busy the shortest route or path may be.