[go: up one dir, main page]

AU2021104939A4 - Method and device for allocating resources - Google Patents

Method and device for allocating resources Download PDF

Info

Publication number
AU2021104939A4
AU2021104939A4 AU2021104939A AU2021104939A AU2021104939A4 AU 2021104939 A4 AU2021104939 A4 AU 2021104939A4 AU 2021104939 A AU2021104939 A AU 2021104939A AU 2021104939 A AU2021104939 A AU 2021104939A AU 2021104939 A4 AU2021104939 A4 AU 2021104939A4
Authority
AU
Australia
Prior art keywords
uplink
downlink
residual
links
traffic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
AU2021104939A
Inventor
Xinyi He
Lin Li
Yikai Liu
Wei Wang
Xiaosong YU
Jie Zhang
Yongli Zhao
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Posts and Telecommunications
Original Assignee
Beijing University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing University of Posts and Telecommunications filed Critical Beijing University of Posts and Telecommunications
Application granted granted Critical
Publication of AU2021104939A4 publication Critical patent/AU2021104939A4/en
Ceased legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/04—Large scale networks; Deep hierarchical networks
    • H04W84/06—Airborne or Satellite Networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Astronomy & Astrophysics (AREA)
  • General Physics & Mathematics (AREA)
  • Radio Relay Systems (AREA)

Abstract

