The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Traditional Clustering is a powerful technique for revealing the "hot" topics among documents. However, it's hard to discover the new type events coming out gradually. In this paper, we propose a novel model for detecting new clusters from time-streaming documents. It consists of three parts: the cluster definition based on Multi-Representation Index Tree (MI-Tree), the new cluster detecting...
Node clustering has wide-ranging applications in decentralized P2P networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks, and so forth. This paper proposes an approach to construct clusters in unstructured P2P networks based on small-world theory. In contrast to centralized graph clustering algorithms, our scheme is completely decentralized and it only uses the knowledge...
Consistent with the characteristics of mobile grid, super-node based overlay network model is proposed in this paper. Clustering problem of nodes is described formally. Based on vivaldi a distributed network coordinate system, the proposed algorithm takes the super-node as core and gathers physically adjacent nodes into a cluster, showing some good characteristics such as distributed, adaptive, lightweight,...
In the technique known as network coordinates, the network latency between nodes is modeled as the distance between points in a metric space. Actual network latencies, however, exhibit numerous triangle inequality violations, which result in significant error between the actual latency and the distance as determined by the network coordinates. In this work, we show how graph clustering techniques...
A lot of large distributed system can benefit from the implement of network coordinate system, which can estimate latencies among Internet hosts. In this paper, we focus on problems in building network coordinate system. Firstly, we analyze the disadvantages of some algorithms that based on fixed reference nodes and algorithms based on unfixed reference nodes. Then we propose a new architecture of...
It is important to identify P2P flows accurately for effective network planning and design, security insuring, network management, network behavior understanding and so on. Firstly, an algorithm for identifying listening port of P2P host (LPIA for short) is proposed. Secondly, a heuristic algorithm of P2P flow identification (PFIA for short) is presented, which combines P2P host's listening port,...
Under web service environment, services' calling or called relationships are usually represented as links. Based on link- or link-content analysis, it may produce tight clusters, which is useful for resource management. However current work only considers the existence of collaboration and it seldom takes service usage context into consideration. In this paper, we suppose to cluster similar services...
In this paper, we propose a biologically-inspired algorithm for clustering distributed data in a peer-to-peer network with a small world topology. The method proposed is based on a set of locally executable flocking algorithms that use a decentralized approach to discover clusters by an adaptive nearest-neighbor non-hierarchical approach and the execution, among the peers, of an iterative self-labeling...
Several coordinate bases embedding schemes have been proposed for scalable estimation of network distance (round trip time) among Internet hosts. These schemes may be broadly categorized into Landmark and distributed peer-to-peer based. While Landmark based approaches suffer from scalability due to the large amount of measurement loads, distributed schemes suffer from stability and accuracy issues...
Data fusion or information collection is one of the fundamental functions in the future cyber-physical systems. But, privacy concerns must be addressed and security must be assured in such systems. It is very challenging to achieve the synergy of privacy and integrity, because privacy preserving schemes try to hide or interfere with data, while integrity protection usually needs to enable peer monitoring...
Wireless spoofing attacks are easy to launch and can significantly impact the performance of networks. Although the identity of a node can be verified through cryptographic authentication, conventional security approaches are not always desirable because of their overhead requirements. In this paper, we propose to use location information, a physical property associated with each node, hard to falsify,...
Node Clustering has wide ranging applications in decentralized Peer-to-Peer (P2P) networks such as P2P file sharing systems, mobile ad-hoc networks, P2P sensor networks and so forth. In this work, We propose two distributed approaches for node clustering that based on the scaled coverage measure (SCM), a measure of the accuracy of the partition of the network into clusters. The novelty of our approaches...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.