Network slice resource dynamic allocation method for multi-service integration of coal mine

Abstract

This invention discloses a dynamic allocation method for network slice resources in coal mines with multi-service convergence, relating to the field of resource allocation technology. The method includes: generating a bearer sequence based on the scheduling cycle of underground refuge chambers; calculating the total bearer usage time based on the bearer sequence; generating a set of participating bearers based on the total bearer usage time; calculating the total slice resource requirement corresponding to the logical access identifier in the underground refuge chambers; constructing a configuration table based on the total slice resource requirement and the set of participating bearers; and reading the target entry value of the configuration table. This invention can reduce the probability of long-term idle resources of the original bearers after service migration.

Description

Technical Field

[0001] This invention relates to the field of resource allocation technology, and in particular to a method for dynamic allocation of network slice resources for multi-service integration in coal mines. Background Technology

[0002] In the underground coal mine environment, production and safety-related communications typically involve multiple concurrent services, including environmental parameter acquisition and alarms, personnel vital sign monitoring, voice communication, control commands, and status feedback, all transmitted simultaneously underground. Underground refuge chambers, serving as physical facilities for centralized personnel refuge during disasters, are equipped with independent life support units and continuously generate various types of business data. Their data flows need to be transmitted and forwarded between the access network and the bearer network via the underground communication network. Underground communication links are significantly affected by roadway structure, power supply, and line conditions. In the post-disaster phase, the services of the same refuge chamber may switch back and forth between the mine's main communication bearer and the emergency self-sustaining communication bearer, resulting in the same services alternating on different physical bearer paths.

[0003] To accommodate the simultaneous operation of multiple services and improve resource utilization efficiency, the existing underground network is gradually adopting network slicing and slice queues for service isolation and scheduling. On the network side, service flow records are collected according to the scheduling cycle to form a bearer sequence, so as to statistically observe the usage of each physical bearer within the observation period and obtain the set of participating bearers. At the same time, logical access identifiers are assigned to refuge chambers and service flow records are collected to form a service flow set. The total slice resource requirement corresponding to the logical access identifier is calculated, and a configuration table is constructed based on this and the set of participating bearers. When the service arrives at the network device, a target index key is generated to read the target table entry value. Finally, based on the target table entry value, the scheduling and forwarding of the target service flow are completed in the slice queue.

[0004] Existing network slicing resource allocation methods for multi-service convergence typically use access points or single physical bearer paths as configuration objects, and reserve or statically distribute slice resources based on service types. When services in underground refuge chambers switch back and forth between different physical bearer paths, the new physical bearer path to which the service is migrated lacks slice resource configurations equivalent to those of the refuge chamber, resulting in insufficient resources. At the same time, the resources already configured on the original physical bearer path from which the service is migrated remain idle for a long time due to a lack of actual service usage, thus causing resource mismatch and waste. Summary of the Invention

[0005] The purpose of this invention is to address the shortcomings of existing technologies, such as the lack of equivalent slice resources on the new physical bearer path for business migration, which leads to insufficient resources. The invention proposes a dynamic allocation method for network slice resources for multi-service convergence in coal mines.

[0006] To address the problems existing in the prior art, the present invention adopts the following technical solution: A dynamic allocation method for network slice resources for multi-service convergence in coal mines includes: S1. Generate a carrying sequence based on the scheduling cycle of the underground refuge chamber; S2. Calculate the total bearer usage time based on the bearer sequence, and generate a set of participating bearers based on the total bearer usage time; S3. Calculate the total slice resource requirements corresponding to the logical access identifier in the underground refuge chamber; S4. Construct a configuration table based on the total slice resource requirements and the participating bearer set, and read the target table entry value; S5. Schedule and forward the target business flow of the underground refuge chamber based on the target table value.

[0007] Preferably, the load-bearing sequence is generated based on the scheduling cycle of the underground refuge chamber, including: Set the scheduling cycle for underground refuge chambers; During each scheduling cycle of the underground refuge chamber, the business flow records of the underground refuge chamber are collected; Determine the physical bearer identifier corresponding to the scheduling cycle based on the business flow records; The physical bearer identifiers are recorded sequentially according to the scheduling cycle number to obtain the bearer sequence.

[0008] Preferably, the total bearer usage time is calculated based on the bearer sequence, and a set of participating bearers is generated based on the total bearer usage time, including: The observation period is determined based on the sequence range of the scheduling cycle. Count the scheduling periods corresponding to the same physical bearer identifier in the bearer sequence to obtain the number of scheduling periods corresponding to the physical bearer identifier; Multiply the number of scheduling cycles corresponding to the physical bearer identifier by the duration of the scheduling cycle to obtain the bearer usage time corresponding to the physical bearer identifier; The total carrying time is obtained by summing the carrying time corresponding to all physical carrying identifiers.

[0009] Preferably, the set of participating bearers is generated based on the total bearer usage time, including: Divide the bearer usage time corresponding to the physical bearer identifier by the total bearer usage time to obtain the bearer usage percentage corresponding to the physical bearer identifier. The physical bearer identifiers are filtered based on the comparison results of the bearer usage ratio and the value of 0 to obtain the set of bearers participating in the test.

[0010] Preferably, the total slice resource requirement corresponding to the logical access identifier in the underground refuge chamber is calculated, including: Assign logical access identifiers to underground refuge chambers; Write the business flow record into the logical identifier field; The logical identifier field is assigned a value based on the logical access identifier; After the assignment process is completed, during the observation period, the business flow records are aggregated into a business flow set; Statistical calculations are performed on the set of business flows to obtain the average business volume; Calculate the maximum value of the business flow set to obtain the maximum business volume; The total slice resource requirement corresponding to the logical access identifier is calculated based on the average and maximum traffic volume.

[0011] Preferably, the formula for calculating the total slice resource requirement is as follows: ; In the formula, This is the total slice resource requirement. This represents the average business volume, and 'a' is a preset proportional coefficient. That is the maximum business volume.

[0012] Preferably, a configuration table is constructed based on the total slice resource requirements and the participating bearer set, including: For each physical bearer identifier in the participating bearer set, the total slice resource requirement is multiplied by the bearer usage ratio corresponding to the physical bearer identifier in the participating bearer set to obtain the resource allocation value; Use the logical access identifier and the physical bearer identifier in the participating bearer set as index keys; Use the resource allocation value as the table entry value; The configuration table is constructed based on the index key and the table entry value.

[0013] Preferably, reading the target entry value of the configuration table includes: Define the service flow record corresponding to the physical bearer identifier in the participating bearer set as the target service flow; Identify the network device corresponding to the physical bearer identifier in the participating bearer set; Generate the target index key; Read the target entry value from the configuration table based on the target index key.

