Access resource recovery method and device, equipment, storage medium and program product

Abstract

Provided in an embodiment of the present invention are an access resource recovery method, apparatus and device, a storage medium and a program product, applied to a base station, the method comprising: acquiring a non-competitive random access resource, and storing the non-competitive random access resource in a dispute-free queue; when it is detected that the terminal triggers non-competitive random access and the non-dispute queue is non-empty, non-competitive random access resources are obtained from the non-dispute queue so that the terminal can initiate random access according to the non-competitive random access resources; under the condition that the random access of the terminal fails, releasing the non-competitive random access resource; and storing the released non-competitive random access resources to the tail of the dispute queue. Therefore, the conflict retention time can be solved for the base station, so that the use conflict of non-competitive random access resources is solved, and the access performance of the terminal is improved.

Description

Technical Field

[0001] This invention belongs to the field of wireless communication technology, and particularly relates to a method, apparatus, device, storage medium, and program product for access resource recycling. Background Technology

[0002] Within the 3rd Generation Partnership Project (3GPP) technical framework, terminal random access can be achieved through two methods: contention-based random access and non-contention-based random access. Non-contention-based random access refers to the base station pre-allocating a preamble to the terminal, which then acquires non-contention-based access resources. When the base station detects that the terminal has triggered non-contention-based access, it sends the preamble and its corresponding time-frequency resources to the terminal. The terminal then sends a random access request containing the preamble on those time-frequency resources. After determining the terminal's access time, the base station sends a response message at that time, thus completing the terminal's random access.

[0003] However, in the event of successful random access, the base station can promptly release non-contentionable resources. In the event of a failed random access, the terminal needs to re-receive resources allocated by the base station and re-initiate random access. During this process, the base station releases non-contentionable resources, leading to a conflict between the terminal and the base station, thus reducing the terminal's access performance. Summary of the Invention

[0004] This invention provides a method, apparatus, device, storage medium, and program product for access resource reclamation, which can resolve conflict retention time for base stations, thereby resolving the conflict in the use of non-contention random access resources and improving terminal access performance.

[0005] In a first aspect, embodiments of the present invention provide a method for access resource reclamation, applied to a base station, the method comprising: Obtain non-contention-based random access resources and store them in the uncontested queue; If a terminal triggers a non-contention-based random access and the uncontested queue is not empty, the non-contention-based random access resource is obtained from the uncontested queue for the terminal to initiate random access based on the non-contention-based random access resource. In the event that the terminal fails to access the random access system, the non-contention-based random access resource is released. The released non-contested random access resources are stored at the tail of the dispute queue.

[0006] In one possible implementation, obtaining the non-contention-free random access resource from the uncontested queue includes: The first uncontested resource in the uncontested queue is used as the non-contention-based random access resource. Delete the first undisputed resource in the undisputed queue.

[0007] One possible implementation also includes: If the uncontested queue is empty, the non-contentionable random access resource is obtained from the contested queue.

[0008] In one possible implementation, obtaining the non-contention-based random access resource from the dispute queue includes: The first disputed resource in the dispute queue is used as the non-contention-based random access resource; Delete the first disputed resource in the dispute queue.

[0009] In one possible implementation, releasing the non-contention-based random access resource in the event of a terminal random access failure includes: If no random access request is received from the terminal within a preset timer duration, the random access of the terminal is determined to have failed. Release the non-contentionable random access resources.

[0010] One possible implementation also includes: If the random access request is received within the preset timer duration, the non-contentionable random access resource is released; The non-contention-based random access resources are stored at the tail of the uncontested queue.

[0011] In one possible implementation, before obtaining the non-contention-free random access resource from the uncontested queue, the method further includes: Receive data messages sent by the terminal; The business scenario of the terminal is determined based on the data message; When the business scenario is a preset business scenario, the non-contention random access resource is obtained from the uncontested queue.

