WO2024016801A1 - 基站算力编排方法、装置、电子设备及存储介质 - Google Patents

基站算力编排方法、装置、电子设备及存储介质 Download PDF

Info

Publication number
WO2024016801A1
WO2024016801A1 PCT/CN2023/094066 CN2023094066W WO2024016801A1 WO 2024016801 A1 WO2024016801 A1 WO 2024016801A1 CN 2023094066 W CN2023094066 W CN 2023094066W WO 2024016801 A1 WO2024016801 A1 WO 2024016801A1
Authority
WO
WIPO (PCT)
Prior art keywords
base station
idle
computing power
information
target base
Prior art date
Application number
PCT/CN2023/094066
Other languages
English (en)
French (fr)
Inventor
程文远
廖俊锋
李攀
刘林松
王亚彬
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2024016801A1 publication Critical patent/WO2024016801A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H04W28/09—Management thereof
    • H04W28/0958—Management thereof based on metrics or performance parameters
    • H04W28/0967—Quality of Service [QoS] parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/02—Arrangements for optimising operational condition
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/08—Load balancing or load distribution
    • H04W28/084—Load balancing or load distribution among network function virtualisation [NFV] entities; among edge computing entities, e.g. multi-access edge computing
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present application relates to the field of network communication technology, and in particular to a base station computing power arrangement method, device, electronic equipment and storage medium.
  • the scale of wireless communication base stations has become larger and larger.
  • the base station network element equipment itself is closed and heterogeneous. This network structure will cause a waste of computing resources. If the wireless communication network is considered as a whole, the computing power resources of the entire network are sufficient. However, since the computing power itself exists independently on the network element device, it may happen that the remaining computing power resources of a single network element device cannot meet the computing power needs of individual busy network element devices when the overall computing power resources are sufficient.
  • Embodiments of the present application provide a base station computing power arrangement method, device, electronic equipment and storage medium.
  • embodiments of the present application provide a base station computing power arrangement method, which is applied to a base station.
  • the method includes: obtaining the idle computing power information of the base station and the computing power demand information of the target base station; according to the idle computing power Information, generate an idle base station group; obtain idle base stations in the idle base station group that meet the computing power requirement information; match the idle base station with the target base station, and share the computing power resources of the idle base station to all Describe the target base station.
  • a base station computing power orchestration device including: an acquisition module configured to obtain idle computing power information of the base station and computing power demand information of the target base station; a generating module configured to obtain the computing power demand information of the base station according to the Idle computing power information is used to generate an idle base station group; a search module is configured to obtain idle base stations in the idle base station group that meet the computing power requirement information; a sharing module is configured to match the idle base station and the target base station , and share the computing power resources of the idle base station to the target base station.
  • embodiments of the present application provide an electronic device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the present application is implemented.
  • embodiments of the present application provide a computer-readable storage medium that stores a computer program.
  • the computer program is executed by a processor, the base station computing power arrangement method provided by the embodiment of the present application is implemented.
  • Figure 1 is a schematic flow chart of a base station computing power arrangement method provided by an embodiment of the present application
  • FIG. 2 is a schematic diagram of the specific implementation process of another embodiment of step S1000 in Figure 1;
  • FIG. 3 is a schematic diagram of the specific implementation process of another embodiment of step S2000 in Figure 1;
  • FIG. 4 is a schematic diagram of the specific implementation process of another embodiment of step S3000 in Figure 1;
  • FIG. 5 is a schematic diagram of the specific implementation process of another embodiment of step S4000 in Figure 1;
  • Figure 6 is a structural diagram of a base station computing power orchestration device provided by an embodiment of the present application.
  • FIG. 7 is a schematic structural diagram of an electronic device provided by an embodiment of the present application.
  • At least one of the following and similar expressions refers to any combination of these items, including any combination of single or plural items.
  • at least one of a, b and c can mean: a, b, c, a and b, a and c, b and c or a and b and c, where a, b, c can be single, also Can be multiple.
  • the base station computing power orchestration method involved in the embodiment of this application is based on the IP technology of wireless networks.
  • Wireless network sites communicate based on network virtualization technology under the cloud network, and the wireless network is constructed as a wireless network that can be based on business needs.
  • a computing power network that allocates and flexibly schedules computing resources, storage resources, and network resources among clouds, networks, and edges on demand.
  • the computing power network can combine new network technologies to deeply integrate base station network elements, edge computing nodes, cloud computing nodes, and various network resources including wide area networks, reducing the management and control complexity of edge computing nodes, and through centralization
  • the control or distributed scheduling method collaborates with the computing and storage resources of cloud computing nodes and the network resources of the wide area network to form a new generation of information infrastructure, providing overall computing services including computing, storage and connection for wireless communications, and based on the base station business Features provide flexible, schedulable on-demand services.
  • the existing base station computing power arrangement method is: using a technology that is relatively close to the computing power network, that is, base station clustering technology, to combine the base stations in some way to form a super base station .
  • the technology to open up channels between base stations uses optical port transmission between sites as a carrier.
  • the size of the pool is limited; and it is a static network.
  • the network scale needs to be determined during network planning, and the flexibility is poor; in addition, the protocol between sites is a private protocol, so in Under these constraints, cluster technology has not been well applied in base station networking.
  • embodiments of the present application provide a base station computing power orchestration method, device, system and computer-readable storage medium to obtain the idle computing power information of the base station and the computing power demand information of the target base station; and generate idle computing power based on the idle computing power information.
  • Base station group obtain idle base stations in the idle base station group that meet the computing power requirements; match idle base stations and target base stations, and share the computing power resources of the idle base stations to the target base station, improving the utilization of base station computing power resources and ensuring wireless Network communication quality and user experience.
  • Figure 1 shows the flow of a base station computing power arrangement method provided by an embodiment of the present application.
  • the base station computing power arrangement method according to the embodiment of the present application includes the following steps:
  • S1000 Obtain the idle computing power information of the base station and the computing power demand information of the target base station.
  • base station network elements are connected to the core network through links, and information is transmitted through the network management server.
  • a central unit Centralized Unit, CU
  • a distributed unit Distributed Unit, DU
  • UAE Unified Management of Network Element
  • the idle computing power information of the base station is a numerical representation of the remaining performance value of the base station after subtracting the performance value occupied by the current service from the total performance value of the base station when the base station is running the local terminal and the current service.
  • the base station with idle computing power information is an idle base station.
  • the computing power demand information of the target base station is that when the base station is running its own end and the current business, because the idle computing power of the base station cannot meet the business needs, resulting in the normal processing and forwarding of the business, the base station sends out the computing power. capacity needs to meet current business needs.
  • the base station that sends the computing power demand information is the target base station.
  • step S1000 at least includes the following steps:
  • the idle computing power information of each base station includes at least one of the following: idle transmission coefficient, number of idle network segments or idle performance parameters.
  • the idle computing power information needs to comprehensively characterize the service processing performance of the idle base station.
  • the idle computing power information includes the idle transmission coefficient and the number of idle network segments.
  • the idle transmission coefficient can be characterized by the Quality of Service (QoS) coefficient.
  • QoS means that the transport network can use various basic technologies to provide better service capabilities for designated network communications. It is a security mechanism of the network and a technology used to solve problems such as network delay and congestion. QoS guarantee can effectively meet the needs of fixed transmission rate and delay-sensitive services in networks with limited capacity.
  • QoS is a qualitative agreement on information transmission and sharing between the network and users and between users communicating with each other on the network. Its key indicators mainly include: availability, throughput, delay, delay change (including jitter and drift) and packet loss. It can be understood that how to obtain and send QoS coefficients between wireless base station links is well known and will not be described again here.
  • the number of idle network segments also reflects the computing power of idle base stations in wireless networks. For example, the greater the number of idle network segments, it means that the idle base station can transmit services to a wider IP network segment.
  • network segments In the process of base station business processing, network segments often need to be restricted and standardized to ensure the smoothness of business processing. stability. Therefore, the number of idle network segments needs to be controlled within a certain range to meet the computing power requirements of the target base station.
  • the idle performance parameters include the following At least one: CPU usage, GPU usage, memory usage, or hard disk usage.
  • CPU usage when performing services with low latency requirements, if the CPU occupancy rate of an idle base station is too high, it will affect the performance and processing speed of the idle base station. Therefore, the idle base station whose idle performance parameters do not meet the standard needs to be replaced. Filter out.
  • S1200 Obtain computing power demand information of the target base station, where the computing power demand information includes at least one of the following: demand transmission coefficient, demand network segment number, or demand performance parameters.
  • the computing power demand information needs to comprehensively characterize the service processing performance required by the target base station.
  • the computing power demand information includes the required transmission coefficient and the required number of network segments. Consistent with the idle transmission coefficient in the above step S1100, the demand transmission coefficient is also characterized by the QoS coefficient to facilitate comparison between the idle transmission coefficient and the demand transmission coefficient.
  • the number of required network segments can reflect the network segment coverage of the computing power required by the target base station. For example, the smaller the number of required network segments, it means that the service requested by the target base station needs to be transmitted to a specific IP network segment. At this time, the number of idle network segments needs to be controlled within a specific IP network segment to meet the computing power requirements of the target base station. Otherwise, the broadcast of business information and the leakage of important information will occur.
  • the required performance parameters also include at least one of the following: CPU occupancy, GPU occupancy, memory occupancy or hard disk occupancy. Rate.
  • S2000 Generate idle base station groups based on idle computing power information.
  • the system can generate a group including all idle base stations to facilitate matching and calling of the target base station. Similar to the computing power pool in the computing power network, unified integration and scheduling of discrete idle base stations in the wireless network can effectively improve the calling efficiency and utilization of the computing power resources of the idle base stations.
  • step S2000 at least includes the following steps:
  • S2100 Obtain idle base stations based on idle computing power information.
  • idle base stations with computing power resources can be collected and marked to facilitate the call of idle computing power information.
  • the idle computing power information also includes the identifier of the idle base station to facilitate statistics and calling of the idle base station.
  • S2200 Sort idle base stations according to idle transmission coefficients and generate idle base station groups.
  • sorting idle base stations by idle transmission coefficients can put idle base stations with larger computing resources and meeting the required transmission coefficients at the forefront of the candidate list, which not only improves the success rate of target base stations matching idle base stations, but also The calling efficiency of idle base stations is guaranteed.
  • all space base stations are traversed, the idle base stations are arranged from large to small according to the sorting order of idle transmission coefficients, and recorded into idle base station groups, so that the target base stations can be matched and called in order.
  • S3000 Obtain idle base stations in the idle base station group that meet the computing power requirements.
  • the idle base station group can be traversed, the computing power demand information and the idle computing power information can be compared to find the idle base station in the idle base station group that meets the needs of the target base station, so as to achieve the goal of space base station
  • the computing power resources can be quickly called.
  • step S3000 at least includes the following steps:
  • S3200 When the number of idle network segments is less than or equal to the number of required network segments, determine the idle base station that meets the computing power demand information.
  • the number of idle network segments when the number of idle network segments is less than or equal to the number of required network segments, it represents the IP network segment where the idle base station satisfies the service requested by the target base station.
  • the number of idle network segments of idle base stations can be controlled within a specific IP network segment and can meet the computing power requirements of the target base station. Otherwise, the broadcast of business information and the leakage of important information will occur.
  • S3400 Obtain idle base stations that meet the computing power requirement information from the updated idle base station group.
  • idle base stations that meet the computing power demand information are obtained from the updated idle base station group, so that the target base station can match the idle base station according to the latest idle computing power information to avoid It happens that the target base station's services are in a suspended state for a long time because they cannot match the idle base station, which affects the user experience.
  • S4000 Match the idle base station and the target base station, and share the computing resources of the idle base station with the target base station.
  • a communication channel needs to be established between the idle base station and the target base station to share computing power resources.
  • the target base station is first matched with idle base stations that meet its computing power requirements.
  • network virtualization technology is used to establish idle base stations and idle base stations. Exclusive communication channels between target base stations ensure the stability of shared computing resources of idle base stations.
  • step S4000 at least includes the following steps:
  • S4100 Establish a virtual communication channel between the idle base station and the target base station.
  • VXLAN Virtual Extensible Local Area Network
  • VXLAN is a network virtualization technology that can improve the expansion problem of large-scale cloud computing during deployment and is an extension of VLAN.
  • VXLAN is a powerful tool that can penetrate the three-layer network to extend the second layer. It can encapsulate traffic and extend it to the third-layer gateway to solve the problem of Virtual Memory System (VMS). ), allowing it to access servers on external IP subnets. Therefore, base Communication between stations chooses to establish a VXLAN communication channel.
  • the relationship between the target base station and the idle base station group is no longer limited by the hardware physical port. As long as the computing power resources in the idle base station group are sufficient, the idle base station group can get more information. Extensive expansion.
  • the target base station communicates with the idle base station through the virtual communication channel, and the business requirements and services of the target base station can be processed and forwarded on the idle base station, thereby achieving the effect of sharing the computing resources of the idle base station.
  • the application container engine (docker) technology is introduced to containerize the computing resources of the idle base station, and the business requirements of the target base station are quickly processed through the computing resources of the idle base station to achieve sharing. The effect of idle base station computing resources.
  • the idle computing power information of the idle base station changes. Therefore, it is necessary to re-obtain the idle computing power information of the idle base station to ensure the real-time nature of the idle computing power information. It can be understood that the process of obtaining the idle computing power information of the idle base station is the same as the above step S1100, and will not be described again here.
  • S4400 Update the idle base station group according to the idle computing power information.
  • step S3300 after obtaining the latest idle computing power information, the idle base station group needs to be updated, which will not be described again here.
  • FIG. 6 is a schematic structural diagram of the base station computing power orchestration device 500 provided by the embodiment of the present application.
  • the entire process of the base station computing power orchestration method provided by the embodiment of the present application involves the following modules in the base station computing power orchestration device 500: Acquisition module 510, generation module 520, search module 530 and sharing module 540.
  • the acquisition module 510 is configured to obtain the idle computing power information of the base station and the computing power demand information of the target base station;
  • the generation module 520 is configured to generate an idle base station group based on the idle computing power information
  • the search module 530 is configured to obtain idle base stations in the idle base station group that meet the computing power requirement information
  • the sharing module 540 is configured to match the idle base station and the target base station, and share the computing resources of the idle base station with the target base station.
  • each module of the above-mentioned base station computing power orchestration device 500 can be independently deployed on the network management, idle base station, target base station or other executable units, which is not limited here.
  • FIG. 7 shows an electronic device 600 provided by an embodiment of the present application.
  • the electronic device 600 includes but is not limited to:
  • Memory 601 is configured to store programs
  • the processor 602 is configured to execute the program stored in the memory 601.
  • the processor 602 executes the program stored in the memory 601
  • the processor 602 is configured to execute the above-mentioned base station computing power arrangement method.
  • the processor 602 and the memory 601 may be connected through a bus or other means.
  • the memory 601 can be configured to store non-transitory software programs and non-transitory computer executable programs, such as the base station computing power orchestration method described in any embodiment of this application.
  • the processor 602 implements the above base station computing power arrangement method by running non-transient software programs and instructions stored in the memory 601.
  • the memory 601 may include a storage program area and a storage data area, wherein the storage program area may store an operating system and an application program required for at least one function; the storage data area may store execution of the base station computing power arrangement method described above.
  • save Memory 601 may include high-speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device.
  • memory 601 may include memory located remotely relative to processor 602, and these remote memories may be connected to the processor 602 through a network. Examples of the above-mentioned networks include but are not limited to the Internet, intranets, local area networks, mobile communication networks and combinations thereof.
  • the non-transitory software programs and instructions required to implement the above base station computing power arrangement method are stored in the memory 601. When executed by one or more processors 602, the base station computing power arrangement method provided by any embodiment of the present application is executed.
  • Embodiments of the present application also provide a storage medium that stores computer-executable instructions, and the computer-executable instructions are used to execute the above-mentioned base station computing power arrangement method.
  • the storage medium stores computer-executable instructions that are executed by one or more control processors, for example, by a processor in the above-mentioned message processing system, so that the above-mentioned one Or multiple processors execute the base station computing power arrangement method provided by any embodiment of this application.
  • the embodiment of this application obtains the idle computing power information of the base station and the computing power demand information of the target base station; generates a group of idle base stations based on the idle computing power information; obtains the idle base stations in the idle base station group that meet the computing power demand information; and matches the idle base stations.
  • the base station and the target base station share the computing power resources of the idle base station to the target base station, improving the utilization of the base station's computing power resources and ensuring the communication quality of the wireless network and the user experience.
  • Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disk (DVD) or other optical disk storage, magnetic cassettes, tapes, disk storage or other magnetic storage devices, or may Any other medium used to store the desired information and that can be accessed by a computer.
  • communication media typically includes computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请实施例公开了基站算力编排方法、装置、系统及存储介质，所述方法包括：获取基站的空闲算力信息和目标基站的算力需求信息(S1000)；根据空闲算力信息，生成空闲基站群组(S2000)；获取空闲基站群组中满足算力需求信息的空闲基站(S3000)；匹配空闲基站与目标基站，并共享空闲基站的算力资源到目标基站(S4000)。

