共查询到20条相似文献,搜索用时 31 毫秒
1.
Unstructured peer-to-peer (P2P) overlay networks with two-layer hierarchy, comprising an upper layer of super-peers and an underlying layer of ordinary peers, are used to improve the performance of large-scale P2P applications like content distribution and storage. In order to deal with continuous growth of participating peers, a scalable and efficient super-peer overlay topology is essential. However, there is relatively little research conducted on constructing such super-peer overlay topology. In the existed solutions, the number of connections required to be maintained by a super-peer is in direct proportion to the total number of super-peers. For super large-scale P2P applications, i.e. the number of participating peer is over 1,000,000, these solutions are not scalable and impractical. Therefore, in this paper, we propose a scalable hierarchical unstructured P2P system in which a self-similar square network graph (SSNG) is proposed to construct and maintain the super-peer overlay topology adaptively. The SSNG topology is a constant-degree topology in which each node maintains a constant number of neighbor nodes. Moreover, a simple and efficient message forwarding algorithm is presented to ensure each super-peer to receive just one flooding message. The analytical results showed that the proposed SSNG-based overlay is more scalable and efficient than the perfect difference graph (PDG)-based overlay proposed in the literature. 相似文献
2.
超节点对等网的引入,有效解决了网络节点异构性所带来的低性能节点对于文件定位效率低的问题。但是传统超节点对等网构建效率低,不能适应目前高度动态的网络环境。提出一种高效可靠的超节点对等网RSSN,RSSN通过漫步算法对网络叶节点采样,从采样集合中选出高性能节点建立预备超节点,通过判断网络需求调整超节点层,并利用预备超节点备份文件索引信息,提高对等网的稳定性。仿真实验表明,相较Gnutella0.6超节点对等网,RSSN能够有效地提高对等网中超节点的平均性能和利用率,并能适应高动态的网络环境。 相似文献
3.
超节点网络采用超节点作为普通节点服务器,负责管理和查询处理的机制,提高了搜索效率。但是,如果超节点失效,将会严重影响网络的稳定性和查询效率。提出一种高效的容错机制。首先,改进了无向双环结构,提出k-无向双环拓扑结构,并利用此技术,构建了超节点层拓扑结构,使网络具有高容错特性;同时在此基础上,给出了超节点选择和超节点负载均衡的方法,降低了超节点因负载过重而失效的可能性,另外,给出了超节点失效恢复算法和容错路由算法,解决了超节点失效后的恢复和路由问题。实验结果显示,该网络具有易维护、高容错的特点。 相似文献
4.
In this paper we develop a local distributed privacy preserving algorithm for feature selection in a large peer-to-peer environment.
Feature selection is often used in machine learning for data compaction and efficient learning by eliminating the curse of
dimensionality. There exist many solutions for feature selection when the data are located at a central location. However,
it becomes extremely challenging to perform the same when the data are distributed across a large number of peers or machines.
Centralizing the entire dataset or portions of it can be very costly and impractical because of the large number of data sources,
the asynchronous nature of the peer-to-peer networks, dynamic nature of the data/network, and privacy concerns. The solution
proposed in this paper allows us to perform feature selection in an asynchronous fashion with a low communication overhead
where each peer can specify its own privacy constraints. The algorithm works based on local interactions among participating
nodes. We present results on real-world dataset in order to test the performance of the proposed algorithm. 相似文献
5.
在大多数研究中,推选超级节点时重点考虑节点的性能是否适合作超级节点,而没有考虑当有节点从网络中退出或加入时,网络重新构建的开销。在选择超级节点的算法方面,很少有算法同时涉及节点的容量和在网络中的在线时间这两个参数。本算法在Alberto Montresor算法的基础上进行了改进,由信息量概念入手,将节点的容量和在线时间两个因素有机地结合起来,设计了自信息量算法模型。试验结果表明,自信息量模型网络构建的速度和单一使用节点容量构建的速度相仿,但自信息量模型推选的超级节点相对稳定,减少了网络构建的频数,从而减少了网络维护开销。该模型还能够适应一些极端情况,如试验中有50%的节点离开时,仍可较快地构建网络,说明该算法具有一定的鲁棒性。 相似文献
6.
7.
针对超级网络中超级节点可能会导致网络瓶颈、检索结果重复问题,提出一种并行查询和合并机制。首先提出超级节点选择查询节点的算法,以减少超级节点的存储和计算负担。然后提出选择下载节点的合并算法,以得到高质量、新颖和更能有效获取的检索结果。实验结果表明了该机制的有效性。 相似文献
8.
In this paper, we study how to optimize image transmission time in peer-to-peer networks by considering the property of bitstreams
generated by image coding algorithms. Images can be either scalable coded or nonscalable coded. Since transmission of nonscalable
coded images is well understood, we focus on the transmission of scalable coded images in this paper.
Because scalable coding embeds lower bit-rate bitstreams into higher bit-rate bitstreams, there exists a many-to-one relationship
between supplying and requesting peers. When a requesting peer asks for an image coded in a particular bit rate, multiple
peers with the same image but coded in different bit rates can supply to the requesting peer. This enables us to assign the
task of image transmission to multiple supplying peers, split the traffic among these peers, and then reduce overall transmission
time. Therefore, when we transmit scalable coded images over peer-to-peer networks, it is important to design optimal peer
assignment algorithms to minimize the overall transmission time for the requesting peer.
In this paper, we first formally define the peer assignment problem and then establish a sufficient condition on the optimality
of peer assignment. Based on this condition, we propose an optimal peer assignment algorithm in continuous space (OPA-CS)
and then derive a suboptimal peer assignment algorithm in integer space (SOPA-IS). Finally, we carry out extensive experiments
to verify the superior performance of the proposed peer assignment algorithms by comparing with two simple heuristic schemes. 相似文献
9.
超节点P2P(Super-peerP2P)结合了P2P结构和C/S结构的优点,是当前应用最广的一类P2P系统。在超节点P2P网络中,文件访问是最基本的操作,往往使用缓存技术来提高其操作效率。目前大多数超节点P2P网络使用传统的“尽力而为”的缓存机制,该机制没有区分超节点网络中不同节点对资源的需求及关注程度不同,导致偶尔访问的对象替换经常访问的对象。针对“尽力而为”缓存机制的不足,本文提出一种基于语义信息的协同缓存管理机制SCOCM(Semantic-based Cooperative Cache Management mechanism for super-peer net works),应用已经请求对象的语义信息主动地选择对象放置缓存,以兴趣度的远近驱逐缓存内的对象,减少缓存对象的替换,使得每个缓存中缓存的对象之间尽可能地保持语义联系。实验结果表明,基于语义信息的协同缓存管理机制与LRU相比可大大降低缓存的替换率,提高缓存的存取效率,命中率也较高。 相似文献
10.
ERSN:一种高效鲁棒的超结点对等网络 总被引:4,自引:0,他引:4
超结点对等网络利用对等结点的异构性解决了低带宽结点带宽瓶颈问题,但目前超结点对等网络的构建协议效率低且网络拓扑鲁棒性弱.提出一种高效鲁棒的超结点对等网络ERSN,采用基于漫步算法的结点采样协议,估计网络需求,构建高效的超结点对等网络,并建立叶结点间的应急连接,增强超结点对等网络的鲁棒性.模拟实验证明,与Gnutella0.6超结点对等网络比较,ERSN网络中负责处理定位请求的结点数目最多减少了76%,并在多个超结点和叶结点同时离开网络的情况下,将文件定位命中率最大提高了36.4%. 相似文献
11.
This paper addresses the problem of integration of reputation management mechanisms into data look-up and routing processes to cope with some specific security problems in peer-to-peer (P2P) networks based on Distributed Hash Tables (DHT). The goal is to find a mode for “good” peers to cooperate in order to withstand malicious activity of single malevolent peers and their collusions as well.We start from consideration of individual instruments for reputation evaluation that every single peer should be provided with to autonomously define the level of its own trust towards others. We also propose a possible scenario of integration of some existing reputation management techniques and routing mechanisms in a P2P network based on the popular Kademlia algorithm. Then, we present an interaction algorithm that allows peers to obtain the global trust value for each single node through exchanging opinions in the form of local trust values independently calculated by every peer with other members of the community. Such collaboration between peers is indispensable to cope with malicious activity of inconsistent nature specific to DHT-based environment. To render the algorithm resilient to the presence of malicious participants we propose to apply solutions for Byzantine Agreement to exchange opinions among peers. We also provide mathematical evaluations concerning the complexity and computational costs of the proposed algorithm that evidence apparent improvements over the previous one. 相似文献
12.
Ali Mohammad Saghiri Mohammad Reza Meybodi 《Journal of Network and Systems Management》2016,24(2):393-426
Peer-to-peer networks are overlay networks that are constructed over underlay networks. These networks can be structured or unstructured. In these networks, peers choose their neighbors without considering underlay positions, and therefore, the resultant overlay network may have a large number of mismatched paths. In a mismatched path, a message may meet an underlay position several times, which causes redundant network traffic and end-to-end delay. In some of the topology matching algorithms called the heuristic algorithms, each peer uses a local search operator for gathering information about the neighbors of that peer located in its neighborhood radius. In these algorithms, each peer also uses a local operator for changing the connections among the peers. These matching algorithms suffer from two problems; neither the neighborhood radius nor the local operator can adapt themselves to the dynamicity of the network. In this paper, a topology matching algorithm that uses learning automata to adapt the neighborhood radius and an adaptation mechanism inspired from the Schelling segregation model to manage the execution of the local operator is proposed. To evaluate the proposed algorithm, computer simulations were conducted and then the results were compared with the results obtained for other existing algorithms. Simulation results have shown that the proposed algorithm outperforms the existing algorithms with respect to end-to-end delay and number of mismatched paths. 相似文献
13.
针对目前超结点网络研究中的不足,该文基于语义网和小世界理论提出了一种对等网搜索模型——SemanticP2P。模型中结点依据小世界理论在物理上形成自然的区域自治系统(AAS),各AAS依据幂规律选取各域内的超结点,超结点再根据语义关系形成多个超结点语义网(SSN),从而形成一个层次化的超结点叠加网络模型,并对其中结点的组织、SSN的构造、搜索机制等进行了阐述,最后通过实验的验证,证明了模型的合理性与有效性。 相似文献
14.
超节点网络采用两层结构组织超节点和普通节点,有利于提高网络性能和搜索效率.而起节点拓扑结构及其动态维护机制和搜索路由机制,对网络性能和搜索效率具有重要影响.针对已有超节点拓扑结构存在动态维护复杂或查询产生信息多的问题,提出一种新颖的k-Petersen拓扑结构,并利用该结构,建立一种超节点网络KPSPN,给出了KPSPN的路由和动态维护机制.它具有常数度数和固定邻接点特性,不但支持模糊查询,而且解决了结构化超节点拓扑对动态性支持差的问题.模拟结果表明:KPSPN减少了查询所带来的带宽消耗,具有更小的拓扑构造和失效修复成本. 相似文献
15.
Towards an effective integration of cellular users to the structured Peer-to-Peer network 总被引:1,自引:1,他引:0
Mohammad Zulhasnine Changcheng Huang Anand Srinivasan 《Peer-to-Peer Networking and Applications》2012,5(2):178-192
Integration of cellular users into the peer-to-peer (P2P) network is still in limbo due to limitations caused by heterogeneity,
mobility and time-varying capacities of the wireless channel. If traditional Chord is employed to include users from the cellular
networks, users under the same base station scatter in logical topology randomly. In this paper, we present a novel cellular
Chord (C-Chord) P2P system that integrates the cellular users into the well-established structured P2P network in a topology-aware
fashion. C-Chord offers the cellular users a choice of downloading contents either from the Internet peers at a faster rate
or from other cellular users from the same base station avoiding the Internet data penalty. We also incorporate the peer selection
module based on stable marriage problem that chooses the appropriate candidate from the discovered potential senders. We conduct
extensive simulations to evaluate the performance of the proposed C-Chord P2P system and the peer selection module. Simulation
results show that the path-length per lookup query is smaller than that of the traditional Chord system. Overhead due to renewal
of routing information is also smaller for the cellular users in the C-Chord system. We also measure the throughput at the
cellular receivers to analyze the effects of selecting peers either from same base station or from outside the Internet gateway.
Throughput also increases dramatically due to an intelligent selection of peers among the potential senders. 相似文献
16.
17.
Learning automata based dynamic guard channel algorithms 总被引:2,自引:0,他引:2
In this paper, we first propose two learning automata based decentralized dynamic guard channel algorithms for cellular mobile networks. These algorithms use learning automata to adjust the number of guard channels to be assigned to cells of network. Then, we introduce a new model for nonstationary environments under which the proposed algorithms work and study their steady state behavior when they use LR-I learning algorithm. It is also shown that a learning automaton operating under the proposed nonstationary environment equalizes its penalty strengths. Computer simulations have been conducted to show the effectiveness of the proposed algorithms. The simulation results show that the performances of the proposed algorithms are close to the performance of guard channel algorithm that knows all the traffic parameters. 相似文献
18.
19.
由于P2P系统的开放、匿名等特点,使得P2P系统对节点缺乏约束机制,节点间缺乏信任。针对以上问题,本文提出了一种新的P2P系统信任模型,该模型根据系统中节点的历史交易情况和系统中其它节点的推荐计算节点的信任度,节点根据计算的结果决定是否进行交易。仿真试验及分析表明,该模型能有效地评估节点的信任度,隔离恶意节点,提高下载成功率。 相似文献
20.
There is no method to determine the optimal topology for multi-layer neural networks for a given problem. Usually the designer selects a topology for the network and then trains it. Since determination of the optimal topology of neural networks belongs to class of NP-hard problems, most of the existing algorithms for determination of the topology are approximate. These algorithms could be classified into four main groups: pruning algorithms, constructive algorithms, hybrid algorithms and evolutionary algorithms. These algorithms can produce near optimal solutions. Most of these algorithms use hill-climbing method and may be stuck at local minima. In this article, we first introduce a learning automaton and study its behaviour and then present an algorithm based on the proposed learning automaton, called survival algorithm, for determination of the number of hidden units of three layers neural networks. The survival algorithm uses learning automata as a global search method to increase the probability of obtaining the optimal topology. The algorithm considers the problem of optimization of the topology of neural networks as object partitioning rather than searching or parameter optimization as in existing algorithms. In survival algorithm, the training begins with a large network, and then by adding and deleting hidden units, a near optimal topology will be obtained. The algorithm has been tested on a number of problems and shown through simulations that networks generated are near optimal. 相似文献