[0014] Preferably, generating the target index key includes: When the target service flow arrives at the network device, the physical bearer information of the target service flow is parsed to obtain the physical bearer identifier of the target service flow; Read the target field value from the logical identifier field in the target business flow; Use the physical bearer identifier of the target service flow and the target field value corresponding to the target service flow as the target index key.

[0015] Preferably, the scheduling and forwarding of target traffic flows for underground refuge chambers based on target entry values ​​includes: Obtain the queue resource capacity of each slice queue in the network device; The target slice queue is obtained by filtering each slice queue based on the queue resource capacity and the target table entry value; Assign the target business flow to the target slice queue; The target service flow is scheduled and forwarded in the target slice queue.

[0016] Compared with the prior art, the beneficial effects of the present invention are: 1. This invention collects the business flow records of underground refuge chambers according to the scheduling cycle and forms a carrying sequence. Furthermore, it statistically analyzes the actual usage of each physical carrying identifier during the observation period and generates a set of participating carrying entities. This expands the object of resource allocation from a single path to multiple physical carrying paths that the refuge chamber has actually used after the disaster, thereby avoiding the resource mismatch problem caused by reserving resources on only one carrying path side when the business switches back and forth between different physical carrying paths.

[0017] 2. After obtaining the set of participating bearers, this invention calculates the total slice resource requirements corresponding to the logical access identifiers, and uses the bearer usage ratio as the allocation basis. The total slice resource requirements are decomposed into resource allocation values ​​according to the bearer usage ratio of each physical bearer identifier, and the resource allocation values ​​of each physical bearer identifier are accumulated to be consistent with the total slice resource requirements. This forms an equivalent resource preparation on the new physical bearer path for business migration, while reducing resource occupation for physical bearers with low usage ratios or even those that do not actually carry services. This reduces the probability of the original bearer's configured resources being idle for a long time after the business is migrated out, and achieves accurate allocation and utilization of overall resources.

[0018] 3. This invention further uses the logical access identifier and the physical bearer identifier in the participating bearer set as index keys, and uses the resource allocation value as the table entry value to construct a configuration table. When the target service flow arrives at the network device, the physical bearer identifier is parsed to obtain the physical bearer identifier, and the value of the logical identifier field in the service flow is read to generate the target index key to read the target table entry value. Then, the target slice queue is obtained by combining the queue resource capacity of each slice queue of the network device, and the scheduling and forwarding of the target service flow are completed. This allows the resource allocation result to be called in a consistent indexing manner on the network devices corresponding to different bearer paths and fall into the executable configuration at the slice queue level. Thus, even when the bearer path is frequently switched, the continuity and feasibility of slice resource configuration and service forwarding actions are maintained. Attached Figure Description

[0019] The accompanying drawings, which are included to provide a further understanding of the invention and form part of this application, illustrate exemplary embodiments of the invention and, together with their description, serve to explain the invention and do not constitute an undue limitation thereof. In the drawings: Figure 1This is a flowchart illustrating a method for dynamic allocation of network slice resources for multi-service convergence in coal mines, provided in an embodiment of the present invention. Detailed Implementation

[0020] The technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments.

[0021] Example: This example provides a method for dynamic allocation of network slice resources for multi-service convergence in coal mines. See [link to example]. Figure 1 Specifically, including: S1. Generate a carrying sequence based on the scheduling cycle of the underground refuge chamber; In an embodiment of the present invention, generating a carrying capacity sequence based on the scheduling cycle of the underground refuge chamber includes: Set the scheduling cycle for underground refuge chambers; Specifically, the study analyzed all service types carried by the underground refuge chamber, including environmental monitoring, vital sign control commands, and emergency voice communication. For each service type, the study collected data generation intervals, data transmission time, and the maximum allowable transmission delay parameters. It also analyzed the actual generation interval and transmission time fluctuation ranges for each service type in historical communication processes. The study extracted the minimum actual generation interval and the shortest actual transmission time among all service types. Based on the minimum actual generation interval and referencing the maximum allowable transmission delay parameters for all service types, the study calculated the shortest time length that could cover at least one data generation and complete transmission process for all service types as the initial period length. Through continuous operational tests over multiple time periods, the study verified that data for all service types could be collected and transmitted within the maximum allowable transmission delay under this initial period length without data loss or duplicate collection.

[0022] Specifically, the initial cycle duration is then verified. The verification includes the matching degree between the duration and the transmission frequency of the underground refuge chamber's business flow, as well as the complete carrying capacity of the business flow data within the duration. After the verification results meet the requirements of normal transmission and peak load carrying of the business flow, the verified initial cycle duration is determined as the scheduling cycle corresponding to the underground refuge chamber. The scheduling cycle is then divided into multiple consecutive time intervals, with each time interval having a completely consistent duration. At the same time, the time boundaries between two adjacent scheduling cycles are clearly defined to ensure that the end time of the previous scheduling cycle does not overlap with the start time of the next scheduling cycle, so that each scheduling cycle is independent and orderly connected in the time dimension.

[0023] During each scheduling cycle of the underground refuge chamber, the business flow records of the underground refuge chamber are collected; Specifically, before the start of the scheduling cycle corresponding to the underground refuge chamber, a timing signal is sent to all terminals and communication access devices associated with the refuge chamber through the 5G or UWB base stations deployed underground. This completes the unified calibration of the clocks of each device to ensure that the time synchronization accuracy meets the data acquisition requirements. At the start of the scheduling cycle, data acquisition is triggered based on the synchronized clock. A data capture unit is deployed at the link access point between the refuge chamber and the outside world to monitor the transmitted data packet stream in real time. Each data packet is received and parsed one by one, and the sending terminal identifier, refuge chamber identifier, service type identifier, physical bearer identifier, and data packet length are extracted from the data packet. The system records the data content summary and transmission time information, and compares the reception time of each data packet with the transmission time. At the end of the scheduling cycle, the data acquisition operation is terminated based on the synchronization clock. The parsed information corresponding to all data packets captured in the cycle is arranged in chronological order of transmission time. The integrity of the arranged information is verified by comparing the total number of statistical data packets with the number of data packets corresponding to each service type to check for data loss or duplicate collection. Missing data is supplemented by re-listening to the link, and duplicate data is deduplicated. Finally, a service flow record covering complete information of all valid data packets in the scheduling cycle is formed.