Description

基站算力编排方法、装置、电子设备及存储介质
相关申请的交叉引用
本申请基于申请号为202210860794.3、申请日为2022年07月21日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本申请涉及网络通信技术领域，特别是涉及一种基站算力编排方法、装置、电子设备及存储介质。
背景技术
随着第五代移动通信技术(5th Generation Mobile Communication Technology，5G)的应用和普及，无线通信基站的规模也越发庞大。目前，基站网元设备本身是封闭的，且存在异构性，这种网络结构，会造成算力资源的浪费。若把无线通信网络视为一个整体，则整个网络的算力资源是足够的。但由于算力本身是在网元设备上独立存在，可能会发生整体的算力资源足够的情况下，单独的网元设备剩余算力资源无法满足个别繁忙网元设备的算力需求。尤其是在演唱会现场、救援现场等突发应急需求处理场景和潮汐效应明显的场景下，基站网元设备之间算力资源分配不均匀的情况十分明显，不仅造成算力资源的浪费，还影响了无线网络的通信质量和用户的使用体验。
发明内容
本申请实施例提供一种基站算力编排方法、装置、电子设备及存储介质。
第一方面，本申请实施例提供一种基站算力编排方法，应用于基站，所述方法包括：获取所述基站的空闲算力信息和目标基站的算力需求信息；根据所述空闲算力信息，生成空闲基站群组；获取所述空闲基站群组中满足所述算力需求信息的空闲基站；匹配所述空闲基站与所述目标基站，并共享所述空闲基站的算力资源到所述目标基站。
第二方面，本申请实施例提供一种基站算力编排装置，包括：获取模块，设置为获取所述基站的空闲算力信息和目标基站的算力需求信息；生成模块，设置为根据所述空闲算力信息，生成空闲基站群组；查找模块，设置为获取所述空闲基站群组中满足所述算力需求信息的空闲基站；共享模块，设置为匹配所述空闲基站与所述目标基站，并共享所述空闲基站的算力资源到所述目标基站。
第三方面，本申请实施例提供一种电子设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时，实现本申请实施例提供的基站算力编排方法。
第四方面，本申请实施例提供一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时，实现本申请实施例提供的基站算力编排方法。
附图说明
图1是本申请实施例提供的一种基站算力编排方法的流程示意图；
图2是图1中步骤S1000的另一实施例的具体实现过程示意图；
图3是图1中步骤S2000的另一实施例的具体实现过程示意图；
图4是图1中步骤S3000的另一实施例的具体实现过程示意图；
图5是图1中步骤S4000的另一实施例的具体实现过程示意图；
图6是本申请实施例提供的一种基站算力编排装置的结构图；
图7是本申请实施例提供的一种电子设备的结构示意图。
具体实施方式
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的具体实施例仅用以解释本申请，并不用于限定本申请。
应了解，在本申请实施例的描述中，如果有描述到“第一”、“第二”等只是用于区分技术特征为目的，而不能理解为指示或暗示相对重要性或者隐含指明所指示的技术特征的数量或者隐含指明所指示的技术特征的先后关系。“至少一个”是指一个或者多个，“多个”是指两个或两个以上。“和/或”，描述关联对象的关联关系，表示可以存在三种关系，例如，A和/或B，可以表示单独存在A、同时存在A和B、单独存在B的情况。其中A，B可以是单数或者复数。字符“/”一般表示前后关联对象是一种“或”的关系。“以下至少一项”及其类似表达，是指的这些项中的任意组合，包括单项或复数项的任意组合。例如，a，b和c中的至少一项可以表示：a，b，c，a和b，a和c，b和c或a和b和c，其中a，b，c可以是单个，也可以是多个。
此外，下面所描述的本申请各个实施方式中所涉及到的技术特征只要彼此之间未构成冲突就可以相互组合。
本申请实施例涉及的基站算力编排方法，是基于无线网络的IP技术，在云化网络下无线网络站点之间基于网络虚拟化技术进行通信，把无线网络构建为一种能根据业务需求，在云、网、边之间按需分配和灵活调度计算资源、存储资源以及网络资源的算力网络。算力网络能结合新型网络技术，将基站网元、边缘算力节点、云计算节点以及含广域网在内的各类网络资源深度融合在一起，减少边缘算力节点的管控复杂度，并通过集中控制或者分布式调度方法与云计算节点的计算和存储资源、广域网的网络资源进行协同，组成新一代信息基础设施，为无线通信提供包含计算、存储和连接的整体算力服务，并根据基站业务特性提供灵活、可调度的按需服务。
为了保证基站算力资源得到充分的利用，现有的基站算力编排方法为：采用一种比较接近算力网络的技术，即基站集群技术，通过某种方式把基站组合起来，形成一个超级基站。打通基站间的通道技术，通过站点之间的光口传输作为载体。但是在实际应用中，由于受限于硬件，成池的规模有限；且属于静态组网，在网络规划时需要确定网络规模，灵活性较差；加上站点之间的协议为私有协议，在这些约束条件下，集群技术在基站组网中没有得到很好的应用。而在一些突发应急需求处理场景，如演唱会、临时事件等；或者潮汐效应明显的场景中，比如办公楼午休时间用户多；加上5G业务模型复杂，业务的种类多，模型变化复杂， 设备扩容往往跟不上业务的需求；另外，5G协议还在快速发展，新业务上线后，原有的算力资源越来越紧张，无法保证原有的规格定义。
基于以上，本申请实施例提供一种基站算力编排方法、装置、系统及计算机可读存储介质，获取基站的空闲算力信息和目标基站的算力需求信息；根据空闲算力信息，生成空闲基站群组；获取空闲基站群组中满足算力需求信息的空闲基站；匹配空闲基站与目标基站，并共享空闲基站的算力资源到目标基站，提高基站算力资源的利用率，保证了无线网络的通信质量和用户的使用体验。
请参见图1，图1示出了本申请实施例提供的一种基站算力编排方法的流程。如图1所示，本申请实施例的基站算力编排方法包括以下步骤：
S1000，获取基站的空闲算力信息和目标基站的算力需求信息。
可以理解的是，在无线网络中，基站网元通过链路连接到核心网，并经过网管服务器进行信息传送。示例性的，在5G架构下，采用中央单元(Centralized Unit，CU)和分布单元(Distributed Unit，DU)独立部署的方式，以更好地满足各场景和应用的需求。而统一网元管理平台(Unified Management of Network Element，UME)作为所有基站的管理客户端，能实时地收集和统计所有基站的空闲算力信息以及目标基站的算力需求信息。
可以理解的是，基站的空闲算力信息为基站在运行本端和当前业务的情况下，基站的总性能值减去当前业务占用的性能值后，基站剩余性能值的数值表征。在本申请中，具有空闲算力信息的基站为空闲基站。
可以理解的是，目标基站的算力需求信息为基站在运行本端和当前业务时，因基站的空闲算力无法满足业务需求，导致业务无法正常处理和转发的情况下，基站向外发送算力需求，以满足当前的业务需求。在本申请中，发送算力需求信息的基站为目标基站。
请参见图2，图2示出了上述步骤S1000的另一实施例的具体实现过程示意图。如图2所示，步骤S1000至少包括以下步骤：
S1100,获取各个基站的空闲算力信息，其中，空闲算力信息包括以下至少一个：空闲传输系数、空闲网段数量或空闲性能参数。
可以理解的是，为了全面地反映出空间基站的空闲算力，空闲算力信息需要全面地表征出空闲基站处理业务的性能。示例性的，空闲算力信息包括空闲传输系数和空闲网段数量。其中，空闲传输系数能通过服务质量(Quality of Service，QoS)系数进行表征。QoS指传送网络能够利用各种基础技术，为指定的网络通信提供更好的服务能力，是网络的一种安全机制，是用来解决网络延迟和阻塞等问题的一种技术。QoS保证能有效地满足容量有限的网络中，需要固定的传输率、对延时敏感的服务。可以理解的是，QoS是网络与用户之间以及网络上互相通信的用户之间关于信息传输与共享的质的约定，其关键指标主要包括：可用性、吞吐量、时延、时延变化(包括抖动和漂移)和丢包。可以理解的是，如何获取和发送无线基站链路之间的QoS系数属于公知的，此处不再赘述。
可以理解的是，随着IP技术在无线网络中的广泛应用，空闲网段数量在无线网络中同样反映出空闲基站的算力情况。示例性的，空闲网段数量越多，则代表空闲基站能把业务传送到更广的IP网段内，而在基站业务处理过程中，往往需要对网段进行限制和规范，保证业务处理的稳定性。因此，空闲网段数量需要控制在一定范围内才能满足目标基站的算力需求。
可以理解的是，为了保证空闲基站的性能参数能满足算力需求，空闲性能参数包括以下 至少一个：CPU占用率、GPU占用率、内存占用率或硬盘占用率。示例性的，在执行低时延要求的服务时，如果空闲基站存在CPU占用率过高的情况，会影响该空闲基站的性能和处理速度，因此需要把该空闲性能参数不达标的空闲基站进行筛除。
S1200，获取目标基站的算力需求信息，其中，算力需求信息包括以下至少之一：需求传输系数、需求网段数量或需求性能参数。
可以理解的是，为了全面地反映出目标基站的算力需求，算力需求信息需要全面地表征出目标基站所需要的处理业务的性能。示例性的，算力需求信息包括需求传输系数和需求网段数量。与上述步骤S1100中的空闲传输系数一致，需求传输系数也通过QoS系数进行表征，以便于对空闲传输系数和需求传输系数进行比较。
可以理解的是，随着IP技术在无线网络中的广泛应用，需求网段数量能反映出目标基站需要的算力的网段覆盖范围。示例性的，需求网段数量越少，则代表目标基站请求的业务需要传送到特定的IP网段内。此时，需要空闲网段数量控制在特定的IP网段内才能满足目标基站的算力需求，否则会造成业务信息的广播和重要信息发生泄露的情况。
可以理解的是，与空闲性能参数一致，为了目标基站的算力需求的性能参数能满足算力需求，需求性能参数同样包括以下至少一个：CPU占用率、GPU占用率、内存占用率或硬盘占用率。
S2000，根据空闲算力信息，生成空闲基站群组。
可以理解的是，在获取空闲算力信息后，系统能生成包括所有空闲基站的群组，以便于目标基站进行匹配和调用。类似于算力网络中的算力池，把无线网络中离散的空闲基站进行统一的整合和调度，能有效地提高空闲基站的算力资源的调用效率和利用率。
请参见图3，图3示出了上述步骤S2000的另一实施例的具体实现过程示意图。如图3所示，步骤S2000至少包括以下步骤：
S2100，根据空闲算力信息，获取空闲基站。
可以理解的是，通过采集空闲算力信息，能把存在算力资源的空闲基站进行收集和标记，以便于对空闲算力信息进行调用。示例性的，为了进行定位和分类，空闲算力信息中还包括空闲基站的标识符，以便于对空闲基站进行统计和调用。通过对空闲基站的标识符进行汇总，提高了空闲基站群组的更新效率。
S2200，根据空闲传输系数对空闲基站进行排序，生成空闲基站群组。
可以理解的是，通过空闲传输系数对空闲基站进行排序，能把算力资源较大且满足需求传输系数的空闲基站放在候选清单的前列，不仅提高了目标基站匹配空闲基站的成功率，也保证了空闲基站的调用效率。在一实施例中，遍历全部空间基站，按照空闲传输系数的排序顺序，从大到小对空闲基站进行排列，并记录到空闲基站群组，以便于目标基站按序进行匹配和调用。
S3000，获取空闲基站群组中满足算力需求信息的空闲基站。
可以理解的是，在生成空闲基站群组后，能通过遍历空闲基站群组，比较算力需求信息和空闲算力信息，查找出空闲基站群组中满足目标基站需求的空闲基站，达到空间基站的算力资源得到快速调用的效果。
请参见图4，图4示出了上述步骤S3000的另一实施例的具体实现过程示意图。如图4所示，步骤S3000至少包括以下步骤：
S3100，在空闲传输系数大于等于需求传输系数的情况下，比较空闲网段数量和需求网段数量。
可以理解的是，由上述步骤S1100和S1200可知，在空闲传输系数大于等于需求传输系数的情况下，空闲基站与目标基站之间的QoS系数满足目标基站的传输需求。在保证可用性、吞吐量、时延、时延变化和丢包数量满足目标基站的业务需求的前提下，再比较空闲网段数量和需求网段数量，能保证目标基站业务的处理质量和安全性，提高目标基站与空闲基站的匹配效率。
S3200，在空闲网段数量小于等于需求网段数量的情况下，确定满足算力需求信息的空闲基站。
可以理解的是，在空闲网段数量小于等于需求网段数量的情况下，则代表空闲基站满足目标基站请求的业务所在的IP网段。在一实施例中，空闲基站的空闲网段数量能控制在特定的IP网段内，并能满足目标基站的算力需求，否则会造成业务信息的广播和重要信息发生泄露的情况。
S3300，在空闲传输系数均小于需求传输系数的情况下，更新空闲基站群组。
可以理解的是，由上述步骤S1100和S1200可知，在空闲传输系数均小于需求传输系数的情况下，空闲基站群组内全部空闲基站与目标基站之间的QoS系数都不满足目标基站的传输需求。此时，需要重新获取空闲基站的空闲算力信息，并根据上述步骤S2000，重新获取空闲基站群组。
S3400，在更新后的空闲基站群组获取满足算力需求信息的空闲基站。
可以理解的是，与上述步骤S3100和S3200一致，在更新后的空闲基站群组中获取满足算力需求信息的空闲基站，以便于目标基站能根据最新的空闲算力信息匹配到空闲基站，避免发生目标基站的业务因无法匹配空闲基站，而长期处于挂起的状态，影响用户的使用体验。
S4000，匹配空闲基站与目标基站，并共享空闲基站的算力资源到目标基站。
可以理解的是，在确定满足算力需求信息的空闲基站后，需要建立空闲基站与目标基站之间的通信通道，进行算力资源的共享。在一实施例中，首先将目标基站和满足其算力需求信息的空闲基站进行一一匹配；为了避免业务信息在传送过程中发生错误或丢失的情况，通过网络虚拟化技术，建立空闲基站与目标基站之间的专属通信通道，保证共享空闲基站的算力资源的稳定性。
请参见图5，图5示出了上述步骤S4000的另一实施例的具体实现过程示意图。如图5所示，步骤S4000至少包括以下步骤：
S4100，建立空闲基站与目标基站之间的虚拟通信通道。
可以理解的是，通过建立空闲基站与目标基站之间的虚拟通信通道，能有效保证空闲基站与目标基站之间通信的稳定性和安全性。示例性的，在本申请实施例中，采用虚拟扩展局域网(Virtual Extensible Local Area Network，VXLAN)建立空闲基站与目标基站之间的虚拟通信通道。
可以理解的是，VXLAN是一种网络虚拟化技术，可以改进大型云计算在部署时的扩展问题，是对VLAN的一种扩展。同时，VXLAN是一种功能强大的工具，可以穿透三层网络对二层进行扩展，能通过封装流量并将其扩展到第三层网关，以此来解决虚拟内存系统(Virtual Memory System，VMS)的可移植性限制，使其可以访问在外部IP子网上的服务器。因此，基 站之间的通信选择建立VXLAN通信通道，目标基站与空闲基站群组之间不再受限于硬件物理端口的限制，只要空闲基站群组内的算力资源足够，空闲基站群组能得到更大范围的扩展。
S4200，通过虚拟通信通道，共享空闲基站的算力资源到目标基站。
可以理解的是，目标基站通过虚拟通信通道与空闲基站进行通信，目标基站的业务需求和服务能在空闲基站上进行处理和转发，达到共享空闲基站的算力资源的效果。示例性的，在无线网络中，通过引入应用容器引擎(docker)技术，把空闲基站的算力资源容器化，并使目标基站的业务需求快速地通过空闲基站的算力资源进行处理，达到共享空闲基站的算力资源的效果。
S4300，获取空闲基站的空闲算力信息。
可以理解的是，在空闲基站的算力资源共享到目标基站后，空闲基站的空闲算力信息发生变化。因此，需要重新获取空闲基站的空闲算力信息，以保证空闲算力信息的实时性。可以理解的是，获取空闲基站的空闲算力信息的过程如上述步骤S1100一致，此处不再赘述。
S4400，根据空闲算力信息，更新空闲基站群组。
可以理解的是，与上述步骤S3300一致，在获取最新的空闲算力信息后需要对空闲基站群组进行更新，此处不再赘述。
参见图6，图6是本申请实施例提供的基站算力编排装置500的结构示意图，本申请实施例提供的基站算力编排方法的整个流程中涉及基站算力编排装置500中的以下模块：获取模块510、生成模块520、查找模块530和共享模块540。
其中，获取模块510，设置为获取基站的空闲算力信息和目标基站的算力需求信息；
生成模块520，设置为根据空闲算力信息，生成空闲基站群组；
查找模块530，设置为获取空闲基站群组中满足算力需求信息的空闲基站；
共享模块540，设置为匹配空闲基站与目标基站，并共享空闲基站的算力资源到目标基站。
需要说明的是，上述装置的模块之间的信息交互、执行过程等内容，由于与本申请方法实施例基于同一构思，其具体功能及带来的技术效果，具体可参见方法实施例部分，此处不再赘述。
可以理解的是，上述基站算力编排装置500的各个模块可以独立部署在网管、空闲基站的、目标基站或者其他可执行单元上，此处不作限定。
图7示出了本申请实施例提供的电子设备600。该电子设备600包括但不限于：
存储器601，设置为存储程序；
处理器602，设置为执行存储器601存储的程序，当处理器602执行存储器601存储的程序时，处理器602设置为执行上述的基站算力编排方法。
处理器602和存储器601可以通过总线或者其他方式连接。
存储器601作为一种非暂态计算机可读存储介质，可设置为存储非暂态软件程序以及非暂态性计算机可执行程序，如本申请任意实施例描述的基站算力编排方法。处理器602通过运行存储在存储器601中的非暂态软件程序以及指令，从而实现上述的基站算力编排方法。
存储器601可以包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需要的应用程序；存储数据区可存储执行上述的基站算力编排方法。此外，存 储器601可以包括高速随机存取存储器，还可以包括非暂态存储器，比如至少一个磁盘存储器件、闪存器件、或其他非暂态固态存储器件。在一些实施方式中，存储器601可包括相对于处理器602远程设置的存储器，这些远程存储器可以通过网络连接至该处理器602。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
实现上述的基站算力编排方法所需的非暂态软件程序以及指令存储在存储器601中，当被一个或者多个处理器602执行时，执行本申请任意实施例提供的基站算力编排方法。
本申请实施例还提供了一种存储介质，存储有计算机可执行指令，计算机可执行指令用于执行上述的基站算力编排方法。
在一实施例中，该存储介质存储有计算机可执行指令，该计算机可执行指令被一个或多个控制处理器执行，比如，被上述报文处理系统中的一个处理器执行，可使得上述一个或多个处理器执行本申请任意实施例提供的基站算力编排方法。
本申请实施例，获取基站的空闲算力信息和目标基站的算力需求信息；根据空闲算力信息，生成空闲基站群组；获取空闲基站群组中满足算力需求信息的空闲基站；匹配空闲基站与目标基站，并共享空闲基站的算力资源到目标基站，提高基站算力资源的利用率，保证了无线网络的通信质量和用户的使用体验。
以上所描述的实施例仅仅是示意性的，其中作为分离部件说明的单元可以是或者也可以不是物理上分开的，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统可以被实施为软件、固件、硬件及其适当的组合。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包括计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。

