A method for supporting immersive media in a space-earth integrated network

Abstract

The application discloses a kind of route optimization methods for supporting immersive media in integrated network of heaven and earth, belong to routing algorithm design field;Specifically: first, for current immersive media resources, each user according to own demand, respectively initiates respective request service;And according to the inherent selling price of current required immersive media service payment;Then, integrated network of heaven and earth is based on each service initialization end-to-end feasible routing path, calculates network service income;And design optimization objective function of maximum profit and minimum network load balancing cost, to balance the use frequency of all links in path, and maximize network service income.Finally, by adjusting the routing path of service, solve objective function, obtain the final routing result feedback to each user;The application realizes the maximization of network income under the premise of guaranteeing the stable route of immersive media service end to end.

Description

Technical Field

[0001] This invention belongs to the field of routing algorithm design, specifically relating to a routing optimization method that supports immersive media in a space-ground integrated network. Background Technology

[0002] Integrated terrestrial and satellite networks offer advantages such as full coverage and 24 / 7 connectivity. With the explosive growth of multimedia services, the demand for immersive media is also increasing. However, immersive media places high demands on the network; high-end latency and low transmission bandwidth can lead to poor user experience and consequently reduce the quality of the user experience.

[0003] Furthermore, due to the uneven distribution of the global population, the traffic of satellite networks is uneven. Some links are used frequently, while others are used very infrequently, causing local overload of satellite computing resources, which makes it challenging to maintain the overall network.

[0004] Existing technologies largely focus on routing algorithms for networks, lacking a business-centric approach to routing design. (See reference...)

[0005] Application number CN202210911959 provides a routing optimization method, apparatus, device, and medium that can effectively improve network transmission efficiency, avoid network congestion problems, and increase network throughput.

[0006] Reference [2] CN202210779907 discloses an energy efficiency-aware routing optimization method and system for low-Earth orbit satellite networks. It proposes a graph attention neural network model that comprehensively considers the status of satellite nodes and inter-satellite links, and proposes an energy efficiency-aware routing optimization method for low-Earth orbit satellite networks based on this model. This method improves the energy utilization efficiency of low-Earth orbit satellite networks while meeting requirements such as time delay.

[0007] Literature [3] S.Kumar, N.Wang, Y.Rahulan, and B.Evans, "QoE-aware videostreaming over integrated space and terrestrial 5G networks," IEEE Netw., vol.35, no.4, pp.95–101, Jul.2021.

[0008] However, the aforementioned existing technologies, under the integrated space-ground network, mainly focus on the transmission and demonstration of multimedia, and still lack end-to-end service guarantees for immersive media. Summary of the Invention

[0009] This invention proposes a routing optimization method for supporting immersive media in an integrated space-ground network. This method balances the usage cost of each link in a way that maximizes network economic benefits, thereby maximizing network revenue while ensuring stable end-to-end routing for immersive media services.

[0010] The routing optimization method for supporting immersive media in an integrated space-ground network comprises the following steps:

[0011] Step 1: For the current immersive media resources, each user initiates a request for the media resource according to their own needs;

[0012] The request for this media resource initiated by user i∈I is m∈M; I is the total number of all users in the integrated space-ground network; M is the total number of all services in the integrated space-ground network.

[0013] Step 2: Each user makes payment according to the inherent price of the immersive media service they currently require;

[0014] User i needs to pay v for service m. i,m express.

[0015] Step 3: After receiving all user requests, the integrated space-ground network calculates network service revenue based on the shortest end-to-end routing path for each service.

[0016] Revenue from network services is:

[0017]

[0018] C load The cost caused by link overload is expressed as:

[0019]

[0020] C k The cost of using each link in a network communication link; expressed as:

[0021]

[0022]

[0023] Among them, c l f represents the unit link cost, γ represents the link cost factor, and f k Indicates the frequency of link usage in the network;

[0024] This indicates whether user i's request m uses link k. This indicates that service m uses link k; otherwise... The path X traversed by user i when requesting service m i,m Represented as: K represents the total number of links in the satellite network.

[0025] C path The cost of using all links in the network is expressed as:

[0026]

[0027] Step 4: Design an optimization objective function that maximizes profit and minimizes network load balancing costs to balance the usage frequency of all links in the path and maximize network service revenue.

[0028] The optimization objective function is:

[0029] max U

[0030] st

[0031]

[0032]

[0033]

[0034]

[0035]

[0036]

[0037]

[0038] Wherein, constraint C1 indicates whether user i's request for service m uses link k;

[0039] Constraint C2 means that the bandwidth required by all services passing through link k is no greater than the total bandwidth of link k; b i,m B represents the bandwidth of user i for service m; k Indicates the bandwidth of link k;

