User interface for collecting criteria and estimating delivery parameters

Abstract
The present invention relates generally to a method of identifying data delivery parameters relating to delivery of data accessible from a network location via a communications service provider. Embodiments of the invention are particularly well suited to identifying delivery parameters when the delivery of data is metered, such as when data are delivered to terminals connected to mobile networks.
Description
FIELD OF THE INVENTION

The present invention relates generally to a method of identifying data delivery parameters relating to delivery of data accessible from a network location via a communications service provider, and is particularly, but not exclusively, suited to identifying delivery parameters when the delivery of data is metered, such as when data are delivered to terminals connected to mobile networks.


BACKGROUND OF THE INVENTION

As is well known, search engines such as those provided by Google™ and Yahoo™ use “web crawlers” to locate new or modified data in the form of web pages that are accessible via the World Wide Web. The content of these pages is analyzed, keywords are extracted from the pages, and the keywords are added to a search index, which links to a list of web pages that contain a particular word. A weight or rank for the web page can be generated on the basis of the number of times that word occurs on the web page, and stored in the index. A variety of other parameters can be factored into the web-page rank, including the number of times other search users have clicked on the link to that web page, how extensively that web page is linked to from other web pages, personal reviews and ratings of web pages or sites, or on the basis of an amount that a given web site is willing to pay for a particular ranking. Web pages can include data relating to products and services, and can thus serve as a medium for advertising.


As described in U.S. Pat. No. 6,269,361, web site promoters can control their placement in search result listings so that their listings are prominent in searches that are relevant to the content of their web site. This is achieved by means of an on-line marketplace, in which companies selling products, services, or information bid in an open auction environment for positions on a search result list generated by an Internet search engine. Since content providers must pay for each click-through referral generated through the search result lists generated by the search engine, there is an incentive to select and bid on those search keywords that are most relevant to their web site offerings. In known systems implementing this approach, content providers typically input the search keywords and bid criteria via a user interface, the user interface being operated under the control of the search facility so that data entered by the content providers can subsequently be used to rank search results on the basis of their bids.


Use of search engines to find data of interest is currently not in question because in most cases search queries are received from terminals that are fixedly connected to the Internet (either directly, or via one or several network portions), and of course the transmission of data within the Internet—on a per request basis—is free. However, with the advent of widespread deployment of radio networks such as cellular and non-cellular networks (using e.g. Global System for Mobile Communications (GSM) technology, Wideband Code Division Multiplex Access (WCDMA); Code Division Multiplex Access (CDMA), Worldwide Interoperability for Microwave Access (WiMax)) and/or unlicensed network portions (such as Wireless LANs and Bluetooth technologies), search requests are increasingly being received from terminals connected to wireless networks. Unlike the transmission of data within fixed-line networks, the transmission of data within mobile networks is typically metered on a per transmission basis. As a result, mobile terminals are faced with hitherto unseen costs for accessing sites on the basis of search results generated by search engines, which calls into question the likely take-up of search engine offerings by users of personal mobile devices.


In order to increase the likelihood of users accessing data relating to search results it would be attractive to involve the content providers in the delivery of data.


SUMMARY

In accordance with aspects of the present invention, there is provided method and a system according to the appended claims.


Embodiments of the invention are particularly convenient for use in arranging for delivery of content to a terminal connected to a mobile communications network.


In accordance with further aspects of the invention there is provided a distributed system for carrying out the method steps, including a user interface adapted to collect criteria to be used in determining the delivery of said content.


Further features and advantages of the invention will become apparent from the following description of preferred embodiments of the aspects of the invention, given by way of example only, which is made with reference to the accompanying drawings. It is to be understood that other embodiments may be utilized and structural and functional modifications may be made without departing from the scope and spirit of the present invention.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a schematic block diagram showing a distributed information system within which embodiments of the invention can operate;



FIG. 2 is a schematic diagram showing components of the content broker shown in FIG. 1;



FIG. 3 is a schematic diagram showing a user interface for use in collecting content and delivery criteria from the content providers shown in FIG. 1;



FIG. 4 is a schematic flow diagram showing steps associated with collecting data for use in identifying network operators in respect of which transmission of data to subscribers can be sponsored;



FIG. 5 is a schematic diagram showing fields of several records stored within the database shown in FIG. 1; and



FIG. 6 is a schematic block diagram showing a distributed information system comprising a service for accessing the data stored in FIG. 5.





DETAILED DESCRIPTION OF THE INVENTION