Claims (10)

  1. 一种基站算力编排方法，应用于基站，所述方法包括：
    获取所述基站的空闲算力信息和目标基站的算力需求信息；
    根据所述空闲算力信息，生成空闲基站群组；
    获取所述空闲基站群组中满足所述算力需求信息的空闲基站；
    匹配所述空闲基站与所述目标基站，并共享所述空闲基站的算力资源到所述目标基站。
  2. 根据权利要求1所述的方法，其中，所述获取所述基站的空闲算力信息和目标基站的算力需求信息，包括：
    获取各个所述基站的所述空闲算力信息，其中，所述空闲算力信息包括以下至少一个：空闲传输系数、空闲网段数量或空闲性能参数；
    获取所述目标基站的算力需求信息，其中，所述算力需求信息包括以下至少之一：需求传输系数、需求网段数量或需求性能参数。
  3. 根据权利要求2所述的方法，其中，所述根据所述空闲算力信息，生成空闲基站群组，包括：
    根据所述空闲算力信息，获取所述空闲基站；
    根据所述空闲传输系数对所述空闲基站进行排序，生成所述空闲基站群组。
  4. 根据权利要求2所述的方法，其中，所述获取所述空闲基站群组中满足所述算力需求信息的空闲基站，包括：
    在所述空闲传输系数大于等于所述需求传输系数的情况下，比较所述空闲网段数量和所述需求网段数量；
    在所述空闲网段数量小于等于所述需求网段数量的情况下，确定满足所述算力需求信息的所述空闲基站。
  5. 根据权利要求2所述的方法，其中，所述获取所述空闲基站群组中满足所述算力需求信息的空闲基站，包括：
    在所述空闲传输系数均小于所述需求传输系数的情况下，更新所述空闲基站群组；
    在更新后的所述空闲基站群组获取满足所述算力需求信息的所述空闲基站。
  6. 根据权利要求1所述的方法，其中，所述匹配所述空闲基站与所述目标基站，并共享所述空闲基站的算力资源到所述目标基站，包括：
    建立所述空闲基站与所述目标基站之间的虚拟通信通道；
    通过所述虚拟通信通道，共享所述空闲基站的算力资源到所述目标基站。
  7. 根据权利要求6所述的方法，其中，所述通过所述虚拟通信通道，共享所述空闲基站的算力资源到所述目标基站之后，还包括：
    获取所述空闲基站的空闲算力信息；
    根据所述空闲算力信息，更新所述空闲基站群组。
  8. 一种基站算力编排装置，包括：
    获取模块，设置为获取所述基站的空闲算力信息和目标基站的算力需求信息；
    生成模块，设置为根据所述空闲算力信息，生成空闲基站群组；
    查找模块，设置为获取所述空闲基站群组中满足所述算力需求信息的空闲基站；
    共享模块，设置为匹配所述空闲基站与所述目标基站，并共享所述空闲基站的算力资源到所述目标基站。
  9. 一种电子设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时，实现如权利要求1至7任意一项所述的基站算力编排方法。
  10. 一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时，实现如权利要求1至7任意一项所述的基站算力编排方法。