[0040] Constraint C3 states that the latency required for all services passing through link k is no greater than the total latency of link k; d i,m D represents the latency of user i to service m; k Indicates the delay of link k;

[0041] Constraint C4 indicates that the required packet loss rate for all services passing through link k is no greater than the total packet loss rate of link k; p i,m P represents the packet loss rate of user i to service m; k This represents the packet loss rate of link k;

[0042] Constraint C5 indicates that the delay of the selected end-to-end path is not greater than the delay specified by the service.

[0043] Constraint C6 means that the packet loss rate of the selected end-to-end path is not greater than the packet loss rate specified by the business, and prod(·) means product;

[0044] Constraint C7 indicates that if link k can support multiple services, it must simultaneously meet the requirements for latency, bandwidth, and packet loss rate; b′ i,m ,d′ i,m ,p′ i,m Bandwidth b i,m Delay d i,m and packet loss rate p i,m The corresponding bandwidth, latency, and packet loss rate after dimensionality normalization, where 0 ≤ b′ i,m ≤1, 0≤d′ i,m ≤1, 0≤p′ i,m ≤1;

[0045] Step 5: By adjusting the routing path of the service, solve the objective function and obtain the final routing result to feed back to each user;

[0046] Specifically:

[0047] First, based on the business requests of all users, and under the constraints mentioned above, find all end-to-end routing paths that meet the business requirements of the users.

[0048] The path selection method is as follows: First, the shortest path algorithm is used to find an end-to-end path. Then, it is determined whether the latency, packet loss rate, and bandwidth of this path meet the business requirements. If the requirements are met, this path is used as the end-to-end path. If the requirements are not met, a depth-first search (DFS) algorithm is used after the first node to find the node adjacent to the first node and use it as the second hop node. The end-to-end path from this node to the destination is calculated, and the path is then determined to meet the requirements until all end-to-end paths that meet the business requirements are found.

[0049] Then, an initial end-to-end routing path is assigned to service m for user i. Calculate network benefit U using the initial routing paths of all users 0 And determine the current computational network benefit U 0 Does it meet the expected return U? exp ; i.e. U exp ≤U 0 If so, output the current route path. Otherwise, continue assigning other end-to-end shortest paths to the user; exhaustively list all feasible paths in turn until the network benefit U′ is maximized, satisfying the expected return U. exp , that is U exp ≤U′; The final routing result X′ i,m Feedback to the user.

[0050]

[0051] The advantages of this invention are:

[0052] 1) A routing optimization method for supporting immersive media in an integrated space-ground network. This method improves network link utilization and efficiency by adjusting the routing allocation method for services to maximize economic benefits. Different network bandwidths and routes are allocated to different immersive media services based on their characteristics and priorities, thereby optimizing network resource utilization efficiency and reducing network costs while ensuring service quality.

[0053] 2) A routing optimization method for supporting immersive media in an integrated space-ground network. Immersive media typically requires significant bandwidth and stable network connections. Network congestion and instability can lead to media transmission delays and interruptions, impacting the user experience. By implementing network routing management, bandwidth utilization can be improved, transmission paths optimized, network congestion and latency reduced, and a stable and reliable routing method can be provided for immersive media, thereby offering users a more stable and reliable network service. Attached Figure Description

[0054] Figure 1 This is a flowchart of a routing optimization method for supporting immersive media in a space-ground integrated network according to the present invention;

[0055] Figure 2 This is a flowchart illustrating the routing path adjustment process of the present invention. Detailed Implementation

[0056] The embodiments of the present invention will now be described in detail and clearly with reference to the accompanying drawings.

[0057] This invention discloses a routing optimization method for supporting immersive media in an integrated terrestrial-space network. It focuses on immersive media transmission in integrated terrestrial-space network scenarios, and uses load balancing to balance the utilization of each link, providing end-to-end stable routing guarantees for immersive media services, while maximizing network benefits.

[0058] The aforementioned routing optimization method for supporting immersive media in a space-ground integrated network, such as... Figure 1 As shown, the specific steps are as follows:

[0059] Step 1: For the current immersive media resources, each user initiates a request for the media resource according to their own needs;

[0060] The request for this media resource initiated by user i∈I is m∈M; I is the total number of all users in the integrated space-ground network; M is the total number of all services in the integrated space-ground network.

[0061] Step 2: Each user makes payment according to the inherent price of the immersive media service they currently require;

[0062] User i needs to pay v for service m. i,m express.

[0063] Step 3: After receiving all user service requests, the integrated space-ground network calculates the network service revenue based on the shortest end-to-end routing path for each service.

[0064] Specifically:

[0065] First, user i's request for service m is transformed into a triple Q = {b} for network requirements. i,m ,d i,m ,p i,m};

