Julian Monteiro's Top Recommendations

Abstract

We describe a peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment. Our system routes queries and locates nodes using a novel XOR-based metric topology that simplifies the algorithm and facilitates our proof. The topology has the property that every message exchanged conveys or reinforces useful contact information. The system exploits this information to send parallel, asynchronous query messages that tolerate node failures without imposing ... ...

Abstract

We have developed a system that allows users to add annotations immediately onto a Web page they are viewing, and share the information via a network. A novel feature of our method is that P2P nodes in the system determine their roles autonomously, and share the annotation data. Our method is based on P2P; however, P2P nodes in the system change their roles and data transfer procedures, depending on their network topology or the status of other nodes.Our method is robust ...

Abstract

TCP is the transport protocol used predominantly in the Internet as well as in peer-to-peer networks. However, peer-to-peer networks exhibit very different characteristics from those of conventional client-server networks. In this paper, we argue that the unique characteristics of peer-to-peer networks render TCP inappropriate for effective data transport in such networks. Specifically, we motivate transport layer support for multipoint-to-point connections to address the problem of sources in peer-to-peer networks lacking server-like properties in terms of capacity and availability. We outline several ...

Abstract

Both mobile ad hoc networks (MANETs) and peer-to-peer (P2P) networks are decentralized and self-organizing networks with dynamic topology and are responsible for routing queries in a distributed environment. Because MANETs are composed of resource-constrained devices susceptible to faults, whereas P2P networks are fault-tolerant, P2P networks are the ideal data sharing system for MANETs. We have conducted an evaluation of two approaches for P2P content discovery running over a MANET. The first, based on unstructured P2P networks, relies on controlled flooding, while ...

Abstract

Peer-to-peer systems have emerged as a popular way to share huge volumes of data. The usability of these systems depends on effective techniques to find and retrieve data; however current techniques used in existing P2P systems are often very inefficient. We present three techniques for efficient search in P2P systems. We present the design of these techniques, and then evaluate them using a combination of analysis and experiments over Gnutella, the largest open P2P system in operation. We show that while ...

Abstract

In this paper, we describe an ongoing effort to define common APIs for structured peer-to-peer overlays and the key abstractions that can be built on them. In doing so, we hope to facilitate independent innovation in overlay protocols, services, and applications, to allow direct experimental comparisons, and to encourage application development by third parties. We provide a snapshot of our efforts and discuss open problems in an effort to solicit feedback from the research community. ...

Abstract

This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing scheme for wide-area peer-to-peer applications. Pastry provides application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet. It can be used to support a wide range of peer-to-peer applications like global data storage, global data sharing, and naming. An insert operation in Pastry stores an object at a user-defined number... ...

Abstract

This paper emphasizes that instead of long-term availability and reliability, the short-term session durability analysis will greatly impact the design of the real large-scale Peer-to-Peer storage system. In this paper, we use a Markov chain to model the session durability, and then derive the session durability probability distribution. Subsequently, we show the difference between our analysis and the traditionalMean Time to Failure (MTTF) analysis, from which we conclude that the misuse of MTTF analysis will greatly mislead our understanding of the ...

Abstract

Structured peer-to-peer overlay networks provide a substrate for the construction of large-scale, decentralized applications, including distributed storage, group communication, and content distribution. These overlays are highly resilient; they can route messages correctly even when a large fraction of the nodes crash or the network partitions. But current overlays are not secure; even a small fraction of malicious nodes can prevent correct message delivery throughout the overlay. This ... ...

Abstract

Empirical studies have shown that participating nodes in peer-to-peer (P2P) systems are not equivalent. Some nodes, known as 'super peers', are more powerful and stable than the others. Such heterogeneity has been taken account into the design of P2P systems in two ways: by employing super peers to serve as index servers for query, and by routing through super peers to speed up query. In this paper, we use super peers to reduce maintenance cost in Chord. ...

Abstract

Peer-to-peer technologies are increasingly becoming the medium of choice for deliveringmedia content, both professional and home-grown, to large user populations. Indeed, current P2P swarming systems have been shown to be very efficient for large-scale content distribution with few server resources.However, such systems have been designed for generic file distribution and provide a limited user experience for viewing media content.For example, users need to wait to download the full video before they can start watching it.In general, the main challenge ...

Abstract

