CN109274605B - Synchronous transmission method suitable for packet switching network - Google Patents
Synchronous transmission method suitable for packet switching network Download PDFInfo
- Publication number
- CN109274605B CN109274605B CN201710584997.3A CN201710584997A CN109274605B CN 109274605 B CN109274605 B CN 109274605B CN 201710584997 A CN201710584997 A CN 201710584997A CN 109274605 B CN109274605 B CN 109274605B
- Authority
- CN
- China
- Prior art keywords
- packet
- data packet
- time slot
- flow
- synchronous transmission
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/56—Queue scheduling implementing delay-aware scheduling
- H04L47/562—Attaching a time tag to queues
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/22—Traffic shaping
- H04L47/225—Determination of shaping rate, e.g. using a moving window
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2441—Traffic characterised by specific attributes, e.g. priority or QoS relying on flow classification, e.g. using integrated services [IntServ]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9057—Arrangements for supporting packet reassembly or resequencing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/02—Details
- H04J3/06—Synchronising arrangements
- H04J3/0635—Clock or time synchronisation in a network
- H04J3/0638—Clock or time synchronisation among nodes; Internode synchronisation
- H04J3/0658—Clock or time synchronisation among packet nodes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/72—Admission control; Resource allocation using reservation actions during connection setup
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a synchronous transmission method suitable for a packet switching network, which is realized based on a synchronous transmission domain, wherein the synchronous transmission domain comprises two switching devices: the edge switch is divided into an inlet switch and an outlet switch; the method comprises the following steps: step 1) carrying out clock synchronization on each switching node in a synchronous transmission domain; step 2) the service flow enters a synchronous transmission domain from the entrance switch, the entrance switch carries out flow classification, flow speed limitation, packet fragmentation or splicing on the service flow, and then the data packet is forwarded out according to a synchronous transmission mode; step 3) after the intermediate switch receives the transmission synchronous signal packet of the data packet, the packet is forwarded out according to the synchronous transmission mode; and 4) enabling the data packet to enter the outlet switch, performing packet splicing or fragmentation on the data packet by the outlet switch, recovering the data packet into an original data packet, adding an external network packet header to the original data packet, and then forwarding the data packet through a port.
Description
Technical Field
The invention relates to the field of network communication, in particular to a synchronous transmission method suitable for a packet switching network.
Background
With the rapid development of the Internet, multimedia services are gradually transferred to the Internet, high-definition network set top boxes, live video, and the influx of various real-time service flows, which put higher demands on network service quality.
Packet switching uses statistical multiplexing, i.e. multiple session connections can share a communication channel, which undoubtedly greatly improves transmission efficiency. The packet switching network is mature in technology and complete in regulation, is widely applied to various countries in the world, and is the global Internet.
DTM (dynamic synchronous transfer mode) is a new network transmission technology, and well meets the transmission requirements of multimedia services. DTM is a form of circuit switching over a fiber optic network using TDM (time division multiplexing) to dynamically reallocate available bandwidth to users requiring bandwidth. The method can meet the transmission requirement of multimedia services, and can converge the traditional voice and Internet services to a unified platform through optical fibers. However, synchronous transmission equipment is expensive, complex to deploy, and costly. On the other hand, the DTM adopts circuit switching, which has strong real-time performance and small transmission delay, but the circuit switching channel is monopolized by both communication parties, and even if the communication line is idle, the circuit switching channel cannot be used by other users, so that the channel utilization rate is low and the delay is high.
Disclosure of Invention
The invention aims to overcome the defects of low channel utilization rate and high time delay of the current dynamic synchronous transmission mode and provides a synchronous transmission method suitable for a packet switching network. The method maps bandwidth resources into time slot resources, and then allocates the time slot resources to corresponding service flows, and through the resource allocation mode, the services are ensured not to seize bandwidth and are isolated from each other; in the transmission process, the clocks of all nodes are required to be kept synchronous, all nodes send packets according to periods, each period sends a frame of data, and all nodes keep the same packet sending beat, so that the transmission guarantee of low time delay and low jitter is realized.
In order to achieve the above object, the present invention provides a synchronous transmission method suitable for a packet switching network, where the method is implemented based on a synchronous transmission domain, and the synchronous transmission domain includes two switching devices: the edge switch is divided into an inlet switch and an outlet switch; the method comprises the following steps:
step 1) carrying out clock synchronization on each switching node in a synchronous transmission domain;
step 2) the service flow enters a synchronous transmission domain from the entrance switch, the entrance switch carries out flow classification, flow speed limitation, packet fragmentation or splicing on the service flow, and then the data packet is forwarded out according to a synchronous transmission mode;
step 3) after the intermediate switch receives the transmission synchronous signal packet of the data packet, the packet is forwarded out according to the synchronous transmission mode;
and 4) enabling the data packet to enter the outlet switch, performing packet splicing or fragmentation on the data packet by the outlet switch, recovering the data packet into an original data packet, adding an external network packet header to the original data packet, and then forwarding the data packet through a port.
As an improvement of the above method, the step 2) specifically includes:
step 2-1) marking up-flow labels for different service flows according to flow classification rules;
step 2-2) knowing the reserved bandwidth BW of the flow according to the label, limiting the flow to the bandwidth BW, and losing packets if the flow exceeds the bandwidth BW;
step 2-3) judging the length of the data packet; processing the data packets to make the length of each data packet be X;
if the length of the data packet is smaller than X, splicing the small packets; if the length of the data packet is larger than X, the big packet is sliced;
step 2-4) submitting the data packet to the belonging flow queue according to the flow label;
and 2-5) forwarding the data packet according to a synchronous transmission mode.
As an improvement of the above method, the data of the synchronous transmission mode is defined as: the transmission unit is a frame, one frame of data comprises N packets, and each frame of data comprises a transmission synchronization signal packet; one period T transmits one frame of data, one period is divided into N time slots, the length of each time slot is T, T is T/N, and each time slot transmits one packet; the transmission synchronization signal packet occupies the first time slot in the frame; the process of the synchronous transmission mode comprises the following steps:
a) each time slot corresponds to an output queue;
b) after receiving a data packet, searching a time slot according to a flow label in the data packet, and submitting the packet to an output queue of a corresponding time slot;
c) a first time slot sends a transmission synchronization signal packet;
d) taking out packets from the corresponding time slot queue according to time slots and sending the packets; if the time slot queue has a packet, directly sending the packet, and then waiting for the next time slot to arrive and turning to e); if the time slot queue has no packet, waiting for the next time slot to arrive, and switching to e);
e) if the last time slot is the Nth time slot, the frame data transmission is finished, otherwise, the step d) is carried out.
As an improvement of the above method, the step 3) specifically includes:
step 3-1), the service flow enters an intermediate exchanger and is cached in a flow queue according to a flow label;
step 3-2) after receiving the transmission synchronizing signal of the data packet, taking the packet from the flow queue according to the time slot and sending the packet;
as an improvement of the above method, the step 4) specifically includes:
step 4-1) detecting the data packet;
step 4-2), if the data packet is subjected to splicing operation, executing step 4-3); if the data packet is subjected to the slicing operation, executing the step 4-4); otherwise, turning to the step 4-5);
step 4-3) fragmenting the data packet, recovering the original data packet, and executing step 4-5);
step 4-4) splicing the data packets, recovering the original data packets, and executing step 4-5);
step 4-5), a flow label is knocked off, and step 4-6) is executed;
and 4-6) adding an outer network packet header to the data packet, and forwarding the data packet from the corresponding port.
The invention has the advantages that: the method of the invention realizes synchronous transmission on the packet switching network, thereby realizing transmission quality guarantee with low jitter and low time delay and reducing cost.
Drawings
FIG. 1 is a diagram illustrating synchronous transmission domains defined in the present invention;
FIG. 2 is a diagram of a transmitted packet structure according to the present invention;
FIG. 3 is a diagram of a transmitted frame structure according to the present invention;
fig. 4 is a flow chart of the synchronous transmission method applicable to the packet switching network according to the present invention.
Detailed Description
The method of the present invention is described in detail below with reference to the figures and specific examples.
First, the concept of the synchronous transmission domain is introduced, the low-delay and low-jitter transmission guarantee realized by the method of the present invention is only in the synchronous transmission domain, the synchronous transmission domain is as shown in the attached figure 1, and the synchronous transmission domain mainly comprises two switching devices: edge Switches (ES) and intermediate switches (CS). The edge switches in the synchronous transmission domain are mainly divided into ingress switches and egress switches, wherein the ingress switches mainly function as follows:
1. and (3) flow classification: and classifying various incoming service flows and marking corresponding flow labels.
2. Flow rate limiting: and knowing the reserved bandwidth BW of the flow according to the label, limiting the reserved speed to the bandwidth BW, and losing the packet if the reserved speed exceeds the bandwidth BW.
3. Wrapping and slicing (splicing): each time slot transmits a packet with a fixed length X, so that a large packet is fragmented and a small packet is spliced.
4. And forwarding according to time slots. One period T contains N time slots, each time slot is allocated to a corresponding service flow, and packets are taken from a flow queue and forwarded according to the time slots.
The egress switch functions mainly as follows:
1. wrapping and slicing (splicing): when the packet leaves the synchronous transmission domain, the packet needs to be recovered and spliced (split) into an original packet structure.
2. The flow label is punched off.
3. Packaging: and encapsulating the outer network protocol header.
The intermediate switch in the synchronous transmission domain mainly has the following functions:
1. and (3) transmission synchronization: after receiving the synchronous signal, the synchronous signal is forwarded according to the time slot.
2. And forwarding according to time slots.
A cycle T of synchronous transmission contains N time slots, each time slot is T, T is T/N, sends out the packet according to the time slot, mainly include the following steps:
a) one output queue for each time slot
b) After receiving the data packet, searching the time slot according to the flow label in the data packet, and submitting the packet to the output queue of the corresponding time slot
c) Transmitting SOF signal packets in a first time slot;
d) then, the packet is taken out from the corresponding time slot queue according to the time slot and sent;
e) if the time slot queue has a packet, the packet is directly sent, and then the next time slot is waited to arrive;
f) if the time slot queue has no packet, waiting for the next time slot to arrive;
in the synchronous transmission domain, a synchronous transmission protocol is adopted for packet exchange. The synchronous transmission protocol requires to mark corresponding flow labels for different service flows, and the node exchange takes the labels as the only routing basis. The synchronous transmission protocol transmission unit is a frame, one period T transmits one frame of data, one period is divided into N slots, each slot transmits one packet, and one frame of data includes N packets.
The structure of the synchronous transmission packet is shown in fig. 2, each time slot requires to transmit a data packet with fixed length X; the synchronous transmission frame structure is shown in fig. 3, and the data frame structure is a logical frame structure. A SOF sync signal packet is started in the logical frame structure, and then a data packet is transmitted every slot, and a packet of one cycle is transmitted to constitute a logical frame data.
Each frame Of data contains a SOF signal packet, SOF (start Of frame) is a transmission synchronization signal packet, and SOF occupies the first time slot in the frame. After receiving the SOF signal, the node in the synchronous transmission domain represents that a frame of data starts to enter, and the node starts to forward according to the time slot.
In summary, as shown in fig. 4, a synchronous transmission method for a packet-switched network includes the following steps:
step 1) carrying out clock synchronization on each switching node in a synchronous transmission domain;
step 2) the service flow enters the synchronous transmission domain from the entrance switch, and the entrance switch processes the service flow, which specifically comprises:
step 2-1) marking up-flow labels for different service flows according to flow classification rules;
step 2-2) according to the label, the reserved bandwidth BW of the flow can be known, the reserved speed is limited to the bandwidth BW, and if the reserved speed exceeds the bandwidth BW, packet loss is carried out;
step 2-3) judging the length of the data packet; processing the data packets to make the length of each data packet be X;
if the length of the data packet is smaller than X, splicing the small packets; if the length of the data packet is larger than X, the big packet is sliced;
step 2-4) submitting the data packet to the belonging flow queue;
step 2-5) sending packets according to a period T, and sending packets according to time slots in each period;
step 3), the intermediate switch receives the SOF, and the intermediate switch processes the service flow, which specifically includes:
step 3-1), the service flow enters an intermediate exchanger and is cached in a flow queue according to a flow label;
step 3-2) after receiving the SOF signal of the data packet, getting the packet from the stream queue according to the time slot and sending the packet;
step 4), the service flow enters an exit switch, and the exit switch processes the service flow, which specifically comprises:
step 4-1) detecting the data packet;
step 4-2) if the data packet is subjected to splicing (slicing) operation, executing step 4-3); if the data packet is not subjected to splicing (slicing) operation, executing the step 4-4);
step 4-3), slicing (splicing) the data packet, recovering the original data packet, and executing the step 4-5);
step 4-4) printing off the flow label, and executing step 4-5);
step 4-5) adding an outer network packet header to the data packet;
and 4-6) forwarding the data from the corresponding port.
Finally, it should be noted that the above embodiments are only used for illustrating the technical solutions of the present invention and are not limited. Although the present invention has been described in detail with reference to the embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the spirit and scope of the invention as defined in the appended claims.
Claims (1)
1. A synchronous transmission method suitable for a packet switching network is realized based on a synchronous transmission domain, and the synchronous transmission domain comprises two switching devices: the edge switch is divided into an inlet switch and an outlet switch; the method comprises the following steps:
step 1) carrying out clock synchronization on all switches in a synchronous transmission domain;
step 2) the service flow enters a synchronous transmission domain from the entrance switch, the entrance switch carries out flow classification, flow speed limitation, packet fragmentation or splicing on the service flow, and then the data packet is forwarded out according to a synchronous transmission mode;
step 3) after the intermediate switch receives the transmission synchronous signal packet of the data packet, the packet is forwarded out according to the synchronous transmission mode;
step 4) the data packet enters the outlet switch, the outlet switch performs packet splicing or fragmentation on the data packet, the data packet is recovered to be an original data packet, an outer network packet header is added to the original data packet, and then the data packet is forwarded out through a port;
the step 2) specifically comprises the following steps:
step 2-1) marking up-flow labels for different service flows according to flow classification rules;
step 2-2) knowing the reserved bandwidth BW of the flow according to the label, limiting the flow to the bandwidth BW, and losing packets if the flow exceeds the bandwidth BW;
step 2-3), if the length of the data packet is less than X, splicing the data packet, if the length of the data packet is greater than X, fragmenting the data packet to enable the length of each data packet to be X;
step 2-4) submitting the data packet to the belonging flow queue according to the flow label;
step 2-5) forwarding the data packet according to a synchronous transmission mode;
the definition of the data of the synchronous transmission mode is as follows: the transmission unit is a frame, one frame of data comprises N packets, and each frame of data comprises a transmission synchronization signal packet; one period T transmits one frame of data, one period is divided into N time slots, the length of each time slot is T, T is T/N, and each time slot transmits one packet; the transmission synchronization signal packet occupies the first time slot in the frame; the process of the synchronous transmission mode comprises the following steps:
a) each time slot corresponds to an output queue;
b) after receiving a data packet, searching a time slot according to a flow label in the data packet, and submitting the packet to an output queue of a corresponding time slot;
c) a first time slot sends a transmission synchronization signal packet;
d) taking out packets from the corresponding time slot queue according to time slots and sending the packets; if the time slot queue has a packet, directly sending the packet, and then waiting for the next time slot to arrive and turning to e); if the time slot queue has no packet, waiting for the next time slot to arrive, and switching to e);
e) if the last time slot is the Nth time slot, the data transmission of the frame is finished, otherwise, the data transmission is switched to d);
the method is characterized in that the step 3) specifically comprises the following steps:
step 3-1), the service flow enters an intermediate exchanger and is cached in a flow queue according to a flow label;
step 3-2) after receiving the transmission synchronizing signal of the data packet, taking the packet from the flow queue according to the time slot and sending the packet;
the step 4) specifically comprises the following steps:
step 4-1) detecting the data packet;
step 4-2), if the data packet is subjected to splicing operation, executing step 4-3); if the data packet is subjected to the slicing operation, executing the step 4-4); otherwise, turning to the step 4-5);
step 4-3) fragmenting the data packet, recovering the original data packet, and executing step 4-5);
step 4-4) splicing the data packets, recovering the original data packets, and executing step 4-5);
step 4-5), a flow label is knocked off, and step 4-6) is executed;
and 4-6) adding an outer network packet header to the data packet, and forwarding the data packet from the corresponding port.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710584997.3A CN109274605B (en) | 2017-07-18 | 2017-07-18 | Synchronous transmission method suitable for packet switching network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710584997.3A CN109274605B (en) | 2017-07-18 | 2017-07-18 | Synchronous transmission method suitable for packet switching network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109274605A CN109274605A (en) | 2019-01-25 |
| CN109274605B true CN109274605B (en) | 2021-06-08 |
Family
ID=65147989
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710584997.3A Active CN109274605B (en) | 2017-07-18 | 2017-07-18 | Synchronous transmission method suitable for packet switching network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109274605B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111935017B (en) * | 2020-10-14 | 2021-01-15 | 腾讯科技（深圳）有限公司 | Cross-network application calling method and device and routing equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103685033A (en) * | 2013-12-19 | 2014-03-26 | 武汉邮电科学研究院 | General flow table and method for supporting packet switching and circuit switching in SDN framework |
| CN105871745A (en) * | 2016-05-31 | 2016-08-17 | 浪潮集团有限公司 | Mixed-service-based dispatching method in SDN network |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1387527A1 (en) * | 2002-07-30 | 2004-02-04 | Agilent Technologies Inc. | Identifying network routers and paths |
| US7764688B2 (en) * | 2004-01-20 | 2010-07-27 | Nortel Networks Limited | Ethernet differentiated services |
| CN1294728C (en) * | 2004-08-05 | 2007-01-10 | 华为技术有限公司 | Method and system for providing QoS assurance in edge router |
| CN101212424B (en) * | 2006-12-28 | 2011-03-23 | 杭州华三通信技术有限公司 | Ethernet switching method and device incorporating circuit switching and packet switching |
| CN104618265B (en) * | 2014-12-30 | 2018-03-13 | 华为技术有限公司 | A kind of message forwarding method and device |
| CN106850466B (en) * | 2017-02-22 | 2019-12-20 | 电子科技大学 | Method and device for forwarding data packet in time-triggered network |
-
2017
- 2017-07-18 CN CN201710584997.3A patent/CN109274605B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103685033A (en) * | 2013-12-19 | 2014-03-26 | 武汉邮电科学研究院 | General flow table and method for supporting packet switching and circuit switching in SDN framework |
| CN105871745A (en) * | 2016-05-31 | 2016-08-17 | 浪潮集团有限公司 | Mixed-service-based dispatching method in SDN network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109274605A (en) | 2019-01-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9967638B2 (en) | Optical switching | |
| US7986700B2 (en) | Multiplexed data stream circuit architecture | |
| CN102971996B (en) | Switching node with the load balance of packet burst | |
| US7961751B2 (en) | Multiplexed data stream timeslot map | |
| US9106439B2 (en) | System for TDM data transport over Ethernet interfaces | |
| US11477549B2 (en) | Transmission network system, data switching and transmission method, apparatus and equipment | |
| US20080074996A1 (en) | Aggregated Link Traffic Protection | |
| CN108521343B (en) | OAM message processing method and device | |
| WO2014161291A1 (en) | Data scheduling and switching method, apparatus, and system | |
| US9912434B2 (en) | Service transmission method in an optical transport network and device and system for implementing the method | |
| US8976796B2 (en) | Bandwidth reuse in multiplexed data stream | |
| US8862768B2 (en) | Method and system for packetizing data for servicing traffic end-to-end | |
| CN101277196A (en) | Communication system, communication method and cable fastener plate based on PCIE switching network | |
| CN101848168B (en) | Target MAC (Media Access Control) address based flow control method, system and equipment | |
| WO2023051515A1 (en) | Service data transmission method and related device | |
| JP5739960B2 (en) | Method and system for providing external optical data packets to a destination node of a packet optical network | |
| CN109274605B (en) | Synchronous transmission method suitable for packet switching network | |
| WO2019091587A1 (en) | Method and apparatus for managing transport of delay-sensitive packets | |
| CN101998194A (en) | Implementation method for optical burst switching network (OBS) resource reservation protocol for supporting multi-service fusion transmission | |
| CN110351613B (en) | Time slot and packet mixed transmission, sending, receiving and switching method in optical network | |
| WO2012106905A1 (en) | Message processing method and device | |
| US20040105453A1 (en) | Capacity re-use in data communication networks | |
| JP2008236691A (en) | Eos (ether-over sonet) communication equipment | |
| JP2001007854A (en) | System and method for reducing average delay time in packet transfer network | |
| CN114500581B (en) | Method for realizing equal-delay distributed cache Ethernet MAC architecture |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210818 Address after: Room 1601, 16th floor, East Tower, Ximei building, No. 6, Changchun Road, high tech Industrial Development Zone, Zhengzhou, Henan 450001 Patentee after: Zhengzhou xinrand Network Technology Co.,Ltd. Address before: 100190, No. 21 West Fourth Ring Road, Beijing, Haidian District Patentee before: INSTITUTE OF ACOUSTICS, CHINESE ACADEMY OF SCIENCES Effective date of registration: 20210818 Address after: 100190, No. 21 West Fourth Ring Road, Beijing, Haidian District Patentee after: INSTITUTE OF ACOUSTICS, CHINESE ACADEMY OF SCIENCES Address before: 100190, No. 21 West Fourth Ring Road, Beijing, Haidian District Patentee before: INSTITUTE OF ACOUSTICS, CHINESE ACADEMY OF SCIENCES Patentee before: BEIJING INTELLIX TECHNOLOGIES Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230717 Address after: 422, 4th Floor, Podium Building, Zhongke Resource Building, No. 6 South Third Street, Zhongguancun, Haidian District, Beijing, 100000 Patentee after: Beijing Zhongke Haiwang Technology Co.,Ltd. Address before: Room 1601, 16th floor, East Tower, Ximei building, No. 6, Changchun Road, high tech Industrial Development Zone, Zhengzhou, Henan 450001 Patentee before: Zhengzhou xinrand Network Technology Co.,Ltd. |