SRLG Failure Localization in Optical Networks

SRLG Failure Localization in Optical Networks

SRLG Failure Localization in Optical Networks Technology Used: Dot Net 2011 We introduce the concepts of monitoring paths (MPs) and monitoring cycles (MCs) for unique localization of shared risk linked group (SRLG) failures in all-optical networks. An SRLG failure causes multiple links to break simultaneously due to the failure of a common resource. MCs (MPs) start and end at the same (distinct) monitoring location(s). They are constructed such that any SRLG failure results in the failure of a unique combination of paths and cycles. We derive necessary and sufficient conditions…

Read More

Traceback of DDoS Attacks Using Entropy Variations

Traceback of DDoS Attacks Using Entropy Variations

Technology Used: Java 2011 Distributed Denial-of-Service (DDoS) attacks are a critical threat to the Internet. However, the memoryless feature of the Internet routing mechanisms makes it extremely hard to trace back to the source of these attacks. As a result, there is no effective and efficient method to deal with this issue so far. In this paper, we propose a novel traceback method for DDoS attacks that is based on entropy variations between normal and DDoS attack traffic, which is fundamentally different from commonly used packet marking techniques. In comparison…

Read More

Generalized Probabilistic Flooding In Unstructured Peer-To-Peer Networks

Generalized Probabilistic Flooding In Unstructured Peer-To-Peer Networks

Generalized Probabilistic Flooding In Unstructured Peer-To-Peer Networks Technology Used: Java 2011 Generalization of the basic flooding search strategy for decentralized unstructured peer-to-peer (P2P) networks is done. A peer forwards a query to one of its neighbors using a probability that is a function of the number of connections in the overlay network of both. Moreover, this probability may also depend on the distance from the query originator. To analyze the performance of the proposed search strategy in heterogeneous decentralized unstructured P2P networks we develop a generalized random graph (GRG) based…

Read More

Enabling Public Auditability And Data Dynamics For Storage Security In Cloud Computing

Enabling Public Auditability And Data Dynamics For Storage Security In Cloud Computing

Enabling Public Auditability And Data Dynamics For Storage Security In Cloud Computing Technology Used: Java/ J2EE 2011 Cloud Computing has been envisioned as the next-generation architecture of IT Enterprise. This work studies the problem of ensuring the integrity of data storage in Cloud Computing. In particular, we consider the task of allowing a third party auditor (TPA), on behalf of the cloud client, to verify the integrity of the dynamic data stored in the cloud. The introduction of TPA eliminates the involvement of the client through the auditing of whether…

Read More

On Efficient And Scalable Support Of Continuous Queries In Mobile Peer-To-Peer Environments

On Efficient And Scalable Support Of Continuous Queries In Mobile Peer-To-Peer Environments Technology Used: Java 2011 An efficient and scalable query processing framework for continuous spatial queries in mobile peer-to-peer (P2P) environment is proposed. Due to the limitations in mobile P2P environments, for example, user mobility, limited battery power, limited communication range, and scarce communication bandwidth, it is costly to maintain the exact answer of continuous spatial queries. This work enables user to find an approximate answer with quality guarantees. Two key features to adapt continuous spatial query processing to…

Read More

Ranking Spatial Data by Quality Preferences

Ranking Spatial Data by Quality Preferences Technology Used: Java/ J2EE Knowledge and Data Engineering 2011   A spatial preference query ranks objects based on the qualities of features in their spatial neighborhood. For example, using a real estate agency database of flats for lease, a customer may want to rank the flats with respect to the appropriateness of their location, defined after aggregating the qualities of other features (e.g., restaurants, cafes, hospital, market, etc.) within their spatial neighborhood. Such a neighborhood concept can be specified by the user via different…

Read More

A Personalized Ontology Model for Web Information Gathering

A Personalized Ontology Model for Web Information Gathering

A Personalized Ontology Model for Web Information Gathering Technology Used: Java/ J2EE Knowledge and Data Engineering, 2011 As a model for knowledge description and formalization, ontologies are widely used to represent user profiles in personalized web information gathering. However, when representing user profiles, many models have utilized only knowledge from either a global knowledge base or a user local information. In this paper, a personalized ontology model is proposed for knowledge representation and reasoning over user profiles. This model learns ontological user profiles from both a world knowledge base and…

Read More

Usher: Improving Data Quality with Dynamic Forms

Usher: Improving Data Quality with Dynamic Forms

Usher: Improving Data Quality with Dynamic Forms Technology Used: Java/ J2EE Knowledge and Data Engineering, 2011 Data quality is a critical problem in modern databases. data-entry forms present the first and arguably best opportunity for detecting and mitigating errors, but there has been little research into automatic methods for improving data quality at entry time. In this paper, we propose Usher, an end-to-end system for form design, entry, and data quality assurance. Using previous form submissions, Usher learns a probabilistic model over the questions of the form. Usher then applies…

Read More

Publishing Search Logs – A Comparative Study of Privacy Guarantees

Publishing Search Logs ; A Comparative Study of Privacy Guarantees

Technology Used: Java/ J2EE Knowledge and Data Engineering, 2011 Search engine companies collect the “database of intentions,” the histories of their users’ search queries. These search logs are a gold mine for researchers. Search engine companies, however, are wary of publishing search logs in order not to disclose sensitive information. In this paper we analyze algorithms for publishing frequent keywords, queries and clicks of a search log. We first show how methods that achieve variants of k-anonymity are vulnerable to active attacks. We then demonstrate that the stronger guarantee ensured…

Read More

Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud

Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud

Technology Used: Java / J2EE Parallel and Distributed Systems, 2011 In recent years ad-hoc parallel data processing has emerged to be one of the killer applications for Infrastructure-as-a- Service (IaaS) clouds. Major Cloud computing companies have started to integrate frameworks for parallel data processing in their product portfolio, making it easy for customers to access these services and to deploy their programs. However, the processing frameworks which are currently used have been designed for static, homogeneous cluster setups and disregard the particular nature of a cloud. Consequently, the allocated compute…

Read More