[0012] Secondly, embodiments of this application provide an access resource reclamation device, the device comprising: The acquisition module is used to acquire non-contention-based random access resources and store them in the uncontested queue. The acquisition module is further configured to acquire the non-contention random access resource from the uncontested queue when it is detected that the terminal triggers non-contention random access and the uncontested queue is not empty, so that the terminal can initiate random access based on the non-contention random access resource; A release module is used to release the non-contentionable random access resources in the event that the terminal fails to access the random access system. The storage module is used to store released non-contentionable random access resources at the tail of the dispute queue.

[0013] Thirdly, embodiments of the present invention provide a target detection device, the device comprising: a processor, and a memory storing computer program instructions; the processor reads and executes the computer program instructions to implement the access resource reclamation method as described in the first aspect.

[0014] Fourthly, embodiments of the present invention provide a computer-readable storage medium storing computer program instructions, which, when executed by a processor, implement the access resource reclamation method as described in the first aspect.

[0015] Fifthly, embodiments of the present invention provide a computer program product, including a computer program that, when executed by a processor, implements the access resource reclamation method as described in the first aspect.

[0016] This invention discloses a method, apparatus, device, medium, and program product for reclaiming access resources. When a base station detects that a terminal has triggered a non-contention-based random access request and the undisputed queue is not empty, it allocates non-contention-based random access resources to the terminal, allowing the terminal to initiate random access using these resources. If the terminal's random access fails, the non-contention-based random access resources are released and stored at the tail of the dispute queue. In this way, by caching disputed non-contention-based random access resources through the dispute queue, the base station has time to resolve conflicts, thereby resolving conflicts in the use of non-contention-based random access resources and improving terminal access performance. Attached Figure Description

[0017] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the embodiments of the present invention will be briefly introduced below. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0018] Figure 1 This is a flowchart illustrating a method for resource reclamation provided in an embodiment of the present invention; Figure 2 This is a flowchart illustrating a method for accessing resource storage provided in an embodiment of the present invention; Figure 3 This is an exemplary schematic diagram of a method for access resource reclamation provided in an embodiment of the present invention; Figure 4This is an exemplary schematic diagram of an access resource allocation method provided in an embodiment of the present invention; Figure 5 This is an exemplary schematic diagram of another access resource reclamation method provided in an embodiment of the present invention; Figure 6 This is a schematic diagram of the structure of a device for access resource recycling provided in an embodiment of the present invention; Figure 7 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present invention. Detailed Implementation

[0019] The features and exemplary embodiments of various aspects of the present invention will now be described in detail. To make the objectives, technical solutions, and advantages of the present invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are merely intended to explain the present invention and not to limit the present invention. For those skilled in the art, the present invention can be practiced without some of these specific details. The following description of the embodiments is merely to provide a better understanding of the present invention by illustrating examples of the invention.

[0020] It should be noted that, in this document, relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising..." does not exclude the presence of additional identical elements in the process, method, article, or apparatus that includes said element.

[0021] It should be noted that the acquisition, storage, use, and processing of data in this application embodiment all comply with the relevant provisions of national laws and regulations.

[0022] It should be noted that in the embodiments of this application, certain software, components, models and other existing solutions in the industry may be mentioned. These should be regarded as exemplary and are only intended to illustrate the feasibility of implementing the technical solution of this application. However, it does not mean that the applicant has used or necessarily used the solution.

[0023] To address the problems of existing technologies, embodiments of the present invention provide a method, apparatus, device, medium, and program product for access resource recycling.

[0024] The method for reclaiming access resources provided in this embodiment of the invention will be described below.

[0025] Figure 1 A flowchart illustrating a method for determining service response information according to an embodiment of the present invention is shown. This method is applied to a base station, such as... Figure 1 As shown, the method includes S101-S105: S101. Obtain non-contention-based random access resources and store them in the uncontested queue.

[0026] Among them, non-contention-based random access resources are the preambles for non-contention-based random access.

[0027] Specifically, the physical random access channel consists of 64 preambles. Contention-based random access, non-contention-based random access, and random access for other system purposes all share these 64 preambles. Random access for other system purposes and contention-based random access use more preambles, while non-contention-based random access uses fewer preambles.

