【作者】 罗慧；

【导师】 周继鹏；

【作者基本信息】 暨南大学 ， 计算机软件与理论， 2008， 硕士

【摘要】 对等网络(p2p)是分布式系统和计算机网络的一个研究热点,它对传统网络的优势(如解决服务瓶颈、充分利用带宽)使得它在网络上已经得到广泛的应用,目前,在P2P系统中,研究热点集中在用于构建分布式哈希表的P2P系统,如Chord、CAN、Pastry和Tapestry等,但由于在构建覆盖网络的时候,没有考虑物理网络的拓扑结构,导致了在路由的过程中存在巨大的网络延迟,即出现在覆盖网络上相邻的两个结点在物理网络上需要经过多个结点才可到达的现象。为了解决这种覆盖网络与底层物理网络不匹配的问题,本文提出了一种基于底层物理网络的拓扑算法。该算法在对物理网络根据物理位置情况进行分区的基础上,对每个区域选择区标点和边缘结点,数据的传输由区标点进行整体方向的定向,再由边缘结点负责具体的底层物理传输,最终实现整个物理网络的整体最短路径传输。通过模拟网络表明,此算法是稳定而且高效的。更多还原

【Abstract】 As a hot spot of computer network and distributed system research,p2p has been used widely for it’s advantage to traditional network(such as service bottleneek and bandwidth ).At present, the research focus on p2p systems with distributed hash table ,such as Chord、CAN、Pastry、Tapestry and so on.. but because of no considering the topology construction of physical network when we construct overlay network ,it turns out that there is huge networks delay at the routing process, In other word, adjoin nodes in physical networks become no adjoin in overlap network.In order to solve the problem, which the overlay network does not match with physical network, this paper proposes a new overlay network topology algorithm which is based on physical network. This algorithm chooses region flag node and fringe node for each region according to physical network and divided region, region flag node takes charge of data transmission direction , the fringe node takes charge of specific data transmission direction on physical level, and finally ,data routing minimum route is achieved on the physical network. Simulation results show that this algorithm is stabilize and effective.更多还原