Search

US-12621088-B2 - Method and apparatus for transmitting objects based on deadline-aware

US12621088B2US 12621088 B2US12621088 B2US 12621088B2US-12621088-B2

Abstract

Disclosed is a method and apparatus for transmitting an object which includes packets and is significant for an application of a receiver, the method including calculating a network latency between a sender and a receiver through a control message for transmitting a plurality of packets constituting the object, detecting that a specific packet is lost among the plurality of packets, calculating a retransmission required time required for retransmitting the specific packet, comparing the retransmission required time with a deadline, and transmitting a NACK message including information related to retransmission of the specific packet to the sender when the retransmission required time is within the deadline, wherein the network latency is used for calculating the deadline determined by latency times for transmission of the object.

Inventors

  • Ho Sun Yoon
  • Tae Yeon Kim
  • Seong Moon
  • Seung Woo Hong

Assignees

  • ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE

Dates

Publication Date
20260505
Application Date
20230714
Priority Date
20221107

Claims (14)

  1. 1 . A method for transmitting an object which is meaningful to an application, by a receiver, the method comprising: calculating a network latency between a sender and the receiver through a control message for transmitting a plurality of packets which constituting the object, wherein the network latency is used for calculating a deadline determined for a transmission delay of the object; detecting that a specific packet is lost among the plurality of packets; calculating a retransmission required time required for retransmitting the specific packet; comparing the retransmission required time with the deadline; and transmitting a negative-acknowledgment (NACK) message including information related to retransmission of the specific packet to the sender when the retransmission required time is within the deadline, the method further comprising: recalculating, by the sender, the retransmission required time required for retransmitting the specific packet on the basis of a time period calculated by subtracting a time point at which a first packet of the object is transmitted from a time point at which the NACK message arrives; and determining, by the sender, whether the NACK message is received before or after a last packet of the object is transmitted, wherein, when the NACK message is received after the last packet of the object is transmitted to the receiver, the recalculating of the retransmission required time comprises additionally adding a time period calculated by subtracting a time point at which the last packet is transmitted from the time point at which the NACK message is received to the retransmission required time.
  2. 2 . The method of claim 1 , further comprising, when the recalculated retransmission required time is within the deadline, receiving the specific packet from the sender.
  3. 3 . The method of claim 1 , wherein each data packet structure of the plurality of packets includes a partition field which has a partition value indicating whether a corresponding packet is a first part, an intermediate part, or a last part of the object or whether the corresponding packet is the object.
  4. 4 . The method of claim 3 , wherein each data packet structure of the plurality of packets further includes a remaining packet counter field which indicates the number of packets remaining after a currently transmitted packet among the plurality of packets of the object.
  5. 5 . The method of claim 1 , further comprising sharing, by the receiver and the sender, information on a sending rate or a bandwidth and information on a bounded latency through a control message.
  6. 6 . The method of claim 1 , further comprising calculating the deadline by adding an object sending latency required for transmitting the plurality of packets, a bounded latency, and the network latency.
  7. 7 . The method of claim 6 , wherein, when the retransmission required time is within the deadline, a retransmission latency is smaller than the bounded latency.
  8. 8 . The method of claim 1 , further comprising: calculating, by the sender, a first network latency occurring when the sender transmits a packet to the receiver; and calculating, by the sender, a second network latency occurring when the receiver transmits a packet to the sender.
  9. 9 . A method for transmitting an object which is used in an application, by a sender, the method comprising: calculating a network latency between the sender and a receiver through a control message for transmitting a plurality of packets constituting the object, wherein the network latency is used for calculating a deadline determined for a transmission delay of the object; receiving a negative-acknowledgment (NACK) message from the receiver detecting that a specific packet is lost among the plurality of packets; calculating a retransmission required time required for retransmitting the specific packet on the basis of a time period calculated by subtracting a time point at which a first packet of the object is transmitted from a time point at which the NACK message arrives; and retransmitting the specific packet to the sender when the calculated retransmission required time is within the deadline, the method further comprising determining whether the NACK message is received before or after a last packet of the object is transmitted, wherein, when the NACK message is received after the last packet of the object is transmitted to the receiver, the calculating of the retransmission required time comprises additionally adding a time period calculated by subtracting a time point at which the last packet is transmitted from the time point at which the NACK message is received to the retransmission required time.
  10. 10 . The method of claim 9 , further comprising calculating the deadline by adding an object sending latency required for transmitting the plurality of packets, a bounded latency, and the network latency.
  11. 11 . The method of claim 10 , wherein, when the retransmission required time is within the deadline, a retransmission latency is smaller than the bounded latency.
  12. 12 . The method of claim 9 , wherein each data packet structure of the plurality of packets includes a partition field which has a partition value indicating whether a corresponding packet is a first part, an intermediate part, or a last part of the object or whether the corresponding packet is the object.
  13. 13 . The method of claim 12 , wherein each data packet structure of the plurality of packets further includes a remaining packet counter field which indicates the number of packets remaining after a currently transmitted packet among the plurality of packets of the object.
  14. 14 . The method of claim 9 , wherein the receiver calculates a retransmission required time required for retransmitting the specific packet, comparing the retransmission required time with a precalculated deadline, and transmitting a NACK message including information related to retransmission of the specific packet to the sender when the retransmission required time is within the deadline.