[0028] After the base station allocates non-contention random access resources to the terminal, the terminal sends a random access request to the base station based on the received non-contention random access resources and the corresponding time-frequency resources. The base station then completes the terminal's random access based on the non-contention random access resources in the random access request.

[0029] S102. If it is detected that the terminal has triggered non-contention random access and the uncontested queue is not empty, obtain non-contention random access resources from the uncontested queue for the terminal to initiate random access based on the non-contention random access resources.

[0030] Non-contention random access scenarios are typically those with high requirements for communication latency, such as cell handover scenarios for terminals, which can trigger non-contention random access.

[0031] S103. In the event of a terminal's random access failure, release the non-contentionable random access resources.

[0032] S104. Store the released non-contentionable random access resources at the tail of the dispute queue.

[0033] Understandably, if a terminal fails to access the system randomly, it may use the same non-contention-based random access resource to access the system again. Therefore, the base station can determine that the non-contention-based random access resource is disputed and store it at the end of the dispute queue.

[0034] The order of non-contentionable random access resources in the dispute queue is determined by the magnitude of the dispute, which is based on the time the resource has been stored in the queue. Specifically, the dispute level decreases as the storage time of a non-contentionable random access resource in the queue increases. The most recently added non-contentionable random access resource has the highest dispute level, and since the resource at the tail of the queue has the longest storage time, it is placed at the tail of the queue.

[0035] Using the method provided in this application, when the base station detects that a terminal has triggered a non-contention-based random access and the uncontested queue is not empty, it allocates non-contention-based random access resources to the terminal, thereby enabling the terminal to initiate random access using these resources. If the terminal's random access fails, the non-contention-based random access resources are released and stored at the tail of the contested queue. In this way, by caching contested non-contention-based random access resources through the contested queue, the base station has time to resolve conflicts, thus resolving conflicts in the use of non-contention-based random access resources and improving terminal access performance.

[0036] Regarding S102 above, when a terminal triggers non-contention-based random access and the uncontested queue is not empty, non-contention-based random access resources are obtained from the uncontested queue. This can be specifically implemented as follows: The first uncontested resource in the uncontested queue is used as a non-contentionable random access resource; the first uncontested resource in the uncontested queue is deleted.

[0037] After allocating a non-contentionable random access resource, the base station removes it from the stored queue. This prevents the resource from being reallocated in subsequent allocation processes, thus avoiding potential usage conflicts.

[0038] The method provided in this application embodiment uses the first uncontested resource in the uncontested queue as a non-contentionable random access resource. This allows resource allocation to proceed according to the order of uncontested resources in the uncontested queue, thus ensuring the rationality of resource allocation.

[0039] In some embodiments of this application, non-contention-based random access resources are obtained from the contention queue when the uncontested queue is empty.

[0040] The dispute queue also stores non-contention-based random access resources. These resources are determined based on historical usage records of the last failed random access attempt. Thus, when the non-contention queue is empty, non-contention-based random access resources are allocated to the terminal from the dispute queue, ensuring the terminal can successfully initiate random access.

[0041] Specifically, in the process of obtaining non-contention random access resources from the dispute queue, the base station uses the first disputed resource in the dispute queue as the non-contention random access resource; then it deletes the first disputed resource in the dispute queue.

[0042] After allocating a non-contentionable random access resource, the base station removes the resource from its stored queue. This prevents conflicts from arising during subsequent allocations of the resource.

[0043] The method provided in this application embodiment uses the first disputed resource in the dispute queue as a non-contentionable random access resource. This allows resource allocation to be performed according to the order of disputed resources in the dispute queue, thus ensuring the rationality of resource allocation.

[0044] In some embodiments of this application, the above-described method for reclaiming access resources further includes: Step 1: If no random access request is received from the terminal within the preset timer duration, determine that the terminal's random access has failed; release the non-contentionable random access resources.

[0045] The preset timer duration is set in advance according to actual business needs.

[0046] Furthermore, upon receiving a random access request, the base station can also verify the preamble in the request. If the verification fails, the base station determines that the terminal's random access has failed. Alternatively, after receiving the random access request, the base station can send a response message to the terminal, prompting the terminal to send a third message (Message 3, Msg3) to the base station. If the base station fails to decode Msg3, the base station determines that the terminal's random access has failed.