[0024] Specifically, underground refuge chambers refer to enclosed safety spaces set up in underground roadways of coal mines to provide temporary shelter and life protection for underground workers in the event of a coal mine disaster. These refuge chambers are typically equipped with independent oxygen supply, gas purification, power supply, and environmental monitoring facilities, and maintain information exchange with the mine surface or dispatch system through communication networks. In the context of multi-service integration in coal mines, underground refuge chambers serve as important communication terminal nodes, continuously generating various business data such as environmental monitoring, vital signs, control commands, and emergency voice messages, making them a key object for centralized carrying and unified management of multiple business functions.

[0025] Specifically, the scheduling cycle of the underground refuge chamber refers to the time interval divided by the network side for unified management of the communication behavior related to the underground refuge chamber. Within each scheduling cycle, the network equipment performs statistics and processing on the carrying status of the service flow at the same time scale. The service flow record refers to the record information of the data packet flow generated by the relevant terminals of the underground refuge chamber and transmitted through the communication network within the scheduling cycle, which is used to reflect the communication activities of the refuge chamber within that time interval.

[0026] Determine the physical bearer identifier corresponding to the scheduling cycle based on the business flow records; Specifically, after obtaining the service flow record corresponding to the scheduling period, the transmission link association information contained in all data packets in the service flow record is extracted, including the base station identifier, access gateway identifier, transmission port number, and link bandwidth configuration parameters traversed by the data packet transmission. This association information is matched field by field with the feature set of all communication bearer paths pre-stored on the network side. This feature set contains a unique combination of the base station identifier, access gateway identifier, transmission port number, and link bandwidth configuration corresponding to each communication bearer path. After matching the communication bearer path to which the service flow currently depends, the identifier generation module on the network side is called to generate a unique coded identifier data according to the physical topology location, link type, and deployment order of the communication bearer path. The encoding format uses a combination of numbers and letters, and the encoding length is adapted to the total number of underground communication bearer paths to ensure uniqueness. This identifier data is determined as the physical bearer identifier corresponding to the current scheduling period.

[0027] The physical bearer identifiers are recorded sequentially according to the scheduling cycle number to obtain the bearer sequence.

[0028] Specifically, all scheduling cycles associated with the underground refuge chamber are assigned consecutive and non-repeating sequence numbers. The sequence numbers are sequentially increased from the initial scheduling cycle according to the execution order of the scheduling cycles. After the physical bearer identifier corresponding to each scheduling cycle is determined, the sequence number of the scheduling cycle is bound to the corresponding physical bearer identifier. At the same time, the start time and end time of the scheduling cycle are added to the bound data. Then, all the bound data are arranged and integrated in the ascending order of the scheduling cycle sequence number to form a continuously recorded bearer sequence. This bearer sequence can fully reflect the switching of communication bearer paths and the usage time of the underground refuge chamber in multiple consecutive scheduling cycles.

[0029] Specifically, the physical bearer identifier refers to the identifier data generated and maintained by the communication network side, which uniquely identifies the actual communication bearer path to which the service flow currently depends. This communication bearer path corresponds to a specific data transmission channel or transmission link. The physical bearer identifier is used to distinguish different bearer paths and indicate which bearer path the service flow is transmitting through at the current moment, thereby providing a basis for the network side to identify the bearer, allocate resources, and schedule the service flow. The bearer sequence refers to the sequence data formed by continuously recording the physical bearer identifiers determined in each scheduling cycle according to the order of the scheduling cycle, which is used to reflect the changes in the communication bearer path of the underground refuge chamber over a period of time.

[0030] S2. Calculate the total bearer usage time based on the bearer sequence, and generate a set of participating bearers based on the total bearer usage time; In an embodiment of the present invention, the total bearer usage time is calculated based on the bearer sequence, and a set of participating bearers is generated based on the total bearer usage time, including: The observation period is determined based on the sequence range of the scheduling cycle. Specifically, the starting and ending values ​​of the scheduling cycle numbers used for statistical analysis are first obtained. All consecutive scheduling cycle numbers between the starting and ending values ​​are taken as the effective scheduling cycle set, and the set is arranged according to the chronological order of the scheduling cycles. Then, based on the actual occurrence order of each scheduling cycle number on the time axis, the starting time point covered by the effective scheduling cycle set is determined as the start time of the observation period, and the ending time point covered by the effective scheduling cycle set is determined as the end time of the observation period, thus forming a continuous and complete time interval as the observation period. This observation period can accurately include all scheduling cycles within the range of the scheduling cycle numbers, which is used for subsequent statistical processing of the bearer usage.

[0031] Specifically, the scheduling cycle number range refers to a set of consecutive scheduling cycle numbers used to define the time boundary of statistical analysis. This number range can be used to identify the time period that needs to be included in the statistical processing. The observation period refers to a continuous time interval corresponding to the scheduling cycle number range. This time interval contains several adjacent scheduling cycles and is used to perform centralized statistics on the carrying behavior.

[0032] Count the scheduling periods corresponding to the same physical bearer identifier in the bearer sequence to obtain the number of scheduling periods corresponding to the physical bearer identifier; Specifically, within a defined observation period, each record in the bearer sequence is read sequentially according to the order of scheduling cycles. The currently read physical bearer identifier is distinguished and categorized with the physical bearer identifiers in the previously read records. The scheduling cycles of the same physical bearer identifier are accumulated and recorded one by one. After traversing all bearer sequence records within the observation period, the cumulative number of scheduling cycles corresponding to each physical bearer identifier is summarized to obtain the number of scheduling cycles corresponding to each physical bearer identifier within the observation period, which is used to reflect the usage frequency of different physical bearers within the observation period.

[0033] Multiply the number of scheduling cycles corresponding to the physical bearer identifier by the duration of the scheduling cycle to obtain the bearer usage time corresponding to the physical bearer identifier; The total carrying time is obtained by summing the carrying time corresponding to all physical carrying identifiers.

[0034] Specifically, the number of scheduling cycles refers to the number of times a physical bearer identifier appears in the bearer sequence during the observation period. This number is used to characterize the frequency of use of the bearer during the observation period. The duration of the scheduling cycle refers to the length of time corresponding to a single scheduling cycle, used to convert the number of scheduling cycles into the actual length of time. The bearer usage time refers to the cumulative length of time a physical bearer identifier is used during the observation period, which is determined by the corresponding number of scheduling cycles and the duration of the scheduling cycle. The total bearer usage time refers to the total time obtained by summing the bearer usage times corresponding to all physical bearer identifiers during the same observation period, used to reflect the overall usage of all communication bearers in the underground refuge chamber during the observation period.