Description

CROSS-REFERENCE TO RELATED APPLICATION This application claims priority to Korean Patent Application No. 10-2022-0146710, filed on Nov. 7, 2022, with the Korean Intellectual Property Office (KIPO), the entire contents of which are hereby incorporated by reference. BACKGROUND 1. Technical Field The present disclosure relates to a technology for transmitting data in object units composed of one or more packets meaningful in an application, and more particularly, to an object transmission method and apparatus for transmitting or discarding corresponding data based on deadline-aware by calculating whether a specific object can be retransmitted within a deadline which is determined according to a communication environment when a packet included in the specific object is lost. 2. Description of Related Art Transmission control protocol (TCP) which is one of the existing transmission protocols, uses a retransmission method to reliably transmit packets to a receiver side. However, simply retransmitting all lost packets until a timeout occurs may have negative influences on both an application and a network. Accordingly, active research is being carried out on methods of selectively performing retransmission. With the increase in media data such as video and audio data, the necessity of exchanging data in object units, which include one or more packets and are significant for an application, is increasing. For example, one image screen may be an object significant for an application, and the object may include one or more packets. A receiving application may output one image only after receiving all packets constituting an object, and when all the packets are not received, the corresponding object cannot be used. Also, in real-time services, such as a video conference service, a metaverse service, a game service, and the like, it is necessary to transmit data to a receiver within a certain time period. For example, in the case of outputting a video stream on a screen of a receiving person in real time, an object which arrives too late is not output on the screen. In other words, it is necessary not only to simply transmit an object to a receiver side but also to ensure that all packets constituting the object arrive at the receiver side within a certain time. When all the packets constituting the object do not arrive at the receiver side within the certain time, the object is discarded. Transmission protocols, such as TCP, Quick User Datagram Protocol (UDP) Internet Connections (QUIC), and the like, use a retransmission mechanism to recover from a packet loss. According to the existing retransmission method, when a packet loss occurs, the corresponding data is simply retransmitted during a timeout period until a receiver side receives the data. This method of simply retransmitting all packets has problems in supporting a real-time service as well as its performance. SUMMARY Accordingly, example embodiments of the present disclosure are provided to substantially obviate one or more problems due to limitations and disadvantages of the related art. An object of the present disclosure is to provide a method and apparatus for transmitting objects, which calculates whether an object can be transmitted or retransmitted to a receiver within a deadline determined according to a communication environment, and processes the object which refers to data composed of one or more packets and is meaningful to an application. Another object of the present disclosure is to provide a method and apparatus for transmitting objects, which calculates whether an object can be transmitted or retransmitted from a sender within a deadline determined according to a communication environment, and requests to the sender for a transmission procedure or a retransmission procedure for the object which is meaningful to an application and consists of one or more packets. According to a first exemplary embodiment of the present disclosure, a method for transmitting an object (hereafter refer to ‘object transmission method’) may comprise: calculating a network latency between a sender and a receiver through a control message for transmitting a plurality of packets constituting the object, wherein the network latency is used for calculating a deadline determined for a transmission delay of the object; detecting that a specific packet is lost among the plurality of packets; calculating a retransmission required time required for retransmitting the specific packet; comparing the retransmission required time with the deadline; and transmitting a negative-acknowledgment (NACK) message including information related to retransmission of the specific packet to the sender when the retransmission required time is within the deadline. The object transmission method may further comprise recalculating, by the sender, the retransmission required time required for retransmitting the specific packet on the basis of a time period calculated by subtracting a time point a