GB2624759A - Improvements in and relating to managing delay in a multi-hop telecommunication network - Google Patents

Improvements in and relating to managing delay in a multi-hop telecommunication network Download PDF

Info

Publication number
GB2624759A
GB2624759A GB2314774.7A GB202314774A GB2624759A GB 2624759 A GB2624759 A GB 2624759A GB 202314774 A GB202314774 A GB 202314774A GB 2624759 A GB2624759 A GB 2624759A
Authority
GB
United Kingdom
Prior art keywords
node
qos
nodes
network
determining
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.)
Pending
Application number
GB2314774.7A
Other versions
GB202314774D0 (en
Inventor
Tesanovic Milos
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Samsung Electronics Co Ltd
Original Assignee
Samsung Electronics Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Samsung Electronics Co Ltd filed Critical Samsung Electronics Co Ltd
Priority to GB2314774.7A priority Critical patent/GB2624759A/en
Priority claimed from GB2016380.4A external-priority patent/GB2600097B/en
Publication of GB202314774D0 publication Critical patent/GB202314774D0/en
Publication of GB2624759A publication Critical patent/GB2624759A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0268Traffic management, e.g. flow control or congestion control using specific QoS parameters for wireless networks, e.g. QoS class identifier [QCI] or guaranteed bit rate [GBR]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/70Admission control; Resource allocation
    • H04L47/72Admission control; Resource allocation using reservation actions during connection setup
    • H04L47/724Admission control; Resource allocation using reservation actions during connection setup at intermediate nodes, e.g. resource reservation protocol [RSVP]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/302Route determination based on requested QoS
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A method of operating a multi-hop network (e.g. an integrated access and backhaul (IAB) network) comprising the steps of: receiving at a first node a Quality of Service (QoS) indicator (5QI) from a core network; calculating a QoS characteristic; receiving at the first node, assistance information from one or more second nodes; determining at the first node if a QoS profile which comprises the QoS characteristic can be guaranteed and if the result of determining is positive, the first node configures link-layer functions of the one or more second nodes and/or compiles routing tables; and if the result of determining is negative, the first node notifies the core network that the QoS profile cannot be guaranteed. The QoS characteristic may be packet delay budget (PDB), packet error rate (PER), guaranteed bit-rate (GBR). The step of determining may comprise one or more of: estimated processing time at each node; a switching delay between Rx and Tx functions of a node; and the UL/DL frame switching delay. The first node may set scheduling priority weights and HARQ target operating points to be used by the one or more second nodes, based on QoS estimates for multi-hop operation.

Description

Improvements in and relating to managing delay in a multi-hop telecommunication network The present invention relates to multi-hop networks and, in particular, the management of delays incurred as a result of the multiple hops which necessarily make up a signal path in such networks. Embodiments of the invention focus on Fifth Generation (5G) telecommunication networks in particular, but other types of multi-hop networks can benefit from embodiments of the invention. A particular focus of embodiments of the invention is Integrated Access and Backhaul (IAB) networks.
Figure 1 shows a two-hop IAB network as known in the prior art. In a multi-hop network, the delays are likely to accumulate due to number of hops (with each hop incurring not just the propagation delay but also processing delay and half-duplex operation delay) and also aggregated volume of data at IAB nodes (leading to queueing delay). Embodiments of the present invention aim to address issues with such delays and so reduce the delay significantly for both the Downlink (DL) and the Uplink (UL).
5G Quality of Service (QoS) Identifier, or 5QI, is a scalar that is used to denote a specific QoS forwarding behaviour (e.g. packet loss rate, packet delay budget, guaranteed bit rate (GBR)) to be provided to a 5G QoS Flow. Standardized 5QI values have one-to-one mapping to a standardized combination of 5G QoS characteristics. How the Radio Access Network (RAN) implements this is not standardised and is left to particular implementations. However, radio standards offer a signalling design which supports decisions that the access node may take such as use of specific scheduling weights, admission thresholds, link layer protocol configuration, etc. Packet Delay Budget (PDB) is an integral part of 5G QoS characteristics that a 5QI value represents. PDB defines an upper bound for the time that a packet may be delayed between the User Equipment (UE) and the User Plane Function (UPF) that terminates the N6 interface in the network. For a certain 5QI, the value of the PDB is the same in UL and DL. In the case of 3GPP access, the PDB is used to support the configuration of scheduling and link layer functions (e.g. the setting of scheduling priority weights and Hybrid Automatic Repeat Request (HARQ) target operating points). For GBR QoS Flows using the Delay-critical resource type, a packet delayed more than PDB is counted as lost if the data burst is not exceeding the Maximum Data Burst Volume (MDBV) within the period of PDB and the QoS Flow is not exceeding the Guaranteed Flow Bit Rate (GFBR).
The 5G Access Network Packet Delay Budget (5G-AN PDB) is determined by subtracting a static value for the Core Network Packet Delay Budget (CN PDB), which represents the delay between any UPF terminating N6 (that may possibly be selected for the PDU Session) from a given PDB.
Embodiments of the invention aim to provide means to ensure that QoS and, in particular, the PDB components of QoS is met across multi-hop networks.
According to a first aspect of the invention, there is provided a method of operating a multi-hop network comprising the steps of: receiving, at a second node, packet, comprising data or control signalling; calculating, at the second node, a Quality of Service, QoS, characteristic; determining, at the second node, if a Quality of Service, QoS, profile which comprises the characteristic can be guaranteed and, if the result of determining is positive, the second node determines a path and modifies the packet, if necessary, and submits a resultant packet to a next hop in the network according to the determined path; and if the result of determining is negative, the second node notifies a first node that the QoS profile cannot be guaranteed.
In an embodiment, the network is an Integrated Access and Backhaul, IAB, network.
In an embodiment, the packet is a Backhaul Adaptation Protocol, BAP, packet.
In an embodiment, the QoS characteristic is one of: PDB, required/expected/intended Packet Error-Rate, PER, and guaranteed bit-rate.
In an embodiment, the step of determining comprises one or more of: estimated processing time at each node; a switching delay between Rx and Tx functions of a node; and the UL/DL frame switching delay.
In an embodiment, the first node takes into account the QoS characteristic for a given QoS flow when mapping the QoS flow to one or more bearers and then routing accordingly.
In an embodiment, when routing, one or more of the following steps are implemented: using fewer hops; routes with fewer or no congestion reports; setting priorities between paths; and assigning new parent node(s).
In an embodiment, the first node sets scheduling priority weights and HARQ target operating points to be used by the one or more second nodes, based on QoS estimates for multi-hop operation.
In an embodiment, feedback from one or more second nodes on locally-made routing decisions, projected failed delivery or handover, is signalled to and taken into account by the first node.
In an embodiment, the QoS characteristic is shared with the one or more second nodes.
In an embodiment, a BAP header includes a bearer ID of an associated bearer.
According to a second aspect of the invention, there is provided method of operating a multi-hop network comprising the steps of: receiving at a first node a Quality of Service indicator, 5QI, from a core network; calculating a Quality of Service, QoS, characteristic; receiving at the first node, assistance information from one or more second nodes; determining at the first node if a QoS profile which comprises the QoS characteristic can be guaranteed and if the result of determining is positive, the first node configures link-layer functions of the one or more second nodes and/or compiles routing tables; and if the result of determining is negative, the first node notifies the core network that the QoS profile cannot be guaranteed.
In an embodiment, the network is an Integrated Access and Backhaul, IAB, network.
In an embodiment, the QoS characteristic is one of: PDB required/expected/intended Packet Error-Rate, PER, and guaranteed bit-rate.
In an embodiment, the step of determining comprises one or more of: estimated processing time at each node; a switching delay between Rx and Tx functions of a node; and the UL/DL frame switching delay.
In an embodiment, the first node takes into account the QoS characteristic for a given QoS flow when mapping the QoS flow to one or more bearers and then routing accordingly.
In an embodiment" one or more of the following steps are implemented: using fewer hops; routes with fewer or no congestion reports; setting priorities; and assigning new parent node(s).
In an embodiment, the first node sets scheduling priority weights and HARQ target operating points to be used by the one or more second nodes, based on QoS estimates for multi-hop operation.
In an embodiment, feedback from one or more second nodes on locally-made routing decisions, projected failed delivery or handover, is signalled to and taken into account by the first node.
In an embodiment, the QoS characteristic is shared with the one or more second nodes.
According to a third aspect of the invention, there is provided a method comprising the method of the first aspect and the second aspect According to a fourth aspect of the invention, there is provided network operable to perform the method of any of the previous aspects.
According to an aspect of the present invention, intermediate nodes in a multi-hop network are arranged to make decisions in relation to incoming packets. In an embodiment, they are able to divert or drop a packet according to certain conditions. In prior art IAB networks, the decision making ability of individual nodes is generally limited to the specific case of radio link failure RLF. In such a case, a node can deviate from explicit signalling information, but this is clearly a special case.
In an embodiment, the local decision making can be limited to making a selection from a predefined list of possible options. Alternatively, greater autonomy can be granted to the local node, as required.
According to another aspect of the present invention, one or more feedback paths are provided whereby the CU is provided with information which assists in ensuring that PDB can be met across a multi-hop network.
Extra signalling can, of course, introduce an additional overhead on the network and can, if over-used, result in a worse performance than if it were not used. However, by striking the correct balance, the extra signalling can improve performance.
According to the present invention there is provided an apparatus and method as set forth in the appended claims. Other features of the invention will be apparent from the dependent claims, and the description which follows.
Although a few preferred embodiments of the present invention have been shown and described, it will be appreciated by those skilled in the art that various changes and modifications might be made without departing from the scope of the invention, as defined in the appended claims.
For a better understanding of the invention, and to show how embodiments of the same may be carried into effect, reference will now be made, by way of example only, to the accompanying diagrammatic drawings in which: Figure 1 shows an IAB network according to the prior art; Figure 2 show two types of control PDU, known in the prior art; Figure 3 shows a flowchart according to an embodiment of the invention; and Figure 4 shows a flowchart according to another embodiment of the invention.
In an embodiment of this invention, the gNB (Donor-CU) 10 sends a notification towards the Service Network Framework (SNF) that the QoS profile cannot be guaranteed, based on one or more parameters indicating the status of one or more of IAB nodes or links en-route to the potentially multiple destinations for a given QoS flow, and possibly based on one or more parameters indicating the status of the wider network. As an example, feedback from individual nodes on congestion (obtained, in part, based on flow control feedback) or Radio Link Failure (RLF) along the potential paths can be taken into account.
In a further refinement, the gNB (Donor-CU) 10 sends a notification towards SNF that QoS profile can again be guaranteed, based on one or more parameters indicating status of one or more of IAB nodes or links en-route to the destination for a given QoS flow. The estimates of whether the QoS profile (and especially the PDB aspect) can be met can, in addition, include: estimated processing time at each of the nodes; the switching delay between Rx and Tx functions of a node; and the UL/DL frame (slot) switching delay.
In another embodiment, the gNB (Donor-CU) 10 takes into account the 501/QF1 for a given QoS flow when mapping this flow to one or more bearers and configuring routing appropriately. An example action would be using shorter routes (fewer hops), or routes where there have been no or few congestion reports, as well as setting priority of different paths for the case where there is more than one path from an intermediate node (including Donor-DU 20) to the destination. Another example action is assigning new parent node(s) for one or more nodes (or UEs) within the network.
In another embodiment, Donor-CU 10 sets scheduling priority weights and HARQ target operating points to be used by intermediate nodes based on QoS estimates for multi-hop.
In an embodiment, local decision making by an intermediate node is permitted and in such a configuration, feedback from intermediate nodes on locally-made routing decisions (such as changes in routing from the routing prescribed by the CU 10), projected failed delivery, handover, is signalled to and taken into account by the CU 10. This additional feedback permits the CU 10 to gather information on individual performance of intermediate nodes and factor any delays into its routing decisions and instructions. It should be noted that even in cases without local decision making at the intermediate nodes, additional feedback to the CU can still assist when it makes its routing decisions and instructions, In another embodiment linked to local decision-making, PDB is shared with the intermediate nodes (e.g. average PDB per link is shared in a configuration message, obtained by dividing the original PDB with the number of hops and shared by the CU 10; or, PDB-related information is included in the packet header and then each intermediate node modifies the PDB part of the header by deducting a certain value in response to the delay already incurred; or, some other QoS parameter is included in the Backhaul Adaptation Protocol (BAP) header).
This could be part of the BAP header or introduced at a different layer.
In a refinement, the PDB or PER or guaranteed bit-rate values are modified from the original end-to-end values, for instance: - PDB is adjusted to take into account the shorter than originally envisaged distance to the destination e.g. due to rerouting and/or changes in topology; PER is adjusted so that links with lower PER (for instance, when higher delay on a specific link can be tolerated and retransmissions are expected to occur) or higher PER can be used; - GBR is adjusted so that a more stringent rate is required from the next hop(s) due to delays already incurred.
To assist the intermediate nodes, time-stamps (e.g. validity/expiry time of a packet; recommended/expected per-hop delay etc.) are included in headers of packets, so that intermediate nodes can make the right routing and/or scheduling decisions on the basis of this time-stamp information.
In an embodiment, the information on packet validity or QoS (such as time-stamps, PDB) is used to trigger flow control feedback polling of the child node and/or flow control feedback reporting to the parent node. All the packets with the same QoS characteristic(s) may be grouped for purposes for such flow control reporting.
In the prior art, Hop by Hop flow control feedback is limited to single-hop, downlink only (meaning that the feedback is sent in uplink direction) and includes available or desired buffer size On absolute terms, rather than relative terms e.g. percentage). Additionally, the flow control feedback can only be reported for a subset of bearers with the same routing ID (basically bearers heading to the same final destination), or for the entire channel (total buffer status of a channel of the link). Moreover, reporting based on polling and threshold-based reporting are both introduced.
Figure 2 illustrates control PDUs for the two types of flow control feedback (per routing ID, and per BH channel respectively) known in the prior art.
In embodiments of the present invention, one or more existing control PDUs (as shown, for example, in Figure 2) may be used for reporting the enhanced content according to the embodiments described. For instance, one of the reserved 'R' bits may be used to indicate that what is being reported is per QoS characteristic (i.e. all packets with same or similar QoS characteristic are grouped for purposes of reporting), and the fields for BH RLC Channel ID or Routing ID may then be used to indicate said QoS characteristic. Additional fields may be added to the control PDU to carry, for instance, desired data rate for a node in question and for a given type of traffic (with certain QoS characteristics) or preferred number of hops to the node to which the report refers.
For 1:1 mapping between bearers and backhaul channels, it is not necessary to include the bearer ID in the BAP header (or elsewhere), but embodiments of the invention do not preclude it.
However, for N:1 mapping, in an embodiment of this invention the bearer ID is included. In this way, per-bearer use of adjusted QoS characteristics (e.g. PDB), is possible even for the case of N:1 mapping.
Typically, a static value for the Core Network (CN) portion of the PDB of 2ms for the delay between a UPF terminating N6 and a 5G-Access Network should be subtracted from a given PDB to derive the packet delay budget that applies to the radio interface. It is this value that applies to the radio interface that has been referred to thus far.
In a refinement of the above mentioned embodiments, a dynamic value for the CN PDB is used to work out the 5G Access Network Packet Delay Budget (5G-AN PDB). For instance, this may be the case if, based on feedback received from UEs and intermediate nodes, the Donor-CU 10 works out that less stringent treatment on the radio network is required (or the opposite).
For relaying systems where intermediate nodes handle fully-blown QoS flows and not just BAP packets (e.g. Layer-3 relaying), in an embodiment of this invention the 501/QF1 is shared with some or all of the intermediate nodes along a route. In a refinement, the mapping of the 501/QF1 to QoS characteristics is modified, for instance: PDB is adjusted to take into account the shorter distance to the destination; - PER is adjusted so that links with lower PER (for instance, when higher delay on a specific link can be tolerated) or higher PER can be used; - GBR is adjusted so that a more stringent rate is required from the next hop(s) due to delays already incurred.
In another refinement, intermediate nodes are given a different 50110F1 value (while keeping the same mapping of the 5Q1/QFI to QoS characteristics).
The above description concentrates on the DL, but on the UL, similar considerations as above apply. One additional consideration is modification to admission policy, based on the best or average or e.g. 90-percentile delay that could be offered to a UE on the UL across the IAB network. The estimates could additionally take into account whether the network deploys other UL-specific delay-mitigating techniques such as pre-emptive Buffer Status Report (BSR).
Figure 3 is a flowchart which illustrates certain steps in a first embodiment. It relates specifically to operation whereby a BAP packet is received, determining if QoS profile can be guaranteed and actions taken in accordance with that determination. In general, Figure 3 relates to the local decision-making referred to previously.
At 310, a new BAP packet is received by an intermediate node.
At S20, the intermediate node calculates whether the PDB can be met, based on PDB-related information in the BAP packet, or PDB-related information (e.g. PDB per link) received in a configuration message from the CU, and the time stamp included in the BAP packet.
At S30, the intermediate node determines if the QoS profile can be guaranteed.
If not, flow continues to 350, where the CU is notified that the QoS profile cannot be guaranteed and flow returns to 310 again.
If the result of the determination at S30 is that the QoS profile can be guaranteed, then at S40 an appropriate path is chosen and the BAP header is modified, if required. Step 340 represents the local decision-making process, referred to previously. Here, the intermediate node is taking independent action on the basis of the determination at step S30, which may result in a modified path. If so, the BAP header is modified accordingly so that the following node(s) are not confused.
Then, at S60, the BAP packet is submitted to the next hop and then flow returns to 310.
Figure 4 is a flowchart which illustrates certain steps which are related to the CU features of embodiments of the invention. It should be noted that the methods shown in Figures 3 and 4 may be implemented together or separately. Greater improvements may be achieved in system performance if both are used, but neither relies upon the other.
At S110, 5QI is received from the SNF in the CN 30 at the gNB/Donor CU 10.
At S120, the CU 10 calculates the AN PDB At S130, the CU 10 receives feedback from the intermediate node(s) related to the respective link status(es).
At S140, the CU 10 determines if the QoS profile can be guaranteed. If not, at S160, the SNF is notified and flow returns to S110.
If the determination at 3140 reveals that the QoS profile can be guaranteed, then at S150, the CU configures link-layer functions of the intermediate node(s) and compiles the necessary routing tables. Flow then returns to S110.
By use of embodiments of the present invention, improvements in the performance of an IAB network may be obtained. Such improvements are realised by either or both of increased signalling of assistance information, primarily from intermediate nodes to the donor CU, and an increased level of local decision making at the intermediate nodes.
At least some of the example embodiments described herein may be constructed, partially or wholly, using dedicated special-purpose hardware. Terms such as 'component', 'module' or 'unit used herein may include, but are not limited to, a hardware device, such as circuitry in the form of discrete or integrated components, a Field Programmable Gate Array (FPGA) or Application Specific Integrated Circuit (ASIC), which performs certain tasks or provides the associated functionality. In some embodiments, the described elements may be configured to reside on a tangible, persistent, addressable storage medium and may be configured to execute on one or more processors. These functional elements may in some embodiments include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables. Although the example embodiments have been described with reference to the components, modules and units discussed herein, such functional elements may be combined into fewer elements or separated into additional elements. Various combinations of optional features have been described herein, and it will be appreciated that described features may be combined in any suitable combination. In particular, the features of any one example embodiment may be combined with features of any other embodiment, as appropriate, except where such combinations are mutually exclusive. Throughout this specification, the term "comprising" or "comprises" means including the component(s) specified but not to the exclusion of the presence of others.
Attention is directed to all papers and documents which are filed concurrently with or previous to this specification in connection with this application and which are open to public inspection with this specification, and the contents of all such papers and documents are incorporated herein by reference.
All of the features disclosed in this specification (including any accompanying claims, abstract and drawings), and/or all of the steps of any method or process so disclosed, may be combined in any combination, except combinations where at least some of such features and/or steps are mutually exclusive.
Each feature disclosed in this specification (including any accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise. Thus, unless expressly stated otherwise, each feature disclosed is one example only of a generic series of equivalent or similar features.
The invention is not restricted to the details of the foregoing embodiment(s). The invention extends to any novel one, or any novel combination, of the features disclosed in this specification (including any accompanying claims, abstract and drawings), or to any novel one, or any novel combination, of the steps of any method or process so disclosed.

Claims (1)

  1. CLAIMS1. A method of operating a multi-hop network comprising the steps of * receiving at a first node a Quality of Service indicator, 5QI, from a core network; * calculating a Quality of Service, QoS, characteristic; * receiving at the first node, assistance information from one or more second nodes; * determining at the first node if a QoS profile can be guaranteed and if the result of determining is positive, the first node configures link-layer functions of the one or more second nodes and/or compiles routing tables; and * if the result of determining is negative, the first node notifies the core network that the QoS profile cannot be guaranteed. 15 2. The method of claim 1 wherein the network is an Integrated Access and Backhaul, IAB, network.3. The method of claim 1 or 2 wherein the QoS characteristic is one of: PDB required/expected/intended Packet Error-Rate, PER, and guaranteed bit-rate.4. The method of any of claims 1 to 3 wherein the step of determining comprises one or more of: estimated processing time at each node; a switching delay between Rx and Tx functions of a node; and the UL/DL frame switching delay.5. The method of any of claims 1 to 4 wherein the first node takes into account the QoS characteristic for a given QoS flow when mapping the QoS flow to one or more bearers and then routing accordingly.6. The method of claim 5 wherein when routing, one or more of the following steps are implemented: using fewer hops; routes with fewer or no congestion reports; setting priorities; and assigning new parent node(s).7. The method of any of claims 1 to 6 wherein the first node sets scheduling priority weights and HARQ target operating points to be used by the one or more second nodes, based on QoS estimates for multi-hop operation.8. The method of any of claims 1 to 7 wherein feedback from one or more second nodes on locally-made routing decisions, projected failed delivery or handover, is signalled to and taken into account by the first node.9. The method of any of claims 1 to 8 wherein the QoS characteristic is shared with the one or more second nodes.10. A network operable to perform the method of any preceding claim.
GB2314774.7A 2020-10-15 2020-10-15 Improvements in and relating to managing delay in a multi-hop telecommunication network Pending GB2624759A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
GB2314774.7A GB2624759A (en) 2020-10-15 2020-10-15 Improvements in and relating to managing delay in a multi-hop telecommunication network

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
GB2016380.4A GB2600097B (en) 2020-10-15 2020-10-15 Improvements in and relating to managing delay in a multi-hop telecommunication network
GB2314774.7A GB2624759A (en) 2020-10-15 2020-10-15 Improvements in and relating to managing delay in a multi-hop telecommunication network

Publications (2)

Publication Number Publication Date
GB202314774D0 GB202314774D0 (en) 2023-11-08
GB2624759A true GB2624759A (en) 2024-05-29

Family

ID=90924651

Family Applications (1)

Application Number Title Priority Date Filing Date
GB2314774.7A Pending GB2624759A (en) 2020-10-15 2020-10-15 Improvements in and relating to managing delay in a multi-hop telecommunication network

Country Status (1)

Country Link
GB (1) GB2624759A (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2574875A (en) * 2018-06-21 2019-12-25 Tcl Communication Ltd Route selection and QoS support in a wireless access network

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2574875A (en) * 2018-06-21 2019-12-25 Tcl Communication Ltd Route selection and QoS support in a wireless access network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
3GPP Draft R3-205168 (ZTE, Sanechips) Consideration on multi-hop latency for IAB network (07.08.2020) https://www.3gpp.org/ftp/TSG_RAN/WG3_Iu/TSGR3_109-e/Docs/R3-205168.zip *

Also Published As

Publication number Publication date
GB202314774D0 (en) 2023-11-08

Similar Documents

Publication Publication Date Title
US20190349810A1 (en) Method for transmitting lossless data packet based on quality of service (qos) framework in wireless communication system and a device therefor
JP4952586B2 (en) Packet data discarding method, radio communication apparatus, and mobile communication system
EP3490332B1 (en) Processing method and device for radio bearer for transmitting data stream
Kuhlmorgen et al. Performance evaluation of etsi geonetworking for vehicular ad hoc networks
US8995383B2 (en) (H)ARQ for semi-persistent scheduling
US9112797B2 (en) Congestion handling in a communication network
US7889743B2 (en) Information dissemination method and system having minimal network bandwidth utilization
US11570846B2 (en) Discard timer operation in wireless communication
EP2253106B1 (en) Method and system for controlling link saturation of synchronous data across packet networks
US9906985B2 (en) Method and device for selecting uplink data
KR102542893B1 (en) Method and apparatus for delivering uplink buffer status report of a relay in a wireless communication system
ES2440968T3 (en) ADSL and 3G traffic aggregation in local gateway environment
KR20230088430A (en) Rerouting method and device, communication device
US20240048480A1 (en) Communication method and apparatus
US20230053602A1 (en) Method to determine a quality of service, computer-readable storage medium and device
US9391912B2 (en) Selective bicasting
US11064395B1 (en) Ensuring quality of service at a cell site router
WO2020192250A1 (en) Method and apparatus for establishing radio bearer
GB2624759A (en) Improvements in and relating to managing delay in a multi-hop telecommunication network
GB2600097A (en) Improvements in and relating to managing delay in a multi-hop telecommunication network
WO2023062192A2 (en) Rfl backhaul handling with dual connectivity
WO2022202976A1 (en) Communication control method
US20240334244A1 (en) RAN and UE Driven L4S Marking and Processing for Congestion Management in an O-RAN Based Network Architecture
KR200415521Y1 (en) A mesh point for supporting data flow control in a wireless mesh network
Alwan et al. A scalable joint routing and OFDMA resource allocation in LTE-D2D networks