Embodiments of the present invention are concerned with providing a means for collecting criteria relating to delivery and characteristics of data that are accessible via communications networks from content providers. Embodiments of the invention are concerned with processing the various characteristics on the basis of delivery constraints so as to estimate delivery parameters for the data. The nature of these processes is described in detail below, but first a description of the infrastructure needed to support some embodiments of the invention will be presented.



FIG. 1 shows an example of a distributed information system 1 within which some embodiments of the invention operate; the distributed system 1 comprises a plurality of content providers 6a, 6b, 6c, at least some of which are arranged to store content and information, a content broker 8, and a database 20, all of which are connected to a network 12 either directly or indirectly (e.g. via the Internet, local area networks (LANs), other wide area networks (WANs), and regional networks accessed over telephone lines, such as commercial information services).


As shown in FIG. 1, each of the terminals 2, 4 is connected to a different network N1, N2, meaning that the delivery path for data accessed from the first terminal 2 involves network portions different to those associated with the delivery path for data accessed by the second terminal 4. In one arrangement it is envisaged that each of network portions N1, N2 relates to a respective service provider, each having a proprietary set of delivery parameters specifying a cost of delivery of a certain amount of data associated therewith (e.g. as a function of number of data access attempts within a given period). Examples of network portions N1, N2 include mobile networks, and in this specification, mobile networks are used to exemplify embodiments of the invention.


Mobile terminals 2, 4 are adapted to communicate with the various content providers 6a, 6b, 6c via mobile network 14 and appropriate gateways WAP GW, GPRS support node (GGSN) as shown; the terminals 2, 4 can be mobile telephones or PDAs, lap top computers and the like, and the mobile network 14 can comprise licensed (such as cellular networks using e.g. Global System for Mobile Communications (GSM) technology, Wideband Code Division Multiplex Access (WCDMA); Code Division Multiplex Access (CDMA), Worldwide Interoperability for Microwave Access (WiMax)) and/or unlicensed network portions (such as Wireless LANs and Bluetooth technologies) and/or broadcasting networks (such as Digital Video Broadcasting (DVB-H), MediaFlo, Terrestrial Integrated Services Digital Broadcasting (ISDB-T), Digital Multimedia Broadcasting (DMB)).


The mobile terminals 2, 4 can comprise browser programs adapted to locate, and access data from, web sites corresponding to the or each content provider 6a, 6b, 6c. The browser programs allow users of the terminals 2, 4 to enter addresses of specific web sites, typically in the form of Uniform Resource Locators, or URLs, and are typically adapted to receive and display web and WAP pages; in the event that a given terminal 2 is only capable of processing and displaying WAP pages, translation of a web page can be performed by a device in the network or by suitable translation software running on the device 2. As is known in the art, any given web page can include links nested therein, which, when selected, can provide access to other pages or data such as plain textual information, or digitally encoded multimedia content, such as software programs, audio signals, videos graphics, etc. Accordingly selection of such links results in transmission of further data to the terminals 2, 4.


Embodiments of the invention may enable any given content provider 6a to evaluate, and thence elect, particular service providers as being authorised to deliver content to terminals 2, 4; data relating to those service providers authorised to transport data are stored as records in the database 20 for use in evaluating delivery costs and the like in response to receipt of a request for data access from the content providers.


In one arrangement the content broker 8 is preferably embodied as a web server, and provides an interface to the database 20 via which the content providers 6a, 6b, 6c can submit criteria controlling access to their content and information, in particular when they are referenced in response to a search request received from one of the terminals 2, 4. As can be seen from FIG. 2, the content broker 8 comprises standard operating system, storage, Input/Output, processor and memory components, and bespoke software components in the form of authentication software component 201, Graphical User Interface (GUI) software component 203, delivery evaluation software component 205 and account updating software component 207.


The authentication software component 201 may comprise a firewall, not shown, which receives and authenticates requests from the content providers 6a, 6b, 6c, typically from a web browser, and is arranged to protect the GUI software component 203 and information stored in the database 20 from unauthorised access. Additional security may be provided via enhancements to the standard communications protocols such as Secure Hyper Text Transfer Protocol (HTTPS) or the Secure Sockets Layer (SSL).


The GUI software component 203 is arranged to invoke and display a user interface 300 of the form shown in FIG. 3, which comprises a plurality of editable regions 301, 303, 307, 311, and is configured to receive data input by or on behalf of an authorised content provider 6a. The GUI software component 203 is triggered by the authentication software component 201 upon successful authentication of the requesting content provider 6a, 6b, 6c. With reference to FIGS. 3 and 4, once the requesting content provider 6a has been authenticated (step S4.1), the user interface 300 is sent (e.g. in the form of a web page) and displayed to the content provider 6a, with the identity of the content provider being displayed in region 305 (step S4.7). The editable region 301 is for data specifying the content that is accessible from the content provider's network location(s), together with the corresponding network location(s) (specified, e.g. by means of a Universal Resource Indicator (URI)). In addition, region 301 includes a field for specifying the amount of data that is accessible from the or each network location; the data amount is preferably specified in number of Bytes, and can be verified by the content broker 8 during post-processing of the entered data (e.g. when checking the URI, as described below).


