CN117939636A

CN117939636A - Resource management method and device of link layer, electronic equipment and storage medium

Info

Publication number: CN117939636A
Application number: CN202410067981.5A
Authority: CN
Inventors: 杜平; 徐晓帆; 孙建锋; 牛庆庆; 章跃跃; 周佳瑜
Original assignee: Shanghai Satellite Internet Research Institute Co ltd
Current assignee: Shanghai Satellite Internet Research Institute Co ltd
Priority date: 2024-01-16
Filing date: 2024-01-16
Publication date: 2024-04-26

Abstract

The application discloses a resource management method, a device, electronic equipment and a storage medium of a link layer, and belongs to the technical field of communication. Therefore, the resources of the link layer of the satellite network can be dynamically allocated, the characteristics of the dynamic property and the time variability of the satellite network are more met, and the resource allocation mode of the link layer is more reasonable.

Description

Resource management method and device of link layer, electronic equipment and storage medium

Technical Field

The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for managing resources of a link layer, an electronic device, and a storage medium.

Background

The network slicing technology essentially divides a physical network to form a plurality of logically independent virtual networks, namely network slices, and each network slice can be customized, configured and optimized according to indexes such as quality requirements, delay, throughput and the like.

The network slicing in the related art is based on a terrestrial network configuration and is end-to-end, i.e. network resources involved from physical layer, data link layer, network layer to application layer are coupled together to provide services for users. Because the ground network is relatively fixed and the network resources are relatively stable, the network resources corresponding to the network slices are relatively fixed basically. However, the dynamics and time-variability of the satellite network determine that the network resources that can be provided by the satellite network are dynamically variable, and it is difficult to guarantee that a relatively fixed network resource is provided for one network slice, which makes it difficult for the end-to-end network slice technique in the related art to be suitable for the satellite network.

Disclosure of Invention

The embodiment of the application provides a resource management method, a device, electronic equipment and a storage medium of a link layer, which are used for providing a resource management scheme of the link layer in a satellite network.

In a first aspect, an embodiment of the present application provides a method for resource management of a link layer, including:

When meeting the resource allocation conditions of a link layer of a satellite network, predicting the state of the link layer and the requirement of at least one link layer slice, wherein the state at least comprises the available resource sizes of a plurality of links;

allocating the available resources of the plurality of links to the at least one link layer slice based on the available resource size of the plurality of links and the demand of the at least one link layer slice;

And scheduling the data packet corresponding to the at least one link layer slice through the links based on the available resources allocated by the at least one link layer slice.

In some embodiments, predicting the state of the link layer comprises:

inputting at least one piece of information of the link layer into a first prediction model for evaluating the state of the link layer to obtain the state of the link layer, wherein the at least one piece of information comprises: spatial environment information, physical link information, and ephemeris information.

In some embodiments, predicting the need for the at least one link layer slice comprises:

Inputting at least one piece of information of the at least one link layer slice into a second prediction model for evaluating the requirement of the link layer slice, resulting in the requirement of the at least one link layer slice, the at least one piece of information comprising network traffic information.

In some embodiments, allocating the available resources of the plurality of links to the at least one link layer slice based on the available resource size of the plurality of links and the demand of the at least one link layer slice comprises:

The available resources of the plurality of links are allocated to the at least one link layer slice using a resource allocation policy selected from a set of resource allocation policies.

In some embodiments, the resource allocation policy set includes a priority allocation policy, a fair allocation policy and a mixed allocation policy, where the priority allocation policy refers to allocating according to a priority of each link layer slice from high to low, the fair allocation policy refers to allocating according to a random allocation sequence of each link layer slice, and the mixed allocation policy refers to allocating according to a priority of each link layer slice with priority from high to low, and then allocating according to a random allocation sequence of each link layer slice without priority.

In some embodiments, scheduling, by the plurality of links, the data packet corresponding to the at least one link layer slice based on the available resources allocated by the at least one link layer slice includes:

when the available resources of a link are allocated to at least two link layer slices, adding the data packets corresponding to the at least two link layer slices into a data packet queue of the link based on the available resources allocated by the at least two link layer slices and a scheduling strategy among the data packets selected from a scheduling strategy set;

And sequentially taking out the data packets from the data packet queue, and adding the data packets into a transmission queue of the link until the available resources of the link are insufficient or the data packet queue is empty, wherein the total size of the data packets which can be stored in the transmission queue is smaller than the total size of the data packets which can be stored in the data packet queue.

In some embodiments, the scheduling policy set includes a priority scheduling policy and a fair scheduling policy, where the priority scheduling policy refers to adding data packets corresponding to each link layer slice into the data packet queue according to a priority order of each link layer slice from high to low, and the fair scheduling policy refers to adding data packets corresponding to each link layer slice into the data packet queue according to an arrival order from early to late.

In some embodiments, the state further includes a transmission quality of the plurality of links, further comprising:

Selecting error correction codes for the at least one link layer slice based on the transmission quality of the plurality of links and the requirements of the at least one link layer slice, respectively;

And carrying out error correction coding on the data packet corresponding to the at least one link layer slice based on the error correction code.

In some embodiments, the resource allocation conditions include: and the resource allocation period reaches or receives the resource allocation instruction of the link layer.

In a second aspect, an embodiment of the present application provides a resource management device of a link layer, including:

the system comprises an evaluation module, a control module and a control module, wherein the evaluation module is used for predicting the state of a link layer and the requirement of at least one link layer slice when the resource allocation condition of the link layer of a satellite network is met, and the state at least comprises the available resource sizes of a plurality of links;

An allocation module for allocating the available resources of the plurality of links to the at least one link layer slice based on the available resource sizes of the plurality of links and the requirements of the at least one link layer slice;

And the scheduling module is used for scheduling the data packet corresponding to the at least one link layer slice through the links based on the available resources allocated by the at least one link layer slice.

In some embodiments, the assessment module is specifically configured to:

In some embodiments, the allocation module is specifically configured to:

In some embodiments, the scheduling module is specifically configured to:

In some embodiments, the apparatus further comprises an error correction module for:

In a third aspect, an embodiment of the present application provides a resource management device, including:

The dynamic prediction module is used for predicting the state of the link layer and the requirement of at least one link layer slice when the resource allocation condition of the link layer of the satellite network is met, wherein the state at least comprises the available resource sizes of a plurality of links;