PCT/CN2023/094066 2022-07-21 2023-05-12 基站算力编排方法、装置、电子设备及存储介质 WO2024016801A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210860794.3A CN117499995A (zh) 2022-07-21 2022-07-21 基站算力编排方法、装置、电子设备及存储介质
CN202210860794.3 2022-07-21

Publications (1)

Publication Number Publication Date
WO2024016801A1 true WO2024016801A1 (zh) 2024-01-25

Family

ID=89616957

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/094066 WO2024016801A1 (zh) 2022-07-21 2023-05-12 基站算力编排方法、装置、电子设备及存储介质

Country Status (2)

Country Link
CN (1) CN117499995A (zh)
WO (1) WO2024016801A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110366194A (zh) * 2019-06-06 2019-10-22 深圳市太易云互联科技有限公司 资源调用方法、装置及系统
US20200351340A1 (en) * 2018-06-07 2020-11-05 At&T Intellectual Property I, L.P. Edge sharing orchestration system
CN113271613A (zh) * 2020-04-24 2021-08-17 中兴通讯股份有限公司 基于基站群的数据处理方法、基站及基站系统
CN113542316A (zh) * 2020-04-13 2021-10-22 展讯半导体(南京)有限公司 算力共享方法及相关设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20200351340A1 (en) * 2018-06-07 2020-11-05 At&T Intellectual Property I, L.P. Edge sharing orchestration system
CN110366194A (zh) * 2019-06-06 2019-10-22 深圳市太易云互联科技有限公司 资源调用方法、装置及系统
CN113542316A (zh) * 2020-04-13 2021-10-22 展讯半导体(南京)有限公司 算力共享方法及相关设备
CN113271613A (zh) * 2020-04-24 2021-08-17 中兴通讯股份有限公司 基于基站群的数据处理方法、基站及基站系统