[0047] Understandably, if no random access request is received from the terminal within the preset timer duration, it indicates that the terminal's random access has failed. In the event of a random access failure, the non-contentionable random access resource is released and stored at the tail of the dispute queue. In this way, by caching disputed non-contentionable random access resources through the dispute queue, time is provided for the base station to resolve conflicts, thereby resolving the conflict in the use of non-contentionable random access resources and improving terminal access performance.

[0048] Step 2: If a random access request is received within the preset timer duration, release the non-contentionable random access resources.

[0049] If a random access request is received within the preset timer duration, it indicates that the terminal has successfully completed the random access. Therefore, the non-contention random access resource completes the random access task, and the base station stores the non-contention random access resource in the uncontested queue.

[0050] Step 3: Store the non-contention-based random access resources at the tail of the uncontested queue.

[0051] Thus, if a random access request is received within the preset timer duration, it indicates that the terminal has successfully completed random access. Therefore, the non-contention-based random access resource completes this random access task. The base station then re-stores the non-contention-based random access resource in the uncontested queue for subsequent random access resource allocation.

[0052] In some embodiments of this application, after S104, where the released non-contentionable random access resource is stored at the tail of the dispute queue, the method further includes S201-S203, such as... Figure 2 As shown: S201, Receive data messages sent by the terminal.

[0053] S202. Determine the terminal's business scenario based on the data message.

[0054] The data messages sent by the terminal differ depending on the specific service scenario. In this embodiment, the non-contention-based random access scenario could be a cell handover, connection restoration, or beam failure recovery for the terminal. For the cell handover scenario, the data message could be a measurement report sent by the terminal. For the connection restoration scenario, the data message could be a message triggering downlink data notification in the core network. For the beam failure recovery scenario, the data message could be a connection establishment request sent by the terminal.

[0055] S203. When the business scenario is a preset business scenario, obtain non-contention random access resources from the uncontested queue.

[0056] The preset business scenario is a scenario that triggers non-contention-based random access.

[0057] It should be noted that non-contention-based random access scenarios refer to scenarios that are latency-sensitive, require high reliability, or require seamless connection. The specific scenarios can be pre-configured based on experience and actual business needs.

[0058] Using the method provided in this application embodiment, the base station detects the storage duration of each non-contention-based random access resource in real time and determines the relationship between the storage duration and the preset duration. If the storage duration is greater than or equal to the preset duration, the base station has resolved the dispute. Therefore, the base station transfers the non-contention-based random access resource to the undisputed queue. This provides time for the base station to resolve conflicts, thereby resolving the conflict in the use of non-contention-based random access resources and improving terminal access performance.

[0059] The methods for reclaiming the aforementioned access resources specifically include, for example: Figure 3 The three steps shown: S301. Obtain the total number of non-contested preamble resources and store the obtained preamble resources into the uncontested queue.

[0060] The total number of non-contention preamble resources is the same as the non-contention random access resources in the above embodiments.

[0061] S302. Allocate non-contested preamble resources.

[0062] S303. Reclaim non-contested preamble resources.

[0063] Specifically, regarding S302, the allocation of non-contention preamble resources can be implemented as S3021-S3026, such as... Figure 4 As shown: S3021, Non-contention-based random access scenario triggered.

[0064] Non-contention random access scenarios are typically those with high requirements for communication latency, such as cell handover scenarios for terminals, which can trigger non-contention random access.

[0065] S3022. Determine if the uncontroversial queue is empty.

[0066] If yes, then execute S3024; otherwise, execute S3023.

[0067] S3023. Allocate non-contested preamble resources from the head of the uncontested queue.

[0068] S3024. Determine if the dispute queue is empty.

[0069] If yes, then execute S3025; otherwise, execute S3026.

[0070] S3025, Follow the competitive process.

[0071] In the case of an empty dispute queue, it means that there are no available non-contention-based random access resources on the base station side. Therefore, the terminal initiates random access through a contention mechanism.