[0035] Specifically, the duration of a scheduling cycle represents the continuous time length occupied by a single scheduling cycle on the time axis, while the number of scheduling cycles corresponding to a physical bearer identifier represents the number of times that physical bearer is selected within the observation period. Since the usage duration of a physical bearer within each scheduling cycle is equal to the duration of that scheduling cycle, multiplying the number of scheduling cycles corresponding to a physical bearer identifier by the duration of the scheduling cycle yields the cumulative usage time of that physical bearer within the observation period. When the bearer usage time calculated for all physical bearer identifiers is summed, the usage time of each physical bearer constitutes a complete coverage of the observation period on the time axis, and the cumulative result is the total time length occupied by all physical bearers within the observation period, thus obtaining the total bearer usage time.

[0036] In an embodiment of the present invention, generating a set of participating bearers based on the total bearer usage time includes: Divide the bearer usage time corresponding to the physical bearer identifier by the total bearer usage time to obtain the bearer usage percentage corresponding to the physical bearer identifier. The physical bearer identifiers are filtered based on the comparison results of the bearer usage ratio and the value of 0 to obtain the set of bearers participating in the test.

[0037] Specifically, first, all physical bearer identifiers for which bearer usage percentage calculations have been completed within the observation period are collected. Then, a numerical comparison algorithm is used to compare the bearer usage percentage corresponding to each physical bearer identifier with zero, clearly identifying the categories of physical bearer identifiers with bearer usage percentages greater than zero and bearer usage percentages equal to zero. Physical bearer identifiers with bearer usage percentages greater than zero represent that the physical bearer has actual service flow transmission behavior within the observation period and is a valid communication bearer path, while physical bearer identifiers with bearer usage percentages equal to zero represent that the physical bearer has not had any service flow transmission behavior within the observation period and is an invalid communication bearer path. Subsequently, all physical bearer identifiers identified as having bearer usage percentages greater than zero are sorted according to their own encoding order, ensuring that the sorted physical bearer identifiers are unique and completely cover the identifiers corresponding to all valid communication bearer paths. The final ordered set containing all valid physical bearer identifiers is the participating bearer set.

[0038] Specifically, the bearer usage ratio refers to the proportion of bearer usage time corresponding to a certain physical bearer identifier in the total bearer usage time, which is used to characterize the relative usage degree of the physical bearer in all bearer behaviors; the participating bearer set refers to the set of physical bearer identifiers that have actually performed bearer usage behavior during the observation period. This set is obtained by comparing the bearer usage ratio with zero, and is used to represent all effective physical bearer paths that participated in the communication bearer of the underground refuge chamber during the observation period.

[0039] Specifically, within the observation period, the bearer usage time corresponding to each physical bearer identifier represents the cumulative duration of the actual communication participation of that bearer on the timeline. The total bearer usage time represents the total communication time covered by all physical bearers within the same observation period. Dividing the bearer usage time of a single physical bearer by the total bearer usage time yields the bearer usage percentage, which reflects the time share occupied by that physical bearer in the overall communication process. When the bearer usage percentage corresponding to a certain physical bearer identifier is greater than zero, it indicates that the physical bearer has been actually used to carry communication services for at least one scheduling cycle within the observation period and has truly participated in the communication process. Conversely, if the bearer usage percentage is equal to zero, it indicates that the physical bearer has not engaged in any bearer behavior within the entire observation period. Therefore, by comparing the bearer usage percentage with zero and filtering out physical bearer identifiers with a percentage greater than zero, the set of all physical bearer identifiers that have actually engaged in bearer behavior within the observation period can be accurately obtained. This set constitutes the participating bearer set.

[0040] Specifically, since underground refuge chambers may repeatedly switch between the main communication bearer and the emergency self-sustaining bearer after a disaster, the same batch of service flows may appear alternately on multiple physical bearer paths. If only a single bearer path is used as the resource allocation object, it is easy to cause insufficient resources when the service is migrated to another bearer because the corresponding slice resources are not configured. At the same time, the resources already configured on the original bearer will become idle due to the migration of services. Therefore, it is necessary to generate a set of participating bearers to identify all physical bearer identifiers that have actually carried the service flow of the refuge chamber during the observation period. By using this set, the scope of subsequent slice resource mirroring and allocation is limited, so that the resource allocation covers all effective bearer paths that may carry the service of the refuge chamber, avoids applying resource allocation to paths that have not carried any service, and reduces invalid configuration. At the same time, it provides a clear set of bearer objects for consistent resource allocation of multiple bearers under the condition of bearer migration.

[0041] Specifically, the situation where the originally configured resources become idle due to service migration refers to the situation where, after the services of a refuge chamber are migrated from one physical bearer path to another, the network side still reserves and maintains the corresponding slice resource configuration for the refuge chamber on the original physical bearer path. However, since there are no longer any service flows from the refuge chamber on that physical bearer path, these reserved communication resources are not actually occupied or utilized during subsequent scheduling and remain idle for a long time, resulting in network resources being continuously occupied without participating in actual service bearing.

[0042] S3. Calculate the total slice resource requirements corresponding to the logical access identifier in the underground refuge chamber; In an embodiment of the present invention, calculating the total slice resource requirement corresponding to the logical access identifier in the underground refuge chamber includes: Assign logical access identifiers to underground refuge chambers; Specifically, the physical location numbers, roadway ownership information, and associated communication equipment information of all underground refuge chambers are compiled. Based on the coding rules for network-side identifier allocation, identifier data is generated in the form of a combination of numbers and letters. This identifier data includes the coded roadway number of the area where the refuge chamber is located and the serial number information of the chamber itself. The generated identifier data is compared and verified one by one to ensure that there is no duplication or coding conflict in the identifier data corresponding to different refuge chambers. The verified identifier data is associated and stored with the physical location number, roadway ownership information, and communication equipment information of the corresponding refuge chamber. Finally, the associated identifier data is determined as the logical access identifier of the corresponding underground refuge chamber.

[0043] Write the business flow record into the logical identifier field; Specifically, a fixed-length data field is reserved in the data structure of the business flow record as a logical identifier field. The length of this field is consistent with the encoding length of the logical access identifier to ensure that all information of the logical access identifier can be fully carried. The logical access identifier that has been assigned to the target underground refuge chamber is retrieved, and the logical access identifier is entered into the reserved field corresponding to each business flow record belonging to the refuge chamber through the data writing unit. During the entry process, the encoding format of the logical access identifier is kept to match the data storage format of the reserved field to avoid format incompatibility.

