Patent Application
20090307089
The present invention relates generally to the field of computer applications and, more specifically, to sharing advertisements in a chat environment.
In existing advertising systems, a page requests an advertisement (ad) from an ad server and the server returns an ad from a selection of many ads. The sharing of specific ads in existing systems involves a first user visiting a website. The website requests an ad from the ad server. The ad server returns a random ad, and the first user ‘shares’ the ad with a second user. The advertisement sends the second user a message that contains a URL pointing to the landing page for the ad. When the second user clicks on the link, she sees a different ad than what the first user saw and intended to share with her. The limitation is that the first and second users do not have the same ad experience.
A method and system for sharing advertisements in a chat environment are disclosed. According to one embodiment a computer-implemented method comprises receiving a first request for an advertisement from a first client, providing a first advertisement to the first client, the first client submitting a second request to transmit a reference to the first advertisement to a second client. A third request is received for the first advertisement from the second client and the first advertisement is provided to the second client.
The accompanying drawings, which are included as part of the present specification, illustrate the presently preferred embodiment and together with the general description given above and the detailed description of the preferred embodiment given below serve to explain and teach the principles of the present invention.
A method and system for sharing advertisements in a chat environment are disclosed. According to one embodiment a computer-implemented method comprises receiving a first request for an advertisement from a first client, providing a first advertisement to the first client, the first client submitting a second request to transmit a reference to the first advertisement to a second client. A third request is received for the first advertisement from the second client and the first advertisement is provided to the second client.
Advertising servers provide a way of requesting a specific ad from their category of advertisements (ads). For example, DoubleClick uses key/value pairs and Atlas uses unique IDs. The present system utilizes these existing mechanisms to allow a first user and a second user to see the exact same ad.
According to one embodiment, a first user visits a website hosted by a system. The system requests an ad from an ad server. The ad server returns an ad that contains an id that is unique to the ad. Every ad is given a unique ID when placed on the ad server. Therefore, the ad contains the unique ID when it is returned to the system. The first user clicks ‘Share’ and shares the ad with a second user. The advertisement sends the second user a message with a URL that contains the unique ID. The system extracts the unique id from the advertisement, and sends it to the second user via a URL of the system. The URL points to a landing page of the system that is able to load advertisements by ID.
The second user clicks on the link and lands on a system hosted page. The system requests the ad with the specified ID from the ad server. The system appends the unique ID to the ad tag request. The ad server matches this unique ID with the ads in its database, and returns the ad matching the ID (which is the same one it returned to the first user). Therefore the second user sees the same ad as what the first user viewed and intended to share.
The system displays the advertisement for the second user as soon as it is retrieved from the ad server. According to one embodiment, the system may calculate a charge for each sharing of the advertisement.
In the following description, for purposes of explanation, specific nomenclature is set forth to provide a thorough understanding of the various inventive concepts disclosed herein. However, it will be apparent to one skilled in the art that these specific details are not required in order to practice the various inventive concepts disclosed herein.
Some portions of the detailed descriptions that follow are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. A method is here, and generally, conceived to be a self-consistent process leading to a desired result. The process involves physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
The present method and system also relates to apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general-purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (“ROMs”), random access memories (“RAMs”), EPROMs, EEPROMs, magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.
The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general-purpose systems may be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems will appear from the description below. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the invention as described herein.
A data storage device 127 such as a magnetic disk or optical disc and its corresponding drive may also be coupled to computer system 100 for storing information and instructions. Architecture 100 can also be coupled to a second I/O bus 150 via an I/O interface 130. A plurality of I/O devices may be coupled to I/O bus 150, including a display device 143, an input device (e.g., an alphanumeric input device 142 and/or a cursor control device 141).
The communication device 140 allows for access to other computers (servers or clients) via a network. The communication device 140 may comprise one or more modems, network interface cards, wireless network interfaces or other well known interface devices, such as those used for coupling to Ethernet, token ring, or other types of networks.
User B then requests Ad1 from the ad server by clicking on the URL and subsequently transmitting the Ad1 ID to the ad server 307. The ad server delivers Ad1 to User B 308.
A method and system for sharing advertisements in a chat environment are disclosed. It is understood that the embodiments described herein are for the purpose of elucidation and should not be considered limiting the subject matter of the present embodiments. Various modifications, uses, substitutions, recombinations, improvements, methods of productions without departing from the scope or spirit of the present invention would be evident to a person skilled in the art.
The present application claims the benefit of and priority to U.S. Provisional Patent Application No. 61/059,697 entitled “Sharing Advertisements in a Chat Environment” filed on Jun. 6, 2008, and is hereby, incorporated by reference.
| Number | Date | Country | |
|---|---|---|---|
| 61059697 | Jun 2008 | US |
