Identity management based on adaptive puzzles to protect P2P systems from Sybil attacks

The Sybil attack consists on the indiscriminate creation of counterfeit identities, by a malicious user (attacker), in large-scale, dynamic distributed systems (for example, Peer-to-Peer). An effective approach to tackle this attack consists in establishing computational puzzles to be solved prior to granting new identities. Solutions based on this approach have the potential to slow down the assignment of identities to malicious users, but unfortunately may affect normal users as well. To address this problem, we propose the use of adaptive computational puzzles as an approach to limit the spread of Sybils. The key idea is to estimate a trust score of the source from which identity requests depart, calculated as a proportion of the number of identities already granted to (the) user(s) associated to that source, in regard to the average of identities granted to users associated to other sources. The higher the frequency (the) user(s) associated to a source obtain(s) identities, the lower the trust score of that source and, consequently, the higher the complexity of the puzzle to be solved. An in-depth analysis of both (i) the performance of our mechanism under various parameter and environment settings, and (ii) the results achieved with an experimental evaluation, considering real-life traces from a Peer-to-Peer file sharing community, has shown the effectiveness of the proposed mechanism in limiting the spread of Sybil identities. While comparatively more complex puzzles were assigned to potential attackers, legitimate users were minimally penalized with easier-to-solve puzzles.     

A novel state cache scheme in structured P2P systems

Large-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Current structured overlays do not identify well the rhythm in the dynamic activities, thus resulting in high maintenance overhead. In this paper, we present a new state cache system, called SCS, that solves the problem by exploiting the access patterns of dynamic activities in P2P systems. SCS partitions the whole P2P network into clusters and dynamically chooses a “super” node in each cluster to selectively record and maintain the routing information for departed nodes most likely to arrive back in the near future. The cached routing information enables SCS to simplify self-organization, reduce system maintenance overhead and provide high quality routing service. The experimental results show that SCS reduces the maintenance overhead by up to 66% while delivering much better routing performance, as compared to current structured P2P systems.     

A practical approach to testing GUI systems

GUI systems are becoming increasingly popular thanks to their ease of use when compared against traditional systems. However, GUI systems are often challenging to test due to their complexity and special features. Traditional testing methodologies are not designed to deal with the complexity of GUI systems; using these methodologies can result in increased time and expense. In our proposed strategy, a GUI system will be divided into two abstract tiers—the component tier and the system tier. On the component tier, a flow graph will be created for each GUI component. Each flow graph represents a set of relationships between the pre-conditions, event sequences and post-conditions for the corresponding component. On the system tier, the components are integrated to build up a viewpoint of the entire system. Tests on the system tier will interrogate the interactions between the components. This method for GUI testing is simple and practical; we will show the effectiveness of this approach by performing two empirical experiments and describing the results found.

基于P2P系统的动态负载均衡算法

在现实的P2P网络环境中,由于节点的计算能力和带宽等方面的异构性,网络负载不均衡现象非常突出.基于数据复制/转移策略,提出一种动态的平衡算法.根据节点的能力,当前节点负载状态、负载转移代价预估算,在整个系统范围内找到一组传输代价较小并且负载较轻的节点集合,从中随机选取较为适宜的节点进行负载转移或者数据复制.试验结果表明,该算法能够有效地均衡负载的分布以及降低负载的迁移率.     

Observability analysis for structured bilinear systems: A graph-theoretic approach

This paper is devoted to the generic observability analysis for structured bilinear systems using a graph-theoretic approach. On the basis of a digraph representation, we express in graphic terms the necessary and sufficient conditions for the generic observability of structured bilinear systems. These conditions have an intuitive interpretation and are easy to check by hand for small systems and by means of well-known combinatorial techniques for large-scale systems.     

A cross-layer approach for partition detection at overlay layer for structured P2P in MANETs

Due to limited radio range and mobility of nodes in mobile ad hoc networks (MANETs), the network partitioning and merging could occur frequently. When structured peer-to-peer (P2P) overlays are running over MANETs, then network partition in the physical network can also cause network partition at the overlay layer. Existing approaches for structured P2P overlay over MANETs do not detect network partition at the overlay layer. This paper proposes a cross-layer approach to detect network partition at the overlay layer for structured P2P overlay over MANETs. Simulation results show that the proposed approach is highly effective and efficient in terms of routing overhead, success ratio and false-negative ratio.     

Balance-Peer:负载均衡的结构化P2P模型

为了有效实现结构化P2P系统中数据均衡分布,借鉴并行数据库中数据划分的基本思想,通过在节点加入和数据加入时的存储均衡算法实现大数据量在系统中存储均衡,使得系统存储差异系数大大降低.设计了一个使用数据划分的结构化P2P模型Balance-Peer.在不需要全局信息的情况下,实现动态数据划分方法.实验结果表明了该存储均衡策略是有效的.     

A structured approach to program optimization

