基于Cayley图的无线P2P覆盖网络模型及相关技术研究
|
摘要
随着无线通信技术的快速发展以及移动终端处理能力的日益增强,移动终端用户可以随时随地访问无线网络服务,为P2P应用扩展到无线网络环境中创造了有利的条件。但是,无线网络高度的动态性、有限的无线链路带宽以及无线节点有限的处理能力等因素使Internet上现有的P2P技术很难直接应用到无线网络环境中。因此,如何在现有的无线网络环境中,充分地利用无线网络的自身优势,使P2P技术在无线网络环境中得到广泛地应用,成为当前亟待解决的研究课题。
Cayley图是一种利用群构造图的方法,人们可以使用成熟的代数图论方法分析Cayley图的结构特征和设计Cayley图上的相关算法。特别是由于基于Cayley图的网络模型具有对称性、点传递性、低度、低直径、良好的嵌入性、较高的容错性和路由算法简单等优点,因此,利用代数图论方法研究P2P网络中的相关问题具有较好的理论意义和实用价值。本文围绕Cayley图进行以下三个方面的研究:
1.根据无线Mesh网络的实际特点,本文利用代数群论中的半直积方法,构造了一个基于Cayley图的无线P2P覆盖网络模型。通过采用直接在物理网络拓扑上构造P2P覆盖网络的方法,使覆盖网络与物理网络具有较好的拓扑一致性;通过在无线P2P网络的路由算法中嵌入无线网络中的跨层方法,无线节点的广播特性在资源查找中得到了充分地利用,有效地减少了查找资源的路由跳数。实验结果表明,在动态的无线网络环境下,文中提出的无线P2P网络具有较好的资源查找性能。
2.在结构化P2P网络中,节点上存放资源对象个数的差异性、节点处理能力的异构性以及无线网络的动态性等因素导致P2P网络容易出现负载不均衡问题。本文利用Cayley图优良的可嵌入特性,在基于超立方体结构的P2P覆盖网络上,构建一个二叉树结构的负载均衡模型,用于收集节点的负载和容量信息、生成负载均衡策略和执行负载转移操作;通过在该模型中应用均衡域的操作模式,P2P网络的负载均衡任务可按照并行与分布式进行处理。实验结果表明,在动态的无线网络环境下,文中提出的无线P2P网络具有较好的负载均衡性能,并有效地减少负载转移开销。
3.针对无线P2P网络可用性较差等问题,本文在基于Cayley图的无线P2P网络中,利用Mesh路由器较强的存储和处理能力,提出一个自适应的资源副本管理模型。该模型根据P2P网络中资源流行度的分布特征,动态地调整网络中的资源副本个数;通过利用Cayley图的构造特征和多邻接编码理论,该模型将给定数量的资源副本完美地放置在P2P网络中合适位置的节点上,有效地减少节点接入资源的路径长度。实验结果表明,在动态的无线网络环境下,资源副本管理模型具有较好的自适应调节能力,文中提出的无线P2P网络具有较好的可用性、容错性和可扩展性。
Recently, with the development of wireless communication technology quickly and the processing capability of mobile devices increasingly, users of the mobile devices can access wireless networks services anywhere and anytime, which brings an advantageous opportunity for P2P applications extending into wireless networks. However, the practical characteristics of wireless networks, such as dynamic topology, restricted link transmission bandwidth, limited processing capability of wireless nodes, and so on, which resulted in that the existed P2P technologies designed on the Internet may not be applicable to wireless networks easily. Therefore, how to extend the P2P technology into wireless networks widely by considering the particular nature of wireless networks, and taking full advantage of wireless networks, is becoming an urgent research task.
Cayley graph is a method of constructing graphs using algebra groups, thus people can analyze constructional characteristics and design correlative algorithms of Cayley graphs by using mature algebra graphs theories. In particular, due to symmetry, vertex transitivity, low degree, low diameter, perfect embeddability, high fault tolerance, simple routing algorithms, and other excellent properties of network models based on Cayley graphs, therefore, researches on the key technologies in the P2P networks by using the method of algebra graphs theories has high theoretical significance and applied value. The following three issues based on Cayley graph are studied in this paper:
1. According to particular characteristics of wireless mesh networks, and by using semi-direct product of two groups in the algebra groups theories, a wireless P2P overlay model which is based on Cayley graph, is presented in this paper. A simple approach that P2P overlay network depends upon nodes’neighborhood in the physical network topology, is used during designing P2P overlay networks, then, topology consistency between the overlay network and the physical network is kept well. In addition, the method of cross-layer in wireless networks is also used in the proposed routing algorithm, then, the 1-hop broadcast communication occurring in wireless networks is utilized adequately during searching resources in an distributed way, which speed up the lookup operations by exploiting the information that is available at the MAC layer evidently. Simulation results show our proposed P2P network can achieve optimal performance of searching resources under dynamic wireless network condition.
2. The non-uniform distribution of resource objects stored at a peer node, the heterogeneity nature of nodes’capabilities and the dynamic character of wireless networks, which are resulted in load imbalance issue in dynamic structured P2P networks. By using perfect embeddability of Cayley graphs, a binary-tree based load balancing model which is constructed on top of the hypercube P2P overlay network is presented in this paper. Then, collecting load and capacity information of nodes, making the decision of load balancing and transferring the overloaded loads can be finished in each balancing domain independently. By using of the balancing domain in the proposed model, therefore, the operation of load balancing can be implemented in each balancing domain in a distributed and parallel way. Simulation results show that the proposed scheme achieves load balancing under dynamic wireless network condition, and the load movement cost is reduced greatly during the process of load balancing.
3. Aim at the bad availability and other existed problems of wireless P2P networks, and by using powerful storage and processing capability of wireless mesh routers, an adaptive management model of resource replicas which is based on Cayley graph in wireless P2P networks, is proposed in this paper. According to the dynamic feature of resource popularity and nodes’load state, the proposed model can adjust the number of resource replicas adaptively in the P2P networks. Besides, by using multiple-adjacency code theories and construction character of Cayley graphs, the proposed model can place the known number of resource replicas onto the appropriate nodes perfectly in the P2P networks, then, access hops between the resource requester node and the offering resource nodes are greatly reduced. Simulation results show that the proposed model has perfect adjustable capability, and yields improvement on the availability, fault tolerance and scalability under dynamic wireless network environment in the P2P network.
Cayley图是一种利用群构造图的方法,人们可以使用成熟的代数图论方法分析Cayley图的结构特征和设计Cayley图上的相关算法。特别是由于基于Cayley图的网络模型具有对称性、点传递性、低度、低直径、良好的嵌入性、较高的容错性和路由算法简单等优点,因此,利用代数图论方法研究P2P网络中的相关问题具有较好的理论意义和实用价值。本文围绕Cayley图进行以下三个方面的研究:
1.根据无线Mesh网络的实际特点,本文利用代数群论中的半直积方法,构造了一个基于Cayley图的无线P2P覆盖网络模型。通过采用直接在物理网络拓扑上构造P2P覆盖网络的方法,使覆盖网络与物理网络具有较好的拓扑一致性;通过在无线P2P网络的路由算法中嵌入无线网络中的跨层方法,无线节点的广播特性在资源查找中得到了充分地利用,有效地减少了查找资源的路由跳数。实验结果表明,在动态的无线网络环境下,文中提出的无线P2P网络具有较好的资源查找性能。
2.在结构化P2P网络中,节点上存放资源对象个数的差异性、节点处理能力的异构性以及无线网络的动态性等因素导致P2P网络容易出现负载不均衡问题。本文利用Cayley图优良的可嵌入特性,在基于超立方体结构的P2P覆盖网络上,构建一个二叉树结构的负载均衡模型,用于收集节点的负载和容量信息、生成负载均衡策略和执行负载转移操作;通过在该模型中应用均衡域的操作模式,P2P网络的负载均衡任务可按照并行与分布式进行处理。实验结果表明,在动态的无线网络环境下,文中提出的无线P2P网络具有较好的负载均衡性能,并有效地减少负载转移开销。
3.针对无线P2P网络可用性较差等问题,本文在基于Cayley图的无线P2P网络中,利用Mesh路由器较强的存储和处理能力,提出一个自适应的资源副本管理模型。该模型根据P2P网络中资源流行度的分布特征,动态地调整网络中的资源副本个数;通过利用Cayley图的构造特征和多邻接编码理论,该模型将给定数量的资源副本完美地放置在P2P网络中合适位置的节点上,有效地减少节点接入资源的路径长度。实验结果表明,在动态的无线网络环境下,资源副本管理模型具有较好的自适应调节能力,文中提出的无线P2P网络具有较好的可用性、容错性和可扩展性。
Recently, with the development of wireless communication technology quickly and the processing capability of mobile devices increasingly, users of the mobile devices can access wireless networks services anywhere and anytime, which brings an advantageous opportunity for P2P applications extending into wireless networks. However, the practical characteristics of wireless networks, such as dynamic topology, restricted link transmission bandwidth, limited processing capability of wireless nodes, and so on, which resulted in that the existed P2P technologies designed on the Internet may not be applicable to wireless networks easily. Therefore, how to extend the P2P technology into wireless networks widely by considering the particular nature of wireless networks, and taking full advantage of wireless networks, is becoming an urgent research task.
Cayley graph is a method of constructing graphs using algebra groups, thus people can analyze constructional characteristics and design correlative algorithms of Cayley graphs by using mature algebra graphs theories. In particular, due to symmetry, vertex transitivity, low degree, low diameter, perfect embeddability, high fault tolerance, simple routing algorithms, and other excellent properties of network models based on Cayley graphs, therefore, researches on the key technologies in the P2P networks by using the method of algebra graphs theories has high theoretical significance and applied value. The following three issues based on Cayley graph are studied in this paper:
1. According to particular characteristics of wireless mesh networks, and by using semi-direct product of two groups in the algebra groups theories, a wireless P2P overlay model which is based on Cayley graph, is presented in this paper. A simple approach that P2P overlay network depends upon nodes’neighborhood in the physical network topology, is used during designing P2P overlay networks, then, topology consistency between the overlay network and the physical network is kept well. In addition, the method of cross-layer in wireless networks is also used in the proposed routing algorithm, then, the 1-hop broadcast communication occurring in wireless networks is utilized adequately during searching resources in an distributed way, which speed up the lookup operations by exploiting the information that is available at the MAC layer evidently. Simulation results show our proposed P2P network can achieve optimal performance of searching resources under dynamic wireless network condition.
2. The non-uniform distribution of resource objects stored at a peer node, the heterogeneity nature of nodes’capabilities and the dynamic character of wireless networks, which are resulted in load imbalance issue in dynamic structured P2P networks. By using perfect embeddability of Cayley graphs, a binary-tree based load balancing model which is constructed on top of the hypercube P2P overlay network is presented in this paper. Then, collecting load and capacity information of nodes, making the decision of load balancing and transferring the overloaded loads can be finished in each balancing domain independently. By using of the balancing domain in the proposed model, therefore, the operation of load balancing can be implemented in each balancing domain in a distributed and parallel way. Simulation results show that the proposed scheme achieves load balancing under dynamic wireless network condition, and the load movement cost is reduced greatly during the process of load balancing.
3. Aim at the bad availability and other existed problems of wireless P2P networks, and by using powerful storage and processing capability of wireless mesh routers, an adaptive management model of resource replicas which is based on Cayley graph in wireless P2P networks, is proposed in this paper. According to the dynamic feature of resource popularity and nodes’load state, the proposed model can adjust the number of resource replicas adaptively in the P2P networks. Besides, by using multiple-adjacency code theories and construction character of Cayley graphs, the proposed model can place the known number of resource replicas onto the appropriate nodes perfectly in the P2P networks, then, access hops between the resource requester node and the offering resource nodes are greatly reduced. Simulation results show that the proposed model has perfect adjustable capability, and yields improvement on the availability, fault tolerance and scalability under dynamic wireless network environment in the P2P network.
引文
[1]Akyildiz I.F., Wang X., Wang W. Wireless mesh networks: a survey [J]. Computer networks, 2005, 47(4): 445-487
[2]无线网状网再成热点[EB/OL]. http://www.c114.net/interview/340/a203948.html, 2006-9-22
[3]国际电信联盟: 2010年全球手机用户达52.8亿[EB/OL]. http://news .ccidnet.com/art/- -1032/20110127/2304993_1.html, 2011-1-27
[4]P2P应用识别与控制技术白皮书[EB/OL]. http://www.ppcn.net/n7426c2.aspx, 2009-6-26
[5]网络开放还是限制谁说了算[EB/OL]. http://ido.3mt.com.cn/Article/200609/show485- -320c9p1.html, 2006-9-12
[6]2006年中国P2P流媒体研究报告[EB/OL]. http://www.cmrn.com.cn/yjbg/jiaoyu/c/200- -711/21599.html, 2007-11-28
[7]欧中洪,宋美娜,战晓苏等.移动对等网络关键技术[J].软件学报, 2008, 19(2): 404-418
[8]Camp J.D., Knightly E.W., Reed W.S. Developing and deploying multihop wireless networks for low-income communities [J]. Journal of Urban Technology, 2006, 129(13): 1063–0732
[9]Jun Jangeun, Sichitiu M.L. The nominal capacity of wireless mesh networks [J]. Wireless Communications, 2003, 10(5): 8-14
[10]Ashish R., Chiueh Tzi-cker. Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network [A]. Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies [C]. Washington: IEEE Computer Society, 2005: 2223-2234
[11]Snmino H., Ishikawa N., Kato T. Design and implementation of P2P protocol for mobile phones [A]. Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops [C]. Washington: IEEE Computer Society, 2006: 157-162, 2006.
[12]Klemm A., Lindemann C., Waldhorst O.P. A special-purpose peer-to-peer file sharing system for mobile ad hoc networks [A]. 2003 IEEE 58th Vehicular Technology Conference [C]. Washington: IEEE Computer Society, 2003: 2758-2763
[13]Raivio Yrjo. A peer-to-peer overlay architecture for mobile networks[R]. Helsinki: Helsinki University of Technology, 2005
[14]Andersen Frank-Uwe, Meer H.de, Dedinski I, et al. An architecture concept for mobile p2p file sharing services [A]. Proceedings of Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications [C]. Washington: IEEE Computer Society, 2004: 229-233
[15]eDonkey [EB/OL]. http://www.eDonkey.com/
[16]Hofeld T., Tutschku K., Andersen F.U. Mapping of file-sharing onto mobile environments: Feasibility and performance of eDonkey with GPRS [A]. 2005 IEEE Wireless Communications and Networking Conference [C]. Washington: IEEE Computer Society, 2005: 2453-2458
[17]Hofeld T., Tutschku K., Andersen F.U. Mapping of file-sharing onto mobile environments: Enhancement by UMTS [A]. Third IEEE International Conference on Pervasive Computing and Communications Workshops [C]. Washington: IEEE Computer Society, 2005: 43-49
[18]Peng Gang, Li Shanping, Jin Hairong, et al. M-CAN: a lookup protocol for mobile peer-to-peer environment [A]. Proceedings. 7th International Symposium on Parallel Architectures, Algorithms and Networks [C]. Washington: IEEE Computer Society, 2004: 544-549
[19]Ratnasamy S., Francis P.,Handley M., et al. A scalable content addressable network [A]. Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications [C]. New York: ACM Press, 2001: 161- 172
[20]Cramer C., Fuhrmann T. ISPRP: A message-efficient protocol for initializing structured P2P networks [A]. 24th IEEE International Performance, Computing, and Communications Conference [C]. Washington: IEEE Computer Society, 2005: 365-370
[21]Stoica I., Morris R., Karger D.R., et al. Chord: A scalable peer-to-peer lookup protocol for internet applications [J]. IEEE/ACM transactions on networking, 2003, 11(1): 17-32
[22]JXME [EB/OL]. http://Jxme.jxta.org/
[23]JXTA [EB/OL]. http://www.jxta.org/
[24]Proem [EB/OL]. http://www.proem.com/
[25]Horozov T., Grama A., Vasudevan V., et al. MOBY- A mobile peer-to-peer service and data network [A]. Proceedings of the International conference on parallel processing [C]. Washington: IEEE Computer Society, 2002: 437-444
[26]Kodeswaran S.B., Ratsimor O., Joshi A.,et al. Using peer-to-peer data routing for infrastructure-based wireless networks [A]. First IEEE International Conference on Pervasive Computing and Communications (PerCom'03) [C]. Washington: IEEEComputer Society, 2003: 305-312
[27]Rowstron A., Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems [A]. Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms [C]. London: Springer-Verlag, 2001: 329-350
[28]Cayley A.The theory of graphs, graphical representation [J]. Cambridge Mathematical Papers, 1895, 10(3): 26-28
[29]Akers S.B., Krishnamurthy B. A group-theoretic model for symmetric interconnection networks [J]. IEEE Transactions on Computer, 1989, 38(4): 555-566
[30]Day K., Tripathi A. A comparative study of topological properties of hyper-cubes and star graphs [J]. IEEE Transactions on parallel and distributed systems, 1994, 5(1): 31-38
[31]Roichman Y. Expansion properties of Cayley graphs of the alternating Combinatorial theory [J].1997, 79(A): 281-279
[32]Bass D.W., Sudborough I.H. Pancake problems with restricted prefix reversals and some corresponding Cayley networks [J]. Journal of Parallel and Distributed Computing, 2003, 63(6): 327-336.
[33]Latifi S., Srimani P.K. SEP: A Fixed Degree Regular Network for Massively Parallel Systems [J]. The Journal of Supercomputing, 1998, 12(6): 277-291
[34]Fen Lin Wu, S. Lakshmivarahan, S. K. Dhall. Routing in a class of Cayley graphs of semidirect products of finite groups [J]. Journal of Parallel and distributed computing, 2000, 60: 539-565
[35]Stojmennovic I. Honeycomb networks: topological properties and communication algorithms [J]. IEEE Transactions on Parallel and Distributed Systems, 1997, 10(8): 103-1042
[36]Xiao Wenjun, Peng limin. On general models of complex networks with some applications [A]. Proceedings 2009 1st IEEE Symposium on Web Society [C]. Washington: IEEE Computer Society, 2009: 153-156
[37]王萼芳.有限群论基础[M].北京:清华大学出版社, 2004:1-36
[38]Biggs N. Algebraic Graph Theory [M].Cambridge University Press, 1974:17-89
[39]Biggs N. White A. T. Permutation Groups and Combinatorial Structures [M]. Cambridge University Press, 1979:23-76
[40]徐明曜,黄建华,李慧陵等.有限群论导引[M].北京,科学出版社, 1999:321-379
[41]Xiao Wenjun, Parhami B. Cayley graph as models of deterministic small-world networks[J], Information Processing Letters, 2006, 97(3): 115–117
[42]Xiao Wenjun, Parhami B. A group construction method with applications to deriving pruned interconnection networks [J]. IEEE Transactions on Parallel and Distributed Systems, 2007, 18(5): 637-643
[43]Xiao Wenjun, Parhami B. Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks [J]. Journal of Computer and System Sciences, 2007, 73(8): 1232-1239
[44]Hayes J.P., Mudge T., Stout Q.F.,et al. A microprocessor-based hypercube supercomputer [J]. IEEE Micro, 1986, 11(6): 6-17
[45]徐俊明.组合网络理论[M].北京:科学出版社, 2007:95-106,160-163
[46]Harary F. Recent results and unsolved problems on hypercube theory [J]. Graph theory combinatorics and applications, 1991(2): 621-632
[47]Zhao Y., Kubiatowicz J., Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing [R]. Berkeley: University of California, 2000
[48]Malkhi D., Naor M., Ratajczak D. Viceroy: A scalable and dynamic emulation of the butterfly [A]. Proceedings of the twenty-first annual symposium on Principles of distributed computing [C]. New York: ACM Press, 2002: 183-192
[49]Kaashoek M.F., Karger D.R. Koorde: A simple degree optimal distributed hash table [A]. Proceedings of the International Peer-to-Peer Symposium [C]. Berlin-Heidelberg: Springer-Verlag, 2003: 98-107
[50]Xu J., Kumar A., Yu X.X. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks [J]. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 151-163
[51]Kumar A., Merugu S., Xu J., et al. Ulysses: A robust, low-diameter, low-latency peer-to-peer network [J]. European transaction on telecommunications, 2004, 15(6): 571-587
[52]Shen H.Y., Xu C.Z., Chen G. Cycloid: A new constant degree and lookup efficient P2P overlay network [J]. Performance Evaluation, 2006, 63(3): 195-216
[53]于真,姚宣霞,王颖等.一种P2P网络拓扑构造方法DPT [J].四川大学学报(工程科学版), 2010, 42(4): 103-110
[54]魏文红,肖文俊,黄书强等.结构化P2P覆盖网络的Cayley图构造方法研究[J].计算机科学, 2009, 36(4): 81-83
[55]Yu Jaewook, Kim Dongsoo, Tang K. Wendy. Dense and symmetric graph formulation andgeneration for wireless information networks [J]. Information processing letters, 2006, 97(3): 115-117
[56]曲大鹏,王兴伟,黄敏.基于MANET的P2P网络跨层方法综述[J].计算机科学, 2010, 37(2): 31-37.
[57]Huang Chung-Ming, Hsu Tz-Heng, Hsu Ming-Fa. Network-aware P2P file sharing over the wireless mobile networks [J]. IEEE Journal on selected areas in communications, 2007, 25(3): 204-210.
[58]Shin M., Arbaugh W.A. Efficient peer-to-peer lookup in multi-hop wireless networks [J]. KSII transactions on internet and information systems, 2009, 3(1): 5-24
[59]Gallucciom L., Morabito G., Palazzo S., et al. Georoy: A location-aware enhancement to viceroy peer-to-peer algorithm [J]. Computer networks, 2007, 51(8): 379-398
[60]Canali C., Renda M.E., Santi P., et al. Enabling efficient peer- to-peer resource sharing in wireless mesh networks [J]. IEEE transactions on mobile computing, 2010, 9(3): 333-347
[61]郭达,张勇,彭晓川等.无线网状网:架构、协议与标准[M].北京:电子工业出版社, 2008:5-12
[62]The network simulator-ns-2 [EB/OL]. http://nsnam.isi.edu/nsnam/index.php
[63]Johnson D.B., Maltz D.A. Broch Josh. DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks [A]. Proceedings of the Ad Hoc Networking [C]. New York: Addison-Wesley, 2001: 139-172
[64]Karger D., Lehman E., Leighton T., et al. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web [A]. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing [C]. New York: ACM Press, 1997: 654-663
[65]Saroiu S., Gummadi P.K., Gribble S.D. A measurement study of peer-to-peer file sharing systems [A].Proceedings of multimedia computing and networking (MMCN) [C], Washington: IEEE Computer Society, 2002: 156-170
[66]Chu J.C., Labonte K.S., Levine B. Availability and locality measurements of peer-to-peer file systems [A].Proceedings of the ITCom: Scalability and Traffic Control in IP Networks [C]. Boston:SPIE, 2002: 769-776
[67]Zhang Ming, Zhang Chi, Pai V., et al. PlanetSeer: Internet path failure monitoring and characterization in wide-area services [A]. Proceedings of the 6th conference on Symposium on Operating Systems Design & Implementation [C]. New York: ACMPress, 2004: 634-642
[68]Willebeek L H., Reeves A P. Strategies for dynamic load balancing on highly parallel computers [J]. IEEE Transactions on parallel and distributed systems, 1993, 9(4): 979-993
[69]Rao A., Lakshminarayanan K., Surana S., et,al. Load balancing in structured P2P systems [A]. Proceedings of IPTPS [C]. Berlin-Heidelberg: Springer-Verlag, 2003: 68-79
[70]Godfrey B., Lakshminarayanan K., Surana S., et al. Load balancing in dynamic structured P2P systems [A]. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies [C]. Washington: IEEE Computer Society, 2004: 2253-2262
[71]Zhu Yingwu, Hu Yiming. Efficient, proximity-aware load balancing for DHT-based P2P systems [J]. IEEE Transactions on parallel and distributed systems, 2005, 16(4): 349-361
[72]李振宇,谢高岗.基于DHT的P2P系统的负载均衡算法[J].计算机研究与发展, 2006, 43(9): 1579-1585
[73]Rostami Habib, Habibi Jafar. A Mathematical Foundation for Topology Awareness of P2P Overlay Networks [A]. In the 4th International Conference on Grid and Cooperative Computing [C]. Berlin-Heidelberg: Springer-Verlag, 2005: 906–918
[74]Chen Chyouhwa, Tsai Kun-Cheng. The server reassignment problem for load balancing in structured P2P systems [J]. IEEE Transactions on parallel and distributed systems, 2008, 19(2): 1-13
[75]Laguna M., Kelly J.P., Velard JL G., et al. Tabu search for the multilevel generalized assignment problem [J]. European Journal operational research, 1995, 82(9): 176-189
[76]Peng Limin, Cao Zhanmao. Fairness resource allocation and scheduling for IEEE 802.16 Mesh networks [J]. Journal of networks, 2010, 5(6): 724-732
[77]徐玖平,李军.多目标决策的理论与方法[M].北京:清华大学出版社, 2005:91-1125
[78]Meadowcroft T.A., Stephanopoulos G., Brosilow C. The modular multivariable controller: steady-state properties [J]. Journal of AIChE, 1992, 38(8): 1254-1278
[79]董加礼.多目标优化的方法和理论[M].长春:吉林教育出版社, 1992:56-68
[80]吴刚,陆旭东,应爱国等.模块多变量自校正调节器[J].自动化学报, 2000, 6(6): 811-815
[81]张泉灵,王树青.基于Hammerstein模型的非线性预测函数控制[J].浙江大学学报(工学版), 2002, 36(2): 119-122
[82]Plaxton C. G., Rajaraman R, Richa A. W. Accessing nearby copies of replicated objects ina distributed environment [A]. Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures [C]. New York: ACM Press, 1997:241-280
[83]彭利民,肖文俊.一种具有常数度的无线P2P覆盖网络[J].四川大学学报(工程科学版), 2011(43)4: 124-130
[84]Gharib M., Barzegar Z., Habibi J. A Novel Method for Supporting Locality in Peer-to-Peer overlays Using Hypercube Topology [A]. 2010 International Conference on Intelligent Systems, Modelling and Simulation [C]. Washington: IEEE Computer Society, 2010: 391-395
[85]Gupta Ajay K., Hambrusch Susanne E. Embedding complete binary trees into butterfly networks [J]. IEEE transactions on computers, 1991, 40(7): 853-863
[86]Cybenko G. Dynamic load balancing for distributed memory multiprocessors [J]. Journal of parallel and distributed processing, 1989, 7(2): 279-301
[87]Eager D., Lazowska G., Zahorjan J. Adaptive load sharing in homogeneous distributed systems [J]. IEEE Transactions on software engineering, 1986, 12(5) : 662-675
[88]Woo J., Sahni S. Load balancing on a hypercube [A]. Proceedings of the Fifth International Parallel Processing Symposium [C]. Washington: IEEE Computer Society, 1991: 525-530
[89]Martins Vidal, Pacitti Esther, Valduriez Patrick. Survey of data replication in P2P systems [R]. INRIA: Universitéde Nantes, 2006
[90]Rowstron A., Druschel P. Storage Management and Caching in PAST, a Large-Scale, Persistent Peer-to-Peer Storage Utility [A]. Proceedings of the eighteenth ACM symposium on Operating systems principles [C]. New York: ACM Press, 2001: 188-201
[91]Dabek F., Kaashoek MF., Karger D., et al. Wide Area Cooperative Storage with CFS [A]. Proceedings of the eighteenth ACM symposium on Operating systems principles [C]. New York: ACM Press, 2001: 344?352
[92]Stading T.,Maniatis P., Baker M. Peer-to-Peer Caching Schemes to Address Flash Crowds [A]. Proceedings of the 1st International Peer To Peer Systems Workshop [C]. Berlin-Heidelberg: Springer-Verlag, 2000: 203-213
[93]Gopalakrishnan V., Silaghi B., Bhattacharjee B.,et al. Adaptive Replication in Peer-to-Peer Systems [A]. Proceedings of 24th International Conference on Distributed Computing Systems [C]. Washington: IEEE Computer Society, 2004: 360-369
[94]Gnutella[EB/OL]. http://www.gnutella.com/
[95]Roussopoulos M., Baker M. CUP: Controlled Update Propagation in Peer to PeerNetworks [A]. Proceedings of the 2003 USENIX Annual Technical Conference [C]. Texas: USENIX, 2003: 167-180
[96]Yin Liangzhong, Cao Guohong. DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer Networks [A]. Proceedings of the 21st International Conference on Data Engineering [C]. Washington: IEEE Computer Society, 2005: 258-259
[97]Cox Russ, Muthitacharoen A., Morris R.T. Serving DNS Using a Peer-to-Peer Lookup Service [A]. Proceedings of the First International Workshop on Peer-to-Peer Systems [C]. New York: ACM Press, 2002: 155-165
[98]Derhab A., Badache N. Data replication protocol for mobile ad-hoc networks: A survey and taxonomy [J]. IEEE communications surveys and tutorials, 2009, 11(2): 33-51
[99]Wang Szu-Chi, Chou Hong-Zu,David S.L.,et al. On the fundamental performance limits of peer-to-peer data replication in wireless Ad hoc networks [J].IEEE Journal on selected areas in communications, 2007, 25(1): 211-220
[100]Tang Bin, Gupta H., Das S. Benefit-based Data Caching in Ad Hoc Networks [J]. IEEE Transactions on Mobile Computing, 2008, 7(3): 289-304
[101]Hara T., Madria S. K. Data replication for improving data accessibility in Ad hoc networks [J]. IEEE transactions on mobile computing, 2006, 5(11): 1515-1532
[102]Yin L., Cao G. Supporting cooperative caching in ad hoc networks [J]. IEEE Transactions on Mobile Computing, 2006, 5(1): 77-89.
[103]Zhao J., Zhang P., Cao G., et al. Cooperative caching in wireless p2p networks: Design, implementation, and evaluation [J]. IEEE Transactions on Parallel and Distributed Systems, 2010, 21(7): 229–241.
[104]Nkwe T.K.R., Denko M. K. Self-optimizing cooperative caching in autonomic Wireless Mesh Networks [A]. IEEE Symposium on Computers and Communications [C]. Washington: IEEE Computer Society, 2009: 411-416
[105]Wu weigang, Huang yifei. Hierarchical cooperative data caching for wireless mesh network [A]. 2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing [C]. Washington: IEEE Computer Society, 2010: 289-296
[106]Das S. M., Pucha H., Hu Y. C. Mitigating the gateway bottleneck via transparent cooperative caching in wireless mesh networks [J]. Ad Hoc Networks, 2007, 5(6): 680–703
[107]Alasaad A., Gopalakrishnan S., Leung V. C.M. Content Caching and Replication Schemes for Peer-to-Peer File Sharing in Wireless Mesh Networks [A]. Proceedings of the IEEE GLOBECOM Workshops (GC Wkshps) [C]. Washington: IEEE ComputerSociety, 2010:1707-1711
[108]Jin Shudong, Wang Limin. Content and service replication strategies in multihop wireless mesh networks [A]. Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems [C]. New York: ACM Press, 2005: 79–86
[109]Chen Hsing-Lung, Tzeng Nian-Feng. Efficient resource placement in hypercubes using multiple-adjacency codes [J]. IEEE transaction on computers, 1994, 43(1): 23-32.
[110]Liveingston M., Stout Q.F. Distributing resources in hypercube computers [A]. Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues [C]. New York: ACM Press, 1998: 222-231
[111]Chiu G. M., Raghavendra C. S. Resource allocation in hypercube systems [A].Proceedings of the 5th distributed memory computing conference [C]. Washington: IEEE Computer Society, 1990: 894-902
[112]Blahut R E. Theory and practices of error control codes [M]. MA: Addison-Wesley, 1983
[113]Saad Y, Schultz M. H. Topology properties of hypercubes [J]. IEEE transaction on computer, 1988, 37(6), 867-872
[114]Preparata F. P., Vuillemin J. The cube-connected cycles: a versatile network for parallel computation [J]. Communications of the association for computing machinery, 1981, 24(5): 300-309
[115]Wittie L. D. Comunication structures for large networks of microcomputers [J]. IEEE transactions on computer, 1990, 30(4): 264-273
[116]Peng Limin, Wei wenhong, Xiang jun. A new addressing scheme for cube-connected cycles network [A]. 3rd IEEE Conference on Industrial Electronics and Applications [C]. Washington: IEEE Computer Society, 2008: 586-590
[117]Kangasharju J., Ross K. W., Turner D A. Optimizing file availability in peer-to-peer content distribution [A]. IEEE 26th IEEE International Conference on Computer Communications [C]. Washington: IEEE Computer Society, 2007: 1973-1981
[118]Ni Jian, Lin Jie, Harrington S. J., et al. Designing file replication schemes for peer-to-peer file sharing systems [A]. IEEE International Conference on Communications [C]. Washington: IEEE Computer Society, 2004:5609-5613
[2]无线网状网再成热点[EB/OL]. http://www.c114.net/interview/340/a203948.html, 2006-9-22
[3]国际电信联盟: 2010年全球手机用户达52.8亿[EB/OL]. http://news .ccidnet.com/art/- -1032/20110127/2304993_1.html, 2011-1-27
[4]P2P应用识别与控制技术白皮书[EB/OL]. http://www.ppcn.net/n7426c2.aspx, 2009-6-26
[5]网络开放还是限制谁说了算[EB/OL]. http://ido.3mt.com.cn/Article/200609/show485- -320c9p1.html, 2006-9-12
[6]2006年中国P2P流媒体研究报告[EB/OL]. http://www.cmrn.com.cn/yjbg/jiaoyu/c/200- -711/21599.html, 2007-11-28
[7]欧中洪,宋美娜,战晓苏等.移动对等网络关键技术[J].软件学报, 2008, 19(2): 404-418
[8]Camp J.D., Knightly E.W., Reed W.S. Developing and deploying multihop wireless networks for low-income communities [J]. Journal of Urban Technology, 2006, 129(13): 1063–0732
[9]Jun Jangeun, Sichitiu M.L. The nominal capacity of wireless mesh networks [J]. Wireless Communications, 2003, 10(5): 8-14
[10]Ashish R., Chiueh Tzi-cker. Architecture and algorithms for an IEEE 802.11-based multi-channel wireless mesh network [A]. Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies [C]. Washington: IEEE Computer Society, 2005: 2223-2234
[11]Snmino H., Ishikawa N., Kato T. Design and implementation of P2P protocol for mobile phones [A]. Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops [C]. Washington: IEEE Computer Society, 2006: 157-162, 2006.
[12]Klemm A., Lindemann C., Waldhorst O.P. A special-purpose peer-to-peer file sharing system for mobile ad hoc networks [A]. 2003 IEEE 58th Vehicular Technology Conference [C]. Washington: IEEE Computer Society, 2003: 2758-2763
[13]Raivio Yrjo. A peer-to-peer overlay architecture for mobile networks[R]. Helsinki: Helsinki University of Technology, 2005
[14]Andersen Frank-Uwe, Meer H.de, Dedinski I, et al. An architecture concept for mobile p2p file sharing services [A]. Proceedings of Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications [C]. Washington: IEEE Computer Society, 2004: 229-233
[15]eDonkey [EB/OL]. http://www.eDonkey.com/
[16]Hofeld T., Tutschku K., Andersen F.U. Mapping of file-sharing onto mobile environments: Feasibility and performance of eDonkey with GPRS [A]. 2005 IEEE Wireless Communications and Networking Conference [C]. Washington: IEEE Computer Society, 2005: 2453-2458
[17]Hofeld T., Tutschku K., Andersen F.U. Mapping of file-sharing onto mobile environments: Enhancement by UMTS [A]. Third IEEE International Conference on Pervasive Computing and Communications Workshops [C]. Washington: IEEE Computer Society, 2005: 43-49
[18]Peng Gang, Li Shanping, Jin Hairong, et al. M-CAN: a lookup protocol for mobile peer-to-peer environment [A]. Proceedings. 7th International Symposium on Parallel Architectures, Algorithms and Networks [C]. Washington: IEEE Computer Society, 2004: 544-549
[19]Ratnasamy S., Francis P.,Handley M., et al. A scalable content addressable network [A]. Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications [C]. New York: ACM Press, 2001: 161- 172
[20]Cramer C., Fuhrmann T. ISPRP: A message-efficient protocol for initializing structured P2P networks [A]. 24th IEEE International Performance, Computing, and Communications Conference [C]. Washington: IEEE Computer Society, 2005: 365-370
[21]Stoica I., Morris R., Karger D.R., et al. Chord: A scalable peer-to-peer lookup protocol for internet applications [J]. IEEE/ACM transactions on networking, 2003, 11(1): 17-32
[22]JXME [EB/OL]. http://Jxme.jxta.org/
[23]JXTA [EB/OL]. http://www.jxta.org/
[24]Proem [EB/OL]. http://www.proem.com/
[25]Horozov T., Grama A., Vasudevan V., et al. MOBY- A mobile peer-to-peer service and data network [A]. Proceedings of the International conference on parallel processing [C]. Washington: IEEE Computer Society, 2002: 437-444
[26]Kodeswaran S.B., Ratsimor O., Joshi A.,et al. Using peer-to-peer data routing for infrastructure-based wireless networks [A]. First IEEE International Conference on Pervasive Computing and Communications (PerCom'03) [C]. Washington: IEEEComputer Society, 2003: 305-312
[27]Rowstron A., Druschel P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems [A]. Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms [C]. London: Springer-Verlag, 2001: 329-350
[28]Cayley A.The theory of graphs, graphical representation [J]. Cambridge Mathematical Papers, 1895, 10(3): 26-28
[29]Akers S.B., Krishnamurthy B. A group-theoretic model for symmetric interconnection networks [J]. IEEE Transactions on Computer, 1989, 38(4): 555-566
[30]Day K., Tripathi A. A comparative study of topological properties of hyper-cubes and star graphs [J]. IEEE Transactions on parallel and distributed systems, 1994, 5(1): 31-38
[31]Roichman Y. Expansion properties of Cayley graphs of the alternating Combinatorial theory [J].1997, 79(A): 281-279
[32]Bass D.W., Sudborough I.H. Pancake problems with restricted prefix reversals and some corresponding Cayley networks [J]. Journal of Parallel and Distributed Computing, 2003, 63(6): 327-336.
[33]Latifi S., Srimani P.K. SEP: A Fixed Degree Regular Network for Massively Parallel Systems [J]. The Journal of Supercomputing, 1998, 12(6): 277-291
[34]Fen Lin Wu, S. Lakshmivarahan, S. K. Dhall. Routing in a class of Cayley graphs of semidirect products of finite groups [J]. Journal of Parallel and distributed computing, 2000, 60: 539-565
[35]Stojmennovic I. Honeycomb networks: topological properties and communication algorithms [J]. IEEE Transactions on Parallel and Distributed Systems, 1997, 10(8): 103-1042
[36]Xiao Wenjun, Peng limin. On general models of complex networks with some applications [A]. Proceedings 2009 1st IEEE Symposium on Web Society [C]. Washington: IEEE Computer Society, 2009: 153-156
[37]王萼芳.有限群论基础[M].北京:清华大学出版社, 2004:1-36
[38]Biggs N. Algebraic Graph Theory [M].Cambridge University Press, 1974:17-89
[39]Biggs N. White A. T. Permutation Groups and Combinatorial Structures [M]. Cambridge University Press, 1979:23-76
[40]徐明曜,黄建华,李慧陵等.有限群论导引[M].北京,科学出版社, 1999:321-379
[41]Xiao Wenjun, Parhami B. Cayley graph as models of deterministic small-world networks[J], Information Processing Letters, 2006, 97(3): 115–117
[42]Xiao Wenjun, Parhami B. A group construction method with applications to deriving pruned interconnection networks [J]. IEEE Transactions on Parallel and Distributed Systems, 2007, 18(5): 637-643
[43]Xiao Wenjun, Parhami B. Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks [J]. Journal of Computer and System Sciences, 2007, 73(8): 1232-1239
[44]Hayes J.P., Mudge T., Stout Q.F.,et al. A microprocessor-based hypercube supercomputer [J]. IEEE Micro, 1986, 11(6): 6-17
[45]徐俊明.组合网络理论[M].北京:科学出版社, 2007:95-106,160-163
[46]Harary F. Recent results and unsolved problems on hypercube theory [J]. Graph theory combinatorics and applications, 1991(2): 621-632
[47]Zhao Y., Kubiatowicz J., Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing [R]. Berkeley: University of California, 2000
[48]Malkhi D., Naor M., Ratajczak D. Viceroy: A scalable and dynamic emulation of the butterfly [A]. Proceedings of the twenty-first annual symposium on Principles of distributed computing [C]. New York: ACM Press, 2002: 183-192
[49]Kaashoek M.F., Karger D.R. Koorde: A simple degree optimal distributed hash table [A]. Proceedings of the International Peer-to-Peer Symposium [C]. Berlin-Heidelberg: Springer-Verlag, 2003: 98-107
[50]Xu J., Kumar A., Yu X.X. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks [J]. IEEE Journal on Selected Areas in Communications, 2004, 22(1): 151-163
[51]Kumar A., Merugu S., Xu J., et al. Ulysses: A robust, low-diameter, low-latency peer-to-peer network [J]. European transaction on telecommunications, 2004, 15(6): 571-587
[52]Shen H.Y., Xu C.Z., Chen G. Cycloid: A new constant degree and lookup efficient P2P overlay network [J]. Performance Evaluation, 2006, 63(3): 195-216
[53]于真,姚宣霞,王颖等.一种P2P网络拓扑构造方法DPT [J].四川大学学报(工程科学版), 2010, 42(4): 103-110
[54]魏文红,肖文俊,黄书强等.结构化P2P覆盖网络的Cayley图构造方法研究[J].计算机科学, 2009, 36(4): 81-83
[55]Yu Jaewook, Kim Dongsoo, Tang K. Wendy. Dense and symmetric graph formulation andgeneration for wireless information networks [J]. Information processing letters, 2006, 97(3): 115-117
[56]曲大鹏,王兴伟,黄敏.基于MANET的P2P网络跨层方法综述[J].计算机科学, 2010, 37(2): 31-37.
[57]Huang Chung-Ming, Hsu Tz-Heng, Hsu Ming-Fa. Network-aware P2P file sharing over the wireless mobile networks [J]. IEEE Journal on selected areas in communications, 2007, 25(3): 204-210.
[58]Shin M., Arbaugh W.A. Efficient peer-to-peer lookup in multi-hop wireless networks [J]. KSII transactions on internet and information systems, 2009, 3(1): 5-24
[59]Gallucciom L., Morabito G., Palazzo S., et al. Georoy: A location-aware enhancement to viceroy peer-to-peer algorithm [J]. Computer networks, 2007, 51(8): 379-398
[60]Canali C., Renda M.E., Santi P., et al. Enabling efficient peer- to-peer resource sharing in wireless mesh networks [J]. IEEE transactions on mobile computing, 2010, 9(3): 333-347
[61]郭达,张勇,彭晓川等.无线网状网:架构、协议与标准[M].北京:电子工业出版社, 2008:5-12
[62]The network simulator-ns-2 [EB/OL]. http://nsnam.isi.edu/nsnam/index.php
[63]Johnson D.B., Maltz D.A. Broch Josh. DSR: The dynamic source routing protocol for multi-hop wireless ad hoc networks [A]. Proceedings of the Ad Hoc Networking [C]. New York: Addison-Wesley, 2001: 139-172
[64]Karger D., Lehman E., Leighton T., et al. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web [A]. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing [C]. New York: ACM Press, 1997: 654-663
[65]Saroiu S., Gummadi P.K., Gribble S.D. A measurement study of peer-to-peer file sharing systems [A].Proceedings of multimedia computing and networking (MMCN) [C], Washington: IEEE Computer Society, 2002: 156-170
[66]Chu J.C., Labonte K.S., Levine B. Availability and locality measurements of peer-to-peer file systems [A].Proceedings of the ITCom: Scalability and Traffic Control in IP Networks [C]. Boston:SPIE, 2002: 769-776
[67]Zhang Ming, Zhang Chi, Pai V., et al. PlanetSeer: Internet path failure monitoring and characterization in wide-area services [A]. Proceedings of the 6th conference on Symposium on Operating Systems Design & Implementation [C]. New York: ACMPress, 2004: 634-642
[68]Willebeek L H., Reeves A P. Strategies for dynamic load balancing on highly parallel computers [J]. IEEE Transactions on parallel and distributed systems, 1993, 9(4): 979-993
[69]Rao A., Lakshminarayanan K., Surana S., et,al. Load balancing in structured P2P systems [A]. Proceedings of IPTPS [C]. Berlin-Heidelberg: Springer-Verlag, 2003: 68-79
[70]Godfrey B., Lakshminarayanan K., Surana S., et al. Load balancing in dynamic structured P2P systems [A]. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies [C]. Washington: IEEE Computer Society, 2004: 2253-2262
[71]Zhu Yingwu, Hu Yiming. Efficient, proximity-aware load balancing for DHT-based P2P systems [J]. IEEE Transactions on parallel and distributed systems, 2005, 16(4): 349-361
[72]李振宇,谢高岗.基于DHT的P2P系统的负载均衡算法[J].计算机研究与发展, 2006, 43(9): 1579-1585
[73]Rostami Habib, Habibi Jafar. A Mathematical Foundation for Topology Awareness of P2P Overlay Networks [A]. In the 4th International Conference on Grid and Cooperative Computing [C]. Berlin-Heidelberg: Springer-Verlag, 2005: 906–918
[74]Chen Chyouhwa, Tsai Kun-Cheng. The server reassignment problem for load balancing in structured P2P systems [J]. IEEE Transactions on parallel and distributed systems, 2008, 19(2): 1-13
[75]Laguna M., Kelly J.P., Velard JL G., et al. Tabu search for the multilevel generalized assignment problem [J]. European Journal operational research, 1995, 82(9): 176-189
[76]Peng Limin, Cao Zhanmao. Fairness resource allocation and scheduling for IEEE 802.16 Mesh networks [J]. Journal of networks, 2010, 5(6): 724-732
[77]徐玖平,李军.多目标决策的理论与方法[M].北京:清华大学出版社, 2005:91-1125
[78]Meadowcroft T.A., Stephanopoulos G., Brosilow C. The modular multivariable controller: steady-state properties [J]. Journal of AIChE, 1992, 38(8): 1254-1278
[79]董加礼.多目标优化的方法和理论[M].长春:吉林教育出版社, 1992:56-68
[80]吴刚,陆旭东,应爱国等.模块多变量自校正调节器[J].自动化学报, 2000, 6(6): 811-815
[81]张泉灵,王树青.基于Hammerstein模型的非线性预测函数控制[J].浙江大学学报(工学版), 2002, 36(2): 119-122
[82]Plaxton C. G., Rajaraman R, Richa A. W. Accessing nearby copies of replicated objects ina distributed environment [A]. Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures [C]. New York: ACM Press, 1997:241-280
[83]彭利民,肖文俊.一种具有常数度的无线P2P覆盖网络[J].四川大学学报(工程科学版), 2011(43)4: 124-130
[84]Gharib M., Barzegar Z., Habibi J. A Novel Method for Supporting Locality in Peer-to-Peer overlays Using Hypercube Topology [A]. 2010 International Conference on Intelligent Systems, Modelling and Simulation [C]. Washington: IEEE Computer Society, 2010: 391-395
[85]Gupta Ajay K., Hambrusch Susanne E. Embedding complete binary trees into butterfly networks [J]. IEEE transactions on computers, 1991, 40(7): 853-863
[86]Cybenko G. Dynamic load balancing for distributed memory multiprocessors [J]. Journal of parallel and distributed processing, 1989, 7(2): 279-301
[87]Eager D., Lazowska G., Zahorjan J. Adaptive load sharing in homogeneous distributed systems [J]. IEEE Transactions on software engineering, 1986, 12(5) : 662-675
[88]Woo J., Sahni S. Load balancing on a hypercube [A]. Proceedings of the Fifth International Parallel Processing Symposium [C]. Washington: IEEE Computer Society, 1991: 525-530
[89]Martins Vidal, Pacitti Esther, Valduriez Patrick. Survey of data replication in P2P systems [R]. INRIA: Universitéde Nantes, 2006
[90]Rowstron A., Druschel P. Storage Management and Caching in PAST, a Large-Scale, Persistent Peer-to-Peer Storage Utility [A]. Proceedings of the eighteenth ACM symposium on Operating systems principles [C]. New York: ACM Press, 2001: 188-201
[91]Dabek F., Kaashoek MF., Karger D., et al. Wide Area Cooperative Storage with CFS [A]. Proceedings of the eighteenth ACM symposium on Operating systems principles [C]. New York: ACM Press, 2001: 344?352
[92]Stading T.,Maniatis P., Baker M. Peer-to-Peer Caching Schemes to Address Flash Crowds [A]. Proceedings of the 1st International Peer To Peer Systems Workshop [C]. Berlin-Heidelberg: Springer-Verlag, 2000: 203-213
[93]Gopalakrishnan V., Silaghi B., Bhattacharjee B.,et al. Adaptive Replication in Peer-to-Peer Systems [A]. Proceedings of 24th International Conference on Distributed Computing Systems [C]. Washington: IEEE Computer Society, 2004: 360-369
[94]Gnutella[EB/OL]. http://www.gnutella.com/
[95]Roussopoulos M., Baker M. CUP: Controlled Update Propagation in Peer to PeerNetworks [A]. Proceedings of the 2003 USENIX Annual Technical Conference [C]. Texas: USENIX, 2003: 167-180
[96]Yin Liangzhong, Cao Guohong. DUP: Dynamic-Tree Based Update Propagation in Peer-to-Peer Networks [A]. Proceedings of the 21st International Conference on Data Engineering [C]. Washington: IEEE Computer Society, 2005: 258-259
[97]Cox Russ, Muthitacharoen A., Morris R.T. Serving DNS Using a Peer-to-Peer Lookup Service [A]. Proceedings of the First International Workshop on Peer-to-Peer Systems [C]. New York: ACM Press, 2002: 155-165
[98]Derhab A., Badache N. Data replication protocol for mobile ad-hoc networks: A survey and taxonomy [J]. IEEE communications surveys and tutorials, 2009, 11(2): 33-51
[99]Wang Szu-Chi, Chou Hong-Zu,David S.L.,et al. On the fundamental performance limits of peer-to-peer data replication in wireless Ad hoc networks [J].IEEE Journal on selected areas in communications, 2007, 25(1): 211-220
[100]Tang Bin, Gupta H., Das S. Benefit-based Data Caching in Ad Hoc Networks [J]. IEEE Transactions on Mobile Computing, 2008, 7(3): 289-304
[101]Hara T., Madria S. K. Data replication for improving data accessibility in Ad hoc networks [J]. IEEE transactions on mobile computing, 2006, 5(11): 1515-1532
[102]Yin L., Cao G. Supporting cooperative caching in ad hoc networks [J]. IEEE Transactions on Mobile Computing, 2006, 5(1): 77-89.
[103]Zhao J., Zhang P., Cao G., et al. Cooperative caching in wireless p2p networks: Design, implementation, and evaluation [J]. IEEE Transactions on Parallel and Distributed Systems, 2010, 21(7): 229–241.
[104]Nkwe T.K.R., Denko M. K. Self-optimizing cooperative caching in autonomic Wireless Mesh Networks [A]. IEEE Symposium on Computers and Communications [C]. Washington: IEEE Computer Society, 2009: 411-416
[105]Wu weigang, Huang yifei. Hierarchical cooperative data caching for wireless mesh network [A]. 2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing [C]. Washington: IEEE Computer Society, 2010: 289-296
[106]Das S. M., Pucha H., Hu Y. C. Mitigating the gateway bottleneck via transparent cooperative caching in wireless mesh networks [J]. Ad Hoc Networks, 2007, 5(6): 680–703
[107]Alasaad A., Gopalakrishnan S., Leung V. C.M. Content Caching and Replication Schemes for Peer-to-Peer File Sharing in Wireless Mesh Networks [A]. Proceedings of the IEEE GLOBECOM Workshops (GC Wkshps) [C]. Washington: IEEE ComputerSociety, 2010:1707-1711
[108]Jin Shudong, Wang Limin. Content and service replication strategies in multihop wireless mesh networks [A]. Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems [C]. New York: ACM Press, 2005: 79–86
[109]Chen Hsing-Lung, Tzeng Nian-Feng. Efficient resource placement in hypercubes using multiple-adjacency codes [J]. IEEE transaction on computers, 1994, 43(1): 23-32.
[110]Liveingston M., Stout Q.F. Distributing resources in hypercube computers [A]. Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues [C]. New York: ACM Press, 1998: 222-231
[111]Chiu G. M., Raghavendra C. S. Resource allocation in hypercube systems [A].Proceedings of the 5th distributed memory computing conference [C]. Washington: IEEE Computer Society, 1990: 894-902
[112]Blahut R E. Theory and practices of error control codes [M]. MA: Addison-Wesley, 1983
[113]Saad Y, Schultz M. H. Topology properties of hypercubes [J]. IEEE transaction on computer, 1988, 37(6), 867-872
[114]Preparata F. P., Vuillemin J. The cube-connected cycles: a versatile network for parallel computation [J]. Communications of the association for computing machinery, 1981, 24(5): 300-309
[115]Wittie L. D. Comunication structures for large networks of microcomputers [J]. IEEE transactions on computer, 1990, 30(4): 264-273
[116]Peng Limin, Wei wenhong, Xiang jun. A new addressing scheme for cube-connected cycles network [A]. 3rd IEEE Conference on Industrial Electronics and Applications [C]. Washington: IEEE Computer Society, 2008: 586-590
[117]Kangasharju J., Ross K. W., Turner D A. Optimizing file availability in peer-to-peer content distribution [A]. IEEE 26th IEEE International Conference on Computer Communications [C]. Washington: IEEE Computer Society, 2007: 1973-1981
[118]Ni Jian, Lin Jie, Harrington S. J., et al. Designing file replication schemes for peer-to-peer file sharing systems [A]. IEEE International Conference on Communications [C]. Washington: IEEE Computer Society, 2004:5609-5613