The Web relies on the Domain Name System (DNS) to resolve the hostname portion of URLs into IP addresses. This marriage-of-convenience enabled the Web's meteoric rise, but the resulting entanglement is now hindering both infrastructures—the Web is overly constrained by the limitations of DNS, and DNS is unduly burdened by the demands of the Web. There has been much commentary on this sad state-of-affairs, but dissolving the illfated union between DNS and the Web requires a new way to resolve Web ...

Abstract

The efficient distribution of stored information has become a major concern in the Internet which has increasingly become a vehicle for the transport of stored video. Because of the highly heterogeneous access to the Internet, researchers and engineers have argued for layered encoded video. We investigate delivering layered encoded video using caches. Based on the stochastic knapsack theory, we develop a model for the layered video caching problem. We propose heuristics to determine which videos and which layers in the videos ...

Abstract

We present a study of anonymized data capturing a month of high-level communication activities within the whole of the Microsoft Messenger instant-messaging system. We examine characteristics and patterns that emerge from the collective dynamics of large numbers of people, rather than the actions and characteristics of individuals. The dataset contains summary properties of 30 billion conversations among 240 million people. From the data, we construct a communication graph with 180 million nodes and 1.3 billion undirected edges, creating the largest social network constructed and analyzed to date. We report ...

Abstract

In the span of only a few years, the Internet has experienced an astronomical increase in the use of specialized content delivery systems, such as content delivery networks and peer-to-peer file sharing systems. Therefore, an understanding of content delivery on the Internet now requires a detailed understanding of how these systems are used in practice. ...

Abstract

A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host nodes. For example, the performance of large overlay networks could be improved if the application-level connectivity between the nodes in these networks is congruent with the underlying IP-level topology. Similarly, in the case of replicated Web content, client nodes could use topological information in selecting one of multiple available servers. For such applications, one need not find the ...

Abstract

IP-based TV services bring opportunities for interactivity and personalization. They also bring challenges in delivery quality and interoperability. Open standards are essential to ensure market success but also to enable innovation of future services and applications. We give an overview of the current status of IPTV standardization, especially how specifications complement each other to achieve a complete system. Some key challenges and opportunities are described, including how to enable 3rd party innovation on top of IPTV platforms. ...

Abstract

As current Voice-over-IP (VoIP) systems encourage a direct communication between the callees they are similar in design to peer-to-peer (P2P) approaches. Therefore, we introduce a framework to build distributed supplementary services for VoIP. Some of these services like completion of calls on no reply or holding are already commonly established in public switched telephone networks or realized in centralized VoIP servers like Asterisk [1]. In order to foster the completely decentralization of these features we suggest corresponding services implemented on top ...

Abstract

Service location is a crucial part of dynamic systems that are using other services in order to accomplish their work. Beside service oriented architectures (SOA), multimedia networks need to dynamically access services on demand. Usually, service-location protocols support users at finding services. Therefore, in dynamic environments, the implementation of one of these protocols and an appropriate infrastructure is needed. We propose the integration of service location with the session initiation protocol (SlP), which is a common coordination protocol for multimedia services. ...

Abstract

In this paper, we present an approach of integrating SIP (session initiation protocol) in converged multimodal/multimedia communication services. An architecture of multimedia technology integration platform (MTIP) in converged communication environment with SIP is described. This distributed dialogue system infrastructure is based on the concept of dialogue system and web convergence, where applications and communication services can be enabled through task specific markup languages based on XML. The loosely coupled open architecture in our approach is highly extensible. It allows an easy ...

Abstract

This paper presents an architecture called social distributed hash table (SDHT) that combines strengths of distributed hash table (DHT) algorithms and social networks making mobile search fast and context oriented. The paper presents possible implementations of the proposed architecture in the IP multimedia subsystem (IMS) and as a standalone SIP based system. The architecture forms a cost efficient platform for providing innovative mobile services that take advantage of social context of human communication. The architecture can be used to deploy a ...

Abstract

This document presents the architecture of a distributed IP Multimedia Subsystem (IMS). The architecture distributes network functional elements in Distributed Hash Tables (DHT) overlay network. This work focuses on distributing the SIP proxies, such as the Serving-Call/Session Control Function (S-CSCF) and the Interrogating-Call/Session Control Function, as well as the Home Subscriber server (HSS), and up to some degree, presence servers. A combined DHT overlay network is also proposed. Distribution of the network functional elements in a DHT fashion leads to increased ...

