The present application claims priority under 35 U.S.C 119(a) to Korean Application No. 10-2004-0108973, filed on Dec. 20, 2004, in the Korean Intellectual Property Office, which is incorporated by reference in its entirety as set forth in full
The present invention relates to a contents distribution management system; and more particularly, to a contents distribution management system and method for supporting a plurality of global servers that provide the contents and managing the contents by applying different policies based on the global server and service type of the contents.
An available bandwidth in a conventional wide area network is not sufficient to support a remote play of large-capacity contents such as video due to such problems as latency time, jitter and limited throughput. Hence, to solve the above problems, a conventional system is constructed in such a way that a plurality of local servers are provided at locations geographically dispersed and a large capacity contents file cache is incorporated in each of them to offer a proper rapid access to widely dispersed users.
As shown therein, the conventional contents distribution system includes a contents library 110, a global server 100, a plurality of local servers 140, and local caches 150.
Contents are installed in the contents library 110, and a whole copy or a partial copy of contents frequently used by users is stored in the local cache 150.
Therefore, when a user demands contents of the local server 140 via a local area network, the local server 140 searches whether or not the contents demanded by the user are stored in the local cache 150.
If the contents demanded by the user are stored in the local cache 150, the local server 140 reads the contents from the local cache 150 and transmits them to the user via the local area network.
However, if the contents demanded by the user are not stored in the local cache 150, the local server 140 demands the contents demanded by the user of the global server 100 via a wide area network.
As described above, when the local server 140 demands the contents of the global server 100, the global server 100 reads the contents demanded by the user from the contents library 110 and transmits it to the local server 140 via the wide area network. And then, the local server 140 transmits the contents provided from the global server 100 to the user via the local area network.
However, the conventional contents distribution management system as shown in
Moreover, in the conventional contents distribution management system, there may be a variety of service types of contents, e.g., video, educational video, news, etc., which are serviced from the local server 140 to the end user. However, since such prior art system manages those contents just as they are ones of the same type, it cannot apply a different management method that depends on a type of services or characteristics corresponding to each of the contents.
It is, therefore, an object of the present invention to provide a contents distribution management system and method for supporting a plurality of global servers that provide the contents and managing the contents by applying different policies based on the global server and service type of the contents.
In accordance with one aspect of the present invention, there is provided a contents distribution management system with a multi-service type management function, the system comprising: a plurality of global servers for supplying contents to a plurality of local servers, each global server having a large capacity contents library; and the local servers for managing the contents provided from the global servers based on global servers and service types using contents tables, and providing a contents service in response to a contents streaming service demand from a last terminal using a local contents cache.
In accordance with another aspect of the present invention, there is provided a multi-service type management method in a contents distribution management system, the method comprising the steps of: (a) when an addition of a service is demanded, adding one row or one directory to each of a contents storage policy table, a local contents cache and a storage management table; (b) when an elimination of a service is demanded, eliminating a corresponding one row or one directory from each of the contents storage policy table, and the local contents cache and the storage management table; (c) when a change of a service is demanded, changing field values of a corresponding row in each of the contents storage policy table, and the storage management table; (d) if contents demanded from a last terminal are not presented in the local contents cache, securing a space required by the local contents cache to receive the corresponding contents; and (e) preloading a head part of contents to store the head part in the local contents cache.
The other objectives and advantages of the invention will be understood by the following description and will also be appreciated by the embodiments of the invention more clearly. Further, the objectives and advantages of the invention will readily be seen that they can be realized by the means and its combination specified in the claims.
The above and other objects and features of the instant invention will become apparent from the following description of preferred embodiments taken in conjunction with the accompanying drawings, in which:
a and 10b are flowcharts showing a procedure of the contents distribution management system having the multi-service type management function upon elimination of contents in accordance with an embodiment of the present invention; and
The above-mentioned objectives, features, and advantages will be more apparent by the following detailed description associated with the accompanying drawings; and based on this, the invention will be readily conceived by those skilled in the art to which the invention belongs. Further, in the following description, well-known arts will not be described in detail if it seems that they could obscure the invention in unnecessary detail. Hereinafter, a preferred embodiment of the present invention will be set forth in detail with reference to the accompanying drawings.
As shown in
The global servers 20l to 20n include their own large capacity contents libraries 21l to 21n where contents are installed and Global Contents Tables (GCTS) 28l to 28n to manage information on contents they can provide.
These global servers 20l to 20n are connected to the local servers 24l to 24m via a wide area network, and transmit contents they have to the local servers 24l to 24m.
Each of the local servers 24l to 24m is provided with a corresponding one of local contents caches 25l to 25m.Further, each local server includes a corresponding one of GCTs 29l to 29m that store information on contents that are planning to lastly provide services to users among information on contents acquired from the global servers 20l to 20n, and a corresponding one of Local Contents Tables (LCTS) 23l to 23m that store information about contents stored in the local contents caches 25l to 25m within the local servers 24l to 24m.
In this structure, each of the local servers 24l to 24m manages a separate one of GCTs 29l to 29m distinguishable from the GCTs 28l to 28n managed by the global servers 20l to 20n. Therefore, the local servers 24l to 24m don't offer contents provided by the global servers 20l to 20n to the end user unconditionally, but can selectively determine desired contents to be provided to the end user among the contents provided from the global servers 20l to 20n.
Thus, the local servers 24l to 24m manage the contents provided from the global servers 20l to 20n by means of sorting them by the global servers 20l to 20n using the GCTs 29l to 29m, thereby classifying them by the global servers 20l to 20n.
Further, each of the local servers 24l to 24m is coupled with contents display stations 27l to 27L used by the end user via a local area network. Each of the local servers 24l to 24m provides a contents streaming service to the end user using the local contents caches 25l to 25m when the end user demands the contents streaming service via the contents display stations 27l to 27L.
And also, each of the local servers 24l to 24m as shown in
As shown in
Meanwhile, the GCTs 28l to 28n and 29l to 29m contain a global server identification (ID) to identify each of the global servers 20l to 20n, a contents ID to identify each contents, a contents title, a global path indicating a storage location of contents in each global server, a contents size representing a final size of contents, a service type representing a service type of contents, a usage frequency indicating a usage trend of contents, a bit rate indicating a transmission rate required when a contents is played to the end user at a real time, a total running time of contents, etc.
As shown in
Here, the current state of contents indicates information on whether the current contents are being transmitted from the global servers 20l to 20n, are being eliminated or purged for storage space management in the local servers 24l to 24m, or are being serviced to the end user.
As shown in
At this time, each of the global servers 20l to 20n has a different profit method for transmitting contents to the local servers 24l to 24m.
For example, any of the global servers 20l to 20n may have a monthly fixed amount type profit structure that makes a fixed amount of money every month and another server may get a fixed amount profit whenever it provides contents.
And also, each of the global servers 20l to 20n may have a different profit structure depending on a service type of contents provided by its own server. Hence, each of the global servers 20l to 20n should apply a different management policy based on a service type.
In the meantime, although the global servers 20l to 20n don't apply different management policies based on a service type, there exists an instance where the local servers 24l to 24m apply separate storage management policies depending on each service type.
For instance, when the local servers 24l to 24m receives contents transmitted from the global servers 20l to 20n, there may sometimes be an instance where lack of space exists in the local contents caches 25l to 25m of the local servers 24l to 24m. In this case, it needs to eliminate or purge the latter half or whole of contents stored in the local contents caches 25l to 25m to secure the space of the local contents caches 25l to 25m.
At this time, the storage management policy to which the local servers 24l to 24m apply to guarantee the space of the local contents caches 25l to 25m is different depending on a service type of contents transmitted from the global servers 20l to 20n.
If a service type of contents from the global servers 20l to 20n is “movie,” contents to be eliminated may be selected by applying a Least Recently Used (LRU) algorithm that selects contents having the least frequency recently demanded from the user.
Meanwhile, if a service type of contents from the global servers 20l to 20n is “news,” an algorithm that chooses old contents depending on a release date or stored time may be adopted, rather than the LRU algorithm, to select contents to be eliminated.
The present invention, which takes into account the above principle, allows the local servers 24l to 24m to apply different management policies based on the global servers 20l to 20n providing the contents and the service type thereof to manage the contents by using the CSPT as shown in
As shown in
Further, the global ID represents a global server ID of a relevant service and a service type implies a service type of contents corresponding to the relevant service.
The elimination or purging policy is a policy, which selects contents to be eliminated when it needs to eliminate the latter half or whole of contents already presented in the local servers 24l to 24m for contents of a relevant service.
Typically, the elimination policy may be an LRU algorithm that selects contents that are not used for the longest time, a usage frequency algorithm that selects least serviced contents, namely contents having a least access number of LCT, an age algorithm that eliminates contents installed before the longest time, and a rank algorithm that selects contents having the lowest grade given thereto, namely contents having the lowest usage frequency of the GCTs 29l to 29m. In addition, other policies may be applied.
Further, the placement policy is a policy that may be used in case where the local servers 24l to 24m are composed in the cluster form, wherein it is determined whether specific contents will be stored in which node among plural nodes constituting the cluster when they are supplied from the global servers 20l to 20n.
This placement policy may be a storage policy that selects a node with the most storage space, a CPU policy that selects a node with the lowest CPU utilization, a network policy that chooses a node with the most spare network bandwidth, and a combined policy of network and CPU that considers the CPU utilization and network state simultaneously. In addition, other policies may be employed.
Meanwhile, when the end user having the contents display stations 27l to 27L is intended to demand a service of specific contents, if the local servers 24l to 24m to be serviced don't have the whole or head part of the contents, the end user cannot get the service until the local servers 24l to 24m load at least head part of the relevant contents in the local contents caches 25l to 25m of the local servers 24l to 24m via the global servers 20l to 20n.
This phenomenon may not cause any problem but may be any obstacle in providing a high level service. Hence, the contents distribution management system of the invention allows the local servers 24l to 24m to receive the head part of the contents in coincidence with a specific condition transmitted from the global servers 20l to 20n in advance and then store it in the local contents caches 25l to 25m in order to efficiently cope with the above circumstance.
The preloading policy of the CSPT shown in
A typical policy of the preloading policy may be a rank policy that selects contents having the highest grade given thereto, that is, contents having the highest usage frequency of the GCTs 23l to 23m, a newage policy that selects contents most recently installed, or a combined policy of newage and rank policies. And also, other policies may be adopted.
Lastly, the maximum space rate is a ratio of a total available storage space at which contents corresponding to each service are usable in the local servers 24l to 24m to a maximum available space.
As shown in
The service name represents a service name given depending on the global servers 20l to 20n and a service type of contents provided from the relevant global servers 20l and 20n, in a same manner as that described in
Further, the node ID is information to represent a specific node within the cluster in case where the relevant local servers 24l to 24m are made in the cluster form.
The current usage space indicates a storage space that is currently used in the local contents caches 25l to 25m of the local servers 24l to 24m for the service as mentioned above; and the reserved usage space is a storage space to be used in the local contents caches 25l to 25m for the service finally in case where all future transmissions are completed due to contents being currently received from the global servers 20l to 20n.
The maximum usable space or limit is a maximum storage space that can be used in the local contents caches 25l to 25m for the service and may be computed by multiplying a total capacity of the local contents caches 25l to 25m by the maximum space rate corresponding to the related service of the CSPT. The current usage space, the reserved usage space and the maximum usable space are classified and managed by nodes in case where the local servers 24l to 24m are made in the cluster form.
On the other hand, the local servers 24l to 24m create services and manage based on the global servers 20l to 20n providing contents and the service type of the contents by applying the appropriate management policies as described above.
First of all, the manager should provide all requisite information for the CSPT when a service is added in the contents distribution management system.
Thereafter, when the contents distribution management system receives a demand for service addition from the end user, it inserts one row in the CSPT for a service to be added using the information provided from the manager and then sets field values of the inserted row using the information from the manager at step S710.
At a next step S720, the contents distribution management system creates a directory named as a service name referring to the information from the manager in the local contents caches 25l to 25m within the local servers 24l to 24m.
If the local servers 24l to 24m are consisted in the cluster form, the contents distribution management system performs the directory creation process at step S720 with respect to each node constituting the cluster.
As mentioned above, if the directory creation process has been completed, the contents distribution management system inserts one row in the SMT and then sets field values of the inserted row at step S730.
At this time, the contents distribution system makes the service name of the row newly inserted in the SMT same as that of the row inserted in the CSPT and then sets the current usage space and the reserved usage space to values of “0.”
Further, the contents distribution management system sets the maximum usable space to the value computed by multiplying the total storage space of the local contents caches 25l to 25m by the maximum space rate of the CSPT.
If the local servers 24l to 24m are consisted in the cluster form, the contents distribution management system repeatedly inserts rows with respect to each node constituting the cluster.
As described above, if the new service type is added, the contents distribution management system inserts the new rows for the added service type in the CSPT and the SMT that are managed by the local servers 24l to 24m and then newly sets field values of the inserted rows using the information from the manager.
First of all, the manager should provide information on a name of service to be eliminated upon elimination of a service in the contents distribution management system.
When the contents distribution management system receives a demand for service elimination, it eliminates one specific row from the CSPT with reference to the name information provided from the manager at step S810.
At this time, the row to be eliminated is a row with a same service name field value using the service name information among the information provided from the manager.
Thereafter, the contents distribution management system also eliminates, from the SMT, a row having the same service name field value as the eliminated service name in the CSPT at step S820.
At a following step S830, the contents distribution management system eliminates a directory having the corresponding service name from the local contents caches 251 to 25m within the local servers 24l to 24m.
If the local servers 24l to 24m are consisted in the cluster form, the contents distribution management system repeatedly carries out the directory elimination process made in step S830 with respect to each node constituting the cluster.
As described above, if the contents distribution management system receives the demand for elimination of specific service type, it eliminates rows corresponding to the demanded service type from the table managed by the local servers 24l to 24m in a lump.
Firstly, the manager should provide all required information for the CSPT upon change of a service in the contents distribution management system.
After that, when the contents distribution management system receives a demand for service change from the end user, it changes field values of a row corresponding to a service name in the CSPT using the service name contained in the information from the manager and characteristics of the service to be changed upon service execution at step S910.
Subsequently, the contents distribution management system judges at step S920 whether or not the maximum space rate field is involved in the fields of the changed values.
If it is judged at step S920 that the maximum space rate field is involved in the fields of the changed values, then as in step S930, the contents distribution management system newly calculates and sets a maximum usable space of the service with the corresponding service name in the SMT using the changed maximum space rate value, in the same manner as that presented in
a and 10b are flowcharts showing one embodiment of a procedure of the contents distribution management system having the multi-service type management function upon elimination of contents in accordance with the present invention.
The local servers 24l to 24m, in response to a service demand from the end user having the contents display stations 27l to 27L, inquire whether or not corresponding contents exist in the local contents caches 25l to 25m.
As a result of the inquiry, if there exists only the head part of the contents or no related contents in the local contents caches 25l to 25m, the local servers 24l to 24m demand the global servers 20l to 20n to transmit the remainder or whole of the contents.
At this time, the contents distribution management system eliminates the contents stored in the local contents caches 25l to 25m to secure the required space in storing the contents to be provided from the global servers 20l to 20n.
In such a case, the processes where the contents distribution management system eliminates the contents stored in the local contents caches 25l to 25m and changes the table based on the elimination are as follows.
Firstly, when the local servers 24l to 24m get a demand for service, they compute a storage space required for storing the contents provided from the global servers 20l to 20n at step S1110.
If the corresponding contents are not in the local contents caches 25l to 25m at all, the required storage space corresponds to a whole capacity of contents from the global servers 20l to 20n; and if the head portion of the contents is stored in the local contents caches 25l to 25m, the required storage space corresponds to a capacity of the remaining latter half of the contents from the global servers 20l to 20n.
At a next step S1115, the contents distribution management system judges using the SMT information whether or not the computed storage space is usable in a directory of the local contents caches 25l to 25m with which the contents from the global servers 20l to 20n are stored.
As a result of the judgment at step S1115, if the computed storage space is secured in the directory of the local contents caches 25l to 25m, the contents distribution management system increases the reserved usage space corresponding to the relevant service of the SMT by the computed storage space and then ends the contents elimination process after storing the same at step S1120.
Meanwhile, if the computed storage space is not secured in the directory of the local contents caches 25l to 25m, the contents distribution management system again judges using the LCT information at step S1125 whether or not latter half-eliminable contents exist in the directory of the local contents caches 25l to 25m with which the contents provided are stored.
As a result of the judgment at step S1125, if the latter half-eliminable contents exist in the LCT, the contents distribution management system selects one contents and eliminates the latter half of the selected contents based on the elimination policy with respect to the related service of the CSPT at step S1130.
Further, the contents distribution management system decreases the current usage space and the reserved usage space field values corresponding to the service by the amount of the eliminated latter half of the contents and then stores it in the SMT at step S1135; and also decreases the storage space or the computed storage space required for storing the contents from the global servers 20l to 20n by the amount of the eliminated latter half of the contents at step S1140.
Thereafter, the contents distribution management system returns to step S1115 that judges using the SMT information whether or not the storage space required for storing the contents from the global servers 20l to 20n, which has been reduced by the latter half capacity of the eliminated contents, is secured in the directory of the local contents caches 25l to 25m.
As a result of the judgment at step S1125, if the latter half-eliminable contents are not in the directory of the local contents caches 25l to 25m, the contents distribution management system again judges at step S1145 whether or not whole-eliminable contents exist in the same manner as that in the process that judges the presence of the latter half-eliminable contents.
If the whole-eliminable contents exist in the directory of the local contents caches 25l to 25m at step S1145 above, the contents distribution management system selects one contents based on the elimination policy with respect to the related service of the CSPT and then eliminates the whole of the selected contents at step S1150.
Further, the contents distribution management system decreases the current usage space and the reserved usage space field values by the whole amount of the eliminated contents in the SMT and then stores it in the SMT at step S1155; and also decreases the required storage space or computed storage space by the amount of the eliminated contents at step S1160.
Subsequently, the contents distribution management system returns to step S1115 that judges using the SMT information whether or not the storage space required for storing the contents from the global servers 20l to 20n, which has been reduced by the whole amount of the eliminated contents, is guaranteed in the directory of the local contents caches 25l to 25m.
Meanwhile, as a result of the judgment at step S1145, if the whole-eliminable contents are not in the directory of the local contents caches 25l to 25m, the contents distribution management system again judges at step S1165 whether or not the latter half-eliminable contents exist in a service directory other than the service for which the received contents are stored.
If the latter half-eliminable contents exist in the other service directory of the local contents caches 25l to 25m, the contents distribution management system selects one contents based on the elimination policy with respect to the related service of the CSPT and then eliminates the latter half of the selected contents at step S1170.
Further, the contents distribution management system decreases the current usage space and the reserved usage space field values corresponding to the other service by the amount of the eliminated latter half and then stores it in the SMT at step S1175; and also decreases the required storage space or computed storage space by the amount of the eliminated latter half at step S1180.
Subsequently, the contents distribution management system returns to step S1115 that judges using the SMT information whether or not the required storage space is secured in the directory of the local contents caches 25l to 25m with which the received contents are stored.
If it is judged at step S1165 that the latter half-eliminable contents are not presented in the other service directory of the local contents caches 25l to 25m, the contents distribution management system judges at step S1182 whether or not whole-eliminable contents exist in the same manner as that of the process that judges the presence of the latter half-eliminable comments.
As a result of the judgment at step S1182, if the whole-eliminable contents exist in the other service directory of the local contents caches 25l to 25m, the contents distribution management system selects one contents based on the elimination policy with respect to the other service directory of the CSPT and then eliminates the whole of the selected contents at step S1184.
Further, the contents distribution management system decreases the current usage space and the reserved usage space field values by the whole amount of the eliminated contents in the SMT and then stores it in the SMT at step S1186; and also decreases the required storage space or computed storage space by the whole amount of the eliminated contents at step S1188.
And then, the contents distribution management system returns to step S1115 that judges using the SMT information whether or not the required storage space is secured in the directory of the local contents caches 25l to 25m with which the received contents are stored.
However, as a result of the judgment at step S1182, if the eliminable contents are not presented in the other service directory of the local contents caches 25l to 25m, the contents distribution management system rejects the contents demand of the end user at step S1190 and then ends the process since it is under the state that the storage space guarantee for storing the contents from the global servers 20l to 20n is difficult.
Meanwhile, when the end user having the contents display stations 27l to 27L is intended to demand a service of specific contents, if the local servers 24l to 24m to be serviced don't have the whole or head part of the contents, the end user cannot receive the service until the local servers 24l to 24m carry at least head part of the relevant contents in the local contents caches 25l to 25m of the corresponding local servers 24l to 24m via the global servers 20l to 20n.
In order to efficiently cope with the above circumstances, the contents distribution management system of the invention allows the local servers 24l to 24m to automatically receive the head part of the contents in coincidence with a specific condition transmitted from the global servers 20l to 20n in advance and then store it in the local contents caches 25l to 25m.
The process where the local servers 24l to 24m receive the head part of the contents in coincide with the specific condition from the global servers in advance and then store the same in the local contents caches 25l to 25m as mentioned above will be described in more detail with reference to
First of all, the local servers 24l to 24m hoping the preloading of the head part of the contents judges at step S1210 whether or not there exists a spare space required for storing the head part of contents every service with reference to the SMT.
If it is judged at step S1210 that the spare space is not in a directory corresponding to each service of the local contents caches 25l to 25m, the process of the invention waits for a predetermined time at step S1220 since the preloading of the head part of the contents can be no longer performed.
After passing the predetermined time, the process returns to step S1210 that judges whether or not the spare space required for storing the head part of contents exists in the directory corresponding to each service of the local contents caches 25l to 25m.
In the meantime, if it is judged at step S1210 that the spare space exists in the directory corresponding to each service of the local contents caches 25l to 25m, the process selects contents that exist in the GCT of the local servers but are not in the LCT according to the preloading policy of the CSPT at step S1230.
Thereafter, the process demands the head part of the selected contents of the global servers and then increases the reserved usage space field values by the head part of the contents in the row corresponding to the relevant service of the SMT at step S1240.
And then, the process returns to step S1210 that judges whether or not the spare space required for storing the head part of contents exists in the directory corresponding to each service of the local contents caches 25l to 25m.
As described above, the local servers 24l to 24m of the invention can receive contents provided from the global servers 20l to 20n by managing the contents in the form of the tables such as the GCTs 29l to 29m, the LCTs 23l to 23m, the CSPT and the SMT. Furthermore, the global servers 20l to 20n also can maximize the usability by servicing their own contents libraries 21l to 21n to the local servers 24l to 24m, without servicing their own contents libraries 21l to 21n to only one of the local servers 24l to 24m.
Moreover, the invention can perform an optimized storage space management for each policy that depends on various circumstances since it can designate its own service policy by managing the contents in the form of the tables and also the local servers 24l to 24m can designate the management policy of their own local contents caches 25l to 25m based on the service policy of the global servers 20l to 20n and a type of various contents.
The method of the present invention as described above may be implemented by a software program and stored in a computer-readable manner in a storage medium such as CD-ROM, RAM, ROM, floppy disk, hard disk, optical magnetic disk, or the like. This process may be readily carried out by those skilled in the art; and therefore, details of thereof are omitted here.
The present application contains subject matter related to Korean patent application No. 2004-108973, filed with the Korean Intellectual Property Office on Dec. 20, 2004, the entire contents of which are incorporated herein by reference.
While the present invention as been described with respect to the particular embodiments, it will be apparent to those skilled in the art that various changes and modifications may be made without departing from the spirit and scope of the invention as defined in the following claims.
Number | Date | Country | Kind |
---|---|---|---|
10-2004-0108973 | Dec 2004 | KR | national |
Number | Name | Date | Kind |
---|---|---|---|
6081840 | Zhao | Jun 2000 | A |
6651141 | Adrangi | Nov 2003 | B2 |
6785704 | McCanne | Aug 2004 | B1 |
6947935 | Horvitz et al. | Sep 2005 | B1 |
7073073 | Nonaka et al. | Jul 2006 | B1 |
7181523 | Sim | Feb 2007 | B2 |
20010051980 | Raciborski et al. | Dec 2001 | A1 |
20020038360 | Andrews et al. | Mar 2002 | A1 |
20020133491 | Sim et al. | Sep 2002 | A1 |
20020143798 | Lisiecki et al. | Oct 2002 | A1 |
20020147770 | Tang | Oct 2002 | A1 |
20030051251 | Sugimoto et al. | Mar 2003 | A1 |
20030061451 | Beyda | Mar 2003 | A1 |
20030149737 | Lambert et al. | Aug 2003 | A1 |
20040172474 | Markaryan et al. | Sep 2004 | A1 |
20050055426 | Smith et al. | Mar 2005 | A1 |
20050071496 | Singal et al. | Mar 2005 | A1 |
20060037037 | Miranz | Feb 2006 | A1 |
20060106807 | DeVitis et al. | May 2006 | A1 |
20060129766 | Cassia et al. | Jun 2006 | A1 |
20060206565 | Ganesan et al. | Sep 2006 | A1 |
20060208074 | Eglen et al. | Sep 2006 | A1 |
20060218218 | Ganesan et al. | Sep 2006 | A1 |
20070136487 | Woo et al. | Jun 2007 | A1 |
20070136533 | Church et al. | Jun 2007 | A1 |
20070180486 | Yoon | Aug 2007 | A1 |
20080109343 | Robinson et al. | May 2008 | A1 |
20090234861 | Ramer et al. | Sep 2009 | A1 |
Number | Date | Country |
---|---|---|
1995 022384 | Jul 1995 | KR |
2001-0009728 | Feb 2001 | KR |
2003 0027485 | Apr 2003 | KR |
Number | Date | Country | |
---|---|---|---|
20060155779 A1 | Jul 2006 | US |