Editable region 303 is for data specifying the criteria which, when entered by a user as part of a request for data access (e.g. a search request for documents or a search request for media data such as video, music and the like), will result in the content provider being included in a list of results provided to the user. The criteria thus include keywords, artists, film names etc., as appropriate to the content identified in region 301, together with an amount of resource (such as money) that the content provider is willing to bid in order to influence their position in the list of results. As described in detail below, these criteria are then stored in the database 20, and can be used when performing processes such as responding to search requests.


As is known in the art, the list of results can comprise a list of URLs: each URL on the list corresponds to a network location associated with a given content provider and in embodiments of the invention the content provider can sponsor all or part of the delivery of their content to the user, together with the conditions under which such sponsorship is to be provided are entered in region 307. Examples of such conditions include (but are not limited to):

    • Particular access technologies for delivery (e.g. SMS, WAP, Internet, WLAN, 20, 30—delivery sponsored or not);
    • Roaming, as a function of network operator (delivery sponsored or not);
    • Delivery plans to be supported, as a function of network operator;
    • Specified time periods for sponsored delivery;
    • Specified number of access requests (per user);
    • Specified amount of delivery sponsorship (per user and/or per access request)
    • Specified type of content from network location to be sponsored;
    • Specified budget to be used for sponsoring delivery (in total and/or per delivery event);
    • Number of click-through links from which content can be provided and in respect of which delivery will be sponsored.


The content provider 6a can also select, from a list of available network operators, those operators in relation to whom the sponsorship conditions apply, thereby effectively filtering out certain users from sponsorship of content delivery. In one arrangement the operators can be selected from a drop-down list of all available operators by means of buttons 311, the drop-down list being invoked by clicking on region 309; though not shown in the Figure, various operator-specific parameters can be displayed to the user to help with the selection process (e.g. access technologies for data delivery, location available etc., this having been gathered from the various operators and stored in the database 20 so as to be accessible to the content broker 8 at steps S4.3 and S4.5). In another arrangement, the criteria entered in region 307 can be transmitted to the content provider 8 and used by the GUI software component 203 to pre-filter available operators on the basis of the delivery access technologies offered thereby, so as to ensure that the operators presented to the user in the drop down list match the specified delivery options. Turning back to FIG. 1, it will be appreciated that there may be two or more different network operators, as represented by network portions N1, N2.


As described above the content provider 6a specifies a budget for sponsoring delivery of content, and this is used by the content broker 8 in order to provide an evaluation of the various network operators. Of particular interest to the content provider 6a is the cost of sponsoring content provision—e.g. the most and least expensive operators in relation to delivery of any given content item(s). Each network operator has one or more delivery plans associated therewith, which for example apply in respect of different subscribers and typically vary as a function of subscription; for example, in respect of an exemplary network operator, one plan, A, might specify 1custom character/Mbyte, whilst another plan, B, might specify 0.25custom character/Mbyte.


Accordingly and referring back to FIG. 2, responsive to submission of data from the content provider 6a (via selection of button 313, the result of which is encapsulation and transmission of the data entered in regions 301, 303, 307 and 311, as indicated by step S4.9 in FIG. 4), the delivery evaluation software component 205 is arranged to process the various delivery plans in respect of the content specified in editable region 301 so as to identify the number of deliveries that can be supported by the budget for each of the operators.


In detail, the delivery evaluation software component 205 retrieves data indicative of the URL(s) entered in region 301 and accesses the terminal corresponding to the or each URL, as indicated in step S4.11 so as to identify or verify the amount of data accessible from the URL (this having been optionally entered by the content provider 6a; access in respect of only one URL is shown for clarity). Such identification or verification can involve downloading the content to the content broker 8 or reviewing data indicative of the file size stored on the corresponding web server. In either case, data indicative of the amount of data are returned to the delivery evaluation software component 205 at step S4.13 (it will be appreciated that steps S4.11 and S4.13 are not essential to embodiments the invention, since they merely serve for verification purposes).


