ABSTRACT Due to the Internets sheer size, complexity, and various routing policies, it is difficult if not impossible to locate the causes of large volumes.

Slides:

Advertisements

Similar presentations

Study On Intelligent E-Shopping System Based On Data Mining

Advertisements

Bandwidth Estimation for IEEE Based Ad Hoc Networks.

The Transmission Control Protocol (TCP) carries most Internet traffic, so performance of the Internet depends to a great extent on how well TCP works.

ACHIEVING NETWORK LEVEL PRIVACY IN WIRELESS SENSOR NETWORKS.

CLOSENESS: A NEW PRIVACY MEASURE FOR DATA PUBLISHING

A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.

Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,

Abstract There is significant need to improve existing techniques for clustering multivariate network traffic flow record and quickly infer underlying.

Abstract Shortest distance query is a fundamental operation in large-scale networks. Many existing methods in the literature take a landmark embedding.

INTRUSION DETECTION SYSTEM

Toward a Statistical Framework for Source Anonymity in Sensor Networks.

Annotating Search Results from Web Databases. Abstract An increasing number of databases have become web accessible through HTML form-based search interfaces.

A Secure Protocol for Spontaneous Wireless Ad Hoc Networks Creation.

Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks.

Personalized QoS-Aware Web Service Recommendation and Visualization.

WARNINGBIRD: A Near Real-time Detection System for Suspicious URLs in Twitter Stream.

Discovering Emerging Topics in Social Streams via Link Anomaly Detection.

IP-Geolocation Mapping for Moderately Connected Internet Regions.

Crowdsourcing Predictors of Behavioral Outcomes. Abstract Generating models from large data sets—and deter¬mining which subsets of data to mine—is becoming.

Secure Encounter-based Mobile Social Networks: Requirements, Designs, and Tradeoffs.

WIRELESS COMMUNICATION NETWORKS Modeling and Simulation.

Cross-Domain Privacy-Preserving Cooperative Firewall Optimization.

NICE :Network Intrusion Detection and Countermeasure Selection in Virtual Network Systems.

Security Evaluation of Pattern Classifiers under Attack.

Vampire Attacks: Draining Life from Wireless Ad Hoc Sensor Networks.

Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.

m-Privacy for Collaborative Data Publishing

PACK: Prediction-Based Cloud Bandwidth and Cost Reduction System

Tweet Analysis for Real-Time Event Detection and Earthquake Reporting System Development.

EAACK—A Secure Intrusion-Detection System for MANETs

A Fast Clustering-Based Feature Subset Selection Algorithm for High- Dimensional Data.

Combining Cryptographic Primitives to Prevent Jamming Attacks in Wireless Networks.

Protecting Sensitive Labels in Social Network Data Anonymization.

Incentive Compatible Privacy-Preserving Data Analysis.

Anonymization of Centralized and Distributed Social Networks by Sequential Clustering.

Accuracy-Constrained Privacy-Preserving Access Control Mechanism for Relational Data.

Content Sharing over Smartphone-Based Delay- Tolerant Networks.

Abstract Link error and malicious packet dropping are two sources for packet losses in multi-hop wireless ad hoc network. In this paper, while observing.

A System for Denial-of- Service Attack Detection Based on Multivariate Correlation Analysis.

Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links.

A Method for Mining Infrequent Causal Associations and Its Application in Finding Adverse Drug Reaction Signal Pairs.

A Generalized Flow-Based Method for Analysis of Implicit Relationships on Wikipedia.

Keyword Query Routing.

Document Clustering for Forensic Analysis: An Approach for Improving Computer Inspection.

A Highly Scalable Key Pre- Distribution Scheme for Wireless Sensor Networks.

Facilitating Document Annotation using Content and Querying Value.

Privacy Preserving Back- Propagation Neural Network Learning Made Practical with Cloud Computing.

Preventing Private Information Inference Attacks on Social Networks.

Video Dissemination over Hybrid Cellular and Ad Hoc Networks.

Scalable Keyword Search on Large RDF Data. Abstract Keyword search is a useful tool for exploring large RDF datasets. Existing techniques either rely.

Abstract We propose two novel energy-aware routing algorithms for wireless ad hoc networks, called reliable minimum energy cost routing (RMECR) and reliable.

Supporting Privacy Protection in Personalized Web Search.

Twitsper: Tweeting Privately. Abstract Although online social networks provide some form of privacy controls to protect a user's shared content from other.

Attribute-Based Encryption With Verifiable Outsourced Decryption.

Multiparty Access Control for Online Social Networks : Model and Mechanisms.

Data Mining with Big Data. Abstract Big Data concerns large-volume, complex, growing data sets with multiple, autonomous sources. With the fast development.

Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.

Privacy-Preserving and Content-Protecting Location Based Queries.

Energy-Efficient Protocol for Cooperative Networks.

Mona: Secure Multi-Owner Data Sharing for Dynamic Groups in the Cloud.

Whole Test Suite Generation. Abstract Not all bugs lead to program crashes, and not always is there a formal specification to check the correctness of.

ONLINE INTRUSION ALERT AGGREGATION WITH GENERATIVE DATA STREAM MODELING.

Load Rebalancing for Distributed File Systems in Clouds.

Facilitating Document Annotation Using Content and Querying Value.

Risk-Aware Mitigation for MANET Routing Attacks Submitted by Sk. Khajavali.

Fast Transmission to Remote Cooperative Groups: A New Key Management Paradigm.

Cooperative Caching in Wireless P2P Networks: Design, Implementation And Evaluation.

Under the Guidance of V.Rajashekhar M.Tech Assistant Professor

Under Guidance- Internal Guide- Ms. Shruti T.V

NYMBLE: BLOCKING MISBEHAVING USERS IN ANONYMIZING NETWORKS

Presentation transcript:

ABSTRACT Due to the Internets sheer size, complexity, and various routing policies, it is difficult if not impossible to locate the causes of large volumes of BGP update messages that occur from time to time. To provide dependable global data delivery we need diagnostic tools that can pinpoint the exact connectivity changes. In this paper we describe an algorithm, called MVS Change, which can pin down the origin of routing changes due to any single link failure or link restoration. Using a simplified model of BGP, called Simple Path Vector Protocol (SPVP), and a graph model of the Internet, MVS Change takes as input the SPVP update messages collected from multiple vantage points and accurately locates the link that initiated the routing changes. We provide theoretical proof for the correctness of the design.

EXISTING SYSTEM An ad-hoc combination of intuition, experience, and informal analysis is often used to speculate the causes of large swings in BGP updates. In addition to the challenge of scale, the underlying Internet topology is not known precisely and the monitoring points provide views from only a limited set of geographic locations. In such an environment, ad-hoc techniques are limited by the expertise of the administrator and it is not easy to identify the underlying events that cause BGP changes. To provide dependable global data delivery, analysis tools are needed that can help us to understand the BGP system and pinpoint the exact cause of connectivity changes.

PROPOSED SYSTEM A formal approach is provided to identify the link failures which are supposed to cause route changes and pinpoint exact connectivity changes. Along with the links failed, the links which are restored or newly added, the links which remains unchanged are identified and the number of links failed, restored, unchanged.

MODULES Initial Graph accessing Assume initial network by open the initial graph. Final Graph accessing Assume final network by open the final graph. Detecting changes Detect changes and result display in different categories (changed links, unchanged links and restored links).

SYSTEM REQUIREMENT SPECIFICATIONS Hardware Requirements: Processor: Pentium IV Hard Disk: 80 GB. RAM: 512 MB. Software Requirements: Operating system : Windows XP Technology: Java 1.6

THANK YOU