a resource allocation module configured to allocate the available resources of the plurality of links to the at least one link layer slice based on the available resource sizes of the plurality of links and the requirements of the at least one link layer slice;

And the data packet scheduling module is used for scheduling the data packets corresponding to the at least one link layer slice through the links based on the available resources allocated by the at least one link layer slice.

In a fourth aspect, an embodiment of the present application provides an electronic device, including: at least one processor, and a memory communicatively coupled to the at least one processor, wherein:

The memory stores a computer program executable by at least one processor to enable the at least one processor to perform the above-described resource management method of the link layer.

In a fifth aspect, an embodiment of the present application provides a storage medium, where a computer program is executed by a processor of an electronic device, the electronic device being capable of executing the above-described resource management method of a link layer.

In the embodiment of the application, when the resource allocation condition of the link layer of the satellite network is satisfied, the state of the link layer and the requirement of at least one link layer slice are predicted, the state at least comprises the available resource sizes of a plurality of links, the available resources of the plurality of links are allocated to the at least one link layer slice based on the available resource sizes of the plurality of links and the requirement of the at least one link layer slice, and then the data packet corresponding to the at least one link layer slice is scheduled through the plurality of links based on the available resources allocated by the at least one link layer slice. Therefore, the resources of the link layer of the satellite network can be dynamically allocated, the characteristics of the dynamic property and the time variability of the satellite network are more met, and the resource allocation mode of the link layer is more reasonable.

Drawings

The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description serve to explain the application and do not constitute a limitation on the application. In the drawings:

Fig. 1 is a schematic structural diagram of a resource management scheme of a link layer according to an embodiment of the present application;

Fig. 2 is a schematic structural diagram of a resource management scheme of a link layer according to another embodiment of the present application;

Fig. 3 is a schematic diagram of a scheduling process of a data packet according to an embodiment of the present application;

Fig. 4 is a schematic diagram of a scheduling process of another data packet according to an embodiment of the present application;

fig. 5 is a flowchart of a method for managing resources of a link layer according to an embodiment of the present application;

Fig. 6 is a flowchart of a scheduling method of a data packet according to an embodiment of the present application;

Fig. 7 is a schematic structural diagram of a resource management device of a link layer according to an embodiment of the present application;

fig. 8 is a schematic structural diagram of a resource management device according to an embodiment of the present application;

fig. 9 is a schematic hardware structure of an electronic device for implementing a resource management method of a link layer according to an embodiment of the present application.

Detailed Description

In order to better manage resources of a link layer in a satellite network, an embodiment of the application provides a resource management method, a device, electronic equipment and a storage medium of the link layer.

The preferred embodiments of the present application will be described below with reference to the accompanying drawings of the specification, it being understood that the preferred embodiments described herein are for illustration and explanation only, and not for limitation of the present application, and embodiments of the present application and features of the embodiments may be combined with each other without conflict.

The particular physical environment and operating mechanisms of satellite networks often cause the available resources (e.g., link capacity, latency, etc.) and transmission quality of the links in the satellite network to fluctuate rapidly. While the link resource allocation and management methods of the terrestrial network in the related art are based on a relatively stable and predictable network environment, these methods do not perform well in dynamic and time-varying satellite networks.

Therefore, the embodiment of the application provides a resource management scheme for adapting to the resource change condition of a link layer. In the scheme, the self-adaptive estimation, distribution and scheduling of the link layer resources are realized by dynamically monitoring key indexes such as the link capacity, the transmission quality and the like of the link. Therefore, the real-time state of the satellite network can be captured more accurately, reasonable distribution and use of link layer resources are ensured, the overall network performance and reliability are improved, and the unique requirements and challenges of the satellite network are better met.

In addition, the link resources are allocated and managed through physical link information such as bandwidth, time slot and the like, the scheme not only can more effectively utilize and manage the link resources and meet diversified and dynamically-changed service requirements, but also can be used by a network layer and an application layer for further optimizing network management and service quality as a resource scheduling result of the link layer such as link capacity and the like.

Referring to fig. 1, fig. 1 is a schematic software structure diagram of a resource management scheme of a link layer according to an embodiment of the present application, which includes a link resource and demand assessment module, a dynamic resource allocation module, a packet scheduling module, and an error control module.

These modules are described separately below.

1. Link resources and demand assessment module.

And the link resource and demand evaluation module is used for evaluating the state of each link and the demand of each link layer slice, wherein the state of each link can comprise the size of available resources, such as link capacity, delay value and the like, and the transmission quality.

In some embodiments, the link resource and demand assessment module may be implemented by means of a predictive model. For example, a state prediction model is used to predict the future state of each link, where the input of the state prediction model may be state characterization data of the link in the past N periods, and the output is the state of the link in the next period, such as spatial environment information, physical link information, and ephemeris information. And the demand of each link layer slice is predicted by using a demand prediction model, wherein the input of the demand prediction model can be the demand representation data of the link layer slice in the past M periods, the demand representation data such as network traffic information, and the output is the demand of the link layer slice in the next period. In addition, both the state prediction model and the demand prediction model may be implemented using various machine learning algorithms. Wherein N and M are both positive integers, and the values of N and M may be the same or different.

The state of each link and the requirements of each link layer slice can be more accurately evaluated through the link resource and requirement evaluation module.

2. Dynamic resource allocation module.

And the dynamic resource allocation module is used for allocating the available resources of each link to different link layer slices based on the available resource size of each link and the requirements of each link layer slice output by the link resource and requirement evaluation module.

In the specific allocation, various resource allocation policies may be used, such as a priority allocation policy, a fairness allocation policy, a hybrid allocation policy considering priority and fairness, and the like. Wherein:

The priority allocation policy refers to allocation according to the order of the priority of each link layer slice from high to low. In some embodiments, the priority of each link layer slice may be determined according to the needs of each link layer slice, such as the higher the needs, the higher the priority of the link layer slice; in some embodiments, the priority of each link layer slice may be pre-specified by a technician according to the actual situation, which is not described herein.

The fair allocation policy refers to allocation according to a random manner of allocation sequence of each link layer slice, for example, to ensure fairness of allocation, each link layer slice may be randomly ordered, and then resource allocation is performed one by one according to the order.

The hybrid allocation strategy is to allocate the link layer slices with priority according to the order from high priority to low priority, and then allocate the link layer slices without priority according to the random mode of the allocation order. Here, there is a premise that there is a link layer slice with priority and a link layer slice with no priority, in which case the priority of the link layer slice may be added according to a preset rule.

