Per-protocol data unit delivery-path indication
10396966 ยท 2019-08-27
Assignee
Inventors
Cpc classification
H04L5/0064
ELECTRICITY
H04L1/1838
ELECTRICITY
International classification
Abstract
Indication of delivery-path information may benefit various communication systems. For example, wireless communication systems may benefit from per-protocol data unit delivery-path indication to data recipient or from setting a timer expiry value dependent on such received information. A method can comprise sending, by a data-sending protocol entity, a control protocol data unit. The control protocol data unit can identify protocol data units destined to a data-receiving protocol entity. The method can also comprise providing in the control protocol data unit, for each of the identified protocol data units, a direct or indirect indication of at least one delay figure of a delivery path chosen for an initial transmission of the identified protocol data unit.
Claims
1. A method, comprising: sending, by a data-sending protocol entity, a control protocol data unit, wherein said control protocol data unit identifies other protocol data units destined to a data-receiving protocol entity; and providing in the control protocol data unit, for each of said identified protocol data units, a direct indication of at least one delay figure of a delivery path chosen for an initial transmission of the identified protocol data unit.
2. The method of claim 1, wherein the control protocol data unit identifies the other protocol data units by sequence number.
3. The method of claim 1, wherein the at least one delay figure comprises at least one of a best-case delay and a worst-case delay.
4. An apparatus, comprising: at least one processor; and at least one memory including computer program code, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to send, by a data-sending protocol entity, a control protocol data unit, wherein said control protocol data unit identifies other protocol data units destined to a data-receiving protocol entity; and provide in the control protocol data unit, for each of said identified protocol data units, a direct indication of at least one delay figure of a delivery path chosen for an initial transmission of the identified protocol data unit.
5. The apparatus of claim 4, wherein the control protocol data unit identifies the other protocol data units by sequence number.
6. The apparatus of claim 4, wherein the at least one delay figure comprises at least one of a best-case delay and a worst-case delay.
7. A method, comprising: receiving, from a data-sending protocol entity, a control protocol data unit, wherein said control protocol data unit identifies other protocol data units destined to a data-receiving protocol entity; retrieving from the control protocol data unit, for at least one of said identified protocol data units, a direct indication of at least one delay figure of a delivery path chosen for an initial transmission of the identified protocol data unit; and applying the at least one delay figure to determine a waiting time in relation to a gap in received protocol data units.
8. The method according to claim 7, wherein the at least one delay figure comprises at least one of a best-case delay and a worst-case delay.
9. The method according to claim 7, further comprising: using a timer for controlling the waiting time, and determining an expiry value of the timer based on at least one delay figure previously indicated for at least one protocol data unit.
10. The method according to claim 7, wherein the at least one delay figure comprises a maximum delay of all missing protocol data units in a gap and a minimum delay of a received protocol data unit that created the gap.
11. The method according to claim 7, further comprising: using a timer for controlling the waiting time, and determining an expiry value of the timer based on at least one delay figure previously indicated for at least one protocol data unit, wherein the at least one protocol data unit comprises at least one of a protocol data unit whose reception created a gap in the sequence of received protocol data units, and a not-received protocol data unit within said gap.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
(1) For proper understanding of the invention, reference should be made to the accompanying drawings, wherein:
(2)
(3)
(4)
(5)
DETAILED DESCRIPTION
(6) Certain embodiments may be applicable both to a distributed-RLC option and to an independent-RLCs option. In certain embodiments, it is assumed that automatic repeat request (ARQ) at PDCP is being used, in which case a timer, such as a reordering timer, can be used at PDCP to infer packet losses as with RLC.
(7) In certain embodiments, it is assumed that a data-sending protocol entity can choose for each packet sent, one of more than one delivery paths each with different expected delay for the packet to come through. For example, the delay of sending a packet through the slave node may exceed that of direct transmission from the master node at least by the X2-transfer delay. Moreover, the data-receiving protocol entity can use a mechanism like RLC's timer to infer when a PDU has really been lost in transfer at the lower protocol layer.
(8) In the distributed-RLC option, the protocol of interest may be RLC. In the independent-RLCs option, the protocol of interest may be PDCP.
(9) In such a scenario, when the data-receiving protocol entity observes a gap in the sequence of received PDUs, the data-receiving protocol entity does not know much about the worst-case transmission-delay difference(s), including components such as X2-transfer delay and HARQ retransmissions at MAC, between the missing PDU(s) and the received PDU that created the reception gap, to infer when that missing PDU(s) has been lost in transfer at the lower protocol layer. As a result, packets gone missing at the lower layer can only be NACKed by the receiving side to the sending side (in the case of acknowledged-mode data transfer), or ignored in the delivery of SDUs to higher layer (in the case of unacknowledged-mode data transfer) under worst-of-worst case assumptions, which then appears as longer-than-necessary transmission delay to the higher protocol layer to which the PDUs are eventually delivered.
(10) Certain embodiments provide a per-PDU delivery-path indication to data recipient and certain embodiments provide a timer expiry value based on such indications.
(11) Providing a per-PDU delivery-path indication to data recipient can entail the data-sending protocol entity sending control PDUs, each of which identifies other PDUs, for example by their SNs, destined to the data-receiving protocol entity. The control PDUs can also identify, for each identified PDU, a direct or indirect indication of at least one delay figure, for example the best-case delay and the worst-case delay, of the delivery path chosen for the initial transmission of that PDU. An example of indirect indication is the lower-layer protocol-bearer, if RLC, or protocol-connection, if MAC, through which that PDU was, or will be, sent, in which case the associated delay figures for those paths have been previously configured by RRC at bearer configuration.
(12) Certain embodiments provide timer expiry value based on such delay values. In general, there are at least two PDUs involved when the timer is started: the PDU received that created a gap in the sequence of received PDUs, and the one or more missing PDUs within that newly appeared gap. The second component of this invention is that the expiry value of the timer started in such a situation depends on at least one delay figure previously indicated for at least one of the involved PDUs. If none are available, a worst-case value can be used. The worst-case value can be a longest conceivable expiry value.
(13) Various implementations are possible. For example, at bearer configuration, a best-case associated minimum delay D1 and worst-case associated maximum delay D2 can be configured by RRC to each lower-layer protocol-bearer, if RLC, or protocol-connection, if MAC, delivering data for this bearer.
(14) When the timer is started, the expiry value can be the maximum, over all missing PDUs i in the observed reception gap, of D2(i)D1 (the PDU received that created the gap), where the Dx of each PDU is determined from a previously received delivery-path indication. If either or both of the associated D1, D2 are unavailable, the longest of the configured D2s and the shortest of the configured D1s can be used in this determination as needed.
(15)
(16) The method can also comprise, at 320, providing in the control protocol data unit, for each identified protocol data units, a direct or indirect indication of at least one delay figure of a delivery path chosen for an initial transmission of the identified protocol data unit. The at least one delay figure can comprise at least one of a best-case delay and a worst-case delay.
(17) The method can also comprise at a receiving side, at 330, determining an expiry value of a timer based on at least one delay figure previously indicated for at least one protocol data unit. The at least one protocol data unit can comprise at least one of a missing protocol data unit within a gap and a received protocol data unit that created the gap.
(18) The method can further comprise, at 340, determining an expiry value of a timer based on a worst-case value of the at least one delay figure. The at least one delay figure can comprise at least one of a preconfigured best-case minimum delay and a preconfigured worst-case delay, wherein the at least one delay figure is preconfigured at bearer configuration. The at least one delay figure can comprise a maximum delay of all missing protocol data units in a gap and a minimum delay of a received protocol data unit that created the gap.
(19)
(20) The method can also comprise, at 420, retrieving from the control protocol data unit, for at least one identified protocol data unit (for example, for each identified protocol data unit), a direct or indirect indication of at least one delay figure of a delivery path chosen for an initial transmission of the identified protocol data unit. The at least one delay figure can comprise at least one of a best-case delay and a worst-case delay.
(21) The method can further comprise, at 430, applying the at least one delay figure to determine a waiting time in relation to a gap in received protocol data units.
(22) The method can also comprise, at 440, determining an expiry value of a timer based on at least one delay figure previously indicated for at least one protocol data unit. The at least one protocol data unit can comprise at least one of a missing protocol data unit within a gap and a received protocol data unit that created the gap.
(23) The method can further comprise, at 450, determining an expiry value of a timer based on a worst-case value of the at least one delay figure. The at least one delay figure can comprise at least one of a preconfigured best-case minimum delay and a preconfigured worst-case delay, wherein the at least one delay figure is preconfigured at bearer configuration. The at least one delay figure can comprise a maximum delay of all missing protocol data units in a gap and a minimum delay of a received protocol data unit that created the gap.
(24)
(25) Transceivers 516 and 526 may each, independently, be a transmitter, a receiver, or both a transmitter and a receiver, or a unit or device that may be configured both for transmission and reception. The transmitter and/or receiver (as far as radio parts are concerned) may also be implemented as a remote radio head which is not located in the device itself, but in a mast, for example.
(26) It should also be appreciated that according to the liquid or flexible radio concept, the operations and functionalities may be performed in different entities, such as nodes, hosts or servers, in a flexible manner. In other words, division of labour may vary case by case. One possible use is to make a network element to deliver local content. One or more functionalities may also be implemented as a virtual application that is as software that can run on a server.
(27) A user device or user equipment may be a mobile station (MS) such as a mobile phone or smart phone or multimedia device, a computer, such as a tablet, provided with wireless communication capabilities, personal data or digital assistant (PDA) provided with wireless communication capabilities, portable media player, digital camera, pocket video camera, navigation unit provided with wireless communication capabilities or any combinations thereof.
(28) In an exemplary embodiment, an apparatus, such as a node or user device, may comprise means for carrying out embodiments described above in relation to
(29) F or firmware or software, the implementation may comprise modules or unit of at least one chip set, for example, procedures, functions, and so on.
(30) Memories 515 and 525 may independently be any suitable storage device, such as a non-transitory computer-readable medium. A hard disk drive (HDD), random access memory (RAM), flash memory, or other suitable memory may be used. The memories may be combined on a single integrated circuit as the processor, or may be separate therefrom. Furthermore, the computer program instructions may be stored in the memory and which may be processed by the processors can be any suitable form of computer program code, for example, a compiled or interpreted computer program written in any suitable programming language. The memory or data storage entity is typically internal but may also be external or a combination thereof, such as in the case when additional memory capacity is obtained from a service provider. The memory may be fixed or removable.
(31) The memory and the computer program instructions may be configured, with the processor for the particular device, to cause a hardware apparatus such as network element 510 and/or UE 520, to perform any of the processes described above (see, for example,
(32) Furthermore, although
(33) One having ordinary skill in the art will readily understand that the invention as discussed above may be practiced with steps in a different order, and/or with hardware elements in configurations which are different than those which are disclosed. Therefore, although the invention has been described based upon these preferred embodiments, it would be apparent to those of skill in the art that certain modifications, variations, and alternative constructions would be apparent, while remaining within the spirit and scope of the invention. In order to determine the metes and bounds of the invention, therefore, reference should be made to the appended claims.
Glossary
(34) ACK Positive acknowledgement
(35) AM Acknowledged Mode
(36) NACK Negative acknowledgement
(37) RLC Radio Link Control
(38) PDCP Packet Data Convergence Protocol
(39) PDU Protocol Data Unit
(40) SN Sequence Number
(41) UM Unacknowledged Mode