CN113709131A - Network data transmission method and device, computer equipment and readable medium - Google Patents
Network data transmission method and device, computer equipment and readable medium Download PDFInfo
- Publication number
- CN113709131A CN113709131A CN202110964378.3A CN202110964378A CN113709131A CN 113709131 A CN113709131 A CN 113709131A CN 202110964378 A CN202110964378 A CN 202110964378A CN 113709131 A CN113709131 A CN 113709131A
- Authority
- CN
- China
- Prior art keywords
- data frame
- data
- frame
- metadata information
- linked list
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 56
- 230000005540 biological transmission Effects 0.000 title claims abstract description 38
- 230000004044 response Effects 0.000 claims abstract description 16
- 238000013507 mapping Methods 0.000 claims description 10
- 238000004590 computer program Methods 0.000 claims description 8
- 230000008569 process Effects 0.000 description 13
- 230000006870 function Effects 0.000 description 10
- 238000010586 diagram Methods 0.000 description 8
- 230000007246 mechanism Effects 0.000 description 8
- 238000013461 design Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 5
- 238000011161 development Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 239000000835 fiber Substances 0.000 description 3
- 238000007726 management method Methods 0.000 description 3
- 238000001514 detection method Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000014509 gene expression Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 238000012937 correction Methods 0.000 description 1
- 239000012634 fragment Substances 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000000844 transformation Methods 0.000 description 1
- 239000011800 void material Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/34—Network arrangements or protocols for supporting network services or applications involving the movement of software or configuration parameters
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/52—Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F9/524—Deadlock detection or avoidance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
- H04L69/161—Implementation details of TCP/IP or UDP/IP stack architecture; Specification of modified or new header fields
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/30—Definitions, standards or architectural aspects of layered protocol stacks
- H04L69/32—Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
- H04L69/322—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions
- H04L69/329—Intralayer communication protocols among peer entities or protocol data unit [PDU] definitions in the application layer [OSI layer 7]
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computer And Data Communications (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a network data transmission method, which comprises the following steps: acquiring user data and converting the user data into a data frame; adding the data frame into a blank ring linked list frame in a ring linked list, and calculating metadata information; in response to receiving a sending command, acquiring the corresponding data frame based on metadata information in the sending command; and sending the data frame to a receiving end. The invention also discloses a network data transmission device, computer equipment and a computer readable storage medium. The invention can transmit data by directly using the data frame, thereby improving the receiving efficiency; through the coroutine scheduling structure, the locking overhead among threads is avoided; and the data transmission not based on flow control expands the application range.
Description
Technical Field
The present invention relates to the field of network transmission technologies, and in particular, to a network data transmission method, an apparatus, a computer device, and a computer readable medium.
Background
Network transmission is an indispensable part of computer system operation, and most of network transmissions used by application software are based on timeout Control, error retransmission, frame check functions and the like provided by a TCP (Transport Control Protocol)/UDP (User Data Protocol) network Protocol.
The transport control protocol is a connection-oriented, reliable, byte stream based transport layer communication protocol, defined by RFC 793[1] of the IETF. TCP is intended to accommodate layered protocol hierarchies that support multiple network applications. Reliable communication services are provided by means of TCP between pairs of processes in host computers connected to different but interconnected computer communication networks. TCP assumes that it can obtain simple, possibly unreliable, datagram service from lower level protocols. In principle, TCP should be able to operate over a variety of communication systems connected from hard wire to packet switched or circuit switched networks.
The user datagram protocol is a simple connectionless and unreliable datagram oriented transport layer (transport layer) protocol, and IETF RFC 768 is a formal specification of UDP. In the TCP/IP model, UDP provides a simple interface above the network layer and below the application layer. UDP provides only unreliable delivery of data and it does not preserve a backup of data once the data sent by an application to the network layer is sent out (so UDP is also sometimes considered an unreliable datagram protocol). UDP adds only multiplexing and data checks (fields) in the header of an IP datagram. Due to the lack of reliability, UDP applications must generally allow a certain amount of packet loss, errors and duplication.
However, in some special cases, the TCP/UDP protocol does not meet the requirements. Such as computer network systems that are not based on TCP/IP protocol infrastructure, network protocols that require zero copies, require their own task scheduling design, etc. However, the TCP/UDP protocol is implemented in the Windows/Linux kernel, which cannot be personalized and optimized, and it is very difficult to implement a reliable set of transmission protocols without providing network infrastructure.
At present, there are several structures that can implement reliable transmission structure similar to TCP protocol, such as KCP protocol, QUIC protocol, etc. Their architecture is still based on the flow control foundation provided by the TCP/IP protocol, and although it brings a certain degree of freedom, the design is still limited by the own logic of the TCP/IP protocol. Meanwhile, the network protocol design not based on flow control is usually to further optimize performance and discard unnecessary network protocol characteristics to speed up memory scheduling, task processing, and the like of network data packets. The above protocol is based on the complete TCP/IP protocol infrastructure design, and is not excellent for missing feature support.
Disclosure of Invention
In view of this, an object of the embodiments of the present invention is to provide a method, an apparatus, a computer device and a computer readable medium for transmitting network data, which improve receiving efficiency by directly using a data frame to transmit data; through the coroutine scheduling structure, the locking overhead among threads is avoided; and the data transmission not based on flow control expands the application range.
In view of the foregoing, an aspect of the embodiments of the present invention provides a network data transmission method, which may include the following steps: acquiring user data and converting the user data into a data frame; adding the data frame into a blank ring linked list frame in a ring linked list, and calculating metadata information; in response to receiving a sending command, acquiring the corresponding data frame based on metadata information in the sending command; and sending the data frame to a receiving end.
In some embodiments, the methods of the present invention may further comprise: and in response to receiving the acknowledgement message of the receiving end, releasing the corresponding data frame in the ring linked list based on the metadata information in the acknowledgement message.
In some embodiments, the methods of the present invention may further comprise: and setting the read-write operation and the circulation thread of the application layer as coroutine scheduling.
In some embodiments, converting the user data into a data frame may include: and mapping the address pointer of the kernel segment of the operating system to the memory address in the application layer through mmap.
In some embodiments, releasing the corresponding data frame in the ring linked list based on the metadata information in the acknowledgement message may include: and releasing the corresponding data frame in the link list through a release interface of the lower-layer equipment.
In another aspect of the embodiments of the present invention, the present invention further provides a network data transmission apparatus, where the apparatus may include: a first module configurable to obtain user data and convert the user data into a data frame; a second module, which may be configured to add the data frame to a blank ring linked list frame in a ring linked list and calculate metadata information; a third module, which may be configured to, in response to receiving a send command, obtain the corresponding data frame based on metadata information in the send command; and a fourth module, which may be configured to send the data frame to a receiving end.
In some embodiments, the apparatus of the present invention may further include a fifth module, which may be configured to: and in response to receiving the acknowledgement message of the receiving end, releasing the corresponding data frame in the ring linked list based on the metadata information in the acknowledgement message.
In some embodiments, the apparatus of the present invention further comprises a sixth module, which may be configured to: and setting the read-write operation and the circulation thread of the application layer as coroutine scheduling.
In some embodiments, the first module may be further configured to: and mapping the address pointer of the kernel segment of the operating system to the memory address in the application layer through mmap.
In some embodiments, the fifth module may be further configured to: and releasing the corresponding data frame in the link list through a release interface of the lower-layer equipment.
In another aspect of the embodiments of the present invention, the present invention further provides a computer device, where the computer device may include: at least one processor; and a memory, the memory may store computer instructions executable on the processor, the computer instructions when executed by the processor may implement steps of a method comprising: acquiring user data and converting the user data into a data frame; adding the data frame into a blank ring linked list frame in a ring linked list, and calculating metadata information; in response to receiving a sending command, acquiring the corresponding data frame based on metadata information in the sending command; and sending the data frame to a receiving end.
In some embodiments, the computer instructions, when executed by the processor, may implement the method further comprising: and in response to receiving the acknowledgement message of the receiving end, releasing the corresponding data frame in the ring linked list based on the metadata information in the acknowledgement message.
In some embodiments, the computer instructions, when executed by the processor, may implement the method further comprising: and setting the read-write operation and the circulation thread of the application layer as coroutine scheduling.
In some embodiments, converting the user data into a data frame may include: and mapping the address pointer of the kernel segment of the operating system to the memory address in the application layer through mmap.
In some embodiments, releasing the corresponding data frame in the ring linked list based on the metadata information in the acknowledgement message may include: and releasing the corresponding data frame in the link list through a release interface of the lower-layer equipment.
In yet another aspect of the embodiments of the present invention, the present invention further provides a computer readable storage medium, which may store a computer program for implementing the above method steps when executed by a processor.
The invention can have at least the following beneficial technical effects: the running mode of directly using frame data is utilized, the limitation that the original kcp protocol only supports a tcp/ip protocol stack is changed, and meanwhile, due to the fact that data are directly operated by using a bottom frame, multiple memory copying and checking processes can be omitted, and sending/receiving efficiency is optimized; meanwhile, by borrowing the coroutine structure, the lock expense among threads is avoided in the using process, the development burden in development is also reduced, and a user can develop high-efficiency and lock-free io transceiving request logic only by calling simple logics of creating the coroutine, operating, yield and completing the flow; finally, because the tcp/ip protocol stack is stripped to form the kcp protocol, and the operation flow of applying for a frame/releasing the frame in the kcp protocol is saved, the modified logic can operate in an embedded system with a tight resource or a large program with a strict requirement on resource management, and the application range is expanded.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other embodiments can be obtained by using the drawings without creative efforts.
Fig. 1 is a schematic diagram of an embodiment of a network data transmission method provided in the present invention;
fig. 2 is a schematic diagram of an embodiment of a network data transmission apparatus provided in the present invention;
FIG. 3 is a schematic diagram of an embodiment of a computer device provided by the present invention; and
FIG. 4 is a schematic diagram of an embodiment of a computer-readable storage medium provided by the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the following embodiments of the present invention are described in further detail with reference to the accompanying drawings.
It should be noted that all expressions using "first" and "second" in the embodiments of the present invention are used for distinguishing two entities with the same name but different names or different parameters, and it is understood that "first" and "second" are only used for convenience of expression and should not be construed as limitations to the embodiments of the present invention, and the descriptions thereof in the following embodiments are omitted.
In view of the above object, a first aspect of the embodiments of the present invention provides an embodiment of a network data transmission method. Fig. 1 is a schematic diagram illustrating an embodiment of a network data transmission method provided by the present invention. As shown in fig. 1, a network data transmission method according to an embodiment of the present invention may include the following steps:
s01, acquiring user data and converting the user data into a data frame;
s02, adding the data frame into a blank ring linked list frame in a ring linked list, and calculating metadata information;
s03, responding to the received sending command, acquiring the corresponding data frame based on the metadata information in the sending command; and
and S04, sending the data frame to a receiving end.
In this embodiment, the logic for applying for frame memory and managing in the original kcp protocol is modified to the operation logic for directly scheduling the device frame, and the operation logic for transmitting/receiving the request is scheduled by using the protocol. The kcp protocol is an ARQ (Automatic Repeat-reQuest) protocol with reliability, and the ARQ protocol is one of error correction protocols of a data link layer in an OSI Model (Open System Interconnection Reference Model). It includes stop-and-wait ARQ protocol and continuous ARQ protocol, Error Detection (Error Detection), Positive acknowledgement (Positive acknowledgement), time-out Retransmission (Retransmission after Timeout), and Negative acknowledgement followed by Retransmission (Negative acknowledgement and Retransmission).
In this embodiment, for the characteristic that the kcp protocol is based on the flow control, the technical solution of the embodiment of the present invention can modify the read and write data interfaces of the kcp protocol, modify the original write and read functions based on the flow control into interfaces based on data frames, and directly write the bottom layer data frames into the device transmission queue, bypassing the restriction of the tcp/ip protocol.
In this embodiment, for stop-and-wait protocol caching, the native kcp protocol uses an array queue to store the queue to be retransmitted and then copies it into the output stream, which causes an extra memory copy consumption. Aiming at the problem, the retransmission queue is replaced by a ring link table structure provided by bottom layer frame data, when sending data is written, a blank ring link table frame is directly written and meta (metadata) information is calculated, when receiving confirmation, a frame memory is directly released, and memory copy and application layer/kernel layer scheduling overhead are avoided.
In this embodiment, for a network transmission request in a general situation, an application layer design may need a seletc/iocp/epoll/libev mechanism to implement asynchronous data scheduling, and an internal implementation of the mechanism is to construct a thread pool and trigger an asynchronous callback function. But in cases where performance optimization requirements are high (e.g., tcp/ip stack), either thread overhead alone or memory allocation functionality alone may not be acceptable. In view of the above situation, the technical solution of the embodiment of the present invention may modify a kcp protocol data transmission cycle, and schedule the transmission cycle into a coroutine process, thereby avoiding system switching overhead and an additional data lock function.
In some embodiments of the present invention, the methods provided herein may further comprise: and in response to receiving the acknowledgement message of the receiving end, releasing the corresponding data frame in the ring linked list based on the metadata information in the acknowledgement message.
In this embodiment, after the successful transmission of the acknowledgement frame, the conventional free function is not used, and the release interface of the lower layer device itself is called. Therefore, the problem of memory fragments generated by one-time memory application/release can be avoided, and the one-time memory copying process from the user mode to the kernel mode is saved; in practical use, mechanisms like device DMA memory copy intel avx512 instruction set can be used to speed up the most time-consuming memory copy process. And in the process, the transmission mechanism of the jumbo frame (>4k byte) is supported naturally.
In some embodiments of the present invention, the methods provided herein may further comprise: and setting the read-write operation and the circulation thread of the application layer as coroutine scheduling.
In this embodiment, the common usage manner in the original protocol is to use one thread to circularly wait, process the read/write message, and execute the read/write operation and the corresponding subsequent logic by other multiple threads. This has the advantage of ease of use and understanding, but inter-thread data synchronization has always been a performance-costly operation. We now set the application layer read-write operations and the loop thread as coroutine. Coroutines are also called micro threads, fiber threads, and the switching between coroutines occurs in a user mode. And no mechanism such as clock interrupt, system call and the like exists in the user mode. The greatest advantage is the extremely high execution efficiency of the coroutines, and the second is the lock mechanism without multiple threads.
By means of a coroutine mechanism, any coroutine task actually runs in the current thread when sending data, and no thread conflict exists with other task scheduling. And after the scheduling is finished, performing yield operation and switching to any other yield operation to be sent or kcp core cycle. In the core cycle, the kcp protocol executes the transceiving and management of data, and executes resume after the current task is completed, and then the thread context is switched to the coroutine logic which executes yield operation before, and other logic behaviors of successful sending/receiving are continued. By the method, the locking expense among threads is avoided, the development burden during development is also reduced, and a user can develop efficient and lock-free io transceiving request logic only by calling simple logics of creating coroutines, operating, yield and completing the flow.
In some embodiments of the invention, converting the user data into data frames comprises: and mapping the address pointer of the kernel segment of the operating system to the memory address in the application layer through mmap.
In this embodiment, in the conventional protocol, the original data incoming from the upper layer needs to allocate frame memory-set frame header-call tcp/udp protocol for transmission, which means two memory copy processes. After improvement, the processes of allocating the application frame memory and scheduling frame transmission/reception do not use the malloc (dynamic memory allocation) dynamic allocation frame memory in the prior art, but use mmap (a memory mapping file method) to directly map the kernel segment address pointer of the operating system to the memory address in the application layer.
The dynamic memory allocation is used for applying for a continuous memory block region with a specified size to return an allocated memory region address in a void type, when the specific position of the memory cannot be known, if a real memory space is bound, the dynamic allocated memory is needed, and the allocated size is the size required by a program.
And mmap maps a file or other object into memory. The file is mapped to multiple pages and if the size of the file is not the sum of the sizes of all pages, the unused space of the last page is cleared. mmap plays a significant role in the user-space mapping invocation system. mmap operations provide a mechanism for user programs to directly access device memory, which is significantly more efficient than copying data between user space and kernel space. Are commonly used in applications requiring high performance. The mmap mapping memory must be integer multiple of the page size, the stream-oriented device cannot perform mmap, and the mmap implementation is related to hardware.
In this embodiment, the limitation that the original kcp protocol only supports the tcp/ip protocol stack is changed by using the running mode of directly using the frame data, and meanwhile, as the data is directly operated by using the bottom frame, the memory copy and check processes can be omitted for many times, and the sending/receiving efficiency is optimized.
In some embodiments of the present invention, releasing the corresponding data frame in the ring linked list based on the metadata information in the acknowledgement message may include: and releasing the corresponding data frame in the link list through a release interface of the lower-layer equipment.
In this embodiment, the writing of data in the protocol in the prior art is performed by calling a socket interface, and is modified into a data interaction interface that directly sends frame data with a lower application, so that a strong correlation relationship of a tcp/ip protocol layer on data requirement sequentiality is avoided.
In some embodiments of the present invention, because the tcp/ip protocol stack is stripped to the kcp protocol, and the operation flow of applying for a frame/releasing a frame in the kcp protocol is omitted, the modified logic can be operated in an embedded system with a tight resource or a large program with a strict requirement on resource management, thereby expanding the application range.
It should be particularly noted that, the steps in the embodiments of the network data transmission method described above may be mutually intersected, replaced, added, or deleted, and therefore, the network data transmission method based on these reasonable permutation and combination transformations shall also belong to the scope of the present invention, and shall not limit the scope of the present invention to the embodiments.
In view of the above object, a second aspect of the embodiments of the present invention provides a network data transmission device. Fig. 2 is a schematic diagram of an embodiment of a network data transmission device provided in the present invention. As shown in fig. 2, the network data transmission apparatus according to the embodiment of the present invention may include the following modules: a first module S11, the first module S11 may be configured to obtain user data and convert the user data into data frames; a second module S12, the second module S12 may be configured to add the data frame to a blank ring list frame in a ring list and calculate metadata information; a third module S13, the third module S13 may be configured to, in response to receiving a send command, obtain the corresponding data frame based on metadata information in the send command; and a fourth module S14, the fourth module S14 may be configured to send the data frame to a receiving end.
In some embodiments of the present invention, the apparatus provided by the present invention may further include a fifth module (not shown in the figures), and the fifth module may be configured to: and in response to receiving the acknowledgement message of the receiving end, releasing the corresponding data frame in the ring linked list based on the metadata information in the acknowledgement message.
In some embodiments of the invention, the apparatus further comprises a sixth module, which may be configured to: and setting the read-write operation and the circulation thread of the application layer as coroutine scheduling.
In some embodiments of the invention, the first module S11 may be further configured to: and mapping the address pointer of the kernel segment of the operating system to the memory address in the application layer through mmap.
In some embodiments of the invention, the fifth module may be further configured to: and releasing the corresponding data frame in the link list through a release interface of the lower-layer equipment.
In view of the above object, a third aspect of the embodiments of the present invention provides a computer device. Fig. 3 is a schematic diagram of an embodiment of a computer device provided by the present invention. As shown in fig. 3, a computer apparatus of an embodiment of the present invention may include the following means: at least one processor S21; and a memory S22, the memory S22 may store computer instructions S23 executable on the processor, the computer instructions S23 when executed by the processor may implement steps of a method comprising: acquiring user data and converting the user data into a data frame; adding the data frame into a blank ring linked list frame in a ring linked list, and calculating metadata information; in response to receiving a sending command, acquiring the corresponding data frame based on metadata information in the sending command; and sending the data frame to a receiving end.
In some embodiments of the invention, the computer instructions S23 when executed by the processor may implement the method further comprising: and in response to receiving the acknowledgement message of the receiving end, releasing the corresponding data frame in the ring linked list based on the metadata information in the acknowledgement message.
In some embodiments of the invention, the computer instructions S23 when executed by the processor may implement the method further comprising: and setting the read-write operation and the circulation thread of the application layer as coroutine scheduling.
In some embodiments of the invention, converting the user data into a data frame may comprise: and mapping the address pointer of the kernel segment of the operating system to the memory address in the application layer through mmap.
In some embodiments of the present invention, releasing the corresponding data frame in the ring linked list based on the metadata information in the acknowledgement message may include: and releasing the corresponding data frame in the link list through a release interface of the lower-layer equipment.
In the embodiment shown in FIG. 3, the processor S21 and the memory S22 may be connected by a bus or other means, such as being connected by a bus in FIG. 3.
The memory S22 is a non-volatile computer-readable storage medium and can be used for storing non-volatile software programs, non-volatile computer-executable programs, and modules, such as program instructions/modules corresponding to the method for predicting the lifetime of a solid state disk in the embodiments of the present application. The processor S21 executes various functional applications of the server and data processing, i.e., implements a network data transmission method, by executing nonvolatile software programs, instructions, and modules stored in the memory S22.
The invention also provides a computer readable storage medium. FIG. 4 is a schematic diagram illustrating an embodiment of a computer-readable storage medium provided by the present invention. As shown in fig. 4, the computer readable storage medium S31 stores a computer program S32 which can be executed by a processor to perform the above method.
Finally, it should be noted that, as one of ordinary skill in the art can appreciate, all or part of the processes in the methods of the above embodiments may be implemented by a computer program to instruct related hardware, and the program of the network data transmission method may be stored in a computer readable storage medium, and when executed, may include the processes of the embodiments of the methods as described above. The storage medium of the program may be a magnetic disk, an optical disk, a Read Only Memory (ROM), a Random Access Memory (RAM), or the like. The embodiments of the computer program may achieve the same or similar effects as any of the above-described method embodiments.
Furthermore, the methods disclosed according to embodiments of the present invention may also be implemented as a computer program executed by a processor, which may be stored in a computer-readable storage medium. Which when executed by a processor performs the above-described functions defined in the methods disclosed in embodiments of the invention.
Further, the above method steps and system elements may also be implemented using a controller and a computer readable storage medium for storing a computer program for causing the controller to implement the functions of the above steps or elements.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as software or hardware depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the disclosed embodiments of the present invention.
In one or more exemplary designs, the functions may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a general-purpose or special-purpose computer, or a general-purpose or special-purpose processor. Also, any connection is properly termed a computer-readable medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, Digital Subscriber Line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. Disk and disc, as used herein, includes Compact Disc (CD), laser disc, optical disc, Digital Versatile Disc (DVD), floppy disk, blu-ray disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
The foregoing is an exemplary embodiment of the present disclosure, but it should be noted that various changes and modifications could be made herein without departing from the scope of the present disclosure as defined by the appended claims. The functions, steps and/or actions of the method claims in accordance with the disclosed embodiments described herein need not be performed in any particular order. Furthermore, although elements of the disclosed embodiments of the invention may be described or claimed in the singular, the plural is contemplated unless limitation to the singular is explicitly stated.
It should be understood that, as used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly supports the exception. It should also be understood that "and/or" as used herein is meant to include any and all possible combinations of one or more of the associated listed items.
The numbers of the embodiments disclosed in the embodiments of the present invention are merely for description, and do not represent the merits of the embodiments.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, and the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, of embodiments of the invention is limited to these examples; within the idea of an embodiment of the invention, also technical features in the above embodiment or in different embodiments may be combined and there are many other variations of the different aspects of the embodiments of the invention as described above, which are not provided in detail for the sake of brevity. Therefore, any omissions, modifications, substitutions, improvements, and the like that may be made without departing from the spirit and principles of the embodiments of the present invention are intended to be included within the scope of the embodiments of the present invention.
Claims (10)
1. A network data transmission method is characterized by comprising the following steps:
acquiring user data and converting the user data into a data frame;
adding the data frame into a blank ring linked list frame in a ring linked list, and calculating metadata information;
in response to receiving a sending command, acquiring the corresponding data frame based on metadata information in the sending command; and
and sending the data frame to a receiving end.
2. The method for transmitting network data according to claim 1, further comprising the steps of:
and in response to receiving the acknowledgement message of the receiving end, releasing the corresponding data frame in the ring linked list based on the metadata information in the acknowledgement message.
3. The method for transmitting network data according to claim 1, further comprising the steps of:
and setting the read-write operation and the circulation thread of the application layer as coroutine scheduling.
4. The method of claim 1, wherein converting the user data into data frames comprises:
and mapping the address pointer of the kernel segment of the operating system to the memory address in the application layer through mmap.
5. The method according to claim 2, wherein releasing the corresponding data frame in the ring linked list based on the metadata information in the acknowledgement message comprises:
and releasing the corresponding data frame in the link list through a release interface of the lower-layer equipment.
6. A network data transmission apparatus, comprising:
a first module configured to obtain user data and convert the user data into a data frame;
a second module configured to add the data frame to a blank ring linked list frame in a ring linked list and calculate metadata information;
a third module configured to, in response to receiving a send command, obtain the corresponding data frame based on metadata information in the send command; and
a fourth module configured to send the data frame to a receiving end.
7. The network data transmission apparatus according to claim 6, further comprising a fifth module configured to:
and in response to receiving the acknowledgement message of the receiving end, releasing the corresponding data frame in the ring linked list based on the metadata information in the acknowledgement message.
8. The network data transmission apparatus according to claim 6, further comprising a sixth module configured to:
and setting the read-write operation and the circulation thread of the application layer as coroutine scheduling.
9. A computer device, comprising:
at least one processor; and
a memory storing computer instructions executable on the processor, the instructions when executed by the processor implementing the steps of the method of any one of claims 1 to 5.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110964378.3A CN113709131B (en) | 2021-08-22 | 2021-08-22 | Network data transmission method, device, computer equipment and readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110964378.3A CN113709131B (en) | 2021-08-22 | 2021-08-22 | Network data transmission method, device, computer equipment and readable medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113709131A true CN113709131A (en) | 2021-11-26 |
| CN113709131B CN113709131B (en) | 2024-01-09 |
Family
ID=78653770
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110964378.3A Active CN113709131B (en) | 2021-08-22 | 2021-08-22 | Network data transmission method, device, computer equipment and readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113709131B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114338830A (en) * | 2022-01-05 | 2022-04-12 | 腾讯科技（深圳）有限公司 | Data transmission method and device, computer readable storage medium and computer equipment |
| CN114466151A (en) * | 2022-04-11 | 2022-05-10 | 武汉中科通达高新技术股份有限公司 | Video storage system, computer equipment and storage medium of national standard camera |
| CN114629824A (en) * | 2022-03-24 | 2022-06-14 | 阿里巴巴（中国）有限公司 | Packet loss positioning method, device, computing equipment and medium |
| CN114745257A (en) * | 2022-03-28 | 2022-07-12 | 杭州义益钛迪信息技术有限公司 | Data frame debugging method, device, equipment and storage medium |
| CN115334176A (en) * | 2022-07-27 | 2022-11-11 | 广州安凯微电子股份有限公司 | Data transmission method, data transmission device, computer equipment, storage medium and program product |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103546250A (en) * | 2013-09-18 | 2014-01-29 | 中标软件有限公司 | Communication method and communication system for vehicular terminal |
| CN106792263A (en) * | 2016-12-09 | 2017-05-31 | 东方网力科技股份有限公司 | A kind of method of transmitting video data, apparatus and system |
| CN108737378A (en) * | 2018-04-17 | 2018-11-02 | 全球能源互联网研究院有限公司 | A kind of dual mode communication network-building method and system based on media access control layer |
| CN109976664A (en) * | 2017-12-28 | 2019-07-05 | 北京忆恒创源科技有限公司 | The daily record data tissue of solid storage device |
| CN110391999A (en) * | 2018-04-18 | 2019-10-29 | 海能达通信股份有限公司 | A kind of data communications method and system |
| CN111600961A (en) * | 2020-05-22 | 2020-08-28 | 山东超越数控电子股份有限公司 | Method, system, equipment and medium for transmitting bitmap file through CAN port |
-
2021
- 2021-08-22 CN CN202110964378.3A patent/CN113709131B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103546250A (en) * | 2013-09-18 | 2014-01-29 | 中标软件有限公司 | Communication method and communication system for vehicular terminal |
| CN106792263A (en) * | 2016-12-09 | 2017-05-31 | 东方网力科技股份有限公司 | A kind of method of transmitting video data, apparatus and system |
| CN109976664A (en) * | 2017-12-28 | 2019-07-05 | 北京忆恒创源科技有限公司 | The daily record data tissue of solid storage device |
| CN108737378A (en) * | 2018-04-17 | 2018-11-02 | 全球能源互联网研究院有限公司 | A kind of dual mode communication network-building method and system based on media access control layer |
| CN110391999A (en) * | 2018-04-18 | 2019-10-29 | 海能达通信股份有限公司 | A kind of data communications method and system |
| CN111600961A (en) * | 2020-05-22 | 2020-08-28 | 山东超越数控电子股份有限公司 | Method, system, equipment and medium for transmitting bitmap file through CAN port |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114338830A (en) * | 2022-01-05 | 2022-04-12 | 腾讯科技（深圳）有限公司 | Data transmission method and device, computer readable storage medium and computer equipment |
| CN114338830B (en) * | 2022-01-05 | 2024-02-27 | 腾讯科技（深圳）有限公司 | Data transmission method, device, computer readable storage medium and computer equipment |
| CN114629824A (en) * | 2022-03-24 | 2022-06-14 | 阿里巴巴（中国）有限公司 | Packet loss positioning method, device, computing equipment and medium |
| CN114629824B (en) * | 2022-03-24 | 2024-03-19 | 阿里巴巴（中国）有限公司 | Packet loss positioning method, device, computing equipment and medium |
| CN114745257A (en) * | 2022-03-28 | 2022-07-12 | 杭州义益钛迪信息技术有限公司 | Data frame debugging method, device, equipment and storage medium |
| CN114745257B (en) * | 2022-03-28 | 2024-01-09 | 杭州义益钛迪信息技术有限公司 | Data frame debugging method, device, equipment and storage medium |
| CN114466151A (en) * | 2022-04-11 | 2022-05-10 | 武汉中科通达高新技术股份有限公司 | Video storage system, computer equipment and storage medium of national standard camera |
| CN115334176A (en) * | 2022-07-27 | 2022-11-11 | 广州安凯微电子股份有限公司 | Data transmission method, data transmission device, computer equipment, storage medium and program product |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113709131B (en) | 2024-01-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113709131B (en) | Network data transmission method, device, computer equipment and readable medium | |
| US7089289B1 (en) | Mechanisms for efficient message passing with copy avoidance in a distributed system using advanced network devices | |
| US6799200B1 (en) | Mechanisms for efficient message passing with copy avoidance in a distributed system | |
| US10484472B2 (en) | Methods and systems for efficiently moving data between nodes in a cluster | |
| RU2477930C2 (en) | Method and system for transmitting flow multimedia data with zero copying | |
| CN102014150B (en) | Distributed small file storage system based on UDP (User Datagram Protocol) and data processing method thereof | |
| CN109376197B (en) | Data synchronization method, server and computer storage medium | |
| CN106713469B (en) | Dynamic loading method, device and system for distributed container | |
| US10609125B2 (en) | Method and system for transmitting communication data | |
| CN113490927A (en) | RDMA transport with hardware integration and out-of-order placement | |
| US7818390B2 (en) | Method for transferring data between terminal apparatuses in a transparent computation system | |
| EP1554644A4 (en) | Method and system for tcp/ip using generic buffers for non-posting tcp applications | |
| CN113127139B (en) | Memory allocation method and device based on DPDK of data plane development kit | |
| WO2018107433A1 (en) | Information processing method and device | |
| JPH11355357A (en) | File transfer method, file receiver, file transmitter and file repeater | |
| CN110798366B (en) | Task logic processing method, device and equipment | |
| JP4979206B2 (en) | Information processing method and information processing apparatus | |
| JP3878136B2 (en) | Multiple buffers for removing unnecessary header information from received data packets | |
| CN114143382A (en) | Bilateral acceleration data transmission method and system | |
| CN115917519B (en) | Recording medium storing information processing program, information processing apparatus, and information processing method | |
| JP4191473B2 (en) | Computer with wireless communication function | |
| JP2010016719A (en) | Communication control apparatus, and receiver mounted with the same | |
| CN117527458B (en) | Multicast data distribution method and device, electronic equipment and storage medium | |
| CN117135156B (en) | Edge cluster nano-tube method, system, computer readable storage medium and electronic equipment based on publish/subscribe message protocol | |
| CN113608686B (en) | Remote memory direct access method and related device |
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 |
Effective date of registration: 20240705 Address after: 2324, Building 1, Aosheng Building, No. 1166 Xinluo Street, High tech Zone, Jinan City, Shandong Province, 250000 Patentee after: Inspur Computer Technology Co.,Ltd. Country or region after: China Address before: 250000 floor 35, S01 building, Inspur Science Park, 1036 Inspur Road, Jinan area, China (Shandong) pilot Free Trade Zone, Jinan, Shandong Province Patentee before: Shandong Yunhai guochuang cloud computing equipment industry innovation center Co.,Ltd. Country or region before: China |