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.
The traditional P2P routing algorithms generally don't consider the routing security. This paper proposes a new trusted routing mechanism based on trust degree for P2P network. The assessment and calculation of trust degree is the key to achieve the secure routing mechanism. In this paper, an improved method to define trust degree is presented. And then, we present the improved trusted routing mechanism...
Recent years, a new immeasurable information sharing network (IISN) has been supposed to be the complementarities for the next generation network. How to ensure the security of this network, and how to perform the key management for authorized clients? This paper proposed a new three-layer architecture key distribution scheme of IISN based on condition access system. Our scheme in this paper is to...
In this paper, we introduce a generic model to deal with the event matching problem of content-based publish/subscribe systems over structured P2P overlays. In this model, we claim that there are three methods (event-oriented, subscription-oriented and hybrid) to make all the matched pairs (event, subscription) meet in a system. By theoretically analyzing the inherent problem of both event-oriented...
This paper proposes a new authentication mechanism to meet the demand of security for P2P-SIP network. Based on an improved certificateless signature, it achieves mutual authentication through signal interaction between end to end users. From the analysis, this scheme has high performance for defending fabricating identity, tampering and counterfeiting message. It is efficient to hold back replay...
Peer-to-Peer (P2P) networking is beneficial when removing a centralized server. On the other hand, new mechanisms are required to compensate for the central authority, especially for network security and dependability. In this paper, we propose a new fuzzy reputation (Fuzzy-Rep) model to improve security and dependability of P2P e-commerce. The model employs fuzzy logic inference rules to assess transactions...
Efficient resource search in large-scale unstructured peer-to-peer (P2P) systems remains a fundamental challenge. In order to improve search performance, interest-based search is a good way to tackle the challenge. However, the existing interest-based search algorithms pay attention to user interest model and search history, but ignore some influence factors of improving performance. In this paper,...
For the provision of dependable search and rescue capability in dynamic and unpredictable disaster areas, each networked node should have ability to (1) autonomously support and co-operate with each other in a peer-to-peer (P2P) manner to quickly discover and dependably self-configure services available on the disaster area to deliver a real-time capability; (2) modify their behaviours to deliver...
For provision of dependable search and rescue capability in dynamic and unpredictable disaster areas, the networked nodes should have the ability to autonomously support and co-operate with each other in a peer-to-peer (P2P) manner to quickly configure any services available on the disaster area to deliver a real-time capability. In this paper, we present an innovative architectural approach which...
In social networks, people can directly contact some acquaintances that potentially have knowledge about the resources they are looking for. Similarly to social networks, where people are connected by their social relationships, two autonomous peer nodes can be connected in unstructured peer-to-peer (P2P) networks if users in those nodes are interested in each other's data. The similarity between...
This paper proposes a new load balancing strategy based on a systematical research on current load balancing mechanism. The new strategy combines the methods of gossip propagation and replication policy, and adopts two different propagation policies to cope with light and heavy overloaded conditions so as to improve performance of networks. At the end of this paper, we prove the reliability and scalability...
Peer-to-peer (P2P) networks attract attentions worldwide with their great success in file sharing networks (e.g. Napster, Gnutella, BitTorrent, and Kazaa). In the last decade, numerous studies have been devoted to the problem of resource discovery in P2P networks. However, efficient resource discovery remains a key challenge for large-scale P2P networks. An investigation of existing research on resource...
Similarly to social networks where people are connected by their social relationships, two autonomous peer nodes can be connected in unstructured peer-to-peer (P2P) networks if users in those nodes are interested in each other's data. The similarity between P2P networks and social networks, where peer nodes are people and connections are relationships, leads us to believe that human strategies in...
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.