[0066] b i,m This represents the bandwidth and d of user i for service m. i,m Indicates the latency of user i to service m, p i,m This represents the packet loss rate of user i to service m.

[0067] Then, due to bandwidth b i,m Delay d i,m Packet loss rate p i,m The three dimensions are different, so they need to be normalized to obtain Q′={b′ i,m ,d′ i,m ,p′ i,m}

[0068] 0≤b′ i,m ≤1, 0≤d′ i,m ≤1, 0≤p′ i,m ≤1;

[0069]

[0070]

[0071]

[0072] Among them, B k D k P kLet $\frac{1}{2}$ represent the bandwidth, latency, and packet loss rate parameters of link $k$, respectively; $max()$ and $min()$ represent the maximum and minimum values ​​of the bandwidth, latency, and packet loss rate of link $k$. Since latency and packet loss rate have a negative impact on service performance—that is, higher latency and higher packet loss rate result in worse service performance—normalization is used.

[0073] Next, the integrated space-ground network is represented graphically as G = (V, E);

[0074] V = V(S) + V(GS) represents the total number of nodes in the network, where the satellite set V(S) = [S1, S2, ..., S...]. L ] and ground station V(GS)=[GS1,GS2,...,GS N E = E(S,GS) + E(S,S) represents all links in the network, where E(S,GS) represents the link between the satellite and the ground station, and E(S,S) represents the link between satellites; all links in the satellite network are arranged in ascending order according to the satellite's serial number; k∈K represents the k-th link in the satellite network.

[0075] The path X traversed by user i when requesting service m i,m Represented as:

[0076] Next, calculate the usage cost C of each link in the network communication link. k ;

[0077]

[0078]

[0079] Among them, c l f represents the unit link cost, γ represents the link cost factor, and f k This indicates the frequency of link usage in the network. The more frequently a link is used, the higher its usage cost. This indicates whether user i's request m uses link k. This indicates that service m uses link k; otherwise...

[0080] The cost of using all links in the network, C path Represented as:

[0081]

[0082] Due to varying link usage frequencies, some links may become overloaded, increasing link usage costs. By altering service routing paths, load balancing can be achieved, thereby reducing network link usage costs. This cost is denoted as C. load ;

[0083]

[0084] Finally, the profit that can be obtained by providing the required services to all users in the network is:

[0085]

[0086] Step 4: By adjusting the routing paths of services, design an optimization objective function that maximizes profits and minimizes network load balancing costs, in order to balance the usage frequency of all links and maximize network revenue.

[0087] The optimization objective function is:

[0088] max U

[0089] st

[0090]

[0091]

[0092]

[0093]

[0094]

[0095]

[0096]

[0097] Wherein, constraint C1 indicates whether user i's request for service m uses link k;

[0098] Constraint C2 means that the bandwidth required by all services passing through link k is no greater than the total bandwidth of link k; b i,m B represents the bandwidth of user i for service m; k Indicates the bandwidth of link k;

[0099] Constraint C3 states that the latency required for all services passing through link k is no greater than the total latency of link k; d i,m D represents the latency of user i to service m; k Indicates the delay of link k;

[0100] Constraint C4 indicates that the required packet loss rate for all services passing through link k is no greater than the total packet loss rate of link k; p i,m P represents the packet loss rate of user i to service m; k This represents the packet loss rate of link k.

[0101] Constraint C5 indicates that the delay of the selected end-to-end path is not greater than the delay specified by the service.

[0102] Constraint C6 means that the packet loss rate of the selected end-to-end path is not greater than the packet loss rate specified by the business, and prod(·) means product;

[0103] Constraint C7 indicates that if link k can support multiple services, it must simultaneously meet the requirements for latency, bandwidth, and packet loss rate; b′ i,m ,d′ i,m ,p′ i,m Bandwidth b i,m Delay d i,m and packet loss rate p i,m The corresponding bandwidth, latency, and packet loss rate after dimensionality normalization, where 0 ≤ b′ i,m ≤1, 0≤d′ i,m ≤1, 0≤p′ i,m ≤1;

[0104] The process of adjusting the routing path is as follows:

[0105] First, based on the business requests of all users, and under the constraints mentioned above, we find all feasible end-to-end routing paths for each business.

[0106] Then, an initial end-to-end routing path is assigned to service m for user i. Calculate network benefit U using the initial routing paths of all users 0 And determine the current computational network benefit U 0 Does it meet the expected return U? exp (Expected return U) exp It is also the maximum benefit); that is, U exp ≤U 0 If so, output the current route path. Otherwise, continue assigning other end-to-end shortest paths to the user; exhaustively list all feasible paths in turn until the network benefit U′ is maximized, satisfying the expected return U. exp , that is U exp ≤U′; The final routing result X′ i,m Feedback to the user.