[0044] The logical identifier field is assigned a value based on the logical access identifier; Specifically, the logical access identifiers already assigned to the target underground refuge chambers are retrieved. For each business flow record belonging to that refuge chamber, the logical access identifier is completely written into its corresponding logical identifier field. After writing, the logical identifier field of each business flow record is validated to confirm that the content of the logical access identifier is complete, without missing characters or errors. Through this writing and validation operation, a clear correspondence is established between each business flow record and its corresponding underground refuge chamber.

[0045] After the assignment process is completed, during the observation period, the business flow records are aggregated into a business flow set; Specifically, after the assignment process is completed, all business flow records generated during the observation period are continuously monitored. The logical access identifier carried in the logical identifier field of each business flow record is extracted. The business flow records are classified according to the content of the logical access identifier. All business flow records carrying the same logical access identifier are selected. These business flow records are arranged in order according to the corresponding scheduling cycle number and the order of the business flow sending time. The integrity of the arranged business flow records is checked to ensure that all business flow records carrying the logical access identifier during the observation period are included. The final ordered and complete set of data records is the business flow set.

[0046] Specifically, the logical access identifier refers to the identification data allocated by the network side to the underground refuge chamber to uniquely identify the refuge chamber at the logical level. This identifier is used to uniformly classify service flows scattered on different physical bearer paths into the same refuge chamber. The logical identifier field refers to the data field set in the service flow record to carry the logical access identifier, enabling the service flow to carry the identification information of its affiliated refuge chamber during transmission and processing. The assignment process refers to the process of writing the logical access identifier into the logical identifier field of the corresponding service flow record, thereby establishing a clear correspondence between the service flow and its affiliated underground refuge chamber. The service flow set refers to the data set formed by aggregating all service flow records carrying the same logical access identifier within the observation period after the assignment process is completed.

[0047] Statistical calculations are performed on the set of business flows to obtain the average business volume; Specifically, the data packet length information of all business flow records in the business flow set is extracted. For each business flow record, the lengths of all the data packets it contains are summed sequentially to obtain the amount of data generated by a single data packet during the observation period. After calculating the amount of data generated by a single data packet for all business flow records, the total amount of data generated by a single data packet during the observation period is obtained by summing up all the data generated by a single data packet. At the same time, the total number of business flow records in the business flow set is counted. The total amount of data generated by a single data packet is divided by the total number of business flow records. The result is the average amount of data generated by a single data packet. This average amount of data generated by a single data packet can accurately characterize the normal communication load level of the corresponding underground refuge chamber during the observation period.

[0048] Calculate the maximum value of the business flow set to obtain the maximum business volume; Specifically, the system retrieves the data volume corresponding to each business flow record in the business flow set, compares all data volumes one by one according to their numerical values, records the data volume with the larger value in each comparison, and continues to compare all data volumes until the data volume with the largest value is finally retained as the maximum business volume. This maximum business volume can accurately characterize the highest communication load that the corresponding underground refuge chamber may experience during the observation period.

[0049] The total slice resource requirement corresponding to the logical access identifier is calculated based on the average and maximum traffic volume.

[0050] In an embodiment of the present invention, the formula for calculating the total slice resource requirement is as follows: ; In the formula, This is the total slice resource requirement. This represents the average business volume, and 'a' is a preset proportional coefficient. That is the maximum business volume.

[0051] Specifically, the average traffic volume refers to the average value obtained by statistically analyzing the amount of data generated by each traffic flow in the traffic flow set during the observation period, which is used to characterize the normal communication load level of the underground refuge chamber within that time range; the maximum traffic volume refers to the maximum amount of data that occurs in the traffic flow set, which is used to characterize the highest possible communication load situation that the underground refuge chamber may experience during the observation period; the total slice resource requirement corresponding to the logical access identifier refers to the total communication resource requirement determined based on the average traffic volume and the maximum traffic volume, which is used to indicate the overall resource scale required to be met when configuring slice resources for the underground refuge chamber corresponding to the logical access identifier on the network side.

[0052] Specifically, the average traffic volume reflects the stable load level of communication activities in the underground refuge chamber during the observation period, while the maximum traffic volume reflects the instantaneous high load that may occur within the same period. In communication resource allocation, if the allocation is based solely on the average traffic volume, it will be unable to cover the resource demand during sudden increases in traffic. On the other hand, if the allocation is based entirely on the maximum traffic volume, resources will be idle most of the time. Therefore, by proportionally superimposing the average traffic volume and the maximum traffic volume, necessary resource reserves can be reserved for possible traffic peaks while ensuring that normal communication needs are met. The proportional coefficient is used to adjust the intensity of consideration for the impact of peak traffic. Thus, the calculated total slice resource demand can cover the continuous communication load of the underground refuge chamber and cope with high traffic situations that occur in a short period of time, which is in line with the basic principle of balancing stability and efficiency in communication resource allocation.

[0053] Specifically, the various services carried by the underground refuge chamber, including vital sign monitoring, control command transmission, environmental data acquisition, and emergency voice communication, were analyzed. Priorities were assigned based on the tolerance for transmission latency and the impact of data loss for each service. Vital sign monitoring and control command transmission were set as the highest priority, followed by environmental data acquisition and emergency voice communication services, ranked by urgency, then as ordinary priority. Service flow data sets corresponding to at least twenty observation periods within the past three months for the underground refuge chamber were selected. The candidate value range for the proportionality coefficient was set to 0.1 to 0.8, with multiple candidate values ​​selected at 0.1 intervals. For each candidate value, the average and maximum service volumes for the corresponding observation periods were considered. The simulated resource requirement configuration is obtained through the total slice resource requirement calculation formula. This configuration is then imported into the resource simulation module on the network side to test the packet loss rate and latency fluctuation of various services under this configuration. The focus is on verifying the transmission stability of the highest priority service under the scenario of maximum traffic volume. At the same time, the actual resource occupancy rate and idle ratio under this configuration are statistically analyzed. Candidate values ​​that can make the packet loss rate of the highest priority service less than one-thousandth, the latency fluctuation controlled within ten milliseconds, and the resource idle ratio not exceed twenty percent are selected. These candidate values ​​are determined as the preset ratio coefficient. If there are multiple candidate values ​​that meet the conditions, the candidate value with the lowest resource idle ratio is selected as the final preset ratio coefficient.

[0054] Specifically, during the post-disaster phase, underground refuge chambers may switch back and forth multiple times between the main mine communication bearer and the emergency self-sustaining communication bearer. This causes the service flow of the same refuge chamber to alternate on different physical bearer paths. The multi-service data flow of the same refuge chamber will migrate between multiple physical bearer paths, such as the main bearer and the emergency self-sustaining bearer. If the access point or a single bearer path is still used as the slice resource configuration object, it is easy to cause resource shortages due to the lack of corresponding slice resources on the new bearer path after the service migration. At the same time, the slice resources already configured on the original bearer path will become idle due to the service migration, resulting in resource mismatch and waste. Therefore, it is necessary to establish a bearer-independent logical access identifier with the underground refuge chamber as the entity object and calculate the total slice resource requirement corresponding to the logical access identifier to obtain a resource scale benchmark independent of the specific physical bearer. This will enable the subsequent allocation and mirroring of the resource scale benchmark on the participating bearer paths according to the bearer usage.

[0055] S4. Construct a configuration table based on the total slice resource requirements and the participating bearer set, and read the target table entry value; In an embodiment of the present invention, a configuration table is constructed based on the total slice resource requirements and the participating bearer set, including: For each physical bearer identifier in the participating bearer set, the total slice resource requirement is multiplied by the bearer usage ratio corresponding to the physical bearer identifier in the participating bearer set to obtain the resource allocation value; Specifically, the resource allocation value refers to the amount of slice resources that should be configured for a certain logical access identifier on a certain physical bearer path. It is determined by the total slice resource requirement corresponding to the logical access identifier and the bearer usage ratio of the physical bearer path. It is used to represent the scale of resources reserved or allocated for the service flow associated with the logical access identifier on the network device and bearer path corresponding to the physical bearer identifier.

[0056] Specifically, the process first retrieves all physical bearer identifiers included in the participating bearer set, and simultaneously obtains the total slice resource requirement for the corresponding logical access identifier, as well as the bearer usage percentage for each physical bearer identifier. It confirms that the total slice resource requirement is the overall resource scale calculated by combining the average and maximum traffic volumes, and the bearer usage percentage is the actual usage time percentage of the physical bearer during the observation period, with the sum of the bearer usage percentages of all physical bearer identifiers equal to one. Then, for each physical bearer identifier, the total slice resource requirement is multiplied by the bearer usage percentage corresponding to that physical bearer identifier. The result is the resource allocation value corresponding to that physical bearer identifier. The total slice resource requirement is the overall resource requirement scale corresponding to the logical access identifier, and the bearer usage percentage reflects the actual usage level of each physical bearer during the observation period. By multiplying the two, the resource allocation is adapted to the actual usage frequency of the physical bearers. Physical bearers with high usage percentages receive more resources to match their high-frequency bearer requirements, while physical bearers with low usage percentages receive a corresponding proportion of resources to avoid idleness. Simultaneously, the sum of the resource allocation values ​​of all physical bearers is consistent with the total slice resource requirement, ensuring that the resources of each bearer path can meet the transmission requirements of the corresponding service flow, and achieving accurate and efficient overall resource allocation.

[0057] Use the logical access identifier and the physical bearer identifier in the participating bearer set as index keys; Use the resource allocation value as the table entry value; The configuration table is constructed based on the index key and the table entry value.

[0058] Specifically, first, the logical access identifier of the corresponding underground refuge chamber and all physical bearer identifiers included in the participating bearer set are retrieved. Each physical bearer identifier is combined with the logical access identifier to form a unique index key. Each index key corresponds to a set of associations between logical access identifiers and physical bearer identifiers. Then, the resource allocation value corresponding to the physical bearer identifier in each index key is retrieved, and this resource allocation value is determined as the table entry value matching the corresponding index key. Subsequently, according to the rule of one-to-one correspondence between index keys and table entry values, all index keys and their corresponding table entry values ​​are arranged to form a column containing index keys and... The table is a two-dimensional data table of column values, which is the configuration table. The logical access identifier uniquely corresponds to the underground refuge chamber, and the physical bearer identifier uniquely corresponds to the communication bearer path. The combination of the two forms an index key, which can accurately locate the resource configuration scenario of a refuge chamber on a certain bearer path. The resource allocation value is the specific resource scale in this scenario. As a column value and bound to the index key, it can realize the accurate association between the scenario and the resource quantity. Building a configuration table based on the index key and column value standardizes and structures the scattered resource configuration relationship, which makes it easy for network-side devices to quickly query the resource allocation requirements of a refuge chamber on a certain bearer path.

[0059] Specifically, the index key refers to the identifier combination data used to locate the table entry in the configuration table. It is composed of a logical access identifier and a physical bearer identifier, and is used to uniquely identify the configuration object of a certain logical access object on a certain physical bearer path. The table entry value refers to the resource allocation value data stored corresponding to the index key, and is used to represent the slice resource configuration content corresponding to the index key. The configuration table refers to the data structure organized by the correspondence between index keys and table entry values. It is used to quickly obtain the corresponding resource allocation value based on the logical access identifier and the current physical bearer identifier in the subsequent business flow processing and to support slice resource configuration and scheduling.

[0060] In an embodiment of the present invention, reading the target entry value of the configuration table includes: Define the service flow record corresponding to the physical bearer identifier in the participating bearer set as the target service flow; Specifically, all physical bearer identifiers in the participating bearer set are retrieved, all business flow records collected during the observation period are extracted, and the information used to characterize the data packet flow bearer path in each business flow record is read one by one. This information is compared with each physical bearer identifier in the participating bearer set one by one. All records in the business flow record whose bearer path information matches a certain physical bearer identifier in the participating bearer set are selected. These selected business flow records are defined as target business flows. At the same time, the business flow records corresponding to each participating bearer identifier are checked to ensure that all business flow records matching the identifier are included in the scope of the target business flow without omission or misselection.

[0061] Specifically, the service flow record refers to the record information collected during the observation period that reflects the transmission behavior of data packet streams related to the underground refuge chamber. It includes at least information to characterize the object to which the data packet stream belongs and the bearer path. The target service flow refers to the service flow selected from the service flow record that corresponds to a physical bearer identifier in the participating bearer set, and is used as the processing object for subsequent slice resource scheduling and forwarding.

[0062] Identify the network device corresponding to the physical bearer identifier in the participating bearer set; Specifically, the deployment information of the physical bearer path corresponding to each physical bearer identifier in the participating bearer set is retrieved. This information includes the location, device model, communication interface configuration, and data processing function description of the forwarding nodes traversed by the bearer path. Based on this deployment information, the device located on the physical bearer path and responsible for forwarding and queuing the data packet stream passing through the path is identified. This device is determined as the network device corresponding to the physical bearer identifier. At the same time, it is verified whether the communication interface of the device matches the transmission parameters of the physical bearer path to ensure that the device can perform the corresponding processing operations on the service flow on the bearer path.

