Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
The characteristics of P2P networks which are open, anonymous, and loosely coupled inter-node lead to false resources, malicious evaluation, and syndicates. A related cluster based trust model for P2P networks named RCTrust is presented in this paper. Peers gather in clusters according to their interest similarity and communication history. There are two kinds of trust relationships. In RCTrust, measure...
Web service discovery is the process of locating web services to meet requirements of service requesters, and is an important ingredient in building loosely-coupled SOA-based applications. In this paper, we propose a graph-based web service matchmaking approach based on WSDL without additional meta data or annotations. We divide the service matchmaking approach into two principal themes: constructing...
Recently, P2P (Peer-to-Peer) technology has witnessed a rapid development. Basically, one of key components in successful P2P applications is how to efficiently look up resources. Considering that structured P2P is a relatively efficient way to locate resources, this paper conducted two improvements to increase the search efficiency in Chord-based algorithms, one of the most popular structured P2P...
Many researchers think that networks with small world effect are always more effective for spread of behavior, but a fewer studies indicated that the behavior spread farther and faster in clustered-lattice networks than in other networks. In this paper, we analyzed the spread of behavior in unstructured peer-to-peer networks with three different topologies. The experimental results show that to get...
With developments of anonymous communication, traditional mix systems have to face more challenges such as scalability, which creates an opportunity for P2P network. In order to solve problems in P2P based anonymous communication, this paper presents a new model introducing both peer's trust and distrust, which represent different points of view in reputation degree. It also achieves anonymity with...
Along with the rapid development of peer-to-peer network technology and the fast increasing number of users, the problems of security in peer-to-peer network is becoming more and more important. By researching the previous trust model of peer-to-peer network, we propose a trust model(PTM) for peer-to-peer networks based on punish mechanism. Firstly, we use the method of social grouping nodes in the...
In open networking environments, resources, services, strategies and actions are voluntarily provided, maintained, chosen and determined by independent, rational and autonomous peers. Basically, Game theory is a basic tool for modeling choices by rational agents in those environments, which, usually assumes players choose strategies which maximize utility of game outcomes given their beliefs about...
Accelerator awareness has become a pressing issue in data movement models, such as MPI, because of the rapid deployment of systems that utilize accelerators. In our previous work, we developed techniques to enhance MPI with accelerator awareness, thus allowing applications to easily and efficiently communicate data between accelerator memories. In this paper, we extend this work with techniques to...
The P2P-assisted video-on-demand (P2P VoD) service has achieved tremendous success among the Internet users. There are three core strategies in the P2P VoD system: the piece selection policy, the peer selection policy as well as the replica management policy. Different from the existing research works that only consider single policy optimization, we for the first time study the existing P2P VoD policies...
Peer-to-peer (P2P) networks are becoming more and more popular. eMule is a typical example. In this paper we aim to automatically and accurately find sensitive files in eMule through rating them based on text classification and we propose two feature expansion methods to improve the accuracy of rating. Experimental results demonstrate that the performance improvement of rating is significant by using...
The overlay approach to dynamic spectrum access recently proposed in information theory allows both primary users (PUs) and secondary users (SUs) to simultaneously access the same spectrum with comparable power levels. However, the information theory approach is based on idealized assumptions that are difficult to be satisfied in practice. We propose a practical scheme with the overlay flavor for...
In a wireless sensor network with mobile sinks, the maintenance of efficient data delivery structure often brings a large amount of control overhead, which may offset the benefit of introducing mobile sinks. In this paper, we propose a multi-stage data routing protocol (called MLRP) to address this problem. To reduce the protocol overhead, MLRP integrates layered Voronoi scoping and dynamic anchor...
A critical challenge for mobile ad hoc networks is the design of efficient routing protocols that are able to provide high bandwidth utilization and desired fairness in mobile wireless environment without any fixed communication establishments. While extensive efforts have already been devoted to providing optimization based, distributed congestion elusion schemes for efficient bandwidth utilization...
Disruption-tolerant networks (DTNs) have gained great attractions recently by addressing intermittent network connectivity suffered due to short radio transmission range, high node mobility, sporadic node densities, etc. Data communication across DTN is achieved over store-carry-forward (SCF) paradigm by exploiting temporary wireless links and connections opportunistically arising from mobility nature...
Application relays can be used to reduce end-to-end latency to provide shorter paths than IP default paths. To fit the large-scale and distributed features of Internet, the nodes can cooperate to form a latency-reducing routing overlay by acting as relays for each other in peer-to-peer paradigms. In this paper, we utilize the triangle inequality violations (TIV) in delay space to model the relays...
In this paper, we present a rendezvous scheme for dynamic spectrum access (DSA) networks that can achieve approximately optimal throughput while not relying on a common control channel. Compared with existing rendezvous schemes for DSA networks that use a common control channel, the proposed scheme avoids congestion and jamming of the control channel, and also reduces control complexity and overhead...
With the development of Internet, as Internet users needed information search tool, the search engine gets more and more users recognition. In order to maximize the sharing of resources, combined with peer network applications, we use P2P technology and lightweight SQLite3 database to research and design an embedded search engine system which is compatible with PC and mobile phone, while mobile phone...
Location Based Notification (LBN) aims to alert the users in a target area with the information of interest to them. With a wide range of applications, LBN has been gaining more and more attraction among wireless users and service providers. The mainstream centralized solution based on cellular networks may incur high service cost. In this paper, we present an innovative scheme called Phoenix, which...
BitTorrent has generated a significant and continuously increasing portion of Internet traffic. Several designs have been recently proposed to reduce the BitTorrent traffic without sacrificing user downloading performance. However, Most of these designs only consider IPv4-only Internet, not thinking about IPv4/IPv6 hybrid network. With the exhaustion of IPv4 addresses and the development of IPv6,...
For behavior diffusion in autonomous and rational networks, most understanding comes from models and ideas borrowed from epidemiology on empirical or synthetic biological networks. However, in rational and autonomous networks, agents make strategic choice about behaviors in contrast being randomly assigned an attribute (such as being infected). Specifically, an agent is assumed to behave rationally...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.