Characterizing Guarded Hosts in Peer-to-Peer File Sharing Systems
|
|
- Sarah Quinn
- 5 years ago
- Views:
Transcription
1 Characterizing Guarded Hosts in Peer-to-Peer File Sharing Systems Wenjie Wang Hyunseok Chang Amgad Zeitoun Sugih Jamin Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI, 489, USA {wenjiew, hschang, azeitoun, Abstract We call end-hosts behind Network Address Translator (NAT) gateways or firewalls guarded hosts,and otherwise open hosts. Due to mounting security threats and growing population of high-speed Internet users equipped with connection sharing, guarded hosts become increasingly common in today s Internet. However, the presence of guarded hosts has a detrimental effect on the performance of peer-to-peer file sharing systems as they may disallow incoming connections initiated by remote peers to download files or to build an overlay. In this paper, we empirically measure the prevalence of guarded hosts in two popular peerto-peer file sharing systems, edonkey and Gnutella, and study the characteristics of their shared files. By performing passive and active probes, we found that about 25 36% of edonkey and Gnutella users reside on guarded hosts and that the ratio of files shared by guarded hosts is also non-trivial. When discounting guarded hosts, we found that a popular file s availability, i.e., the number of copies available for download, decreases by 25 3%. Our measurement study testifies to the significant impact guarded hosts may have on the performance of current peer-topeer file sharing systems, and points to a need to consider their presence when designing next generation peer-to-peer systems. I. INTRODUCTION AND MOTIVATION A peer-to-peer file sharing system [ 5] provides a framework that facilitates locating and exchanging files among different peers. Due to mounting security threats and growing popularity of high-speed Internet connections shared by multiple machines, NAT gateways or firewalls become increasingly common among peer-to-peer file sharing users. We call hosts behind Network Address Translator (NAT) gateways or firewalls guarded hosts, and otherwise open hosts. The presence of peers on guarded hosts violates two implicit assumptions inherent in any file sharing system: unique identification of peers and two-way connectivity between peers. That is, while a given peer X can always initiate a connection to another peer on an open host, the reverse may not be true if peer X is on a guarded host. To access files shared by a guarded host X, a remote host A needs a proxy server (or another peer) S that maintains a connection to X. S can route queries or download requests to X on A s behalf. X then pushes the results or requested files back to the actual recipient A. This push mechanism introduces extra overhead on the proxy server and may create long access latency for those peers making requests. There have been several measurement studies about peer-topeer file sharing systems. For example, Saroiu et al. reported that end-hosts in Napster and Gnutella systems are highly heterogeneous in terms of bottleneck bandwidth, latency and For the purpose of our study, we consider guarded hosts that enable port forwarding open hosts. availability [6]. Sen and Wang analyzed flow-level traffic in FastTrack, Gnutella, and DirectConnect systems, and found that the spatial distribution for traffic volumes is extremely skewed but relatively stable [7]. Markatos collected queries and replies issued by Gnutella peers and found that Gnutella queries exhibit significant temporal locality [8]. To our best knowledge, however, there is no existing work that reports on guarded hosts in peer-to-peer file sharing systems. In this paper, we empirically measure the prevalence of guarded hosts participating in two popular peer-to-peer file sharing systems, edonkey and Gnutella, and carefully examine the characteristics of their shared files. By performing passive and active probes, we found that about 25 36% of edonkey and Gnutella users are located on guarded hosts. We present some evidence that this percentage is a reliable ballpark figure. Furthermore, we found that a similar ratio of files are shared by guarded hosts in Gnutella. As far as the characteristics of shared files are concerned, we found that file sharing patterns of guarded hosts are qualitatively similar to those of open hosts; there are several guarded hosts that share a significant number of files, but many of them contributes only a few files. When discounting guarded hosts, we found that a popular file s availability, which is measured by the number of copies available for download in peer-to-peer systems, decreases by 25 3%. Finally, we report that in Gnutella, a significant number of search queries are returned by guarded hosts, which may degrade the performance of Gnutella network. The rest of the paper is structured as follows. In Section II, we briefly describe existing peer-to-peer file sharing systems. We explain in Section III our methodology for estimating the population of guarded hosts in edonkey and Gnutella systems. We report the ratio of guarded hosts participating in those systems in Section IV, and their file sharing characteristics in Section V. In Section VI, we provide evidence that our result on guarded host population is reliable. Finally, we discuss in Section VII the negative impacts that guarded hosts may have on the performance of peer-to-peer systems. We conclude the paper in Section VIII. II. PEER-TO-PEER FILE SHARING SYSTEMS The main difference between various types of peer-to-peer file sharing systems lies in the way peers locate files. In Napster [] and edonkey [2], dedicated centralized servers maintain information associating files indices with a list of peers storing these files. In order to locate a file in such a system, a peer simply contacts one or more servers for a list of other peers storing the file. Gnutella [3] and Myster [5] employ
2 a decentralized approach for file searching. In such systems, peers form an overlay network to propagate search messages. When a peer searches for a file, it sends out a request by controlled flooding through the overlay. If a peer receives a request for a file that is stored locally, it sends a response back to the requesting peer. Some peer-to-peer systems, such as KaZaA [4], adopt a hybrid approach. In KaZaA, some peers with sufficient bandwidth and processing power are elected dynamically to act as super-peers. Super-peers are then contacted by other peers for file searching. In our study, we examine edonkey and Gnutella, which are the popularly used centralized and decentralized versions of peer-to-peer file sharing systems. These two applications are among the top five most downloaded file sharing systems at III. MEASUREMENT METHODOLOGY In this section, we outline our main approach for estimating the prevalence of guarded hosts in the edonkey and Gnutella file sharing systems. A. The edonkey file sharing system In edonkey, a set of dedicated servers allow peers to search for files. Upon startup, a peer connects to a server, which then assigns a unique ID to that peer. There are two types of IDs assigned by each server, HighID and LowID. A peer on an open host is assigned a HighID, which is the decimal representation of the host s IP address. A peer on a guarded host is assigned a LowID, which is an arbitrary 32-bit unique number managed by its connected server. Each server determines whether a host should be assigned a HighID or LowID based on the result of a proprietary probing. Comparing the number of HighID peers and LowID peers gives a good estimate on the population of edonkey peers running on guarded hosts. When a peer X queries its connected server for a file, the server returns a list of peers, along with their IDs, that have the requested file. Upon receiving a set of matched peers from the server, peer X starts to download the file from these peers in parallel. Since we do not have control over any existing edonkey server, we modified emule [9], an open-source client, to collect the list of peers returned by the server. Specifically, our modified emule client connects to a server, and asks for files with well-known suffixes (avi, mp3, mpg, and wmv). From the list of files returned for each suffix, the client requests the 5 highest-ranked files in terms of their availability. 2 Each request prompts the server to return a list of peers storing a requested file. From these lists, it is straightforward to distinguish between HighID and LowID peers. Our emule client stays connected to each server for 2 minutes to repeat this process three times and then randomly switches to another 2 A file s availability denotes the number of peers sharing that file, as known to the connected server. When returning a list of files matched with a query, a server also reveals the availability of each file to the querying client. By selecting files with high availability in our experiment, we can trace many peers with a few downloads. server. Our study indicates that downloading the top-5 files for 2 minutes can already provide us reliable statistic on guarded host population (see Section VI for further details). B. The Gnutella file sharing system In Gnutella, there are no centralized servers that maintain a list of peers and indices for shared files. Instead, we have to empirically discover (guarded or open) peers on our own. For this purpose, we instrumented mutella [], a terminalmode Gnutella client, to perform active probing to discover live peers and collect their file sharing status. When a new peer A comes up, it sends a Ping message to well-known bootstrapping nodes, which in turn broadcast A s Ping message to the network by controlled flooding. When an existing peer B receives the message, it replies to A with a Pong message which contains B s IP address for A to connect to and information on B s shared files. The primary mechanism for a peer to locate a file in Gnutella networks is by exchanging Query and QueryHit messages. Peer A searches for files by broadcasting a Query message that describes files of its interest. Whichever peer, Q, that has some matched files in its local storage generates a QueryHit message and routes it back to A. The QueryHit message contains Q s IP address and information on each matched file (i.e., file name, file size). Our modified mutella client runs a separate probe thread which extracts IP addresses of live peers from Pong and QueryHit messages, and actively probes them on the fly to detect guarded hosts. When a new live peer is found from a QueryHit or Pong message, the probe thread attempts to connect to the remote peer on the well-known Gnutella port (6346) for five seconds. In order to minimize falsenegatives due to temporary network congestion, the probe thread attempts to connect to each remote peer three times at five-second intervals. If the connection succeeds at least once, the remote peer is considered to be running on an open host, otherwise on a guarded host. IV. PREVALENCE OF GUARDED HOSTS In this section, we report on the empirically-inferred population of guarded hosts in edonkey and Gnutella systems. In order to discern whether a given live peer is located on an open or guarded host, we check the peer s ID (edonkey) or actively probe the peer (Gnutella). A. edonkey In order to collect live clients from edonkey network, we first obtain an up-to-date list of edonkey servers to query, which contains around 5 highly available servers []. Among them, we pick the most popular 35 servers with the maximum number of clients allowed ranging from 5, to 5,. With these 35 servers, we perform the experiment described in Section III-A for a period of two days. Fig. shows the total number of hosts we discovered on each server and the percentage of hosts detected as guarded among them. The overall average of guarded host percentage
3 Fig.. Number of Discovered Hosts Server ID Ratio of guarded hosts at different edonkey servers. TABLE I RATIO OF GUARDED HOSTS ON GNUTELLA NETWORKS (FEB. 4, 24). QueryHit-responding hosts Pong-responding hosts Prober # of probed hosts Guarded % # of probed hosts Guarded % A 28, % 8,6 34.8% B 8, % 22, % C 2, % 24, % D,797 3.% 7, % E 3, % 6, % F 5, % 5, % Total 84, % 78, % on those 35 servers is about 36%. However, the ratio of guarded hosts on each server varies significantly from % to 8%. This is because an edonkey server can control the percentage of LowID hosts connected to itself, or even disallow LowID hosts. B. Gnutella We run our modified mutella client from six different machines on local campus network for a period of one day. Table I summarizes the results from our one-day probing experiment. The second and the third columns in the table describe probing results with the set of hosts retrieved from QueryHit messages, and the right two columns with the set of hosts extracted from Pong messages. In both cases, the percentage in the last row Total indicates the fraction of hosts considered guarded by all six probing machines. Overall, about 25 36% of the hosts that have issued QueryHit or Pong messages are identified as guarded hosts by our experiment. V. FILE SHARING CHARACTERISTICS A. edonkey In our study of file sharing characteristics in edonkey network, We limit ourselves to the four most popular file types (avi, mp3, mpg, and wmv). Table II summarizes the collected meta data collected from edonkey network. As described before, our modified client connects to each of the selected 35 servers three times. Each time it is connected to a server, it requests the 5 most popular files of the four different media types. The set of the 5 most popular files may vary among servers. The second and the third column of Table II report the total number of files we thus discovered, and their median size respectively. The fourth column reports the total number of peers that share any of the files reported in the second column. Finally, the fifth column shows the ratio of guarded hosts among them. TABLE II RATIO OF GUARDED HOSTS IN EDONKEY NETWORK (FEB. 9, 24). File type # offiles Median size # of sharing hosts Guarded % avi MB 45, % mp MB 6, % mpg MB 33,6 3.3% wmv MB 9, % total, MB 2, % ) File availability: With the,486 files reported in Table II, we then examine the availability of each file (i.e., the number of peers that share a given file). Given a file, we first check how many peers share the file, and then look at how many of them are actually located on open hosts. In a sense, the number of open host-based peers that share a given file better represents the file s availability as those peers on guarded hosts do not openly contribute to file sharing. Fig. 2 plots the number of open hosts that share a given file. We sort files based on the number of hosts sharing them and assign a rank ID to each file. Given a file f, we report in y-axis (i) the total number of hosts that share f (labeled all hosts ) and (ii) the number of open hosts among them (labeled open hosts ). Discounting those peers on guarded hosts, we find out that the availability of each file (especially for those files whose availability are larger than ) decreases roughly by one-third. When focusing on specific file types (e.g., avi and mp3) and considering them separately, we observe similar trends. 2) Number of files per-host: We also study the number of files discovered on each individual peer. Without running a server on our own, we cannot obtain a complete list of files shared by a remote peer in edonkey. 3 By querying servers with search keywords, we can only get a partial list of shared files for a peer. Although requesting a larger number of files from servers would reveal more complete file sharing status of each peer, the search configuration of a typical edonkey server does not allow one to request more than several thousands of files from each server. In Fig. 3, we examine the number of files shared by each open or guarded host in edonkey. Given two sets of hosts (open and guarded), we sort them separately by the number of their shared files and identify them by their ranks on x-axis. The number on y-axis represents the number of files shared by a corresponding host. According to the figure, most open hosts share less than ten files, but several open hosts share over files. We have discovered fewer files for guarded hosts, with maximum number of files less than ten. B. Gnutella As described before, our mutella client gleans file sharing status of individual peers from Pong and QueryHit messages. A Pong message reports the total number and the total byte amount of files that are shared by a given peer. A QueryHit message, on the other hand, reveals information on a specific 3 There is a feature called friend list of the emule client software that allows a peer s friend to see its shared file list. However, this feature is disabled by default and our experiment exploiting this feature turned out to be unsuccessful.
4 9 8 7 all files: all hosts all files: open hosts open hosts guarded hosts 6 5 Number of Clients Number of Files GB File ID Host AVI RM MPG MP3 RMVB BIN ISO RAR ZIP WMV Fig. 2. Number of hosts per-file. Fig. 3. Number of files per-host. Fig. 4. Top- file types of Gnutella networks. file (i.e., file size and file name) shared by a peer. While collecting per-peer file sharing summary from Pong messages allows us to estimate the size of data storage that each peer makes available for potential upload, snooping QueryHit messages enables us to locate where popular files (which are requested frequently) are hosted. While we were conducting our experiment, we identified a handful of peers that generate a significant number of QueryHit messages which are apparently bogus. Also, we encountered many peers with private addresses (e.g., 92.68/6). In the rest of our study, we discard all the control messages that originate from those misbehaving peers or privately addressed ones. ) QueryHit-based sharing info: We extract from each QueryHit message a (<file size>, <file extension>, <peer s IP address>) tuple. Given a set of three-element QueryHit tuples, we estimate the availability of each shared file. To calculate file availability, we group all the QueryHit tuples associated with an identical file size, and count the distinct IP addresses in them. In our analysis, a set of duplicate QueryHit tuples (if any) are counted just once. We also distinguish between peers on open hosts and guarded hosts. We present in Fig. 4 the top- most popular file types that are shared in Gnutella. We classify all collected QueryHit tuples based on their file types, and then sum up file sizes for each type. If a given file is shared by multiple peers, we sum up its size as many times as the number of sharing peers. In the figure, the height of each bar denotes the total amount of storage for shared files of a given type, and a smaller darker bar represents the ratio of the storage used by guarded hosts. The top- most popular file types include well-known video (e.g., avi, rm, mpg, rmvb, wmv), audio (e.g., mp3), and archive (e.g., bin, iso, rar, zip) formats. The fraction of files that are shared by guarded hosts ranges from 25% to 45%, which is comparable to the guarded hosts percentage reported in Table I. This means that guarded hosts are non-negligible not only in terms of their numbers, but also in terms of their sharing volume. Fig. 5 shows two distribution of file availability. In the distribution labeled, we do not distinguish peers on guarded hosts and those on open hosts while the distribution labeled only reports the number of peers on open host. As can be seen from the figure, file availability exhibits heavy-tailed distribution, where the availability spans over more than two orders of magnitude. When discounting peers on guarded hosts, the availability of the most popular file decreases from 8 to 6, but the overall distribution still remains qualitatively the same. 2) Pong-based sharing info: Unlike edonkey, Gnutella allows one to retrieve a complete file sharing summary from remote peers through Pong messages. We now examine the file sharing information collected from Pong messages. In Fig. 6, we plot the (-CDF) distribution for per-host sharing volume that we infer from Pong messages. In the figure, we plot two distributions, one for open hosts and the other for guarded hosts. The evidence for the abundance of freeriders in Gnutella is prominent in the figure, where about 4 5% of peers do not share any file. Adar and Huberman made a similar observation [2], but without distinguishing between open hosts and guarded hosts. Comparing two distribution for open and guarded hosts, one can see that peers on open hosts tend to store more files than those on guarded hosts. The entire distributions still remain qualitatively similar. VI. REPRESENTATIVENESS OF GUARDED HOST PERCENTAGE Since we do not have control of any edonkey server, we can only collect a partial list of live peers in edonkey network by querying existing servers. We ask whether the client set we collected is representative of edonkey population as far as guarded host percentage is concerned. There are two factors that may affect our estimation of guarded host percentage: the number of files queried and the time period our collector client stays connected to a server. By requesting more files, a client can increase a chance to discover more peers from the connected server. Also, a client that stays connected to a server for a longer period may collect more peers from the server by querying it periodically. To examine the effect of these two factors, we perform the following experiment. We select four highly populated servers, one in North America, two in Europe, and one in Asia. For each server, our client stays connected for two hours, and downloads the top-5 files of well-known types (avi, mp3, and mpg). To examine whether searching for a varied number of files yields different guarded host percentage, we calculate the ratio of guarded hosts that share files of the top-n availability, and check how the ratio changes as we vary n from to 5. We report the ratio in Figs. 8(a) and (b) for file suffix avi
5 - CDF.... e-5 - CDF.... Number of QueryHits Issued e-6 Availability per File Fig. 5. Per-file availability distribution. e-5 Number of Files Shared by a Host Fig. 6. Pong-inferred sharing volume distribution. Host Rank Fig. 7. Frequency of QueryHits. Ratio of Guarded Hosts server server2 server3 server File Rank (a) AVI file Fig. 8. Ratio of Guarded Hosts server server2 server3 server File Rank (b) MP3 file Ratio of guarded hosts on different servers. and mp3. Clearly the ratio of guarded host flattens beyond file rank ten. Therefore, focusing on top-ten files (in terms of their availability) sufficiently captures the ratio of guarded hosts reliably. We also checked how sensitive the guarded ratio is to the duration of our collection period. When our client remains connected to a server more than 2 minutes, the ratio of guarded hosts discovered on the server stabilizes sufficiently. As one of our future work, we plan to measure the guarded host population in Gnutella and edonkey networks at different time periods to check the temporal variation. VII. IMPACTS OF GUARDED HOSTS In this section, we examine one possible impact that guarded hosts may have on the performance of peer-to-peer file sharing systems. Here we focus on Gnutella system and ask the following question. When node A has issued a Query message and later receives a QueryHit message from a remote peer, how likely is the QueryHit message to originate from an open host (or a guarded host)? This question is practically important as QueryHit messages from a remote peer on a guarded host may introduce extra overhead for A to retrieve a corresponding file. Here we compare the frequency of QueryHit messages issued from open hosts and those from guarded host. We use the set of QueryHit messages collected by Prober A in Table I. In Fig. 7, we plot the frequency of QueryHit messages issued by each peer. All known open peers (labeled Open hosts ) are sorted in decreasing order of their QueryHit messages frequency. Based on this order, each peer has a rank (the x-axis). For each ranked host we plot in the y-axis the number of QueryHit messages issued by that host. In the the same figure, we also plot the frequency of QueryHit messages issued only from guarded hosts (labeled ). The top most ranked open host issued more than twice as many QueryHit messages as the top most ranked guarded host. In both cases, about % of top-ranked hosts are responsible for 8% of all the QueryHit messages issued. In particular, the presence of guarded hosts that flood QueryHit messages (e.g., top-% guarded hosts) has a detrimental effect on the performance of Gnutella networks as the files exposed in their QueryHit messages may not be available to all peers. VIII. CONCLUSIONS Facing the on-going threat of malicious Internet traffic and security breaches, an increasing percentage of end-hosts are now protected by firewalls. Nowadays many residential customers of high-speed Internet are equipped with software or hardware mechanisms to protect their computers and to share their connections. These trends accelerate the growth of socalled guarded host population in today s Internet. Our study empirically confirmed the prevalence of guarded hosts and the significance of their file sharing in two of the most popular peer-to-peer file sharing systems. We found that about 25-36% of edonkey and Gnutella users are located on guarded hosts and that they share a nontrivial amount of files on peer-to-peer systems. The prevalence of guarded hosts not only inhibits fair sharing among peers, but also may interfere with efficient overlay construction for overlay-based peer-to-peer systems. In this sense, our measurement study points to a need to consider their presence when improving an existing peer-to-peer system or designing a new one. REFERENCES [] Napster, [2] edonkey Network, [3] Gnutella, [4] KaZaA, [5] Myster, [6] S. Saroiu, K. Gummadi, and S. Gribble, A Measurement Study of Peer-to-Peer File Sharing Systems, in Proc. of MMCN, January 22. [7] Subhabrata Sen and Jia Wang, Analyzing peer-to-peer traffic across large networks, in Proc. of Internet Measurement Workshop, 22. [8] Evangelos P. Markatos, Tracing a large-scale Peer to Peer System: an hour in the life of Gnutella, in Proc. of IEEE/ACM International Symposium on Cluster Computing and the Grid, 22. [9] emule Client, [] Mutella, [] edonkey server list, [2] Eytan Adar and Bernardo A. Huberman, Free Riding on Gnutella, First Monday, vol. 5, no., 2.
Characterizing Gnutella Network Properties for Peer-to-Peer Network Simulation
Characterizing Gnutella Network Properties for Peer-to-Peer Network Simulation Selim Ciraci, Ibrahim Korpeoglu, and Özgür Ulusoy Department of Computer Engineering, Bilkent University, TR-06800 Ankara,
More informationCharacterizing Files in the Modern Gnutella Network: A Measurement Study
Characterizing Files in the Modern Gnutella Network: A Measurement Study Shanyu Zhao, Daniel Stutzbach, Reza Rejaie University of Oregon {szhao, agthorr, reza}@cs.uoregon.edu The Internet has witnessed
More informationCharacterizing Gnutella Network Properties for Peer-to-Peer Network Simulation
Characterizing Gnutella Network Properties for Peer-to-Peer Network Simulation Selim Ciraci, Ibrahim Korpeoglu, and Özgür Ulusoy Department of Computer Engineering Bilkent University TR-06800 Ankara, Turkey
More informationFast and low-cost search schemes by exploiting localities in P2P networks
J. Parallel Distrib. Comput. 65 (5) 79 74 www.elsevier.com/locate/jpdc Fast and low-cost search schemes by exploiting localities in PP networks Lei Guo a, Song Jiang b, Li Xiao c, Xiaodong Zhang a, a Department
More informationOn the Equivalence of Forward and Reverse Query Caching in Peer-to-Peer Overlay Networks
On the Equivalence of Forward and Reverse Query Caching in Peer-to-Peer Overlay Networks Ali Raza Butt 1, Nipoon Malhotra 1, Sunil Patro 2, and Y. Charlie Hu 1 1 Purdue University, West Lafayette IN 47907,
More informationENSC 835: HIGH-PERFORMANCE NETWORKS CMPT 885: SPECIAL TOPICS: HIGH-PERFORMANCE NETWORKS. Scalability and Robustness of the Gnutella Protocol
ENSC 835: HIGH-PERFORMANCE NETWORKS CMPT 885: SPECIAL TOPICS: HIGH-PERFORMANCE NETWORKS Scalability and Robustness of the Gnutella Protocol Spring 2006 Final course project report Eman Elghoneimy http://www.sfu.ca/~eelghone
More informationCharacterizing the Query Behavior in Peer-to-Peer File Sharing Systems*
Characterizing the Query Behavior in Peer-to-Peer File Sharing Systems* Alexander Klemm a Christoph Lindemann a Mary K. Vernon b Oliver P. Waldhorst a ABSTRACT This paper characterizes the query behavior
More informationSurvey of the State of P2P File Sharing Applications
Survey of the State of P2P File Sharing Applications Keita Ooi, Satoshi Kamei, and Tatsuya Mori Abstract Recent improvements in Internet access have been accompanied by a dramatic spread of peer-to-peer
More informationScalable overlay Networks
overlay Networks Dr. Samu Varjonen 1 Lectures MO 15.01. C122 Introduction. Exercises. Motivation. TH 18.01. DK117 Unstructured networks I MO 22.01. C122 Unstructured networks II TH 25.01. DK117 Bittorrent
More informationCharacterizing Files in the Modern Gnutella Network
Characterizing Files in the Modern Gnutella Network Daniel Stutzbach, Shanyu Zhao, Reza Rejaie University of Oregon {agthorr, szhao, reza}@cs.uoregon.edu The Internet has witnessed an explosive increase
More informationBroadcast Updates with Local Look-up Search (BULLS): A New Peer-to-Peer Protocol
Broadcast Updates with Local Look-up Search (BULLS): A New Peer-to-Peer Protocol G. Perera and K. Christensen Department of Computer Science and Engineering University of South Florida Tampa, FL 33620
More informationExploiting Content Localities for Efficient Search in P2P Systems
Exploiting Content Localities for Efficient Search in PP Systems Lei Guo,SongJiang,LiXiao, and Xiaodong Zhang College of William and Mary, Williamsburg, VA 87, USA {lguo,zhang}@cs.wm.edu Los Alamos National
More informationEarly Measurements of a Cluster-based Architecture for P2P Systems
Early Measurements of a Cluster-based Architecture for P2P Systems Balachander Krishnamurthy, Jia Wang, Yinglian Xie I. INTRODUCTION Peer-to-peer applications such as Napster [4], Freenet [1], and Gnutella
More informationPeer-to-Peer Networks
Peer-to-Peer Networks 14-740: Fundamentals of Computer Networks Bill Nace Material from Computer Networking: A Top Down Approach, 6 th edition. J.F. Kurose and K.W. Ross Administrivia Quiz #1 is next week
More informationTransparent Query Caching in Peer-to-Peer Overlay Networks
Transparent Query Caching in Peer-to-Peer Overlay Networks Sunil Patro and Y. Charlie Hu School of Electrical and Computer Engineering Purdue University West Lafayette, IN 47907 {patro, ychu}@purdue.edu
More informationMethodology for Estimating Network Distances of Gnutella Neighbors
Methodology for Estimating Network Distances of Gnutella Neighbors Vinay Aggarwal 1, Stefan Bender 2, Anja Feldmann 1, Arne Wichmann 1 1 Technische Universität München, Germany {vinay,anja,aw}@net.in.tum.de
More informationCharacterizing files in the modern Gnutella network
Multimedia Systems DOI 1.17/s53-7-79-8 REGULAR PAPER Characterizing files in the modern Gnutella network Daniel Stutzbach Shanyu Zhao Reza Rejaie Springer-Verlag 27 Abstract The Internet has witnessed
More informationCS 425 / ECE 428 Distributed Systems Fall 2015
CS 425 / ECE 428 Distributed Systems Fall 2015 Indranil Gupta (Indy) Measurement Studies Lecture 23 Nov 10, 2015 Reading: See links on website All Slides IG 1 Motivation We design algorithms, implement
More informationLecture 21 P2P. Napster. Centralized Index. Napster. Gnutella. Peer-to-Peer Model March 16, Overview:
PP Lecture 1 Peer-to-Peer Model March 16, 005 Overview: centralized database: Napster query flooding: Gnutella intelligent query flooding: KaZaA swarming: BitTorrent unstructured overlay routing: Freenet
More informationPeer-to-Peer Applications Reading: 9.4
Peer-to-Peer Applications Reading: 9.4 Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer Rexford at Princeton University. When slides are obtained from other sources,
More informationOverlay and P2P Networks. Unstructured networks. PhD. Samu Varjonen
Overlay and P2P Networks Unstructured networks PhD. Samu Varjonen 25.1.2016 Contents Unstructured networks Last week Napster Skype This week: Gnutella BitTorrent P2P Index It is crucial to be able to find
More informationOverlay and P2P Networks. Unstructured networks. Prof. Sasu Tarkoma
Overlay and P2P Networks Unstructured networks Prof. Sasu Tarkoma 20.1.2014 Contents P2P index revisited Unstructured networks Gnutella Bloom filters BitTorrent Freenet Summary of unstructured networks
More informationTelematics Chapter 9: Peer-to-Peer Networks
Telematics Chapter 9: Peer-to-Peer Networks Beispielbild User watching video clip Server with video clips Application Layer Presentation Layer Application Layer Presentation Layer Session Layer Session
More informationOn Veracious Search In Unsystematic Networks
On Veracious Search In Unsystematic Networks K.Thushara #1, P.Venkata Narayana#2 #1 Student Of M.Tech(S.E) And Department Of Computer Science And Engineering, # 2 Department Of Computer Science And Engineering,
More informationExploiting Semantic Clustering in the edonkey P2P Network
Exploiting Semantic Clustering in the edonkey P2P Network S. Handurukande, A.-M. Kermarrec, F. Le Fessant & L. Massoulié Distributed Programming Laboratory, EPFL, Switzerland INRIA, Rennes, France INRIA-Futurs
More informationOverlay and P2P Networks. Unstructured networks. Prof. Sasu Tarkoma
Overlay and P2P Networks Unstructured networks Prof. Sasu Tarkoma 19.1.2015 Contents Unstructured networks Last week Napster Skype This week: Gnutella BitTorrent P2P Index It is crucial to be able to find
More informationP2P Applications. Reti di Elaboratori Corso di Laurea in Informatica Università degli Studi di Roma La Sapienza Canale A-L Prof.ssa Chiara Petrioli
P2P Applications Reti di Elaboratori Corso di Laurea in Informatica Università degli Studi di Roma La Sapienza Canale A-L Prof.ssa Chiara Petrioli Server-based Network Peer-to-peer networks A type of network
More informationImproved dynamic multimedia resource adaptation-based Peer-to-Peer system through locality-based clustering and service
University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering and Information Sciences 2005 Improved dynamic multimedia resource adaptation-based Peer-to-Peer
More informationPeer-to-Peer Signalling. Agenda
Peer-to-Peer Signalling Marcin Matuszewski marcin@netlab.hut.fi S-38.115 Signalling Protocols Introduction P2P architectures Skype Mobile P2P Summary Agenda 1 Introduction Peer-to-Peer (P2P) is a communications
More informationA Server-mediated Peer-to-peer System
A Server-mediated Peer-to-peer System Kwok, S. H. California State University, Long Beach Chan, K. Y. and Cheung, Y. M. Hong Kong University of Science and Technology A peer-to-peer (P2P) system is a popular
More informationCMSC 332 Computer Networks P2P and Sockets
CMSC 332 Computer Networks P2P and Sockets Professor Szajda Announcements Programming Assignment 1 is due Thursday Where are we? What sorts of problems are we having? 2 Recap SMTP is the language that
More informationChapter 2: Application layer
Chapter 2: Application layer 2. Principles of network applications app architectures app requirements 2.2 Web and HTTP 2.4 Electronic Mail SMTP, POP3, IMAP 2.5 DNS 2.6 P2P applications 2.7 Socket programming
More informationA Method of Identifying the P2P File Sharing
IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.11, November 2010 111 A Method of Identifying the P2P File Sharing Jian-Bo Chen Department of Information & Telecommunications
More informationPeer-to-Peer Systems. Chapter General Characteristics
Chapter 2 Peer-to-Peer Systems Abstract In this chapter, a basic overview is given of P2P systems, architectures, and search strategies in P2P systems. More specific concepts that are outlined include
More informationFlooded Queries (Gnutella) Centralized Lookup (Napster) Routed Queries (Freenet, Chord, etc.) Overview N 2 N 1 N 3 N 4 N 8 N 9 N N 7 N 6 N 9
Peer-to-Peer Networks -: Computer Networking L-: PP Typically each member stores/provides access to content Has quickly grown in popularity Bulk of traffic from/to CMU is Kazaa! Basically a replication
More informationNetwork Traffic Characteristics of Data Centers in the Wild. Proceedings of the 10th annual conference on Internet measurement, ACM
Network Traffic Characteristics of Data Centers in the Wild Proceedings of the 10th annual conference on Internet measurement, ACM Outline Introduction Traffic Data Collection Applications in Data Centers
More informationPeer-to-Peer Architectures and Signaling. Agenda
Peer-to-Peer Architectures and Signaling Juuso Lehtinen Juuso@netlab.hut.fi Slides based on presentation by Marcin Matuszewski in 2005 Introduction P2P architectures Skype Mobile P2P Summary Agenda 1 Introduction
More informationP2P Traffic Simulation
P2P Traffic Simulation 4. Würzburger Workshop "IP Netzmanagement, IP und Optimierung" Würzburg, Germany 27-28 July, 2004 Sireen Malik [1], Prof. Dr. Ulrich Killat 1 Internet Traffic Other UDP 3.68% Other
More informationModeling and Caching of Peer-to-Peer Traffic
1 Modeling and Caching of Peer-to-Peer Traffic Osama Saleh and Mohamed Hefeeda School of Computing Science Simon Fraser University Surrey, Canada {osaleh, mhefeeda}@cs.sfu.ca Technical Report: TR 26-11
More informationEARM: An Efficient and Adaptive File Replication with Consistency Maintenance in P2P Systems.
: An Efficient and Adaptive File Replication with Consistency Maintenance in P2P Systems. 1 K.V.K.Chaitanya, 2 Smt. S.Vasundra, M,Tech., (Ph.D), 1 M.Tech (Computer Science), 2 Associate Professor, Department
More informationAssignment 5. Georgia Koloniari
Assignment 5 Georgia Koloniari 2. "Peer-to-Peer Computing" 1. What is the definition of a p2p system given by the authors in sec 1? Compare it with at least one of the definitions surveyed in the last
More informationAn Effective P2P Search Scheme to Exploit File Sharing Heterogeneity. Chen Wang, Student Member, IEEE, and Li Xiao, Member, IEEE
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 18, NO. 2, FEBRUARY 2007 145 An Effective P2P Search Scheme to Exploit File Sharing Heterogeneity Chen Wang, Student Member, IEEE, and Li Xiao,
More informationEvaluating Unstructured Peer-to-Peer Lookup Overlays
Evaluating Unstructured Peer-to-Peer Lookup Overlays Idit Keidar EE Department, Technion Roie Melamed CS Department, Technion ABSTRACT Unstructured peer-to-peer lookup systems incur small constant overhead
More informationLast Lecture SMTP. SUNY at Buffalo; CSE 489/589 Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 1
Last Lecture SMTP SUNY at Buffalo; CSE 489/589 Modern Networking Concepts; Fall 2010; Instructor: Hung Q. Ngo 1 This Lecture Peer-to-Peer (P2P) Applications SUNY at Buffalo; CSE 489/589 Modern Networking
More informationDebunking some myths about structured and unstructured overlays
Debunking some myths about structured and unstructured overlays Miguel Castro Manuel Costa Antony Rowstron Microsoft Research, 7 J J Thomson Avenue, Cambridge, UK Abstract We present a comparison of structured
More informationCS 640 Introduction to Computer Networks. Today s lecture. What is P2P? Lecture30. Peer to peer applications
Introduction to Computer Networks Lecture30 Today s lecture Peer to peer applications Napster Gnutella KaZaA Chord What is P2P? Significant autonomy from central servers Exploits resources at the edges
More informationMaking Gnutella-like P2P Systems Scalable
Making Gnutella-like P2P Systems Scalable Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, S. Shenker Presented by: Herman Li Mar 2, 2005 Outline What are peer-to-peer (P2P) systems? Early P2P systems
More informationMarch 10, Distributed Hash-based Lookup. for Peer-to-Peer Systems. Sandeep Shelke Shrirang Shirodkar MTech I CSE
for for March 10, 2006 Agenda for Peer-to-Peer Sytems Initial approaches to Their Limitations CAN - Applications of CAN Design Details Benefits for Distributed and a decentralized architecture No centralized
More informationFile Sharing in Less structured P2P Systems
File Sharing in Less structured P2P Systems. Bhosale S.P. 1, Sarkar A.R. 2 Computer Science And Engg. Dept., SVERI s College of Engineering Pandharpur Solapur, India1 Asst.Prof, Computer Science And Engg.
More informationModeling and Caching of P2P Traffic
School of Computing Science Simon Fraser University, Canada Modeling and Caching of P2P Traffic Mohamed Hefeeda Osama Saleh ICNP 06 15 November 2006 1 Motivations P2P traffic is a major fraction of Internet
More informationPeer-to-peer networks: pioneers, self-organisation, small-world-phenomenons
Peer-to-peer networks: pioneers, self-organisation, small-world-phenomenons Patrick Baier October 10, 2008 Contents 1 Introduction 1 1.1 Preamble.................................... 1 1.2 Definition....................................
More informationFrequency Distributions
Displaying Data Frequency Distributions After collecting data, the first task for a researcher is to organize and summarize the data so that it is possible to get a general overview of the results. Remember,
More informationAOTO: Adaptive Overlay Topology Optimization in Unstructured P2P Systems
AOTO: Adaptive Overlay Topology Optimization in Unstructured P2P Systems Yunhao Liu, Zhenyun Zhuang, Li Xiao Department of Computer Science and Engineering Michigan State University East Lansing, MI 48824
More informationOn the Long-term Evolution of the Two-Tier Gnutella Overlay
On the Long-term Evolution of the Two-Tier Gnutella Overlay Amir H. Rasti, Daniel Stutzbach, Reza Rejaie Computer and Information Science Department University of Oregon {amir, agthorr, reza}@cs.uoregon.edu
More informationSELF-ORGANIZING TRUST MODEL FOR PEER TO PEER SYSTEMS
SELF-ORGANIZING TRUST MODEL FOR PEER TO PEER SYSTEMS R. K. Prasad and Vipin Sharma 1 Department of Mechanical Engineering ABSTRACT: P A College of Engineering Nadupadavu, Mangalore, India In this implemented
More informationMeasurement-Based Optimization Techniques for Bandwidth-Demanding Peer-to-Peer Systems
Measurement-Based Optimization Techniques for Bandwidth-Demanding Peer-to-Peer Systems T. S. Eugene Ng, Yang-hua Chu, Sanjay G. Rao, Kunwadee Sripanidkulchai, Hui Zhang Carnegie Mellon University, Pittsburgh,
More informationA connection management protocol for promoting cooperation in Peer-to-Peer networks q
Available online at www.sciencedirect.com Computer Communications 31 (2008) 240 256 www.elsevier.com/locate/comcom A connection management protocol for promoting cooperation in Peer-to-Peer networks q
More informationAn Empirical Study of Behavioral Characteristics of Spammers: Findings and Implications
An Empirical Study of Behavioral Characteristics of Spammers: Findings and Implications Zhenhai Duan, Kartik Gopalan, Xin Yuan Abstract In this paper we present a detailed study of the behavioral characteristics
More informationOverview Computer Networking Lecture 16: Delivering Content: Peer to Peer and CDNs Peter Steenkiste
Overview 5-44 5-44 Computer Networking 5-64 Lecture 6: Delivering Content: Peer to Peer and CDNs Peter Steenkiste Web Consistent hashing Peer-to-peer Motivation Architectures Discussion CDN Video Fall
More informationA Hybrid Approach to CAM-Based Longest Prefix Matching for IP Route Lookup
A Hybrid Approach to CAM-Based Longest Prefix Matching for IP Route Lookup Yan Sun and Min Sik Kim School of Electrical Engineering and Computer Science Washington State University Pullman, Washington
More informationParallel Crawlers. 1 Introduction. Junghoo Cho, Hector Garcia-Molina Stanford University {cho,
Parallel Crawlers Junghoo Cho, Hector Garcia-Molina Stanford University {cho, hector}@cs.stanford.edu Abstract In this paper we study how we can design an effective parallel crawler. As the size of the
More informationConsidering Priority in Overlay Multicast Protocols under Heterogeneous Environments
Considering Priority in Overlay Multicast Protocols under Heterogeneous Environments Michael Bishop and Sanjay Rao Purdue University Kunwadee Sripanidkulchai National Electronics and Computer Technology
More informationDynamic Service Aggregation for Efficient Use of Resources in Interactive Video Delivery 1
Dynamic Service Aggregation for Efficient Use of Resources in Interactive Video Delivery 1 D. Venkatesh and T.D.C. Little Multimedia Communications Laboratory Department of Electrical, Computer and Systems
More informationMonitoring and Classification of Teletraffic in P2P Environment
Monitoring and Classification of Teletraffic in P2P Environment Raffaele Bolla, Riccardo Rapuzzi, Michele Sciuto DIST - Department of Communication, Computer and System Sciences University of Genoa Via
More informationAn Efficient Web Cache Replacement Policy
In the Proc. of the 9th Intl. Symp. on High Performance Computing (HiPC-3), Hyderabad, India, Dec. 23. An Efficient Web Cache Replacement Policy A. Radhika Sarma and R. Govindarajan Supercomputer Education
More informationMultimedia Streaming. Mike Zink
Multimedia Streaming Mike Zink Technical Challenges Servers (and proxy caches) storage continuous media streams, e.g.: 4000 movies * 90 minutes * 10 Mbps (DVD) = 27.0 TB 15 Mbps = 40.5 TB 36 Mbps (BluRay)=
More informationDiagnosing Network-wide P2P Live Streaming Inefficiencies
Diagnosing Network-wide P2P Live Streaming Inefficiencies Chuan Wu Baochun Li Shuqiao Zhao Department of Computer Science Dept. of Electrical and Computer Engineering Multimedia Development Group The University
More informationPerformance Enhancement of AOMDV with Energy Efficient Routing Based On Random Way Point Mobility Model
Performance Enhancement of AOMDV with Energy Efficient Routing Based On Random Way Point Mobility Model Geetha.S, Dr.G.Geetharamani Asst.Prof, Department of MCA, BIT Campus Tiruchirappalli, Anna University,
More informationThe impact of fiber access to ISP backbones in.jp. Kenjiro Cho (IIJ / WIDE)
The impact of fiber access to ISP backbones in.jp Kenjiro Cho (IIJ / WIDE) residential broadband subscribers in Japan 2 million broadband subscribers as of September 25-4 million for DSL, 3 million for
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 informationPerformance Analysis of MANET Routing Protocols OLSR and AODV
VOL. 2, NO. 3, SEPTEMBER 211 Performance Analysis of MANET Routing Protocols OLSR and AODV Jiri Hosek Faculty of Electrical Engineering and Communication, Brno University of Technology Email: hosek@feec.vutbr.cz
More informationAN ASSOCIATIVE TERNARY CACHE FOR IP ROUTING. 1. Introduction. 2. Associative Cache Scheme
AN ASSOCIATIVE TERNARY CACHE FOR IP ROUTING James J. Rooney 1 José G. Delgado-Frias 2 Douglas H. Summerville 1 1 Dept. of Electrical and Computer Engineering. 2 School of Electrical Engr. and Computer
More informationIntroduction to P P Networks
Introduction to P P Networks B Sc Florian Adamsky florianadamsky@iemthmde http://florianadamskyit/ cbd Internet Protocols and Applications SS B Sc Florian Adamsky IPA / Outline Introduction What is P P?
More informationCollaborative Multi-Source Scheme for Multimedia Content Distribution
Collaborative Multi-Source Scheme for Multimedia Content Distribution Universidad Autónoma Metropolitana-Cuajimalpa, Departament of Information Technology, Mexico City, Mexico flopez@correo.cua.uam.mx
More informationEngr. Joseph Ronald Canedo's Note 1
Engr. Joseph Ronald Canedo's Note 1 IP Addressing & Subnetting Made Easy Working with IP Addresses Joseph Ronald Cañedo Introduction You can probably work with decimal numbers much easier than with the
More informationEvaluation of Seed Selection Strategies for Vehicle to Vehicle Epidemic Information Dissemination
Evaluation of Seed Selection Strategies for Vehicle to Vehicle Epidemic Information Dissemination Richard Kershaw and Bhaskar Krishnamachari Ming Hsieh Department of Electrical Engineering, Viterbi School
More informationpacket-switched networks. For example, multimedia applications which process
Chapter 1 Introduction There are applications which require distributed clock synchronization over packet-switched networks. For example, multimedia applications which process time-sensitive information
More informationWhy You Should Consider a Hardware Based Protocol Analyzer?
Why You Should Consider a Hardware Based Protocol Analyzer? Software-only protocol analyzers are limited to accessing network traffic through the utilization of mirroring. While this is the most convenient
More informationPerformance Consequences of Partial RED Deployment
Performance Consequences of Partial RED Deployment Brian Bowers and Nathan C. Burnett CS740 - Advanced Networks University of Wisconsin - Madison ABSTRACT The Internet is slowly adopting routers utilizing
More informationCreating an Adaptive Network of Hubs Using Schelling s Model
Creating an Adaptive Network of Hubs Using Schelling s Model Atul Singh and Mads Haahr Distributed Systems Group, Department of Computer Science, Trinity College, Dublin, Ireland Email: Atul.Singh@cs.tcd.ie,
More informationLightFlood: Minimizing Redundant Messages and Maximizing the Scope of Peer-to-Peer Search
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 19, NO. 5, MAY 2008 1 LightFlood: Minimizing Redundant Messages and Maximizing the Scope of Peer-to-Peer Search Song Jiang, Member, IEEE, Lei
More informationCache Replacement Policies For P2P File Sharing Protocols
Cache Replacement Policies For P2P File Sharing Protocols Adam Wierzbicki, PhD * Polish-Japanese Institute of Information Technology adamw@icm.edu.pl * ul. Orzycka 8 m. 37 02-695 Warsaw, Poland Nathaniel
More informationHT-Paxos: High Throughput State-Machine Replication Protocol for Large Clustered Data Centers
1 HT-Paxos: High Throughput State-Machine Replication Protocol for Large Clustered Data Centers Vinit Kumar 1 and Ajay Agarwal 2 1 Associate Professor with the Krishna Engineering College, Ghaziabad, India.
More informationShould we build Gnutella on a structured overlay? We believe
Should we build on a structured overlay? Miguel Castro, Manuel Costa and Antony Rowstron Microsoft Research, Cambridge, CB3 FB, UK Abstract There has been much interest in both unstructured and structured
More informationTHIS IS AN OPEN BOOK, OPEN NOTES QUIZ.
Department of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.033 Computer Systems Engineering: Spring 2002 Handout 31 - Quiz 2 All problems on this quiz are multiple-choice
More informationExperimental Study of Skype. Skype Peer-to-Peer VoIP System
An Experimental Study of the Skype Peer-to-Peer VoIP System Saikat Guha (Cornell) Neil Daswani (Google) Ravi Jain (Google) IPTPS 2006 About Skype Voice over IP (VoIP) 50 million users Valued at $2.6 billion
More informationAdvanced Peer to Peer Discovery and Interaction Framework
Advanced Peer to Peer Discovery and Interaction Framework Peeyush Tugnawat J.D. Edwards and Company One, Technology Way, Denver, CO 80237 peeyush_tugnawat@jdedwards.com Mohamed E. Fayad Computer Engineering
More informationThe Performance of MANET Routing Protocols for Scalable Video Communication
Communications and Network, 23, 5, 9-25 http://dx.doi.org/.4236/cn.23.522 Published Online May 23 (http://www.scirp.org/journal/cn) The Performance of MANET Routing Protocols for Scalable Video Communication
More informationPeer-to-Peer Systems. Winter semester 2014 Jun.-Prof. Dr.-Ing. Kalman Graffi Heinrich Heine University Düsseldorf
Peer-to-Peer Systems Winter semester 2014 Jun.-Prof. Dr.-Ing. Kalman Graffi Heinrich Heine University Düsseldorf Peer-to-Peer Systems - Chapter 2 Unstructured P2P Overlays Main Search Principles Centralized
More information726 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 17, NO. 3, JUNE 2009
726 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 17, NO. 3, JUNE 2009 Residual-Based Estimation of Peer and Link Lifetimes in P2P Networks Xiaoming Wang, Student Member, IEEE, Zhongmei Yao, Student Member,
More informationACONTENT discovery system (CDS) is a distributed
54 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO. 1, JANUARY 2004 Design and Evaluation of a Distributed Scalable Content Discovery System Jun Gao and Peter Steenkiste, Senior Member, IEEE
More informationOn characterizing BGP routing table growth
University of Massachusetts Amherst From the SelectedWorks of Lixin Gao 00 On characterizing BGP routing table growth T Bu LX Gao D Towsley Available at: https://works.bepress.com/lixin_gao/66/ On Characterizing
More informationNetwork protocols and. network systems INTRODUCTION CHAPTER
CHAPTER Network protocols and 2 network systems INTRODUCTION The technical area of telecommunications and networking is a mature area of engineering that has experienced significant contributions for more
More informationFault Localization for Firewall Policies
Fault Localization for Firewall Policies JeeHyun Hwang 1 Tao Xie 1 Fei Chen Alex X. Liu 1 Department of Computer Science, North Carolina State University, Raleigh, NC 7695-86 Department of Computer Science
More informationAnt-inspired Query Routing Performance in Dynamic Peer-to-Peer Networks
Ant-inspired Query Routing Performance in Dynamic Peer-to-Peer Networks Mojca Ciglari and Tone Vidmar University of Ljubljana, Faculty of Computer and Information Science, Tržaška 25, Ljubljana 1000, Slovenia
More informationAn Cross Layer Collaborating Cache Scheme to Improve Performance of HTTP Clients in MANETs
An Cross Layer Collaborating Cache Scheme to Improve Performance of HTTP Clients in MANETs Jin Liu 1, Hongmin Ren 1, Jun Wang 2, Jin Wang 2 1 College of Information Engineering, Shanghai Maritime University,
More informationPoonam kori et al. / International Journal on Computer Science and Engineering (IJCSE)
An Effect of Route Caching Scheme in DSR for Vehicular Adhoc Networks Poonam kori, Dr. Sanjeev Sharma School Of Information Technology, RGPV BHOPAL, INDIA E-mail: Poonam.kori@gmail.com Abstract - Routing
More informationA Hybrid Structured-Unstructured P2P Search Infrastructure
A Hybrid Structured-Unstructured P2P Search Infrastructure Abstract Popular P2P file-sharing systems like Gnutella and Kazaa use unstructured network designs. These networks typically adopt flooding-based
More informationManaging Peer-to-Peer Applications
Managing Peer-to-Peer Applications Vana Kalogeraki Hewlett-Packard Laboratories Palo Alto, CA 94304 vana@hpl.hp.com 1 What is a P2P System? ³6KDULQJRIFRPSXWHUUHVRXUFHVDQGVHUYLFHV WKURXJKGLUHFWH[FKDQJH
More informationAdvanced Computer Networks
Advanced Computer Networks P2P Systems Jianping Pan Summer 2007 5/30/07 csc485b/586b/seng480b 1 C/S vs P2P Client-server server is well-known server may become a bottleneck Peer-to-peer everyone is a (potential)
More information