Browse Prior Art Database

Peer to peer acquisition of shared web resources over a bounded network

IP.com Disclosure Number: IPCOM000126808D
Original Publication Date: 2005-Aug-02
Included in the Prior Art Database: 2005-Aug-02
Document File: 3 page(s) / 60K

Publishing Venue

IBM

Abstract

This publication details a method of identifying, locating and acquiring web resources using server side augmentation, unique ids and broadcasts within a bounded peer to peer network.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 53% of the total text.

Page 1 of 3

Peer to peer acquisition of shared web resources over a bounded network

Browsing web pages on a device can result in a per kilobyte cost based on data transmission across various networks. Different networks can have different associated costs and currently there is no way of acquiring data sourced from a costed network by polling devices in any reduced cost networks.

    For example, if Matt is browsing the Portsmouth FC website on his mobile phone he is incurring a cost from his carrier for his data transfer. Dan also accesses the Portsmouth FC website on his PDA and using the techniques outlined below, his PDA first searches for other devices using wireless technology before making a GPRS connection, which would incur cost. In this instance, Dan's device finds the resources required on Matt's phone. They are deemed to be fresh so Dan's PDA initiates a transfer of these resources for storage on Dan's PDA and then displayed on screen.

Unique Identification of Resources

    In order to implement this invention resources must be uniquely identified. URIs are insufficient to fulfil this requirement because two identical resources can have different URIs. Searching a cache by URI alone opens the system up to abuse: malicious users can map a URI onto any cache-stored resource they like.

By uniquely identifying a resource in a manner independent of URIs, we can make the likelihood and accuracy of cache-hits greater.

An example of such a UID (Unique ID) is an MD5 hash and this method of identification is well documented. Whichever method is used, it must be one which facilitates easy verification on the Pervasive Device.

Server-side Augmentation of URIs

    In order to allow Pervasive devices to take advantage of this invention, servers must provide support. This support must consists of the provision of a UID for every resource that a page references.

Consider a page with the following elements:

<head> <script type="text/script" src="http://someplace.com/somescript"/> <link rel=stylesheet href="styles.css" type="text/css"/> </head> <body>

<p>Some text here. Now a link to a resource <a href="res.exe">here</a>.

     <img src="pic.jpg" alt="a picture" /> </body>

    In this simple page, there are links to 4 resources (highlighted in green). 3 of these resources will need downloading to complete the rendering of the page. One more will be downloaded on request.

Two methods could be used to associate these resources with UIDs. The first is achieved by defining a mapping for all download...