[0072] S3026. Allocate non-contested preamble resources from the head of the dispute queue.

[0073] Regarding the aforementioned S303, non-contested preamble resources are reclaimed, such as... Figure 5 As shown, it can be specifically implemented as follows: S3031. Allocate non-contention preamble resources to the terminal.

[0074] S3032. Determine whether a random access request from the terminal has been received.

[0075] If yes, then execute S3033; otherwise, execute S3034.

[0076] S3033, Release the non-contested preamble resource and place it at the tail of the uncontested queue.

[0077] S3034. Determine if the timer has timed out.

[0078] If yes, then execute S3036; otherwise, execute S3035.

[0079] S3035, do not release resources.

[0080] S3036. Release the non-contested preamble resource and place it at the end of the dispute queue.

[0081] The method provided in this application allocates access resources to terminals using a non-contention-based random access resource allocation method. First, an uncontested queue is used to allocate access resources. If the uncontested queue is empty, a contested queue is used as a secondary allocation queue. Thus, by setting up a dual-queue system, contested and uncontested access resources are stored separately. Prioritizing the uncontested queue for resource allocation allows time for resolving disputes regarding resource usage in the contested queue, improving terminal access performance. Furthermore, a timer monitors whether the terminal initiates random access within a preset timer duration. If the terminal successfully accesses, the non-contention-based random access resource is reclaimed and stored in the uncontested queue. If the terminal fails to access, the non-contention-based random access resource is released, and it is determined that the resource is contested. To avoid conflicts, the resource is stored at the tail of the contested queue, allowing time for its reallocation, thereby preventing disputes and improving terminal access performance.

[0082] Based on the same concept, embodiments of this application provide an access resource recycling device, such as... Figure 6 As shown, the device includes: The acquisition module 601 is used to acquire non-contention-based random access resources and store them in the uncontested queue. The acquisition module 601 is further configured to acquire the non-contention random access resource from the uncontested queue when it is detected that the terminal triggers non-contention random access and the uncontested queue is not empty, so that the terminal can initiate random access based on the non-contention random access resource; Release module 602 is used to release the non-contention random access resource in the event of terminal random access failure; Storage module 603 is used to store released non-contentionable random access resources to the tail of the dispute queue.

[0083] In one possible implementation, the acquisition module 601 is specifically used for: The first uncontested resource in the uncontested queue is used as the non-contention-based random access resource. Delete the first undisputed resource in the undisputed queue.

[0084] In one possible implementation, the acquisition module 601 is further configured to: If the uncontested queue is empty, the non-contentionable random access resource is obtained from the contested queue.

[0085] In one possible implementation, the acquisition module 601 is specifically used for: The first disputed resource in the dispute queue is used as the non-contention-based random access resource; Delete the first disputed resource in the dispute queue.

[0086] In one possible implementation, the release module 602 is specifically used for: If no random access request is received from the terminal within a preset timer duration, the random access of the terminal is determined to have failed. Release the non-contentionable random access resources.

[0087] In one possible implementation, the release module 602 is further configured to release the non-contention-based random access resource when the random access request is received within the preset timer duration. Storage module 603 is used to store the non-contention random access resources at the tail of the uncontested queue.

[0088] In one possible implementation, after storing the non-contention-based random access resource at the tail of the dispute queue, the device further includes: The receiving module is used to receive data messages sent by the terminal; The judgment module is used to determine the business scenario of the terminal based on the data message; The acquisition module 601 is specifically used to acquire the non-contention random access resource from the uncontested queue when the business scenario is a preset business scenario.

[0089] Figure 7 A schematic diagram of the hardware structure of an electronic device provided in an embodiment of the present invention is shown.

[0090] An electronic device may include a processor 701 and a memory 702 storing computer program instructions.

[0091] Specifically, the processor 701 may include a central processing unit (CPU), an application specific integrated circuit (ASIC), or one or more integrated circuits that can be configured to implement the embodiments of the present invention.

