Router Support for Fine-Grained Latency Measurements

projects 2012 Router Support for Fine-Grained Latency Measurements – projects 2012 Projects 2012 Java Networking Technology Used: Java ABSTRACT An increasing number of datacenter network applications, including automated trading and high-performance computing, have stringent end-to-end latency requirements where even microsecond variations may be intolerable. The resulting fine-grained measurement demands cannot be met effectively by existing technologies, such as SNMP, NetFlow, or active probing. Instrumenting routers with a hash-based primitive has been proposed that called as Lossy Difference Aggregator (LDA) to measure latencies down to tens of microseconds even in the…

Read More

Opportunistic Flow-level Latency Estimation using NetFlow

projects 2012 Opportunistic Flow-level Latency Estimation using NetFlow- projects 2012 Projects 2012 Java Networking Technology Used: Java Abstract—The inherent support in routers (SNMP counters or NetFlow) is not sufficient to diagnose performance problems in IP networks, especially for flow-specific problems where the aggregate behavior within a router appears normal. To address this problem, in this paper, we propose a Consistent NetFlow (CNF) architecture for measuring per-flow performance measurements within routers. CNF utilizes existing NetFlow architecture that already reports the first and last timestamps per-flow, and proposes hash-based sampling to ensure…

Read More

MeasuRouting: A Framework for Routing Assisted Traffic Monitoring

projects 2012 MeasuRouting: A Framework for Routing Assisted Traffic Monitoring – projects 2012 Technology Used: Java Projects 2012 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 towards 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…

Read More

Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis

projects 2012 Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis projects 2012- Dot net Technology Used: Dot Net Abstract—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns. Existing SQL aggregations have limitations to prepare data sets because they return one column per aggregated group. In general, a significant manual effort is required to build data sets, where a horizontal layout is required. We propose simple, yet powerful,…

Read More

Scalable Learning of Collective Behavior

projects 2012 Scalable Learning of Collective Behavior -  projects 2012 Abstract: This study of collective behavior is to understand how individuals behave in a social networking environment. Oceans of data generated by social media like Face book, Twitter, Flicker, and YouTube present opportunities and challenges to study collective behavior on a large scale. In this work, we aim to learn to predict collective behavior in social media. In particular, given information about some individuals, how can we infer the behavior of unobserved individuals in the same network? A social-dimension-based approach…

Read More

Independent Directed Acyclic Graphs for Resilient Multipath Routing

projects 2012 Independent Directed Acyclic Graphs for Resilient Multipath Routing Networking,   projects 2012 Feb Technology Used: Java ABSTRACT In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs satisfy the property that any path from a source to the root on one DAG is link-disjoint (node-disjoint) with any path from the source to the root on the other DAG. Given a network, we develop polynomial time algorithms to compute link-independent and node-independent DAGs. The algorithm developed…

Read More

Revisiting Dynamic Query Protocols in Unstructured Peer-to-Peer Networks

projects 2012 Revisiting Dynamic Query Protocols in Unstructured Peer-to-Peer Networks – projects 2012 Parallel Distributed System,   projects 2012 Jan ABSTRACT In unstructured peer-to-peer networks, the average response latency and traffic cost of a query are two main performance metrics. Controlled-flooding resource query algorithms are widely used in unstructured networks such as peer-to-peer networks. In this paper, we propose a novel algorithm named Selective Dynamic Query (SDQ). Based on mathematical programming, SDQ calculates the optimal combination of an integer TTL value and a set of neighbors to control the scope…

Read More

Balancing the Tradeoffs between Query Delay and Data Availability in MANETs

projects 2012 Balancing the Tradeoffs between Query Delay and Data Availability in MANETs – projects 2012 projects 2012, Parallel and Distributed Systems, 2012 In mobile ad hoc networks (MANETs), nodes move freely and link/node failures are common, which leads to frequent network partitions. When a network partition occurs, mobile nodes in one partition are not able to access data hosted by nodes in other partitions, and hence significantly degrade the performance of data access. To deal with this problem, we apply data replication techniques. Existing data replication solutions in both…

Read More

Cooperative Provable Data Possession for Integrity Verification in Multi-Cloud Storage

projects 2012 Cooperative Provable Data Possession for Integrity Verification in Multi-Cloud Storage – projects 2012 projects 2012, Parallel and Distributed Systems, Pre-Print -2012 Provable data possession (PDP) is a technique for ensuring the integrity of data in storage outsourcing. In this paper, we address the construction of an efficient PDP scheme for distributed cloud storage to support the scalability of service and data migration, in which we consider the existence of multiple cloud service providers to cooperatively store and maintain the clients’ data. We present a cooperative PDP (CPDP) scheme…

Read More

BECAN: A Bandwidth-Efficient Cooperative Authentication Scheme for Filtering Injected False Data in Wireless Sensor Networks

projects 2012 BECAN: A Bandwidth-Efficient Cooperative Authentication Scheme for Filtering Injected False Data in Wireless Sensor Networks – projects 2012 projects 2012, Parallel And Distributed Systems, Vol. 23, No. 1, January 2012 Injecting false data attack is a well known serious threat to wireless sensor network, for which an adversary reports bogus information to sink causing error decision at upper level and energy waste in en-route nodes. In this paper, we propose a novel bandwidth-efficient cooperative authentication (BECAN) scheme for filtering injected false data. Based on the random graph characteristics…

Read More