Software engineering should provide software engineers with methodologies and tools suitable for use in that small number of applications where efficiency is really important. In order to do that, the optimization process should be a clearly visible phase of the software lifecycle (regardless of the particular software development paradigm adopted), so that it can be regulated, securing the production of good quality and efficient software. With this in mind, the author suggests an approach to program optimization based on a paradigm, a method, some principles and guidelines, and some well-known techniques     

A structured approach to language design

This report is an attempt at systematizing a set of ground rules for high-level language design. It recommends the use of a hierarchical semantic model schema. HGL, in a step by step, top-down approach imposing more and more structure on the language components as the design becomes solidified. The approach is demonstrated by showing the stepwise design of the high-level language, GRAAL. The method recommended is divided into three major phases. The first is an informal one. The second is encoding the language components into a very high-level model. This high-level design allows a redesign of language components before they have been specified at too detailed a level. The third phase is to design the compiler in HGL using the final language design.     

State and input observability for structured linear systems: A graph-theoretic approach

This paper deals with the state and input observability analysis for structured linear systems with unknown inputs. The proposed method is based on a graph-theoretic approach and assumes only the knowledge of the system's structure. Using a particular decomposition of the systems into two subsystems, we express, in simple graphic terms, necessary and sufficient conditions for the generic state and input observability. These conditions are easy to check because they are based on comparison of integers and on finding particular subgraphs in a digraph. Therefore, our approach is suited to study large-scale systems.     

针对P2P网络中DHT的DoS攻击技术研究

本文分析了基于分布式哈希表查找的大规模P2P系统的固有安全问题,提出了一种针对分布式哈希表系统利用算法复杂度进行DoS攻击的方法,并阐述了执行攻击的条件和构造这类攻击的方法,最后结合P2P网络发展趋势总结了此类攻击方法的局限性和进一步的研究方向。     

Reflect: A practical approach to web semantics

To date, adding semantic capabilities to web content usually requires considerable server-side re-engineering, thus only a tiny fraction of all web content currently has semantic annotations. Recently, we announced Reflect (http://reflect.ws), a free service that takes a more practical approach: Reflect uses augmented browsing to allow end-users to add systematic semantic annotations to any web-page in real-time, typically within seconds. In this paper we describe the tagging process in detail and show how further entity types can be added to Reflect; we also describe how publishers and content providers can access Reflect programmatically using SOAP, REST (HTTP post), and JavaScript. Usage of Reflect has grown rapidly within the life sciences, and while currently only genes, protein and small molecule names are tagged, we plan to soon expand the scope to include a much broader range of terms (e.g., Wikipedia entries). The popularity of Reflect demonstrates the use and feasibility of letting end-users decide how and when to add semantic annotations. Ultimately, ‘semantics is in the eye of the end-user’, hence we believe end-user approaches such as Reflect will become increasingly important in semantic web technologies.     

A practical approach for nonlinear analysis of tensegrity systems

Tensegrity systems are lightweight structures composed of cables and struts. The nonlinear behavior of tensegrity systems is critical; therefore, the design of these types of structures is relatively complex. In the present study, a practical and efficient approach for geometrical nonlinear analysis of tensegrity systems is proposed. The approach is based on the point iterative method. Static equilibrium equations are given in nodes for subsystems, thus the maximum unknown displacement number in each step is three. Pre-stress forces in the system are taken into account in a tangent stiffness matrix, while similar calculations are carried out for each node in the system which has a minimum of one degree of freedom. In each iteration step, the values found in previous steps are used. When it reaches permissible tolerance of calculation, final displacements and internal forces are obtained. The structural behavior of the tensegrity systems were evaluated by the proposed method. The results show that the method can be used effectively for tensegrity systems.     

A structured approach to static semantics correctness

An approach to the correctness proof of static semantics with respect to the standard semantics of a programming language is presented, where correctness means that the properties of the language described by the static semantics, such as type checking, are consistent with the standard semantics. The standard and static semantics are given in a denotational style in terms of some basic domains and domain constructors, which, together with suitable operations, are used to describe fundamental semantic concepts. The domains have different meaning in the two semantics and the static semantics correctness proof is carried out by devising a set of suitable functions between them. We show that the correctness proof can be greatly simplified by structuring the semantics definitions, and we illustrate that by applying the methodology to a simple imperative language. In the example the derivation of a static checking algorithm from the static semantics is described.     

A novel approach to defend multimedia flash crowd in cloud environment

Multimedia Tools and Applications - Cloud computing is an intelligent integration of distributed computing, hardware virtualization techniques, automated data center techniques and Internet...     

A practical approach to software metrics

Metrics programs that create meaningful change in software practice must start with business goals in mind. Software metrics are quantitative standards of measurement for various aspects of software projects. A well-designed metrics program will support decision making by management and enhance return on the IT investment. There are many aspects of software projects that can be measured, but not all aspects are worth measuring. Starting a new metrics program or improving a current program consists of five steps: identify business goals; select metrics; gather historical data; automate measurement procedures; and use metrics in decision making