Abstract

Highly popular Web sites can suffer classical congestion collapse because of the ability of outgoing 'bursty' data to congest the server side link. Using the well known and recognized network simulator ns we look at the effect that this congestion collapse has on user perceived performance (UPP) of a simulated Web site. We developed a protocol overlay for HTTP/1.1 and a complementary distribution infrastructure to alleviate the effects of this congestion. Our protocol HTTP(P2P) shows promise for increasing the maximum load ...

Abstract

Among the different solutions providing multimedia teleconferencing services over IP networks, two approaches are of major importance: H.323 standardized by the ITU-T and SIP standardized by the IETF. Some comparisons on a system level have been published, but the service architectures have rarely been addressed in the literature. In the near future an important driver for multimedia business will be the services and the mechanisms for their fast and efficient service development and deployment. We provide a comparison of the methods ...

Abstract

We propose a unified framework for a multimedia service, which is based on SIP as signaling protocol, to achieve significant improvements in the productivity of developing a multimedia system, and obtain trustworthiness and interoperability. A middleware platform based on our framework is designed and implemented. ...

Abstract

Session initiation protocol (SIP) is being widely adopted for VoIP, IM and other collaborative applications due to its simple yet rich functional design. However, one of the main drawbacks has been its per-application deployment (each application using its own SIP stack), leading to narrowly focused development of SIP based services. In this paper, we propose a client-side SIP service and supporting network infrastructure blocks that provide unified mechanisms to execute generic SIP functions. The composition of these building blocks allows for ...

Abstract

In Internet telephony, end systems can take a much larger role in providing services than in traditional telephone systems. We analyze the importance of end system services and describe the services and the service logic execution environment (SLEE) implemented in out SIP user agent, SIPC. Since we believe that end system services differ in their requirements from network services, we define a new service creation scripting language call language for end system services (LESS). Compared with other service creation languages, LESS ...

Abstract

Internet telephony is receiving increasing interest as an alternative to traditional telephone networks. This article shows how the IETF's Session Initiation Protocol (SIP) can be used to perform the services of traditional Intelligent Network protocols, as well as additional services. Contents 1 Introduction 3 2 Overview 3 2.1 Billing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...

Abstract

Communication plays a central in our society. It affects our private lives as well as business activities. Humans usually observe the environment and the communication partner with all their senses. The perceived information is evaluated to deduce the context of the targeted communication partner. However, distant interpersonal communication does not provide a priori knowledge of the called party's current situation, condition or mood - the callee's context. Current communication systems do not offer satisfying technical means to support context sharing between ...

Abstract

Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that of simplicity of implementation and deployment. In this paper, we explore a case study of building an application for which ease of deployment dominated the need for high performance. The application we focus on is Place Lab, an end-user positioning system. We evaluate whether it is feasible to use DHTs as an application-independent ...

Abstract

A Resilient Overlay Network (RON) is an architecture that allows distributed Internet applications to detect and recover from path outages and periods of degraded performance within several seconds, improving over today's wide-area routing protocols that take at least several minutes to recover. A RON is an application-layer overlay on top of the existing Internet routing substrate. The RON nodes monitor the functioning and quality of the Internet paths among themselves, and use this... ...

Abstract

A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord , a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data item pair at the node to which the key ...

Abstract

The term "peer-to-peer" (P2P) refers to a class of systems and applications that employ distributed resources to perform a critical function in a decentralized manner. With the pervasive deployment of computers, P2P is increasingly receiving attention in research, product development, and investment circles. This interest ranges from enthusiasm, through hype, to disbelief in its potential. Some of the benefits of a P2P approach include: improving scalability by avoiding dependency on... ...

Abstract

P2P network is factually an overlay network for distributed object store, search and sharing. This paper will present a survey about it's recent. First, we will introduce a simple definition of P2P, and define some common operation procedures in P2P. Second, P2P performance metric will be discussed in order to understand and differentiated the practical P2P architectures and protocols. Third, the current P2P architecture will be classified and compared in detail. Then, object search protocols... ...

Abstract

This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer applications. ...

Abstract