Also Published As

Publication number Publication date
CN117499995A (zh) 2024-02-02

Similar Documents

Publication Publication Date Title
US11864019B2 (en) Time-sensitive networking communication method and apparatus
US11653180B2 (en) Group communications method and system, and device
EP4258598A1 (en) Computing power application traffic forwarding method and apparatus
WO2020007202A1 (zh) 一种数据传输方法、装置及系统
US11528239B2 (en) Time-sensitive networking communication method and apparatus for configuring virtual switching node
US12127006B2 (en) Methods for multi-access edge computing network slicing in 5G networks
CN110326345B (zh) 一种配置网络切片的方法、装置和系统
WO2019062994A1 (zh) 网络切片的管理方法、设备及系统
CN113596191B (zh) 一种数据处理方法、网元设备以及可读存储介质
US12063594B2 (en) Method, device, and system for deploying network slice
WO2020024961A1 (zh) 数据处理方法、设备及系统
WO2019029522A1 (zh) 网络组件的管理方法和网络设备
JP2022532731A (ja) スライスベースネットワークにおける輻輳回避
US20200077425A1 (en) Intelligent scheduling of a wireless network for a backhaul
WO2019029704A1 (zh) 网络对象管理方法及其装置
WO2016095142A1 (zh) 软件定义网络sdn中数据转发的方法、设备和系统
Chen et al. Realization of 5g network slicing using open source softwares
CN114365454A (zh) 无状态安全功能的分布
WO2024016801A1 (zh) 基站算力编排方法、装置、电子设备及存储介质
CN113453285B (zh) 一种资源调整方法、装置及存储介质
WO2021135485A1 (zh) 一种访问控制方法、装置及系统
CN114221948A (zh) 一种云网系统及任务处理方法
WO2024016803A1 (zh) 基于联邦学习的基站算力调用方法、装置、设备及介质
CN113395362B (zh) 移动边缘计算的服务链分群和重整方法
WU Ten reflections on 5G

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23841870

Country of ref document: EP

Kind code of ref document: A1