[0092] Memory 702 may include mass storage for data or instructions. For example, and not limitingly, memory 702 may include a hard disk drive (HDD), floppy disk drive, flash memory, optical disk, magneto-optical disk, magnetic tape, or Universal Serial Bus (USB) drive, or a combination of two or more of these. In one instance, memory 702 may include removable or non-removable (or fixed) media, or memory 702 may be a non-volatile solid-state memory. Memory 702 may be internal or external to an electronic device.

[0093] In one instance, memory 702 may be read-only memory (ROM). In one instance, the ROM may be a mask-programmed ROM, a programmable ROM (PROM), an erasable PROM (EPROM), an electrically erasable PROM (EEPROM), an electrically rewritable ROM (EAROM), or flash memory, or a combination of two or more of these.

[0094] Memory 702 may include read-only memory (ROM), random access memory (RAM), disk storage media device, optical storage media device, flash memory device, electrical, optical, or other physical / tangible memory storage device. Therefore, generally, memory includes one or more tangible (non-transitory) computer-readable storage media (e.g., memory devices) encoded with software including computer-executable instructions, and when the software is executed (e.g., by one or more processors), it is operable to perform the operations described with reference to the method according to one aspect of this disclosure.

[0095] The processor 701 reads and executes computer program instructions stored in the memory 702 to achieve... Figure 1 The method for reclaiming access resources in the illustrated embodiment.

[0096] In one example, the electronic device may also include a communication interface 703 and a bus 704. For example, Figure 7 As shown, the processor 701, memory 702, and communication interface 703 are connected through bus 704 and complete communication with each other.

[0097] The communication interface 703 is mainly used to realize communication between various modules, devices, units and / or equipment in the embodiments of the present invention.

[0098] Bus 704 includes hardware, software, or both, that couples components of an electronic device together. For example, and not limitingly, the bus may include an Accelerated Graphics Port (AGP) or other graphics bus, an Extended Industry Standard Architecture (EISA) bus, a Front Side Bus (FSB), a Hyper Transport (HT) interconnect, an Industry Standard Architecture (ISA) bus, an Infinite Bandwidth Interconnect, a Low Pin Count (LPC) bus, a memory bus, a Microchannel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCI-X) bus, a Serial Advanced Technology Attachment (SATA) bus, a Video Electronics Standards Association Local (VLB) bus, or other suitable buses, or combinations of two or more of these. Where appropriate, bus 704 may include one or more buses. While specific buses are described and illustrated in embodiments of the invention, the invention contemplates any suitable bus or interconnect.

[0099] Furthermore, in conjunction with the access resource reclamation methods in the above embodiments, this invention can be implemented using a computer storage medium. This computer storage medium stores computer program instructions; when these computer program instructions are executed by a processor, they implement any of the access resource reclamation methods in the above embodiments.

[0100] This application also provides a computer program product, including a computer program that, when executed by a processor, implements any of the access resource reclamation methods described in the above embodiments.

[0101] It should be clarified that the present invention is not limited to the specific configurations and processes described above and shown in the figures. For the sake of brevity, detailed descriptions of known methods are omitted here. In the above embodiments, several specific steps are described and shown as examples. However, the method process of the present invention is not limited to the specific steps described and shown. Those skilled in the art can make various changes, modifications, and additions, or change the order of steps, after understanding the spirit of the present invention.

[0102] The functional blocks shown in the above-described structural diagram can be implemented as hardware, software, firmware, or a combination thereof. When implemented in hardware, they can be, for example, electronic circuits, application-specific integrated circuits (ASICs), appropriate firmware, plug-ins, function cards, etc. When implemented in software, the elements of this invention are programs or code segments used to perform the required tasks. Programs or code segments can be stored on a machine-readable medium or transmitted over a transmission medium or communication link via data signals carried in a carrier wave. "Machine-readable medium" can include any medium capable of storing or transmitting information. Examples of machine-readable media include electronic circuits, semiconductor memory devices, read-only memory (ROM), flash memory, erasable read-only memory (EROM), floppy disks, compact disc read-only memory (CD-ROM), optical disks, hard disks, fiber optic media, radio frequency (RF) links, etc. Code segments can be downloaded via computer networks such as the Internet, intranets, etc.