Once the amount of data that would be transmitted to a user in response to selection of a link corresponding to the URL has been established, the delivery evaluation software component 205 evaluates the number of delivery events that can be supported for the budget specified in region 307 for each operator selected by the content provider in region 311, on the basis of the operator data retrieved from the database 20 at step S4.5. One exemplary evaluation method will now be explained with reference to the two data plans described above (A: 1 custom character/Mbyte and B: 0.25custom character/Mbyte), and for the case where the budget specified is 100custom character. Considering firstly plan A, assuming the amount of data available from the URL is 1.5 Mbyte, the delivery evaluation software component 205 identifies that the delivery cost for each individual data access attempt is 1.5custom character; accordingly the number of deliveries that can be sponsored is approximately 66. Considering next plan B, the delivery cost for each individual data access attempt is determined to be 0.38£; accordingly for a budget of 100£, the number of sponsorable deliveries is approximately 264.


Having evaluated the number of sponsorable deliveries for each operator (step S4.15), the delivery evaluation software component 205 generates output indicative of the number of delivery events per operator, and transmits this to the content provider (step S4.17); an example of the output is shown in Table 1:













TABLE 1








SPONSORED
NO.



OPERATOR
DATAPLAN TYPE
DELIVERIES









Vodafone, DE
A, B
 66, 264



Cingular
C
467



Orange
D
200



Total

707, 912










Whilst the foregoing example assumes that the content provider 6a is sponsoring all (n %, where n=100%) of the delivery costs for individual data access requests, the content provider 6a can alternatively sponsor a proportion of the delivery costs (n %, where n<100% and is specified by the content provider via the user interface 300); in either case the delivery evaluation software component 205 is arranged to evaluate the number of deliveries supported by the budget on the basis of the percentage n according to the evaluation process described above.


The foregoing assumes selection of a given link (e.g. in search results) to result in a request for data access from a single URL; however, and as described above, the URL might contain one or more click-through links. Accordingly the delivery evaluation software component 205 can estimate the number of web pages that are likely to be accessed via click-through links, and this estimate can be combined with the size of data accessible from each respective click-through link so as to determine the amount of data that might be accessed downloaded by a given subscriber. In one arrangement the characteristics are combined so as to generate an overall download requirement, as follows:

Download Size of directly accessible web page+No. inter-web page click-through links*P1*Average size of inter-web page click-through links+No. external web page click-through links*P2*Average size of external web page click-through links


P1 and P2 are probability values indicative of the likelihood of users accessing the click-through links. Many content providers maintain statistics indicative of access to internal and external links, so this information can be provided by the content providers at the time of submitting the storage and/or transmission criteria. Alternatively the delivery evaluation software component 205 can apply estimates for the respective probabilities, in the form of discrete values (such as, if there are eight inter-web click through links (so eight layers of clicks), the probability of accessing level one click is 75%, the probability of accessing level two click is 50%, the probability of accessing level three click is 30%; the probability of accessing level four click is 25%; the probability of accessing level five click is 20% etc.) or in the form of a continuous function. Once the magnitude of the download has been established, this can be used to evaluate the number of individual data access requests that can be supported by the content provider's budget.


Returning to FIG. 4, the data indicative of the number of data access deliveries that will be supported by the budget specified in region 303 can be presented to the content provider 6a within a web page (not shown). The web page can additionally include a “Confirm” button, which, when pressed, causes the data received at and evaluated by the content broker 8 to be stored in the database 20 for use in relation to subsequent data access requests. In addition the web page can include a “Modify Details” button, which, when selected, causes the user interface 300, complete with the data previously entered by the content provider 6a, to be retransmitted thereto. In addition, the web page can include a “Start Again” button, which, when selected, causes the content provider to return to step S4.7. Selection of any of these buttons is shown schematically by step S4.17 in FIG. 4.


Assuming the content provider 6a to select the “Confirm” button at some stage, this causes the account updating software component 407 to store the data as a record R in the database 20 (or locally in the content broker 8, or in a distributed storage system (not shown)), the record being for use in serving subsequent requests for data access from terminals such as terminals 2, 4 shown in FIG. 1. FIG. 5 shows as example of three records Ra, Rb, Rc, one corresponding to each of the content providers 6a, 6b, 6c.


Applications of Some Embodiments of the Invention


In the foregoing embodiments a content provider is described as sponsoring a URL with little context in relation to the conditions in which the sponsorship applies; in preferred applications of embodiments of the invention the sponsorship applies in relation to access requests that are received via a bespoke service 10 such as that shown in FIG. 6.


