This application claims the benefit of and priority to U.S. patent application Ser. No. 10/990,560, filed Nov. 16, 2004 entitled “Serving Content from an Off-Line Peer Server in a Photosharing Peer-To-Peer Network in Response to a Guest Request”, the disclosure of which is incorporated herein by reference as if set forth in its entirety.
The present invention generally relates to the sharing of digital images over a network, and more particularly to the sharing of digital images stored on peer computers in a photosharing peer-to-peer network.
Over the past several years, photosharing has become widely accepted by photo enthusiasts. Many websites currently exist that allow users to upload digital images to the site for storage on a server and for viewing by others over the Internet. Oftentimes, images are grouped to form an album web page so that the user can invite others to view the album web page, as opposed to each individual image.
This approach to photosharing, however, presents some disadvantages. In particular, users are required to upload digital images to a site, which can be time consuming. Moreover, the site may require extensive storage capacity to store the images of all the users, which can become expensive.
To address these concerns, the assignee of the present invention has developed a web-based peer-to-peer (P2P) photosharing system in which all workstations and computers (peers) in the network store images locally and act as servers to other users on the network. A central site accessible by all the peers provides additional functionality, such as coordinating the peers, providing search capabilities for the peers, purchase order fulfillment, etc.
Each peer 24 stores album web pages and associated images locally in a database. Each photo album web page is associated with a descriptor that includes information about the photo album, such as which images are included in the photo album and who is permitted to see the photo album. For example, if the photo album is private, only the owner is allowed to view the photo album; if the photo album is “public,” then everyone can access the photo album; and if the photo album is “restricted,” then the photo album is accessible only to selected users. In this case, the descriptor includes an access list. The descriptor for each photo album web page is stored in a database (not shown) in a respective peer 24.
When a peer 24 receives a request (via the proxy server 36) to access a photo album web page from either another peer 24 or a visiting computer 32, the peer 24 accesses its database to retrieve the descriptor associated with the requested photo album web page. From the descriptor, the peer 24 determines whether the requestor (e.g., peer user or user of the visiting computer) is permitted to access the photo album and determines which images are in the photo album web page. If the access is authorized, the peer 24 returns the photo album web page, which contains embedded images representing each of the photo album images.
Upon receipt of a photo album web page, the requestor's browser 30 interprets the web page and then initiates separate requests for each embedded image therein. When the peer 24 receives the request for the image, it accesses the database again to retrieve the descriptor for the photo album page in which the requested image resides to ensure: (1) that the requested image is actually in the associated photo album page; and (2) that the requestor has permission to access the photo album page and its contents, i.e., images.
One problem with routing images through the proxy server 36 is that it may require extra bandwidth. That is, the image must be moved twice; once from the peer server 24 to the proxy server 36, and then a second time from the proxy server 36 to the visiting computer 32. In addition, the path from a peer server 24 to the proxy server 26 generally has the longest latency because the peer server 24 is typically hosted in a user's home equipped with a cable modem or DSL that has an uplink speed much slower than the downlink speed. Thus, users may experience a significant delay when viewing images that are routed through the proxy server 36 due to the bandwidth limitations between a peer server 24 and the proxy server 36.
In addition, because peer servers 24 may be hosted in a variety of environments and host computers, there may be situations where the network to which a peer server 24 belongs may go off-line or the peer server 24 needs to go off-line for maintenance. It is also possible that a peer server 24 is a mobile system, such as a laptop or tablet PC, which goes in and out of network service. All of these issues would cause the peer server 24 to disconnect from the proxy server 26 and stop serving guest requests. In this situation, the requesting guest would fail to receive the requested content from the off-line peer server 24. There may be situations where a peer host computer needs to be off-line for a significant period of time (for example a laptop user), but the peer owner desires guests to be able to access shared images seamlessly.
In view of the above discussion, systems, methods, and computer program products for synchronizing digital photo albums at one or more peer servers with a proxy server and a guest content server in a photosharing peer-to-peer network are provided such that the proxy server and guest content server can serve content to requesters from photo albums of an off-line peer server. According to embodiments of the present invention, a synchronization manager receives a request from a peer server to synchronize image files of one or more photo albums at the peer server with image files cached on the proxy server. The request includes a URL for each photo album to be synchronized. The synchronization manager directs a web robot to crawl the URL of each photo album identified in the request and to identify image files at the peer server that have been modified and/or that are not currently cached on the proxy server. The web robot retrieves identified image files from the peer server and caches the retrieved image files on the proxy server. The web robot also identifies non-image files associated with each modified image file or with each image file not currently cached on the proxy server. The web robot retrieves the identified non-image files, stores the retrieved non-image files in a holding pen, and then caches the stored non-image files on the guest content server when all non-image files associated with a respective photo album have been stored.
The present invention now will be described more fully hereinafter with reference to the accompanying drawings, in which illustrated embodiments of the invention are shown. This invention may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art. Like numbers refer to like elements throughout.
As used herein, the singular forms “a,” “an,” and “the” are intended to include the plural forms as well, unless expressly stated otherwise. It will be further understood that the terms “includes,” “comprises,” “including,” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. It will be understood that when an element is referred to as being “connected” or “coupled” to another element, it can be directly connected or coupled to the other element or intervening elements may be present. Furthermore, “connected” or “coupled” as used herein may include wirelessly connected or coupled. As used herein, the term “and/or” includes any and all combinations of one or more of the associated listed items.
It will also be understood that, although the terms first, second, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first peer device could be termed a second peer device, and, similarly, a second peer device could be termed a first peer device without departing from the teachings of the disclosure.
The present invention may be embodied as systems, methods, and/or computer program products. Accordingly, the present invention may be embodied in hardware and/or in software (including firmware, resident software, micro-code, etc.). Furthermore, the present invention may take the form of a computer program product on a computer-usable or computer-readable storage medium having computer-usable or computer-readable program code embodied in the medium for use by or in connection with an instruction execution system. In the context of this document, a computer-usable or computer-readable medium may be any medium that can store the program for use by or in connection with the instruction execution system, apparatus, or device.
The computer-usable or computer-readable medium may be, for example but not limited to, an electronic, magnetic, optical, electromagnetic or infrared device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: a portable computer diskette, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), and a portable compact disc read-only memory (CD-ROM).
The present invention is described herein with reference to flowchart and/or block diagram illustrations of methods, systems, and devices in accordance with exemplary embodiments of the invention. It will be understood that each block of the flowchart and/or block diagram illustrations, and combinations of blocks in the flowchart and/or block diagram illustrations, may be implemented by computer program instructions and/or hardware operations. These computer program instructions may be provided to a processor of a general purpose computer, a special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer usable or computer-readable memory that may direct a computing device (such as a computer or other programmable data processing apparatus) to function in a particular manner, such that the instructions stored in the computer usable or computer-readable memory produce an article of manufacture including instructions that implement the function specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions that execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart and/or block diagram block or blocks.
Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
As used herein, a peer server, proxy server, and visiting computer may be any computing device including, but not limited to, PCs, workstations, mobile phones, and PDAs, with components necessary for executing the appropriate software. Also, in an embodiment of the present invention, the physical communications network is the Internet, although any type of network could be used.
As used herein, the terms “album”, “photo album”, and “web album” are interchangeable.
Each web photo album 56 may include one or more web pages and is associated with a descriptor 58 that includes information about the state of the peer and the web pages comprising the web photo album. The descriptor 58 may include an identification of the peer server 42, the number and identity of the images 48 included in the web pages, access privileges for the photo album and for each image 48 therein, and any metadata that is not stored in the images 48. The access privileges may indicate whether the photo album 56 is private, public, or restricted. If the photo album 56 is “private,” then only the owner is allowed to view the photo album; if the photo album 56 is “public,” then everyone can access the photo album 56; and if the photo album 56 is “restricted,” then the photo album 56 is accessible only to selected users. In this case, the descriptor 58 includes an access list. The descriptor 58 for each web photo album 56 is stored in the database 46 in the peer 42. In an alternative embodiment, the database 46 may maintain a descriptor 58 for each web page in the photo album 56.
The proxy server 40 acts as a proxy for the distributed peer servers 42, which have a pre-established connection to the proxy server 40. The proxy server 40 enables a firewall-protected peer server 42 to enable incoming generic HTTP access by establishing an outbound connection from the firewall-protected peer server 42 with the proxy server 40. Incoming Web traffic for the firewall-protected peer server 42 is then directed to the proxy server 40. The proxy server 40 multiplexes the Web traffic using a proprietary protocol to the peer server 42, thus enabling generic web traffic to flow to the peer server 42 despite the presence of a firewall (not shown). In the case where there are multiple firewall-protected peer servers 42, the proxy server 40 acts as a switchboard to receive and dispatch the incoming HTTP requests to the appropriate peer servers 42. A process for providing Web browsing through a firewall in a peer-to-peer network is described further in U.S. patent application Ser. No. 10/813,839, which is incorporated herein by reference in its entirety.
According to embodiments of the present invention, images 48 stored on the peer server 42 that are requested for viewing by a visiting computer 32, are stored in a cache 52 on the proxy server 40 either before or after the first time the image is requested. In addition, the peer-to-peer photo sharing network is provided with a guest content server 62 that is coupled to both the proxy server 40 and the peer server 42. The guest content server 62 is provided with the same guest service component 60 on the peer server 42 so that the guest content server 62 can fulfill requests to view content on the peer server 42 when the peer server 42 is unavailable. Although the embodiment shown in
In response to a request from a visiting computer 32 to view content stored in the peer server 42 via the proxy server 40, the request is fulfilled in step 96 by forwarding the web photo album 56′ from the guest content server 62 to the visiting computer 32, and by forwarding the images 48′ associated with the web photo album 56′ from the proxy server 40 to the visiting computer 32, thereby successfully serving content from the peer server 42 even when the peer server 42 is off-line.
In step 154, when the guest content server 62 receives the request to access a photo album 56 from the peer server 42, the guest service component 60′ accesses the database 64 to retrieve the descriptor 58′ associated with the requested photo album 56′. From the descriptor 58′, the guest service component 60′ determines whether the requestor (e.g., user of the visiting computer) is permitted to access the photo album 56′ and which images 48′ are in the web photo album pages. If the access is authorized, then the guest service component 60′ retrieves from the database 64 captions, order information, and links to embedded images, and constructs the requested web photo album 56′. In step 156, the guest service component 60′ returns to the proxy server 40 the constructed web photo album.
In step 158, the proxy server 40 receives the constructed web photo album and pulls out the specified images 48′ from cache 52. In step 160 the proxy server 40 returns the web photo album 56′ and images 40′ to the requesting browser 30. In an alternative embodiment, the constructed web photo album is forwarded to the guest browser 30, and the guest browser 30 makes requests to the proxy server 40 for each of the images to be displayed in the web photo album.
According to other embodiments of the present embodiment, the proxy server 42 ensures that the images 48′ in its cache 52 are fresh by sending a request to the peer server 42 to check whether a requested image 48′ has been modified since being cached. This is accomplished by comparing the timestamp 50′ of the cached image 48′ with the timestamp 50 of the image 40 stored on the peer server 42. If the comparison of the timestamps indicates that the image 48 on the peer server 42 has been modified, then the peer server 42 transfers the modified image to the proxy server 42 prior to the proxy server 42 serving the image to the requester.
By caching the images 48′ on the proxy server 40, embodiments of the present invention may significantly reduce the need to transfer images from a peer server 42 to the proxy server 40 to satisfy each image request. Although a small amount of data is transferred between the proxy server 40 and the peer server 42 in order to determine if the proxy's cache 52 is still fresh, this traffic is generally only a few bytes, as opposed to the kilobytes or megabytes required to transfer images 40 from the peer server 42 to the proxy server 40 for every image request.
In step 168, the peer server 42 retrieves the image 48 and transmits a copy of the image 48 to the proxy server 40 via path (C). In step 170, the copy of the image 48′ is stored in the cache 52. In step 172, the proxy server 40 retrieves the cached image 48′ via path (F), and serves it to the requesting visiting computer 32 via path (D). According to embodiments of the present invention, the proxy server 40 streams the image 48′ to the visiting computer 32 while the image 48′ is being downloaded from the peer server 42 to further reduce the latency between the time that the request is made and the image is returned.
Referring again to step 162, if the image 48′ is present in the cache 52 (a cache hit), the proxy server 40 determines if the cached image 48′ is still fresh in step 174 by sending a request to the peer server 42 in the form of a standard HTTP “If-Modified-Since” header with the timestamp 50′ of the cached image 48′ via path (B). In step 176, the peer node application 44 on the peer server 42 compares the timestamp 50′ of the cached image 48′ with the timestamp 50 of the image 40 stored on the peer server 42. If the timestamp 50 of the image 48 stored on the peer server 42 is different (i.e., newer) than the timestamp 50′ of the cached image 48′, then the peer server 42 determines that the image 48 on the peer server 42 has been modified since the image was cached (stale cache). In step 168, the peer server 42 returns a copy of the image 48 as a response via path (C).
If the peer server 42 determines that the image 48 it has stored locally does not have a newer timestamp 50 than the timestamp 50′ sent by the proxy server 40 in step 176, then in step 178, the peer server 42 sends a 304 HTTP return code to the proxy server 40 as a response indicating that the image has not been modified via path (C). The proxy server 40 then retrieves the image 48′ from the cache 52 via path (F) and serves it to the visiting computer 32 via step 172 via path (D).
From time to time, the peer server 42 will become disconnected from the proxy server 40, especially in home environments where users often shut down their PCs when not in use. In this case, the proxy server 40 cannot communicate to the peer server 42 to determine if the images 48′ in the cache 52 are still valid. Therefore, the proxy server 40 needs an updated set of the most current images and web page components surrounding those images before the peer server 42 goes off-line.
According to embodiments of the present invention, this may be handled via a synchronization server 54 (
Once synchronization is invoked, in step 182 the peer server 42 uploads the timestamps 50 of all the images 48 to the synchronization server 54 via path (C). In step 184, the synchronization server 54 compares the uploaded timestamps 50 to the timestamps 50′ to determine if the cached images 48′ are current and whether there are any missing images in the cache 52. In step 186, the synchronization server 54 sends a request to the peer server 42 for any images identified as being modified or missing. In step 168, the peer server 42 retrieves and transmits the requested images 48 to the proxy server 40 via path (C).
According to embodiments of the present invention, synchronization may be performed upon request by the user. Alternatively, synchronization may be performed automatically in the background, or in the background according to a schedule. That is, the proxy server 40 may be synchronized with a peer server 42 at the same time the proxy server 40 is serving images to the visiting computer 32. In this embodiment, synchronization may be performed when the peer server 42 first makes a connection to the proxy server 40. Background synchronization may also be performed when it is detected that a peer server's connection is idle. In either form of background synchronization, by the time the user shuts down a peer server 42 after an active session, synchronization with the proxy server 44 may be more than likely complete.
According to embodiments of the present invention, the synchronization server 54 is a component of the proxy server 40. However, the synchronization server 54 may be separate from the proxy server 40 and may run on a separate computer.
As can be seen, an image is only transferred from the peer server 42 to the proxy server 40 via path (C) when it is not present in the cache 52, which is typically the case the very first time the image is request, and when the image in the cache 52 needs to be updated. However, other than the first time the image is requested, the image will be present in the cache 52, and the only data passed between the peer server 42 to the proxy server 40 via path (C) is the HTTP return code, which is only a few bytes, rather than megabytes to transfer the image. Due to this decrease in traffic between the peer server 42 and the proxy server 40, image viewing performance of the P2P network for guests may be significantly increased.
Referring to
The proxy server cache 52 is configured to store images from a peer server photo album, as described above. The guest content server cache 63 is configured to store non-image files (e.g., text files, HTML files, XML files, configuration files and binary files, etc.). These non-image files may include such items as image permission information, image captions, display orders, web pages that display one or more images, etc. The guest content server may also contain a portion of the peer server logic. The holding pen 206 is configured to store non-image content prior to delivery to the guest content server cache 63.
Referring to
Upon receiving notification from a peer server 42 that the peer server 42 contains one or more photo albums that require synchronization, the synchronization manager 202 communicates with the peer robot 204 and directs the peer robot 204 to the URL of each photo album to be synchronized, for example, sequentially in the order passed by the peer server 42 (H). The peer robot 204 connects to the peer server 42 via the proxy server 40 and a privileged portal for synchronizing photo album content (i.e., images and database files) and “walks” or “crawls” each photo album similar to how a web crawler visits internet sites and gathers information (I). The proxy server 40 is configured to recognize the peer robot 204 and to allow privileged access to the peer server synchronization portal.
The proxy server 40 is configured to provide only the peer robot 204 access to the privileged peer robot portal. According to embodiments of the present invention, the proxy server 40 accomplishes this via IP filtering and token mechanisms as described in co-assigned U.S. patent application Ser. No. 10/942,578, which is incorporated herein by reference in its entirety.
The proxy server 40 is configured to determine when the requestor for an image in a peer server photo album is the peer robot 204, and will not return the image to the peer robot 204. The proxy server 40 will only update its cache 52 with images. The proxy server 40 updates its cache 52 directly as a result of a request from the peer robot 204, and does not need to return the image.
The terms “walk” and “crawl”, as used herein, mean that the peer robot 204 visits a peer server 42 and gathers information about one or more identified photo albums requiring synchronization. As it walks a peer server 42, the peer robot 204 requests images and database files associated with respective photo albums requiring synchronization (J). The process of walking the images and requesting them automatically updates the proxy server cache 52 (K). The peer robot 204 stores the guest content server database files in the holding pen 206 until an entire album is synchronized (L). According to embodiments of the present invention, the peer robot 204 uses standard HTTP and recognizes and uses the “If-not-modified-since” header in order to only upload files that have changed. Once a photo album is successfully synchronized, the synchronization manager 202 moves the content from the holding pen 206 to the guest content server cache 63 (M), and starts synchronizing another album.
The peer robot 204 is configured to behave like a standard HTTP web robot (spider) with the following exceptions. The peer robot 204 does not expect an image from a peer server photo album to be returned, and the source and destination of peer server database cache files are different. That is, when getting the time stamp to send to a peer server in order to determine if the peer server database file is out of date, the peer robot 204 obtains the time stamp from the guest content server cache 63. When a peer server database file has changed and it needs to be uploaded, the peer robot 204 stores the files in the holding pen 206 until all the peer server database files for a particular photo album are uploaded, at which point the files are moved to the guest content server cache 63.
According to embodiments of the present invention, synchronization is photo album centric. That is, a peer server synchronizes one photo album at a time. Each photo album is a transactional unit. If a photo album fails to synchronize completely, it does not get moved to the appropriate cache.
As discussed above, synchronization may be initiated by a peer server 42 automatically, according to a schedule, or by a peer server user/owner. Automatic background synchronization is initiated by a peer server when both of the following conditions are true: (1) there is a new or modified unsynchronized photo album; and (2) the peer server is idle (e.g., if the peer server CPU utilization is lower than 95% for at least about 5 minutes; however, other time and CPU parameters may be selected without limitation).
Peer server owner-initiated synchronization may function like automatic background synchronization, except that it cannot be interrupted (except by user action). According to embodiments of the present invention, a peer server owner may select which photo albums he/she wants to synchronize and initiates the synchronization process. Scheduled synchronization is initiated by a peer server at a certain configurable time (e.g., 3:00 AM). If there are photo albums with a dirty flag set, a peer server communicates with the synchronization manager 202 to synchronize those photo albums having dirty flags, as described above.
According to embodiments of the present invention, automatic background synchronization may behave as a background low-priority process and can be interrupted if a peer server detects that the CPU is no longer idle, or if a peer server owner issues an explicit stop command. According to embodiments of the present invention, scheduled or peer server owner initiated synchronization can only be stopped by a peer server owner issuing an explicit halt command. According to embodiments of the present invention, synchronization is typically not interrupted due to guest traffic to a peer server.
According to embodiments of the present invention, if for any reason synchronization is halted, the synchronization process starts all over again, with a peer server 42 initializing the process. Images that were synchronized in the proxy server cache 52 prior to synchronization interruption will have their timestamps rechecked, but will not need to be re-synchronized. Peer server database cache files stored in the holding pen 206 will be treated as “transaction roll back” when synchronization is interrupted, and thus will need to build the transaction from the beginning. If a peer server fails to respond after a predetermined number of re-tries and timeout interval, the synchronization manager 202 assumes that the synchronization session has failed and ends the session.
According to embodiments of the present invention, the proxy server 40 is configured to support large file chunking after synchronization interruption, in order to conserve real time, bandwidth and CPU time. The proxy server 40 store chunks of files as they are uploaded, and then assembles them when the last file chunk is uploaded. Thus, where synchronization is interrupted and then re-started, existing file chunks do not have to be re-uploaded. The proxy server just picks up where it left off.
The foregoing is illustrative of the present invention and is not to be construed as limiting thereof. Although a few exemplary embodiments of this invention have been described, those skilled in the art will readily appreciate that many modifications are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of this invention. The invention is defined by the following claims, with equivalents of the claims to be included therein.
Number | Name | Date | Kind |
---|---|---|---|
5414455 | Hooper et al. | May 1995 | A |
5915252 | Misheski et al. | Jun 1999 | A |
5918013 | Mighdoll et al. | Jun 1999 | A |
6073168 | Mighdoll et al. | Jun 2000 | A |
6292835 | Huang et al. | Sep 2001 | B1 |
6330606 | Logue et al. | Dec 2001 | B1 |
6349336 | Sit et al. | Feb 2002 | B1 |
6449657 | Stanbach, Jr. et al. | Sep 2002 | B2 |
6463508 | Wolf et al. | Oct 2002 | B1 |
6487538 | Gupta et al. | Nov 2002 | B1 |
6490615 | Dias et al. | Dec 2002 | B1 |
6564218 | Roth | May 2003 | B1 |
6622168 | Datta | Sep 2003 | B1 |
6631369 | Meyerzon et al. | Oct 2003 | B1 |
6633850 | Gabbard et al. | Oct 2003 | B1 |
6651141 | Adrangi | Nov 2003 | B2 |
6658463 | Dillon et al. | Dec 2003 | B1 |
6754699 | Swildens et al. | Jun 2004 | B2 |
6757684 | Svendsen et al. | Jun 2004 | B2 |
6757705 | Pardikar et al. | Jun 2004 | B1 |
6917965 | Gupta et al. | Jul 2005 | B2 |
6925485 | Wang et al. | Aug 2005 | B1 |
6934735 | Emens et al. | Aug 2005 | B1 |
6954752 | Iyengar | Oct 2005 | B2 |
7027513 | Zhang et al. | Apr 2006 | B2 |
7039784 | Chen et al. | May 2006 | B1 |
7043644 | DeBruine | May 2006 | B2 |
7272645 | Chang et al. | Sep 2007 | B2 |
20020023143 | Stephenson et al. | Feb 2002 | A1 |
20020023230 | Bolnick et al. | Feb 2002 | A1 |
20020046262 | Heilig et al. | Apr 2002 | A1 |
20020062384 | Tso | May 2002 | A1 |
20020078134 | Stone et al. | Jun 2002 | A1 |
20020103998 | DeBruine | Aug 2002 | A1 |
20020107934 | Lowery et al. | Aug 2002 | A1 |
20020133601 | Kennamer et al. | Sep 2002 | A1 |
20020138744 | Schleicher et al. | Sep 2002 | A1 |
20020178261 | Chang et al. | Nov 2002 | A1 |
20030005035 | Rodgers | Jan 2003 | A1 |
20030009538 | Shah et al. | Jan 2003 | A1 |
20030018639 | Iyengar | Jan 2003 | A1 |
20030050863 | Radwin | Mar 2003 | A1 |
20030061272 | Krishnamurthy et al. | Mar 2003 | A1 |
20030063770 | Svendsen et al. | Apr 2003 | A1 |
20030063771 | Morris et al. | Apr 2003 | A1 |
20030069968 | O'Neil et al. | Apr 2003 | A1 |
20030084162 | Johnson et al. | May 2003 | A1 |
20030105812 | Flowers, Jr. et al. | Jun 2003 | A1 |
20030112823 | Collins et al. | Jun 2003 | A1 |
20030154306 | Perry | Aug 2003 | A1 |
20030191832 | Satyavolu et al. | Oct 2003 | A1 |
20030225885 | Rochberger et al. | Dec 2003 | A1 |
20040054860 | Dixit et al. | Mar 2004 | A1 |
20040064512 | Arora et al. | Apr 2004 | A1 |
20040064568 | Arora et al. | Apr 2004 | A1 |
20040064693 | Pabla et al. | Apr 2004 | A1 |
20040070678 | Toyama et al. | Apr 2004 | A1 |
20040088348 | Yeager et al. | May 2004 | A1 |
20040098447 | Verbeke et al. | May 2004 | A1 |
20040139172 | Svendsen et al. | Jul 2004 | A1 |
20040139227 | Takeda | Jul 2004 | A1 |
20040148434 | Matsubara et al. | Jul 2004 | A1 |
20040162871 | Pabla et al. | Aug 2004 | A1 |
20040215625 | Svendsen et al. | Oct 2004 | A1 |
20050066063 | Grigorovitch et al. | Mar 2005 | A1 |
20050071496 | Singal et al. | Mar 2005 | A1 |
20050086386 | Shen et al. | Apr 2005 | A1 |
20050091220 | Klemow et al. | Apr 2005 | A1 |
20050097085 | Shen et al. | May 2005 | A1 |
20050114711 | Hesselink et al. | May 2005 | A1 |
20050114757 | Sahota et al. | May 2005 | A1 |
20050138176 | Singh et al. | Jun 2005 | A1 |
20050147044 | Teodosiu et al. | Jul 2005 | A1 |
20050160167 | Cheng et al. | Jul 2005 | A1 |
20050193083 | Han et al. | Sep 2005 | A1 |
20050198191 | Carlson et al. | Sep 2005 | A1 |
20050229243 | Svendsen et al. | Oct 2005 | A1 |
20050267973 | Carlson et al. | Dec 2005 | A1 |
20060010225 | Issa | Jan 2006 | A1 |
20060064716 | Sull et al. | Mar 2006 | A1 |
20060136551 | Amidon et al. | Jun 2006 | A1 |
20060242238 | Issa | Oct 2006 | A1 |
20070064121 | Issa et al. | Mar 2007 | A1 |
20070067493 | Issa | Mar 2007 | A1 |
20070073878 | Issa | Mar 2007 | A1 |
20070078993 | Issa | Apr 2007 | A1 |
20070208583 | Ward | Sep 2007 | A1 |
20070271380 | Chang et al. | Nov 2007 | A1 |
20080178234 | Eyal et al. | Jul 2008 | A1 |
Number | Date | Country |
---|---|---|
2005099165 | Oct 2005 | WO |
2006026193 | Mar 2006 | WO |
2006055535 | May 2006 | WO |