CN1152313C - Section-by-section congestion control method based on random early detection - Google Patents
Section-by-section congestion control method based on random early detection Download PDFInfo
- Publication number
- CN1152313C CN1152313C CNB001303678A CN00130367A CN1152313C CN 1152313 C CN1152313 C CN 1152313C CN B001303678 A CNB001303678 A CN B001303678A CN 00130367 A CN00130367 A CN 00130367A CN 1152313 C CN1152313 C CN 1152313C
- Authority
- CN
- China
- Prior art keywords
- section
- flow
- router
- control method
- early detection
- 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 - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000001514 detection method Methods 0.000 title claims abstract description 23
- 238000011144 upstream manufacturing Methods 0.000 claims abstract description 13
- 238000011084 recovery Methods 0.000 claims description 13
- 230000005540 biological transmission Effects 0.000 claims description 7
- 230000015572 biosynthetic process Effects 0.000 claims description 7
- 238000012795 verification Methods 0.000 claims description 3
- 230000007547 defect Effects 0.000 abstract 1
- 230000002349 favourable effect Effects 0.000 abstract 1
- 230000004044 response Effects 0.000 description 2
- 230000033228 biological regulation Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012886 linear function Methods 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a section-by-section congestion control method based on random early detection, which comprises a flow control information protocol, a congestion detection method based on the flow control information protocol, a router flow control method and a host flow control method; all nodes in the network detect congestion states by using the improved random early detection algorithm, and transmits flow control information to adjacent upstream nodes before congestion occurs; when the nodes receive the flow control information, the nodes control the flow so as to avoid and reduce congestion of network data and overcome the defects of the existing network congestion control; meanwhile, since the network nodes do not need to store the state information pieces which are connected with each other, the network nodes have favorable expandability.
Description
Technical field
The present invention relates to a kind ofly, belong to computer network field based on the section-by-section congestion control method of (Random Early Detection is called for short RED) of early detection at random.
Background technology
Present Internet (Internet) has been developed into the integrated services network of multimedia messagess such as transmitting data, voice, video by single DTN in the past.Along with network application and user's continuous increase, Internet often takes place congested, has caused the decline of service quality such as data transmission time-delay, shake, and network resource utilizations such as bandwidth, buffer memory are reduced, and under opposite extreme situations, can cause whole periods of network disruption.
Jamming control method on Internet is to be the end-to-end control based on window technique of core with TCP at present.This method mainly is with the signal of packet loss as congested generation, after transmitting terminal is confirmed issued data-bag lost, reduces transmission speed, alleviate congestion by reducing congestion window.But, because the continuous growth of Internet scale, from network node congested (packet loss) taking place reduces the response cycle of length of flow to transmitting terminal, and this moment, transmitting terminal still sent data at a high speed, this can cause more massive congested, therefore can not rely on all transmitting terminal control congested fully.
The another kind of method of Chu Xianing was by the congested control of joint in recent years.Its some status information by utilizing every connection (as the size of buffer zone and transmission speed etc.) are implemented congested control on each network node of data stream process.But this method will be preserved some status informations of every connection in network node, and when number of connection increased, memory capacity and processing time also increased thereupon, thereby this method does not have good expandability on the Internet backbone network.
Summary of the invention
Fundamental purpose of the present invention is to propose a kind of section-by-section congestion control method based on RED, and each network node detects congestion state with improved RED algorithm, before congested generation to contiguous upstream node transmitted traffic control information; When node is received flow control information, implement flow control, avoid and alleviate congestedly, overcome the defective of the congested control of existing network.
Provided by the invention based on the section-by-section congestion control method of early detection at random, comprise the steps:
A, the average length of data packet queue and the upper and lower bound of predefined formation average length are made comparisons;
B, when the average length of data packet queue between upper and lower limit, then think might take place congested; Calculate the probability of mark, and whether the packet that will join the team is made marks according to this probability decision; Otherwise commentaries on classics steps d;
C, router are to sending this flow control information protocol massages of the upstream node transmission " reduction flow " of the packet of mark;
D, when the average length of data packet queue less than lower limit, packet is not marked; Otherwise this bag is abandoned;
If e before this, sent the flow control information protocol massages of " reduction flow ", send the flow control information protocol massages of " recovery flow " again;
After f, upstream node are received message, the corresponding operation of carrying out " reduction flow " or " recovery flow ".
According to said method of the present invention, described flow control information protocol massages be one between the IP of TCP/IP protocol suite layer and the data link layer, be used between the neighboring router and router and main frame between the message format of switching congestion status information.
According to said method of the present invention, described flow control information protocol massages form is provided with: be used to verify transmit leg and take over party the conforming version number of message format territory, message length territory, type of message territory, the code domain that is used to represent router type, source IP address territory, purpose IP address field, source port number territory, destination slogan territory, be used to guarantee the verification territory and the region filling of the integrality of message data.
According to said method of the present invention, described flow control information protocol massages type comprises to be recovered the flow type of message and reduces the flow type of message.
According to said method of the present invention, described router type comprises edge router that is connected with transmitting terminal main frame or receiving end main frame and the internal router that only is connected with router.
According to said method of the present invention, described step a) begins when data packet queue arrives this node.
According to said method of the present invention, if upstream node is router, then receive message after, the concrete operations of carrying out " reduction flow " or " recovery flow " are as follows:
A, router are by " token bucket algorithm " calculated flow rate;
B, when receiving the flow control information protocol massages of " reduction flow ", will leak ladle capacity and reduce by half;
C, will leak ladle capacity every a time interval of setting and add 1 data package length, but the initial capacity that maximal value is no more than Lou barrel;
D, when receiving the flow control information protocol massages of " recovery flow ", recover to leak the initial capacity of bucket immediately.
According to said method of the present invention, described token bucket algorithm is following steps:
1) produces token with certain speed, when token bucket is full, stop the generation of token;
2) when packet arrives,, send packet after then taking out a token if token is arranged in the token bucket; Otherwise packet is placed on the appearance of waiting for token in the buffer zone;
3) when buffer zone is full, abandon the packet of arrival.
According to said method of the present invention, if upstream node is main frame, then receive message after, the concrete operations of carrying out " reduction flow " or " recovery flow " are as follows:
The socket that a, main frame connect according to the corresponding TCP of information searching in each territory in the flow control information protocol massages of being sent by edge router;
B, find corresponding socket after, if TCP did not reduce flow in a lasted two-way time, " reduction flow " request will be responded once by quilt in this two-way time, TCP is with congestion window and start critical value slowly and reduce by half;
If c should " reduction flow " request be that packet loss causes, the congested control procedure of TCP allocating conventional.
According to said method of the present invention, described two-way time be a packet from a main frame arrive another main frame return then the used time and.
According to said method of the present invention, the congested control procedure of described routine is for being the end-to-end control mode based on window technique of core with TCP.
According to said method of the present invention, described congestion window be TCP the unloading phase use or be to reduce the window that flow uses in congested period.
According to said method of the present invention, the described critical value that starts slowly is: slow the unloading phase, the increase mode of congestion window is by the congestion window quantity of changing in index increase mode when increasing mode with linearity.
The present invention just begins to carry out early stage congestion detection when data packet queue arrives this node, utilization is based on section-by-section congestion control method and flow control information agreement (the Flow Control MessageProtocol of RED, abbreviation FCMP) transmission of message, adopt router flow control and main frame flow control, make before the network generation is congested, just to have obtained flow control; Because congested control is to carry out between adjacent node, the response speed that it has accelerated congested control, making packet loss is zero, and the data time-delay is shortened, and the shake of time-delay reduces; And each node of the present invention does not need to preserve the status information of connection, is with good expansibility.
Description of drawings
Fig. 1 is the congested control flow synoptic diagram of one embodiment of the invention.
Fig. 2 is the FCMP message format of one embodiment of the invention.
Fig. 3 is the congestion detection control flow of transmitting terminal with the router for one embodiment of the invention.
Fig. 4 is the congested control flow of receiving end of receiving end with the router for one embodiment of the invention.
Fig. 5 is the congested control flow of receiving end of receiving end with the main frame for one embodiment of the invention.
Embodiment
The congested control flow of the present invention as shown in Figure 1, it comprises a transmitting terminal 1, a receiving terminal 4 and is no less than two router two, 3.Packet is sent by transmitting terminal 1, after some router twos, 3 transmission, is received by receiving end 4.Among router two or 3, the corresponding data packet queue 24 or 34 that each packet that is sent by the last node by this router two or 3 is formed.Its original TCP congestion control program 11 and 41 is respectively arranged in transmitting terminal 1 and receiving end 4; And among router two or 3, have additional correspondingly FCMP message protocol 21 or 31, congestion detection program 22 or 32, flow control program 23 or 33.
As shown in Figure 2: the FCMP message comprises following information field: the version number territory, and it is used to verify whether transmit leg and take over party's message format is consistent; The message length territory, it points out this message length; The type of message territory, its type of pointing out the FCMP message is " recovery flow " or " reduction flow "; Code domain, its last node of pointing out present node is main frame or router; Source IP address, it points out the IP address of transmitting terminal main frame; Purpose IP address, it points out the IP address of receiving end main frame; Source port number, it points out the port numbers of the transmitting terminal main frame that TCP connects; The destination slogan, it points out the port numbers of the receiving end main frame that TCP connects; The verification territory, it is used to deposit the check information of the integrality that guarantees message data; Region filling, it is made of the difference between the length value of this message physical length and regulation, fills with " 0 ".
As Fig. 1 and shown in Figure 3: when the packet that sends when upstream node arrived router two or 3, its congestion detection program 22 or 32 was made comparisons the upper and lower bound of the average length of the average length of data packet queue 24 or 34 and this formation 24 or 34.When this average length is between upper and lower limit, promptly think this moment might take place congested, calculating probability P
a, and according to this probability P
aThis packet is made marks.To the packet of mark, router two or 3 sends " reduction flow " FCMP messages to the upstream nodes that send this packet; Prescribe a time limit less than following when average length, this packet is not marked,, sent the FCMP message of " reduction flow " if before this, send " recovery flow " FCMP message again; This packet is added among the data packet queue 24 or 34 of router two or 3; Prescribe a time limit greater than last when average length, abandon this packet.
When router two when its upstream node sends the FCMP message, if this router two is an edge router, then router two only sends " reduction flow " FCMP message.
The following formula of the basis of above-mentioned average queue length:
If formation not empty (q＞0), then: avg ← (1-W
q) * avg+W
q* q
Otherwise: m ← f (time-q_time)
avg←(1-W
q)
m×avg
Wherein: the avg=average queue length; The time=current time; The starting point of q_time=formation free time; W
qThe weight of=formation; The physical length of q=formation; The linear function of f (t)=time t;
The following formula of basis and the step of above-mentioned mark probability:
Count is added 1;
P
b←P
max(avg-TH
min)/(TH
max-TH
min)
P
a←P
b/(1-count×P
b)
Wherein: last one " reduction flow " FCMP message of count=sends the packet count of back packet
TH
MinThe lower limit of=queue length;
TH
MaxThe upper limit of=queue length;
P
b=calculating intermediate value;
P
Max=P
bMaximal value;
P
aThe probability that the grouping of=current data packet marks.
As Fig. 1 and shown in Figure 4: router two or 3 is controlled the flow of this node by " token bucket algorithm "; When router two or 3 is received " reduction flow " FCMP message, it will leak ladle capacity and reduce half, then every certain time interval, will leak ladle capacity and add 1 data package length, but maximal value be no more than the initial capacity of this leakage bucket; When router two or 3 is received " recovery flow " FCMP message, recover the initial capacity of this leakage bucket immediately.
Described " token bucket algorithm " is: this node router produces token with certain speed, and router stops producing token when token bucket is full; When a packet arrives this node router,, then take out and send this packet behind the token if token is arranged in the token bucket; Otherwise this packet is placed on the appearance of waiting for token in the buffer zone of router; When the buffer zone of this node router is expired, then abandon the packet that arrives this section point router.
As Fig. 1 and shown in Figure 5: the socket (Socket) that the main frame of transmitting terminal 1 connects according to the corresponding TCP of information searching in each territory in the FCMP message that is sent by edge router 2; If find corresponding socket, and if TCP did not reduce flow in a last two-way time, the request of flow control will be responded once in this two-way time; If this flow control request is caused that by packet loss TCP then calls original congested control procedure; Otherwise TCP is with congestion window and start critical value slowly and reduce by half.If do not find corresponding socket, then report an error, finish.
Claims (13)
1, a kind of based on the section-by-section congestion control method of early detection at random, it is characterized in that: comprise the steps:
A, the average length of data packet queue and the upper and lower bound of predefined formation average length are made comparisons;
B, when the average length of data packet queue between upper and lower limit, then think might take place congested; Calculate the probability of mark, and whether the packet that will join the team is made marks according to this probability decision; Otherwise commentaries on classics steps d;
C, router are to sending this flow control information protocol massages of the upstream node transmission " reduction flow " of the packet of mark;
D, when the average length of data packet queue less than lower limit, packet is not marked; Otherwise this bag is abandoned;
If e before this, sent the flow control information protocol massages of " reduction flow ", send the flow control information protocol massages of " recovery flow " again;
After f, upstream node are received message, the corresponding operation of carrying out " reduction flow " or " recovery flow ".
2, as claimed in claim 1 based on the section-by-section congestion control method of early detection at random, it is characterized in that: described flow control information protocol massages be one between the IP of TCP/IP protocol suite layer and the data link layer, be used between the neighboring router and router and main frame between the message format of switching congestion status information.
3, as claimed in claim 2 based on the section-by-section congestion control method of early detection at random, it is characterized in that: described flow control information protocol massages form is provided with: be used to verify transmit leg and take over party the conforming version number of message format territory, message length territory, type of message territory, the code domain that is used to represent router type, source IP address territory, purpose IP address field, source port number territory, destination slogan territory, be used to guarantee the verification territory and the region filling of the integrality of message data.
4, as claimed in claim 3 based on the section-by-section congestion control method of early detection at random, it is characterized in that: described flow control information protocol massages type comprises to be recovered the flow type of message and reduces the flow type of message.
5, as claimed in claim 3 based on the section-by-section congestion control method of early detection at random, it is characterized in that: described router type comprises edge router that is connected with transmitting terminal main frame or receiving end main frame and the internal router that only is connected with router.
6, as claimed in claim 1 based on the section-by-section congestion control method of early detection at random, it is characterized in that: described step a) begins when data packet queue arrives this node.
7, as claimed in claim 1 based on the section-by-section congestion control method of early detection at random, it is characterized in that: if upstream node is a router, then receive message after, the concrete operations of carrying out " reduction flow " or " recovery flow " are as follows:
A, router are by " token bucket algorithm " calculated flow rate;
B, when receiving the flow control information protocol massages of " reduction flow ", will leak ladle capacity and reduce by half;
C, will leak ladle capacity every a time interval of setting and add 1 data package length, but the initial capacity that maximal value is no more than Lou barrel;
D, when receiving the flow control information protocol massages of " recovery flow ", recover to leak the initial capacity of bucket immediately.
8, as claimed in claim 7 based on the section-by-section congestion control method of early detection at random, it is characterized in that: described token bucket algorithm is following steps:
A, produce token, when token bucket is full, stop the generation of token with certain speed;
B, when packet arrives, if token is arranged in the token bucket, send packet after then taking out a token; Otherwise packet is placed on the appearance of waiting for token in the buffer zone;
C, when buffer zone is full, abandon the packet of arrival.
9, as claimed in claim 1 based on the section-by-section congestion control method of early detection at random, it is characterized in that: if upstream node is a main frame, then receive message after, the concrete operations of carrying out " reduction flow " or " recovery flow " are as follows:
The socket that a, main frame connect according to the corresponding TCP of information searching in each territory in the flow control information protocol massages of being sent by edge router;
B, find corresponding socket after, if TCP did not reduce flow in a lasted two-way time, " reduction flow " request will be responded once by quilt in this two-way time, TCP is with congestion window and start critical value slowly and reduce by half;
If c should " reduction flow " request be that packet loss causes, the congested control procedure of TCP allocating conventional.
10, as claimed in claim 9 based on the section-by-section congestion control method of early detection at random, it is characterized in that: described two-way time be a packet from a main frame arrive another main frame return then the used time and.
11, as claimed in claim 9 based on the section-by-section congestion control method of early detection at random, it is characterized in that: the congested control procedure of described routine is for being the end-to-end control mode based on window technique of core with TCP.
12, as claimed in claim 9 based on the section-by-section congestion control method of early detection at random, it is characterized in that: described congestion window be TCP the unloading phase use or be to reduce the window that flow uses in congested period.
13, as claimed in claim 9 based on the section-by-section congestion control method of early detection at random, it is characterized in that: the described critical value that starts slowly is: slow the unloading phase, the increase mode of congestion window is by the congestion window quantity of changing in index increase mode when increasing mode with linearity.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB001303678A CN1152313C (en) | 2000-11-02 | 2000-11-02 | Section-by-section congestion control method based on random early detection |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB001303678A CN1152313C (en) | 2000-11-02 | 2000-11-02 | Section-by-section congestion control method based on random early detection |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1353367A CN1353367A (en) | 2002-06-12 |
| CN1152313C true CN1152313C (en) | 2004-06-02 |
Family
ID=4594135
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB001303678A Expired - Fee Related CN1152313C (en) | 2000-11-02 | 2000-11-02 | Section-by-section congestion control method based on random early detection |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1152313C (en) |
Families Citing this family (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100356750C (en) * | 2002-08-10 | 2007-12-19 | 华为技术有限公司 | Flow control method for synchronous digital system network transmission data business |
| CN100364293C (en) * | 2002-09-28 | 2008-01-23 | 华为技术有限公司 | Method for handling IP network congestion by MTP2 user adaption |
| CN1260915C (en) * | 2002-11-19 | 2006-06-21 | 华为技术有限公司 | Traffic control method for MAN transmission apparatus |
| CN100396020C (en) * | 2004-10-11 | 2008-06-18 | 同济大学 | Network tightening link circuit positioning method based on double rate periodic flow technolgy |
| CN101043427B (en) * | 2006-05-24 | 2010-05-12 | 华为技术有限公司 | Method for processing congestion |
| CN101098301B (en) * | 2006-06-27 | 2011-04-20 | 华为技术有限公司 | Two-layer congestion control method of wireless network |
| CN100589440C (en) * | 2006-10-18 | 2010-02-10 | 中国科学院自动化研究所 | A network congestion control system and method for Internet |
| CN101060531B (en) * | 2007-05-17 | 2010-10-13 | 华为技术有限公司 | A method and device for avoiding the attack of network equipment |
| CN101286929B (en) * | 2008-05-30 | 2013-06-12 | 广东工业大学 | Compartment congestion controlling means for router with changing load |
| CN107682279B (en) * | 2017-11-03 | 2020-04-10 | 东软集团股份有限公司 | Time delay control method, time delay control device, storage medium and program product |
| CN108093385B (en) * | 2017-12-26 | 2021-06-01 | 海信视像科技股份有限公司 | Method for processing broadcast packet by Bluetooth controller, Bluetooth controller and Bluetooth equipment |
| CN112769710A (en) * | 2021-01-21 | 2021-05-07 | 中国电子科技集团公司电子科学研究院 | Router and operation method thereof |
| CN114979011B (en) * | 2022-05-17 | 2024-03-19 | 南京大学 | Congestion control method applied to park network |
-
2000
- 2000-11-02 CN CNB001303678A patent/CN1152313C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1353367A (en) | 2002-06-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Delgrossi et al. | Internet stream protocol version 2 (ST2) protocol specification-version ST2+ | |
| CN1152313C (en) | Section-by-section congestion control method based on random early detection | |
| CN111740808B (en) | Data transmission method and device | |
| WO2018210117A1 (en) | Congestion control method, network device, and network interface controller thereof | |
| Paul et al. | Multicast transport protocols for high speed networks | |
| CN101803316B (en) | Method, system, and computer program product for adaptive congestion control on virtual lanes for data center Ethernet architecture | |
| US5541927A (en) | Method of multicasting | |
| CN1297118C (en) | Bandwidth monitor and control equipment | |
| CN103118013B (en) | The method of packet incidentally reverse interest bag in content center network | |
| EP1206062A2 (en) | Data communication system, data communication method, and recording medium with data communication program recorded thereon | |
| WO2019179157A1 (en) | Data traffic processing method and related network device | |
| CN1423869A (en) | Link Layer acknowledgement and retransmission for cellular telecommunications | |
| CN1906906A (en) | Optimized radio bearer configuration for voice over IP | |
| CN1961544A (en) | Priority based multiplexing of data packet transport | |
| CN1260915C (en) | Traffic control method for MAN transmission apparatus | |
| KR20150002622A (en) | Apparatus and methods of routing with control vectors in a synchronized adaptive infrastructure (sain) network | |
| CN101127702A (en) | Multi-to-multi reliable multicast error recovery method for plane structure network | |
| CN1761244A (en) | Method for setting up notification function for route selection according to border gateway protocol | |
| CN1889531A (en) | Routing device chain circuit state data synchronizing method | |
| CN1248465C (en) | Management method of data fransmission/receiving butter region in network communication | |
| CN1812368A (en) | Method for transmitting message data by IP facsimile gateway | |
| CN114499777B (en) | Data transmission method for cluster unmanned system | |
| CN1705295A (en) | Packet transmission system having priority and method therefor | |
| CN101212452B (en) | Real-time transport protocol based multimedia data transmission control method | |
| CN1878136A (en) | Method for recognizing multiple emulation service flow path |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C06 | Publication | ||
| PB01 | Publication | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: YOULIAN HUTONG MULTIMEDIA COMMUNICATION SCIENCE A Free format text: FORMER OWNER: UNITED XINYUAN DIGITAL AUDIO-VIDEO TECHNOLOGY (BEIJING) CO., LTD. Effective date: 20080104 Owner name: UNITED XINYUAN DIGITAL AUDIO-VIDEO TECHNOLOGY (BE Free format text: FORMER OWNER: BEIJING SUANTONG DIGITAL TECHNOLOGY RESEARCH CENTER CO., LTD. Effective date: 20080104 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20080104 Address after: Beijing city Haidian District East Road No. 1 Yingchuang power building block A Room 601 zip code: 100080 Patentee after: Interactive multimedia communication technology union (Beijing) Co.,Ltd. Address before: Beijing city Haidian District East Road No. 1 Yingchuang power building block A room 701 zip code: 100080 Patentee before: UNITED XINYUAN DIGITAL AUDIO V Effective date of registration: 20080104 Address after: Beijing city Haidian District East Road No. 1 Yingchuang power building block A room 701 zip code: 100080 Patentee after: UNITED XINYUAN DIGITAL AUDIO V Address before: No. 8 South Road, Zhongguancun Academy of Sciences, Beijing, China: 100080 Patentee before: SUANTONG DIGITAL TECHNOLOGY RE |
|
| ASS | Succession or assignment of patent right |
Owner name: BEIJING XINYOUDA VIDEO TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: YO-LIAN INTERACTIVE MULTIMEDIA COMMUNICATION SCIENCE AND TECHNOLOGY (BEIJING), INC. Effective date: 20111121 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| COR | Change of bibliographic data |
Free format text: CORRECT: ADDRESS; FROM: 100080 HAIDIAN, BEIJING TO: 100085 HAIDIAN, BEIJING |
|
| TR01 | Transfer of patent right |
Effective date of registration: 20111121 Address after: 100085 No. 1, building 3, building ten, No. 14, 1409 street, Beijing, Haidian District Patentee after: BEIJING XINYOUDA VIDEO TECHNOLOGY Co.,Ltd. Address before: 100080 Beijing city Haidian District East Road No. 1 Yingchuang power building block A Room 601 Patentee before: Interactive multimedia communication technology union (Beijing) Co.,Ltd. |
|
| DD01 | Delivery of document by public notice | ||
| DD01 | Delivery of document by public notice |
Addressee: Xu Zhengchun Document name: Notification of Passing Examination on Formalities |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20040602 Termination date: 20191102 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |