Information Technology

Due to the wide acceptability of the industry for cloud computing, variety of applications are designed targeting to cloud platform which makes efficient load balancing a major bottleneck for the above. To improve the efficiency of the cloud platform, a judicial distribution of workload among the available resources needs to be ensured. To share the workload in an effective way, a proper load balancing strategy is important. This strategy comprises of information policy, triggering policy, resource type policy and selection policy. Since cloud applications are running in a distributed scenario, through this paper, researcher suggests a selection policy for load balancer in a distributed environment.

This paper untangle the idea of software security and applying sound practices to the phases of software development life cycle that design and develop software and subject all phases to risk analysis and testing. It focuses on importance of secure software and unveils why and how attackers target software. It brings into light some of the exploitable software defects and certain methods to make software less vulnerable to attacks. It also presents the idea of software testing and its goal with the perspective of considering security as an important requirement to test.

In Classical Hypothesis testing volumes of data is to be collected and then the conclusions are drawn, which may need more time. But, Sequential Analysis of Statistical science could be adopted in order to decide upon the reliability / unreliability of the developed software very quickly. The procedure adopted for this is, Sequential Probability Ratio Test (SPRT). It is designed for continuous monitoring. The likelihood based SPRT proposed by Wald is very general and it can be used for many different probability distributions. In the present paper we propose the performance of SPRT on 5 data sets of ungrouped using delayed S-shaped model and analyzed the results. The parameters are estimated using Maximum Likelihood Estimation method.

Indian Regional Navigation Satellite System is a regional navigation system for Indian Region This system consists of seven satellites each generating navigational message in binary notation at stipulated time based on the data uploaded periodically from the control segment. Each satellite sends data in two bands viz. S and L5. Ground ranging stations receive Range and navigation data from IRNSS satellites. The data received is in properiately packed binary format and needs to be extracted to engineering units for further processing. The measurement data logs are received for every 1 second and the navigation data logs are received at every 12 seconds from each satellite. Since the logs are stored in the little Endian format and the packet headers are in big Endian format, endianness has to be considered for accurate data extraction. These logs after decoding are sent in UDP packets to the receiver which in turn stores the data in the shared memory for its readers. The reader process fetches the data from the memory and stores it to a file.

Uses of Wireless sensor networks have been widely seen in the fields of target detection and tracking, environmental monitoring, industrial process monitoring, and tactical systems. In wireless sensor networks nodes work with an incomplete power source, energy efficient operations in an important factor of the nodes in wireless sensor network. Energy conservation plays important role in different layers of the TCP/IP protocol suit, and for MAC layer it is the effective part. Therefore, to work in wireless communicating sensors network, we use MAC protocol which improve energy efficiency by increasing sleep duration, decreasing idle listening and overhearing, and eliminating hidden terminal problem or collision of packets. In this paper First section we describe the accessible energy –efficient MAC protocols for sensor networks their energy saving method. In Second section we discuss the architecture of same protocols and then compare same protocols depending on their Advantages and Disadvantages.

Worms can be classified into various categories; one among them is active worms. These active worms pose a vital security threats to the internet especially in social networks. Defending against such active worms are not as easy as other types of worms. Active worms propagate in an automatic fashion such that it can infect as many as clients. In this paper we evaluate a special type of active worm, called muffle worm (M-worm in short). The m-worm is different from any other worms, for it goes undetected when the scan process encountered. The m-worm identifies the vulnerable clients in the social networks and infects the client. Once the client is infected, then the infected host scans for the other vulnerable clients and infects the client. We studied the comprehensive characteristics of the m-worm and provide the secure computing in the social networks. The scheme that we propose detects the m-worm from where it has been propagated and the current location of the worm. Once the origin of the m-worm is identified, the client that spread the m-worm can be disconnected from the social networks (Blocking). Thus the secure computing can be obviously provided in the networks. Still if the misbehaved client wishes to participate in the communicating network, which would be done by authenticating the corresponding client. The proposed scheme proves that it could provide secure computing in the social networks.

Cloud computing can be observed as the transition of a long held dream called “Computing as utility”, into reality. This is a next generation platform that provides dynamic resources pods, virtualization, and high availability. The success of cloud lies in the terms “pay per use” and “multi tenancy”. But these two major advantages bring some disadvantage with them. The “pay per use” facility requires proper scheduling of tasks for proper utilization of the cloud. And the “multi tenancy” brings some major security threats as all the different organizations use the same physical infrastructure. Many researchers have concentrated in both the fields. In this paper authors have studied various security solutions, scheduling algorithms and their issues related to cloud computing.

Security has become one of the major issues for data communication over Wired and Wireless sensor networks. Consider wireless sensor networks while transferring the data it can be attacked by different kinds of attacks such as compromised node, denial of service attacks. We agree that existing multi-path routing approaches are vulnerable to such attacks, mainly due to their deterministic nature. By considering the routing algorithm, it can compute the same routes known to the source, therefore all information sent over these routes. To secure the data from these attacks we can generate randomized multipath routes. These routes are taken by the shares of different packets change over time. While sending the data the randomized multi path routes include the same routes. In this paper, instead of selecting self-nodes we generate dynamic multi path routing in which the shares of different packets are taken and send to the destination. We develop efficient topology for delivery the data in secure manner. The experimental results show that topology out performs traditional schemes in terms of CPU cost, minimization of retransmissions.

This research, provided a proper procedure in order to build up an IT service management Model with the goal of developing a convenient model for the optimized deployment of the IT services in the smart schools plan imposed for the country. To achieve this goal, first, IT service management (ITSM) in general and IBM model in particular are introduced, Later on a generic model is presented for IT service management base on extraction and mapping among IBM model processes and IT services of the smart schools. Finally sample scenarios on administrative components are defined in the line of the strategic plans in order to analyze and evaluate the implementation of the proposed model.

Wireless mesh networks (WMNs) experience frequent link failures caused by channel interference, bandwidth demands causes severe performance degradation in WMNs .Link failure will lead to produce a sequence of disruptions to deliver the packets to the destination. To overcome this ART rerouting the traffic via an alternative path from a node whose local link is down without the need to wait until the source node knows about the failure. This is achieved by creating a new backup routing table based on the original routing table which is computed by the dijkstra algorithm. The goal of these algorithms is to reduce loss of packets, end-to-end delay time, improve throughput.