Disclosed are a method and a device of satellite service resource allocation. The method may include: obtaining uplink service traffic to be transmitted arriving at an uplink target gateway station; determining links connecting the uplink target gateway station and a downlink feed satellite; constructing an uplink residual resource matrix based on the links and uplink residual resources of the links; determining at least one uplink service path from the uplink target gateway station to the downlink feed satellite according to the links; determining residual resources corresponding to the at least one uplink service path based on the uplink residual resource matrix; and performing resource allocation for the uplink service traffic according to the residual resources corresponding to the at least one uplink service path. Allocating resources according to the corresponding residual resource matrix can utilize resources between nodes effectively. In this way, service transmission efficiency can be improved and service accumulations can be reduced. 1/6 100 obtaining uplink service traffic to be transmitted arriving at an uplink target gateway station 200 determining links from the uplink target gateway station to a downlink feed satellite according to topology information of the satellite communication system 3 00 constructing an uplink residual resource matrix based on the links and uplink residual resources of the links 400 UtemliIng at least upIInk serVice paI frm thme Upli1N target gateVaV station to the downlink feed satellite according to the links 500 determining residual resources corresponding to the at least one uplink service path based on the uplink residual resource matrix 600 performing a resource allocation for the uplink service traffic according to the residual resources corresponding to the at least one uplink service path Fig. 1 1100 |obtaining downlink service traffic to be transmitted arriving at a downlink feed satellite 1200 determining links from the downlink feed satellite to a downlink target gateway station according to topology information of the satellite communication system 1300 constructing a downlink residual resource matrix based on the links and downlink residual resources of the links 1 1400 [determining at least one downlink service path from the downlink feed satellite to the downlink target gateway station according to the links 1500 Sdetermining residual resources corresponding to the at least one downlink service path based on the downlink residual resource matrix 1600 performing a resource allocation for the downlink service traffic according to the residual resources corresponding to the at least one downlink service path Fig. 2

Description

1/6
100
obtaining uplink service traffic to be transmitted arriving at an uplink target gateway station 200 determining links from the uplink target gateway station to a downlink feed satellite according to topology information of the satellite communication system 3 00 constructing an uplink residual resource matrix based on the links and uplink residual resources of the links 400
UtemliIng at least upIInk serVice paI frm thme Upli1N target gateVaV
station to the downlink feed satellite according to the links 500
determining residual resources corresponding to the at least one uplink service path based on the uplink residual resource matrix 600
performing a resource allocation for the uplink service traffic according to the residual resources corresponding to the at least one uplink service path
Fig. 1 1100 |obtaining downlink service traffic to be transmitted arriving at a downlink feed satellite 1200 determining links from the downlink feed satellite to a downlink target gateway station according to topology information of the satellite communication system 1300
constructing a downlink residual resource matrix based on the links and downlink residual resources of the links
[determining 1 1400
at least one downlink service path from the downlink feed satellite to the downlink target gateway station according to the links 1500
Sdetermining residual resources corresponding to the at least one downlink service path based on the downlink residual resource matrix 1600 performing a resource allocation for the downlink service traffic according to the residual resources corresponding to the at least one downlink service path
Fig. 2
METHOD AND DEVICE FOR ALLOCATING RESOURCES TECHNICAL FIELD
[0001] The present disclosure relates to satellite data transmission, and more particularly, to a
method and a device for allocating resources.
BACKGROUND
[0002] Satellite communications are an indispensable part in constructions of a celestial
integration information network, and will play an important role in information technology,
space science exploration and national defense security. Satellite networks have a global
visibility and bandwidth allocation capabilities, and can carry voices, data, videos and
broadband multimedia services. The rapid developments of these services result in a rapid
growth in data traffic. Higher requirements are put forward for the bandwidth utilization of
inter-satellite links or satellite-ground links in satellite networking.
[0003] When many types of service requests are to be forwarded by a satellite network, the
satellite network will face a demand of service aggregation and traffic proliferation. Moreover,
service accumulation may be caused by limited satellite-ground bandwidth resources. Existing
service transmission schemes only consider service transmission with sufficient bandwidth
resources. This scheme is inefficient and cannot make full use of satellite network resources.
SUMMARY
[0004] In view of the above, the present disclosure provides methods for allocating resources.
[0005] According to some examples of the present disclosure, the method for allocating
uplink resources may include: obtaining uplink service traffic to be transmitted arriving at an
uplink target gateway station; determining links from the uplink target gateway station to a
downlink feed satellite according to topology information of the satellite communication
system; constructing an uplink residual resource matrix based on the links and uplink residual
resources of the links; determining at least one uplink service path from the uplink target
gateway station to the downlink feed satellite according to the links; determining residual resources corresponding to the at least one uplink service path based on the uplink residual resource matrix; and performing a resource allocation for the uplink service traffic according to the residual resources corresponding to the at least one uplink service path.
[0006] According to some other examples of the present disclosure, the method for allocating
downlink resources may include: obtaining downlink service traffic to be transmitted arriving at
a downlink feed satellite; determining links from the downlink feed satellite to a downlink
target gateway station according to topology information of the satellite communication system;
constructing a downlink residual resource matrix based on the links and downlink residual
resources of the links; determining at least one downlink service path from the downlink feed
satellite to the downlink target gateway station according to the links; determining residual
resources corresponding to the at least one downlink service path based on the downlink
residual resource matrix; and performing a resource allocation for the downlink service traffic
according to the residual resources corresponding to the at least one downlink service path.
[0007] Based on the above methods, the present disclosure further provides an electronic
device. The electronic device may include a memory, a processor and a computer program
stored on the memory and executable on the processor, which when executed performs any of
the methods.
[0008] It can be seen from the above description that the method and the electronic device
provided can construct an uplink residual resource matrix according to uplink residual resources
of links or a downlink residual resource matrix according to downlink residual resources of
links. Moreover, resources allocation for an uplink service traffic or a downlink service traffic
can be performed directly according to the uplink residual resource matrix or the downlink
residual resource matrix. In this way, resources between various nodes in a satellite
communication system can be effectively used, and transmission efficiency of a service traffic
can also be improved. Further, remaining resources can be effectively used and traffic
accumulation can be reduced.
BRIEF DESCRIPTION OF DRAWINGS
[0009] In order to explain one or more examples of the present disclosure more clearly,
accompanying drawings illustrating examples of the present disclosure are briefly introduced.
Obviously, the accompanying drawings are only one or more examples of the present disclosure. Those of ordinary skill in the art may further obtain other accompanying drawings based on these accompanying drawings without paying any creative work.
[0010] Fig. 1 is a flowchart of a method for allocating uplink resources according to some examples of the present disclosure.
[0011] Fig. 2 is a flowchart of a method for allocating downlink resources according to some other examples of the present disclosure.
[0012] Fig. 3 is a schematic diagram illustrating a method for constructing an uplink residual resource matrix according to an example of the present disclosure.
[0013] Fig. 4 is a schematic diagram illustrating a method for transmitting service traffic with a same quality of service (QoS) priority according to some examples of the present disclosure.
[0014] Fig. 5 is a schematic diagram illustrating a method for transmitting service traffic with different QoS priority according to some examples of the present disclosure.
[0015] Fig. 6A is a schematic diagram illustrating a transmission path of path 1 according to an example of the present disclosure.
[0016] Fig. 6B is a schematic diagram illustrating a transmission path of path 2 according to an example of the present disclosure.
[0017] Fig. 6C is a schematic diagram illustrating a transmission path of path 3 according to an example of the present disclosure.
[0018] Fig. 7 is a schematic diagram illustrating a path sequence according to an example of the present disclosure.
[0019] Fig. 8 is a schematic diagram illustrating a method of path selection and a method for updating uplink residual resource matrix according to some examples of the present disclosure.
[0020] Fig. 9 is a schematic diagram illustrating an updated path sequence according to an example of the present disclosure.
[0021] Fig. 10 is a flowchart of a method for allocating downlink resources according to some examples of the present disclosure.
[0022] Fig. 11 is a schematic diagram illustrating a device for allocating uplink resources according to some examples of the present disclosure.
[0023] Fig. 12 is a schematic diagram illustrating a device for allocating downlink resources according to some other examples of the present disclosure.
[0024] Fig. 13 is a schematic diagram illustrating a structure of an electronic device according
to some examples of the present disclosure.
DETAILED DESCRIPTION OF THE EXAMPLES
[0025] In order to make objectives, technical solutions, and advantages of the present
disclosure clearer, the present disclosure will be further described in detail with reference to
specific examples described below together with the accompanying drawings.
[0026] It should be noted that, unless otherwise defined, the technical terms or scientific terms
used in one or more examples of the present disclosure should have the ordinary meanings
understood by persons with ordinary skills in the art. The terms "first", "second" and the like
used in one or more examples of the present disclosure do not indicate any order, quantity or
importance, but are only used for distinguishing different constituent components. The terms
''comprising" or "containing" and the like mean that the element or object appearing in front of
the term covers the elements or objects and their equivalents listed after the term, without
excluding other elements or objects. The terms such as "connection" or "connected" and the
like are not limited to physical or mechanical connections, but may comprise electrical
connections, regardless of direct connection or indirect connection. The terms "up", "down",
"left", "right" and the like are only used for indicating the relative position relationship. When
the absolute position of the described object changes, the relative position relationship may also
change accordingly.
[0027] The present disclosure provides a method for allocating uplink resources. As illustrated
in Fig. 1, the method may include:
[0028] In block 100, obtaining uplink service traffic to be transmitted arriving at an uplink
target gateway station.
[0029] In this block, each time window of the uplink target gateway station belongs to an
asymmetric time window. Uplink service traffic transmission requests may arrive within the
corresponding time window uniformly. When a time window is switched, the transmission of
the uplink service traffic may be interrupted.
[0030] In block 200, determining links from the uplink target gateway station to a downlink feed satellite according to topology information of the satellite communication system.
[0031] According to some examples of the present disclosure, both the uplink target gateway
station and the downlink feed satellite are called nodes of the satellite communication system.
[0032] In block 300, constructing an uplink residual resource matrix based on the links and
uplink residual resources of the links.
[0033] In block 400, determining at least one uplink service path from the uplink target
gateway station to the downlink feed satellite according to the links.
[0034] In block 500, determining residual resources corresponding to the at least one uplink
service path based on the uplink residual resource matrix.
[0035] In block 600, performing a resource allocation for the uplink service traffic according
to the residual resources corresponding to the at least one uplink service path.
[0036] In the above-mentioned steps, the topology information of the satellite communication
system may be obtained at an initial moment of the time window of the uplink target gateway
station. Moreover, links connecting the uplink target gateway station and the downlink feed
satellite can also be obtained via the topology information. Further, an uplink residual resource
matrix may be generated according to residual resources of the links between nodes and a
position and a corresponding sequence number of each node.
[0037] Then, n uplink service paths from the uplink target gateway station to the downlink
feed satellite may be determined. Moreover, a minimum residual resource among residual
resources of the links consisting an uplink service path may be determined as the residual
resource of the uplink service path. Later on, resources may be allocated for the uplink service
traffic according to the residual resource of the uplink service path.
[0038] By means of the above-mentioned technical solution, an uplink residual resource
matrix or a downlink residual resource matrix may be constructed according to residual
resources of links. Moreover, resources allocation for an uplink service traffic or a downlink
service traffic can be performed directly according to the uplink residual resource matrix or the
downlink residual resource matrix. In this way, resources between various nodes in a network
can be effectively used, and transmission efficiency of a service traffic can also be improved.
Further, remaining resources can be effectively used and traffic accumulation can be reduced.
[0039] According to some examples of the present disclosure, the method for constructing an uplink residual resource matrix may include the following steps.
[0040] In step A, determining transmission data of the links in a current time window.
[0041] In step B, calculating uplink residual resources of the links according to the transmission data.
[0042] In step C, constructing the uplink residual resource matrix based on the links and the uplink residual resources of the links.
[0043] According to some examples of the present disclosure, the method for determining transmission data of the links in a current time window may include the following steps.
[0044] In step Al, determining a remaining time t and a transmission rate v of the current time window of each link.
[0045] In step A2, determining a residual bandwidth b of each link.
[0046] According to some examples of the present disclosure, the method for calculating uplink residual resources of the links according to the transmission data may include the following step A3.
[0047] In step A3, calculating an uplink remaining resource of a link according to a formula min(t x v, b).
[0048] In the above-mentioned steps, the remaining time of the time window, the transmission rate and the residual bandwidth are taken into account comprehensively to measure the uplink residual resources during traffic transmission. Moreover, an uplink residual resource matrix is constructed based on the uplink residual resources of the links. It can be seen that link resources can be utilized efficiently. At the same time, interruptions of traffic transmission can be greatly avoided.
[0049] Through the above-mentioned technical solution, the uplink residual resource matrix constructed can not only reflect connections between nodes, but also reflect residual resources of the links between the nodes. Furthermore, the residual resources of the links can be quickly learnt according to the uplink residual resource matrix. Therefore, fast resource allocation can be performed for service traffic. In this way, both congestions of traffic transmission and service accumulations can be avoided.
[0050] In some examples of the present disclosure, the above-mentioned block 400 may specifically include: using a KSP (K-shortest paths) algorithm to find at least one uplink service path from the uplink target gateway station to the downlink feed satellite; and storing the at least one uplink service path into an uplink path sequence.
[0051] In some examples of the present disclosure, with respect to an uplink service path in
the uplink path sequence, the above-mentioned block 500 may specifically include the
following steps.
[0052] Instep 510, determining links consisted in the uplink service path.
[0053] In step 520, determining an uplink residual resource corresponding to each of the links
consisted in the uplink service path from the uplink residual resource matrix.
[0054] In step 530, determining a minimum uplink residual resource among uplink residual
resources corresponding to the links as the residual resource corresponding to the uplink service
path.
[0055] In some examples of the present disclosure, the above-mentioned block 600 may
specifically include the following steps.
[0056] In step 610, ranking the at least one uplink service path in an ascending order
according to the residual resources corresponding to the at least one uplink service path.
[0057] In step 620, deleting the uplink service path with a zero-residual resource.
[0058] In step 630, performing the resource allocation for the uplink service traffic according
to the residual resources corresponding to the at least one uplink service path based on the order
of the at least one uplink service path.
[0059] It can be seen from the above methods, the KSP algorithm is used to find k shortest
paths from the uplink target gateway station to the downlink feeder satellite. To be noted, the
value of k is limited by a service tolerance delay (generally, k takes 3-4). Then the k paths are
placed into an uplink service path sequence and ordered (from small to large) according to their
residual resources.
[0060] Then, a first path is selected from the uplink service path sequence. If there is a link
with a zero-residual resource in the path, the path is removed. The above operation of selecting
a path is repeated until there is no link with a zero-residual resource in the path. The paths
remained in the uplink service path sequence may be used to transmit the uplink service traffic.
[0061] It can be seen that, through the above-mentioned scheme, uplink service paths capable
of transmitting service traffic can be found using a KSP algorithm accurately and quickly.
Moreover, paths with no remaining resources can be deleted, so that the service traffic can be rapidly transmitted using the uplink service path.
[0062] In the related arts, there is no efficient service resource allocation method in a satellite laser network, which results in a low service transmission efficiency and a low link utilization. In addition, most of the traffic resource allocation methods do not consider the problems of inconsistent uplink and downlink time windows and the traffic allocation brought by dynamic satellite switching, so it is difficult to achieve efficient and reliable traffic transmission. Since the network topology of a satellite changes periodically with time, the satellite's satellite-ground link is continuously dismantled with the movement of the satellite, and the resource allocation method in the related art cannot adapt to satisfy the dynamics of the satellite. Therefore, the service transmission rate and link utilization of satellite network service transmission are low.
[0063] In some examples of the present disclosure, the uplink service traffic to be transmitted may include: current uplink service traffic to be transmitted in the current time window of the uplink target gateway station, and/or remaining uplink service traffic to be transmitted in a last time window of the uplink target gateway station.
[0064] In some examples of the present disclosure, the above-mentioned block 630 may specifically include the following steps.
[0065] In step 631, determining a corresponding priority for the current uplink service traffic and/or the remaining uplink service traffic.
[0066] In step 632, selecting a target uplink service path from the uplink path sequence according to the order.
[0067] In step 633, allocating the residual resource corresponding to the target uplink service path for the current uplink service traffic and/or the remaining uplink service traffic according to the corresponding priority.
[0068] In step 634, in response to determining the residual resource of the target uplink service path becomes to 0, deleting the target uplink service path from the uplink path sequence, and updating the uplink residual resources matrix.
[0069] Further, after step 634, in response to determining that there is still some uplink traffic in the current window and/or the remaining uplink service traffic left, the following steps would be performed.
[0070] Instep 6341, selecting another target uplink service path from the uplink path sequence according to the order.
[0071] Instep 6342, allocating the residual resource corresponding to the target uplink service path for the uplink service traffic to be transmitted in the current window and/or the remaining uplink service traffic to be transmitted in a last time window according to the corresponding priority.
[0072] In step 6343, in response to determining the residual resource of the target uplink service path becomes to 0, deleting the target uplink service path from the uplink path sequence, and updating the uplink residual resources matrix; and
[0073] In step 6344, repeating this process until there is no uplink service path in the uplink path sequence or there is no uplink traffic in the current window and/or the remaining uplink service traffic left.
[0074] It can be seen that by setting a priority for the uplink service traffic to be transmitted, resources can be allocated according to the priority. That is, service traffic with a high priority would be transmitted first, and then service traffic with a low priority can be transmitted. In this way, service traffic which needs to be transmitted preferentially can get resources in time and the quality of service can be improved.
[0075] In some examples of the present disclosure, the above-mentioned block 631 may specifically include the following steps.
[0076] In step 6311, setting a first distribution priority corresponding to the remaining uplink service traffic PD1.
[0077] In step 6312, setting a second distribution priority corresponding to the uplink service traffic to be transmitted in the current window PD2.
[0078] In step 6313, setting a first service priority according to a service quality of the remaining uplink service traffic PQ1.
[0079] In step 6314, setting a second service priority according to the service quality of the uplink service traffic to be transmitted in the current window PQ2.
[0080] In step 6315, determining a first priority of the remaining uplink traffic P1 according to a formula: P1 = APD1 + tPQ1.
[0081] In step 6316, determining a second priority of the uplink service traffic to be transmitted in the current window P2 according to a formula: P2 = APD2 + pPQ2.
[0082] Wherein, A and t are two predetermined parameters, and 0 < A+ t < 1.
[0083] In the above method, different distribution priorities may be set for the remaining
uplink service traffic and the uplink service traffic to be transmitted in the current window. In
this way, the remaining uplink service traffic can be transmitted to the satellite network in time.
[0084] Further, different service priorities may also be set for the remaining uplink service
traffic and the uplink service traffic to be transmitted in the current window. Specifically, since
non-real-time traffic can tolerate a certain delay of transmission, the service priority of real-time
traffic may be set as a higher priority, and the service priority of non-real-time traffic may be set
as a lower priority.
[0085] Finally, the priorities of different uplink service traffic can be calculated to integrate
the two priorities. Therefore, different uplink service traffic can be ranked based on their
priorities.
[0086] Wherein, the remaining uplink service traffic may include at least one service traffic,
and the uplink service traffic to be transmitted may include at least one service traffic too.
Therefore, there would be at least one first priority and there would be at least one second
priority. Therefore, all these uplink service traffic may be ranked and allocated with resources
according to the order.
[0087] By setting a priority for an uplink service traffic, service traffic with a higher priority
may be transmitted first. Therefore, quality of service (QoS) of service traffic can be
guaranteed.
[0088] According to some examples of the present disclosure, the above method may further
include: in response to determining that there is no uplink service path in the uplink path
sequence and there is still some uplink traffic in the current window and/or the remaining
uplink service traffic left, sending the uplink traffic in the current window and/or the remaining
uplink service traffic left to an adjacent uplink gateway station of the target uplink gateway
station for resource allocation.
[0089] In the process of uplink service traffic transmission in the current time window, the
distribution priority of the service traffic to be transmitted in the next time window would set to
be a lowest distribution priority, to ensure that the uplink service traffic to be transmitted in the current time window would be transmitted preferentially. Further, the uplink service traffic to be transmitted in the next time window is the remaining uplink traffic to be transmitted in the next time window, therefore the distribution priority of this service traffic should be increased in the next time window. This ensures when traffic accumulations happen, service traffic from a previous time window would have a highest priority distribution.
[0090] The above method would be used to allocate resources for uplink service traffic. Based
on a same concept, examples of the present disclosure provide a method for allocating
downlink resources. As shown in Fig. 2, the method may include:
[0091] In step 1100, obtaining downlink service traffic to be transmitted arriving at a
downlink feed satellite.
[0092] In this step, each time window of the downlink feed satellite belongs to an asymmetric
time window. The downlink service traffic to be transmitted would arrive uniformly within the
corresponding time window. When the time window is switched, the transmission of the
downlink service traffic to be transmitted would be interrupted.
[0093] In step 1200, determining links from the downlink feed satellite to a downlink target
gateway station according to topology information of the satellite communication system.
[0094] In step 1300, constructing a downlink residual resource matrix based on the links and
downlink residual resources of the links.
[0095] In step 1400, determining at least one downlink service path from the downlink feed
satellite to the downlink target gateway station according to the links.
[0096] In step 1500, determining residual resources corresponding to the at least one downlink
service path based on the downlink residual resource matrix.
[0097] In step 1600, performing a resource allocation for the downlink service traffic
according to the residual resources corresponding to the at least one downlink service path.
[0098] According to some examples of the present disclosure, the method for constructing a
downlink residual resource matrix may include the following steps.
[0099] In step a, determining transmission data of the links in a current time window.
[00100] In step b, calculating downlink residual resources of the links according to the
transmission data.
[00101] In step c, constructing the downlink residual resource matrix based on the links and the downlink residual resources of the links.
[00102] According to some examples of the present disclosure, the method for determining
transmission data of the links in a current time window may include the following steps.
[00103] In step al, determining a remaining time t and a transmission rate v of the current
time window of each link.
[00104] In step a2, determining a residual bandwidth b of each link.
[00105] According to some examples of the present disclosure, the method for calculating
downlink residual resources of the links according to the transmission data may include the
following step a3.
[00106] In step a3, calculating a downlink remaining resource of a link according to a formula
min(t x v, b).
[00107] In the above-mentioned steps, the remaining time of the time window, the transmission
rate and the residual bandwidth are taken into account comprehensively to measure the
downlink residual resources during traffic transmission. Moreover, a downlink residual resource
matrix is constructed based on the downlink residual resources of the links. It can be seen that
link resources can be utilized efficiently. At the same time, interruptions of traffic transmission
can be greatly avoided.
[00108] In some examples of the present disclosure, the above-mentioned block 1400 may
specifically include: using a KSP (K-shortest paths) algorithm to find at least one downlink
service path from the downlink feed satellite to the downlink target gateway station; and storing
the at least one downlink service path into a downlink path sequence.
[00109] In some examples of the present disclosure, with respect to a downlink service path in
the downlink path sequence, the above-mentioned step 1500 may specifically include the
following steps.
[00110] In step 1510, determining links consisted in the downlink service path.
[00111] In step 1520, determining a downlink residual resource corresponding to each of the
links consisted in the downlink service path from the uplink residual resource matrix.
[00112] In step 1530, determining a minimum uplink residual resource among downlink
residual resources corresponding to the links as the residual resource corresponding to the
downlink service path.
[00113] In some examples of the present disclosure, the above-mentioned step 1600 may specifically include the following steps.
[00114] In step 1610, ranking the at least one downlink service path in an ascending order according to the residual resources corresponding to the at least one downlink service path.
[00115] In step 1620, deleting the downlink service path with a zero-residual resource.
[00116] In step 1630, performing the resource allocation for the downlink service traffic according to the residual resources corresponding to the at least one downlink service path based on the order of the at least one downlink service path.
[00117] It can be seen from the above methods, the KSP algorithm is used to find k shortest paths from the downlink feeder satellite to the downlink target gateway station. To be noted, the value of k is limited by a service tolerance delay (generally, k takes 3-4). Then the k paths are placed into an uplink service path sequence and ordered (from small to large) according to their residual resources.
[00118] According to examples of the present disclosure, the downlink service traffic to be transmitted may include: current downlink traffic to be transmitted in a current time window of the downlink feed satellite, and/or remaining downlink traffic to be transmitted in a last time window of the downlink feed satellite.
[00119] In some examples of the present disclosure, the above-mentioned block 1630 may specifically include the following steps.
[00120] In step 1631, determining a corresponding priority for the current downlink service traffic and/or the remaining downlink service traffic.
[00121] In step 1632, selecting a target downlink service path from the downlink path sequence according to the order.
[00122] In step 1633, allocating the residual resource corresponding to the target downlink service path for the current downlink service traffic and/or the remaining downlink service traffic according to the corresponding priority.
[00123] In step 1634, in response to determining the residual resource of the target downlink service path becomes to 0, deleting the target downlink service path from the downlink path sequence, and updating the downlink residual resources matrix.
[00124] Further, after step 1634, in response to determining that there is still some current downlink traffic and/or the remaining uplink service traffic left, the following steps would be performed.
[00125] In step 16341, selecting another target downlink service path from the downlink path
sequence according to the order.
[00126] In step 16342, allocating the residual resource corresponding to the target downlink
service path for the current downlink service traffic and/or the remaining uplink service traffic
according to the corresponding priority.
[00127] In step 16343, in response to determining the residual resource of the target downlink
service path becomes to 0, deleting the target downlink service path from the downlink path
sequence, and updating the downlink residual resources matrix.
[00128] In step 16344, repeating this process until there is no downlink service path in the
downlink path sequence or there is no current downlink service traffic and/or the remaining
uplink service traffic left.
[00129] It can be seen that by setting a priority for the downlink service traffic to be transmitted,
resources can be allocated according to the priority. That is, downlink service traffic with a high
priority would be transmitted first, and then downlink service traffic with a low priority can be
transmitted. In this way, downlink service traffic which needs to be transmitted preferentially
can get resources in time and the quality of service can be improved.
[00130] In some examples of the present disclosure, the above-mentioned block 1631 may
specifically include the following steps.
[00131] In step 16311, setting a third distribution priority corresponding to the remaining
downlink service traffic PD3.
[00132] In step 16312, setting a fourth distribution priority corresponding to the downlink
service traffic to be transmitted in the current window PD4.
[00133] In step 16313, setting a third service priority according to a service quality of the
remaining downlink service traffic PQ3.
[00134] In step 16314, setting a fourth service priority according to the service quality of the
current downlink service traffic to be transmitted in the current window PQ4.
[00135] In step 16315, determining a third priority of the remaining downlink traffic P3
according to a formula: P3 = APD3 + tPQ3.
[00136] In step 16316, determining a fourth priority of the current downlink service traffic to
be transmitted in the current window P4 according to a formula: P4 = APD4 + tPQ4.
[00137] Wherein, / and t are two predetermined parameters, and 0 < A+ t < 1.
[00138] According to some examples of the present disclosure, the above method may further
include: in response to determining that there is no downlink service path in the downlink path
sequence and there is still some current downlink traffic and/or some remaining downlink
service traffic left, sending the current downlink traffic and/or the remaining downlink service
traffic left to an adjacent downlink feed satellite for resource allocation.
[00139] In the process of downlink service traffic transmission in the current time window, the
distribution priority of the downlink service traffic to be transmitted in the next time window
would set to be a lowest distribution priority, to ensure that the downlink service traffic to be
transmitted in the current time window would be transmitted preferentially. Further, the
downlink service traffic to be transmitted in the next time window is the remaining downlink
traffic to be transmitted in the next time window, therefore the distribution priority of this
service traffic should be increased in the next time window. This ensures when traffic
accumulations happen, service traffic from a previous time window would have a highest
priority distribution.
[00140] A specific example of uplink resource allocation would be described with reference to
the accompany drawings.
[00141] Topology information of the satellite network is obtained at moment t. Remaining
time windows of links between the nodes are updated and residual resources of the links are
calculated. As shown on the left side of Fig. 3, for example, the residual resources of a link
from No. 1 gateway station to No. 2 satellite is 50%. Then the uplink residual resource matrix
may be updated as shown on the right side of Fig. 3. It can be seen that, the uplink residual
resource matrix is a symmetric matrix, wherein, (1, 2) and (2, 1) denote bidirectional
communication links between two nodes.
[00142] Then, service traffic may arrive uniformly within the tO to tl time window (i.e., the
current time window).
[00143] When the QoS priority of the remaining service traffic and the QoS priority of the
current service traffic are the same. While the distribution priority of the remaining service traffic is bigger than the distribution priority of the current service traffic. In this case, the priority of the remaining service traffic would be bigger than the priority of the current service traffic. As shown in Fig. 4, different service traffic is sorted in order. In Fig. 4, PRI. 1 refers to the remaining service traffic, and PRI. 2 refers to the current service traffic. Then in this case, PRI. 1 and part of PRI. 2 would be transmitted within the time window tO to tI. The other part of PRI. 2 would be transferred to a next time window tl to t2. Later, when the time window tl to t2 arrives, priorities of service traffic would be calculated, and resources would be allocated for the service traffic according to their priorities. In can be seen that, in the current time window, the service traffic with a higher priority would be transmitted first.
[00144] When the QoS priority of the remaining service traffic is greater than the QoS priority of the current service traffic, priorities of the two are calculated. Further, the service traffic is ordered according to the priorities. As shown in Fig. 5, since the distribution priorities of the two kinds of service traffic are unknown, the ranking order of the two is unknown too. Thus, PRI. 1 may refer to the remaining service traffic or the current service traffic. Therefore, in Fig. 5 "dots" of different densities and shapes represent different service traffic. As shown in Fig. 5, both of the service traffic PRI. 1 and PRI. 2 are transmitted within the time window tO to tI, so that there is no remaining service traffic in the time window tl to t2.
[00145] Further, as shown in Fig. 6A - Fig. 6C, according to the KSP algorithm, 3 shortest paths from the uplink gateway station to the downlink feed satellite are found. These 3 paths include path 1, path 2 and path 3. Then the 3 paths are stored in an uplink path sequence. Moreover, the 3 paths are sorted according to their residual resource (from small to big). Wherein, the residual resource of path 1 is 0; the residual resource of path 2 is 30% and the residual resource of path 3 is 40%. Therefore, as shown in Fig.7, these 3 paths would be sorted as path 1, path 2 and path 3.
[00146] Then, in the resource allocation process, path 1 is selected atfirst. After determining that the residual resource of path 1 is 0, path 1 is deleted from the uplink path sequence. In this case, path 2 is selected. Since the residual resource of path 2 is 30% not 0, the residual resource of path 2 can be allocated for the service traffic. It can be seen that the service traffic PRI.1 would need 20% resources. Therefore, only 10% resources would be left after transmitting the service traffic PRI.. These 10% resources would be allocated to transmit PRI.2. After all the residual resources of path 2 are allocated, path 2 would be deleted from the uplink path sequence and the uplink residual resource matrix would be updated. Moreover, 90% of the service traffic PRI.2 still need to be transmitted.
[00147] As shown in Fig. 8, since path 2 occupies 30% of the resources, the residual resources
between node No. 1 to node No. 2 are reduced from 50% to 20%. In this case, the uplink
residual resource matrix may be updated as shown in Fig. 8. At the same time, the resource
information of path 3 in the uplink path sequence is synchronously updated, as shown in Fig. 9.
[00148] Now 90% of the service traffic PRI.2 remains untransmuted. Path 3 is selected as a
routing path to transmit the service traffic PRI.2. Moreover, the residual resource in path 3 is
20%. Therefore, the service traffic PRI.2 will be further divided to two parts: 20% of the service
traffic PRI.2 and 70% of the service traffic PRI.2. When there is no path in the uplink path
sequence, it means that there is no enough resource available for transmitting service traffic of
the current time window. In this way, real-time service traffic with a higher priority may
forwarded to an adjacent gateway station of the target gateway station for transmission, and the
remaining service traffic would be forwarded to a next time window of the target gateway
station for resource allocation.
[00149] The uplink resource allocation is completed after the above operations are completed.
[00150] Now a specific example of downlink (from satellite No.3 to downlink gateway station
No. 6) resource allocation would be described with reference to the accompany drawings.
[00151] As shown in Fig. 10, downlink service traffic with a bandwidth of 50% is routed to the
feed satellite No. 3. The feed satellite No. 3 then calculates that the downlink residual resource
is only 30%. Then the feed satellite No. 3 may update the downlink residual resource matrix.
And the downlink traffic at the feed satellite No. 3 is divided into two parts. A first part is with a
bandwidth of 30%, and a second part is with a bandwidth of 20%. Wherein the first part may be
transmitted within the current time window, and the second part will be transmitted to the
downlink gateway station No. 6 via the feed satellite No. 4 and the downstream gateway station
No. 5.
[00152] After the above operations, the downlink service traffic is transmitted. A next uplink
service traffic transmission starts.
[00153] It should be noted that the method in the example of the present disclosure may be executed by a single device, such as a computer or a server. The method in this example may also be applied in a distributed scenario and completed by cooperation of a plurality of devices. In this distributed scenario, one of the plurality of devices may only execute one or more steps in the method of the example of the present disclosure, and the plurality of devices may interact with each other to complete the method.
[00154] It should be noted that some examples of the present disclosure are described above. Other examples are within the scope of the appended claims. In some cases, the operations or steps described in the claims may be performed in an order different from that in the above-mentioned examples and still achieve the desired results. In addition, the processes described in the drawings do not necessarily require a particular order shown or a sequential order to achieve the desired results. In some examples, multitasking and parallel processing may be permissible or advantageous.
[00155] Based on the method disclosed above, the present disclosure also provides a device for allocating uplink satellite service resources. As shown in Fig. 11, the device may include: a traffic module 21, a link module 22, an uplink residual resource matrix module 23, an uplink service path module 24, a residual resource module 25, a resource allocation module 26.
[00156] The traffic module 21 is configured to obtain uplink service traffic to be transmitted arriving at an uplink target gateway station.
[00157] The link module 22 is configured to determine links from the uplink target gateway station to a downlink feed satellite according to topology information of the satellite communication system.
[00158] The uplink residual resource matrix module 23 is configured to construct an uplink residual resource matrix based on the links and uplink residual resources of the links.
[00159] The uplink service path module 24 is configured to determine at least one uplink service path from the uplink target gateway station to the downlink feed satellite according to the links.
[00160] The residual resource module 25 is configured to determine residual resources corresponding to the at least one uplink service path based on the uplink residual resource matrix.
[00161] The resource allocation module 26 is configured to perform a resource allocation for the uplink service traffic according to the residual resources corresponding to the at least one uplink service path.
[00162] Based on the method disclosed above, the present disclosure also provides a device for allocating downlink satellite service resources. As shown in Fig. 12, the device may include: a second traffic module 31, a second link module 32, a second downlink residual resource matrix module 33, a second downlink service path module 34, a second residual resource module 35, a second resource allocation module 36.
[00163] The second traffic module 31 is configured to obtain downlink service traffic to be transmitted arriving at a downlink feed satellite.
[00164] The second link module 32 is configured to determine links from the downlink feed satellite to a downlink target gateway station according to topology information of the satellite communication system.
[00165] The second uplink residual resource matrix module 33 is configured to construct a downlink residual resource matrix based on the links and downlink residual resources of the links.
[00166] The second downlink service path module 34 is configured to determine at least one downlink service path from the downlink feed satellite to the downlink target gateway station according to the links.
[00167] The second residual resource module 35 is configured to determine residual resources corresponding to the at least one downlink service path based on the downlink residual resource matrix.
[00168] The second resource allocation module 36 is configured to perform a resource allocation for the downlink service traffic according to the residual resources corresponding to the at least one downlink service path.
[00169] The implementations of the above modules may refer to the methods described above.
[00170] Based on the same concept, corresponding to the method in any of the above-mentioned examples, the present disclosure further provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the method for allocating satellite service resources in any of the above-mentioned examples.
[00171] Fig. 13 shows a more specific hardware structure diagram of an electronic device in
this example. The device may include a processor 1010, a memory 1020, an input/output
interface 1030, a communication interface 1040, and a bus 1050. The processor 1010, the
memory 1020, the input/output interface 1030, and the communication interface 1040 realize
communication connections between each other in the device through the bus 1050.
[00172] The processor 1010 may be implemented by a general central processing unit (CPU), a
microprocessor, an application specific integrated circuit (ASIC), or one or more integrated
circuits, etc., for executing related programs to implement the technical solutions provided in
the examples of this specification.
[00173] The memory 1020 may be implemented in the form of a read only memory (ROM), a
random-access memory (RAM), a static storage device, a dynamic storage device, etc. The
memory 1020 may store an operating system and other application programs. When the
technical solutions provided in the examples of this specification are implemented by software
or firmware, related program codes are stored in the memory 1020 and called and executed by
the processor 1010.
[00174] The input/output interface 1030 is connected to an input/output module to implement
information input and output. The input/output/module may be configured in the device as a
component (not shown in the figure), or connected to the device to provide corresponding
functions. The input device may include a keyboard, a mouse, a touch screen, a microphone,
various sensors, etc., and the output device may include a display, a speaker, a vibrator, an
indicator light, etc.
[00175] The communication interface 1040 is connected to a communication module (not
shown in the figure) to implement communication interaction between the device and other
devices. The communication module may implement communication by wired means (e.g.,
USB, a network cable, etc.) or wireless means (e.g., a mobile network, WIFI, Bluetooth, etc.).
[00176] The bus 1050 includes a channel for transmitting information between various
components of the device (for example, the processor 1010, the memory 1020, the input/output
interface 1030, and the communication interface 1040).
[00177] It should be noted that although the above device only shows the processor 1010, the
memory 1020, the input/output interface 1030, the communication interface 1040, and the bus
1050, the device may further include other components necessary for normal operation in
specific implementation processes. In addition, those skilled in the art could understand that the
above device may also include only the components necessary to implement the solutions of the
examples of this specification, and does not necessarily include all the components shown in
the figure.
[00178] The electronic device in the foregoing example is used to implement the corresponding
method for allocating resources in any of the foregoing examples, and has the beneficial effects
of the corresponding method example. Details are not described herein again.
[00179] Based on the same concept, corresponding to the method in any of the
above-mentioned examples, the present disclosure further provides a non-transitory
computer-readable storage medium, storing computer instructions that cause a computer to
implement the method in any of the above examples.
[00180] The computer-readable medium in this example includes permanent and
non-permanent, removable and non-removable media, and can store information by any method
or technology. The information can be computer-readable instructions, data structures, modules
of programs or other data. Examples of computer storage media include, but are not limited to,
a phase change memory (PRAM), a static random access memory (SRAM), a dynamic random
access memory (DRAM), other type of random access memory (RAM), a read-only memory
(ROM), an electrically erasable programmable read-only memory (EEPROM), a flash memory
or other memory technology, a read-only disk read-only memory (CD-ROM), a digital versatile
disc (DVD) or other optical storage, a magnetic cartridge tape, a tape disk storage or other
magnetic storage device or any other non-transportable media, which can be used to store
information that can be accessed by a computing device.
[00181] The computer instructions stored in the storage medium of the foregoing example are
used to cause the computer to execute the method for synchronizing topological information of
a low-orbit satellite network in any of the foregoing examples, and have the beneficial effects of
the corresponding method example. Details are not described herein again.
[00182] A person of ordinary skill in the art should understand that: the discussion of any of the
above examples is only exemplary, and is not intended to imply that the scope of the present
disclosure (including the claims) is limited to these examples; under the idea of the present disclosure, the above examples or the technical features in the different examples can also be combined, the steps can be implemented in any order, and there are many other changes in different aspects of the examples of the present disclosure as described above, which are not provided in the details for the sake of brevity.
[00183] In addition, in order to simplify the description and discussion, and in order not to
make the examples of the present disclosure difficult to understand, the provided drawings may
or may not show well-known power/ground connection with an integrated circuit (IC) chip and
other components. Moreover, devices may be shown in the form of block diagrams in order to
avoid the examples of the present disclosure beyond understanding, and this also considers the
fact that the details of implementations of these block diagram devices are highly dependent on
the platform of the examples of the present disclosure (i.e., these details should be fully within
the understanding scope of those skilled in the art). In the case where specific details (for
example, circuits) are illustrated to describe the exemplary examples of the present disclosure,
it is obvious to those skilled in the art that the examples of the present disclosure may be
implemented without the specific details or when the specific details are changed. Therefore,
these descriptions should be considered illustrative rather than restrictive.
[00184] Although the present disclosure is described in conjunction with specific examples of
the present disclosure, many substitutions, modifications and variations of these examples will
be apparent to those of ordinary skill in the art based on the foregoing description. For example,
other memory architectures (such as dynamic RAM (DRAM)) can use the discussed examples.
[00185] The examples of the present disclosure are intended to cover all such substitutions,
modifications and variations that fall within the broad scope of the appended claims. Therefore,
any omission, modification, equivalent replacement, improvement, etc. made within the spirit
and principle of the examples of the present disclosure should be included in the protection
scope of the present disclosure.

Claims (15)

  1. What is claimed is: 1. A method for allocating satellite service resources in a satellite communication system,
    comprising:
    obtaining uplink service traffic to be transmitted arriving at an uplink target gateway
    station;
    determining links from the uplink target gateway station to a downlink feed satellite
    according to topology information of the satellite communication system;
    constructing an uplink residual resource matrix based on the links and uplink residual
    resources of the links;
    determining at least one uplink service path from the uplink target gateway station to the
    downlink feed satellite according to the links;
    determining residual resources corresponding to the at least one uplink service path based
    on the uplink residual resource matrix; and
    performing a resource allocation for the uplink service traffic according to the residual
    resources corresponding to the at least one uplink service path.
  2. 2. The method according to claim 1, wherein constructing an uplink residual resource
    matrix based on the links and residual resources of the links comprises:
    determining transmission data of the links in a current time window; and
    calculating uplink residual resources of the links according to the transmission data; and
    constructing the uplink residual resource matrix based on the links and the uplink residual
    resources of the links.
  3. 3. The method according to claim 2, wherein determining transmission data of the links in
    a current time window comprises:
    determining a remaining time t and a transmission rate v of the current time window of
    each link; and
    determining a residual bandwidth b of each link.
  4. 4. The method according to claim 2, wherein, calculating uplink residual resources of the
    links according to the transmission data comprises: calculating an uplink remaining resource of
    a link according to a formula min(t x v, b).
  5. 5. The method according to claim 1, wherein determining at least one uplink service path from the uplink target gateway station to the downlink feed satellite according to the links comprises: determining the at least one uplink service path from the uplink target gateway station to the downlink feed satellite through a KSP algorithm; and storing the at least one uplink service path into an uplink path sequence.
  6. 6. The method according to claim 5, wherein determining residual resources corresponding
    to the at least one uplink service path based on the uplink residual resource matrix comprises:
    with respect to an uplink service path in the uplink path sequence,
    determining links consisted in the uplink service path;
    determining an uplink residual resource corresponding to each of the links consisted in the
    uplink service path from the uplink residual resource matrix; and
    determining a minimum uplink residual resource among uplink residual resources
    corresponding to the links as the residual resource corresponding to the uplink service path.
  7. 7. The method according to claim 1, wherein performing a resource allocation for the
    uplink service traffic according to the residual resources corresponding to the at least one uplink
    service path comprises:
    ranking the at least one uplink service path in an ascending order according to the residual
    resources corresponding to the at least one uplink service path;
    deleting the uplink service path with a zero-residual resource; and
    performing the resource allocation for the uplink service traffic according to the residual
    resources corresponding to the at least one uplink service path based on the order of the at least
    one uplink service path.
  8. 8. The method according to claim 7, wherein the uplink service traffic comprises: uplink
    service traffic to be transmitted in the current time window, and/or remaining uplink service
    traffic to be transmitted in a last time window.
  9. 9. The method according to claim 8, wherein performing the resource allocation for the
    uplink service traffic according to the residual resources corresponding to the at least one uplink
    service path based on the order of the at least one uplink service path comprises:
    determining a corresponding priority for the uplink service traffic to be transmitted in the
    current time window and/or the remaining uplink service traffic to be transmitted in a last time window; selecting a target uplink service path from the uplink path sequence according to the order; allocating the residual resource corresponding to the target uplink service path for the uplink service traffic to be transmitted in the current window and/or the remaining uplink service traffic to be transmitted in a last time window according to the corresponding priority; in response to determining the residual resource of the target uplink service path becomes to 0, deleting the target uplink service path from the uplink path sequence, and updating the uplink residual resources matrix.
  10. 10. The method according to claim 9, wherein, determining a corresponding priority for
    the uplink service traffic to be transmitted in the current time window and/or the remaining
    uplink service traffic to be transmitted in a last time window comprises:
    setting a first distribution priority corresponding to the remaining uplink service traffic
    PD1;
    setting a second distribution priority corresponding to the uplink service traffic to be
    transmitted in the current window PD2;
    setting a first service priority according to a service quality of the remaining uplink service
    traffic PQl;
    setting a second service priority according to the service quality of the uplink service
    traffic to be transmitted in the current window PQ2;
    determining a first priority of the remaining uplink traffic P1 according to a formula:
    P1 = APD1 + tPQ1
    determining a second priority of the uplink service traffic to be transmitted in the current
    window P2 according to a formula:
    P2 = APD2 + pPQ2
    wherein, A and t are two predetermined parameters.
  11. 11. The method according to claim 9, further comprising:
    in response to determining that there is still some uplink traffic in the current window
    and/or the remaining uplink service traffic left,
    selecting another target uplink service path from the uplink path sequence according to the
    order; allocating the residual resource corresponding to the target uplink service path for the uplink service traffic to be transmitted in the current window and/or the remaining uplink service traffic to be transmitted in a last time window according to the corresponding priority; in response to determining the residual resource of the target uplink service path becomes to 0, deleting the target uplink service path from the uplink path sequence, and updating the uplink residual resources matrix; and repeating this process until there is no uplink service path in the uplink path sequence or there is no uplink traffic in the current window and/or the remaining uplink service traffic left.
  12. 12. The method according to claim 11, further comprising:
    in response to determining that there is no uplink service path in the uplink path sequence
    and there is still some uplink traffic in the current window and/or the remaining uplink service
    traffic left, sending the uplink traffic in the current window and/or the remaining uplink service
    traffic left to an adjacent uplink gateway station of the target uplink gateway station for
    resource allocation.
  13. 13. The method according to claim 11, further comprising:
    in response to determining that there is no uplink service path in the uplink path sequence
    and there is still some uplink traffic in the current window and/or the remaining uplink service
    traffic left, allocating the uplink traffic in the current window and/or the remaining uplink
    service traffic left in a next time window of the target uplink gateway station.
  14. 14. A method for allocating satellite service resources in a satellite communication system,
    comprising:
    obtaining downlink service traffic to be transmitted arriving at a downlink feed satellite;
    determining links from the downlink feed satellite to a downlink target gateway station
    according to topology information of the satellite communication system;
    constructing a downlink residual resource matrix based on the links and downlink residual
    resources of the links;
    determining at least one downlink service path from the downlink feed satellite to the
    uplink target gateway station according to the links;
    determining residual resources corresponding to the at least one downlink service path
    based on the downlink residual resource matrix; and performing a resource allocation for the downlink service traffic according to the residual resources corresponding to the at least one downlink service path.
  15. 15. An electronic device, comprising a memory, a processor, and a computer program
    stored in the memory and executable on the processor, wherein the processor executes the
    program to implement the method for allocating satellite service resources in a satellite
    communication system according any one of claim I to claim 14.
AU2021104939A 2021-07-08 2021-08-04 Method and device for allocating resources Ceased AU2021104939A4 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202110775432.XA CN113709876B (en) 2021-07-08 2021-07-08 Satellite service resource allocation method and electronic equipment
CN202110775432.X 2021-07-08

Publications (1)

Publication Number Publication Date
AU2021104939A4 true AU2021104939A4 (en) 2021-09-30

Family

ID=77857764

Family Applications (1)

Application Number Title Priority Date Filing Date
AU2021104939A Ceased AU2021104939A4 (en) 2021-07-08 2021-08-04 Method and device for allocating resources

Country Status (2)

Country Link
CN (1) CN113709876B (en)
AU (1) AU2021104939A4 (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113852554B (en) * 2021-11-29 2022-03-04 中国星网网络系统研究院有限公司 Data transmission method, device and equipment
CN114640383B (en) * 2022-01-26 2023-04-11 北京邮电大学 Satellite network service establishing method and device, electronic equipment and storage medium
CN114465658A (en) * 2022-04-02 2022-05-10 阿里巴巴达摩院(杭州)科技有限公司 Transmission link selection method, communication system, device, and storage medium
CN114844556B (en) * 2022-04-26 2023-08-25 武昌理工学院 A Differential Transmission Method of Remote Sensing Information Based on Functional Satellite Load Rate
CN114745273B (en) * 2022-06-10 2022-09-02 成都星联芯通科技有限公司 TCP acceleration proxy method, device, satellite ground station and readable storage medium
CN115580342B (en) * 2022-11-17 2023-04-04 成都国恒空间技术工程股份有限公司 Aerospace information acquisition method and system based on intelligent networking

Family Cites Families (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6091933A (en) * 1997-01-03 2000-07-18 Globalstar L.P. Multiple satellite system power allocation by communication link optimization
US6366761B1 (en) * 1998-10-06 2002-04-02 Teledesic Llc Priority-based bandwidth allocation and bandwidth-on-demand in a low-earth-orbit satellite data communication network
US7729244B2 (en) * 2005-11-08 2010-06-01 The Boeing Company Dynamic resource allocation based on quality-of-service
US20070211757A1 (en) * 2006-03-07 2007-09-13 Ozgur Oyman OFDMA resource allocation in multi-hop wireless mesh networks
US20080146242A1 (en) * 2006-12-18 2008-06-19 Nokia Corporation Method for requesting an uplink resource allocation during a downlink data transmission
CN101511109B (en) * 2009-04-01 2011-04-27 南京邮电大学 A Mobile Agent-Based Quality of Service Guarantee Method for Satellite Networks
EP2625800A4 (en) * 2010-10-04 2016-11-23 Telcordia Tech Inc METHOD AND SYSTEM FOR ROAD DETERMINATION IN LOW-LEVEL ORBIT (LEO) SATELLITE NETWORKS WITH BANDWIDTH AND PRIORITY TAKING AND ADAPTIVE REROUTING
US8909220B1 (en) * 2011-10-14 2014-12-09 Vt Idirect, Inc. Method and apparatus for global bandwidth management
US10313001B2 (en) * 2016-04-07 2019-06-04 Thales Alenia Space Italia S.P.A. Con Unico Socio Hybrid processor with switching control based on dynamic bandwidth allocation for multi-beam satellite systems
WO2018125326A1 (en) * 2016-09-17 2018-07-05 Hughes Network Systems, Llc Radio resource management and routing for fixed data circuits in an ngso satellite data communications system
CN106851749B (en) * 2017-04-06 2020-04-07 上海航天测控通信研究所 Relay satellite system resource scheduling method based on resource reservation
CN111132316B (en) * 2018-10-31 2021-10-12 维沃移动通信有限公司 Resource allocation method, terminal equipment and network side equipment
CN111211830B (en) * 2020-01-13 2020-12-22 电子科技大学 A method for satellite uplink bandwidth resource allocation based on Markov prediction
CN111211831A (en) * 2020-01-13 2020-05-29 东方红卫星移动通信有限公司 Multi-beam low-orbit satellite intelligent dynamic channel resource allocation method
CN111262619B (en) * 2020-01-20 2021-04-06 中国科学院计算技术研究所 Multi-beam satellite resource allocation method and system
CN112187342B (en) * 2020-09-30 2021-10-01 西安交通大学 A satellite traffic routing method and system based on energy sensing and load balancing
CN112866109B (en) * 2021-02-05 2023-02-03 北方工业大学 A Method of Network Traffic Engineering Route Selection
CN113067625B (en) * 2021-03-17 2022-03-04 西安电子科技大学 Satellite network multi-service QoS routing method based on region division

Also Published As

Publication number Publication date
CN113709876A (en) 2021-11-26
CN113709876B (en) 2023-06-20

Similar Documents

Publication Publication Date Title
AU2021104939A4 (en) Method and device for allocating resources
US11503113B2 (en) Task offloading and routing in mobile edge cloud networks
Noormohammadpour et al. Dcroute: Speeding up inter-datacenter traffic allocation while guaranteeing deadlines
US11082326B2 (en) Route selection method and apparatus based on hybrid resource, and server thereof
US8301823B2 (en) Bus controller arranged between a bus master and a networked communication bus in order to control the transmission route of a packet that flows through the communication bus, and simulation program to design such a bus controller
CN113300881B (en) 5G network-based scheduling method, device, equipment and storage medium
WO2015096761A1 (en) Traffic behavior driven dynamic zoning for distributed traffic engineering in sdn
CN114286413A (en) TSN network combined routing and stream distribution method and related equipment
CN112118039B (en) Service transmission method, device, electronic device and storage medium of satellite network
US9680665B2 (en) Apparatus and method for dynamic hybrid routing in SDN networks to avoid congestion and balance loads under changing traffic load
US20130272318A1 (en) Communication link bandwidth fragmentation avoidance
CN109274589B (en) Service transmission method and device
US9184999B1 (en) Logical topology in a dynamic data center network
CN111917450A (en) Satellite network routing method, device, equipment and storage medium
US8391178B2 (en) Route allocation apparatus and method
EP3585013B1 (en) Data transmission method and apparatus
EP3063969B1 (en) System and method for traffic engineering using link buffer status
US9722913B2 (en) System and method for delay management for traffic engineering
CN117354086A (en) Data transmission method, device, medium and electronic equipment based on data center
CN114938327A (en) Routing method, routing device, controller and computer readable storage medium
CN116192322B (en) Centralized resource information synchronization method and device based on hybrid grid optical network
CN114640383B (en) Satellite network service establishing method and device, electronic equipment and storage medium
US11516144B2 (en) Incremental data processing
CN118740646B (en) A virtual graph construction method, device, equipment and storage medium
CN115361284B (en) Deployment adjustment method of virtual network function based on SDN

Legal Events

Date Code Title Description
FGI Letters patent sealed or granted (innovation patent)
MK22 Patent ceased section 143a(d), or expired - non payment of renewal fee or expiry