[0107]

[0108] Example:

[0109] Step 101: The user initiates a business request and makes a payment.

[0110] First, user i initiates a request message m for the service based on their own needs for immersive media;

[0111] Then, the user pays according to the inherent price of the immersive media, with the payment price being V and confirming.

[0112] Finally, the user waits for service.

[0113] Step 102: The network receives the service request and calculates the network service utility.

[0114] First, the immersive media services requested by users are transformed into quantifiable network units, such as bandwidth b, latency d, and packet loss rate p. The unit cost corresponding to these requests is divided into C. b C d and C p Therefore, if the network needs to provide this service, the inherent cost of that service is... It is a function of f().

[0115] Then, an end-to-end communication link is provided for service m, with each link consisting of multiple path segments. The unit cost of maintaining each path is C. l The more frequently the link is used (F), the higher the maintenance costs will be.

[0116] Finally, the profit for providing all services to the user is calculated:

[0117] Step 103: Design optimization functions to adjust the routing paths of services, balance the usage frequency of all links, and maximize network benefits.

[0118] First, design the optimization function to maximize profit and minimize network load balancing rate:

[0119] Then, the routing paths for services are adjusted according to the optimization goals to balance the usage frequency of all links.

[0120] Finally, determine whether the current computing network benefits meet the expected returns; if so, feed the routing results back to the user.

Claims

1. A routing optimization method for supporting immersive media in a space-ground integrated network, characterized in that, The specific steps are as follows: Step one, for the current immersive media resources, each user initiates a request for the media resources according to their own needs; user initiating a request service for the media resource is ; is the total number of all users in the space-ground integrated network; is the total number of all services in the space-ground integrated network; Step two, each user pays according to the inherent price of the immersive media service currently needed; Step three, after receiving all user requests, the network calculates the network service revenue based on the end-to-end routing path of each service; The network service revenue is: representing a user to a service a price to be paid; costs due to link overload, represented as: represents the total number of links in the satellite network; For each link in the network communication link, the usage cost of each link is represented as: wherein, denotes a unit link cost, denotes a link cost factor, denotes a frequency of use of a link in the network; Indicates user Request business Is a link used? , Indicates business Use link ,otherwise ;user Request business The path taken at that time Represented as: ; The usage cost for all links in the network is denoted as: Step four, design an optimization objective function to maximize profit and minimize network load balancing cost to balance the use frequency of all links in the path and maximize network service revenue; The optimization objective function is: wherein the constraint condition represents a user request for a service whether to use a link ; Constraints Indicates passing through the link The bandwidth required for all services should not exceed that of this link. Total bandwidth; Indicates user For business bandwidth; Indicates link bandwidth; Constraint denotes the total delay of all traffic passing through the link ; denotes the total delay of the link ; denotes the delay of the user ; denotes the delay of the service ; Constraints denotes the total packet loss rate of all traffic passing through link ; denotes the total packet loss rate of all traffic passing through link ; denotes the packet loss rate of traffic ; denotes the packet loss rate of link ; Constraint indicates that the latency of the selected end-to-end path is not greater than the latency specified by the service. Constraint indicates that the packet loss rate of the selected end-to-end path is not greater than the packet loss rate specified by the service. Constraints Indicates link If multiple services can be supported, then the requirements for latency, bandwidth, and packet loss rate must be met simultaneously. Bandwidth Delay and packet loss rate The corresponding bandwidth, latency, and packet loss rate after dimensionality normalization are as follows: , , ; Step five, adjust the routing path of the service to solve the objective function and get the final routing result feedback to each user. 2.The method of claim 1, wherein, The specific step five is: First, find all end-to-end routing paths that meet the user's service requirements under the above constraints according to all user service requests; The path selection method is as follows: first, use the shortest path algorithm to find an end-to-end path, then judge whether the delay, packet loss rate and bandwidth of the path meet the service requirements; if they meet the requirements, this path is used as the end-to-end path; if they do not meet the requirements, use the depth-first search algorithm to find a node adjacent to the first node after the first node and use it as the second-hop node, then calculate the end-to-end path from the node to the terminal, and continue to judge whether the path meets the requirements; until all end-to-end paths that meet the service requirements are found. Then, for users For business Assign initial end-to-end routing paths Calculate network benefits using the initial routing paths of all users. And determine the current computing network benefits. Does it meet expected returns? ;Right now If so, output the current route path. Otherwise, continue to assign other end-to-end shortest paths to the user; All feasible paths are exhausted in turn until the network benefit reaches a maximum, satisfying the expected return i.e. ; the final routing result is fed back to the user.

Images