The dynamic resource allocation module can realize higher resource utilization rate, avoid resource waste and ensure that the requirements of all link layer slices are met as much as possible.

3. And a data packet scheduling module.

And the data packet scheduling module is used for scheduling the data packets corresponding to the link layer slices. For example, the data packets are scheduled according to a priority scheduling policy, a fairness scheduling policy, or other policy to determine the transmission order of the data packets in the link.

The priority scheduling policy refers to adding the data packets corresponding to each link layer slice into the data packet queue according to the order of the priority of each link layer slice from high to low, so that the link layer slice requiring low delay can be given high priority to schedule the corresponding data packet preferentially.

The fair share scheduling is to add the data packets corresponding to each link layer slice into the data packet queue according to the order from the early to the late of the arrival order. In this way, fairness in scheduling can be ensured.

That is, the scheduling can be performed with priority and fairness, and the scheduling flexibility is good.

4. And an error control module.

And the error control module is used for being responsible for error control of the link layer and can provide customized error control strategies for each link layer slice.

Specifically, an error correction code is selected for each link layer slice based on the requirements of that link layer slice and the transmission quality of the links to which that link layer slice is allocated to the available resources.

The manner in which error correction codes are selected for link layer slices is illustrated below.

It is assumed that the set of available error correction codes is { error correction code 1, error correction code 2, error correction code 3, error correction code 4, error correction code 5}, wherein the larger the number, the stronger the error correction strength.

Assuming that the requirement of link layer slice 1 is an error rate of 1%, the available resources are allocated from links 1, 3, 7, and that the current error rate of link 1 is 3%, the error rate of link 3 is% 2, and the error rate of link 3 is 4%, error correction code 5 is selected for link layer slice 1. If the error rate of link 1 is 0.05%, the error rate of link 3 is 0.07, and the error rate of link 3 is 0.03% after a certain period of time, the error correction code of the link layer slice 1 is adjusted to be error correction code 1.

Assuming that the requirement of link layer slice 2 is 10% error rate and also that available resources are allocated from links 1, 3, 7, and that the current error rate of link 1 is 2%, the error rate of link 3 is 2%, and the error rate of link 3 is 3%, error correction code 1 is selected for link layer slice 1.

Therefore, error control of the link layer slice level is realized through the error control module, and the transmission accuracy of the inter-satellite laser link can be improved.

In the embodiment of the application, the link layer of the satellite network is divided into a plurality of link layer slices, the requirements of each link layer slice are dynamically predicted, the state of the link layer is dynamically predicted, the resources of the link layer can be distributed to the link layer slices by adopting a plurality of resource distribution strategies based on the prediction results of the link layer slice and the link layer slice, and the data packets corresponding to each link layer slice can be scheduled by adopting a plurality of scheduling strategies. The management and the scheduling of the link layer resources are finer, the dynamic change requirement of each link layer slice can be met, the utilization efficiency of the link layer resources is improved, and the resource waste and uneven allocation conditions are reduced. In addition, error correction can be performed on each link layer slice independently, error correction at the link layer slice level is performed, and the reliability of link transmission is relatively high.

The scheme of the embodiment of the application is described below by taking available resources as link capacity as an example.

Fig. 2 is a flow chart of a method for managing resources of a link layer according to an embodiment of the present application, which includes three parts, namely link capacity allocation, packet scheduling and error control.

These three parts are described separately below.

And (3) link capacity allocation, wherein each time the resource allocation condition of the link layer of the satellite network is met, the link capacity and the transmission quality of each link in the link layer can be predicted by using a resource prediction model, the demand of each link layer slice is predicted by using a demand prediction model, and then the link capacity of each link is allocated to each link layer slice based on the link capacity of each link and the demand of each link layer slice.

The resource allocation conditions include that the resource allocation period of the link layer arrives, the fluctuation range of the link capacity of the link layer reaches a preset range, and the like. And, when the allocation is carried out, the resource allocation strategy such as priority allocation strategy, fair allocation strategy and mixed allocation strategy can be supported, and when the allocation effect of one resource allocation strategy is bad, the allocation of another resource allocation strategy can be supported. That is, the different resource allocation policies may be switchable between.

In this way, the link capacity of each link and the demand of each link layer slice are dynamically predicted, and based on the prediction results of the two, a plurality of resource allocation strategies are adopted to allocate the link capacity meeting the demand of each link layer slice from each link, so that the link capacity allocated by each link layer slice can be changed along with the change of the link layer resources provided by the satellite network, the dynamic and time-varying characteristics of the satellite network are better met, and the allocation of the link layer resources is finer, therefore, the allocation of the link layer resources in the satellite network is more reasonable.

For each link, the data packets corresponding to the link layer slices distributed from the link to the link capacity need to be transmitted from the link, in order to better meet the requirements of each link layer slice, the scheduling strategies among the data packets transmitted from the link are supported, for example, the scheduling strategies among a plurality of data packets such as priority scheduling strategies, fair scheduling strategies and the like are preset, the scheduling strategies among the data packets corresponding to the link are selected by technicians, and then the transmission sequence of each data packet corresponding to each link layer slice is arranged according to the selected scheduling strategies and the available resources distributed from the link by each link layer slice.

The scheduling procedure is illustrated by way of example below.

It is assumed that the link capacity of a certain link is 10G, and the link capacity of 3G is allocated to the link layer slice 1, the link capacity of 3G is allocated to the link layer slice 2,4G, and the link capacity is allocated to the link layer slice 3. In practical applications, the link layer slice 1, the link layer slice 2 and the link layer slice 3 allocated from the link to the link capacity are all data packets of the service carried by the link, and when the ratio of the data packet sizes corresponding to the link layer slice 1, the link layer slice 2 and the link layer slice 3 transmitted through the link is controlled to be 3:3:4, the 10G capacity of the link is allocated to the link layer slice 1, the link layer slice 2 and the link layer slice 3 according to the ratio of 3G, 3G and 4G.

It should be noted that, because the number and the size of the data packets corresponding to different link layer slices within the same time period, for example, 100 ms, may not ensure that the ratio of the sizes of the data packets corresponding to the link layer slice 1, the link layer slice 2, and the link layer slice 3 transmitted through the link is 3:3:4 by one transmission, and therefore, the ratio of the sizes of the data packets corresponding to the link layer slice 1, the link layer slice 2, and the link layer slice 3 transmitted through the link may be brought close to 3:3:4 by multiple transmissions. The specific proximity accuracy may be determined by a skilled person according to actual requirements or experience, and will not be described in detail herein. Subsequently, the ratio of the sizes of the data packets respectively corresponding to the link layer slice 1, the link layer slice 2 and the link layer slice 3 transmitted through the link is regarded as a transmission period for multiple transmissions reaching 3:3:4.

Assuming that the timing periods of the link layer slice 1, the link layer slice 2 and the link layer slice 3 are the same, the data packet of the link layer slice 1 to be transmitted by the link is: packet 1 and packet 4, and the packets of the link layer slice 2 include: packet 2, packet 5, packet 7, the packets of link layer slice 3 have: packet 3 and packet 6, and the arrival order is packet 1 to packet 7.

Further assume that in the ith transmission period, the link capacity allocated to the link layer slice 2 has not been allocated to all of the packets corresponding to the link layer slice 2, the link capacity allocated to the link layer slice 1 has been allocated to all of the packets corresponding to the link layer slice 1, and the link capacity allocated to the link layer slice 3 has also been allocated to all of the packets corresponding to the link layer slice 1.

It should be noted that, the link capacity allocated to one link layer slice in one transmission period may be regarded as the total size of the data packets corresponding to the link layer slice that can be transmitted in one transmission period is 1G, and if the link capacity allocated to the link layer slice in one transmission period is not yet fully allocated to the data packets corresponding to the link layer slice, the total size of the data packets corresponding to the link layer slice that is scheduled to be transmitted in the transmission period is not yet 1G, and the link capacity allocated to the link layer slice in one transmission period is fully allocated to the data packets corresponding to the link layer slice, which means that the total size of the data packets corresponding to the link layer slice that is scheduled to be transmitted in the transmission period is 1G.

In some embodiments, the scheduling policy between the packets corresponding to the link is: the scheduling is performed according to the order of the priority of the link layer slices from high to low, and the priorities of the link layer slice 1, the link layer slice 3 and the link layer slice 2 are sequentially reduced.

Referring to fig. 3, fig. 3 is a schematic diagram of a scheduling process of a data packet according to an embodiment of the present application. Since the link capacity allocated to the link layer slice 2 is not all allocated to the data packet corresponding to the link layer slice 2 in the ith transmission period, the data packet 2 that has been newly arrived at the link layer slice 2 may be placed in the data packet queue corresponding to the link, so that the data packet 2 consumes the link capacity allocated to the link layer slice 2 in the ith transmission period.

Assuming that packet 2 just consumed the link capacity allocated to link layer slice 2 in the ith transmission period, packets for each link layer slice in the (i+1) th transmission period may be rearranged. Specifically, according to the slice priority, firstly adding the data packet 1 and the data packet 4 corresponding to the link layer slice 1 into a data packet queue, then adding the data packet 3 and the data packet 6 corresponding to the link layer slice 3 into the data packet queue, and finally adding the data packet 5 and the data packet 7 corresponding to the link layer slice 2 into the data packet queue. Finally, the packets in the packet queue can be seen in fig. 3.

Here, it is assumed that the link capacity allocated to the link layer slice 1 in the i+1th transmission period is not allocated to the packet 1 and the packet 4, the link capacity allocated to the link layer slice 3 in the i+1th transmission period is not allocated to the packet 3 and the packet 6, and the link capacity allocated to the link layer slice 2 in the i+1th transmission period is not allocated to the packet 5 and the packet 7.

In this way, the sequence of the data packets corresponding to one link layer slice in the data packet queue corresponding to the link is determined by the link capacity allocated to the link layer slice and the priority of the link layer slice, so that the capacity allocation condition of each link layer slice can be considered, the priority of the link layer slice can be considered, and the flexibility is good.

In the process of scheduling the data packets, the data packets can be sequentially taken out of the data packet queue and put into the transmission queue, wherein the data packet 2 and the data packet in front of the data packet 2 (occupying the link capacity of the link in the ith transmission period) are taken out of the data packet queue and put into the transmission queue, after the data packet in the transmission queue is sent out through the link, the data packet 1, the data packet 4, the data packet 3, the data packet 6, the data packet 5 and the data packet 7 (occupying the link capacity of the link in the (i+1) th transmission period) are taken out of the data packet queue and put into the transmission queue, and then the data packet in the transmission queue is continuously sent through the link. The total size of the data packets which can be stored in the transmission queue is smaller than that of the data packets which can be stored in the data packet queue, so that the data packet queue can be used as a data packet queuing area and a buffer area of the transmission queue, and the link transmission speed and the link transmission quality can be better considered.

In some embodiments, the scheduling policy between the packets corresponding to the link is: and fairly scheduling the data packets, namely, the data packets which arrive first are sent first and the data packets which arrive later are sent later.

Referring to fig. 4, fig. 4 is a schematic diagram illustrating a scheduling process of a data packet according to another embodiment of the present application. Since the link capacity allocated to the link layer slice 2 is not all allocated to the data packet corresponding to the link layer slice 2 in the ith transmission period, the data packet 2 that has been newly arrived at the link layer slice 2 may be placed in the data packet queue corresponding to the link, so that the data packet 2 consumes the link capacity allocated to the link layer slice 2 in the ith transmission period.

Assuming that packet 2 just consumed the link capacity allocated to link layer slice 2 in the ith transmission period, packets for each link layer slice in the (i+1) th transmission period may be rearranged. Specifically, the data packet 1, the data packet 3, the data packet 4, the data packet 5, the data packet 6 and the data packet 7 are sequentially added into the data packet queue according to the reaching order. Finally, the packets in the packet queue can be seen in fig. 4.

Here, it is still assumed that the link layer slice 1 is allocated link capacity in the i+1th transmission period, the link layer slice 3 is allocated link capacity in the i+1th transmission period, and the link layer slice 2 is allocated link capacity in the i+1th transmission period, the link layer slice 1 is allocated link capacity in the i+1 th transmission period, and the link layer slice 2 is allocated link capacity in the i+1 th transmission period.

In this way, the sequence of the data packet corresponding to one link layer slice in the data packet queue corresponding to the link is determined by the link capacity allocated to the link layer slice and the arrival sequence of the data packet, so that the capacity allocation condition of each link layer slice can be considered, the fairness of the link layer slice can be considered, and the flexibility is good.

In the process of scheduling the data packets, the data packets can be sequentially taken out of the data packet queue and put into the transmission queue, wherein the data packet 2 and the data packet in front of the data packet 2 (occupying the link capacity of the link in the ith transmission period) are taken out of the data packet queue and put into the transmission queue, after the data packet in the transmission queue is sent out through the link, the data packet 1, the data packet 3, the data packet 4, the data packet 5, the data packet 6 and the data packet 7 (occupying the link capacity of the link in the (i+1) th transmission period) are taken out of the data packet queue and put into the transmission queue, and then the data packet in the transmission queue is continuously sent through the link. Similarly, the total size of packets storable in the transmission queue is less than the total size of packets storable in the packet queue.

Error control, based on the transmission quality of each link predicted by the resource prediction model and the requirement of each link layer slice, error correction codes can be selected for each link layer slice, and then error correction codes corresponding to each link layer slice are utilized to perform error correction coding on the data packet corresponding to the link layer slice.

The following describes embodiments of the present application with reference to specific examples.

1. Link capacity allocation.

1) And (5) inputting.

Link set: l= { L1, L2, …, ln }, where each link Li has its specific link capacity, 1+.i+.n, n representing the total number of links.

Link layer slice set: s= { S1, S2, …, sm }, each link layer slice Sj has its specific capacity requirement, 1.ltoreq.j.ltoreq.m, m representing the total number of link layer slices.

Link-slice allocation matrix: a, wherein Aij denotes the link capacity allocated by link Li to link layer slice Sj.

2) Capacity prediction of links and demand prediction of link layer slices.

The future capacity size of the link Li is predicted using the historical capacity data of the link Li and a machine learning method (e.g., time series analysis, neural network, etc.), and the future capacity demand of the link layer slice Sj is predicted using the historical capacity data of the link layer slice Sj and a machine learning method (e.g., time series analysis, neural network, etc.).

3) Link capacity allocation.

The goal is to meet the capacity requirements of all link layer slices while maximizing the efficiency of use of each link.

The method can be realized by the following steps:

3-a) initializing.

The allocation matrix a is initialized to a zero matrix.

3-B) an allocation algorithm.

Searching for a suitable link: based on the selected resource allocation policy, links are found that can meet the future capacity requirements of the link layer slice Sj. Among them, the resource allocation policy is such as priority allocation policy, fairness allocation policy, hybrid allocation policy, etc.

Distribution capacity: the required capacity is allocated from the link Li to the link layer slice Sj and recorded in the allocation matrix a.

Updating the link state: the capacity allocated to the link layer slice Sj is subtracted from the remaining capacity of the link Li.

3-C) checking and adjusting.

Checking whether the capacity requirements of all the link layer slices are met, and if so, further optimizing the allocation matrix A by an optimization algorithm such as simulated annealing, genetic algorithm and the like to find a better allocation scheme.

4) And outputting.

Link capacity allocation matrix: A.

2. And (5) scheduling data packets.

1) And (5) inputting.

Packet queues corresponding to link Li: q= { P1, P2, …, ps }, where each packet Pk corresponds to a link layer slice and has a specific priority, size and destination, 1+.k+.s, s representing the total number of packets.

Scheduling policy set: the link layer slices allocated to the link capacity from the link Li may be scheduled according to the order of the priority of each link layer slice from high to low, or may be scheduled according to the fairness principle that the data packets corresponding to each link layer slice are sent first to last.

Link capacity: the currently available link capacity of the link Li.

2) And (5) sequencing the data packets.

And adding the data packets corresponding to each link layer slice into a data packet queue Q corresponding to the link Li according to the link capacity allocated from the link Li by each link layer slice in the link capacity allocation matrix A and the selected scheduling strategy. For example:

Priority scheduling: for each link layer slice allocated from link Li to link capacity, the data packets corresponding to each link layer slice are added to the data packet queue Q according to the size of each link layer slice allocated from link Li to link capacity and the priority of each link layer slice. This process is illustrated in fig. 3 and will not be described in detail herein.

Fair scheduling: for each link layer slice allocated from link Li to link capacity, the data packets corresponding to each link layer slice are added to the data packet queue Q according to the order in which each link layer slice is allocated from link Li to link capacity and the data packet arrival order. This process is illustrated in fig. 4 and will not be described in detail herein.

3) And preparing data packet transmission.

3-A) initialization

The transmit queue T is initialized to empty.

3-B) Transmission preparation procedure

Checking the link capacity: the currently available link capacity of the link Li is determined.

Selecting a data packet: one of the packets Pi is selected from the packet queue Q in order.

Added to the transmit queue: the data packet Pi is added to the transmission queue T.

Updating link capacity: the size of the packet Pi is subtracted from the link capacity.

The process is repeated: the selection of packets continues until the available link capacity of the link Li is exhausted or the packet queue Q is empty.

4) And outputting.

Data packet transmission queues: t.

3. Error control.

1) And (5) inputting.

Transmission quality: the current transmission rate, error rate, etc. of each link.

Demand: the current requirements of each link layer slice, such as minimum throughput, maximum delay, etc., need to be met.

A set of available error correction codes: a set of available error correction codes, each having different error correction capabilities and complexities.

2) Link layer slice level error control.

2-A) analyzing the link state.

Based on the requirements of each link layer slice and the transmission quality of the link to which this link layer slice is assigned to capacity, the possible error rates and link transmission performance are evaluated.

2-B) selecting an appropriate error correction code.

An appropriate error correction code is selected for this link layer slice from the set of available error correction codes based on the error rate and link transmission performance.

2-C) the encoding side applies the selected error correction code.

For each link for which the link layer slice is allocated capacity, the transmitted data packet corresponding to the link layer slice is error correction coded using the error correction code selected for the link layer slice.

2-D) receiving end operation.

The receiving end decodes the received data packet using the same error correction code and performs necessary error detection and correction.

Fig. 5 is a flowchart of a method for managing resources of a link layer according to an embodiment of the present application, where the method includes the following steps.

In step 501, when resource allocation conditions of a link layer of a satellite network are met, a state of the link layer and a requirement of at least one link layer slice are predicted, wherein the state comprises available resource sizes and transmission quality of a plurality of links.

The resource allocation conditions include that a resource allocation period arrives, a resource allocation instruction of a link layer is received, and the like, and the resource allocation period is 1 hour, half an hour, half a day, and the like, and the resource allocation instruction can be sent by the network controller.

In some embodiments, when predicting the state of the link layer, the spatial environment information, the physical link information and the ephemeris information of each link may be input into a first prediction model (i.e. the state prediction model) to obtain the state of the link, where the first prediction model is obtained by learning the association relationship between the spatial environment information, the physical link information and the ephemeris information of each link sample and the state of each link sample.

In some embodiments, when predicting the requirement of each link layer slice, the network traffic information of each link layer slice may be input into a second prediction model (i.e. the requirement prediction model) to obtain the requirement of the link layer slice, where the second prediction model is obtained by learning the association relationship between the network traffic information of each link layer slice sample and the requirement. And, the requirements of one link layer slice may include at least one of bandwidth requirements, latency requirements, error rate requirements, packet loss rate requirements, jitter requirements, and the like.

In step 502, the available resources of the plurality of links are allocated to the at least one link layer slice based on the available resource sizes of the plurality of links and the demand of the at least one link layer slice.

In particular implementations, the available resources of the plurality of links may be allocated to the at least one link layer slice using a resource allocation policy selected from the set of resource allocation policies until the requirements of all link layer slices are met or the remaining available resources of the plurality of links are of a size that fails to meet the requirements of any one link layer slice.

The resource allocation policy set comprises a priority allocation policy, a fairness allocation policy and a mixed allocation policy, wherein the priority allocation policy refers to allocation according to the order of the priority of each link layer slice from high to low, the fairness allocation policy refers to allocation according to the random mode of the allocation order of each link layer slice, and the mixed allocation policy refers to allocation of each link layer slice with priority according to the order of the priority from high to low, and then allocation of each link layer slice without priority according to the random mode of the allocation order.

Therefore, a plurality of resource allocation strategies are provided for technicians to select, the flexibility is good, and the resource allocation effect is improved.

In step 503, the data packet corresponding to the at least one link layer slice is scheduled over a plurality of links based on the available resources allocated by the at least one link layer slice.

In specific implementation, the packet scheduling may be performed according to the flow shown in fig. 6, where the flow includes the following steps:

in step 5031, when the available resources of a link are allocated to at least two link layer slices, the packets corresponding to the at least two link layer slices are added to the packet queue of the link based on the available resources allocated by the at least two link layer slices and the scheduling policy between the packets selected from the set of scheduling policies.

In general, each link layer slice allocated from a link to an available resource occupies a proportion of the available resource of the link (determined by the available resource allocated by each link layer slice), and for this purpose, the time when each link layer slice occupies a corresponding proportion of the available resource of the link can be regarded as a transmission period.

In practical applications, the arrival amounts of the packets of each link layer slice allocated from one link to the available resources may be different, and more packets of some link layer slices may arrive, and less packets of other link layer slices may arrive, so that the available resources allocated from the link to some link layer slices in one transmission period may not be fully allocated to the packets corresponding to the link layer slices.

Therefore, if the available resources allocated from the link by any link layer slice in the previous transmission period are not all allocated to the data packet corresponding to the link layer slice, the data packet newly arrived by the link layer slice can be added into the data packet queue corresponding to the link until the added data packet allocates the available resources allocated from the link by the link layer slice in the previous transmission period.

And then, when determining that the available resources allocated from the link to each link layer slice in the previous transmission period are allocated, adding the newly arrived data packet of each link layer slice into a data packet queue based on the selected scheduling strategy among the data packets.

For example, the newly arrived packets of each link layer slice are added to the packet queue in the order of the priority of the link layer slice from high to low, and for example, the newly arrived packets of each link layer slice are added to the packet queue in the order of the arrival order from early to late.

The total resource size of the data packet added to the data packet queue by each link layer slice is not larger than the available resource size of the link layer slice allocated from the link in the current transmission period. That is, when more newly arrived packets of a link layer slice exceed the size of the available resources allocated from the link by the link layer slice in the current transmission period, the later arrived packets cannot be allocated to the resources allocated from the link by the link layer slice in the current transmission period, and the resources allocated from the link by the link layer slice in the next transmission period need to be allocated.

Therefore, various data packet scheduling strategies can be adopted to schedule the data packets corresponding to the link layer slices, and scheduling flexibility is good.

In step 5032, packets are sequentially removed from the packet queue and added to the transmission queue of the link until the available resources of the link are insufficient or the packet queue is empty, wherein the total size of packets that can be stored in the transmission queue is smaller than the total size of packets that can be stored in the packet queue.

In this way, the sequence of the data packets corresponding to each link layer slice is arranged in the data packet queue, and the data packets are transmitted by means of the transmission queue with smaller data inclusion than the data packet queue, so that the data packets can be better scheduled.

In step 504, error correction codes are respectively selected for the at least one link layer slice based on the transmission quality of the plurality of links and the requirements of the at least one link layer slice.

Wherein the transmission quality of each link, such as error rate, transmission performance, etc.

In general, for each link layer slice, an error-correction code may be selected for that link layer slice based on the needs of that link layer slice and the link quality of the links that the link layer slice allocates to the available resources.

In step 505, error correction encoding is performed for the data packet corresponding to the at least one link layer slice based on the error correction code.

That is, the data packet corresponding to each link layer slice is error correction coded using the error correction code selected for that link layer slice.

The steps 504 and 505 may be performed before the data packet is transmitted. And then, sending the data packet through each link.

In the embodiment of the application, the link layer of the satellite network is divided into a plurality of link layer slices, the requirements of each link layer slice are dynamically predicted, the state of the link layer is dynamically predicted, the resources of the link layer can be distributed to the link layer slices by adopting a plurality of resource distribution strategies based on the requirements of each link layer slice and the state of the link layer, and the data packets corresponding to each link layer slice can be scheduled by adopting a plurality of scheduling strategies. The management and the scheduling of the link layer resources are finer, the dynamic change requirement of each link layer slice can be met, the utilization efficiency of the link layer resources is improved, and the resource waste and uneven allocation conditions are reduced. In addition, error correction can be performed on each link layer slice independently, error correction at the link layer slice level is performed, and the reliability of link transmission is relatively high.

Based on the same technical concept, the embodiment of the application also provides a resource management device of a link layer, and the principle of solving the problem of the resource management device of the link layer is similar to that of the resource management method of the link layer, so that the implementation of the resource management device of the link layer can be referred to the implementation of the resource management method of the link layer, and the repetition is omitted.

Fig. 7 is a schematic structural diagram of a resource management device of a link layer according to an embodiment of the present application, including:

an evaluation module 701, configured to predict a state of a link layer of a satellite network and a requirement of at least one link layer slice when a resource allocation condition of the link layer is satisfied, where the state includes at least available resource sizes of a plurality of links;

An allocation module 702, configured to allocate the available resources of the plurality of links to the at least one link layer slice based on the available resource sizes of the plurality of links and the requirements of the at least one link layer slice;

A scheduling module 703, configured to schedule, based on the available resources allocated by the at least one link layer slice, a data packet corresponding to the at least one link layer slice through the multiple links.

In some embodiments, the evaluation module 701 is specifically configured to:

In some embodiments, the allocation module 702 is specifically configured to:

In some embodiments, the scheduling module 703 is specifically configured to:

In some embodiments, an error correction module 704 is further included for:

The division of the modules in the embodiments of the present application is schematically only one logic function division, and there may be another division manner in actual implementation, and in addition, each functional module in each embodiment of the present application may be integrated in one processor, or may exist separately and physically, or two or more modules may be integrated in one module. The coupling of the individual modules to each other may be achieved by means of interfaces which are typically electrical communication interfaces, but it is not excluded that they may be mechanical interfaces or other forms of interfaces. Thus, the modules illustrated as separate components may or may not be physically separate, may be located in one place, or may be distributed in different locations on the same or different devices. The integrated modules may be implemented in hardware or in software functional modules.

Fig. 8 is a schematic structural diagram of a resource management device of a link layer according to an embodiment of the present application, including:

A dynamic prediction module 801, configured to predict a state of a link layer and a requirement of at least one link layer slice when a resource allocation condition of the link layer of a satellite network is satisfied, where the state includes at least available resource sizes of a plurality of links;

a resource allocation module 802 configured to allocate the available resources of the plurality of links to the at least one link layer slice based on the available resource sizes of the plurality of links and the requirements of the at least one link layer slice;

And a packet scheduling module 803, configured to schedule, based on the available resources allocated by the at least one link layer slice, a packet corresponding to the at least one link layer slice through the multiple links.

In some embodiments, the dynamic prediction module 801 includes a resource prediction unit 8011 configured to:

In some embodiments, the dynamic prediction module 801 includes a demand prediction unit 8012 configured to:

In some embodiments, the resource allocation module 802 includes:

An allocation policy selection unit 8021 for selecting a resource allocation policy from the resource allocation policy set in response to an allocation policy selection operation;

an allocation unit 8022, configured to allocate the available resources of the plurality of links to the at least one link layer slice using a resource allocation policy selected from the set of resource allocation policies.

In some embodiments, the packet scheduling module 803 includes:

A scheduling policy selection unit 8031 for selecting a scheduling policy among data packets from the scheduling policy set in response to a policy selection operation;

A packet sequence arrangement unit 8032, configured to, when an available resource of a link is allocated to at least two link layer slices, add, to a packet queue of the link, a packet corresponding to the at least two link layer slices based on the available resource allocated by the at least two link layer slices and a scheduling policy between packets selected from the set of scheduling policies; and sequentially taking out the data packets from the data packet queue, and adding the data packets into a transmission queue of the link until the available resources of the link are insufficient or the data packet queue is empty, wherein the total size of the data packets which can be stored in the transmission queue is smaller than the total size of the data packets which can be stored in the data packet queue.

In some embodiments, the status further includes transmission quality of the plurality of links, and further includes an error control module 804 for:

and carrying out error correction processing on the data packet corresponding to the at least one link layer slice based on the transmission quality of the links and the requirement of the at least one link layer slice.

In some embodiments, the error control module 804 includes:

An error control policy customizing unit 8041, configured to customize error control policies for the at least one link layer slice based on transmission quality of the plurality of links and requirements of the at least one link layer slice, respectively;

An error correction unit 8042, configured to perform error correction encoding on the data packet corresponding to the at least one link layer slice based on the error control policy.

Having described the resource management method, apparatus and device of the link layer of an exemplary embodiment of the present application, next, an electronic device according to another exemplary embodiment of the present application is described.

An electronic device 130 implemented according to such an embodiment of the present application is described below with reference to fig. 9. The electronic device 130 shown in fig. 9 is merely an example, and should not be construed as limiting the functionality and scope of use of embodiments of the present application.

As shown in fig. 9, the electronic device 130 is embodied in the form of a general-purpose electronic device. Components of electronic device 130 may include, but are not limited to: the at least one processor 131, the at least one memory 132, and a bus 133 connecting the various system components, including the memory 132 and the processor 131.

Bus 133 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, a processor, and a local bus using any of a variety of bus architectures.

Memory 132 may include readable media in the form of volatile memory such as Random Access Memory (RAM) 1321 and/or cache memory 1322, and may further include Read Only Memory (ROM) 1323.

Memory 132 may also include a program/utility 1325 having a set (at least one) of program modules 1324, such program modules 1324 include, but are not limited to: an operating system, one or more application programs, other program modules, and program data, each or some combination of which may include an implementation of a network environment.

The electronic device 130 may also communicate with one or more external devices 134 (e.g., keyboard, pointing device, etc.), one or more devices that enable a user to interact with the electronic device 130, and/or any device (e.g., router, modem, etc.) that enables the electronic device 130 to communicate with one or more other electronic devices. Such communication may occur through an input/output (I/O) interface 135. Also, electronic device 130 may communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the Internet, through network adapter 136. As shown, network adapter 136 communicates with other modules for electronic device 130 over bus 133. It should be appreciated that although not shown, other hardware and/or software modules may be used in connection with electronic device 130, including, but not limited to: microcode, device drivers, redundant processors, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.

In an exemplary embodiment, a storage medium is also provided, which when a computer program in the storage medium is executed by a processor of an electronic device, the electronic device is capable of executing the above-described resource management method of the link layer. Alternatively, the storage medium may be a non-transitory computer readable storage medium, which may be, for example, ROM, random Access Memory (RAM), CD-ROM, magnetic tape, floppy disk, optical data storage device, and the like.

In an exemplary embodiment, the electronic device of the present application may include at least one processor, and a memory communicatively connected to the at least one processor, where the memory stores a computer program executable by the at least one processor, and the computer program when executed by the at least one processor causes the at least one processor to perform the steps of any of the link layer resource management methods provided by the embodiments of the present application.

In an exemplary embodiment, a computer program product is also provided, which, when executed by an electronic device, is capable of carrying out any one of the exemplary methods provided by the application.

Also, a computer program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium can be, for example, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium would include the following: an electrical connection having one or more wires, a portable disk, a hard disk, a RAM, a ROM, an erasable programmable read-Only Memory (EPROM), flash Memory, optical fiber, compact disc read-Only Memory (Compact Disk Read Only Memory, CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

The program product for link layer resource management in embodiments of the present application may take the form of a CD-ROM and include program code that can run on a computing device. However, the program product of the present application is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

The readable signal medium may include a data signal propagated in baseband or as part of a carrier wave with readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, radio Frequency (RF), etc., or any suitable combination of the foregoing.

Program code for carrying out operations of the present application may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind of network, such as a local area network (Local Area Network, LAN) or wide area network (Wide Area Network, WAN), or may be connected to an external computing device (e.g., connected over the internet using an internet service provider).

It should be noted that although several units or sub-units of the apparatus are mentioned in the above detailed description, such a division is merely exemplary and not mandatory. Indeed, the features and functions of two or more of the elements described above may be embodied in one element in accordance with embodiments of the present application. Conversely, the features and functions of one unit described above may be further divided into a plurality of units to be embodied.

Furthermore, although the operations of the methods of the present application are depicted in the drawings in a particular order, this is not required or suggested that these operations must be performed in this particular order or that all of the illustrated operations must be performed in order to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step to perform, and/or one step decomposed into multiple steps to perform.

It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

While preferred embodiments of the present application have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiments and all such alterations and modifications as fall within the scope of the application.

It will be apparent to those skilled in the art that various modifications and variations can be made to the present application without departing from the spirit or scope of the application. Thus, the present application also includes such modifications and variations provided they come within the scope of the claims and their equivalents.

Claims

1. A method for resource management of a link layer, comprising:

2. The method of claim 1, wherein predicting the state of the link layer comprises:

3. The method of claim 1, wherein predicting the demand of the at least one link layer slice comprises:

4. A method according to any of claims 1-3, wherein allocating the available resources of the plurality of links to the at least one link layer slice based on the available resource size of the plurality of links and the demand of the at least one link layer slice comprises:

5. The method of claim 4, wherein the set of resource allocation policies includes a priority allocation policy, a fair allocation policy and a hybrid allocation policy, wherein the priority allocation policy refers to allocating according to a priority of each link layer slice from high to low, the fair allocation policy refers to allocating according to an allocation order of each link layer slice randomly, and the hybrid allocation policy refers to allocating according to a priority of each link layer slice with priority from high to low, and then allocating according to an allocation order randomly for each link layer slice without priority.

6. A method according to any of claims 1-3, wherein scheduling data packets corresponding to the at least one link layer slice over the plurality of links based on the available resources allocated by the at least one link layer slice comprises:

7. The method of claim 6, wherein the set of scheduling policies includes a priority scheduling policy and a fair scheduling policy, wherein the priority scheduling policy refers to adding packets corresponding to each link layer slice to the packet queue in order of higher priority to lower priority of each link layer slice, and the fair scheduling policy refers to adding packets corresponding to each link layer slice to the packet queue in order of early to late arrival.

8. The method of claim 1, wherein the status further comprises transmission quality of the plurality of links, further comprising:

9. The method of claim 1, wherein the resource allocation condition comprises: and the resource allocation period reaches or receives the resource allocation instruction of the link layer.

10. A resource management apparatus of a link layer, comprising:

11. A resource management device of a link layer, comprising:

12. The apparatus of claim 11, wherein the dynamic prediction module comprises a resource prediction unit to:

13. The apparatus of claim 11, wherein the dynamic prediction module comprises a demand prediction unit to:

14. The apparatus of any of claims 11-13, wherein the resource allocation module comprises:

An allocation policy selection unit configured to select a resource allocation policy from a resource allocation policy set in response to an allocation policy selection operation;

An allocation unit for allocating the available resources of the plurality of links to the at least one link layer slice using a resource allocation policy selected from the set of resource allocation policies.

15. The apparatus of claim 14, wherein the set of resource allocation policies includes a priority allocation policy, a fair allocation policy, and a hybrid allocation policy, wherein the priority allocation policy refers to allocating according to a priority of each link layer slice from high to low, the fair allocation policy refers to allocating according to an allocation order of each link layer slice randomly, and the hybrid allocation policy refers to allocating according to a priority of each link layer slice with priority from high to low first, and then allocating according to an allocation order randomly for each link layer slice without priority.

16. The apparatus of any of claims 11-13, wherein the packet scheduling module comprises:

A scheduling policy selection unit for selecting a scheduling policy among the data packets from the scheduling policy set in response to a scheduling policy selection operation;

a data packet sequence arrangement unit, configured to, when an available resource of a link is allocated to at least two link layer slices, add data packets corresponding to the at least two link layer slices to a data packet queue of the link based on the available resource allocated by the at least two link layer slices and a scheduling policy between data packets selected from the scheduling policy set; and sequentially taking out the data packets from the data packet queue, and adding the data packets into a transmission queue of the link until the available resources of the link are insufficient or the data packet queue is empty, wherein the total size of the data packets which can be stored in the transmission queue is smaller than the total size of the data packets which can be stored in the data packet queue.

17. The apparatus of claim 16, wherein the set of scheduling policies includes a priority scheduling policy and a fair scheduling policy, wherein the priority scheduling policy refers to adding packets corresponding to each link layer slice to the packet queue in order of priority of each link layer slice from high to low, and the fair scheduling policy refers to adding packets corresponding to each link layer slice to the packet queue in order of arrival from early to late.

18. The apparatus of claim 11, wherein the status further comprises a transmission quality of the plurality of links, further comprising an error control module to:

19. The apparatus of claim 18, wherein the error control module comprises:

An error control policy customizing unit, configured to customize error control policies for the at least one link layer slice based on transmission quality of the plurality of links and requirements of the at least one link layer slice, respectively;

And the error correction unit is used for carrying out error correction coding on the data packet corresponding to the at least one link layer slice based on the error control strategy.

20. The apparatus of claim 11, wherein the resource allocation condition comprises: the resource allocation conditions include: and the resource allocation period reaches or receives the resource allocation instruction of the link layer.

21. An electronic device, comprising: at least one processor, and a memory communicatively coupled to the at least one processor, wherein:

The memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-9.

22. A storage medium, characterized in that a computer program in the storage medium, when executed by a processor of an electronic device, is capable of performing the method of any of claims 1-9.