P2P systems inherently have high scalability, robustness and fault tolerance because there is no centralized server and the network self-organizes itself. This is achieved at the cost of higher latency for locating the resources of interest in the P2P overlay network. Internet telephony can be viewed as an application of P2P architecture where the participants form a self-organizing P2P overlay network to locate and communicate with other participants. We propose a pure P2P architecture for the Session Initiation Protocol (SIP)-based IP ...

Abstract

Distributed computer architectures labeled "peer-to-peer" are designed for the sharing of computer resources (content, storage, CPU cycles) by direct exchange, rather than requiring the intermediation or support of a centralized server or authority. Peer-to-peer architectures are characterized by their ability to adapt to failures and accommodate transient populations of nodes while maintaining acceptable connectivity and performance.Content distribution is an important peer-to-peer application on the Internet that has received considerable research attention. Content distribution applications typically allow personal computers to function in ...

Abstract

A significant percentage of Web objects are replicas. For example, a vast majority of image files such as banners, buttons, and logos are duplicated throughout the ...

Abstract

The phenomenal growth of the world-wide web has made it the most popular Internet application today. Web caching and content delivery services have been recognized as valuable techniques to mitigate the explosion of web traffic. An increasing fraction of web traffic today is dynamically generated and therefore uncacheable using present static approaches. Scalable delivery of such active content poses a myriad of challenges, including content replication, update propagation, and consistency... ...

Abstract

Proxy caches are increasingly used around the world to reduce bandwidth requirements and alleviate delays associated with the World-Wide Web. In order to compare proxy cache performances, objective measurements must be made. In this paper, we define a space of proxy evaluation methodologies based on source of workload used and form of algorithm implementation. We then survey recent publications and show their locations within this space. ...

Abstract

Much work in the analysis of proxy cachinghas focused on high-level metrics such as hit rates, and has approximated actual reference patterns by ignoring exceptional cases such as connection aborts. Several of these low-level details have a strong impact on performance, particularly in heterogeneous bandwidth environments such as modem pools connected to faster networks. Trace-driven simulation of the modem pool of a large ISP suggests that "cookies" dramatically affect the cachability of... ...

Abstract

Proxy servers are common solutions to relieve organizational networks from heavy tra#c by storing the most frequently referenced web objects in their local cache. These proxies are commonly known as cooperative proxy systems and are usually organized in such a way as to optimize the utilization of their storage capacity. A self-organized approach to manage a distributed proxy system called Adaptive Distributed Caching (ADC) is proposed. We model each proxy as an autonomous agent that is... ...

Abstract

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references. ...

Abstract

The World Wide Web can be considered as a large distributed information system that provides access to shared data objects. As one of the most popular applications currently running on the Internet, the World Wide Web is of an exponential growth in size, which results in network congestion and server overloading. Web caching has been recognized as one of the effective schemes to alleviate the service bottleneck and reduce the network traffic, thereby minimize the user access latency. In this paper, ...

Abstract

P2P based file sharing systems have become an extremely popular and they are highly scalable, self-configurable and fault tolerant. Some researches exploit them for the Web caching systems to solve the scalability issue. However they treat the Web objects as homogeneous objects and there is no concern about the various Web characteristics. This paper suggests an efficient Web caching system which manages the objects by different policies to exploit the characteristics of Web objects. Basically, we apply the different caching policies ...

Abstract

this paper is Permission to make digital/hard copy of all or part of this material without fee for personal or classroom use provided that the copies are not made or distributed for profit or commercial advantage, the ACM copyright/server notice, the title of the publication, and its date appear, and notice is given that copying is by permission of the ACM, Inc. To copy otherwise, to republish, to post on servers, or to redistribute to lists requires prior specific permission and/or a fee ...

Abstract

As the number of World-Wide Web users grow, so does the number of connections made to servers. This increases both network load and server load. Caching can reduce both loads by migrating copies of server files closer to the clients that use those files. Caching can either be done at a client or in the network (by a proxy server or gateway). We assess the potential of proxy servers to cache documents retrieved with the HTTP protocol. We monitored traffic corresponding ...

Abstract

In this paper, we systematically examine the design space of peer-to-peer Web caching systems in three orthogonal dimensions: the caching algorithm, the document lookup algorithm, and the peer granularity. Based on the observation that the traditional URL-based caching algorithm suffers considerably from the fact of cacheability decrease caused by the fast growing of dynamic and personalized Web content, we propose to use the content-based caching algorithm. In addition to compare two existing document lookup algorithms, we propose a simple and effective ...

