Results 1 - 10 of 30,442

Globally distributed content delivery

by John Dilley, Bruce Maggs, Jay Parikh, Harald Prokop, Ramesh Sitaraman, Bill Weihl - Internet Computing, IEEE , 2002
"... Using more than 12,000 servers in over 1,000 networks, Akamai’s distributed content delivery system fights service bottlenecks and shutdowns by delivering content from the Internet’s edge. As Web sites become popular,they’re increasingly vulnerable tothe flash crowd problem, in which request load ov ..."
Abstract - Cited by 160 (18 self) - Add to MetaCart
Using more than 12,000 servers in over 1,000 networks, Akamai’s distributed content delivery system fights service bottlenecks and shutdowns by delivering content from the Internet’s edge. As Web sites become popular,they’re increasingly vulnerable tothe flash crowd problem, in which request load

Network Coding for Large Scale Content Distribution

by Christos Gkantsidis, Pablo Rodriguez Rodriguez
"... We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling of bloc ..."
Abstract - Cited by 493 (7 self) - Add to MetaCart
We propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling

A Scalable Content-Addressable Network

by Sylvia Ratnasamy , Paul Francis, Mark Handley, Richard Karp, Scott Shenker - IN PROC. ACM SIGCOMM 2001 , 2001
"... Hash tables – which map “keys ” onto “values” – are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed infra ..."
Abstract - Cited by 3371 (32 self) - Add to MetaCart
Hash tables – which map “keys ” onto “values” – are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed

The Skill Content of Recent Technological Change: An Empirical Exploration

by David H. Autor, Frank Levy, Richard J. Murnane , 2000
"... Recent empirical and case study evidence documents a strong association between the adoption of computers and increased use of college educated or non-production workers. With few exceptions, the conceptual link explaining how computer technology complements skilled labor or substitutes for unskille ..."
Abstract - Cited by 643 (28 self) - Add to MetaCart
for unskilled labor is less well developed. In this paper, we apply an understanding of what computers do – the execution of procedural or rules-based logic – to develop a simple model of how the widespread adoption of computers in the workplace might alter workplace skill demands. An essential contention

Freenet: A Distributed Anonymous Information Storage and Retrieval System

by Ian Clarke, Oskar Sandberg, Brandon Wiley, Theodore W. Hong - INTERNATIONAL WORKSHOP ON DESIGNING PRIVACY ENHANCING TECHNOLOGIES: DESIGN ISSUES IN ANONYMITY AND UNOBSERVABILITY , 2001
"... We describe Freenet, an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity of both authors and readers. Freenet operates as a network of identical nodes that collectively pool their storage space to store data ..."
Abstract - Cited by 1064 (12 self) - Add to MetaCart
where there is no interest. It is infeasible to discover the true origin or destination of a file passing through the network, and difficult for a node operator to determine or be held responsible for the actual physical contents of her own node.

TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems

by Pete Keleher , Alan L. Cox, Sandhya Dwarkadas, Willy Zwaenepoel - IN PROCEEDINGS OF THE 1994 WINTER USENIX CONFERENCE , 1994
"... TreadMarks is a distributed shared memory (DSM) system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultrix using DECstation-5000/240's that are connected by a 100-Mbps switch-based ATM LAN and a 10-Mbps Ethernet. Ou ..."
Abstract - Cited by 526 (17 self) - Add to MetaCart
TreadMarks is a distributed shared memory (DSM) system for standard Unix systems such as SunOS and Ultrix. This paper presents a performance evaluation of TreadMarks running on Ultrix using DECstation-5000/240's that are connected by a 100-Mbps switch-based ATM LAN and a 10-Mbps Ethernet

Distributing Streaming Media Content Using Cooperative Networking

by Venkata N. Padmanabhan, Helen J. Wang, Philip A. Chou, Kunwadee Sripanidkulchai , 2002
"... In this paper, we discuss the problem of distributing streaming media content, both live and on-demand, to a large number of hosts in a scalable way. Our work is set in the context of the traditional client-server framework. Specifically, we consider the problem that arises when the server is overwh ..."
Abstract - Cited by 403 (7 self) - Add to MetaCart
In this paper, we discuss the problem of distributing streaming media content, both live and on-demand, to a large number of hosts in a scalable way. Our work is set in the context of the traditional client-server framework. Specifically, we consider the problem that arises when the server

How practical is network coding?

by Mea Wang, Baochun Li , 2006
"... With network coding, intermediate nodes between the source and the receivers of an end-to-end communication session are not only capable of relaying and replicating data messages, but also of coding incoming messages to produce coded outgoing ones. Recent studies have shown that network coding is ..."
Abstract - Cited by 1016 (23 self) - Add to MetaCart
is beneficial for peer-to-peer content distribution, since it eliminates the need for content reconciliation, and is highly resilient to peer failures. In this paper, we present our recent experiences with a highly optimized and high-performance C++ implementation of randomized network coding at the application

Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors

by John M. Mellor-crummey, Michael L. Scott - ACM Transactions on Computer Systems , 1991
"... Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become marke ..."
Abstract - Cited by 573 (32 self) - Add to MetaCart
Busy-wait techniques are heavily used for mutual exclusion and barrier synchronization in shared-memory parallel programs. Unfortunately, typical implementations of busy-waiting tend to produce large amounts of memory and interconnect contention, introducing performance bottlenecks that become

PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment

by Natalya Fridman Noy, Mark A. Musen , 2000
"... Researchers in the ontology-design field have developed the content for ontologies in many domain areas. Recently, ontologies have become increasingly common on the WorldWide Web where they provide semantics for annotations in Web pages. This distributed nature of ontology development has led t ..."
Abstract - Cited by 503 (12 self) - Add to MetaCart
Researchers in the ontology-design field have developed the content for ontologies in many domain areas. Recently, ontologies have become increasingly common on the WorldWide Web where they provide semantics for annotations in Web pages. This distributed nature of ontology development has led
Results 1 - 10 of 30,442