One example of a suitable service 10 is a portal arranged to filter the records Ra, Rb, Rc so as to identify those content providers 6a, 6b, 6c whose data are free to access by the terminals 2, 4. As described above and shown in FIG. 5, each content provider 6a, 6b, 6c selects (an) operators in respect of which delivery of data to terminals is to be sponsored by the content provider, resulting in a record Ra, Rb, Rc being populated in the database 20; the records Ra, Rb, Rc contain, inter alia, data indicative of the selected operator(s), and this can be used to populate a “free to access” list. In one arrangement the list could be compiled in response to a request received from a terminal 2, 4: the portal 10 could extract the identity of the operator serving the requesting terminal 2 and use this to filter the records Ra, Rb, Rc. The output of this process would therefore be a list of URLs that are free for that particular subscriber to access, given their particular network operator. A suitable name for such a portal could be “free mobile links. com” and the portal could be embodied as a conventional web server with an interface configured to facilitate database queries.


Alternatively service 10 could be a search engine, which is arranged to identify those content providers 6a, 6b, 6c that are registered as having content corresponding to keywords submitted by the terminal as part of a search request. In addition to listing the operator(s) via which access to content is free to terminals 2, 4, the records Ra, Rb, Rc can optionally include a further field (not shown), which specifies an amount of resource that the content provider is willing to allocate to offset delivery of their content via non-listed operators. The search engine could respond to search requests by means of a search results list of content providers having content relevant to the search query; items on the results list are conveniently categorised as “free” or “subsidised”, where “free” corresponds to content providers listing the operator from which the request was received in the record Ra, Rb, Rc and “subsidised” corresponds to content providers not listing the operator from which the request was received in the record Ra, Rb, Rc, but in respect of which an amount of resource has been specified in the further field (for use in subsidising access to their content).


As a yet further example, service 10 could be a web site comprising embedded links to content providers 6a, 6b, 6c; the links could be displayed so as to identify content providers whose content is free to access differently to content providers whose content is partly or non-subsidised in dependence on the operator from which the request was received and the data stored in the database 20 as described above.


Additional Details and Modifications


It will be appreciated that steps S4.3 and S4.5 are optional, in so far as the operator data can be cached in the content broker 8 for use in future access requests from other content providers.


Whilst in the above embodiments it is envisaged that sponsorship relates to delivery of data to a mobile terminal, the search results could alternatively be transmitted to a search results service. Accordingly the sponsorship could additionally or alternatively relate to delivery of data within a fixed network, or to provision of access to Wireless Local Area Network (WLAN) services for certain selected search results only.


Whilst it is preferably that the network location and key words are related, any given content provider can specify a link to a network location that is unrelated to the keywords (e.g. a content provider providing information in relation to the key words “hotels London” can specify links to network locations unrelated to these keywords).


By way of clarification, the term “sponsored access” is to be understood as including (but not limited to), wholly or in part, the costs of associated with accessing data from the network location associated with the content provider.


The above embodiments are to be understood as illustrative examples of the invention. Further embodiments of the invention are envisaged. It is to be understood that any feature described in relation to anyone embodiment may be used alone, or in combination with other features described, and may also be used in combination with one or more features of any other of the embodiments, or any combination of any other of the embodiments. Furthermore, equivalents and modifications not described above may also be employed without departing from the scope of the invention, which is defined in the accompanying claims.