[0063] Generate the target index key; Specifically, network devices refer to data forwarding devices located on the physical bearer path, used to perform forwarding and queue scheduling processing on data packet streams passing through the physical bearer path; target index key refers to the identification combination data used to locate resource configuration records, which is composed of logical access identifier and the physical bearer identifier currently corresponding to the target service stream, used to uniquely determine the resource configuration object of the underground refuge chamber on the specified physical bearer path.

[0064] In an embodiment of the present invention, generating the target index key includes: When the target service flow arrives at the network device, the physical bearer information of the target service flow is parsed to obtain the physical bearer identifier of the target service flow; Specifically, when the target service flow arrives at the network device, the network device starts the data parsing unit to locate the bit area corresponding to the physical bearer information in the target service flow data. This area contains field content that represents the communication bearer path. According to the pre-stored physical bearer information encoding rules, the field data in this area is extracted. The extracted data is matched field by field with the pre-stored physical bearer identifier feature library. The feature library contains all field feature combinations corresponding to the legal physical bearer identifiers. After the valid features are confirmed, the obtained identifier data is the physical bearer identifier of the target service flow.

[0065] Read the target field value from the logical identifier field in the target business flow; Use the physical bearer identifier of the target service flow and the target field value corresponding to the target service flow as the target index key.

[0066] Specifically, physical bearer information parsing refers to the process of identifying and extracting the physical bearer information to obtain the physical bearer identifier. The physical bearer identifier of the target service flow refers to the identifier data used to distinguish different communication bearer paths; the target field value refers to the specific identifier data read from the logical identifier field; the target index key refers to the identifier combination data composed of the physical bearer identifier of the target service flow and the target field value, which is used to uniquely indicate the resource configuration object of the target service flow on the specified physical bearer path and serve as the location basis for subsequent lookup of resource allocation values.

[0067] Read the target entry value from the configuration table based on the target index key.

[0068] Specifically, when a target service flow arrives at the network device, the pre-written logical identifier field is first read from the target service flow to obtain the target field value used to identify the underground refuge chamber, thereby clarifying the logical access object to which the service flow belongs. Then, the forwarding path information of the target service flow is parsed to obtain the physical bearer identifier currently attached to the target service flow, thus determining the actual bearer path the service flow is traversing. Based on this, the physical bearer identifier and the target field value are concatenated according to a pre-determined combination rule to form a target index key that uniquely represents the resource configuration object of the service flow on the current physical bearer path. A matching query is performed in the constructed configuration table based on the target index key to read the target table entry value corresponding to the target index key, thereby obtaining the resource allocation result used to guide the slice resource scheduling and queue allocation of the target service flow.

[0069] S5. Schedule and forward the target business flow of the underground refuge chamber based on the target table value.

[0070] In embodiments of the present invention, scheduling and forwarding of target traffic flows in underground refuge chambers based on target entry values ​​includes: Obtain the queue resource capacity of each slice queue in the network device; Specifically, the process iterates through all the segmented queues within the network device corresponding to the target service flow, extracting the logical access identifier and physical bearer identifier combination information associated with each segmented queue. This combination information is used as the target index key and compared field by field with the index key entries in the pre-built configuration table. Once a matching entry is found, the target table entry value under that entry is read. Simultaneously, the average and maximum traffic volumes of the target service flow carried by each segmented queue are retrieved. Using this target table entry value as the core benchmark, the normal resource carrying capacity of the segmented queue is determined by combining the average traffic volume with the maximum traffic volume and the corresponding network device. The transmission priority of refuge chamber services is set, and additional redundant processing space is reserved to adapt to peak service loads. The resource allocation value corresponding to the target table entry value is converted into the scale of forwarding resources that can be provided per unit time, and at the same time, it is converted into the data processing capacity that the slice queue can carry. The converted values ​​are verified to confirm that they can both match the normal communication load requirements of the target service flow and cover the service processing requirements under instantaneous high load scenarios. The forwarding resource scale and data processing capacity determined in the unit time are the queue resource capacity of the corresponding slice queue. The queue resource capacity of each slice queue in the network device is obtained in this way.

[0071] Specifically, a slice queue refers to a data buffer queue set up inside a network device to carry specific slice service flows. Different slice queues correspond to different service scheduling and resource allocation objects. The queue resource capacity refers to the scale of forwarding resources or the data processing capacity that the slice queue can provide per unit time, which is used to characterize the upper limit of service load that the slice queue can support.

[0072] The target slice queue is obtained by filtering each slice queue based on the queue resource capacity and the target table entry value; Specifically, the target entry value corresponding to the target service flow is retrieved. This data represents the amount of slice resources that the target service flow should occupy on the current physical bearer path. At the same time, all slice queues that have been divided within the network device to which the target service flow belongs are extracted, and the queue resource capacity corresponding to each slice queue is obtained one by one. This capacity is the scale of forwarding resources or the data processing capacity that the slice queue can carry per unit time. Then, each slice queue is traversed, and its queue resource capacity is compared with the target entry value. Slice queues with queue resource capacity not less than the target entry value are selected as candidate slice queues to ensure that the queue can support the resource occupation requirements of the target service flow. Then, the numerical difference between the queue resource capacity and the target entry value of each candidate slice queue is calculated, and the candidate slice queue with the smallest difference is selected to achieve accurate resource matching and reduce the resource idle ratio. Next, the service association attributes of the candidate slice queue are checked to confirm that it has not established a dedicated bearer relationship with other logical access identifiers or physical bearer identifiers, and can only correspond to the logical access identifier and physical bearer identifier combination object associated with the current target service flow. Finally, the candidate slice queue that has been compared, filtered, calculated and verified is determined as the target slice queue.

[0073] Assign the target business flow to the target slice queue; Specifically, the system retrieves the physical bearer identifier and logical access identifier combination information contained in the target service flow, locates the identified target slice queue inside the network device, checks the current cache space free status of the target slice queue, confirms that its free resource capacity is not less than the target entry value corresponding to the target service flow, then adds an identifier tag unique to the target slice queue to the header of the data packet of the target service flow. This tag is completely consistent with the association information of the target slice queue. Then, the target service flow data packet carrying the identifier tag is written into the cache space of the target slice queue. At the same time, the unique association relationship between the target service flow and the target slice queue is recorded to ensure that subsequent data processing operations are only for the target service flow in this queue.

[0074] The target service flow is scheduled and forwarded in the target slice queue.