Abstract

This paper presents a decentralized, peer-to-peer web cache called Squirrel. The key idea is to enable web browsers on desktop machines to share their local caches, to form an efficient and scalable web cache, without the need for dedicated hardware and the associated administrative cost. We propose and evaluate decentralized web caching algorithms for Squirrel, and discover that it exhibits performance comparable to a centralized web cache in terms of hit ratio, bandwidth usage and latency. It ... ...

Abstract

Proxy hit ratios tend to decrease as the demand and supply of Web contents are becoming more diverse. By case studies, we quantitatively confirm this trend and observe significant document duplications among a proxy and its client browsers' caches. One reason behind this trend is that the client/server Web caching model does not support direct resource sharing among clients, causing the Web contents and the network bandwidths among clients to be relatively underutilized. To address these limits and improve Web caching ...

Abstract

This paper presents and evaluates Toast, a scalable Video-on-Demand (VoD)streaming system that combines the popular BitTorrent peer-to-peer (P2P)file-transfer technology with a simple dedicated streaming server to decrease server load and increase client transfer speed. Toast includes a modified version of BitTorrent that supports streaming data delivery and that communicates with a VoD server when the desired data cannot be delivered in real-time by other peers. ...

Abstract

Video-on-Demand (VoD) is a compelling application, but costly due to the load it places on servers. Peer-to-peer (P2P) techniques hold the potential to reduce centralized costs by sharing data between peers. There are many difficult design issues associated with P2P for VoD. Viewing the problem as designing a large distributed cache, many of the issues can be expressed in terms of caching algorithms. ...

Abstract

Despite strong interest in P2P video-on-demand (VoD) services, existing studies are mostly based on simulation and focus on areas such as overlay topology. Little is known about the effectiveness of P2P in VoD systems and the end user experience. In this paper we present a comprehensive study of these issues using the two-month logs from a deployed experimental P2P VoD system over CERNET 1. Our key findings are: (1) the key factor is the popularity of channels and a moderate number ...

Abstract

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references. ...

Abstract

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references. ...

Abstract

The scalability of large-scale networked virtual environments (NVEs) such as today's massively multiplayer online games (MMOGs) faces inherent limits imposed by client-server architectures. We identify an emerging research direction that applies peer-to-peer (P2P) networks in order to realize more scalable and affordable NVEs. The central issue for P2P-based NVE (P2P-NVE) systems is to correctly and efficiently maintain the topology of all participating peers by solving the neighbor discovery problem. We also propose the Voronoi-based overlay network (VON), a simple and efficient ...

Abstract

The advent of media-sharing sites like Flickr has drastically increased the volume of community-contributed multimedia resources on the web. However, due to their magnitudes, these collections are increasingly difficult to understand, search and navigate. To tackle these issues, a novel search system, ContextSeer, is developed to improve search quality (by reranking) and recommend supplementary information (i.e., search-related tags and canonical images) by leveraging the rich context cues, including the visual content, high-level concept scores, time and location metadata. First, we propose ...

Abstract

We propose a fully-distributed peer-to-peer architecture to solve the scalability problem of Networked Virtual Environment in a simple and efficient manner. Our method exploits locality of user interest inherent to such systems and is based on the mathematical construct Voronoi diagram . Scalable, responsive, fault-tolerant NVE can thus be constructed and deployed in an affordable way. ...

Abstract

We use knowledge discovery techniques to guide the creation of efficient overlay networks for peer-to-peer file sharing. An overlay network specifies the logical connections among peers in a network and is distinct from the physical connections of the network. It determines the order in which peers will be queried when a user is searching for a specific file. To better understand the role of the network overlay structure in the performance of peer-to-peer file sharing protocols, we compare several methods for ...

Abstract

CUBIC is a congestion control protocol for TCP (transmission control protocol) and the current default TCP algorithm in Linux. The protocol modifies the linear window growth function of existing TCP standards to be a cubic function in order to improve the scalability of TCP over fast and long distance networks. It also achieves more equitable bandwidth allocations among flows with different RTTs (round trip times) by making the window growth to be independent of RTT -- thus those flows grow their ...

Abstract

