Forwarding To Redundant Server Using Load Balancer

K.P.Ganesh Kumar S.Pon Arasu Neranj K.Sriharsha 21008104027 21008104067 21008104103

Domain : Cloud Computing

GUIDE : MRS.K.Valaramathi M.E.,(Ph.d) Professor/CSE.

objective
y

Forwarding redundant server exist to search or storing an information from the server which is available at the time and also send state alerts whenever a node is failed. In this we present a window based state monitoring frame work for efficiently managing cloud computing. In existing system it can detect the node failure after it fails and send alert message to the client server and select a new server which is available. It causes time delay to send or retrieving information to and from severs, when the node fails. In proposed we are going to find the status of node before sending the request and it automatically redirect the client system to another cloud server. This automatic detecting the possibility of node failure is done by using load balancing technique. It also provides high availability by detecting sever failures and automatically redistributing traffic to redundant server. It is used to find the status and health of node, and forward the request to another server with is available.

Existing Model
y

In existing system the failure of nodes will be found after the client sends the request and then only it selects a new server which is available. The new sever has the same redundant copy of information as the failed server. It does not use load balancing technique to find the status and health of node. It does not provide the level or possibility of node which is available.

Proposed Work
y

In proposed system we use load balancing technique to find the availability of severs and provide recovery process. It maintains the level of information similar to the other severs. If one sever is failed means it automatically redirect to the redundant sever. The status of node will automatically find before sending the search request. It provides the possibilities of node which is available.

System Specification:
y y y y y y y

HARDWARE REQUIREMENTS System Hard Disk Floppy Drive Monitor Mouse Ram : : : : : : Pentium IV 2.4 GHz. 40GB. 1.44 Mb 15 VGA Color. Logitech mouse 512 GB.

y y y y

SOFTWARE REQUIREMENTS Operating System Language Database : : : Windows XP. ASP.NET with C# SQL Server 2000

SL.NO

TITLE,AUTHO RS AND YEAR

ISSUES ADDRESSED

APPROACH

CONCLUSION

OPEN ISSUES

1.

Monitoring Continuous State Violation in Datacenters: Exploring the Time Dimension, Shicong Meng, Ting Wang, Ling Liu and 2010 Intl conf. data Eng.

Unpredictable monitored value bursts and momentary outliers.

WISE Monitoring Algorithm

Achieves significant communication reduction.

Techniques to enhance data stream monitoring operates with window-based state Monitoring approaches.

2.

REMO: ResourceAware Application State Monitoring for Large-Scale Distributed Systems, Shicong Meng,Srinivas R. Kashyap, Chitra Venkatramani, Ling Liu and 2009 Intl conf.

Treats multiple application state monitoring tasks independently and ad-hoc monitoring trees for each task, or a single static monitoring tree for multiple tasks.

A Resource-aware application state Monitoring system

It optimizes multiple tasks and also balances node level resource consumption.

Runtime adaptation cost of transforming from one monitoring network to another.

3.

Lightweight, High-Resolution Monitoring for Troubleshooting Production Systems, Sapan Bhatia,Abhishek Kumar,Marc E. Fiuczynski,Larry Peterson and 2008 USENIX conf

Intermittent, non-reproducible problems that often make maintaining production systems a challenge .

Chopstix diagnostic tool.

It is possible to isolate intermittent failures in enough detail to allow traditional debugging tools to be applied

Add more automation to the post- processing tool chain.

4.

Network Imprecision: A New Consistency Metric for Scalable Monitoring Navendu Jain, Prince Mahajan, Dmitry Kit, Praveen Yalagandula, Mike Dahlin, and Yin Zhang and 2008 USENIX symp.

Safeguarding accuracy despite node and network failures in largescale monitoring system.

Hierarchical aggregation, Arithmetic filtering, Temporal batching

Characterizing network state that quantifies the consistency of query results in a dynamic, largescale monitoring system.

---

5.

Outlier-Aware Data Aggregation in Sensor Networks Antonios Deligiannakis , Vassilis Stoumpos , Yannis Kotidis, Vasilis Vassalos , Alex Delis and 2008 Intl conf data Eng

Detect spurious measurements and refrain from incorporating them in the computed aggregate values.

A query execution model.

A robust aggregation framework that can minimize the bandwidth and energy drain during the query evaluation.

----

6.

Efficient Constraint Monitoring Using Adaptive Thresholds Srinivas Kashyap , Jeyashankher Ramamirtham , Rajeev Rastogi, Pushpraj Shukla and 2008 Intl Conf. Data Eng.

