CN100493040C - Method for controlling up-link flow - Google Patents
Method for controlling up-link flow Download PDFInfo
- Publication number
- CN100493040C CN100493040C CNB2006100828417A CN200610082841A CN100493040C CN 100493040 C CN100493040 C CN 100493040C CN B2006100828417 A CNB2006100828417 A CN B2006100828417A CN 200610082841 A CN200610082841 A CN 200610082841A CN 100493040 C CN100493040 C CN 100493040C
- Authority
- CN
- China
- Prior art keywords
- flow
- iub
- rice
- wine
- increment
- 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.)
- Active
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a of ascending flow control method, the key lies in that the establishment of a gradual factor, take the product of IUB residual flow of base stations nodes (NodeB) and gradual factor as a control to distribute IUB flow incremental value to user equipment (UE). NodeB first obtain the predistribute IUB flow incremental value according to the flow scheduling algorithm, and calculate the empty flux according to size information of data packet the UE uploaded; NodeB obtains the IUB flow incremental value distribute to UE according to empty flow, gradual factor and predistribute IUB flow incremental value, finally notice to UE the distributed IUB incremental flow value. Use the scheme of this invention can gradually release the remaining IUB flow resources, control the distribution of IUB incremental flow value to UE, balance empty flow and IUB flux, prevent obstruction of IUB interface and overflows the cache phenomenon.
Description
Technical field
The present invention relates to flow control technique, particularly relate to a kind of uplink traffic control method.
Background technology
High speed uplink bag data insert (HSUPA, High Speed Uplink Packet Access) technology is the transmitting uplink data enhancement techniques that third generation co-operative project (3GPP) is organized to set up, the main compound automatic repeat requests (HARQ that adopts compound re-transmission, Hybrid Automatic RetransmissionQuest) technology, base-station node (NodeB, Node Base Station) fast dispatch technology and up 2ms lack frame technique, can improve the throughput and the system uplink capacity of uplink user data.
Because the raising of ascending idle port speed will directly influence the demand of up IUB interface flow, so NodeB generally need have the flow scheduling function, make and eat dishes without rice or wine to reach balance between speed and the IUB bandwidth, it is congested to reduce IUB, promptly uplink traffic is controlled.
Existing uplink traffic control method generally is to determine to distribute to the IUB flow increment of UE according to eat dishes without rice or wine flow and IUB interface residual flow situation.In actual applications, because UE may retransmit phenomenon when eating dishes without rice or wine to upload packet, the variation of the flow of eating dishes without rice or wine can not in time be reflected in the variation of IUB flow.That is to say, take place to retransmit in the process of phenomenon that NodeB will distribute the IUB flow increment for other UE according to eat dishes without rice or wine flow and the IUB interface residual flow of current reality at certain UE.So, when the UE that takes place to retransmit successfully sends to NodeB with packet, may cause the imbalance between flow and the IUB interface flow of eating dishes without rice or wine, even cause that buffer memory overflows, and causes packet loss.
This shows that prior art can not make eats dishes without rice or wine to keep balance between flow and the IUB interface flow.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of uplink traffic control method, can make to eat dishes without rice or wine to keep balance between flow and the IUB interface flow.In order to achieve the above object, the technical scheme of the present invention's proposition is:
A kind of uplink traffic control method sets in advance the gradual change factor, and this method may further comprise the steps:
A, base-station node NodeB obtain preassignment IUB flow increment according to flow scheduling algorithm, and obtain to eat dishes without rice or wine flow according to the size that the user equipment (UE) that correctly receives is uploaded packet;
B, NodeB for the IUB bandwidth that takies, obtain the IUB remaining bandwidth according to the IUB total bandwidth with the IUB bandwidth that takies with the flow rate conversion of eating dishes without rice or wine according to the corresponding relation of eating dishes without rice or wine between flow and the IUB interface flow again;
C, with the product of the IUB remaining bandwidth and the gradual change factor as available IUB flow increment;
D, whether judge preassignment IUB flow increment greater than available IUB flow increment, if, then with available IUB flow increment as the IUB flow increment of distributing to UE; Otherwise, preassignment IUB flow increment as the IUB flow increment of distributing to UE, and is notified to UE.
Preferably, the described NodeB of step a according to the method that flow scheduling algorithm obtains preassignment IUB flow increment is:
NodeB earlier obtains to be pre-assigned to the flow increment of eating dishes without rice or wine of UE according to flow scheduling algorithm, again according to the corresponding relation of eating dishes without rice or wine between flow and the IUB flow, the preassignment flow increment of eating dishes without rice or wine is scaled preassignment IUB flow increment.
Preferably, be set the Flow Control cycle in NodeB, the described size of uploading packet according to UE of step a obtain the to eat dishes without rice or wine method of flow is:
The packet size total amount that NodeB statistics received in the Flow Control cycle, and when the Flow Control end cycle, with packet size total amount and the ratio in Flow Control cycle as the flow of eating dishes without rice or wine.
Preferably, the described IUB flow increment that will distribute to UE of the step b method that is notified to UE is:
NodeB is scaled the flow increment of eating dishes without rice or wine according to IUB flow and the corresponding relation between the flow of eating dishes without rice or wine with the IUB flow increment of distributing to UE, and the flow increment of will eating dishes without rice or wine again sends to UE by scheduling authorization SG message.
Preferably, this method further comprises:
For the described gradual change factor gradual period is set in NodeB, the statistics average discharge of eating dishes without rice or wine in each gradual period, and when end cycle is judged the flow whether average discharge of eating dishes without rice or wine is supported greater than the IUB total bandwidth, if then reduce the described gradual change factor; Otherwise, increase the described gradual change factor.
Preferably, the described method that reduces the described gradual change factor is: the described gradual change factor is reduced by a step-length;
The method of the described gradual change factor of described increase is: the described gradual change factor is increased a step-length.
In sum, the present invention compared with prior art, by the gradual change factor that can make eat dishes without rice or wine flow and IUB flow maintenance balance is set, after utilizing flow scheduling algorithm to determine to be pre-assigned to the IUB flow increment of UE, determine the IUB flow increment of actual allocated by the product of the IUB residual flow and the gradual change factor to UE, thereby eat dishes without rice or wine when guaranteeing to retransmit still can keep balance between flow and the IUB flow, and then avoid overflowing even packet loss because of the buffer memory that imbalance causes.
Description of drawings
Fig. 1 is the present invention program's a flow chart;
Fig. 2 is a flow chart of using the present invention program's embodiment.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with the accompanying drawings and the specific embodiments.
Basic thought of the present invention is: determine preassignment IUB flow increment according to flow scheduling algorithm, will compare according to available IUB flow increment and the preassignment IUB flow increment that the gradual change factor obtains, and therefrom determine to distribute to the IUB flow increment of UE.
Fig. 1 has shown that the present invention realizes the flow chart of uplink traffic control method.As shown in Figure 1, the present invention realizes that the method for uplink traffic control may further comprise the steps:
Step 101:NodeB obtains preassignment IUB flow increment according to flow scheduling algorithm, and obtains to eat dishes without rice or wine flow according to the size that the UE that correctly receives uploads packet.
In the practical application, on the one hand, UE is in Transmission Time Interval (TTI), send packet to eating dishes without rice or wine by the Dedicated Physical Data Channel (EDPDCH) that strengthens, and send the transformat indication information such as (ETFCI) of the enhancing of this packet size of indication simultaneously by the Dedicated Physical Control Channel (E-DPCCH) that strengthens.Owing to may there be the re-transmission phenomenon, NodeB may not correctly receive packet and the packet size that UE uploads.When NodeB correctly receives the packet of UE transmission, can from the E-DPCCH channel, demodulate ETFCI information, thereby obtain this packet size information.NodeB can add up the packet size total amount that Flow Control receives in the cycle, and with packet size total amount and the ratio in Flow Control cycle as the flow of eating dishes without rice or wine.
On the other hand, NodeB will obtain preassignment IUB flow increment according to flow scheduling algorithm.Flow scheduling algorithm described here is that NodeB uploads the algorithm that factors such as packet situation, UE schedule information (SI) and cell load determine to distribute interface-free resources to UE according to UE.Described SI information comprises that UE takies situations such as self caching situation, UE dump power.Such as: the SI information that certain UE reports shows that this UE has taken 90% of self buffer memory, the current actual loading in sub-district be the sub-district always support ability 40%, then NodeB can distribute more IUB flow for UE, to alleviate the situation that this UE takies self buffer memory.
As for how to wait to determine that according to cell load, UE buffer memory operating position, UE dump power preassignment IUB flow increment belongs to prior art, no longer be described in detail herein.
The IUB flow increment that step 102:NodeB distributes to UE according to the gradual change factor and the acquisition of preassignment IUB flow increment of eat dishes without rice or wine flow, setting.
The described gradual change factor of this step be one greater than 0, and less than 1 value, can guarantee to eat dishes without rice or wine flow and IUB interface flow keep balance.That is to say, NodeB will all remain the IUB flow and preassignment IUB flow increment compares entirely, but will partly remain the IUB flow and preassignment IUB flow increment compares, and determine that according to comparable situation actual allocated gives the IUB flow increment of UE, eat dishes without rice or wine when avoiding UE take place to retransmit phenomenon imbalance between flow and the IUB interface flow, and the buffer memory of the NodeB that causes because of imbalance overflows even packet loss.
In the practical application, the value of the gradual change factor is relevant with situations such as the flow of eating dishes without rice or wine, IUB bandwidth, UE number of retransmissions, need determine according to actual conditions.The method of determining the gradual change factor values is a lot, as long as enough little, and guarantees to eat dishes without rice or wine flow and IUB flow equilibrium, the phenomenon that buffer memory overflows does not take place get final product.
In actual applications, can before the formal use of NodeB, be determined by experiment the value of a suitable gradual change factor, and this gradual change factor is arranged among the NodeB.Such as: with IUB total bandwidth n five equilibrium, establish gradual change factor initial value and be set to 1/n, step-length is 1/n, and the acquisition methods of the then gradual change factor is:
Y1, judge the flow whether flow of eating dishes without rice or wine can be supported greater than the IUB total bandwidth, if, execution in step Y2 then; Otherwise,, and withdraw from this flow process with the value of 1/n as the gradual change factor;
The flow that IUB total bandwidth described here can be supported just is meant the IUB flow.That is to say that when the flow of eating dishes without rice or wine was not more than the flow that the IUB total bandwidth can support, eat dishes without rice or wine flow and IUB flow just can keep balance, the phenomenon that the buffer memory of NodeB overflows can not take place.
Y2, with the value of n+1 currency as n, and with IUB total bandwidth n five equilibrium, the initial value of establishing the gradual change factor is set to 1/n, step-length is set to 1/n, returns step Y1.
In the practical application, can be not among the step Y2 yet with the value of n+1 currency as n, but with the multiple of n such as 2n or the 3n currency as n, as long as new n value is greater than the value of n originally, value that promptly can the refinement gradual change factor gets final product.
Step 103:NodeB gives UE with the IUB flow increment advisory of distributing.
For the present invention program is described better, will the method that realize uplink traffic control be described with a preferred embodiment below.
In the present embodiment, be provided with a gradual change factor that makes eat dishes without rice or wine flow and IUB flow maintenance balance in NodeB, the value of the gradual change factor is 0.1, and the step-length of the gradual change factor is 0.1.In the present embodiment, Transmission Time Interval (TTI) is 10 milliseconds, and the Flow Control cycle is 10 milliseconds, and gradual period is 50 milliseconds.
In the practical application, the Flow Control cycle can be equal to or greater than TTI, and gradual period can be equal to or greater than the Flow Control cycle.
Fig. 2 has shown the present embodiment flow chart.As shown in Figure 2, present embodiment realizes that the step of uplink traffic control method comprises:
Step 201: the flow increment of eating dishes without rice or wine that obtains to be pre-assigned to UE according to flow scheduling algorithm.
Step 202:, the preassignment flow increment of eating dishes without rice or wine is scaled preassignment IUB flow increment according to the corresponding relation of eating dishes without rice or wine between flow and the IUB flow.
In the practical application,, can cause same packet different with the flow that takies at the IUB interface at the flow of eating dishes without rice or wine to take owing to the data packet format that receives the UE transmission from eating dishes without rice or wine is different to the data packet format that the IUB interface sends with NodeB.So, the corresponding relation of general existence between flow and the IUB flow of eating dishes without rice or wine.Corresponding relation described here is relevant with actual data format, but in general, the 1M flow correspondence 1.5M IUB flow of eating dishes without rice or wine.So, the preassignment flow increment of eating dishes without rice or wine be multiply by 1.5 and just can be scaled preassignment IUB flow increment.
Step 203: the packet size total amount that receives in the statistics Flow Control cycle, and when the Flow Control end cycle, with packet size total amount and the ratio in Flow Control cycle as the flow of eating dishes without rice or wine.
Step 204:, be with the IUB bandwidth that takies with the flow rate conversion of eating dishes without rice or wine according to the corresponding relation of eating dishes without rice or wine between flow and the IUB flow.
In the practical application, the flow of eating dishes without rice or wine be multiply by 1.5 just can obtain the IUB bandwidth that to take.
Step 205: obtain the IUB remaining bandwidth according to the IUB total bandwidth with the IUB bandwidth that takies.
In this step, the IUB total bandwidth is the IUB remaining bandwidth with the difference of the IUB bandwidth that will take.
Step 206: obtain available IUB flow increment according to the IUB remaining bandwidth and the gradual change factor.
In this step, described available IUB flow increment is exactly the product of the IUB remaining bandwidth and the gradual change factor.That is to say, will remain the part of IUB flow as available IUB flow increment.
Step 210: the IUB flow increment of distributing to UE that will determine is notified to UE.
NodeB will be scaled the flow increment of eating dishes without rice or wine with the IUB flow increment of distributing to UE according to IUB flow and the corresponding relation between the flow of eating dishes without rice or wine, and the flow increment of eating dishes without rice or wine that will distribute to UE is given UE by scheduling authorization (SG) message informing.In the practical application, NodeB is not that the flow increment of eating dishes without rice or wine that directly will distribute to UE is notified to UE, but notice UE promptly notifies UE the speed lifting increment of eating dishes without rice or wine in the Edpdch/Dpcch power ratio that next TTI can use.Like this, UE just can upload packet according to higher power to eating dishes without rice or wine, thereby increases eat dishes without rice or wine flow and IUB flow.
In the practical application,, UE changes, so need to adjust in real time the value of the gradual change factor because uploading the situation of packet.Such as, when residue IUB flow is far longer than available IUB flow increment, just can the gradual change factor be set to bigger value, thereby accelerate the speed that UE distributes the IUB flow increment.
Among the present invention, the method of adjusting the value of the gradual change factor is: for the gradual change factor gradual period is set in NodeB, in each gradual period, add up the average discharge of eating dishes without rice or wine, and when gradual period finishes, judge the flow whether average discharge of eating dishes without rice or wine is supported greater than the IUB total bandwidth, if then reduce the gradual change factor; Otherwise, increase the gradual change factor.
In the practical application, in the time of when gradual period finishes, need reducing the gradual change factor, the gradual change factor can be reduced by a step-length; In the time of when gradual period finishes, need increasing the gradual change factor, the gradual change factor can be increased a step-length.If the step-length of the gradual change factor is provided with smallerly, also can increase or reduce the value that more than one step-length is upgraded the gradual change factor, to accelerate the speed that UE distributes the IUB flow increment.Such as: the gradual change factor is set to 0.1, and step-length is 0.1 can guarantee to eat dishes without rice or wine to keep balance between flow and the IUB interface flow, but the gradual change factor is set to 0.01 in the reality, and step-length also is 0.01.So, when needs increase the gradual change factor, just the gradual change factor can be increased maximum 10 step-lengths.
Gradual period described here can be more than or equal to the Flow Control cycle.That is to say that in a gradual period, the product that NodeB always will remain IUB flow and some fixing gradual change factors distributes the basis of IUB flow increment to UE as control.If but when gradual period finished, if the flow that the average discharge of eating dishes without rice or wine is supported less than the IUB total bandwidth, then NodeB need accelerate to distribute to UE the speed of IUB flow increment, such as the gradual change factor is increased a step-length; On the contrary, if the flow that the average discharge of eating dishes without rice or wine is supported more than or equal to the IUB total bandwidth, then NodeB thinks the danger of impacting buffer memory, need slow down the speed of distributing the IUB flow increment to UE, such as the gradual change factor is reduced by a step-length.So the flow that the flow of eating dishes without rice or wine can always be supported in the IUB total bandwidth vibrates up and down, not only keep eating dishes without rice or wine flow and IUB flow equilibrium, and the IUB interface can be used fully.
In sum, more than be preferred embodiment of the present invention only, be not to be used to limit protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (6)
1, a kind of uplink traffic control method is characterized in that, sets in advance the gradual change factor, and this method may further comprise the steps:
A, base-station node NodeB obtain preassignment IUB flow increment according to flow scheduling algorithm, and obtain to eat dishes without rice or wine flow according to the size that the user equipment (UE) that correctly receives is uploaded packet;
B, NodeB for the IUB bandwidth that takies, obtain the IUB remaining bandwidth according to the IUB total bandwidth with the IUB bandwidth that takies with the flow rate conversion of eating dishes without rice or wine according to the corresponding relation of eating dishes without rice or wine between flow and the IUB interface flow again;
C, with the product of the IUB remaining bandwidth and the gradual change factor as available IUB flow increment;
D, whether judge preassignment IUB flow increment greater than available IUB flow increment, if, then with available IUB flow increment as the IUB flow increment of distributing to UE; Otherwise, preassignment IUB flow increment as the IUB flow increment of distributing to UE, and is notified to UE.
2, method according to claim 1 is characterized in that, the described NodeB of step a according to the method that flow scheduling algorithm obtains preassignment IUB flow increment is:
NodeB earlier obtains to be pre-assigned to the flow increment of eating dishes without rice or wine of UE according to flow scheduling algorithm, again according to the corresponding relation of eating dishes without rice or wine between flow and the IUB flow, the preassignment flow increment of eating dishes without rice or wine is scaled preassignment IUB flow increment.
3, method according to claim 1 is characterized in that, the Flow Control cycle is set in NodeB, and the described size of uploading packet according to UE of step a obtain the to eat dishes without rice or wine method of flow is:
The packet size total amount that NodeB statistics received in the Flow Control cycle, and when the Flow Control end cycle, with packet size total amount and the ratio in Flow Control cycle as the flow of eating dishes without rice or wine.
4, method according to claim 1 is characterized in that, the method that the described IUB flow increment that will distribute to UE of step b is notified to UE is:
NodeB is scaled the flow increment of eating dishes without rice or wine according to IUB flow and the corresponding relation between the flow of eating dishes without rice or wine with the IUB flow increment of distributing to UE, and the flow increment of will eating dishes without rice or wine again sends to UE by scheduling authorization SG message.
5, according to each described method of claim 1 to 4, it is characterized in that this method further comprises:
For the described gradual change factor gradual period is set in NodeB, the statistics average discharge of eating dishes without rice or wine in each gradual period, and when end cycle is judged the flow whether average discharge of eating dishes without rice or wine is supported greater than the IUB total bandwidth, if then reduce the described gradual change factor; Otherwise, increase the described gradual change factor.
6, method according to claim 5 is characterized in that,
The described method that reduces the described gradual change factor is: the described gradual change factor is reduced by a step-length;
The method of the described gradual change factor of described increase is: the described gradual change factor is increased a step-length.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100828417A CN100493040C (en) | 2006-06-13 | 2006-06-13 | Method for controlling up-link flow |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2006100828417A CN100493040C (en) | 2006-06-13 | 2006-06-13 | Method for controlling up-link flow |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1984067A CN1984067A (en) | 2007-06-20 |
| CN100493040C true CN100493040C (en) | 2009-05-27 |
Family
ID=38166313
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2006100828417A Active CN100493040C (en) | 2006-06-13 | 2006-06-13 | Method for controlling up-link flow |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100493040C (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102457909B (en) * | 2010-10-27 | 2014-05-14 | 普天信息技术研究院有限公司 | Iub port flow control method based on target buffer |
| CN102546042B (en) * | 2010-12-14 | 2014-08-13 | 普天信息技术研究院有限公司 | Empty rate statistical method |
| CN102355687B (en) * | 2011-10-12 | 2014-03-12 | 西安新邮通信设备有限公司 | Keep-alive method of special operation maintenance link for IUB based on InATMARP protocol |
| CN103379038B (en) * | 2012-04-12 | 2018-08-03 | 南京中兴新软件有限责任公司 | A kind of device and method of flow scheduling |
| CN105517047B (en) * | 2015-11-26 | 2018-11-27 | 京信通信系统（中国）有限公司 | Base station flow shaping method and system |
-
2006
- 2006-06-13 CN CNB2006100828417A patent/CN100493040C/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN1984067A (en) | 2007-06-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100466628C (en) | Method and device for allocating cache quene threshold, and its flow control method and device | |
| CN102104908B (en) | Data transmission control method and equipment | |
| CN100592817C (en) | A method and device for realizing the dynamic QoS control during the dispatching of HSUPA base station | |
| CN101043638B (en) | Base station dispatcher, resource distribution module and dispatch control method for HSUPA | |
| CN101742564B (en) | Authorization allocating method and device of HSUPA (high speed uplink packet access) network | |
| CN101340358A (en) | Flow control method, system and flow control entity | |
| CN100493040C (en) | Method for controlling up-link flow | |
| CN102196546B (en) | Uplink control method for reducing error rate of TD-HSUPA (Time Division-High Speed Uplink Packet Access) | |
| WO2015065051A1 (en) | Method for controlling transmission power and transmission delay, and communication terminal using same | |
| CN101170388B (en) | Method for identifying whether resending protocol data unit is sectioned | |
| CN101170389B (en) | Method for selecting first transmission block size of protocol data unit at radio link control layer | |
| CN102572959A (en) | Distribution network access layer communication system construction method based on long term evolution (LTE) technique | |
| CN102404832A (en) | Method for allocating uplink power resources and device for allocating uplink power resources | |
| CN101296003A (en) | Power control method and system for reinforced uplink transmitting scheduling information | |
| CN101877905B (en) | Method and device for controlling power of downlink control channel | |
| CN101854622B (en) | High-speed uplink packet access terminal and data transmission method thereof | |
| CN101141671B (en) | Load control method in high speed uplink packet access cell | |
| CN100459578C (en) | A method to acquire downlink data from upper network equipment by cell base station | |
| EP2045980A1 (en) | Radio communication system, radio communication method and base station | |
| CN102104464A (en) | Retransmission method and device of high-speed uplink packet access terminal | |
| CN101136667B (en) | Uplink reinforced ring closure synchronous power control and auxiliary scheduling information transmission system and method | |
| CN102457909B (en) | Iub port flow control method based on target buffer | |
| CN101383680B (en) | Transmission format selecting method for reinforced dedicated channel | |
| CN101483869B (en) | Resource scheduling processing method and apparatus | |
| CN1835472A (en) | Schedling method of packet system |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20211227 Address after: 450046 Floor 9, building 1, Zhengshang Boya Plaza, Longzihu wisdom Island, Zhengdong New Area, Zhengzhou City, Henan Province Patentee after: Super fusion Digital Technology Co.,Ltd. Address before: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen Patentee before: HUAWEI TECHNOLOGIES Co.,Ltd. |
|
| TR01 | Transfer of patent right |