[0075] Specifically, the resource configuration rules corresponding to the target slice queue are read. These rules include the transmission priority of the underground refuge chamber services to which the target service flow belongs. Based on this priority, the dequeue order of the target service flow in the target slice queue is determined. Service flow data packets with higher transmission priority enter the scheduling sequence first. At the same time, based on the queue resource capacity of the target slice queue, the data packet dequeue rate per unit time is set to ensure that the rate does not exceed the processing capacity limit corresponding to the queue resource capacity. Then, the target service flow data packets are retrieved from the buffer space according to the set dequeue order and rate. The identification tag in the data packet header is checked to see if it matches the association relationship with the target slice queue. If the match is successful, the next-hop communication link interface corresponding to the target service flow is located, and the data packet is forwarded to the communication link corresponding to that interface. At the same time, the forwarding time and quantity information of the data packet are recorded, thereby completing the scheduling and forwarding processing of the target service flow in the target slice queue.

[0076] Specifically, the target entry value refers to the resource allocation result data read from the configuration table based on the target index key. This data represents the amount of slice resources that the target service flow should occupy on the current physical bearer path. The target slice queue refers to the slice queue used to carry the target service flow, selected from multiple slice queues of the network device based on the matching relationship between the queue resource capacity and the target entry value. Scheduling refers to the process by which the network device determines the dequeue order and dequeue rate of the target service flow according to the resource configuration rules corresponding to the slice queue. Forwarding refers to the process by which the network device outputs the data packets of the target service flow from the input port to the next-hop communication link, thereby realizing the orderly processing and transmission of the target service flow within the corresponding slice queue.

[0077] The above description is only a preferred embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any equivalent substitutions or modifications made by those skilled in the art within the scope of the technology disclosed in the present invention, based on the technical solution and inventive concept of the present invention, should be covered within the scope of protection of the present invention.

Claims

1. A method for dynamic allocation of network slice resources for multi-service convergence in coal mines, characterized in that, Includes the following steps: S1. Generate a carrying capacity sequence based on the scheduling cycle of the underground refuge chamber; S2. Calculate the total bearer usage time based on the bearer sequence, and generate a set of participating bearers based on the total bearer usage time; S3. Calculate the total slice resource requirements corresponding to the logical access identifier in the underground refuge chamber; S4. Construct a configuration table based on the total slice resource requirements and the participating bearer set, and read the target table entry value; S5. Schedule and forward the target business flow of the underground refuge chamber based on the target table value.

2. The method for dynamic allocation of network slice resources for multi-service convergence in coal mines according to claim 1, characterized in that, Based on the scheduling cycle of the underground refuge chamber, a carrying capacity sequence is generated, including: Set the scheduling cycle for underground refuge chambers; During each scheduling cycle of the underground refuge chamber, the business flow records of the underground refuge chamber are collected; Determine the physical bearer identifier corresponding to the scheduling cycle based on the business flow records; The physical bearer identifiers are recorded sequentially according to the scheduling cycle number to obtain the bearer sequence.

3. The method for dynamic allocation of network slice resources for multi-service convergence in coal mines according to claim 2, characterized in that, The total bearer usage time is calculated based on the bearer sequence, and a set of participating bearers is generated based on the total bearer usage time, including: The observation period is determined based on the sequence range of the scheduling cycle. Count the scheduling periods corresponding to the same physical bearer identifier in the bearer sequence to obtain the number of scheduling periods corresponding to the physical bearer identifier; Multiply the number of scheduling cycles corresponding to the physical bearer identifier by the duration of the scheduling cycle to obtain the bearer usage time corresponding to the physical bearer identifier; The total carrying time is obtained by summing the carrying time corresponding to all physical carrying identifiers.

4. The method for dynamic allocation of network slice resources for multi-service convergence in coal mines according to claim 3, characterized in that, A set of participating bearers is generated based on the total bearer usage time, including: Divide the bearer usage time corresponding to the physical bearer identifier by the total bearer usage time to obtain the bearer usage percentage corresponding to the physical bearer identifier. The physical bearer identifiers are filtered based on the comparison results between the bearer usage ratio and the value of 0, resulting in the set of bearers participating in the test.

5. The method for dynamic allocation of network slice resources for multi-service convergence in coal mines according to claim 4, characterized in that, Calculate the total slice resource requirements corresponding to the logical access identifiers in the underground refuge chamber, including: Assign logical access identifiers to underground refuge chambers; Write the business flow record into the logical identifier field; The logical identifier field is assigned a value based on the logical access identifier; After the assignment process is completed, during the observation period, the business flow records are aggregated into a business flow set; Statistical calculations are performed on the set of business flows to obtain the average business volume; Calculate the maximum value of the business flow set to obtain the maximum business volume; The total slice resource requirement corresponding to the logical access identifier is calculated based on the average and maximum traffic volume.

6. The method for dynamic allocation of network slice resources for multi-service convergence in coal mines according to claim 5, characterized in that, The formula for calculating the total slice resource requirement is as follows: ； In the formula, This is the total slice resource requirement. This represents the average business volume, and 'a' is a preset proportional coefficient. That is the maximum business volume.

7. The method for dynamic allocation of network slice resources for multi-service convergence in coal mines according to claim 5, characterized in that, A configuration table is constructed based on the total slice resource requirements and the participating host sets, including: For each physical bearer identifier in the participating bearer set, the total slice resource requirement is multiplied by the bearer usage ratio corresponding to the physical bearer identifier in the participating bearer set to obtain the resource allocation value; Use the logical access identifier and the physical bearer identifier in the participating bearer set as index keys; Use the resource allocation value as the table entry value; The configuration table is constructed based on the index key and the table entry value.

8. The method for dynamic allocation of network slice resources for multi-service convergence in coal mines according to claim 1, characterized in that, Read the target entry value from the configuration table, including: Define the service flow record corresponding to the physical bearer identifier in the participating bearer set as the target service flow; Identify the network device corresponding to the physical bearer identifier in the participating bearer set; Generate the target index key; Read the target entry value from the configuration table based on the target index key.

9. The method for dynamic allocation of network slice resources for multi-service convergence in coal mines according to claim 8, characterized in that, Generate the target index key, including: When the target service flow arrives at the network device, the physical bearer information of the target service flow is parsed to obtain the physical bearer identifier of the target service flow; Read the target field value from the logical identifier field in the target business flow; Use the physical bearer identifier of the target service flow and the target field value corresponding to the target service flow as the target index key.

10. The method for dynamic allocation of network slice resources for multi-service convergence in coal mines according to claim 8, characterized in that, The scheduling and forwarding of target traffic flows for underground refuge chambers are based on target entry values, including: Obtain the queue resource capacity of each slice queue in the network device; The target slice queue is obtained by filtering each slice queue based on the queue resource capacity and the target table entry value; Assign the target business flow to the target slice queue; The target service flow is scheduled and forwarded in the target slice queue.

Images