CN100394725C - Method, wireless network and user device for carrying out resource scheduling - Google Patents
Method, wireless network and user device for carrying out resource scheduling Download PDFInfo
- Publication number
- CN100394725C CN100394725C CNB2004100668781A CN200410066878A CN100394725C CN 100394725 C CN100394725 C CN 100394725C CN B2004100668781 A CNB2004100668781 A CN B2004100668781A CN 200410066878 A CN200410066878 A CN 200410066878A CN 100394725 C CN100394725 C CN 100394725C
- Authority
- CN
- China
- Prior art keywords
- user
- buffer
- data
- wanting
- time periods
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime
Links
- 238000000034 method Methods 0.000 title claims abstract description 26
- 230000005540 biological transmission Effects 0.000 claims description 36
- 230000011664 signaling Effects 0.000 description 9
- 238000010586 diagram Methods 0.000 description 7
- 238000013507 mapping Methods 0.000 description 3
- 238000013475 authorization Methods 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000005728 strengthening Methods 0.000 description 1
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
The present invention discloses a user apparatus and a method for requestign resources to a base station based on service Qos information in a wireless network. When requesting the resources to the base station, the user apparatus and the method combines buffer information and service Qos information to express the requirement of resources to the base station. The accurate requirement of the resources can be exactly performed according to the user apparatus and the method of the present invention; thereby, limited resources can be effectively utilized, and the throughput, etc. of a system can be increased.
Description
Technical field
The present invention relates to wireless communication field, relate in particular to the method and apparatus that carries out scheduling of resource between base station in wireless network and the user's set.
Background technology
In enhanced uplink (hereinafter to be referred as EUL) transmission course, user's set (UE) when sending data, need distribute certain Radio Resource to base station (hereinafter to be referred as Node B) request at every turn.Because Radio Resource is limited in the wireless network, corresponding radio resource must be distributed according to the real needs of user's set in the base station, thereby reaches the resources effective utilization.
In the EUL transmission course, user's set should be given Node B with its buffer status report, to express its resource request.But, in EUL, do not provide the definition of the buffer status that is used for Node B scheduling.
In the prior art, in radio bearer control (RBC) process, all information that are stored in the buffer of user's set are defined as buffer status, and are sent to radio network controller (RNC), are used for the purpose of scheduling of resource.RNC will determine how many resources user's set can take, thereby make all packet data package in buffer or to be transmitted in dispatching cycle in the next uplink time interval (TTI).
In EUL, grouped data is transmission in strengthening dedicated channel (E-DCH).Because the burst feature of data service, grouping will arrive user's set constantly in difference.According to the characteristics of Packet Service QoS (having fixed delay), the grouping with different due ins can be allowed different time delays, and need all these groupings in the transmission buffer device in identical Transmission Time Interval.Therefore, in above-mentioned RBC process, the scheme of carrying out scheduling of resource based on all packets of transmission buffer device in a transmission intercal can not effectively utilize the limited resources in the wireless network, thereby can not directly be used for the scheduling purpose of Node B in EUL.
In the EUL transmission course, there is method in two kinds of basic scheduling: rate scheduling and Shi Jian ﹠amp; Rate scheduling.No matter use any scheduling mechanism, user's set all will send SI (signaling) according to its buffer status and give Node B.In rate scheduling mechanism, SI can be a bit UP/DOWN signal (signaling).And for time/rate scheduling, user's set may report that its buffer status and/or power rating send to NodeB.
In fact, can to take how many bandwidth resources are time delay Qos (quality of service) in order to ensure Packet data service to user's set.But, do not consider this information based on the above-mentioned prior art of all information in the transmission buffer device in a transmission cycle, can exaggerate the requirement of user's set like this to resource.Thereby make the service efficiency of limited resources be lowered.
Summary of the invention
As mentioned above, all information that only will be stored in the prior art in the buffer of user's set are used for the scheduling of resource process, and this does not consider the feature of Packet data service, and has reduced the service efficiency of limited resources.For Packet data service, conditional time delay is a most important Qos information, but how to use time delay information also not mentioned in the prior art.For in the prior art to above-mentioned defective, the present invention proposes buffer information and professional Qos information (time delay) combined to the base station to express needs to Radio Resource, can more effectively utilize finite wireless resources like this.
According to an aspect of the present invention, a kind of method of carrying out resource request in the user's set of wireless network is provided, wherein, user's set comprises a buffer, it is used to store the data that will send, and described user's set has a plurality of ongoing logic channels, the corresponding a kind of data transmission service of each logic channel, this method may further comprise the steps: described user's set is determined the data quantity transmitted of wanting in next transmission time periods according to the information of the data of described buffer storage and with the Qos information of described business, and sends corresponding resource request message according to determined data volume to the base station
According to another aspect of the present invention, a kind of user's set in wireless network is provided, wherein, described user's set comprises a buffer, it is used to store the data that will send, and described user's set has a plurality of ongoing logic channels, the corresponding a kind of data transmission service of each logic channel, it is characterized in that: described user's set comprises: a calculation element is used for calculating the data quantity transmitted of wanting in next transmission time periods according to the information of the data of described buffer storage and the Qos information of described business; With a control device, be used for controlling described user's set and send corresponding resource request message to described base station according to determined data volume.
Unlike the prior art, user's set among the present invention is when request resource, the buffer information of user's set is combined informing base station with the time delay Qos information of business, can represent the demand of user's set more accurately like this, thereby can more effectively utilize Limited resources and help to increase the throughput of system resource.
Description of drawings
Fig. 1 is according to the network topological diagram that is used for scheduling of resource of the present invention;
Fig. 2 be according to of the present invention in the user's set of wireless network the method flow diagram to the base station requests resource.
Fig. 3 is the block diagram according to user's set of the present invention;
Embodiment
Below with reference to accompanying drawing, and in conjunction with specific embodiments the present invention is described in detail.Should be appreciated that the present invention is not limited to specific embodiment.
Fig. 1 is according to a wireless network schematic diagram of the present invention, and this wireless network 1 comprises base station 2 and a plurality of user's set 3 and 4 (for simplicity, only demonstrating user's set A and user's set B among the figure).In wireless network 1, when sending data, user's set 3 and 4 all needs to distribute certain Radio Resource to base station (Node B) 3 requests at every turn.In the prior art, user's set is only with the information of its buffer (also promptly wherein the quantity of institute's stored packet data) informing base station, the Radio Resource that the base station decides user's set to take according to the buffer information that is received is so that all groupings in described buffer can be transmitted in next uplink transmission cycle.Different with it, the present invention combines the information of described buffer and expresses bandwidth resources demand with Qos (time delay) information of the data transmission service that is carried out.Preferably, also can consider priority of logical channels and service priority simultaneously.Thereby in scheduling process, increase the finite bandwidth efficiency of resource.
Shown in Figure 1 to wireless network in, suppose that user's set 3 has the logic channel that m is carrying out (ongoing), and each logical mappings is to a kind of business with different delay.For i logic channel, suppose P
iIndividual grouping is stored in the buffer, and each grouping has following parameter:
A) l
b, be bit (or byte) number of b grouping;
B) TO
b, for, according to the Qos information (time delay) of business, b grouping still can be stored in the time (number of TTI) in the buffer
Here, and b ∈ [1, P
i], i ∈ [1, m].
Like this, user's set calculates by following formula, in order to guarantee professional time delay Qos, the affairs amount that in next TTI (or dispatching cycle), must transmit:
Here, β
iBe one relevant with i priority of logical channels and service priority to the factor, 0≤β
i＜1; And β
uBe a factor relevant with the priority of user's set 3,0≤β
u＜1.These two factors are to determine by emulation.
User's set 3 by signaling SI with the result notification Node B (base station) 2 that calculates.Node B (base station) receives after the signaling SI from user's set 3, determines that according to this result of calculation needs distribute to the bandwidth resources of this user's set 3.
Certainly, in user's set 3, also can not consider and the relevant factor-beta of user's set 3 priority
u, also promptly calculate the affairs amount that in next TTI (or dispatching cycle), must transmit according to following formula:
And after the signaling SI that Node B (base station) 2 receives from user's set 3, in conjunction with the bandwidth resources of the factor relevant with User Priority being determined to distribute to this user's set 3.
In order to simplify, we also can select β
i=0 or β
u=0, this means at user's set 3 when Node B (base station) 2 sends resource request, do not use the priority of Logic Priority level, service priority or user's set.But after user's set obtains RG (resource authorization) by Node B (base station), β
iTo be used in the scheduling process of user's set.
Fig. 2 be according to of the present invention in user's sets such as wireless network the method flow diagram to the base station requests resource.
Here, the topological structure schematic diagram in conjunction with wireless network shown in Figure 1 comes whole scheduling process is described.Suppose that user's set 3 has m logic channel that is carrying out (on going), and each logical mappings is to a kind of business with different delay.For i logic channel, suppose P
iIndividual grouping is stored in the buffer, and each grouping has following parameter:
A) l
b, be bit (or byte) number of b grouping;
B) TO
b, for, according to the Qos information (time delay) of business, b grouping still can be stored in the time (number of TTI) in the buffer
Here, and b ∈ [1, P
i], i ∈ [1, m].
In step 201, for each logic channel i, user's set 3 obtains parameters such as the time that reaches, time delay information of corresponding grouping number Pi, each grouping in buffer memory.
In step 202, user's set is according to the time of advent of each grouping in the buffer memory and the time delay information of corresponding service, and user's set calculates this grouping still can be stored in time T O in the buffer memory
b
In step 203-205, user's set calculates by following formula, in order to guarantee professional time delay Qos, the traffic carrying capacity that in next TTI (or dispatching cycle), must transmit:
Here, β
iBe one with i the priority of logical channels and the relevant factor of service priority, 0≤β
i＜1; And β
uBe a factor relevant with the priority of user's set 3,0≤β
u＜1.These two factors are to determine by emulation.
In step 206, user's set 3 with signaling SI with the result notification Node B (base station) 2 that calculates.
Node Node B (base station) is received after the signaling SI from user's set 3, and determines that according to this result of calculation needs distribute to the Radio Resource of this user's set 3.
Certainly, in step 203-205, user's set 3 also can not considered and the relevant factor-beta of user's set 3 priority
u, also promptly calculate the affairs amount that in next TTI (or dispatching cycle), must transmit according to following formula:
What describe in conjunction with Fig. 1 and 2 above it should be noted that is a preferred embodiment of the present invention, and to be user's sets combine the Qos information of business main points of the present invention with buffer information, comes to express Radio Resource asking to Node B (base station) 2.To the consideration such as other information of priority of logical channels, service priority and user's set priority etc. all is to belong to optional feature.
Fig. 3 is the block diagram according to user's set of the present invention.Below, in conjunction with Fig. 1 user's set is specifically described.This user's set 3 is arranged in a wireless network 1, links to each other with wireless network by NodeB (base station) 2, and when needs transmission information, need be to the certain bandwidth resources of NodeB (base station) 2 requests.
This user's set 3 comprises a buffer 31, calculation element 32, a controller 33 and a storage device 34.In buffer 31, store and to send data, and this user has a plurality of ongoing logic channels, the corresponding a kind of business of each logic channel.
When needs transmission information, control device 33 is at first by the relevant information of the information of obtaining the current cache device in the buffer 31 (also promptly wherein institute's stored packet data business volume) and described business.
Particularly, suppose that user's set 3 has m logic channel that is carrying out (on going), and each logical mappings is to a kind of business with different delay.For i logic channel, suppose P
iIndividual grouping is stored in the buffer, and each grouping has following parameter:
A) l
b, be position (or byte) number of b grouping;
B) TO
b, for, according to the Qos information (time delay) of business, b grouping still can be stored in the time (number of TTI) in the buffer
Here, and b ∈ [1, P
i], i ∈ [1, m].
For each logic channel i, control device 33 need obtain parameters such as the time that reaches, time delay information of corresponding grouping number Pi, each grouping in buffer memory.
Here, β
iBe one with i the priority of logical channels and the relevant factor of service priority, 0≤β
i＜1; And β
uBe a factor relevant with the priority of user's set 3,0≤β
u＜1.These two factors are to determine by emulation.
Node B (base station) receives after the signaling SI from user's set 3, can determine that needs distribute to the bandwidth resources of this user's set 3 according to this result of calculation.
Certainly, in user's set 3, also can not consider and the relevant factor-beta of user's set 3 priority
u, also, calculation element 32 calculates the affairs amount that must transmit in next TTI (or dispatching cycle) according to following formula:
More than specific embodiments of the invention are described.Need to understand being, the present invention is not limited to above-mentioned specific for execution mode, and those skilled in the art can make various distortion or modification within the scope of the appended claims.
Claims (16)
1. method of in the user's set of wireless network, carrying out resource request, wherein, user's set comprises a buffer, it is used to store the data that will send, and described user's set has a plurality of ongoing logic channels, the corresponding a kind of data transmission service of each logic channel, this method may further comprise the steps:
Described user's set is determined the data quantity transmitted of wanting in next transmission time periods according to the information of the described data of described buffer storage and the Qos information of described business, and sends corresponding resource request message according to determined data volume to the base station.
2. method according to claim 1 is characterized in that, the Qos information of described business comprises the time delay Qos information of described business.
3. method according to claim 2 is characterized in that, and is further comprising the steps of: described user's set is determined the data quantity transmitted of wanting in next transmission time periods according to following formula:
Wherein said user's set has m ongoing logic channel, and for i logic channel, has Pi grouped data to be kept in the buffer;
Wherein, 1≤i＜m; 1≤b≤P
i
l
bPosition or byte number for b grouping in the buffer; TO
bBe the Qos information according to described business, b grouping still can be stored in the time in the buffer.
4. according to each described method among the claim 1-3, it is characterized in that, further comprising the steps of:
Described user's set is further determined the data quantity transmitted of wanting in next transmission time periods according to priority and its corresponding service precedence information of each logic channel.
5. method according to claim 1 and 2 is characterized in that, and is further comprising the steps of,
Described user's set is used for determining the data quantity transmitted of wanting in next transmission time periods according to following formula:
Wherein said user's set has m ongoing logic channel, and for i logic channel, has Pi grouped data to be kept in the buffer;
Wherein, 1≤i＜m; 1≤b≤P
i
l
bPosition or byte number for b grouping in the buffer; TO
bBe the Qos information according to described business, b grouping still can be stored in the time in the buffer;
Wherein, 0≤β
i＜1, it be one with i the priority of logical channels and the relevant factor of service priority.
6. according to each described method among the claim 1-3, it is characterized in that, further comprising the steps of:
Described user's set also is used for determining the data quantity transmitted of wanting in next transmission time periods according to described user's set precedence information.
7. method according to claim 4 is characterized in that, and is further comprising the steps of:
Described user's set also is used for determining the data quantity transmitted of wanting in next transmission time periods according to described user's set precedence information.
8. method according to claim 5 is characterized in that, and is further comprising the steps of:
Described user's set also is used for determining the data quantity transmitted of wanting in next transmission time periods according to described user's set precedence information.
9. user's set in wireless network, wherein, described user's set comprises a buffer, it is used to store the data that will send, and described user's set has a plurality of ongoing logic channels, and the corresponding a kind of data transmission service of each logic channel is characterized in that:
Described user's set comprises:
A calculation element is used for calculating the data quantity transmitted of wanting in next transmission time periods according to the information of the described data of described buffer storage and the Qos information of described business; With
A control device is used for controlling described user's set according to determined data volume and sends corresponding resource request message to described base station.
10. user's set according to claim 9 is characterized in that, the Qos information of described business comprises the time delay Qos information of described business.
11. user's set according to claim 10 is characterized in that, described calculation element also is used for determining the data quantity transmitted of wanting in next transmission time periods according to following formula:
Wherein said user's set has m ongoing logic channel, and for i logic channel, P is arranged
iIndividual grouped data is kept in the buffer;
Wherein, 1≤i＜m; 1≤b≤P
i
l
bPosition or byte number for b grouping in the buffer; TO
bBe the Qos information according to described business, b grouping still can be stored in the time in the buffer.
12. according to the described user's set of claim 9-11, it is characterized in that, described calculation element also is used for, and further determines the data quantity transmitted of wanting in next transmission time periods based on priority and its corresponding service precedence information of each logic channel.
13. according to claim 9 or 10 described user's sets, it is characterized in that described calculation element also is used for, calculate the data quantity transmitted of wanting in next transmission time periods according to following formula:
Wherein said user's set has m ongoing logic channel, and for i logic channel, has Pi grouped data to be kept in the buffer;
Wherein, 1≤i＜m; 1≤b≤P
i
l
bPosition or byte number for b grouping in the buffer; TO
bBe the Qos information according to described business, b grouping still can be stored in the time in the buffer;
Wherein, 0≤β
i＜1, it be one with i the priority of logical channels and the relevant factor of service priority.
14., it is characterized in that described calculation element also calculates the data quantity transmitted of wanting in next transmission time periods according to the user's set precedence information according to each described user's set among the claim 9-11.
15. user's set according to claim 12 is characterized in that, described calculation element also calculates the data quantity transmitted of wanting in next transmission time periods according to the user's set precedence information.
16. user's set according to claim 13 is characterized in that, described calculation element also calculates the data quantity transmitted of wanting in next transmission time periods according to the user's set precedence information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100668781A CN100394725C (en) | 2004-09-29 | 2004-09-29 | Method, wireless network and user device for carrying out resource scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100668781A CN100394725C (en) | 2004-09-29 | 2004-09-29 | Method, wireless network and user device for carrying out resource scheduling |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1756176A CN1756176A (en) | 2006-04-05 |
| CN100394725C true CN100394725C (en) | 2008-06-11 |
Family
ID=36689146
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100668781A Expired - Lifetime CN100394725C (en) | 2004-09-29 | 2004-09-29 | Method, wireless network and user device for carrying out resource scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100394725C (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102111891B (en) * | 2007-01-18 | 2016-06-29 | 华为技术有限公司 | Share the methods, devices and systems of Internet resources |
| CN101227714B (en) * | 2007-01-18 | 2011-04-06 | 华为技术有限公司 | System, apparatus and method for sharing network resource |
| CN102638852B (en) * | 2011-02-12 | 2016-06-22 | 电信科学技术研究院 | A kind of quality-of-service based dispatching method, equipment and system |
| WO2018145269A1 (en) * | 2017-02-08 | 2018-08-16 | 广东欧珀移动通信有限公司 | Service transmission method, terminal and network device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1274221A (en) * | 1999-03-17 | 2000-11-22 | 日本电气株式会社 | Service quality administrative system and method thereof |
| CN1404248A (en) * | 2001-09-03 | 2003-03-19 | 华为技术有限公司 | Dynamic channel configuration method based on source rate estimation |
| WO2004017645A2 (en) * | 2002-08-16 | 2004-02-26 | Cellglide Technologies Corp. | Packet data traffic management system for mobile data networks |
| WO2004019536A2 (en) * | 2002-08-23 | 2004-03-04 | Motorola, Inc. | Pre-negotiated quality of service |
-
2004
- 2004-09-29 CN CNB2004100668781A patent/CN100394725C/en not_active Expired - Lifetime
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1274221A (en) * | 1999-03-17 | 2000-11-22 | 日本电气株式会社 | Service quality administrative system and method thereof |
| CN1404248A (en) * | 2001-09-03 | 2003-03-19 | 华为技术有限公司 | Dynamic channel configuration method based on source rate estimation |
| WO2004017645A2 (en) * | 2002-08-16 | 2004-02-26 | Cellglide Technologies Corp. | Packet data traffic management system for mobile data networks |
| WO2004019536A2 (en) * | 2002-08-23 | 2004-03-04 | Motorola, Inc. | Pre-negotiated quality of service |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1756176A (en) | 2006-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8385196B2 (en) | Method and apparatus for supporting uplink starvation avoidance in a long term evolution system | |
| US6850540B1 (en) | Packet scheduling in a communications system | |
| EP2080326B1 (en) | System and method of load dependent rate control | |
| CN101554078B (en) | Method for supporting quality of service over a connection lifetime | |
| US9204333B2 (en) | Partitioning entity and method for partitioning capacity | |
| US8526386B2 (en) | System for uplink scheduling packet based data traffic in wireless system | |
| KR101011441B1 (en) | Method and apparatus for performing buffer status reporting | |
| JP4853732B2 (en) | Mobile communication system and communication control method thereof | |
| US20060072503A1 (en) | Method and apparatus for transmitting uplink non-scheduled data in a mobile communication system | |
| CN103517323B (en) | The data transmission method of Wireless Heterogeneous Networks, shunting device, base station equipment | |
| US20040170179A1 (en) | Radio resource management with adaptive congestion control | |
| CN101959245B (en) | Method, device and system for controlling flow in WiMAX (Worldwide Interoperability for Microwave Access) system | |
| JP2011509535A (en) | Trigger optimization method for transmission of buffer status report (BSR) information | |
| US20090104916A1 (en) | Method, apparatus and system for signalling of buffer status information | |
| CN102047745A (en) | Allocating resources within a communication system | |
| WO2001063855A1 (en) | Packet scheduling in umts using several calculated transfer rates | |
| CN101741707B (en) | Uplink data transmission method, device and communication system | |
| CN100479421C (en) | User apparatus and method for carrying out resource scheduling in wireless network | |
| CN103179656B (en) | The synchronization transfer method and system of Business Stream in a kind of heterogeneous network | |
| CN100394725C (en) | Method, wireless network and user device for carrying out resource scheduling | |
| EP2244423A1 (en) | Routing traffic in a cellular communication network | |
| CN101111039A (en) | Business measuring control method used for high speed descending grouping access system | |
| CN100433637C (en) | Base station for carrying out resource scheduling for user device in wireless network and its method | |
| KR101735317B1 (en) | Method and apparatus for allocating resource of base station in mobile communication system | |
| KR100726809B1 (en) | Dynamic bandwidth allocation apparatus and method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C56 | Change in the name or address of the patentee |
Owner name: SHANGHAI ALCATEL-LUCENT CO., LTD. Free format text: FORMER NAME: BEIER AERKATE CO., LTD., SHANGHAI |
|
| CP01 | Change in the name or title of a patent holder |
Address after: 201206 Pudong Jinqiao Export Processing Zone, Nanjing Road, No. 388, Shanghai Patentee after: ALCATEL-LUCENT SHANGHAI BELL Co.,Ltd. Address before: 201206 Pudong Jinqiao Export Processing Zone, Nanjing Road, No. 388, Shanghai Patentee before: Shanghai Bell Alcatel Co.,Ltd. |
|
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 201206 Pudong Jinqiao Export Processing Zone, Nanjing Road, No. 388, Shanghai Patentee after: NOKIA SHANGHAI BELL Co.,Ltd. Address before: 201206 Pudong Jinqiao Export Processing Zone, Nanjing Road, No. 388, Shanghai Patentee before: ALCATEL-LUCENT SHANGHAI BELL Co.,Ltd. |
|
| CX01 | Expiry of patent term | ||
| CX01 | Expiry of patent term |
Granted publication date: 20080611 |