P2P file downloading and streaming have already become very popular Internet applications. These systems dramatically reduce the server loading, and provide a platform for scalable content distribution, as long as there is interest for the content. P2P-based video-on-demand (P2P-VoD) is a new challenge for the P2P technology. Unlike streaming live content, P2P-VoD has less synchrony in the users sharing video content, therefore it is much more difficult to alleviate the server loading and at the same time maintaining the streaming performance. ...

Abstract

The ability to estimate network latencies between arbitrary Internet end hosts would enable new measurement studies and applications, such as investigating routing path inefficiencies on a wide-scale or constructing topologically sensitive overlay networks. In this paper we present King, a tool that accurately and quickly estimates the latency between arbitrary end hosts by using recursive DNS queries in a novel way. Compared to previous approaches, King has several advantages. Unlike IDMaps, King does not require the deployment of additional infrastructure, and ...

Abstract

Content-based full-text search is a challenging problem in Peer-to-Peer (P2P) systems. Traditional approaches have either been centralized or use flooding to ensure accuracy of the results returned.In this paper, we present pSearch, a decentralized non-flooding P2P information retrieval system. pSearch distributes document indices through the P2P network based on document semantics generated by Latent Semantic Indexing (LSI). The search cost (in terms of different nodes searched and data transmitted) for a given query is thereby reduced, since the indices of semantically ...

Abstract

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references. ...

Abstract

The path taken by a packet traveling across the Internet depends on a large number of factors, including routing protocols and per-network routing policies. The impact of these factors on the end-to-end performance experienced by users is poorly understood. In this paper, we conduct a measurement-based study comparing the performance seen using the "default" path taken in the Internet with the potential performance available using some alternate path. Our study uses five distinct datasets containing measurements of "path quality", such as ...

Abstract

This paper presents design and evaluation of an adaptive streaming mechanism from multiple senders to a single receiver in Peer-to-Peer (P2P) networks, called P2P Adaptive Layered Streaming, or PALS. PALS is a receiver-driven mechanism. It enables a receiver peer to orchestrate quality adaptive streaming of a single, layer encoded video stream from multiple congestion controlled senders, and is able to support a spectrum of non-interactive streaming applications. The primary challenge in design of a multi-source streaming mechanism is that available bandwidth from each peer is not known a priori, ...

Abstract

We describe latent Dirichlet allocation (LDA), a generative probabilistic model for collections of discrete data such as text corpora. LDA is a three-level hierarchical Bayesian model, in which each item of a collection is modeled as a finite mixture over an underlying set of topics. Each topic is, in turn, modeled as an infinite mixture over an underlying set of topic probabilities. In the context of text modeling, the topic probabilities provide an explicit representation of a document. We ...

Abstract

Simulating how the global Internet behaves is an immensely challenging undertaking because of the network's great heterogeneity and rapid change. The heterogeneity ranges from the individual links that carry the network's traffic, to the protocols that interoperate over the links, the "mix" of different applications used at a site, and the levels of congestion seen on different links. We discuss two key strategies for developing meaningful simulations in the face of these difficulties: searching for invariants and judiciously exploring the simulation ...

Abstract

This paper presents a detailed analysis of traces of DNS and associated TCP traffic collected on the Internet links of the MIT Laboratory for Computer Science and the Korea Advanced Institute of Science and Technology (KAIST). The first part of the analysis details how clients at these institutions interact with the wide-area DNS system, focusing on performance and prevalence of failures. The second part evaluates the effectiveness of DNS caching.In the most recent MIT trace, 23% of lookups receive no answer; ...

Abstract

In this paper, we develop simple models to study the performance of BitTorrent, a second generation peer-to-peer (P2P) application. We first present a simple fluid model and study the scalability, performance and efficiency of such a file-sharing mechanism. We then consider the built-in incentive mechanism of BitTorrent and study its effect on network performance. We also provide numerical results based on both simulations and real traces obtained from the Internet. ...

Abstract

The importance of a Web page is an inherently subjective matter, which depends on the readers interests, knowledge and attitudes. But there is still much that can be said objectively about the relative importance of Web pages. This paper describes PageRank, a method for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them. We compare PageRank to an idealized random Web surfer. We show how to efficiently compute PageRank for large... ...

Abstract

In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a full text and hyperlink database of at least 24 million pages is available at ...

