Multi-RAT Dual Connectvity
US-2020396785-A1 · Dec 17, 2020 · US
US11924310B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11924310-B2 |
| Application number | US-202217987771-A |
| Country | US |
| Kind code | B2 |
| Filing date | Nov 15, 2022 |
| Priority date | Oct 20, 2015 |
| Publication date | Mar 5, 2024 |
| Grant date | Mar 5, 2024 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method for Xx/Xn interface communication is disclosed, comprising: at an Xx/Xn gateway for communicating with, and coupled to, a first and a second radio access network (RAN), receiving messages from the first RAN according to a first Xx/Xn protocol and mapping the received messages to a second Xx/Xn protocol for transmission to the second RAN; maintaining state of one of the first RAN or the second RAN at the Xx/Xn gateway; executing executable code received at an interpreter at the Xx/Xn gateway as part of the received messages; altering the maintained state based on the executed executable code; and receiving and decoding an initial Xx/Xn message from the first RAN; identifying specific strings in the initial Xx/Xn message; matching the identified specific strings in a database of stored scripts; and performing a transformation on the initial Xx/Xn message, the transformation being retrieved from the database for stored scripts, the stored scripts being transformations.
Opening claim text (preview).
The invention claimed is: 1. A non-transitory computer-readable medium for Xx/Xn interface communication containing instructions that, when executed by a telecommunications system, cause the telecommunications system to perform steps, the steps comprising: at an Xx/Xn gateway for communicating with, and coupled to, a first and a second radio access network (RAN), receiving messages from the first RAN according to a first Xx/Xn protocol and mapping the received messages to a second Xx/Xn protocol for transmission to the second RAN, wherein at least one of the first RAN and the second RAN comprise a 5G RAN; maintaining operational state of at least one of the first RAN or the second RAN at the Xx/Xn gateway; executing, at an interpreter at the Xx/Xn gateway, an executable payload received as part of the received messages; updating the maintained operational state of the first RAN or the second RAN at the Xx/Xn gateway based on an effect of the executable payload; and interworking, at the Xx/Xn gateway, the first Xx/Xn message from the first Xx/Xn protocol to the second Xx/Xn protocol and associating the first Xx/Xn protocol with the first RAN and the second Xx/Xn protocol with the second RAN, based on a list of supported Xx/Xn protocol versions for the first RAN and the second RAN, wherein at least one of the supported Xx/Xn protocol versions is a list of supported individual information elements (IEs) and protocol commands, or an Xx/Xn protocol version number. 2. The non-transitory computer-readable medium of claim 1 , the steps further comprising storing a plurality of rules in a database for performing mapping. 3. The non-transitory computer-readable medium of claim 1 , the steps further comprising, at a regular expression pattern matcher at the Xx/Xn gateway, identifying patterns in the received messages that are present in the first Xx/Xn protocol but not present in the second Xx/Xn protocol. 4. The non-transitory computer-readable medium of claim 1 , the steps further comprising sending a second Xx/Xn message to update an eNodeB state machine at the first RAN. 5. The non-transitory computer-readable medium of claim 1 , the steps further comprising updating a gNodeB state machine at the Xx/Xn gateway based on the effect of the executed executable payload. 6. The non-transitory computer-readable medium of claim 1 , the steps further comprising sending a filtered second Xx/Xn message to the second RAN. 7. The non-transitory computer-readable medium of claim 1 , the steps further comprising providing code execution hooks for enabling the received messages according to the first Xx/Xn protocol to cause code execution at the Xx/Xn gateway. 8. The non-transitory computer-readable medium of claim 1 , the steps further comprising providing code execution hooks for enabling code execution at the Xx/Xn gateway of the executable payload received via the received messages. 9. The non-transitory computer-readable medium of claim 1 , the steps further comprising enabling new Xx/Xn protocol features via the executable code payload sent in an information element from the Xx/Xn gateway. 10. The non-transitory computer-readable medium of claim 1 , the steps further comprising blocking transmission of executable code payloads from the Xx/Xn gateway to an incompatible RAN. 11. The non-transitory computer-readable medium of claim 1 , the steps further comprising mapping a first unitless threshold value compatible with the first RAN to a second unitless threshold value compatible with the second RAN. 12. The non-transitory computer-readable medium of claim 1 , the steps further comprising adding, deleting, or modifying information elements in the messages from the first RAN but not compatible with the second RAN to information elements compatible with the second RAN. 13. The non-transitory computer-readable medium of claim 1 , the steps further comprising storing a plurality of rules in a database for performing mapping, the plurality of rules further comprising regular expression transformations of the received messages. 14. The non-transitory computer-readable medium of claim 1 , the steps further comprising storing a plurality of rules in a database for performing mapping, the plurality of rules further comprising rules for interpretation by a scripting language message processor at the gateway server. 15. The non-transitory computer-readable medium of claim 1 , the steps further comprising storing a plurality of rules in a database for performing mapping, the plurality of rules further comprising rules for interpretation by a scripting language message processor at the first RAN or the second RAN. 16. The non-transitory computer-readable medium of claim 1 , the steps further comprising processing messages in Lua, Python, Ruby, Perl, or JavaScript. 17. The non-transitory computer-readable medium of claim 1 , the steps further comprising handling Xx/Xn mobility management, load management, general error, Xx/Xn reset, Xx/Xn setup, Xx/Xn release, Xx/Xn removal, configuration update, mobility parameter management, mobility robustness optimization, or energy consumption management messages. 18. The non-transitory computer-readable medium of claim 1 , the steps further comprising handling adjustment of inter-radio access technology (inter-RAT) or intra-radio access technology (intra-RAT) mobility thresholds. 19. The non-transitory computer-readable medium of claim 1 , the steps further comprising: receiving and decoding an initial Xx/Xn message from the first RAN; identifying specific strings in the initial Xx/Xn message; matching the identified specific strings in a database of stored scripts; and performing a transformation on the initial Xx/Xn message, the transformation being retrieved from the database for stored scripts, the stored scripts being transformations. 20. A telecommunications system for Xx/Xn interface communication, comprising: an Xx/Xn gateway for communicating with, and coupled to, a first radio access network (RAN) and a second RAN, wherein at least one of the first RAN and the second RAN comprise a 5G RAN, the Xx/Xn gateway further comprising an interpreter, wherein the Xx/Xn gateway is configured to: receive messages from the first RAN according to a first Xx/Xn protocol; map the received messages to a second Xx/Xn protocol for transmission to the second RAN; maintain operational state of at least one of the first RAN or the second RAN at the Xx/Xn gateway; update the maintained operational state of the first RAN or the second RAN at the Xx/Xn gateway; interwork, at the Xx/Xn gateway, the first Xx/Xn message from the first Xx/Xn protocol to the second Xx/Xn protocol; and associate the first Xx/Xn protocol with the first RAN and the second Xx/Xn protocol with the second RAN, based on a stored list of supported Xx/Xn protocol versions for the first RAN and the second RAN, wherein at least one of the supported Xx/Xn protocol versions is a list of supported individual information elements (IEs) and protocol commands, or an Xx/Xn protocol version number. 21. The telecommunications system of claim 20 , wherein the Xx/Xn gateway is further configured to execute, at the interpreter at the Xx/Xn gateway, an executable payload received as part of the received messages; and to update the maintained operational state of the first RAN or the second RAN at the Xx/Xn gateway based on an effect of the executable payload.
in the physical layer [OSI layer 1] · CPC title
Interlayer communication protocols or service data unit [SDU] definitions; Interfaces between layers · CPC title
Multiprotocol handlers, e.g. single devices capable of handling multiple protocols · CPC title
of control information between different access points · CPC title
using different RATs · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.