MEASUROUTING: A FRAMEWORK FOR ROUTING ASSISTED TRAFFIC MONITORING PRESENTED BY.

Slides:



Advertisements
Similar presentations
Bandwidth Estimation for IEEE Based Ad Hoc Networks.
Advertisements

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.
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 Due to the Internets sheer size, complexity, and various routing policies, it is difficult if not impossible to locate the causes of large volumes.
WEB USAGE MINING FRAMEWORK FOR MINING EVOLVING USER PROFILES IN DYNAMIC WEBSITE DONE BY: AYESHA NUSRATH 07L51A0517 FIRDOUSE AFREEN 07L51A0522.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Introducing the TE Concept.
Cisco S3 C5 Routing Protocols. Network Design Characteristics Reliable – provides mechanisms for error detection and correction Connectivity – incorporate.
1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
A Flexible Model for Resource Management in Virtual Private Networks Presenter: Huang, Rigao Kang, Yuefang.
SIGCOMM 2003 Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs David Applegate Edith Cohen.
Dynamic routing – QoS routing Other approaches to QoS routing Traffic Engineering Practical Traffic Engineering.
NetFlow Analyzer Drilldown to the root-QoS Product Overview.
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
On the Node Clone Detection inWireless Sensor Networks.
Optimizing Cloud Resources for Delivering IPTV Services Through Virtualization.
Toward a Statistical Framework for Source Anonymity in Sensor Networks.
Abstract Cloud data center management is a key problem due to the numerous and heterogeneous strategies that can be applied, ranging from the VM placement.
Energy-Optimum Throughput and Carrier Sensing Rate in CSMA-Based Wireless Networks.
Annotating Search Results from Web Databases. Abstract An increasing number of databases have become web accessible through HTML form-based search interfaces.
Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks.
Secure Encounter-based Mobile Social Networks: Requirements, Designs, and Tradeoffs.
Minimum Cost Blocking Problem in Multi-path Wireless Routing Protocols.
Cross-Domain Privacy-Preserving Cooperative Firewall Optimization.
Layered Approach using Conditional Random Fields For Intrusion Detection.
A Framework for Mining Signatures from Event Sequences and Its Applications in Healthcare Data.
Improving Network I/O Virtualization for Cloud Computing.
Mobile Relay Configuration in Data-Intensive Wireless Sensor Networks.
m-Privacy for Collaborative Data Publishing
Optimal Client-Server Assignment for Internet Distributed Systems.
Protecting Sensitive Labels in Social Network Data Anonymization.
ANNA UNIVERSITY, CHENNAI PROJECT VIVA FINAL YEAR MCA( ) 04/07/2013.
Hiding in the Mobile Crowd: Location Privacy through Collaboration.
Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks.
Accuracy-Constrained Privacy-Preserving Access Control Mechanism for Relational Data.
Network-Coding Multicast Networks With QoS Guarantees Yuanzhe Xuan and Chin-Tau Lea, Senior Member, IEEE IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 19,
Content Sharing over Smartphone-Based Delay- Tolerant Networks.
A Generalized Flow-Based Method for Analysis of Implicit Relationships on Wikipedia.
Keyword Query Routing.
A Highly Scalable Key Pre- Distribution Scheme for Wireless Sensor Networks.
Video Data Hiding using Forbidden Zone and Selective Embedding Submitted Under Team Members.
Preventing Private Information Inference Attacks on Social 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.
High-Speed Policy-Based Packet Forwarding Using Efficient Multi-dimensional Range Matching Lakshman and Stiliadis ACM SIGCOMM 98.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
The New Policy for Enterprise Networking Robert Bays Chief Scientist June 2002.
Securing Broker-Less Publish/Subscribe Systems Using Identity-Based Encryption.
Dynamic Control of Coding for Progressive Packet Arrivals in DTNs.
Energy-Efficient Protocol for Cooperative Networks.
66th IETF, Montreal, July 2006 PCE Working Group Meeting IETF-66, July 2006, Montreal A Backward Recursive PCE-based Computation (BRPC) procedure to compute.
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.
Risk-Aware Mitigation for MANET Routing Attacks Submitted by Sk. Khajavali.
Cooperative Caching in Wireless P2P Networks: Design, Implementation And Evaluation.
Fragile Watermarking Scheme for Relational Database Fragile Watermarking Scheme for Relational Database.
Software Defined Networking BY RAVI NAMBOORI. Overview  Origins of SDN.  What is SDN ?  Original Definition of SDN.  What = Why We need SDN ?  Conclusion.
Security Using Armstrong Numbers and Authentication using Colors
Under the Guidance of V.Rajashekhar M.Tech Assistant Professor
Towards Scalable Traffic Management in Cloud Data Centers
Constraint-Based Routing
ABSTRACT   Recent work has shown that sink mobility along a constrained path can improve the energy efficiency in wireless sensor networks. Due to the.
ROBUST FACE NAME GRAPH MATCHING FOR MOVIE CHARACTER IDENTIFICATION
Department Of Computer Science Engineering
An Equal-Opportunity-Loss MPLS-Based Network Design Model
Separating Routing Planes using Segment Routing draft-gulkohegde-spring-separating-routing-planes-using-sr-00 IETF 98 – Chicago, USA Shraddha Hegde
Advisor: Yeong-Sung, Lin, Ph.D. Presented by Yu-Ren, Hsieh
Presentation transcript:

MEASUROUTING: A FRAMEWORK FOR ROUTING ASSISTED TRAFFIC MONITORING PRESENTED BY

ABSTRACT:  Monitoring transit traffic at one or more points in a network is of interest to network operators for reasons of traffic accounting, debugging or troubleshooting, forensics, and traffic engineering. Previous research in the area has focused on deriving a placement of monitors across the network toward the end of maximizing the monitoring utility of the network operator for a given traffic routing. However, both traffic characteristics and measurement objectives can dynamically change over time, rendering a previously optimal placement of monitors suboptimal. It is not feasible to dynamically redeploy/reconfigure measurement infrastructure to cater to such evolving measurement requirements. We address this problem by strategically routing traffic subpopulations over fixed monitors. We refer to this approach as MeasuRouting.

EXISTING SYSTEM:  In the Existing System, it is focused on deriving a placement of monitors across the network toward the end of maximizing the monitoring utility of the network operator for a given traffic routing. However, both traffic characteristics and measurement objectives can dynamically change over time, rendering a previously optimal placement of monitors suboptimal. It is not feasible to dynamically redeploy/reconfigure measurement infrastructure to cater to such evolving measurement requirements.

PROPOSED SYSTEM:  In the proposed system, we present a theoretical framework for MeasuRouting, which is to address the problem by strategically routing traffic subpopulations over fixed monitors, which is to work within the constraints of existing intra domain traffic engineering (TE) operations that are geared for efficiently utilizing bandwidth resources, or meeting quality-of-service (QoS) constraints, or both. In this paper, our focus is on the overall monitoring utility, defined as a weighted sum of the monitoring achieved over all flows.

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

SOFTWARE REQUIREMENTS:  Operating system : - Windows XP.  Coding Language: JAVA

MODULES:  Aggregated flows  TE objectives  Macro-flow set  No Routing Loops MeasuRouting (NRL)  Relaxed Sticky Routes MeasuRouting (RSR)  Deep Packet Inspection Trace Capture

Aggregated flows  TE policy is usually defined for aggregated flows. On the other hand, traffic measurement usually deals with a finer level of granularity. For instance, we often define a flow based upon the five-tuple for measurement purposes. Common intra-domain protocols (IGPs) like OSPF and IS-IS] use link weights to specify the placement of traffic for each origin–destination (OD) pair (possibly consisting of millions of flows).

TE objectives  The second way in which MeasuRouting is useful stems from the definition of TE objectives. TE objectives may be oblivious to the exact placement of aggregate traffic and only take cognizance of summary metrics such as the maximum link utilization across the network. An aggregate routing that is slightly different from the original routing may still yield the same value of the summary metric.

Macro-flowset  A macro-flowset may consist of multiple micro- flowsets. denotes the set of micro-flowsets. There is a many-to-one relationship between micro-flowsets and macro-flowsets. Represents the set of micro- flowsets that belong to the macro-flow set.

No Routing Loops MeasuRouting (NRL)  The flow conservation constraints in LTD do not guarantee the absence of loops. In Fig. 1, it is possible that the optimal solution of LTD may involve repeatedly sending traffic between routers,, and in a loop so as to sample it more frequently while still obeying the flow conservation and TE constraints.

Sticky Routes MeasuRouting (RSR)  NRL ensures that there are no routing loops. However, depending upon the exact forwarding mechanisms and routing protocol, NRL may still not be feasible.

Deep Packet Inspection Trace Capture  In this section, we elucidate a practical application of MeasuRouting using actual traffic traces from a real network and with a meaningful definition of flow sampling importance. We consider the problem of increasing the quality of traces captured for subsequent Deep Packet Inspection (DPI).

REFERENCE:  Saqib Raza, Guanyao Huang, Chen-Nee Chuah, Srini Seetharaman, and Jatinder Pal Singh,” MeasuRouting: A Framework for Routing Assisted Traffic Monitoring” IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 20, NO. 1, FEBRUARY 2012.