[0103] It should also be noted that the exemplary embodiments mentioned in this invention describe methods or systems based on a series of steps or apparatus. However, this invention is not limited to the order of the steps described above; that is, the steps can be performed in the order mentioned in the embodiments, or in a different order, or several steps can be performed simultaneously.

[0104] The aspects of this disclosure have been described above with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this disclosure. It should be understood that each block in the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus to produce a machine such that these instructions, executable via the processor of the computer or other programmable data processing apparatus, enable the implementation of the functions / actions specified in one or more blocks of the flowchart illustrations and / or block diagrams. Such a processor can be, but is not limited to, a general-purpose processor, a special-purpose processor, a special application processor, or a field-programmable logic circuit. It is also understood that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can also be implemented by special-purpose hardware performing the specified functions or actions, or can be implemented by a combination of special-purpose hardware and computer instructions.

[0105] The above description is merely a specific embodiment of the present invention. Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working processes of the systems, modules, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here. It should be understood that the protection scope of the present invention is not limited thereto. Any person skilled in the art can easily conceive of various equivalent modifications or substitutions within the technical scope disclosed in the present invention, and these modifications or substitutions should all be covered within the protection scope of the present invention.

Claims

1. A method for access resource reclamation, characterized in that, Applied to a base station, the method includes: Obtain non-contention-based random access resources and store them in the uncontested queue; If a terminal triggers a non-contention-based random access and the uncontested queue is not empty, the non-contention-based random access resource is obtained from the uncontested queue for the terminal to initiate random access based on the non-contention-based random access resource. In the event that the terminal fails to access the random access system, the non-contention-based random access resource is released. The released non-contested random access resources are stored at the tail of the dispute queue.

2. The method according to claim 1, characterized in that, The step of obtaining the non-contention-free random access resource from the uncontested queue includes: The first uncontested resource in the uncontested queue is used as the non-contention-based random access resource. Delete the first undisputed resource in the undisputed queue.

3. The method according to claim 1, characterized in that, Also includes: If the uncontested queue is empty, the non-contentionable random access resource is obtained from the contested queue.

4. The method according to claim 3, characterized in that, The step of obtaining the non-contention-based random access resource from the dispute queue includes: The first disputed resource in the dispute queue is used as the non-contention-based random access resource; Delete the first disputed resource in the dispute queue.

5. The method according to claim 1, characterized in that, In the event of a terminal's random access failure, releasing the non-contentionable random access resource includes: If no random access request is received from the terminal within a preset timer duration, the random access of the terminal is determined to have failed. Release the non-contentionable random access resources.

6. The method according to claim 5, characterized in that, Also includes: If the random access request is received within the preset timer duration, the non-contentionable random access resource is released; The non-contention-based random access resources are stored at the tail of the uncontested queue.

7. The method according to claim 1, characterized in that, Prior to obtaining the non-contention-free random access resource from the uncontested queue, the method further includes: Receive data messages sent by the terminal; The business scenario of the terminal is determined based on the data message; When the business scenario is a preset business scenario, the non-contention random access resource is obtained from the uncontested queue.

8. A device for accessing resource recycling, characterized in that, The device includes: The acquisition module is used to acquire non-contention-based random access resources and store them in the uncontested queue. The acquisition module is further configured to acquire the non-contention random access resource from the uncontested queue when it is detected that the terminal triggers non-contention random access and the uncontested queue is not empty, so that the terminal can initiate random access based on the non-contention random access resource; A release module is used to release the non-contentionable random access resources in the event that the terminal fails to access the random access system. The storage module is used to store released non-contentionable random access resources at the tail of the dispute queue.

9. A device for accessing resource recycling, characterized in that, The device includes: a processor and a memory storing computer program instructions; the processor reads and executes the computer program instructions to implement the access resource reclamation method as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer program instructions that, when executed by a processor, implement the access resource reclamation method as described in any one of claims 1 to 7.

11. A computer program product, characterized in that, Includes a computer program that, when executed by a processor, implements the access resource reclamation method as described in any one of claims 1 to 7.

Images