Abstract

Abstract  Video-over-IP applications have recently attracted a large number of users on the Internet. Traditional client-server based video streaming solutions incur expensive bandwidth provision cost on the server. Peer-to-Peer (P2P) networking is a new paradigm to build distributed network applications. Recently, several P2P streaming systems have been deployed to provide live and on-demand video streaming services on the Internet at low server cost. In this paper, we provide a survey on the existing P2P solutions for live and on-demand video streaming. Representative ...

Abstract

Abstract  In both academia and industry, peer-to-peer (P2P) applications have attracted great attentions. P2P applications such as Napster, Gnutella, FastTrack, BitTorrent, Skype and PPLive, have witnessed tremendous success among the end users. Unlike a client-server based system, peers bring with them serving capacity. Therefore, as the demand of a P2P system grows, the capacity of the network grows, too. This enables a P2P application to be cheap to build and superb in scalability. In this paper, we survey the state of the ...

Abstract

Many believe that it is impossible to resolve the challenges facing today's Internet without rethinking the fundamental assumptions and design decisions underlying its current architecture. Therefore, a major research effort has been initiated on the topic of Clean Slate Design of the Internet's architecture. In this paper we first give an overview of the challenges that a future Internet has to address and then discuss approaches for finding possible solutions, including Clean Slate Design. Next, we discuss how such solutions can ...

Abstract

Peer-to-peer live streaming systems allow a bandwidth-constrained source to broadcast a video feed to a large number of users. In addition, a design with high link utilization can achieve high stream rates, supporting high-quality video. Until now, only tree-based designs have been shown to achieve close-to-optimal rates in real-life conditions, leaving the question open as to the attainable efficiency of completely unstructured mesh-based approaches. In this paper we answer that question by showing that a carefully-designed mesh-based system can achieve close-to-optimal ...

Abstract

Abstract  In both academia and industry, peer-to-peer (P2P) applications have attracted great attentions. P2P applications such as Napster, Gnutella, FastTrack, BitTorrent, Skype and PPLive, have witnessed tremendous success among the end users. Unlike a client-server based system, peers bring with them serving capacity. Therefore, as the demand of a P2P system grows, the capacity of the network grows, too. This enables a P2P application to be cheap to build and superb in scalability. In this paper, we survey the state of the ...

Abstract

This paper was the first initiative to try to define Web 2.0 and understand its implications for the next generation of software, looking at both design patterns and business modes. Web 2.0 is the network as platform, spanning all connected devices; Web 2.0 applications are those that make the most of the intrinsic advantages of that platform: delivering software as a continually-updated service that gets better the more people use it, consuming and remixing data from multiple sources, including individual users, ...

Abstract

<div id="SUM_display">No matter what type of web site or application you’re building, social interaction among the people who use it will be key to its success. They will talk about it, invite their friends, complain, sing its high praises, and dissect it in countless ways. With the right design strategy you can use this social interaction to get people signing up, coming back regularly, and bringing others into the fold. With tons of examples from real-world interfaces and a touch of ...

Abstract

The equality and anonymity of peer-to-peer networks makes them vulnerable to routing denial of service attacks from misbehaving nodes. In this paper, we investigate how existing social networks can benefit P2P networks by leveraging the inherent trust associated with social links. We present a trust model that lets us compare routing algorithms for P2P networks overlaying social networks. We propose SPROUT, a DHT routing algorithm that significantly increases the probability of successful routing by using social links. Finally, we discuss further ...

Abstract

The main challenge in P2P computing is to design and implement a robust and scalable distributed system composed of inexpensive, individually unreliable computers in unrelated administrative domains. ...

Abstract

We describe a family of caching protocols for distributed networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for use with very large networks such as the Internet, where delays caused by hot spots can be severe, and where it is not feasible for every server to have complete information about the current state of the entire network. The protocols are easy to implement using existing network protocols ...

Abstract

Current TCP-friendly congestion control mechanisms adjust the packet rate in order to adapt to network conditions and obtain a throughput not exceeding that of a TCP connection operating under the same conditions. In an environment where the bottleneck resource is packet processing, this is the correct behavior. However, if the bottleneck resource is bandwidth, and flows may use packets of different size, resource sharing depends on packet size and is no longer fair. For some applications, such ... ...