Efficient Search in Gnutella-like Small-World Peerto-Peer
|
|
- Evangeline Melton
- 8 years ago
- Views:
Transcription
1 Efficient Search in Gnutella-like Small-World Peerto-Peer Systems * Dongsheng Li, Xicheng Lu, Yijie Wang, Nong Xiao School of Computer, National University of Defense Technology, Changsha, China leedongsh@hotmail.com Abstract. Gnutella-like peer-to-peer file-sharing systems have been widely deployed on the Internet. However, current search techniques used in existing Gnutella-like peer-to-peer systems are often inefficient. We demonstrated the strong small-world property of Gnutella systems and proposed an efficient search approach CSTM to utilize the property. In CSTM, each peer maintains a local state table, which contains keyword information of data on all neighbors within T hops to guide query. A new data structure based on Bloom Filter is introduced to represent the state table compactly to reduce storage and bandwidth cost. Query cache is also adopted to utilize query locality and build shortcut connections to lately accessed peers. Simulations show that CSTM can reduce message cost remarkably while maintaining short search path length compared with flooding or random forwarding algorithm. 1 Introduction and Related Work In recent years, peer-to-peer (P2P) computing has emerged as a novel and popular model of computation and gained significant attentions from both industry field and academic field [1,2,3]. Gnutella-like P2P systems, such as Gnutella, Freenet [4], Morpheous and Nuerogrid [5], are widely deployed and predominant on the Internet in real life because of their simplicity and usability. However, flooding in Gnutella systems costs too much bandwidth and limits the scalability. Recently much work has been done to improve the performance and scalability of Gnutella-like P2P system. Markatos [6] studied the characteristic of Gnutella traffic and proposed some caching strategies to improve its performance; but they still used flooding for search. Lv [7] suggested random walks instead of flooding, Cohen [8] proposed and analyzed three replication strategies, and proved that the square-root strategy is optimal. Yang [9] suggested iterative deepening and Directed BFS technique to reduce messages cost. Joseph [5], Yang [9], Adamic [10], and Crespo [11] suggested that each node maintain some kind of metadata that can * This work was supported by the National Natural Science Foundation of China under the grant No and , the National 863 High Technology Plan of China under the grant No. 2002AA and 2003AA1Z2060, and the Excellent PHD Dissertation Foundation of China under the grant No
2 2 Dongsheng Li, Xicheng Lu, Yijie Wang, Nong Xiao provide hints to guide search. Yang [9] used local indices where nodes index of neighbors in the system, however flooding was still used for query. Adamic[10] utilized local information such as connectedness of a node s neighbors and forwarded query to neighbors with high degree. Crespo [11] built summaries of content that is reachable via each neighbor of the node in different topics. In this paper we demonstrated the small-world property of Gnutella network and proposed a new search approach CSTM, to utilize the property to improve the performance and scalability of Gnutella-like P2P systems. In CSTM, each peer in the system maintains a local state table, which contains indices of keywords on all neighbors within a few hops to guide query. For the reason of small-world property, the desired data could be found within only a few hops. Extended Bloom Filter (EBF), which is based on Bloom Filter [12] technique, is introduced to represent the state table with little storage and bandwidth overhead. Meanwhile the query cache is adopted to utilize the locality of query and build shortcut connections to remote peers. Simulations show that CSTM can achieve much better performance compared with flooding and random forwarding algorithm in Gnutella-like P2P systems. Bloom Filter [12] technique has been widely used as a summary technique. Summary Cache [13] uses bloom filters as compact representations for the local set of cached files. Sean C. [14] uses Bloom Filters to find nearby replicas quickly in OceanStore systems. CSTM uses Bloom Filter in some similar way to [14], but they are for different purposes and achieve different tradeoff. To our knowledge, CSTM is the first to use Bloom Filter technique to improve search in Gnutella-like P2P systems. The rest of this paper is organized as follows. Section 2 demonstrates the smallworld property with data traces crawled from Gnutella networks. Section 3 presents CSTM in detail. Section 4 analyzes the performance of CSTM. Conclusions are made in Section 5. 2 Small-world Property of Gnutella The small-world phenomenon was first discovered by Stanley Milgram in the late 1960s. Small-world networks [15] exhibit a highly clustering; yet have typically short path lengths between arbitrary nodes, i.e., short diameter. In this paper, we model Gnutella network as an undirected graph and use the concepts of clustering coefficient and characteristic path length proposed by Watts and Strogatz [15] to analyze the characteristic of Gnutella-like peer-to-peer networks. We determined the properties on the actual Gnutella topology data crawled by Clip2 Company [16] in the summer of We perform the experiments on many different snapshots of Gnutella networks, which are selected randomly from the data traces. We calculate the characteristic path length and clustering coefficient for Gnutella networks, compared to corresponding random networks with the same number of nodes and average degree per node. Table 1 shows five samples. As Table 1 shows, all the Gnutella topology snapshots exhibit strong smallworld property: characteristic path length is close to that of corresponding random
3 Efficient Search in Gnutella-like Small-World Peer-to-Peer Systems* 3 network, but the clustering coefficient is much higher (i.e., L Gnutella = L random and C Gnutella.>> C random ). Table 1. Small-world property of Gnutella L Gnutella L random C Gnutella C random The small-world property of Gnutella networks can help to guide the design of search mechanisms in such systems. For examples, the small diameter property means that if a peer in the system has the knowledge of the data on its neighbors within several hops, it can forward query for desired data to appropriate neighbors directly and doesn t need flooding any more. The property is utilized in CSTM. 3 Approach Description In Gnutella-like P2P systems, peers submit some keywords of desired data for search and acquire results from the systems. In CSTM, each peer has a local state table that contains keywords information of data files on all neighbors within T hops (T is a system-wide constant). We use keywords rather than full name of files in the state table because keywords can support flexible query. Fig. 1. Neighbor graph of peers There are three columns in the state table. For example, Table 2 shows the state table of peer A in Figure 1.The first row of Table 2 shows that the keyword car is two hops away from peer A through neighbor B, and the fourth row show that the keyword red is one hop away from peer A through neighbor C. Each keyword may be stored on multiple peers which are either different hops away from peer A or through different neighbors of peer A, so the same keyword can take up multiple rows in the state table.
4 4 Dongsheng Li, Xicheng Lu, Yijie Wang, Nong Xiao Hop information can be used to determine which neighbor queries are forwarded to. For example, a query for car will be forwarded to not neighbor B but neighbor C first because car is one hop away through neighbor C while two hop away through neighbor B. Hop information in the state table can also be used to support query for multiple keywords. Take peer A as an example, if peer A receives a query for red car, peer A knows keywords red and car are both one hop away through peer C, thus peer A can forward query to peer C. If peer A receives a query for black car, peer A knows that though both keyword black and car are on some peers through peer C, but they are different hops away, thus peer A knows that the two keywords are not on the same peer through neighbor C and doesn t forward the query to C. The state table only maintains information within T hops, i.e., the value in hop column of the state table is no more than T. Table 2. State table on peer A Keywords Hop Neighbor car 2 B car 3 B car 1 C red 1 C black 3 C Assuming each neighbor has M neighbors, the state table stores keyword information of M T neighbor peers. To reduce the storage and update cost of the state table, a data structure, Extended Bloom Filter (EBF), which is based on Bloom Filter technique, is used to represent state table. Generally speaking, if peer A accesses some date on peer B, then peer A and peer B may have some common interests and peer A is more likely to access data on peer B later. To utilize the query locality, each peer maintains a query cache, which contains the mapping information between keywords lately accessed and their location. Query cache uses a timeout mechanism and discards the content that hasn t been accessed for certain time. The replacement of query cache is performed based on LRU policy. The state table provides nearby information around the peer and query cache provides shortcut connections to some remote peers. The combination of the two mechanisms could accelerate the process of search. 3.1 Extended Bloom Filter Bloom Filter (BF) [12] is a compact data structures for probabilistic representation of a set. Consider a set A={a 1, a 2,, a n} of n elements. BF describes membership information of set A using a bit vector V of length m with all bits initially set to 0. BF chooses k independent hash functions hash 1,,hash k, each with range {1,,m}.
5 Efficient Search in Gnutella-like Small-World Peer-to-Peer Systems* 5 For each element a A, the bits at positions hash 1 (a), hash 2 (a),..., hash k (a) in V are all set to 1. A particular bit might be set to 1 multiple times by various elements. Given a query for b BF check the k bits at positions hash 1 (b), hash 2 (b),..., hash k (b) in V. If any of them is 0, then certainly b is not in the set A. Otherwise BF conjectures that b is in the set although there is a certain probability that it is wrong (because all the k bits have been previously set by other elements). We use BF (k=4) to represent the keywords on each peer. But state tables need to store hop information thus can t be represented by BF directly. We propose a new data structure Extended Bloom Filter (EBF) based on BF technique to represent state tables in a compact way. The main idea of EBF is that the bit vector V of Bloom Filter is replaced with an array VV of T-bit binary numbers. We associate each neighbor of a peer with one EBF to represent the keywords that can be accessed through the neighbor. Each entry of the array VV is a T-bit binary number and each bit of the number represents keywords corresponding hops away through the neighbor: The highest bit of the number represents the keywords one hop away from the neighbor and the second highest bit represent the keywords two hops away from the neighbor, and so on. The lowest bit represents the keywords T hop away through the neighbor. Each EBF of the peer corresponds to one neighbor, and we use term EBF(A,B) to represent the EBF of peer A about its neighbor B. So each peer has multiple EBFs and the number of EBFs is the same as the number of its neighbors. The values of four hash functions of keyword key are acquired as below: first calculate the MD5 signature of the key, which produces 128 bits; then divide the 128 bits into four 32-bit numbers, and finally module each 32-bit number by m and get the four values. MD5 is selected because of its well-known random properties and relatively fast implementation. The detail of EBF is referred to [17]. 3.2 Query and Update In Gnutella-like P2P system, users submit queries to any node with a stop condition (e.g., the number of results desired). When a peer receives a query for the keyword key, it first evaluates keywords on itself. If it could satisfy the query itself, it returns the results and the query is over. Otherwise it first gets the k hash values h1,, hk by calculating k hash functions hash1(key), hash2(key),..., hashk(key). For each neighbor of the peer, it gets the k T-bit binary numbers, i.e., the value of h1,, hk entries of the corresponding EBF. It uses operator AND to operate all the k T-bit binary numbers and acquire the result f. The result f is also a T-bit binary number, and the position of 1 (from left to right) in value f indicates how many hops it needs to access key through the neighbor. Thus the larger value f is, the less hops it needs to pass through to access the keyword. We rank all the neighbors by the corresponding result f, then the peer sends the query to each neighbor in sequence, checking if the stop condition is reached whenever each query returns. When a data object is added to or deleted from a peer, there is a possibility that the BF of the peer might change as well. If such changes occur, the peer should propagate the changes of its BF to its neighbors. The neighbors receive the update messages and update their EBFs accordingly. If needed, the neighbors will send update messages to their neighbors as well. When update messages pass through one peer, the position of
6 6 Dongsheng Li, Xicheng Lu, Yijie Wang, Nong Xiao the value updated in the corresponding EBF is shifted one to right. Update messages are propagated at most T hops from the sources. When peers join in or depart from the system, the update process is also needed. There may be some cycles in P2P networks. Cycles in P2P networks may cause the same query or update message to reach the same node multiple times. To avoid that, the identifier of source peer and sequence number is added into the messages. Duplicate messages are discarded by the peers. The detail of the query and update algorithm is referred to [17]. 4 Performance Evaluations We implement CSTM in the open source NeuroGrid simulator [5] and use a Gnutella snapshot topology in which there are 1005 peers as the underlying topology of simulated Gnutella-like P2P systems. The simulations are conducted over 1005 peers with four files per peer and three keys per file. Files and keywords in the system are selected from a pool with files and 5000 keywords. In the experiments we simulate four algorithms: Gnutella flooding, two-way random forwarding (peers forward queries to two random neighbors each time), CSTM without query cache and CSTM with query cache (the cache size is 30). The TTL in flooding and random forwarding algorithm is 7 and 13 respectively. We run 20,000 searches in the simulation, with each search being started at a randomly selected node. Each search was for a randomly selected file the search terms would be the keywords of desired file. After each 2000 searches we probe the system to acquire average search length and messages cost at that time. Simulation results are shown in Figure 2. Gnutella random forwarding(2) CSTM(T=2) CSTM(T=2,cache) Gnutella random forwarding(2) CSTM(T=2) CSTM(T=2,cache) hops messages No. of search(*2000) (a) Average path length No. of searchs(*2000) (b) Messages per search Fig. 2. Average path length and Messages per search with the four algorithms Figure 2(a) shows that the average search length of CSTM is a little more than that of flooding, but it is much less than that of two-way random forwarding algorithm. Figure 2(b) shows that flooding in Gnutella produces too many messages (about 4000 messages per search) and two-way random forwarding also causes about 1500 messages per search, while CSTM causes no more than 250 messages, one order of
7 Efficient Search in Gnutella-like Small-World Peer-to-Peer Systems* 7 magnitude less. Figure 2 also shows that the query cache has some self-learning ability and contains more effective shortcut connections after a large number of searches. This ability can lead to the descending of the average search length and the message cost. Then we evaluate CSTM with different values of parameter T. Figure 3 presents the simulation results when T is 1,2,3 respectively. The results show that when the value of T is increased, the search length and messages cost decreases dramatically. When T=3, the search length is almost the same as that of Gnutella while the messages produced is only about 100. The query cache is again validated to be very effective. 8 CSTM(T=1) CSTM(T=1,cache ) CSTM(T=2) 450 CSTM(T=1) CSTM(T=1,cache) CSTM(T=2) CSTM(T=2,cache) CSTM(T=3) CSTM(T=3,cache) 7 hops No. of search(*2000) messages No. of search(*2000) Fig. 3. Average path length and message cost with different T Now we evaluate the storage cost of CSTM based on the data traces crawled from Gnutella network. The storage cost AverageStorage of state table in CSTM can be computed by the formula (1) showed below: AverageStorage=NeighborsPerPeer * AverageSizeofPerEBF = NeighborsPerPeer * T* (m/n) * KeysPerFile * AverageFilePerPeer (bit) (1) Adar [18] observed the actual Gnutella networks for 24 hours in August, 2000 and learned that there were 31,395 peers with totally 3,019,405 sharing files in the systems and NeighborsPerPeer was less than 4. Thus AverageFilePerPeer is about 96. We take KeysPerFile =3, T=7, m/n=32 as a typical example, then the value of AverageStorage calculated from formula (1) is bit, i.e. about 32KB. Even if the value of AverageFilePerPeer is increased ten times, the storage cost is only 320KB. What s more, duplicate files and keywords are not eliminated from formula (1), so the actual storage cost is much less than the value provide by formula (1). Thus we can conclude that the storage cost of CSTM is very little. 5 Conclusions Experiments show that Gnutella networks exhibit strong small-world property, which brings about important effect on search performance in such systems. A new
8 8 Dongsheng Li, Xicheng Lu, Yijie Wang, Nong Xiao search approach CSTM is proposed to utilize the small-world property of Gnutellalike P2P systems. Compared with flooding and random forwarding algorithm, the approach can reduce message cost remarkably while maintaining short search path length, thus it can improve much the performance and scalability of Gnutella-like P2P systems. References 1. Clark, D.: Face-to-face with peer-to-peer networking. IEEE Computer, Vol. 34, No.1, IEEE press (2001) Schoder, D., Fischbach, K.: peer-to-peer prospects. Communications of the ACM, Vol.46, No.2, (2003) Li Dongsheng, Fang xinxin, Wang Yijie, Lu Xicheng, et al.: A scalable peer-to-peer network with constant degree. Lecture Notes in Computer Science, Vol. 2834, Springer-Verlag, Berlin Heidelberg, New York (2003) Clark, I., Sandberg, O., Wiley, B., and Hong, T.: Freenet: a distributed anonymous information storage and retrieval system. Proc. of the Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA (2000) Joseph, S.R.H: NeuroGrid: semantically routing queries in peer-to-peer networks. Proc. of International Workshop on Peer-to-Peer Computing, Pisa, Italy (2002) 6. Evangelos, P. Markatos: Tracing a large-scale peer-to-peer system: an hour in the life of Gnutella. Proc. of CCGrid2002, Berlin, Germany (2002) 7. Lv, Q., Cao, P., Cohen, E., Li K, and Shenker, S.: Search and replication in unstructured peer-to-peer networks. Proc. of the 16th annual ACM International Conference on Supercomputing (ICS), New Work (2002) 8. Cohen Edith, Shenker Scott: Replication strategies in unstructured peer-to-peer networks. Proc. of ACM Sigcomm 2002, ACM Press, Pittsburgh (2002) 9. Yang, B. and Garcia-Molina, H.: Efficient search in peer-to-peer networks. Proc of the 22nd IEEE ICDCS, Vienna, Austria (2002) 10. Adamic L. A., Humberman B., Lukose R., and Puniyani A.: Search in power law networks. Phys. Rev. E, Vol. 64, No.4 (2001) Crespo A. and Garcia -Molina H.: Routing indices for peer-to-peer systems. Proc of the 22nd IEEE ICDCS, Vienna, Austria (2002) 12. Bloom B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, Vol. 13, No.7 (1970) Fan, L., Cao, P., Almeida, J., and Broder, A.: Summary cache: a scalable wide-area web cache sharing protocol. Proc. of ACM SIGCOMM 1998, ACM Press, (1998) Sean, C. R. and Kubiatowicz J.: Probabilistic location and routing. Proc. Of IEEE Infocom 2002, IEEE Computer Soc press, New Work (2002) 15. Watts, D. J. and Strogatz, S. H.: Collective dynamics of small-world networks. Nature, Vol.393 (1998) Clip2 Company Li Dongsheng et al.: Efficient Search in Gnutella -like Small-World Peer-to-Peer Systems. Tech Rept. PDL , National University of Defense Technology, Changsha City, China (2002) 18. Adar, Eytan and Huberman, Bernardo A.: Free riding on Gnutella. First Monday, Vol.5, No. 10 (2000)
Varalakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam
A Survey on P2P File Sharing Systems Using Proximity-aware interest Clustering Varalakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam
More informationA PROXIMITY-AWARE INTEREST-CLUSTERED P2P FILE SHARING SYSTEM
A PROXIMITY-AWARE INTEREST-CLUSTERED P2P FILE SHARING SYSTEM Dr.S. DHANALAKSHMI 1, R. ANUPRIYA 2 1 Prof & Head, 2 Research Scholar Computer Science and Applications, Vivekanandha College of Arts and Sciences
More informationA Collaborative and Semantic Data Management Framework for Ubiquitous Computing Environment
A Collaborative and Semantic Data Management Framework for Ubiquitous Computing Environment Weisong Chen, Cho-Li Wang, and Francis C.M. Lau Department of Computer Science, The University of Hong Kong {wschen,
More informationSimulating a File-Sharing P2P Network
Simulating a File-Sharing P2P Network Mario T. Schlosser, Tyson E. Condie, and Sepandar D. Kamvar Department of Computer Science Stanford University, Stanford, CA 94305, USA Abstract. Assessing the performance
More informationRESEARCH ISSUES IN PEER-TO-PEER DATA MANAGEMENT
RESEARCH ISSUES IN PEER-TO-PEER DATA MANAGEMENT Bilkent University 1 OUTLINE P2P computing systems Representative P2P systems P2P data management Incentive mechanisms Concluding remarks Bilkent University
More informationObject Request Reduction in Home Nodes and Load Balancing of Object Request in Hybrid Decentralized Web Caching
2012 2 nd International Conference on Information Communication and Management (ICICM 2012) IPCSIT vol. 55 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V55.5 Object Request Reduction
More informationA Comparison of Peer-to-Peer Search Methods
A Comparison of Peer-to-Peer Search Methods Dimitrios Tsoumakos Computer Science Department University of Maryland dtsouma@cs.umd.edu Nick Roussopoulos Computer Science Department University of Maryland
More informationAn Alternative Web Search Strategy? Abstract
An Alternative Web Search Strategy? V.-H. Winterer, Rechenzentrum Universität Freiburg (Dated: November 2007) Abstract We propose an alternative Web search strategy taking advantage of the knowledge on
More informationDUP: Dynamic-tree Based Update Propagation in Peer-to-Peer Networks
: Dynamic-tree Based Update Propagation in Peer-to-Peer Networks Liangzhong Yin and Guohong Cao Department of Computer Science & Engineering The Pennsylvania State University University Park, PA 16802
More informationEnhance UDDI and Design Peer-to-Peer Network for UDDI to Realize Decentralized Web Service Discovery
Enhance UDDI and Design Peer-to-Peer Network for UDDI to Realize Decentralized Web Service Discovery De-Ke Guo 1, Hong-Hui Chen 1, Xian-Gang Luo 2,Xue-Shan Luo 1, Wei-Ming Zhang 1 1 School of Information
More informationPeer-to-Peer Replication
Peer-to-Peer Replication Matthieu Weber September 13, 2002 Contents 1 Introduction 1 2 Database Replication 2 2.1 Synchronous Replication..................... 2 2.2 Asynchronous Replication....................
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 349 ISSN 2229-5518
International Journal of Scientific & Engineering Research, Volume 4, Issue 11, November-2013 349 Load Balancing Heterogeneous Request in DHT-based P2P Systems Mrs. Yogita A. Dalvi Dr. R. Shankar Mr. Atesh
More informationP2P Storage Systems. Prof. Chun-Hsin Wu Dept. Computer Science & Info. Eng. National University of Kaohsiung
P2P Storage Systems Prof. Chun-Hsin Wu Dept. Computer Science & Info. Eng. National University of Kaohsiung Outline Introduction Distributed file systems P2P file-swapping systems P2P storage systems Strengths
More informationThe Case for a Hybrid P2P Search Infrastructure
The Case for a Hybrid P2P Search Infrastructure Boon Thau Loo Ryan Huebsch Ion Stoica Joseph M. Hellerstein University of California at Berkeley Intel Research Berkeley boonloo, huebsch, istoica, jmh @cs.berkeley.edu
More informationClustering in Peer-to-Peer File Sharing Workloads
Clustering in Peer-to-Peer File Sharing Workloads F. Le Fessant, S. Handurukande, A.-M. Kermarrec & L. Massoulié INRIA-Futurs and LIX, Palaiseau, France Distributed Programming Laboratory, EPFL, Switzerland
More informationTrace Driven Analysis of the Long Term Evolution of Gnutella Peer-to-Peer Traffic
Trace Driven Analysis of the Long Term Evolution of Gnutella Peer-to-Peer Traffic William Acosta and Surendar Chandra University of Notre Dame, Notre Dame IN, 46556, USA {wacosta,surendar}@cse.nd.edu Abstract.
More informationPeer to peer networks: sharing between peers. Trond Aspelund
Peer to peer networks: sharing between peers Trond Aspelund Abstract In this literature survey we look at peer-to-peer networks. We first see how peer-to-peer networks distinguish themselves from the client/server
More informationScalable Bloom Filters
Scalable Bloom Filters Paulo Sérgio Almeida Carlos Baquero Nuno Preguiça CCTC/Departamento de Informática Universidade do Minho CITI/Departamento de Informática FCT, Universidade Nova de Lisboa David Hutchison
More informationAn Efficient Strategy for Data Recovery in Wi-Fi Systems
International Journal of Research & Development in Science and Technology Volume 1, Issue 2, December 2014, PP 1-6 ISSN 2350-4751 (Print) & ISSN 2350-4751(Online) An Efficient Strategy for Data Recovery
More informationEfficient File Sharing Scheme in Mobile Adhoc Network
Efficient File Sharing Scheme in Mobile Adhoc Network 1 Y. Santhi, 2 Mrs. M. Maria Sheeba 1 2ndMECSE, Ponjesly College of engineering, Nagercoil 2 Assistant professor, Department of CSE, Nagercoil Abstract:
More informationEnhancing Secure File Transfer by Analyzing Repeated Server Based Strategy using Gargantuan Peers (G-peers)
Enhancing Secure File Transfer by Analyzing Repeated Server Based Strategy using Gargantuan Peers (G-peers) Kaushik Sekaran Assistant Professor School of Computing Science & Engineering VIT University,
More informationA P2P SERVICE DISCOVERY STRATEGY BASED ON CONTENT
A P2P SERVICE DISCOVERY STRATEGY BASED ON CONTENT CATALOGUES Lican Huang Institute of Network & Distributed Computing, Zhejiang Sci-Tech University, No.5, St.2, Xiasha Higher Education Zone, Hangzhou,
More informationPeer-VM: A Peer-to-Peer Network of Virtual Machines for Grid Computing
Peer-VM: A Peer-to-Peer Network of Virtual Machines for Grid Computing (Research Proposal) Abhishek Agrawal (aagrawal@acis.ufl.edu) Abstract This proposal discusses details about Peer-VM which is a peer-to-peer
More informationInternational journal of Engineering Research-Online A Peer Reviewed International Journal Articles available online http://www.ijoer.
RESEARCH ARTICLE ISSN: 2321-7758 GLOBAL LOAD DISTRIBUTION USING SKIP GRAPH, BATON AND CHORD J.K.JEEVITHA, B.KARTHIKA* Information Technology,PSNA College of Engineering & Technology, Dindigul, India Article
More informationEFFICIENT DETECTION IN DDOS ATTACK FOR TOPOLOGY GRAPH DEPENDENT PERFORMANCE IN PPM LARGE SCALE IPTRACEBACK
EFFICIENT DETECTION IN DDOS ATTACK FOR TOPOLOGY GRAPH DEPENDENT PERFORMANCE IN PPM LARGE SCALE IPTRACEBACK S.Abarna 1, R.Padmapriya 2 1 Mphil Scholar, 2 Assistant Professor, Department of Computer Science,
More informationAnonymous Communication in Peer-to-Peer Networks for Providing more Privacy and Security
Anonymous Communication in Peer-to-Peer Networks for Providing more Privacy and Security Ehsan Saboori and Shahriar Mohammadi Abstract One of the most important issues in peer-to-peer networks is anonymity.
More informationN6Lookup( title ) Client
CS 640: Introduction Networks AdityaAkella Peer-to-Peer Lecture 24 -to Computer p2p Uses Downloading: Searching Centralized Flooding Smarter Routing file of sharing p2p The (Freenet, (Gnutella, flooding
More informationImproving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities
Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities Kavitha Ranganathan, Adriana Iamnitchi, Ian Foster Department of Computer Science, The University
More informationHow To Create A P2P Network
Peer-to-peer systems INF 5040 autumn 2007 lecturer: Roman Vitenberg INF5040, Frank Eliassen & Roman Vitenberg 1 Motivation for peer-to-peer Inherent restrictions of the standard client/server model Centralised
More informationPROPOSAL AND EVALUATION OF A COOPERATIVE MECHANISM FOR HYBRID P2P FILE-SHARING NETWORKS
PROPOSAL AND EVALUATION OF A COOPERATIVE MECHANISM FOR HYBRID P2P FILE-SHARING NETWORKS Hongye Fu, Naoki Wakamiya, Masayuki Murata Graduate School of Information Science and Technology Osaka University
More informationNew Structured P2P Network with Dynamic Load Balancing Scheme
New Structured P2P Network with Dynamic Load Balancing Scheme Atushi TAKEDA, Takuma OIDE and Akiko TAKAHASHI Department of Information Science, Tohoku Gakuin University Department of Information Engineering,
More informationDiscovery and Routing in the HEN Heterogeneous Peer-to-Peer Network
Discovery and Routing in the HEN Heterogeneous Peer-to-Peer Network Tim Schattkowsky Paderborn University, C-LAB, D-33102 Paderborn, Germany tim@c-lab.de Abstract. Network infrastructures are nowadays
More informationLocating Randomly Selected Destinations in Large Multi-hop Wireless Networks
Locating Randomly Selected Destinations in Large Multi-hop Wireless Networks Jing Deng Department of Computer Science University of New Orleans New Orleans, LA 7148, USA E-mail: jing@cs.uno.edu Abstract.
More informationSemantic Search in Peer-to-Peer Systems. Yingwu Zhu and Yiming Hu
Semantic Search in Peer-to-Peer Systems Yingwu Zhu and Yiming Hu Contents 1 Semantic Search in Peer-to-Peer Systems 1 1.1 Introduction.................................... 1 1.2 Search in Unstructured P2P
More informationQuality of Service Routing Network and Performance Evaluation*
Quality of Service Routing Network and Performance Evaluation* Shen Lin, Cui Yong, Xu Ming-wei, and Xu Ke Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 {shenlin, cy, xmw,
More informationBig Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network
, pp.273-284 http://dx.doi.org/10.14257/ijdta.2015.8.5.24 Big Data Analytics of Multi-Relationship Online Social Network Based on Multi-Subnet Composited Complex Network Gengxin Sun 1, Sheng Bin 2 and
More informationGISP: Global Information Sharing Protocol a distributed index for peer-to-peer systems
GISP: Global Information Sharing Protocol a distributed index for peer-to-peer systems Daishi Kato Computer Science Department, Stanford University Visiting from NEC Corporation Abstract This paper proposes
More informationTornado: A Capability-Aware Peer-to-Peer Storage Network
Tornado: A Capability-Aware Peer-to-Peer Storage Network Hung-Chang Hsiao hsiao@pads1.cs.nthu.edu.tw Chung-Ta King* king@cs.nthu.edu.tw Department of Computer Science National Tsing Hua University Hsinchu,
More informationPERFORMANCE ANALYSIS OF AD-HOC ON DEMAND DISTANCE VECTOR FOR MOBILE AD- HOC NETWORK
http:// PERFORMANCE ANALYSIS OF AD-HOC ON DEMAND DISTANCE VECTOR FOR MOBILE AD- HOC NETWORK Anjali Sahni 1, Ajay Kumar Yadav 2 1, 2 Department of Electronics and Communication Engineering, Mewar Institute,
More informationScalable Source Routing
Scalable Source Routing January 2010 Thomas Fuhrmann Department of Informatics, Self-Organizing Systems Group, Technical University Munich, Germany Routing in Networks You re there. I m here. Scalable
More informationHierarchical Content Routing in Large-Scale Multimedia Content Delivery Network
Hierarchical Content Routing in Large-Scale Multimedia Content Delivery Network Jian Ni, Danny H. K. Tsang, Ivan S. H. Yeung, Xiaojun Hei Department of Electrical & Electronic Engineering Hong Kong University
More informationA Network Monitoring System with a Peer-to-Peer Architecture
A Network Monitoring System with a Peer-to-Peer Architecture Paulo Salvador, Rui Valadas University of Aveiro / Institute of Telecommunications Aveiro E-mail: salvador@av.it.pt; rv@det.ua.pt Abstract The
More informationClustering in Peer-to-Peer File Sharing Workloads
Clustering in Peer-to-Peer File Sharing Workloads F. Le Fessant, S. Handurukande, A.-M. Kermarrec & L. Massoulié INRIA-Futurs and LIX, Palaiseau, France EPFL, Lausanne, Switzerland Microsoft Research,
More informationScaling Unstructured Peer-to-Peer Networks With Multi-Tier Capacity-Aware Overlay Topologies
Scaling Unstructured Peer-to-Peer Networks With Multi-Tier Capacity-Aware Overlay Topologies Mudhakar Srivatsa, Buğra Gedik and Ling Liu College of Computing, Georgia Institute of Technology {mudhakar,
More informationICP. Cache Hierarchies. Squid. Squid Cache ICP Use. Squid. Squid
Caching & CDN s 15-44: Computer Networking L-21: Caching and CDNs HTTP APIs Assigned reading [FCAB9] Summary Cache: A Scalable Wide- Area Cache Sharing Protocol [Cla00] Freenet: A Distributed Anonymous
More informationDecentralized Peer-to-Peer Network Architecture: Gnutella and Freenet
Decentralized Peer-to-Peer Network Architecture: Gnutella and Freenet AUTHOR: Jem E. Berkes umberkes@cc.umanitoba.ca University of Manitoba Winnipeg, Manitoba Canada April 9, 2003 Introduction Although
More informationADAPTIVE DISTRIBUTED CACHING WITH MINIMAL MEMORY USAGE
ADAPTIVE DISTRIBUTED CACHING WITH MINIMAL MEMORY USAGE Markus J. Kaiser, Kwok Ching Tsui and Jiming Liu Department of Computer Science Hong Kong Baptist University Kowloon Tong, Kowloon, Hong Kong ABSTRACT
More informationEfficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems
Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems Kunwadee Sripanidkulchai Bruce Maggs Hui Zhang Carnegie Mellon University, Pittsburgh, PA 15213 {kunwadee,bmm,hzhang}@cs.cmu.edu
More informationAn Introduction to Peer-to-Peer Networks
An Introduction to Peer-to-Peer Networks Presentation for MIE456 - Information Systems Infrastructure II Vinod Muthusamy October 30, 2003 Agenda Overview of P2P Characteristics Benefits Unstructured P2P
More informationResearch Issues in Peer-to-Peer Data Management
Research Issues in Peer-to-Peer Data Management Özgür Ulusoy Department of Computer Engineering Bilkent University, Ankara, Turkey oulusoy@cs.bilkent.edu.tr Abstract-Data management in Peer-to-Peer (P2P)
More informationArchitectural Framework for Large- Scale Multicast in Mobile Ad Hoc Networks
Architectural Framework for Large- Scale Multicast in Mobile Ad Hoc Networks Ahmed Helmy Electrical Engineering Department University of Southern California (USC) helmy@usc.edu http://ceng.usc.edu/~helmy
More informationPEER TO PEER FILE SHARING USING NETWORK CODING
PEER TO PEER FILE SHARING USING NETWORK CODING Ajay Choudhary 1, Nilesh Akhade 2, Aditya Narke 3, Ajit Deshmane 4 Department of Computer Engineering, University of Pune Imperial College of Engineering
More informationA Reputation Management System in Structured Peer-to-Peer Networks
A Reputation Management System in Structured Peer-to-Peer Networks So Young Lee, O-Hoon Kwon, Jong Kim and Sung Je Hong Dept. of Computer Science & Engineering, Pohang University of Science and Technology
More informationPeer-to-Peer Research at Stanford
Peer-to-Peer Research at Stanford Mayank Bawa, Brian F. Cooper, Arturo Crespo, Neil Daswani, Prasanna Ganesan, Hector Garcia-Molina, Sepandar Kamvar, Sergio Marti, Mario Schlosser, Qi Sun, Patrick Vinograd,
More informationA Topology-Aware Relay Lookup Scheme for P2P VoIP System
Int. J. Communications, Network and System Sciences, 2010, 3, 119-125 doi:10.4236/ijcns.2010.32018 Published Online February 2010 (http://www.scirp.org/journal/ijcns/). A Topology-Aware Relay Lookup Scheme
More informationUsing Peer to Peer Dynamic Querying in Grid Information Services
Using Peer to Peer Dynamic Querying in Grid Information Services Domenico Talia and Paolo Trunfio DEIS University of Calabria HPC 2008 July 2, 2008 Cetraro, Italy Using P2P for Large scale Grid Information
More informationPeer-to-Peer Networks 02: Napster & Gnutella. Christian Schindelhauer Technical Faculty Computer-Networks and Telematics University of Freiburg
Peer-to-Peer Networks 02: Napster & Gnutella Christian Schindelhauer Technical Faculty Computer-Networks and Telematics University of Freiburg Napster Shawn (Napster) Fanning - published 1999 his beta
More informationUnstructured Peer-to-Peer Networks: Topological Properties and Search Performance
Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance George H.L. Fletcher, Hardik A. Sheth,andKatyBörner Computer Science Department School of Informatics School of Library
More informationMonitoring Large Flows in Network
Monitoring Large Flows in Network Jing Li, Chengchen Hu, Bin Liu Department of Computer Science and Technology, Tsinghua University Beijing, P. R. China, 100084 { l-j02, hucc03 }@mails.tsinghua.edu.cn,
More informationRanked Keyword Search in Cloud Computing: An Innovative Approach
International Journal of Computational Engineering Research Vol, 03 Issue, 6 Ranked Keyword Search in Cloud Computing: An Innovative Approach 1, Vimmi Makkar 2, Sandeep Dalal 1, (M.Tech) 2,(Assistant professor)
More informationBloom Filter based Inter-domain Name Resolution: A Feasibility Study
Bloom Filter based Inter-domain Name Resolution: A Feasibility Study Konstantinos V. Katsaros, Wei Koong Chai and George Pavlou University College London, UK Outline Inter-domain name resolution in ICN
More informationPEER-TO-PEER (P2P) systems have emerged as an appealing
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 21, NO. 4, APRIL 2009 595 Histogram-Based Global Load Balancing in Structured Peer-to-Peer Systems Quang Hieu Vu, Member, IEEE, Beng Chin Ooi,
More informationLoad Balancing in Structured P2P Systems
1 Load Balancing in Structured P2P Systems Ananth Rao Karthik Lakshminarayanan Sonesh Surana Richard Karp Ion Stoica ananthar, karthik, sonesh, karp, istoica @cs.berkeley.edu Abstract Most P2P systems
More informationIPTV AND VOD NETWORK ARCHITECTURES. Diogo Miguel Mateus Farinha
IPTV AND VOD NETWORK ARCHITECTURES Diogo Miguel Mateus Farinha Instituto Superior Técnico Av. Rovisco Pais, 1049-001 Lisboa, Portugal E-mail: diogo.farinha@ist.utl.pt ABSTRACT IPTV and Video on Demand
More informationFile sharing using IP-Multicast
File sharing using IP-Multicast Kai Trojahner, Peter Sobe University of Luebeck, Germany Institute of Computer Engineering email: sobe@iti.uni-luebeck.de Abstract: File sharing systems cause a huge portion
More informationA Novel Routing and Data Transmission Method for Stub Network of Internet of Things based on Percolation
IEEE INFOCO 2011 Workshop on 2CN-2011 A Novel Routing and Data Transmission ethod for Stub Network of Internet of Things based on Percolation Xiangming Li, Jihua Lu, Jie Yang, and Jianping An School of
More informationTopic Communities in P2P Networks
Topic Communities in P2P Networks Joint work with A. Löser (IBM), C. Tempich (AIFB) SNA@ESWC 2006 Budva, Montenegro, June 12, 2006 Two opposite challenges when considering Social Networks Analysis Nodes/Agents
More informationBloom Filters. Christian Antognini Trivadis AG Zürich, Switzerland
Bloom Filters Christian Antognini Trivadis AG Zürich, Switzerland Oracle Database uses bloom filters in various situations. Unfortunately, no information about their usage is available in Oracle documentation.
More informationAN EFFICIENT STRATEGY OF AGGREGATE SECURE DATA TRANSMISSION
INTERNATIONAL JOURNAL OF REVIEWS ON RECENT ELECTRONICS AND COMPUTER SCIENCE AN EFFICIENT STRATEGY OF AGGREGATE SECURE DATA TRANSMISSION K.Anusha 1, K.Sudha 2 1 M.Tech Student, Dept of CSE, Aurora's Technological
More informationPerformance Issues of P2P File Sharing Over Asymmetric and Wireless Networks
Performance Issues of P2P File Sharing Over Asymmetric and Wireless Networks Yao-Nan Lien Computer Science Department National Chengchi University Taipei, Taiwan lien@cs.nccu.edu.tw Abstract Some Peer-to-Peer
More informationGuiding Web Proxy and Server Placement for High Performance Internet Content Delivery 1
Guiding Web Proxy and Server Placement for High Performance Internet Content Delivery 1 Peter Triantafillou (contact author) Department of Computer Engineering and Informatics, University of Patras Rio
More informationLoad Distribution in Large Scale Network Monitoring Infrastructures
Load Distribution in Large Scale Network Monitoring Infrastructures Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Gianluca Iannaccone, and Josep Solé-Pareta Universitat Politècnica de Catalunya (UPC) {jsanjuas,pbarlet,pareta}@ac.upc.edu
More informationIMPACT OF DISTRIBUTED SYSTEMS IN MANAGING CLOUD APPLICATION
INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND SCIENCE IMPACT OF DISTRIBUTED SYSTEMS IN MANAGING CLOUD APPLICATION N.Vijaya Sunder Sagar 1, M.Dileep Kumar 2, M.Nagesh 3, Lunavath Gandhi
More informationLoad Balancing through Automated Replication in Unstructured P2P File Sharing Systems
SBRC 2007 - Desempenho em Sistemas P2P 957 Load Balancing through Automated Replication in Unstructured P2P File Sharing Systems Cristina L. Abad 1 1 Facultad de Ingeniería en Electricidad y Computación
More informationEfficient processing of rare queries Gnutella using a hybrid infrastructure
Efficient processing of rare queries Gnutella using a hybrid infrastructure Mark Kornfilt½and Manfred Hauswirth¾ ½LimeWire LLC ¾DERI Galway Abstract. Gnutella is still one of the most popular P2P systems
More informationThe Case for Service Provider Deployment of Super-Peers in Peer-to-Peer Networks
1 The Case for Service Provider Deployment of Super-Peers in Peer-to-Peer Networks Sumeet Singh, Sriram Ramabhadran, Florin Baboescu, and Alex C. Snoeren University of California, San Diego {susingh, sriram,
More informationMapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems
Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems Matei Ripeanu, Ian Foster {matei, foster}@cs.uchicago.edu Abstract Despite recent excitement generated by the peer-to-peer
More informationA Review on Efficient File Sharing in Clustered P2P System
A Review on Efficient File Sharing in Clustered P2P System Anju S Kumar 1, Ratheesh S 2, Manoj M 3 1 PG scholar, Dept. of Computer Science, College of Engineering Perumon, Kerala, India 2 Assisstant Professor,
More informationImpact of Peer Incentives on the Dissemination of Polluted Content
Impact of Peer Incentives on the Dissemination of Polluted Content Fabricio Benevenuto fabricio@dcc.ufmg.br Virgilio Almeida virgilio@dcc.ufmg.br Cristiano Costa krusty@dcc.ufmg.br Jussara Almeida jussara@dcc.ufmg.br
More informationPeer-to-Peer and Grid Computing. Chapter 4: Peer-to-Peer Storage
Peer-to-Peer and Grid Computing Chapter 4: Peer-to-Peer Storage Chapter Outline Using DHTs to build more complex systems How DHT can help? What problems DHTs solve? What problems are left unsolved? P2P
More informationImproving Availability with Adaptive Roaming Replicas in Presence of Determined DoS Attacks
Improving Availability with Adaptive Roaming Replicas in Presence of Determined DoS Attacks Chin-Tser Huang, Prasanth Kalakota, Alexander B. Alexandrov Department of Computer Science and Engineering University
More informationMapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design
Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design Matei Ripeanu Ian Foster,2 Adriana Iamnitchi matei@cs.uchicago.edu foster@mcs.anl.gov anda@cs.uchicago.edu
More informationOptimization of Search Results with Duplicate Page Elimination using Usage Data A. K. Sharma 1, Neelam Duhan 2 1, 2
Optimization of Search Results with Duplicate Page Elimination using Usage Data A. K. Sharma 1, Neelam Duhan 2 1, 2 Department of Computer Engineering, YMCA University of Science & Technology, Faridabad,
More informationP2P Networking - Advantages and Disadvantages of Virtualization
Are Virtualized Overlay Networks Too Much of a Good Thing? Pete Keleher, Bobby Bhattacharjee, Bujor Silaghi Department of Computer Science University of Maryland, College Park keleher@cs.umd.edu 1 Introduction
More informationA Measurement Study of Peer-to-Peer File Sharing Systems
CSF641 P2P Computing 點 對 點 計 算 A Measurement Study of Peer-to-Peer File Sharing Systems Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble Department of Computer Science and Engineering University
More informationEnhancing Data Security in Cloud Storage Auditing With Key Abstraction
Enhancing Data Security in Cloud Storage Auditing With Key Abstraction 1 Priyadharshni.A, 2 Geo Jenefer.G 1 Master of engineering in computer science, Ponjesly College of Engineering 2 Assistant Professor,
More informationPSON: A Scalable Peer-to-Peer File Sharing System Supporting Complex Queries
PSON: A Scalable Peer-to-Peer File Sharing System Supporting Complex Queries Jyoti Ahuja, Jun-Hong Cui, Shigang Chen, Li Lao jyoti@engr.uconn.edu, jcui@cse.uconn.edu, sgchen@cise.ufl.edu, llao@cs.ucla.edu
More informationAmerican Journal of Engineering Research (AJER) 2013 American Journal of Engineering Research (AJER) e-issn: 2320-0847 p-issn : 2320-0936 Volume-2, Issue-4, pp-39-43 www.ajer.us Research Paper Open Access
More informationA Novel Path Selection and Recovery Mechanism for MANETs P2P File Sharing Applications
A Novel Path Selection and Recovery Mechanism for MANETs P2P File Sharing Applications Ahmed Abada Dept. of Systems and Computer Engineering Carleton University Ottawa, ON, Canada Li Cui Institute of Computing
More informationKrunal Patel Department of Information Technology A.D.I.T. Engineering College (G.T.U.) India. Fig. 1 P2P Network
Volume 3, Issue 7, July 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Secure Peer-to-Peer
More informationA Novel Caching Scheme for Internet based Mobile Ad Hoc Networks
A Novel Caching Scheme for Internet based Mobile Ad Hoc Networks Sunho Lim, Wang-Chien Lee, Guohong Cao, and Chita R. Das Department of Computer Science & Engineering The Pennsylvania State University
More informationDistributed Computing over Communication Networks: Topology. (with an excursion to P2P)
Distributed Computing over Communication Networks: Topology (with an excursion to P2P) Some administrative comments... There will be a Skript for this part of the lecture. (Same as slides, except for today...
More informationA Novel Way of Deduplication Approach for Cloud Backup Services Using Block Index Caching Technique
A Novel Way of Deduplication Approach for Cloud Backup Services Using Block Index Caching Technique Jyoti Malhotra 1,Priya Ghyare 2 Associate Professor, Dept. of Information Technology, MIT College of
More informationSCALABLE RANGE QUERY PROCESSING FOR LARGE-SCALE DISTRIBUTED DATABASE APPLICATIONS *
SCALABLE RANGE QUERY PROCESSING FOR LARGE-SCALE DISTRIBUTED DATABASE APPLICATIONS * Maha Abdallah LIP6, Université Paris 6, rue du Capitaine Scott 75015 Paris, France Maha.Abdallah@lip6.fr Hung Cuong Le
More informationSUITABLE ROUTING PATH FOR PEER TO PEER FILE TRANSFER
SUITABLE ROUTING PATH FOR PEER TO PEER FILE TRANSFER R. Naga Priyadarsini, S. Suma and V. Dhanakoti Department of Computer Science Engineering, Valliammai Engineering College, Kanchipuram, India ABSTRACT
More informationCOMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 2 Issue 5 May, 2013 Page No. 1680-1684 COMPARATIVE ANALYSIS OF ON -DEMAND MOBILE AD-HOC NETWORK ABSTRACT: Mr.Upendra
More informationMonitoring Large-Scale Wireless Sensor Networks
Monitoring Large-Scale Wireless Sensor Networks using Epidemic Protocols Daniela Gavidia, Spyros Voulgaris, Maarten van Steen Vrije Universiteit Amsterdam Faculty of Science Department of Computer Science
More informationOriginal-page small file oriented EXT3 file storage system
Original-page small file oriented EXT3 file storage system Zhang Weizhe, Hui He, Zhang Qizhen School of Computer Science and Technology, Harbin Institute of Technology, Harbin E-mail: wzzhang@hit.edu.cn
More informationDepartment of Computer Science Institute for System Architecture, Chair for Computer Networks. File Sharing
Department of Computer Science Institute for System Architecture, Chair for Computer Networks File Sharing What is file sharing? File sharing is the practice of making files available for other users to
More informationA Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks
1 A Peer-to-Peer File Sharing System for Wireless Ad-Hoc Networks Hasan Sözer, Metin Tekkalmaz, and İbrahim Körpeoğlu Abstract File sharing in wireless ad-hoc networks in a peerto-peer manner imposes many
More information