Claims
  • 1. A method comprising: accessing a network location to estimate an amount of data accessible through a web page at the network location, the estimate based on a probability of additional web pages being accessed through links on the web page and an average size of each additional web page, wherein the links are one of inter-web page links, external web page links, and a combination of inter-web page links and external web page links;receiving a quantity of resources to be allocated for delivery of the data;using a delivery rate specified by a communications service provider to deliver the data, the estimated amount of the data, and the allocated quantity of resources to identify a number of individual access requests initiated by a mobile device for the data that can be offset by the allocated quantity of resources when the data is delivered by the communications service provider; andoutputting data indicative of the identified number of individual access requests.
  • 2. The method according to claim 1 and further comprising using a different delivery rate and a different allocated quantity of resources to identify a further number of individual access requests for the amount of data that can be offset by the different allocated quantity of resources.
  • 3. The method according to claim 2 and further comprising ordering the data indicative of the identified number of individual access requests on the basis of the number and the further number of individual access requests.
  • 4. The method according to claim 2, wherein the different delivery rate relates to the communications service provider.
  • 5. The method according to claim 2, wherein the different delivery rate relates to a different communications service provider.
  • 6. The method according to claim 1, wherein estimating the amount of data includes weighting the amount of data according to the size of at least one data element accessible from the network location.
  • 7. The method according to claim 1, wherein estimating the amount of data includes weighting the amount of data according to the size of a predetermined number of data elements accessible from the network location.
  • 8. The method according to claim 1, wherein estimating the amount of data includes weighting the amount of data according to the type of a web page link.
  • 9. The method according to claim 1, wherein the delivery rate comprises a predetermined delivery rate.
  • 10. The method according to claim 1 and further comprising deriving the delivery rate from a data plan associated with the communications service provider.
  • 11. The method according to claim 10 and further comprising retrieving the data plan from a storage system using an identifier associated with the data plan.
  • 12. The method according to claim 1 and further comprising receiving the estimate and the allocated quantity of resources through a user interface accessible by a content provider associated with the network location.
  • 13. The method according to claim 12 and further comprising receiving selection criterion relating to the data accessible from the network location for use in serving a request for data from the network location.
  • 14. The method according to claim 13 and further comprising: receiving data indicative of a first bid amount corresponding to the selection criterion, the first bid amount and selection criterion corresponding to a set of data accessible through the network location;generating a second bid amount in dependence on the first bid amount and an amount of data associated with the set of data accessible through the network location; andstoring the generated second bid amount and search term corresponding to the selection criterion in a storage system.
  • 15. The method according to claim 14, and further comprising generating the second bid amount to account for an amount of data corresponding to at least one data item accessible from the network location.
  • 16. The method according to claim 1, wherein the communications service provider comprises a mobile communications service provider.
  • 17. The method according to claim 1 and further comprising serving the identified number of individual access requests.
  • 18. The method according to claim 1 and further comprising operating based on the identified number of individual access requests.
  • 19. A non-transitory computer readable medium storing instructions, which when executed by a processor, cause the processor to perform operations comprising: accessing a network location to estimate an amount of data accessible through a web page at the network location, the estimate based on a probability of additional web pages being accessed through links on the web page and an average size of each additional web page, wherein the links are one of inter-web page links, external web page links, and a combination of inter-web page links and external web page links;receiving a quantity of resources to be allocated for delivery of the data;using a delivery rate specified by a communications service provider to deliver the data, the estimated amount of the data, and the allocated quantity of resources to identify a number of individual access requests initiated by a mobile device for the data that can be offset by the allocated quantity of resources when the data is delivered by the communications service provider; andoutputting data indicative of the identified number of individual access requests.
  • 20. The non-transitory computer readable medium according to claim 19, wherein estimating the amount of data includes weighting the amount of data according to the size of at least one data element accessible from the network location.
  • 21. The non-transitory computer readable medium according to claim 19, wherein estimating the amount of data includes weighting the amount of data according to the size of a predetermined number of data elements accessible from the network location.
  • 22. The non-transitory computer readable medium according to claim 19, wherein estimating the amount of data includes weighting the amount of data according to the type of a web page link.
  • 23. The non-transitory computer readable medium according to claim 19 and further comprising deriving the delivery rate from a data plan associated with the communications service provider.
  • 24. A system comprising a processor coupled to a bus;a network interface coupled to the processor through the bus; anda memory coupled to the processor through a bus, the memory storing instructions to cause the processor to:access a network location through the network interface to estimate an amount of data accessible through a web page at the network location, the estimate based on a probability of additional web pages being accessed through links on the web page and an average size of each additional web page, wherein the links are one of inter-web page links, external web page links, and a combination of inter-web page links and external web page links;receive a quantity of resources to be allocated for delivery of the data;use a delivery rate specified by a communications service provider to deliver the data, the estimated amount of the data, and the allocated quantity of resources to identify a number of individual access requests initiated by a mobile device for the data that can be offset by the allocated quantity of resources when the data is delivered by the communications service provider; andoutput data indicative of the identified number of individual access requests.
Priority Claims (1)
Number Date Country Kind
0706814.1 Apr 2007 GB national
Parent Case Info

This application is a continuation of co-pending U.S. application Ser. No. 13/924,460 filed on Jun. 21, 2013, which is a divisional of U.S. application Ser. No. 12/019,338 filed on Jan. 24, 2008, now issued as U.S. Pat. No. 8,473,614, which relies for priority under 35 U.S.C. § 119 upon Great Britain Application Serial No. GB0706814.1, filed on Apr. 5, 2007, which are incorporated herein by reference.