Need to process large volumes of data in real-time sources, and impossible to store entire information in an on-demand fashion.

Nonzero space slack instantaneous monitoring algorithm.

Non-zero slack schemes incur significantly less communication overhead compared to the state of the art zero slack scheme (over a 60% savings).

Studying non-zero slack algorithms for such structured networks presents an interesting area of future research too

7.

STAR: SelfTuning Aggregation for Scalable Monitoring Navendu Jain, Dmitry Kit, Prince Mahajan, Praveen Yalagandula, Mike Dahlin, and Yin Zhang and 2007 Intl Conf.

Minimize the total communication load for a multilevel aggregation tree under a fixed error budget.

Self-tuning algorithm

Provides self-tuning arithmetic imprecision to numerical accuracy in query results, and also optimizes scalable monitoring of a large number of stream events.

Self-tuning error distribution for general graph topologies e.g., DAGs, Rings

8.

Non-Threshold based Event Detection for 3D Environment Monitoring in Sensor Networks Mo Li, Yunhao Liu, Lei Chen and 2007 Intl Conf.

Has only predefined threshold values thus they are inaccurate incapable of capturing complex events

Space Orthogonal polyhedral model.

Event feature Pattern to specify complex events and develop a pattern based event detection method on the obtained 3D gradient data map.

Implementing a work system in a real world environment.

9.

CommunicationEfficient Tracking of Distributed Cumulative Triggers Ling Huang, Minos Garofalakis,Antho ny D. Joseph Nina Taft and 2007 Intl Conf.

Detect anomalies while only collecting a very limited amount of data from distributed monitors.

Queuing model for a Cumulative Trigger

It can yield a greater than 80% reduction communication overhead, while preserving high detection accuracy.

Adding faulttolerance to the single coordinator, applying Cumulative triggers over more sophisticated correlation functions.

10.

Efficient Detection of Distributed Constraint Violations Shipra Agrawal, Supratim Deb, K. V. M. Naidu, Rajeev Rastogi and 2007 Intl Conf.

Eliminates the need to continuously track the global system State.

A Fully Polynomial-Time Approximation Scheme (FPTAS).

Detecting global constraint violations using local constraints that are chosen based on frequency distribution.

---

11.

Energy Efficient Monitoring of Extreme Values in Sensor Networks, Adam Silberstein Kamesh Munagala Jun Yang and 2006 ACMSIGMOD Intl Conf.

Individual node cannot by itself determine its inclusion in the query result.

Novel query processing algorithms.

Techniques based on constraint localization for efficiently supporting continuous MAX, and also provide general insight for developing sensor query processing algorithms.

Idea of constraint localization is fundamental and can be applied to other problems such as general quantile.

12.

Communication Efficient Distributed Monitoring of Thresholded Counts Ram Keralapura, Graham Cormode,Jai Ramamirtham and 2006 ACM SIGMOD Intl conf.

The problem of threshold counts.

Static thresholds and Adaptive thresholds.

Adaptive algorithms typically outperform those based on maintaining static thresholds.

To compare the cost of deploying the these algorithms in real network scenarios such as a particular sensor network environment or IP network monitoring setting.

13.

A Geometric Approach to Monitoring Threshold Functions Over Distributed Data Streams, Izchak Sharfman, Assaf Schuster, Daniel Keren and 2006 ACM SIGMOD Intl Conf.

Monitoring challenges, such as the important task of feature selection .

Novel geometric approach.

A general framework for monitoring arbitrary threshold functions over a system of distributed streams. and also it reveals highly effective in reducing communication frequency.

Developing methods to finetune various parameters (window size, error margin, threshold) in order to find an optimal tradeoff between communication load and accuracy.

14.

Holistic Aggregates in a Networked World: Distributed Tracking of Approximate Quantiles Graham Cormode, Minos Garofalakis, S. Muthukrishnan, Rajeev Rastogi And 2005ACM SIGMOD Intl Conf.

Problem of continuously tracking complex holistic aggregates functions (e.g., .heavyhitters. queries).

Novel algorithmic solutions.

Continuous tracking algorithms for quantile summaries of data that work under space constraints at local sites processing high-speed streams, work under communication constraints between sites, and maintain provably accurate quantile summaries at all times

Need to be implemented in large scale system

Conclusion
y

From the literature survey, it is inferred that the WISE state monitoring system can be used to monitor the nodes of a distributed network for a particular time window based on the threshold .Further we propose to use the results obtained from WISE can be used by predictive Load Balancer to detect the status of the node and whether to forward the request to another server with is available.