This application is U.S. patent application that relies for priority under 35 U.S.C. 119, on Application Serial No. GB0704837.4, filed on Mar. 13, 2007, which is incorporated herein by reference.
The present invention relates to a method and system for ranking search results and is particularly, but not exclusively, suited to providing search results when the delivery of data corresponding to the search results is metered, such as when data are delivered to terminals connected to mobile networks.
The explosive growth of the Internet has resulted in huge numbers of web pages being published. Finding specific information among the billions of pages of information is facilitated by search engines, such as those provided by Google™ and Yahoo™, which use “web crawlers” to locate new or modified web pages. 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.
When a user types in a search word or term, the search engine performs a lookup of the search index and generates a result set of web pages that contain the search term. Web pages within this result set may then be organised in accordance with their respective rankings, and the highest-ranked results displayed to the user.
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. With the advent of widespread deployment of 3G networks, 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.
In accordance with aspects of the present invention, there is provided methods and systems according to the appended claims.
More specifically according to a first aspect there is provided method of generating a search results list in response to a search request, the request comprising one or more search terms, said search terms being held in a storage system arranged to store a plurality of search listings, one or more said search terms, and a bid amount, wherein each search listing is associated with a network location providing access to a set of data, the method comprising:
receiving a search request;
accessing the storage system so as to identify search listings having search terms generating a match with the received search request;
retrieving data indicative of a first bid amount and a network location corresponding to the or each matched search term, the network location providing access to a set of data corresponding to the matched search term;
generating a second bid amount in dependence on the first bid amount and an amount of data associated with the set of data accessible via the network location;
ordering the identified search listings into a search results list in accordance with values corresponding to respective second bid amounts for the identified search listings; and
outputting data indicative of the ordered search result list, said outputted data comprising a plurality of selectable links, each corresponding to a said network location.
In one embodiment a bid amount comprises an amount of resource that a third party is willing to submit so as to ensure that data is accessed from their network location; suitable resources can include money or network resources, such as use of network services for the purposes of delivering data from their network location. The search results list is most preferably ordered so as to present search listings in dependence with sponsored and/or subsidised access to sets of data accessible from respective network locations.
Preferably the method includes generating said second bid amount so as to account for an amount of data corresponding to at least one data item accessible from the network location. In one arrangement the method includes weighting the first bid amount according to the size of at least one data element accessible from the network location, whereby to generate said second bid amount. For example the method can include weighting the first bid amount according to the size of a predetermined number of data elements accessible from the network location, whereby to generate said second bid amount.
In at least one example the set of data includes a link to the network location and the method includes identifying a cost associated with accessing said link and allocating a classification dependent on the identified cost. The classifications can include fully subsidised, partially subsidised and non-subsidised, and the step of ordering the search list further comprises identifying selectable links classified as fully subsidised differently to identifying selectable links classified as partially subsidised and non-subsidised.
Conveniently the ordered list comprises a plurality of portions, each said portion corresponding to one of said classifications, whereby to identify said selectable links in accordance with said classifications.
Additionally or alternatively the set of data includes a link to a further network location, said further network location being accessible via said network location, and the method includes weighting the first bid amount according to the type of said link to the further network location, whereby to generate said second bid amounts. In one example the method further includes identifying a number of said links to the further network location and classifying the or each said link.
Most preferably the method includes identifying costs of transporting data from the network location to a terminal, by means of, for example weighting the first bid amount in accordance with the identified transport costs, whereby to generate said second bid amounts.
Embodiments of the invention are particularly convenient for use in transmitting search results to a terminal connected to a mobile communications network.
In accordance with further aspects of the invention there is provided a distributed system and apparatus for carrying out the method steps described above.
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.
As described above, embodiments of the present invention are concerned with ranking search results for delivery to content providers and/or end users via devices such as mobile terminals. The nature of the ranking process and the criteria relating thereto is described in detail below, but first a description of the infrastructure needed to support some embodiments of the invention will be presented.
The mobile terminals 2, 4 comprise browser programs adapted to locate, and access data from, web sites corresponding to the or each information 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.
The search engine 10 is operable to receive keywords of interest to the users of terminals 2, 4, and, by accessing data stored in the search database 20, to generate a search results list. The search results include, at least in part, entries obtained from and formatted by the results of a bidding process, to be described in detail below. The search results are organised into a list of hypertext links to documents that contain information relevant to these search terms of interest and the search engine 10 transmits this list, for example in the form of a web page, to a specified mobile terminal 2, 4, where it is displayed by the browser running on the mobile terminal.
Turning now to
The authentication software component 301 comprises a firewall, not shown, which is arranged to protect the bid capturing software component 303 and information stored in the search database 20 from unauthorised access. Additional security may be provided via enhancements to the standard communications protocols such as Secure Hyper Text Transfer Protocol (HTTP) or the Secure Sockets Layer (SSL). The bid capturing software component 303 is arranged to process authenticated bids received from an information provider 6a, 6b, 6c. In a preferred embodiment a bid is a request for a URL corresponding to the information provider to be preferentially ranked relative to URLs of other information providers in a list of search results.
As described above, embodiments of the invention are concerned with providing search results to end users either directly to a mobile terminal or indirectly via a content provider. In cases where search results are delivered to mobile devices, transmission of data over wireless networks is chargeable; since the recipient of the data is typically paying for receipt of these data, the amount of data being transmitted is material to the recipient. Thus, embodiments of the invention are arranged to rank search results in dependence on delivery costs to be borne by the subscriber. This might be different to the actual delivery costs, since information providers can frame their bid criteria so as to subsidise delivery of their data to mobile terminals.
Accordingly, the bid criteria submitted by information providers can include two sets of criteria: a first set, applying to delivery of search results to fixed-line terminals, and a second set, applying to delivery of search results over radio networks, being designed to account for transmission charges expected to be levied when a mobile user accesses data from its network location. Alternatively or additionally, there can be a single set of bid criteria, and the storage and/or transmission criteria can be used by the search engine 10 at the time of providing search results to modify the bid amounts.
In either case, when ranking search results, it is assumed that the mobile terminal 2, 4 will click on the link corresponding to any given search result; accordingly the amount that respective information providers are willing to bid for preferential ranking of their network location within the search results is evaluated on the basis of this assumption—i.e. on the basis of the amount of data that will be delivered to the mobile terminal 2, 4 upon selection of the link in the search results.
In one arrangement a bid comprises a plurality of components, including one or more key words of interest, storage characteristics and/or transmission characteristics of the data accessible via the URL and a set of bid criteria. Typical bid criteria include one or more of:
Typical storage characteristics and/or transmission characteristics include one or more of:
These criteria can be specified by a given information provider 6a, 6b, 6c via a form or similar (not shown), and in the case of the storage and/or transmission characteristics, the bid capturing software component 303 can be arranged to download the web page so as to verify, or correct, the submitted data. In addition the portion of the bid which can be used to provide Subsidized Access can be defined by search service provider. These characteristics are preferably combined by the bid capturing software component 303 so as to provide a single measure of the storage characteristics and/or transmission characteristics. In one arrangement the characteristics are combined so as to generate an overall download requirement, as follows:
Download requirement=Size of directly accessible web page+No. inter-web page click-through links*P1+No. external web page click-through links*P2
Where P1 and P2 are probability values indicative of the likelihood of users accessing the click-through links. Many information providers maintain statistics indicative of access to internal and external links, so this information can be provided by the information providers at the time of submitting the storage and/or transmission criteria. Alternatively the bid capturing software component 303 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 data have been verified, the bid capturing software component 303 stores the same in a database record corresponding to the information provider 6a; an example of a suitable schema is shown in
The processes involved in ranking of search results will now be described with reference to
In view of the foregoing comments relating to the parameters used to rank search results—namely access costs—the bid evaluation software component 403 is arranged to identify and combine the various criteria that influence the access costs, as will now be described in more detail. By way of an introductory remark, it will be apparent from inspection of the bid criteria that the actual magnitude of a bid that is submitted for a particular set of keywords may vary per search request received. This is due to the fact that a) the number of information providers that have registered with the search database 20 can vary over time, b) the funds available to a given information provider to place a bid varies over time (since funds get depleted) and c) the data accessible from network locations (thus storage/transmission characteristics) vary over time. This variation is particularly acute in relation to the bid criterion specifying a “lowest acceptable ranked position in a set of search results”, and can be seen from consideration of an example in which the bid criteria specify a lowest acceptable ranked position of “third”. The amount that will be deducted from information provider 6a's account balance will vary as the number of information providers, and their downloadable content, changes, since e.g. the greater the number of information providers that have registered for the keywords “cars, engines, motorbikes”, the greater the amount of resources that will have to be deducted from the information provider 6a's balance to keep information provider 6a listed in third position. In addition, those information providers having resource-heavy web sites will have to bid a significantly greater amount than would information providers having fewer resources to download in order to get higher ranking.
The details of the algorithms used by the bid evaluation software component 403 to account for these various factors will now be described for various information providers that have entries in the search database 20 corresponding to keywords specified in a search request. In a first arrangement, it is assumed that the information providers have submitted a single set of bid criteria, to be applied irrespective of whether the recipient of the search results is a mobile or fixed terminal. It is also assumed that the magnitude and type of data that are downloadable from the corresponding network locations have been specified and verified in the manner described above, so that fields 201, 203, 205, 207 in the search database 20 have been populated in respect of their selected keywords.
Assuming information provider 6a has an overall storage transmission characteristic of 3 MB (2 MB+5 click-through links), and that the provider 6a has specified 1ε per search listing (with no preference in relation to position in the rankings) then the bid evaluation software component evaluates a bid per KB of 1ε/2 MB=0.0003ε/kbyte. As described above, this effectively represents the amount that the sponsor is willing to pay for the mobile terminal 2 to receive data from its network location. Assuming information provider 6b has an overall storage characteristic of 20 kbyte and has specified 0.2ε per search listing, then the amount of subsidy for accessing the network location corresponding to provider 6b is 0.2/20=0.01ε/kbyte; further, assuming information provider 6c has an overall storage transmission characteristic of 120 kbyte (100 kbyte+2 objects) and has specified 0.3ε per search listing, then the amount of subsidy for accessing the network location corresponding to provider 6b is 0.3/120=0.0025ε/kbyte. It can therefore be seen that the effective bids, when ranked in accordance with delivery through a mobile network, result in a ranking of 6b, 6c, 6a, which is quite different to the ranking that applies in respect of delivery solely through fixed networks (6a (1ε), 6c (0.3ε), 6b (0.2ε)).
Operation of the various components of the distributed information system 1 when servicing a search request will now be described with reference to
The foregoing passages assume that all of the information providers listed in the search database 20 have submitted bid criteria when registering via the search broker 8. However, the search database 20 will also hold entries corresponding to information providers that are not interested in paying for a position in a list of search results (and in respect of which the bid criteria is null). Since the query performed at step S5.5 will return all information providers corresponding to the keywords specified in the search request, the message M1 will include entries corresponding to non-paying and paying information providers.
The bid evaluation software component 403 is arranged to receive the message M1 sent from the search database 20, to retrieve data therefrom, and to apply a ranking algorithm, such as the one described above, in respect of each of the paying information providers listed in the message M1 (step S5.7). The output of this ranking process is a list of network locations, each accompanied by a bid/kbyte value. The list generating software component 403 then compiles a list comprising selectable links to network locations corresponding to the information providers, the list being ordered in accordance with the bid/kbyte value, so that the network location corresponding to the highest bid/kbyte value is positioned at the top of the list. In addition, the paying—and ranked—network locations are preferably separated from the non-paying information providers.
Referring to
Accordingly the results page W1 is transmitted to the terminal 2 at step S5.9; assuming the user to select one of the links appearing within the subsidised portion 601 (e.g. information provider 6c), message M2 comprising account identification and the selected URL is transmitted to the search broker 8 (step S5.11). When received, the message M2 is processed by the account updating software component 305 shown in
In the event that the user of the terminal 2 selects a link listed in the non-subsidised portion 603 of the search listings, access to, and retrieval of data from, the web site corresponding thereto will progress in accordance with standard methods and independently of the search broker 8.
It will be noted that
Turning to
In another arrangement the bid criteria 207 specified by any given information provider 6a, 6b, 6c can include data indicative of the amount of money that the information provider is willing to pay so as to cover transmission of data to any given mobile terminal; for example, assuming the bid criteria 207 corresponding to information provider 6a specifies that all delivery costs will be covered, the web page W1″ appears as shown in
Returning to
In each of
Additional Details and Modifications
Whilst in the above embodiments the search engine 10 is described as having access to the storage and/or transmission characteristics in addition to the bid criteria, in an alternative arrangement the distributed information system 1 could include an additional network component, arranged to store the storage and/or transmission characteristics, and to receive search results, ranked in accordance with conventional methods, from the search engine 10, and to then factor in the storage and/or transmission characteristics. Thus in this alternative arrangement the ranking process comprises separate stages, performed at different logical devices, rather than comprising a single integrated process.
As described above, an information provider can store content and/or promotional data, and accordingly can be hosted or sponsored by an advertiser.
The search requests submitted at step S5.1 can be submitted from a terminal other than the one to which the search results are to be delivered; for example, requests could be submitted as part of an automated process, which includes, as one of the input fields, an identifier corresponding to the terminal 2 destined to receive the search results. In addition, search requests could be typed in or entered via speech recognition software.
As described above, each record Ri in the search database 20 corresponding to an information provider can comprise a field relating to an account balance for the information provider. The balance is quantified in terms of resources, which can be money or usage of communications services. The latter type of resource would be particularly convenient for the arrangement in which transportation costs are factored into the ranking process, since communications resources could be directly traded rather than being translated into and out of financial amounts.
In the case where the information provider specifies “free access” and the transport costs are higher than the ε/kbyte associated with the downloaded content, all actual delivery costs will be subtracted from the corresponding account balance field 209 when a given URL is selected.
Whilst in the above embodiments the ranked and categorised search results are delivered to a mobile terminal, the search results could alternatively be transmitted to a search results service, for further processing of the results or delivery thereof to the mobile device.
In addition to the bid criteria described above, the information source can submit data indicative of an overall, or specifically allocated, budget. In addition, whilst it is preferably that the search listings, network location and key words are related, any given information provider can specify a link to a network location that is unrelated to the keywords (e.g. an information source 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 “non-sponsored Link” is to be understood as including (but not limited to) a link to a network location associated with an information source whose ranking in a list of search results is defined purely on the relevance of the content of the web page to key words related thereto and is unrelated to any bid amounts associated therewith.
The term “sponsored link” is to be understood as including (but not limited to) a link to a network location associated with an information source whose ranking in a list of search results is dependent on bid amounts relating to the position of the link in the list of search results. However, in general the term does not refer to subsidizing access to content associated with any of the links listed in the search results.
The term “subsidized access” is to be understood as including (but not limited to) part of the bid amount, the amount of the subsidy being dependent on the parameters available for the purposes of providing subsidised or free access to a network location associated with an information source. In addition the term “subsidized access” can cover, wholly or in part, the costs of associated with accessing data from the network location associated with the information source. The term “bid criteria” is to be understood as including (but not limited to) criteria for use in determining how a bid amount can be used to provide subsidised access to a network location associated with an information source.
The above embodiments are to be understood as illustrative examples of the invention. It is to be understood that any feature described in relation to any one 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.
Number | Date | Country | Kind |
---|---|---|---|
0704837.4 | Mar 2007 | GB | national |
Number | Name | Date | Kind |
---|---|---|---|
5408519 | Pierce et al. | Apr 1995 | A |
5613213 | Naddell et al. | Mar 1997 | A |
5640590 | Luther | Jun 1997 | A |
5697844 | Von Kohorn | Dec 1997 | A |
5892451 | May | Apr 1999 | A |
5978775 | Chen | Nov 1999 | A |
5978833 | Pashley et al. | Nov 1999 | A |
6009458 | Hawkins | Dec 1999 | A |
6023700 | Owens et al. | Feb 2000 | A |
6038591 | Wolfe | Mar 2000 | A |
6043818 | Nakano | Mar 2000 | A |
6097942 | Laiho | Aug 2000 | A |
6205432 | Gabbard | Mar 2001 | B1 |
6212545 | Ohtani et al. | Apr 2001 | B1 |
6222925 | Shiels | Apr 2001 | B1 |
6269361 | Davis et al. | Jul 2001 | B1 |
6334145 | Adams et al. | Dec 2001 | B1 |
6338044 | Cook et al. | Jan 2002 | B1 |
6345279 | Li et al. | Feb 2002 | B1 |
6381465 | Chern et al. | Apr 2002 | B1 |
6389278 | Singh | May 2002 | B1 |
6405243 | Nielsen | Jun 2002 | B1 |
6408309 | Agarwal | Jun 2002 | B1 |
6438557 | Dent | Aug 2002 | B1 |
6516416 | Gregg | Feb 2003 | B2 |
6628247 | Toffolo | Sep 2003 | B2 |
6633318 | Kim | Oct 2003 | B1 |
6646657 | Rouser | Nov 2003 | B1 |
6684249 | Frerichs et al. | Jan 2004 | B1 |
6718551 | Swix et al. | Apr 2004 | B1 |
6816724 | Asikainen | Nov 2004 | B1 |
6826572 | Colace et al. | Nov 2004 | B2 |
6920326 | Agarwal et al. | Jul 2005 | B2 |
7035812 | Meisel et al. | Apr 2006 | B2 |
7058696 | Phillips et al. | Jun 2006 | B1 |
7072947 | Knox et al. | Jul 2006 | B1 |
7136903 | Phillips et al. | Nov 2006 | B1 |
7149537 | Kupsh et al. | Dec 2006 | B1 |
7174309 | Niwa | Feb 2007 | B2 |
7181415 | Blaser et al. | Feb 2007 | B2 |
7188085 | Pelletier | Mar 2007 | B2 |
7222105 | Romansky | May 2007 | B1 |
7225342 | Takao | May 2007 | B2 |
7296158 | Staddon | Nov 2007 | B2 |
7328343 | Caronni | Feb 2008 | B2 |
7360084 | Hardjono | Apr 2008 | B1 |
7383329 | Erickson | Jun 2008 | B2 |
7383586 | Cross et al. | Jun 2008 | B2 |
7455590 | Hansen | Nov 2008 | B2 |
7457946 | Hind | Nov 2008 | B2 |
7492371 | Jeffrey | Feb 2009 | B2 |
7558559 | Alston | Jul 2009 | B2 |
7581101 | Ahtisaari | Aug 2009 | B2 |
7690026 | Zhu | Mar 2010 | B2 |
7882543 | Mousseau | Feb 2011 | B2 |
8346709 | Silverman et al. | Jan 2013 | B2 |
20010042017 | Matsukawa | Nov 2001 | A1 |
20010047272 | Frietas et al. | Nov 2001 | A1 |
20010051925 | Dong-seok | Dec 2001 | A1 |
20020002510 | Sharp | Jan 2002 | A1 |
20020004413 | Inoue | Jan 2002 | A1 |
20020004743 | Kutaragi | Jan 2002 | A1 |
20020006803 | Mendiola et al. | Jan 2002 | A1 |
20020016736 | Cannon et al. | Feb 2002 | A1 |
20020019829 | Shapiro | Feb 2002 | A1 |
20020052754 | Joyce | May 2002 | A1 |
20020059379 | Harvey | May 2002 | A1 |
20020061743 | Hutcheson | May 2002 | A1 |
20020073210 | Low et al. | Jun 2002 | A1 |
20020075305 | Beaton et al. | Jun 2002 | A1 |
20020077130 | Owensby | Jun 2002 | A1 |
20020078006 | Shteyn | Jun 2002 | A1 |
20020082923 | Merriman et al. | Jun 2002 | A1 |
20020083411 | Bouthors et al. | Jun 2002 | A1 |
20020095330 | Berkowitz et al. | Jul 2002 | A1 |
20020111177 | Castres | Aug 2002 | A1 |
20020128029 | Nishikawa | Sep 2002 | A1 |
20020137507 | Winkler | Sep 2002 | A1 |
20020138291 | Vaidyanathan et al. | Sep 2002 | A1 |
20020141403 | Akahane | Oct 2002 | A1 |
20020164962 | Mankins | Nov 2002 | A1 |
20020174430 | Ellis | Nov 2002 | A1 |
20020183045 | Emmerson | Dec 2002 | A1 |
20030003929 | Himmel et al. | Jan 2003 | A1 |
20030003935 | Vesikivi et al. | Jan 2003 | A1 |
20030037068 | Thomas | Feb 2003 | A1 |
20030040297 | Pecen et al. | Feb 2003 | A1 |
20030040300 | Bodic et al. | Feb 2003 | A1 |
20030064757 | Yamadera et al. | Apr 2003 | A1 |
20030083108 | King | May 2003 | A1 |
20030101126 | Cheung et al. | May 2003 | A1 |
20030126015 | Chan et al. | Jul 2003 | A1 |
20030130887 | Nathaniel | Jul 2003 | A1 |
20030144022 | Hatch | Jul 2003 | A1 |
20030154300 | Mostafa | Aug 2003 | A1 |
20030163369 | Arr | Aug 2003 | A1 |
20030182567 | Barton et al. | Sep 2003 | A1 |
20030185356 | Katz | Oct 2003 | A1 |
20030188017 | Nomura | Oct 2003 | A1 |
20030191689 | Bosarge et al. | Oct 2003 | A1 |
20030195039 | Orr | Oct 2003 | A1 |
20030197719 | Lincke et al. | Oct 2003 | A1 |
20030203731 | King | Oct 2003 | A1 |
20030220866 | Pisaris-Henderson et al. | Nov 2003 | A1 |
20040003398 | Donian et al. | Jan 2004 | A1 |
20040032393 | Brandenberg | Feb 2004 | A1 |
20040032434 | Pinsky et al. | Feb 2004 | A1 |
20040043777 | Brouwer et al. | Mar 2004 | A1 |
20040043790 | Ben-David | Mar 2004 | A1 |
20040045029 | Matsuura | Mar 2004 | A1 |
20040045030 | Reynolds | Mar 2004 | A1 |
20040054576 | Kanerva et al. | Mar 2004 | A1 |
20040063449 | Fostick | Apr 2004 | A1 |
20040068460 | Feeley et al. | Apr 2004 | A1 |
20040092248 | Kelkar | May 2004 | A1 |
20040093289 | Bodin | May 2004 | A1 |
20040136358 | Hind et al. | Jul 2004 | A1 |
20040137987 | Nguyen | Jul 2004 | A1 |
20040143667 | Jerome | Jul 2004 | A1 |
20040152518 | Kugo | Aug 2004 | A1 |
20040185883 | Rukman | Sep 2004 | A1 |
20040186789 | Nakashima | Sep 2004 | A1 |
20040192359 | McRaild et al. | Sep 2004 | A1 |
20040198403 | Pedersen | Oct 2004 | A1 |
20040203761 | Baba et al. | Oct 2004 | A1 |
20040203851 | Vetro et al. | Oct 2004 | A1 |
20040204133 | Andrew et al. | Oct 2004 | A1 |
20040204145 | Nagatomo | Oct 2004 | A1 |
20040209649 | Lord | Oct 2004 | A1 |
20040215793 | Ryan | Oct 2004 | A1 |
20040233224 | Ohba | Nov 2004 | A1 |
20040240649 | Goel | Dec 2004 | A1 |
20040240861 | Yeend | Dec 2004 | A1 |
20040259526 | Goris et al. | Dec 2004 | A1 |
20050010641 | Staack | Jan 2005 | A1 |
20050018853 | Lain et al. | Jan 2005 | A1 |
20050021395 | Luu | Jan 2005 | A1 |
20050033700 | Vogler | Feb 2005 | A1 |
20050050208 | Chatani | Mar 2005 | A1 |
20050060425 | Yeh et al. | Mar 2005 | A1 |
20050086105 | McFadden et al. | Apr 2005 | A1 |
20050086697 | Haseltine | Apr 2005 | A1 |
20050091381 | Sunder | Apr 2005 | A1 |
20050119936 | Buchanan | Jun 2005 | A1 |
20050125397 | Gross et al. | Jun 2005 | A1 |
20050138369 | Lebovitz | Jun 2005 | A1 |
20050216341 | Agarwal | Sep 2005 | A1 |
20050228680 | Malik | Oct 2005 | A1 |
20050239504 | Ishii et al. | Oct 2005 | A1 |
20050249216 | Jones | Nov 2005 | A1 |
20050273465 | Kimura | Dec 2005 | A1 |
20050289113 | Bookstaff | Dec 2005 | A1 |
20060031164 | Kim | Feb 2006 | A1 |
20060031327 | Kredo | Feb 2006 | A1 |
20060037039 | Aaltonen | Feb 2006 | A1 |
20060048059 | Etkin | Mar 2006 | A1 |
20060059044 | Chan et al. | Mar 2006 | A1 |
20060059495 | Spector | Mar 2006 | A1 |
20060068845 | Muller et al. | Mar 2006 | A1 |
20060075019 | Donovan et al. | Apr 2006 | A1 |
20060075425 | Koch et al. | Apr 2006 | A1 |
20060095511 | Munarriz et al. | May 2006 | A1 |
20060106936 | De Luca | May 2006 | A1 |
20060117378 | Tam et al. | Jun 2006 | A1 |
20060123014 | Ng | Jun 2006 | A1 |
20060129455 | Shah | Jun 2006 | A1 |
20060135232 | Willis | Jun 2006 | A1 |
20060141923 | Goss | Jun 2006 | A1 |
20060155732 | Momose | Jul 2006 | A1 |
20060168616 | Candelore | Jul 2006 | A1 |
20060194595 | Myllynen et al. | Aug 2006 | A1 |
20060200460 | Meyerzon et al. | Sep 2006 | A1 |
20060200461 | Lucas et al. | Sep 2006 | A1 |
20060204601 | Palu | Sep 2006 | A1 |
20060206586 | Ling et al. | Sep 2006 | A1 |
20060229941 | Gupta | Oct 2006 | A1 |
20060242129 | Libes et al. | Oct 2006 | A1 |
20060276170 | Radhakrishnan et al. | Dec 2006 | A1 |
20060276213 | Gottschalk et al. | Dec 2006 | A1 |
20060282328 | Gerace et al. | Dec 2006 | A1 |
20060286963 | Koskinen et al. | Dec 2006 | A1 |
20060286964 | Polanski et al. | Dec 2006 | A1 |
20060288124 | Kraft et al. | Dec 2006 | A1 |
20070003064 | Wiseman | Jan 2007 | A1 |
20070004333 | Kavanti | Jan 2007 | A1 |
20070047523 | Jiang | Mar 2007 | A1 |
20070055439 | Denker | Mar 2007 | A1 |
20070055440 | Denker | Mar 2007 | A1 |
20070061568 | Lee | Mar 2007 | A1 |
20070072631 | Mock et al. | Mar 2007 | A1 |
20070074262 | Kikkoji et al. | Mar 2007 | A1 |
20070083602 | Heggenhougen et al. | Apr 2007 | A1 |
20070088687 | Bromm et al. | Apr 2007 | A1 |
20070088801 | Levkovitz et al. | Apr 2007 | A1 |
20070088851 | Levkovitz et al. | Apr 2007 | A1 |
20070100805 | Ramer et al. | May 2007 | A1 |
20070105536 | Tingo, Jr. | May 2007 | A1 |
20070106899 | Suzuki | May 2007 | A1 |
20070113243 | Brey | May 2007 | A1 |
20070117571 | Musial | May 2007 | A1 |
20070149208 | Syrbe et al. | Jun 2007 | A1 |
20070157247 | Cordray et al. | Jul 2007 | A1 |
20070202922 | Myllynen | Aug 2007 | A1 |
20070204061 | Chen | Aug 2007 | A1 |
20070239527 | Nazer et al. | Oct 2007 | A1 |
20070255614 | Ourednik et al. | Nov 2007 | A1 |
20070290787 | Fiatal et al. | Dec 2007 | A1 |
20080004046 | Mumick et al. | Jan 2008 | A1 |
20080013537 | Dewey et al. | Jan 2008 | A1 |
20080032703 | Krumm et al. | Feb 2008 | A1 |
20080032717 | Sawada et al. | Feb 2008 | A1 |
20080057917 | Oria | Mar 2008 | A1 |
20080070579 | Kankar et al. | Mar 2008 | A1 |
20080071875 | Koff et al. | Mar 2008 | A1 |
20080082686 | Schmidt et al. | Apr 2008 | A1 |
20080123856 | Won | May 2008 | A1 |
20080130547 | Won | Jun 2008 | A1 |
20080132215 | Soderstrom | Jun 2008 | A1 |
20080195468 | Malik | Aug 2008 | A1 |
20080243619 | Sharman et al. | Oct 2008 | A1 |
20080294523 | Little | Nov 2008 | A1 |
20080301303 | Matsuoka | Dec 2008 | A1 |
20090088554 | Shkedi | Jul 2009 | A1 |
20090275315 | Alston | Nov 2009 | A1 |
20110022475 | Inbar et al. | Jan 2011 | A1 |
20110258039 | Patwa et al. | Oct 2011 | A1 |
20110258049 | Ramer et al. | Oct 2011 | A1 |
20110282739 | Mashinsky et al. | Nov 2011 | A1 |
Number | Date | Country |
---|---|---|
1015704 | Jul 2005 | BE |
19941461 | Mar 2001 | DE |
10061984 | Jun 2002 | DE |
0831629 | Mar 1998 | EP |
1043905 | Oct 2000 | EP |
1073293 | Jan 2001 | EP |
1083504 | Mar 2001 | EP |
1107137 | Jun 2001 | EP |
1109371 | Jun 2001 | EP |
1195701 | Apr 2002 | EP |
1220132 | Jul 2002 | EP |
1239392 | Sep 2002 | EP |
1280087 | Jan 2003 | EP |
1320214 | Jun 2003 | EP |
1365604 | Nov 2003 | EP |
1408705 | Apr 2004 | EP |
1455511 | Sep 2004 | EP |
1509024 | Feb 2005 | EP |
1528827 | May 2005 | EP |
1542482 | Jun 2005 | EP |
1587332 | Oct 2005 | EP |
1615455 | Jan 2006 | EP |
1633100 | Mar 2006 | EP |
1677475 | Jul 2006 | EP |
1772822 | Apr 2007 | EP |
2369218 | May 2002 | GB |
2372867 | Sep 2002 | GB |
2380364 | Apr 2003 | GB |
2386509 | Sep 2003 | GB |
2406996 | Apr 2005 | GB |
2414621 | Nov 2005 | GB |
2416887 | Feb 2006 | GB |
2424546 | Sep 2006 | GB |
2002140272 | May 2002 | JP |
2007087138 | Apr 2007 | JP |
2007199821 | Aug 2007 | JP |
8910610 | Nov 1989 | WO |
9624213 | Aug 1996 | WO |
0044151 | Jul 2000 | WO |
0070848 | Nov 2000 | WO |
0122748 | Mar 2001 | WO |
0131497 | May 2001 | WO |
0144977 | Jun 2001 | WO |
0150703 | Jul 2001 | WO |
0152161 | Jul 2001 | WO |
0157705 | Aug 2001 | WO |
0158178 | Aug 2001 | WO |
0163423 | Aug 2001 | WO |
0165411 | Sep 2001 | WO |
0169406 | Sep 2001 | WO |
0171949 | Sep 2001 | WO |
0172063 | Sep 2001 | WO |
0191400 | Nov 2001 | WO |
0193551 | Dec 2001 | WO |
0197539 | Dec 2001 | WO |
0209431 | Jan 2002 | WO |
0223489 | Mar 2002 | WO |
0231624 | Apr 2002 | WO |
0235324 | May 2002 | WO |
0244989 | Jun 2002 | WO |
0250632 | Jun 2002 | WO |
02054803 | Jul 2002 | WO |
02069585 | Sep 2002 | WO |
02069651 | Sep 2002 | WO |
02075574 | Sep 2002 | WO |
02084895 | Oct 2002 | WO |
02086664 | Oct 2002 | WO |
02096056 | Nov 2002 | WO |
WO 02091238 | Nov 2002 | WO |
02100121 | Dec 2002 | WO |
03015430 | Feb 2003 | WO |
03019845 | Mar 2003 | WO |
03019913 | Mar 2003 | WO |
03024136 | Mar 2003 | WO |
03049461 | Jun 2003 | WO |
03088690 | Oct 2003 | WO |
2004057578 | Jul 2004 | WO |
2004084532 | Sep 2004 | WO |
2004086791 | Oct 2004 | WO |
2004093044 | Oct 2004 | WO |
2004100470 | Nov 2004 | WO |
2004100521 | Nov 2004 | WO |
2004102993 | Nov 2004 | WO |
2004104867 | Dec 2004 | WO |
2005020578 | Mar 2005 | WO |
2005029769 | Mar 2005 | WO |
2005073863 | Aug 2005 | WO |
2005076650 | Aug 2005 | WO |
2006002869 | Jan 2006 | WO |
2006005001 | Jan 2006 | WO |
2006016189 | Feb 2006 | WO |
2006024003 | Mar 2006 | WO |
2006027407 | Mar 2006 | WO |
2006040749 | Apr 2006 | WO |
2006093284 | Sep 2006 | WO |
WO 2006104895 | Oct 2006 | WO |
2006119481 | Nov 2006 | WO |
2007001118 | Jan 2007 | WO |
2007002025 | Jan 2007 | WO |
2007060451 | May 2007 | WO |
2007091089 | Aug 2007 | WO |
2008013437 | Jan 2008 | WO |
2008024852 | Feb 2008 | WO |
2008045867 | Apr 2008 | WO |
2008147919 | Dec 2008 | WO |
2009088554 | Jul 2009 | WO |
Entry |
---|
International Search Report and Written Opinion of the International Search Authority dated May 8, 2008 for International Patent Application No. PCT/EP2008/051229. |
European Search Report dated Apr. 18, 2008 for European Patent Application No. 08101188.4. |
“Baugher et al”, The Secure Real-Time Transport Protocol (SRTP) , Mar. 2004, Network Working Group Request for Comments:3711, p. 1-53. |
“Communication Pursuant to Article 94(3) EPC dated Oct. 19, 2009”, European Patent Application No. 08 153 258.2 (5 pages). |
“Communication Pursuant to Article 94(3) EPC dated Feb. 10, 2009”, European Patent Office in related European Patent Application No. 07 118 601.9 (3 pages). |
“Communication Pursuant to Article 94(3) EPC issued Jun. 25, 2009”, European Patent Application No. 08 159 331.1 (3 pages). |
“Digital Rights Management in the Mobile Environment”, Y.Raivio &S. Luukkainen, Proceedings of the International Conference on E-Business and Telecommunication, ICETE 2006, Aug. 7, 2006. |
“DRM Architecture Approved Version 2.0”, OMA-AD-DRM-V2—0-20060303-A (Open Mobile Alliance, Ltd.), Mar. 3, 2006. |
“English translation of First Office Action issued by State Intellectual Property Office of People's Republic of China”, Chinese Applicatio No. 200480033236.X (8 pages), Dec. 4, 2009. |
“English Translation of First Office Action issued by the Chinese Patent Office”, Chinese Application No. 200480019404.X, Aug. 19, 2008. |
“European Examination Report dated Nov. 3, 2008”, European Patent Application EP 08159333.7. |
“European Examination Report dated Nov. 3, 2008”, European Patent Application No. EP 08159331.1. |
“European Search Report Nov. 5, 2008”, European Patent Application No. EP 08159331.1. |
“European Search Report dated Nov. 5, 2008”, European Patent Application No. EP 08159333.7. |
“European Search Report dated Apr. 7, 2010”, European Patent Application No. EP 10153358.6 (6 pages). |
“European Search Report dated Jul. 18, 2008”, European Patent Office in related EPO Application No. 08 15 3658. |
“European Search Report dated Jul. 18, 2008”, European Patent Office in related EPO Application No. EP 08 15 3656. |
“European Search Report dated Jul. 22, 2008”, European Patent Office in related EPO Application No. EP 08153651.8. |
“European Search Report dated Jul. 23, 2008”, European Patent Office in related EPO Application No. EP 08153654.2. |
“European Search Report dated Mar. 19, 2008”, European Patent Office in counterpart European Application No. EP 07 11 8601. |
“Extended European Search Report dated Dec. 2, 2008”, European Patent Office in counterpart EPO Application No. EP 07120620.5. |
“Extended European Search Report dated Dec. 29, 2008”, European Patent Office in counterpart EPO Application EP 07120480.4. |
“Ghassan Chaddoud et al.”, Dynamic Group Communication Security, pp. 49-56, IEEE 2001, 2001. |
“International Search Report and Written Opinion of the International Searching Authority”, International Application PCT/EP2008/054911, Nov. 11, 2008. |
“International Search Report for International Application”, PCT/FI2006/050467, dated Jul. 25, 2007. |
“International Search Report in PCT Application No. PCT/GB2004/003890”, Apr. 5, 2005. |
“Office Action (Notice of Allowance)”, USPTO dated Jun. 11, 2009 in U.S. Appl. No. 12/079,312 (5 pages). |
“Office Action dated Jan. 28, 2009 in U.S. Appl. No. 10/571,709”. |
“Office Action dated Mar. 22, 2010”, U.S. Appl. No. 12/431,961 (19 pages). |
“Office Action dated Apr. 6, 2009 in related U.S. Appl. No. 12/156,335 (17 pages)”. |
“Office Action dated Jun. 21, 2010”, U.S. Appl. No. 10/555,543 (17 pages). |
“Office Action dated Apr. 6, 2009”, U.S. Appl. No. 10/555,543 (14 pages). |
“Office Action dated Apr. 9, 2009”, U.S. Appl. No. 12/002,452 (20 pages). |
“Office Action dated Feb. 5, 2009”, U.S. Appl. No. 12/079,312 (12 pages). |
“Office Action dated Mar. 9, 2011”, Issued in related U.S. Appl. No. 12/477,766 (27 pages). |
“Office Action from British Intellectual Property Office”, British Application No. GB0712281.5 (5 pages), Oct. 9, 2008. |
“Office Action issued Apr. 22, 2010”, U.S. Appl. No. 12/156,335 (16 pages), Apr. 22, 2010. |
“Office Action issued by USPTO dated Nov. 20, 2009”, U.S. Appl. No. 10/571,709 (20 pages). |
“Office Action issued from the USPTO dated Nov. 4, 2010”, U.S. Appl. No. 12/431,961 (21 pages). |
“Office Action issued from the USPTO dated Aug. 14, 2009”, U.S. Appl. No. 12/431,961 (12 pages). |
“Office Action issued from the USPTO dated Sep. 23, 2009”, U.S. Appl. No. 12/156,335 (26 pages). |
“Office Action issued from USPTO”, in related U.S. Appl. No. 10/555,543 (19 pages), Oct. 20, 2009. |
“Office Action Issued from USPTO dated Oct. 5, 2009”, U.S. Appl. No. 10/571,709 (26 pages). |
“Office Action Issued Jan. 12, 2011 by the USPTO”, U.S. Appl. No. 12/484,454 (10 pages). |
“Office Action Issued Mar. 29, 2011 by the USPTO”, U.S. Appl. No. 10/555,543 (17 pages). |
“Office Action Mar. 24, 2009”, U.S. Appl. No. 12/156,335. |
“Official Action from the European Patent Office dated Apr. 1, 2009”, European Application No. 08 717 428.0 (4 pages). |
“PCT International Preliminary Report on Patentability and Written Opinion”, Issued by the International Bureau of WIPO, PCT/EP2008/054911 dated Oct. 27, 2009 (1 page). |
“PCT International Search Report (Form PCT/ISA/210)”, International Application PCT/EP2008/052678, Jul. 4, 2008. |
“PCT International Search Report issued by PCT International Searching Authority”, International Searching Authority in connection with the related PCT International Application No. PCT/NL2004/000335 (2 pages), Sep. 24, 2004. |
“Schulzrinne et al, “RTP: A Transport Protocol for Real-Time Applications””, Network Working Group Request for Comments: 3550, p. 1-98, Jul. 1, 2003. |
“Search Report under Section 17 dated May 20, 2008”, British Patent Office in counterpart UK Application No. GB0807153.2. |
“Text of Second Office Action (English Translation)”, Jun. 12, 2009 in corresponding Chinese Patent Application No. 200480019404.X (2 pages). |
“U.K. Combined Search and Examination Report under Sections 17 and 18(3)”, U.K. Application No. GB0802177.6, May 13, 2008. |
“U.K. Further Search Report under Section 17”, U.K. Application No. GB0710853.3, Dec. 5, 2007. |
“U.K. Patent Office Examination Report under Section 18(3)”, U.K. Application No. GB0315984.5, Mar. 29, 2006. |
“U.K. Search Report under Section 17”, U.K. Application No. GB0710853.3, Oct. 3, 2007. |
“U.K. Search Report under Section 17 dated Mar. 3, 2005”, U.K Application No. GB0420339.4, Mar. 3, 2005. |
“United Kingdom Search Report under Section 17”, GB 0712281.5 (2 pages), Oct. 24, 2007. |
“Wallner et al, “Key Management for Multicast: Issues and Architectures””, Jun. 1999, National Security Agency Networking Group Request for Comments: 2627, p. 1-22 (22 pages), Jun. 1, 1999. |
Levine, Robert , “New Model for Sharing: Free Music with Ads”, The New York Times (On-Line Edition), Apr. 23, 2007. |
Number | Date | Country | |
---|---|---|---|
20080228758 A1 | Sep 2008 | US |