US Referenced Citations (92)
Number Name Date Kind
5613213 Naddell et al. Mar 1997 A
5768521 Dedrick Jun 1998 A
5978775 Chen Nov 1999 A
5978833 Pashley et al. Nov 1999 A
6035281 Crosskey et al. Mar 2000 A
6078866 Buck et al. Jun 2000 A
6250557 Forslund et al. Jun 2001 B1
6269361 Davis et al. Jul 2001 B1
6334145 Adams et al. Dec 2001 B1
6408309 Agarwal Jun 2002 B1
7200633 Sekiguchi et al. Apr 2007 B2
7406307 Manto Jul 2008 B2
7428555 Yan Sep 2008 B2
7668950 Horowitz et al. Feb 2010 B2
7676405 Steelberg et al. Mar 2010 B2
7764947 Koskinen et al. Jul 2010 B2
7818284 Walker Oct 2010 B1
7974988 Nandiwada et al. Jul 2011 B2
7991140 Pines et al. Aug 2011 B2
8099490 Deakin Jan 2012 B2
20020006803 Mendiola et al. Jan 2002 A1
20020019829 Shapiro Feb 2002 A1
20020075305 Beaton et al. Jun 2002 A1
20020111848 White Aug 2002 A1
20020138291 Vaidyanathan et al. Sep 2002 A1
20020177431 Hamilton et al. Nov 2002 A1
20020188487 Fox Dec 2002 A1
20030040297 Pecen et al. Feb 2003 A1
20030126015 Chan et al. Jul 2003 A1
20030197719 Lincke et al. Oct 2003 A1
20030200059 Ignatowski Oct 2003 A1
20040093289 Bodin May 2004 A1
20040203851 Vetro et al. Oct 2004 A1
20040204133 Andrew et al. Oct 2004 A1
20040209649 Lord Oct 2004 A1
20040259526 Goris et al. Dec 2004 A1
20050125397 Gross et al. Jun 2005 A1
20050160002 Roetter et al. Jul 2005 A1
20050177506 Rissanen Aug 2005 A1
20050213514 Su Sep 2005 A1
20050222949 Inotay et al. Oct 2005 A1
20050228680 Malik Oct 2005 A1
20050239504 Ishii et al. Oct 2005 A1
20050240475 Margiloff et al. Oct 2005 A1
20050273465 Kimura Dec 2005 A1
20050281237 Heinonen et al. Dec 2005 A1
20060026067 Nicholas et al. Feb 2006 A1
20060048059 Etkin Mar 2006 A1
20060068845 Muller et al. Mar 2006 A1
20060117378 Tam et al. Jun 2006 A1
20060123014 Ng Jun 2006 A1
20060184504 Taylor Aug 2006 A1
20060200460 Meyerzon et al. Sep 2006 A1
20060240850 Kaplan Oct 2006 A1
20060271438 Shotland et al. Nov 2006 A1
20060286963 Koskinen et al. Dec 2006 A1
20060286964 Polanski et al. Dec 2006 A1
20060288124 Kraft et al. Dec 2006 A1
20070050372 Boyle Mar 2007 A1
20070060099 Ramer et al. Mar 2007 A1
20070060109 Ramer et al. Mar 2007 A1
20070066295 Wennberg et al. Mar 2007 A1
20070074262 Kikkoji et al. Mar 2007 A1
20070100805 Ramer et al. May 2007 A1
20070140214 Zoltan Jun 2007 A1
20070150388 Mendiratta Jun 2007 A1
20070162328 Reich Jul 2007 A1
20070174124 Zagofsky et al. Jul 2007 A1
20070244750 Grannan et al. Oct 2007 A1
20070271134 Ferry et al. Nov 2007 A1
20080057917 Oria Mar 2008 A1
20080065474 Sharma et al. Mar 2008 A1
20080065491 Bakman Mar 2008 A1
20080103895 Burdick et al. May 2008 A1
20080201731 Howcraft Aug 2008 A1
20080221989 Messer et al. Sep 2008 A1
20080228893 MacDonald et al. Sep 2008 A1
20080249850 Szybalski et al. Oct 2008 A1
20080263460 Altberg et al. Oct 2008 A1
20080306820 Passmore Dec 2008 A1
20090037239 Wong et al. Feb 2009 A1
20090043644 Wilkman Feb 2009 A1
20090106100 Mashinsky Apr 2009 A1
20090199107 Lewis et al. Aug 2009 A1
20090222316 Boinepalli et al. Sep 2009 A1
20090276317 Dixon et al. Nov 2009 A1
20090282052 Evans et al. Nov 2009 A1
20100082401 Vee et al. Apr 2010 A1
20100082439 Patel et al. Apr 2010 A9
20100106606 Filice et al. Apr 2010 A1
20100121694 Bharadwaj et al. May 2010 A1
20100131352 Malhotra et al. May 2010 A1
Foreign Referenced Citations (55)
Number Date Country
2004200332 Jan 2004 AU
1015704 Jul 2005 BE
19941461 Mar 2001 DE
200 08 040 Mar 2005 DE
20008040 Mar 2005 DE
20008040 Mar 2005 DE
1003344 May 2000 EP
1109371 Jun 2001 EP
1182845 Feb 2002 EP
1280087 Jan 2003 EP
1303107 Apr 2003 EP
1320214 Jun 2003 EP
1528827 May 2005 EP
1594287 Nov 2005 EP
1633100 Mar 2006 EP
1772822 Apr 2007 EP
2372867 Sep 2002 GB
2414621 Nov 2005 GB
2002140272 May 2002 JP
WO 9836585 Aug 1998 WO
WO 0052621 Sep 2000 WO
WO 0122748 Mar 2001 WO
WO 0131497 May 2001 WO
WO 0133797 May 2001 WO
WO 0143416 Jun 2001 WO
WO 0144977 Jun 2001 WO
WO 0157705 Aug 2001 WO
WO 0163423 Aug 2001 WO
WO 0165411 Sep 2001 WO
WO 0171949 Sep 2001 WO
WO 0191021 Nov 2001 WO
WO 0230133 Apr 2002 WO
WO 0241178 May 2002 WO
WO 0244989 Jun 2002 WO
WO 02069585 Sep 2002 WO
WO 02071628 Sep 2002 WO
WO 02096026 Nov 2002 WO
WO 02096056 Nov 2002 WO
WO 03015430 Feb 2003 WO
WO 03024136 Mar 2003 WO
WO 03058524 Jul 2003 WO
WO 2003058458 Jul 2003 WO
WO 2003073304 Sep 2003 WO
WO 2004100470 Nov 2004 WO
WO 2005029769 Mar 2005 WO
WO 2005073863 Aug 2005 WO
WO 2006011164 Feb 2006 WO
WO 2006024003 Mar 2006 WO
WO 2006119481 Nov 2006 WO
WO 2006122042 Nov 2006 WO
WO 2007002025 Jan 2007 WO
WO 2007031708 Mar 2007 WO
WO 2007060451 May 2007 WO
WO 2007091089 Aug 2007 WO
WO 20101018584 Feb 2010 WO
Non-Patent Literature Citations (17)
Entry
PCT Written Opinion of the International Searching Authority for PCT/EP2008/052177, dated May 11, 2008, 11 pages.
PCT International Preliminary Report on Patentability for PCT/EP2008/052177, dated Oct. 6, 2009, 12 pages.
ETSI TS 100900 V7.2.0 (Jul. 1999), Digital Cellular Telecommunication System (Phase 2+); Alphabets and language-specific information (GSM 03.38 Version 7.2.0 Release 1998), European Telecommunications Standards Institute 1999.
European Search Report dated May 23, 2008, European Patent Application No. 08101226.
Examination Report under section 18(3), dated Jan. 23, 2009, issued in related UK Application No. GB 0802989.4, 5 pages.
Extended European search Report dated Mar. 17, 2008, European Application No. 08101544.8.
Office Action dated Feb. 18, 2011 issued by the USPTO, Related U.S. Appl. No. 12/288,690, 38 pages.
Office Action dated Mar. 31, 2011, issued in Related U.S. Appl. No. 12/290,140.
Office Action dated Oct. 19, 2010, USPTO in related U.S. Appl. No. 12/290,140, 11 pages.
PCT International Search Report from PCT International, searching Authority dated May 8, 2009 in a related PCT Application No. PCT/EP2009/050144, 4 pages.
U.K. Search Report under Section 17 dated Jun. 4, 2008, U.K. Application No. G80803468.8.
UKIPO Search Report dated May 30, 2008, UK Application No. G80802175.
United Kingdom Search Report dated Sep. 17, 2007, United Kingdom Patent Application No. G80709331.3.
WAG UAProf Version Oct. 20, 2001; Wireless Application Protocol, WAP-248-UAPROF-20011020-a, Wireless Application Protocol Forum, Ltd. (2001); http://www.wapforum.org/what/copyright.htm.
PCT International Search Report for PCT/EP2008/052177 dated May 11, 2008, 5 pages.
International Preliminary Report on Patentability and Written Opinion of the International Searching Authority, dated Nov. 24, 2009 in International Application PCT/WO2008/002897.
International Search Report and Written Opinion of the International Searching Authority (Form PCT/ISA/237), dated Jan. 22, 2009 in related International Application No. PCT/EP2008/057438.
Related Publications (1)
Number Date Country
20160274740 A1 Sep 2016 US
Divisions (1)
Number Date Country
Parent 12019338 Jan 2008 US
Child 13924460 US
Continuations (1)
Number Date Country
Parent 13924460 Jun 2013 US
Child 15069164 US