Efficient Use of Peer Cache Space In Large Scale File Distributions

Efficient Use of Peer Cache Space In Large Scale File Distributions

A mechanism for providing efficient use of peer cache space in large scale file distributions. A peer computer receives a download plan for a requested file. The download plan specifies a number of peer servers where the file is stored, a minimum number of peer servers required to store the file, an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: LEDDEN DOUGLAS, OROZCO LILIANA, JARVIS STEVEN A, VASSBERG BRIAN G
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
PHYSICS
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator LEDDEN DOUGLAS
OROZCO LILIANA
JARVIS STEVEN A
VASSBERG BRIAN G
description A mechanism for providing efficient use of peer cache space in large scale file distributions. A peer computer receives a download plan for a requested file. The download plan specifies a number of peer servers where the file is stored, a minimum number of peer servers required to store the file, and a saturation level for the file in the zone. When the peer computer downloads the file from one or more peer servers listed in the download plan, the peer computer determines whether the file is required to be cached at the peer computer by comparing the minimum number of peer servers in the plan required to store the file against the number of peer servers listed in the plan. If the minimum number required to store the file is greater the number of peer servers listed in the plan, the peer computer caches the file.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2010306252A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2010306252A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2010306252A13</originalsourceid><addsrcrecordid>eNrjZHB2TUvLTM5MzStRCC1OVchPUwhITS1ScE5MzkhVCC5ITE5V8MxT8EksSgdykxNzUhXcMoGES2ZxSVFmUmlJZn5eMQ8Da1piTnEqL5TmZlB2cw1x9tBNLciPTy0GGZKXWhIfGmxkYGhgbGBmZGrkaGhMnCoAYDAxoA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Efficient Use of Peer Cache Space In Large Scale File Distributions</title><source>esp@cenet</source><creator>LEDDEN DOUGLAS ; OROZCO LILIANA ; JARVIS STEVEN A ; VASSBERG BRIAN G</creator><creatorcontrib>LEDDEN DOUGLAS ; OROZCO LILIANA ; JARVIS STEVEN A ; VASSBERG BRIAN G</creatorcontrib><description>A mechanism for providing efficient use of peer cache space in large scale file distributions. A peer computer receives a download plan for a requested file. The download plan specifies a number of peer servers where the file is stored, a minimum number of peer servers required to store the file, and a saturation level for the file in the zone. When the peer computer downloads the file from one or more peer servers listed in the download plan, the peer computer determines whether the file is required to be cached at the peer computer by comparing the minimum number of peer servers in the plan required to store the file against the number of peer servers listed in the plan. If the minimum number required to store the file is greater the number of peer servers listed in the plan, the peer computer caches the file.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC COMMUNICATION TECHNIQUE ; ELECTRIC DIGITAL DATA PROCESSING ; ELECTRICITY ; PHYSICS ; TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><creationdate>2010</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20101202&amp;DB=EPODOC&amp;CC=US&amp;NR=2010306252A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,776,881,25544,76293</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20101202&amp;DB=EPODOC&amp;CC=US&amp;NR=2010306252A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>LEDDEN DOUGLAS</creatorcontrib><creatorcontrib>OROZCO LILIANA</creatorcontrib><creatorcontrib>JARVIS STEVEN A</creatorcontrib><creatorcontrib>VASSBERG BRIAN G</creatorcontrib><title>Efficient Use of Peer Cache Space In Large Scale File Distributions</title><description>A mechanism for providing efficient use of peer cache space in large scale file distributions. A peer computer receives a download plan for a requested file. The download plan specifies a number of peer servers where the file is stored, a minimum number of peer servers required to store the file, and a saturation level for the file in the zone. When the peer computer downloads the file from one or more peer servers listed in the download plan, the peer computer determines whether the file is required to be cached at the peer computer by comparing the minimum number of peer servers in the plan required to store the file against the number of peer servers listed in the plan. If the minimum number required to store the file is greater the number of peer servers listed in the plan, the peer computer caches the file.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC COMMUNICATION TECHNIQUE</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>ELECTRICITY</subject><subject>PHYSICS</subject><subject>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2010</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZHB2TUvLTM5MzStRCC1OVchPUwhITS1ScE5MzkhVCC5ITE5V8MxT8EksSgdykxNzUhXcMoGES2ZxSVFmUmlJZn5eMQ8Da1piTnEqL5TmZlB2cw1x9tBNLciPTy0GGZKXWhIfGmxkYGhgbGBmZGrkaGhMnCoAYDAxoA</recordid><startdate>20101202</startdate><enddate>20101202</enddate><creator>LEDDEN DOUGLAS</creator><creator>OROZCO LILIANA</creator><creator>JARVIS STEVEN A</creator><creator>VASSBERG BRIAN G</creator><scope>EVB</scope></search><sort><creationdate>20101202</creationdate><title>Efficient Use of Peer Cache Space In Large Scale File Distributions</title><author>LEDDEN DOUGLAS ; OROZCO LILIANA ; JARVIS STEVEN A ; VASSBERG BRIAN G</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2010306252A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2010</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC COMMUNICATION TECHNIQUE</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>ELECTRICITY</topic><topic>PHYSICS</topic><topic>TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION</topic><toplevel>online_resources</toplevel><creatorcontrib>LEDDEN DOUGLAS</creatorcontrib><creatorcontrib>OROZCO LILIANA</creatorcontrib><creatorcontrib>JARVIS STEVEN A</creatorcontrib><creatorcontrib>VASSBERG BRIAN G</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>LEDDEN DOUGLAS</au><au>OROZCO LILIANA</au><au>JARVIS STEVEN A</au><au>VASSBERG BRIAN G</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Efficient Use of Peer Cache Space In Large Scale File Distributions</title><date>2010-12-02</date><risdate>2010</risdate><abstract>A mechanism for providing efficient use of peer cache space in large scale file distributions. A peer computer receives a download plan for a requested file. The download plan specifies a number of peer servers where the file is stored, a minimum number of peer servers required to store the file, and a saturation level for the file in the zone. When the peer computer downloads the file from one or more peer servers listed in the download plan, the peer computer determines whether the file is required to be cached at the peer computer by comparing the minimum number of peer servers in the plan required to store the file against the number of peer servers listed in the plan. If the minimum number required to store the file is greater the number of peer servers listed in the plan, the peer computer caches the file.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2010306252A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC COMMUNICATION TECHNIQUE
ELECTRIC DIGITAL DATA PROCESSING
ELECTRICITY
PHYSICS
TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHICCOMMUNICATION
title Efficient Use of Peer Cache Space In Large Scale File Distributions
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T15%3A29%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=LEDDEN%20DOUGLAS&rft.date=2010-12-02&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2010306252A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true