Routing resource caching method, equipment, medium and product

Abstract

Disclosed are a routing resource caching method, device, medium and product, which relate to the technical field of data processing, the method comprising: determining at least two standby jump routes of a current route according to a route configuration file, historical route jump information, a route identifier of the current route and resource access data; determining a route feature and a resource demand quantity of each standby jump route according to the network state data, the network idle resource quantity, and the route feature and the resource demand quantity of each standby jump route, and determining a target route level of each standby jump route according to the network state data, the network idle resource quantity, and the route feature and the resource demand quantity of each standby jump route; and determining a resource caching scheme of each standby jump route according to the target route level of each standby jump route, and caching route resources of each standby jump route based on the resource caching scheme of each standby jump route. According to the method and the device, the resources and the data corresponding to the next-hop route of the current route can be cached in advance, the waiting time for accessing the page is shortened, and the page access experience of a user is improved.

Description

Technical Field

[0001] This invention relates to the field of data processing technology, and in particular to a method, device, medium, and product for caching routing resources. Background Technology

[0002] Different access operations on a front-end page correspond to different routes, and different routes correspond to different resources and redirected pages. Currently, page loading methods include click-triggered and static-triggered methods. Click-triggered methods determine the information to be loaded based on the route corresponding to the user's access operation after receiving the access operation. After obtaining the information, the browser assembles the page structure and renders it to present the final access page. Static-triggered methods cache information according to a fixed time and a fixed list. Click-triggered methods cannot pre-cachate information, while static-triggered methods suffer from problems such as inaccurate pre-fetching, unstable execution, lack of bandwidth / Central Processing Unit (CPU) / storage constraints, and repeated downloads of multiple tabs. The page loading efficiency of both methods is negatively correlated with the amount of data on the page. The larger the amount of data on the page, the lower the page loading and rendering efficiency, affecting the user's page access experience.

[0003] Therefore, how to improve page loading efficiency and enhance the user's page access experience without affecting other business operations is an urgent problem to be solved. Summary of the Invention

[0004] This invention provides a method, device, medium, and product for caching routing resources, which can pre-cachate the resources and data corresponding to the next-hop route of the current route so as to quickly load, render, and present the access page after receiving an access operation, shorten the waiting time for accessing the page after triggering the access action, and improve the user's page access experience.

[0005] According to one aspect of the present invention, a method for caching routing resources is provided, the method comprising:

[0006] Based on the routing configuration file, historical routing hop information, the routing identifier of the current route, and resource access data, determine the backup hop route set for the current route; wherein the backup hop route set includes at least two backup hop routes;

[0007] Determine the routing characteristics and resource requirements of at least two backup hop routes, and based on network status data, network idle resources, and the routing characteristics and resource requirements of at least two backup hop routes, determine the target routing class of at least two backup hop routes.

[0008] Based on the target routing class of at least two alternative hop routes, determine the resource caching scheme for at least two alternative hop routes, and cache the routing resources of at least two alternative hop routes based on the resource caching scheme for at least two alternative hop routes.

[0009] According to another aspect of the present invention, a routing resource caching device is provided. The routing resource caching device is used to implement the routing resource caching method in any embodiment of the present invention. The device includes:

[0010] The route determination module is used to determine the set of backup routes for the current route based on the route configuration file, historical route hop information, the route identifier of the current route, and resource access data; wherein the set of backup routes includes at least two backup routes;

[0011] The grade determination module is used to determine the routing characteristics and resource requirements of at least two backup hop routes, and to determine the target routing grade of at least two backup hop routes based on network status data, network idle resources, and the routing characteristics and resource requirements of at least two backup hop routes.

[0012] The resource caching module is used to determine the resource caching scheme for at least two alternative hop routes based on the target routing level of at least two alternative hop routes, and to cache the routing resources of at least two alternative hop routes based on the resource caching scheme for at least two alternative hop routes.

[0013] According to another aspect of the present invention, an electronic device is provided, the electronic device comprising:

[0014] At least one processor; and a memory communicatively connected to the at least one processor;

[0015] The memory stores a computer program that can be executed by at least one processor, which enables the at least one processor to perform the routing resource caching method in any embodiment of the present invention.

[0016] According to another aspect of the present invention, a computer-readable storage medium is provided that stores computer instructions for causing a processor to implement the routing resource caching method in any embodiment of the present invention when executed.

[0017] According to another aspect of the present invention, a computer program product is provided, the computer program product including a computer program that, when executed by a processor, implements a routing resource caching method according to any embodiment of the present invention.

[0018] The routing resource caching method of the present invention includes: determining a set of backup hop routes for the current route based on a routing configuration file, historical routing hop information, the routing identifier of the current route, and resource access data; the set of backup hop routes includes at least two backup hop routes; determining the routing characteristics and resource requirements of the at least two backup hop routes, and determining the target routing class of the at least two backup hop routes based on network status data, network idle resource quantity, the routing characteristics and resource requirements of the at least two backup hop routes; determining a resource caching scheme for the at least two backup hop routes based on the target routing class of the at least two backup hop routes, and caching the routing resources of the at least two backup hop routes based on the resource caching scheme of the at least two backup hop routes. The technical solution of this invention can determine multiple next-hop routes corresponding to the current route based on the routing configuration file, historical routing information, the routing identifier of the current route, and resource access data. That is, it determines at least two backup next-hop routes for the current route. Then, based on network status data, network idle resources, routing characteristics of the multiple next-hop routes, and resource requirements, it determines the routing level of the multiple next-hop routes, which is equivalent to determining the jump probability level of each backup next-hop route. Based on the routing level of each next-hop route, it caches the corresponding resources in a targeted manner. This allows for the pre-caching of resources and data corresponding to the next-hop routes of the current route, enabling rapid loading, rendering, and presentation of the access page after receiving an access operation. This shortens the waiting time for accessing the page after triggering an access action and improves the user's page access experience. This solves the problem that in methods such as obtaining information after receiving an access operation and having the browser assemble and render the page, and caching information according to a fixed time and a fixed list, page loading efficiency is negatively correlated with the amount of page data; the larger the page data, the lower the page loading and rendering efficiency, thus affecting the user's page access experience.

[0019] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of the present invention, nor is it intended to limit the scope of the invention. Other features of the invention will become readily apparent from the following description. Attached Figure Description

[0020] To more clearly illustrate the technical solutions in this invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0021] Figure 1 This is a flowchart illustrating a routing resource caching method provided by the present invention;

[0022] Figure 2This is a flowchart illustrating another method for caching routing resources provided by the present invention;

[0023] Figure 3 This is a schematic diagram of the structure of a routing resource caching device provided by the present invention;

[0024] Figure 4 This is a schematic diagram of the structure of an electronic device provided by the present invention. Detailed Implementation

[0025] To enable those skilled in the art to better understand the present invention, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are merely some, not all, of the embodiments of the present invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative effort should fall within the scope of protection of the present invention.

[0026] It should be noted that the terms "first," "second," "initial," "intermediate," "candidate," "alternate," "target," etc., used in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover a non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0027] The acquisition, storage, use, and processing of data in the technical solution of this invention all comply with relevant national laws and regulations. Specifically, the user information collected in this invention is information and data authorized by the user or fully authorized by all parties. Furthermore, the collection, storage, use, processing, transmission, provision, disclosure, and application of related data all comply with relevant national and regional laws, regulations, and standards, and necessary confidentiality measures are taken. This does not violate public order and good morals, and corresponding operation entry points are provided for users to choose to authorize or reject automated decision-making results; if the user chooses to reject, the process proceeds to the expert decision-making process. It should be noted that certain software, components, models, and other existing industry solutions may be mentioned in the embodiments of this application. These should be considered exemplary, intended only to illustrate the feasibility of implementing the technical solution of this application, and do not imply that the applicant has already used or necessarily used the relevant content of such solutions.

[0028] Figure 1 This is a flowchart illustrating a routing resource caching method provided by the present invention. This embodiment is applicable to determining the pages that the current page may redirect to, and caching resources in advance based on the redirection probability, thereby shortening the page loading and rendering time and improving the user's page access experience. This method can be executed by the routing resource caching device provided by the present invention. This device can be implemented in hardware and / or software. In a specific embodiment, the device can be integrated into an electronic device. The following embodiments will illustrate this using the integration of the device into an electronic device as an example. Figure 1 The method specifically includes the following steps:

[0029] S101. Based on the routing configuration file, historical routing hop information, the routing identifier of the current route, and resource access data, determine the backup hop route set for the current route.

[0030] The routing configuration file can be understood as a pre-configured routing table based on the page structure information of the accessed page. It includes the static routing topology between the page and its corresponding multi-level associated pages. Specifically, the routing configuration file includes the child routes, parent routes, and sibling routes corresponding to the current page's routes; the child routes corresponding to their child routes; the parent routes corresponding to their child routes; and so on. The routing configuration file covers all routes involved in the page access task and the topological relationships between them. It may also include explicitly declared jump relationships, such as navigation menus, breadcrumbs, and recommended links, but this invention does not limit this. Historical route jump information can be understood as the jump records of each route, which are the record data of the next-hop route of the current route in historical page access operations. The route identifier of the current route can be understood as the unique encoding data of the route corresponding to the current page, such as path, number, etc., used to distinguish each route. The resource access data for the current route can be understood as the access status of the page corresponding to the current route, including the user's dwell time on the current page and the area of ​​interest on the current page (which can be determined based on the mouse hover time and behavior trajectory). This data is used to analyze the next page the user might need to visit, thereby determining the possible next-hop route for the current route. The backup route set for the current route can be understood as the set of all possible next-hop routes corresponding to the current route, obtained by analyzing the route configuration file, historical route jump information, the route identifier of the current route, and resource access data. Because the next-hop route is not unique, this invention combines information such as the route configuration file, historical route jump information, the route identifier of the current route, and resource access data to analyze the next-hop route with a higher probability, and then pre-caches the data and resource information corresponding to this route to reduce the waiting time for page access. The backup route set includes at least two backup routes, which can be understood as the possible next-hop routes corresponding to the current route.

[0031] Specifically, the backup redirection route set can consist of all sub-routes (i.e., next-hop routes) that have a redirection relationship with the current route, or it can consist of all sub-routes that have a redirection relationship with the current route and whose redirection probability exceeds a preset probability value (e.g., 50%, 60%, 70%, the specific value is related to the caching logic and page access requirements, and this invention does not limit this). Alternatively, it can consist of all sub-routes that have a redirection relationship with the current route and whose redirection probability is in the top X (e.g., 5, 8, 10, 15, 20, etc., the specific value is related to the caching logic and page access requirements, and this invention does not limit this). The purpose of this setting is to cache the information of sub-routes with high redirection probability in advance, avoid performing meaningless information caching tasks, and save data processing resources while ensuring the page access experience.

[0032] Optionally, based on the routing configuration file, historical routing hop information, the routing identifier of the current route, and resource access data, a set of backup hop routes for the current route is determined, including: determining a set of candidate hop routes for the current route based on the routing configuration file, historical routing hop information, the routing identifier of the current route, and resource access data; the candidate hop route set includes at least two candidate hop routes, and the number of candidate hop routes is not less than the number of backup hop routes; determining the route evaluation data of at least two candidate hop routes based on the resource access data of the current route and the topological distance between the at least two candidate hop routes and the current route, and selecting at least two backup hop routes from the at least two candidate hop routes based on the route evaluation data of the at least two candidate hop routes.

[0033] In this context, the candidate hop route set can be understood as a set of routes consisting of all sub-routes that have a hop relationship with the current route. The topological distance between the candidate hop route and the current route can be understood as the cost required for the current route to hop to the candidate hop route. The smaller the topological distance between the candidate hop route and the current route, the lower the cost required for the current route to hop to the candidate hop route, and the higher the probability of the current route hopping to the candidate hop route. The topological distance between the candidate hop route and the current route can be the hop count or the reciprocal of the bandwidth; the definition of topological distance varies in different protocols, and this invention does not limit it. The route evaluation data of the candidate hop route is the route hop probability score of the candidate hop route, which can be understood as the hop probability of the current route hopping to the candidate hop route, that is, the probability that the candidate hop route is the next hop route of the current route. Alternate redirect routes can be understood as a subset of routes with a higher probability of redirection selected from the candidate routes. For example, candidate routes with a redirection probability greater than 50%, 60%, 70%, 80%, or 90%, or candidate routes with a redirection probability in the top 10, 15, or 20. The purpose of this setting is to avoid performing meaningless information caching tasks, that is, to avoid caching the data and resources required by routes with a low probability of redirection, so as to save data processing resources while ensuring the page access experience.

[0034] Specifically, determining the route evaluation data for at least two candidate hop routes based on the resource access data of the current route and the topological distance between the current route and at least two candidate hop routes can be understood as determining the route evaluation data for each candidate hop route (the probability that the next hop route of the current route is each candidate hop route) based on the resource access data of the current route and the topological distance between each candidate hop route and the current route. For any candidate route, determine the route evaluation data of the candidate route based on the resource access data of the current route and the topological distance between the candidate route and the current route. This includes: 1) Determining the transfer probability of the candidate route based on the frequency and time distribution of jumps from the current route to the candidate route within a preset time period (e.g., the last 30 days, the last 60 days, etc.). For example, assign a higher transfer probability to candidate routes with higher frequency and more recent time within the preset time period, and assign a lower transfer probability to candidate routes with lower frequency or more distant time within the preset time period. This can be done by assigning corresponding probability values ​​according to a pre-set frequency and time range, or by determining the transfer probability of the candidate route according to a certain functional relationship combined with the frequency and time distribution of jumps from the current route to the candidate route within the preset time period. 2) Determining the user's access intent on the page corresponding to the current route based on the resource access data of the current route. For example, determining the area where the mouse hovers the longest as the area the user tends to access, i.e., the user's access intent. 3) Based on the access intent, the transition probability of candidate routes, and the topological distance between candidate routes and the current route, determine the route evaluation data for candidate routes. This represents the probability that the next hop of the current route is a candidate route. For example, input the access intent, the transition probability of candidate routes, and the topological distance between candidate routes and the current route into a pre-trained scoring model for processing to obtain the route evaluation data for candidate routes. The advantage of this approach is that it allows for a quantitative measurement of the transition probability of each candidate route, enabling the determination of backup routes and further analysis of resource caching schemes for each backup route. Priority is given to caching the data and resources needed by important routes or routes with high transition probabilities.

[0035] In one specific implementation, a candidate hop route set for the current route is determined based on the routing configuration file, historical route hop information, the route identifier of the current route, and resource access data. This includes: determining a first hop route for the current route based on the route identifier of the current route and the routing configuration file; determining a second hop route for the current route based on the route identifier of the current route and historical route hop information; determining a third hop route for the current route based on the resource access data of the current route; determining the route type of the current route based on the route identifier of the current route, and determining a fourth hop route for the current route based on the route type of the current route; and performing deduplication processing on the first hop route, the second hop route, the third hop route, and the fourth hop route to obtain the candidate hop route set.

[0036] The first-hop route for the current route can be understood as the sub-routes of the current route extracted from the static route topology and / or the explicitly declared jump relationships. For example, if the current route is / user / profile, and the sub-routes extracted from the static route topology are / user / settings and / user / orders, and the jump relationship configured in the navigation class is / home and / products, then the first-hop route for the current route is determined to be / user / settings, / user / orders, / home, and / products. Alternatively, the first-hop route can also be determined based on the route identifier in the React Router / Vue Router / Next.js route table in the route configuration file. The second-hop route of the current route can be understood as the next-hop route of the current route recorded in the historical page access data. For example, by performing sequence pattern mining on the user's global session log and using a sliding window method (e.g., the last 30 days, the last 45 days, etc.) to count the frequency and time distribution of the "current route-next route", the next-hop route of the current route can be obtained. Suppose the current route is / product / detail, and after accessing / product / detail, 75% of users accessed / cart and 25% of users accessed / product / reviews. Then the second-hop route of the current route is determined to be / cart and / product / reviews. The third-hop route of the current route can be understood as the next-hop route obtained by analyzing the user's access intent. That is, the route corresponding to the page or information the user is likely to access. For example, analyzing the route access sequence within the session, page dwell time, and user interaction behavior (e.g., clicks, scrolling, form filling progress), combined with business rules (e.g., shopping processes such as browsing-details-add to cart-checkout, content consumption processes such as list-details-related recommendations), infers the user's current business stage and intent, forming contextual information, and then infers the next-hop route. For example, if a user stays on the / cart page for 45 seconds and clicks the "Go to Checkout" button area, the next step is inferred to be / checkout / address, the current route is / cart, and the third-hop route of the current route is / checkout / address. Specifically, the third-hop route can be a route obtained after inferring the user's access intent based on resource access data such as page dwell time, user interaction behavior, and form filling progress, as well as business rules.The fourth hop route of the current route can be understood as the next hop route of the current route related to the user's personalized access characteristics (e.g., the user's access preferences, the user's areas of interest, etc.). The fourth hop route of the current route is determined by using the user's historical preference tags (e.g., frequently accessed categories, favorite routes, recent search keywords, etc.) and collaborative filtering (route access patterns of similar users). For example, assuming the user tag is "tech enthusiast", collaborative filtering finds that similar users with the same tag frequently access / tech-news, and even if the current route / home does not explicitly link to this route, it is added to the candidates as the fourth hop route of the current route. The methods for determining the first, second, third, and fourth hop routes differ, but they may overlap in function and usage. Therefore, duplicate routes may exist among the first, second, third, and fourth hop routes. This invention performs route deduplication processing on the first, second, third, and fourth hop routes after obtaining them. The set of deduplicated routes is the candidate hop route set. This setting can avoid performing duplicate route resolution work, reducing the amount of information processing while ensuring the quality of information analysis.

[0037] Specifically, route deduplication can also filter routes that the current user does not have access to, avoiding unnecessary caching tasks and wasting data processing resources. For example, assuming the first hop routes are routes 1, 2, and 3; the second hop routes are routes 4, 5, and 6; the third hop routes are routes 2, 7, and 8; and the fourth hop routes are routes 4, 9, and 3, then the candidate hop route set is determined to consist of routes 1, 2, 3, 4, 5, 6, 7, 8, and 9.

[0038] Furthermore, if the backup hop routes are the top three candidate hop routes in terms of score, with route 1 having a score of 0.85, route 2 having a score of 0.65, route 3 having a score of 0.35, route 4 having a score of 0.45, route 5 having a score of 0.89, route 6 having a score of 0.75, route 7 having a score of 0.68, route 8 having a score of 0.58, and route 9 having a score of 0.77, then the backup hop route set is determined to consist of route 5, route 1, and route 9.

[0039] S102. Determine the routing characteristics and resource requirements of at least two backup hop routes, and based on network status data, network idle resources, and the routing characteristics and resource requirements of at least two backup hop routes, determine the target routing class of at least two backup hop routes.

[0040] The routing features of the backup jump route can be understood as a multi-dimensional feature vector of the backup jump route, including static features, relational features, session features, user features, and context features. Static features include, but are not limited to, the routing hierarchy depth of the backup route, route type tags (e.g., list, details, form, results page, etc.), historical global access popularity (e.g., statistics on page views / unique visitors), total resource volume, and number of key resources; Relationship features include, but are not limited to, the topological distance between the current route and the backup route (e.g., shortest path hop count), whether they are parent-child / sibling relationships, relative position in the navigation menu, historical transfer frequency, and average latency; Session features include, but are not limited to, the number of times the backup route is accessed in the current session, the recent access time interval, the number of backtracks, and the distribution of dwell time; User features include, but are not limited to, the user's historical preference for the route type of the backup route (e.g., click-through rate, conversion rate, etc.), the similarity of access patterns of similar users, and the matching degree of personalized tags; Contextual features include, but are not limited to, the business status of the current page (e.g., payment successful, search results empty, add to cart completed, etc.), user interaction information (e.g., mouse hover, scroll depth, form filling progress, etc.), and time context (e.g., time period, weekday, holiday, etc.). The routing features of a backup route are obtained by encoding and concatenating the static features, relational features, session features, user features, and contextual features of the backup route into a feature vector. For example, it determines whether each feature belongs to temporal features (including session features and contextual features) or categorical features (including static features, relational features, session features, user features, and contextual features). Embedding mapping (route address and route type) is used to add data labels to categorical features, and positional encoding is used to add data labels to temporal features. The tagged features are then concatenated to obtain the feature vector representing the routing features of the backup route. Resource requirements can be understood as the sum of the capacity of resources covered by the route, including HTML (Hypertext Markup Language, used to manage the "structure" of a page), JS (JavaScript, a scripting language used to manage the "behavior" of a page), CSS (Cascading Style Sheets, used to manage the "style" of a page), fonts, images, and data. Network status data can be understood as the environmental data of the current network access. Different environments are suitable for different route rating and scoring methods in order to evaluate each backup hop route in a targeted manner. For example, in weak network environments (round-trip time > 500ms or downlink speed < 1Mbps) or low power mode, the rating and level of backup hop routes are mainly determined by rules or lightweight models. In high traffic scenarios, the weight of real-time hotspot routes is increased, and the basic score of specific routes is increased.Network idle resources can be understood as the amount of resources that can still be allocated in the current network environment.

[0041] Specifically, determining the target route level of at least two backup hop routes based on network status data, network idle resources, routing characteristics and resource requirements of at least two backup hop routes essentially involves determining the routing score (which is the probability of the current route hopping to a backup hop route) of each backup hop route based on network status data, network idle resources, routing characteristics and resource requirements of at least two backup hop routes. Then, combining the correspondence between routing scores and route levels, the route level of each backup hop route is determined, i.e., the target route level, so that the resource caching method of each backup hop route can be determined according to the resource caching method corresponding to each route level.

[0042] Specifically, routing levels can be divided into critical, high priority, low priority, and no prefetching. The critical level corresponds to a routing score range of 0.7 and above, which is the highest concurrency priority, representing immediate prefetching of core resources (e.g., HTML, first-screen data interfaces, critical resource JS and CSS). The high priority level corresponds to a routing score range of 0.40 (inclusive) to 0.7 (exclusive), which is a medium concurrency priority, representing prefetching of main resources (e.g., non-critical JS, large images, etc.) during idle periods. The low priority level corresponds to a routing score range of 0.15 (inclusive) to 0.4 (exclusive), which is a low concurrency priority, representing prefetching of resources during deep idle periods or when receiving user control commands (e.g., mouse hover). The no prefetching level corresponds to a routing score range of less than 0.15, which does not actively prefetch resources and does not load information until the user actually accesses the site. Assuming that based on network status data, network idle resources, routing characteristics and resource requirements of at least two backup hop routes, the routing score of route 5 is determined to be 0.85, the routing score of route 1 is 0.65, and the routing score of route 9 is 0.25, then the target routing level of route 5 is determined to be critical, the target routing level of route 1 is determined to be high priority, and the target routing level of route 9 is determined to be low priority.

[0043] Optionally, based on network status data, network idle resources, routing characteristics and resource requirements of at least two backup hop routes, the target routing level of at least two backup hop routes is determined, including: determining the initial routing level of at least two backup hop routes based on network status data and routing characteristics of at least two backup hop routes; and adjusting the initial routing level of at least two backup hop routes based on network idle resources and resource requirements of at least two backup hop routes to obtain the target routing level of at least two backup hop routes.

[0044] The initial route level can be understood as the route score of each backup route, calculated directly based on network status data and the routing characteristics of each backup route. When resources are sufficient, the information corresponding to each backup route can be cached according to the resource caching scheme corresponding to the route score. However, when network resources are insufficient (resource demand exceeds resource availability), caching the information corresponding to each backup route according to the resource caching scheme corresponding to the route score will cause service congestion or affect other page access services. Therefore, it is necessary to adjust the initial route level of each backup route based on resource availability and the resource demand of each backup route, so as to cache the resources required by each backup route according to its importance without affecting other services. The target routing class can be understood as the adjusted initial routing class. Generally, the routing class is adjusted by route degradation, including partial degradation and full degradation. Full degradation means that the initial routing class of all backup hop routes is reduced by one level to obtain an intermediate routing class. If the resource requirement of the intermediate routing class is less than the network's available resources, the intermediate routing class is determined as the target routing class. If the resource requirement of the intermediate routing class is not less than the network's available resources, the degradation continues. Partial degradation means that the level of the second lowest-level backup hop route is reduced by one level, and then it is checked whether there are enough resources to allocate. If there are enough resources to allocate, the downgraded routing class is determined as the target routing class. If there are not enough resources to allocate, the level of the third lowest-level backup hop route is reduced by one level, and so on, in the order of second lowest level, third lowest level, fourth lowest level, second lowest level, third lowest level, until there are enough resources to allocate, and then the pre-caching task is executed.

[0045] Firstly, for any backup hop route, the initial routing level of the backup hop route is determined based on network status data and the routing characteristics of the backup hop route. This includes: determining an evaluation model for the backup hop route based on network status data, wherein the evaluation model is a first intent prediction model and / or a second intent prediction model; processing the routing characteristics of the backup hop route using the first intent prediction model and / or the second intent prediction model to obtain the first hop prediction data and / or the second hop prediction data of the backup hop route; and determining the initial routing level of the backup hop route based on the first hop prediction data and / or the second hop prediction data of the backup hop route.

[0046] The first intent prediction model can be understood as a pre-trained, large-scale route scoring prediction model (e.g., Tongyi Qianwen). This model has high prediction accuracy but high network requirements, making it suitable for high-power, high-network environments. The second intent prediction model can be understood as a pre-trained, auxiliary, lightweight scoring model (e.g., XGBoost, a small Transformer). This model has low network requirements and can be applied in low-power modes and weak network environments. The purpose of this setup is to ensure that alternative hop routes can be scored under all circumstances, guaranteeing the executability of the route resource pre-caching task. The first hop prediction data can be understood as the probability data of the current route hopping to the backup hop route obtained by processing the routing characteristics of the backup hop route using the first intent prediction model. The second hop prediction data can be understood as the probability data of the current route hopping to the backup hop route obtained by processing the routing characteristics of the backup hop route using the second intent prediction model. If the evaluation model includes the first intent prediction model and the second intent prediction model, the initial route level is determined based on the range of the fused data of the first hop prediction data and the second hop prediction data. For example, the route level of the backup hop route is determined by the range of the fused probability obtained by calculating the first hop prediction data and the second hop prediction data according to a certain weight.

[0047] Specifically, the evaluation model for determining backup routing based on network status data includes determining the type and weight of the evaluation model. For example, in a weak network environment, the weight of the prediction data of the first intent prediction model can be reduced, the weight of the prediction data of the first intent prediction model can be increased, or it can be directly reverted to the pure first intent prediction model to avoid cloud-side call timeouts. In low-power mode, the prediction of the first intent prediction model can be skipped, and the score can be determined using static rules or only the prediction of the second intent prediction model can be used. Secondly, when facing cold-start users with no historical data, the weight of personalized features can be adaptively reduced, and the weight of static topology and global popularity can be increased. When facing high-traffic scenarios, the base score of specific routes can be increased to improve the scoring accuracy.

[0048] The routing features of the alternative redirect routes are constructed into structured information and input into the first intent prediction model. The first intent prediction model can analyze the probability of accessing the alternative redirect route after the current route based on the session history (e.g., / home- / category / electronics- / product / A- / cart- / checkout- / order / detail / 123), current route information (e.g., / order / detail / 123, order details page, payment success status), user profile (e.g., logistics-sensitive users, historical data showing 68% of users immediately viewing logistics after payment), and alternative redirect routes ( / order / logistics / 123, / order / list, / order / evaluate / 123, or / user / coupons). It can also provide explanatory text. The second intent prediction model uses the routing features of the alternative redirect routes as input to predict the probability of transitioning from the current route to the alternative redirect route, with a latency of <5ms. It can be used as a mitigation strategy when the first intent prediction model is unavailable or has low confidence.

[0049] For example, both the first intent prediction model and the second intent prediction model are used. Determining the initial route level of the backup route based on the first and second jump prediction data of the backup route is to perform a weighted fusion of the first and second jump prediction data to obtain a comprehensive score for the backup route. Assuming the first intent prediction model outputs a prediction probability of 0.78 and a confidence level of 0.91, the second intent prediction model outputs a prediction probability of 0.68, the backup hop route's route score is 0.85, the first intent prediction model's prediction weight is 0.5 and the confidence level weight is 0.1, the second intent prediction model's prediction weight is 0.25, and the backup hop route's route score weight is 0.15, then the probability of the current route hopping to the backup hop route is 0.5×0.78+0.25×0.68+0.15×0.85+0.1×0.91=0.7785. Since 0.7785 is greater than 0.7, the initial route level of the backup hop route is determined to be critical. Furthermore, if the probability of the current route hopping to the backup route is between 0.40 and 0.7, the initial route priority of the backup route is determined to be high. If the probability is between 0.15 and 0.4, the initial route priority is determined to be low. If the probability is less than 0.15, the initial route priority is determined to be either no prefetch or delayed. This configuration aims to determine the route priority of the backup route using quantified data.

[0050] This invention also optimizes the first intent prediction model and the second intent prediction model at regular intervals (preset intervals, e.g., 1 day, 3 days, 5 days, etc.) or quantitatively (e.g., completing 10 pre-caching tasks, completing 30 pre-caching tasks). The first and second intent prediction models are iterated and trained according to the latest log data to ensure their real-time performance and prediction accuracy. Optimization strategies include, but are not limited to: 1) canceling the impact of low-priority tasks on the overall hit rate when the network deteriorates; 2) optimizing the relationship between round-trip time and degradation; 3) optimizing the relationship between cache pressure and prefetch termination conditions.

[0051] Secondly, based on the amount of available network resources and the resource requirements of at least two backup hop routes, the initial routing levels of at least two backup hop routes are adjusted to obtain the target routing levels of at least two backup hop routes. This includes: accumulating the resource requirements of at least two backup hop routes to obtain the total resource requirements of the backup hop routes; determining whether the total resource requirements of the backup hop routes are less than the amount of available network resources; if the total resource requirements of the backup hop routes are less than the amount of available network resources, then the target routing level of the at least two backup hop routes is determined to be the initial routing level of the at least two backup hop routes; if the total resource requirements of the backup hop routes are not less than the amount of available network resources, then based on the route evaluation data of at least two backup hop routes, the difference between the amount of available network resources and the total resource requirements of the backup hop routes, the initial routing levels of the at least two backup hop routes are adjusted to obtain the target routing levels of the at least two backup hop routes.

[0052] The amount of idle network resources can be calculated based on network quality and user settings. It can be the calculated maximum traffic allowed within the current prefetch window (e.g., 30 seconds, 1 minute, etc.) (e.g., 2.5MB, 3MB, etc.). The total resource requirement for backup routes is the sum of the resource requirements of each backup route. Assuming backup routes include route 1, route 2, route 3, and route 4, and route 1 is / order / logistics / 12345 with a comprehensive route score of 0.75, belonging to the critical level, its resources are HTML (35KB) + JS (320KB) + API (Application Programming Interface). The resource size (i.e., resource requirement) is 850KB, consisting of: 120KB of Application Programming Interface (API) + 375KB of Map JS. Route 2 is / order / list, with a comprehensive routing score of 0.62, indicating high priority. Its resources are HTML (28KB + JS (280KB) + API (312KB), totaling 620KB. Route 3 is / order / evaluate / 12345, with a comprehensive routing score of 0.48, indicating high priority. Its resources are HTML (25KB + JS (210KB) + API (245KB), totaling 480KB. Route 4 is / user / coupons, with a comprehensive routing score of 0.18, indicating low priority. Its resources are HTML (... The total resource size is 720KB (32KB) + JS (380KB) + API (308KB). The total resource requirement for backup hop routes is 850KB + 620KB + 480KB + 720KB = 2.67MB. If the network free resource amount is greater than or equal to 2.67MB, then the target route level of route 1 is determined to be critical, the target route levels of routes 2 and 3 are high priority, and the target route level of route 4 is low priority. If the network free resource amount is less than 2.67MB, then the initial route levels of at least two backup hop routes need to be adjusted based on the route evaluation data of at least two backup hop routes, the difference between the network free resource amount and the total resource requirement of backup hop routes, and the adjusted route levels are determined as the target route levels of at least two backup hop routes.

[0053] For example, assuming the cache pressure is 56.7%, the network quality is below average (round-trip time is 180ms), the network idle resources are 2.5MB, and the total resource requirement of the backup hop route is 2.67MB, which exceeds the network idle resources of 2.5MB, then the routes are downgraded one by one starting from the lowest priority to reduce the network load. For example, route 4 has the lowest score and is downgraded from low priority to no prefetching. No prefetching does not require pre-caching. At that time, the total resource requirement of the backup hop route is 850KB + 620KB + 480KB + 720KB = 1.95MB, which is less than the network idle resources of 2.5MB. The route levels of routes 1, 2, and 3 can remain unchanged. That is, the target route level of route 1 is determined to be critical, the target route levels of routes 2 and 3 are high priority, and the target route level of route 4 is no prefetching. Furthermore, considering caching pressure and network quality, some resources in route 3 with scores approaching the critical value can be downgraded. For example, core resources can remain high priority, while large APIs can be downgraded to low priority, triggered after mouse hover or idle time of X seconds (5, 8, 10, etc.) to reduce network pressure. The purpose of this setting is to adjust the routing level of each backup hop route based on the actual available resources, so that high-priority resources are cached in a timely manner when resources are limited.

[0054] It is worth noting that critical-level routing resources can be cached immediately when the network is idle. High-priority routing resources can be cached after a delay of 100ms, 200ms, or 300ms respectively when the network is idle, depending on their score. Low-priority routing resources can be cached after mouse hover or idle for X (5, 8, 10, etc.) seconds. The specific implementation logic is related to the caching requirements, and this invention does not limit it.

[0055] S103. Based on the target routing class of at least two backup hop routes, determine the resource caching scheme for at least two backup hop routes, and cache the routing resources of at least two backup hop routes based on the resource caching scheme for at least two backup hop routes.

[0056] The resource caching scheme includes the resource start caching time and resource caching categories for backup routes. The resource caching category can be understood as the resource list of the backup route's routing resources, such as HTML+JS+API, or HTML+JS+API+MapJS. The resource start caching time can be understood as the time when caching of the backup route's routing resources begins. For example, the resource start caching time for critical-level backup route resources is when the network is idle, the resource start caching time for high-priority backup route resources is when the network is idle for 100ms, and the resource start caching time for low-priority backup route resources is when the mouse hovers over the device or the network is idle for 5 seconds. The resource caching methods corresponding to different routing levels can be pre-defined. After obtaining the target routing level of the backup route, the resource caching scheme for the backup route can be determined based on the target routing level and the correspondence between routing levels and resource caching methods. For example, critical routing resources are cached immediately when the network is idle; high-priority routing resources are cached sequentially after a 100ms delay when the network is idle, according to their scores; low-priority routing resources are cached after a 5-second idle period (mouse hover or idle time); and routing resources without prefetching levels are cached upon receiving a click command. If the target routing level of the backup route is critical, the resource caching scheme is determined to be immediate caching, meaning the backup route's routing resources are cached immediately when the network is idle. If the target routing level of the backup route is high priority, the resource caching scheme is determined to be caching sequentially after a 100ms delay when the network is idle, and then caching the backup route's routing resources after a 100ms idle period. The purpose of this setup is to quickly determine the resource caching scheme for each backup jump route and to cache the routing resources of each backup jump route in a personalized and targeted manner.

[0057] Optionally, after determining the resource caching schemes for at least two alternative hop routes, the present invention further includes: if an adjustment instruction for the route resource caching scheme is received, adjusting the resource caching schemes for at least two alternative hop routes based on the adjustment instruction for the route resource caching scheme.

[0058] The adjustment indicators for the routing resource caching scheme include network status change indicators, session status change indicators, cache pressure indicators, device resource anomaly indicators, or routing resource cache anomaly indicators. The purpose of this setting is to adjust the resource caching scheme for backup redirect routes in real time based on changes in network status, session status, cache pressure, device resources, and routing resource caching, utilizing idle resources to cache the routing resources of backup redirect routes promptly without affecting other services, thereby maximizing the user's page access experience.

[0059] The network status change indication is triggered when the Round-Trip Time (RTT) increases by more than 50%, the downlink rate decreases by more than 40%, or three consecutive request timeouts are detected. The resource caching scheme for the backup jump route handles the following methods: immediately canceling low-level tasks (e.g., immediately interrupting low-level tasks in progress and releasing concurrent slots), downgrading high-level tasks (e.g., pausing high-level tasks that have not yet started, while continuing high-level tasks that have already started but reducing their concurrent weight), maintaining critical levels but extending timeouts (e.g., maintaining task levels but extending timeout thresholds by 2 or 3 times to prevent cancellation due to misjudgment), compressing bandwidth, and readjusting the levels of each task. After adjusting task levels, this invention continues to monitor network status changes. After the network returns to normal and stabilizes for 10 seconds, downgraded tasks can be gradually restored according to priority.

[0060] The triggering conditions for session state change indications can be: 1) the user switches tabs or minimizes a tab; 2) the user's actual navigation does not match the prediction, and the user is redirected to a new route; 3) the user's actual access matches the prediction. When the user switches tabs or minimizes a tab, the resource caching scheme for the backup redirection route handles the following: pausing low-priority tasks, delaying all unstarted tasks until the page is reactivated, limiting the total background prefetch traffic to 500KB, and continuing to complete high-priority and critical-level tasks that have already started, but with reduced priority to avoid affecting the foreground tabs. When the user's actual navigation does not match the prediction, all levels of prefetching tasks are immediately canceled, triggering a new round of route prediction and caching tasks. Already cached data is retained to avoid waste. When the user's actual access matches the prediction, the historical weight of the hit route is increased, resource caching tasks for all other routes are canceled, and a new round of route prediction and caching tasks continues based on the hit route.

[0061] The triggering conditions for cache pressure indication can be that cache pressure is close to the limit, cache usage increases by more than 50%, or system storage space is insufficient. The processing methods for the resource caching scheme of the backup route include deleting route resources in order of priority from low to high and the least recently used policy, marking low priority tasks as non-prefetching level, shortening the TTL of all new cached resources by half (in order to clean up data), and retaining only high priority and critical level critical resource cache tasks but needing to be downgraded.

[0062] The triggering conditions for device resource anomaly indication can be the detection of a low power mode or available memory less than 500MB. In this case, only the second intent prediction model is used for prediction, and the concurrency is reduced by 50% to reduce memory and processor resource overhead. Files with a single resource size greater than 300MB are automatically downgraded or canceled, and the criteria for determining the routing level are raised. For example, the threshold for critical level is raised from 0.7 to 0.85, and the low threshold for high priority is raised from 0.4 to 0.65.

[0063] The trigger condition for a route resource cache exception indication is that a resource fails to be requested three times in a row. At that time, the overall level of the route to that resource is reduced by one level, the confidence level of the route to that resource is reduced by 50%, the route to that resource is blocked for 24 hours, the route to that resource is marked as a risk route and other tags are notified to avoid repeating the failed operation.

[0064] Figure 2 This is a flowchart illustrating another routing resource caching method provided by the present invention, offering a complete information caching process, combined with... Figure 2 Routing resource caching methods can include: 1) User triggers the page's route; 2) Page reports context to the route; 3) Route sends policy / constraint requests to the cloud-side policy; 4) Cloud-side policy feeds back a tiered prefetch plan to the route; 5) Route sends the prefetch plan to the browser; 6) Browser writes the prefetch plan into memory; 7) Page reads cached information; 8) If a hit occurs, the page reads cached information (i.e., routing resources) from memory; if a miss occurs, the page sends a back-to-origin request to the cloud-side policy and receives the response information from the cloud-side policy; 9) Page reports metrics to the route.

[0065] The beneficial effects of the technical solution of this invention include: 1) The cloud-side large model (i.e., the first intent prediction model) provides high-precision decision-making, while the edge-side lightweight model (i.e., the second intent prediction model) achieves low-latency inference and seamless degradation in weak network / offline scenarios; 2) Hierarchical prefetching and fine-grained resource scheduling improve cache hit rate; 3) Dynamic scheduling and multi-scenario adaptation reduce invalid prefetching and duplicate downloads, improving stability in weak network scenarios; 4) Real-time monitoring and dynamic policy adjustment improve page loading efficiency without affecting other services; 5) Setting compliant business rules reduces compliance risks; 6) Covering the hierarchical division of prefetching plans and concurrent execution of priority queues, achieving fine-grained resource scheduling and demonstrating the effect of "hierarchical prefetching"; 7) The browser monitors network, session, cache, device status, and other information in real time, sets multiple caching scheme adjustment opportunities, performs hierarchical degradation, cancellation, and reordering, achieving the effects of "dynamic scheduling" and "online reordering".

[0066] The technical solution of this embodiment can determine multiple next-hop routes corresponding to the current route based on the routing configuration file, historical routing information, the routing identifier of the current route, and resource access data. That is, at least two backup next-hop routes for the current route. Then, based on network status data, network idle resources, routing characteristics of multiple next-hop routes, and resource requirements, the routing level of multiple next-hop routes is determined, which is equivalent to determining the jump probability level of each backup next-hop route. Based on the routing level of each next-hop route, its corresponding resources are cached in a targeted manner. This allows for pre-caching of resources and data corresponding to the next-hop routes of the current route, enabling rapid loading, rendering, and presentation of the access page after receiving an access operation, shortening the waiting time after triggering the access action, and improving the user's page access experience. Secondly, it can effectively improve the cache hit rate, reduce the time spent between the first screen and the second hop, and reduce invalid prefetching and duplicate downloads. This solves the problem that in methods such as obtaining information after receiving an access operation and having the browser assemble and render the page, and caching information according to a fixed time and a fixed list, page loading efficiency is negatively correlated with the amount of page data; the larger the page data, the lower the page loading and rendering efficiency, which affects the user's page access experience.

[0067] Figure 3 This is a schematic diagram of the structure of a routing resource caching device provided by the present invention. Figure 3 As shown, the device includes: a route determination module 201, a grade determination module 202, and a resource caching module 203.

[0068] The route determination module 201 is used to determine the backup jump route set for the current route based on the route configuration file, historical route hop information, the route identifier of the current route and resource access data; wherein the backup jump route set includes at least two backup jump routes.

[0069] The grade determination module 202 is used to determine the routing characteristics and resource requirements of at least two backup hop routes, and to determine the target routing grade of at least two backup hop routes based on network status data, network idle resources, and the routing characteristics and resource requirements of at least two backup hop routes.

[0070] Resource caching module 203 is used to determine a resource caching scheme for at least two backup hop routes based on the target routing level of at least two backup hop routes, and cache the routing resources of at least two backup hop routes based on the resource caching scheme of at least two backup hop routes.

[0071] Optionally, the route determination module 201 is specifically used to: determine a set of candidate hop routes for the current route based on the route configuration file, historical route hop information, the route identifier of the current route, and resource access data; wherein the set of candidate hop routes includes at least two candidate hop routes, and the number of candidate hop routes is not less than the number of backup hop routes; determine the route evaluation data of at least two candidate hop routes based on the resource access data of the current route and the topological distance between the at least two candidate hop routes and the current route, and select at least two backup hop routes from the at least two candidate hop routes based on the route evaluation data of the at least two candidate hop routes.

[0072] Optionally, the route determination module 201 is specifically used to: determine the first hop route of the current route based on the route identifier and route configuration file of the current route; determine the second hop route of the current route based on the route identifier and historical route hop information of the current route; determine the third hop route of the current route based on the resource access data of the current route; determine the route type of the current route based on the route identifier of the current route, and determine the fourth hop route of the current route based on the route type of the current route; and perform deduplication processing on the first hop route, the second hop route, the third hop route and the fourth hop route to obtain a set of candidate hop routes.

[0073] Optionally, the level determination module 202 is specifically used to: determine the initial routing level of at least two backup hop routes based on network status data and the routing characteristics of at least two backup hop routes; and adjust the initial routing level of at least two backup hop routes based on the amount of network idle resources and the resource requirements of at least two backup hop routes to obtain the target routing level of at least two backup hop routes.

[0074] Optionally, the level determination module 202 is specifically used for: determining the evaluation model of the backup hop route based on network status data, wherein the evaluation model is a first intent prediction model and / or a second intent prediction model; processing the routing characteristics of the backup hop route using the first intent prediction model and / or the second intent prediction model to obtain the first hop prediction data and / or the second hop prediction data of the backup hop route, and determining the initial routing level of the backup hop route based on the first hop prediction data and / or the second hop prediction data of the backup hop route.

[0075] Optionally, the level determination module 202 is specifically used for: accumulating the resource requirements of at least two backup hop routes to obtain the total resource requirements of the backup hop routes; determining whether the total resource requirements of the backup hop routes are less than the network idle resources; if the total resource requirements of the backup hop routes are less than the network idle resources, then determining the target route level of the at least two backup hop routes as the initial route level of the at least two backup hop routes; if the total resource requirements of the backup hop routes are not less than the network idle resources, then adjusting the initial route level of the at least two backup hop routes based on the route evaluation data of the at least two backup hop routes, the network idle resources, and the difference between the total resource requirements of the backup hop routes, to obtain the target route level of the at least two backup hop routes.

[0076] Optionally, the resource caching module 203 is further configured to: after determining the resource caching schemes for at least two alternative hop routes, if an adjustment instruction for the route resource caching scheme is received, adjust the resource caching schemes for at least two alternative hop routes based on the adjustment instruction for the route resource caching scheme; wherein the adjustment instruction for the route resource caching scheme is a network state change instruction, a session state change instruction, a cache pressure instruction, a device resource abnormality instruction, or a route resource cache abnormality instruction.

[0077] The routing resource caching device provided in this embodiment can execute the routing resource caching method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.

[0078] Figure 4 This is a schematic diagram of the structure of an electronic device provided by the present invention. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processors, cellular phones, smartphones, wearable devices (such as helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely illustrative and are not intended to limit the implementation of the invention described and / or claimed herein.

[0079] like Figure 4As shown, the electronic device 10 includes at least one processor 11 and a memory, such as a read-only memory 12 or a random access memory (RAM) 13, communicatively connected to the at least one processor 11. The memory stores computer programs executable by the at least one processor. The processor 11 can perform various appropriate actions and processes based on the computer program stored in the read-only memory 12 or loaded from the storage unit 18 into the RAM 13. The RAM 13 can also store various programs and data required for the operation of the electronic device 10. The processor 11, read-only memory 12, and RAM 13 are interconnected via a bus 14. An input / output interface 15 is also connected to the bus 14.

[0080] Multiple components in electronic device 10 are connected to input / output interface 15, including: input unit 16, such as keyboard, mouse, etc.; output unit 17, such as various types of monitors, speakers, etc.; storage unit 18, such as disk, optical disk, etc.; and communication unit 19, such as network card, modem, wireless transceiver, etc. Communication unit 19 allows electronic device 10 to exchange information / data with other devices through computer networks such as the Internet and / or various telecommunications networks.

[0081] Processor 11 can be a variety of general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of processor 11 include, but are not limited to, central processing units, graphics processing units, various special-purpose artificial intelligence computing chips, various processors running machine learning model algorithms, digital signal processors, and any suitable processor, controller, microcontroller, etc. Processor 11 performs the various methods and processes described above, such as the caching method for routing resources.

[0082] In some embodiments, the routing resource caching method may be implemented as a computer program tangibly contained in a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program may be loaded and / or installed on electronic device 10 via read-only memory 12 and / or communication unit 19. When the computer program is loaded into random access memory 13 and executed by processor 11, one or more steps of the routing resource caching method described above may be performed. Alternatively, in other embodiments, processor 11 may be configured to perform the routing resource caching method by any other suitable means (e.g., by means of firmware).

[0083] Various embodiments of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field-programmable gate arrays, application-specific integrated circuits (ASICs), application-specific standard products (ASICs), systems-on-a-chip (SoCs), payload programmable logic devices, computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include implementations in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general-purpose programmable processor, capable of receiving data and instructions from a storage system, at least one input device, and at least one output device, and transmitting data and instructions to the storage system, the at least one input device, and the at least one output device.

[0084] Computer programs used to implement the methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, such that when executed by the processor, the computer programs cause the functions / operations specified in the flowcharts and / or block diagrams to be performed. The computer programs may be executed entirely on a machine, partially on a machine, or as a standalone software package, partially on a machine and partially on a remote machine, or entirely on a remote machine or server.

[0085] In the context of this invention, a computer-readable storage medium can be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, apparatus, or device. A computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination thereof. Alternatively, a computer-readable storage medium may be a machine-readable signal medium. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory, read-only memory, erasable programmable read-only memory / flash memory, optical fibers, portable compact disk read-only memory, optical storage devices, magnetic storage devices, or any suitable combination thereof.

[0086] To provide interaction with a user, the systems and techniques described herein can be implemented on an electronic device having: a display device (e.g., a cathode ray tube or liquid crystal display) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user provides input to the electronic device. Other types of devices can also be used to provide interaction with the user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (voice input and / or tactile input).

[0087] The systems and technologies described herein can be implemented in computing systems that include backend components (e.g., as data servers), middleware components (e.g., application servers), or frontend components (e.g., user computers with graphical user interfaces or web browsers through which users can interact with implementations of the systems and technologies described herein), or any combination of such backend, middleware, or frontend components. The components of the system can be interconnected via digital data communication of any form or medium (e.g., communication networks). Examples of communication networks include local area networks (LANs), wide area networks (WANs), blockchain networks, and the Internet.

[0088] A computing system can include clients and servers. Clients and servers are generally located far apart and typically interact through communication networks. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. The server can be a cloud server, also known as a cloud computing server or cloud host, which is a host product within the cloud computing service system to address the shortcomings of traditional physical hosts and virtual private servers, such as high management difficulty and weak business scalability.

[0089] In one specific embodiment, the present invention also includes a computer program product comprising a computer program that, when executed by a processor, implements the routing resource caching method of any embodiment of the present invention.

[0090] In the implementation of a computer program product, computer program code for performing the operations of this invention can be written in one or more programming languages ​​or a combination thereof. Programming languages ​​include object-oriented programming languages ​​as well as conventional procedural programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including local area networks (LANs) or wide area networks (WANs), or it can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0091] It should be understood that the various forms of processes shown above can be used, with steps reordered, added, or deleted. For example, the steps described in this invention can be executed in parallel, sequentially, or in different orders, as long as the desired result of the technical solution of this invention can be achieved, and this is not limited herein.

[0092] The specific embodiments described above do not constitute a limitation on the scope of protection of this invention. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this invention should be included within the scope of protection of this invention.

Claims

1. A cache method of routing resources, characterized by, Comprise: According to the routing configuration file, historical routing jump information, the routing identifier and resource access data of the current route, determine the standby jump route set of the current route; wherein, the standby jump route set includes at least two standby jump routes; Determine the routing feature and resource demand of the at least two standby jump routes, and according to network state data, network idle resource amount, the routing feature and resource demand of the at least two standby jump routes, determine the target routing level of the at least two standby jump routes; According to the target routing level of the at least two standby jump routes, determine the resource caching scheme of the at least two standby jump routes, and cache the routing resources of the at least two standby jump routes based on the resource caching scheme of the at least two standby jump routes.

2. The method of claim 1, wherein, According to the routing configuration file, historical routing jump information, the routing identifier and resource access data of the current route, determine the standby jump route set of the current route, including: According to the routing configuration file, the historical routing jump information, the routing identifier and resource access data of the current route, determine the candidate jump route set of the current route; wherein, the candidate jump route set includes at least two candidate jump routes, and the number of candidate jump routes is not less than the number of standby jump routes; According to the resource access data of the current route, the topological distance between the at least two candidate jump routes and the current route, determine the routing evaluation data of the at least two candidate jump routes, and select the at least two standby jump routes from the at least two candidate jump routes according to the routing evaluation data of the at least two candidate jump routes.

3. The method of claim 2, wherein, According to the routing configuration file, historical routing jump information, the routing identifier and resource access data of the current route, determine the candidate jump route set of the current route, including: According to the routing identifier of the current route and the routing configuration file, determine the first jump route of the current route; According to the routing identifier of the current route and the historical routing jump information, determine the second jump route of the current route; According to the resource access data of the current route, determine the third jump route of the current route; According to the routing identifier of the current route, determine the routing type of the current route, and according to the routing type of the current route, determine the fourth jump route of the current route; De-duplicate the first jump route, the second jump route, the third jump route and the fourth jump route to obtain the candidate jump route set.

4. The method of claim 1, wherein, According to the network state data, network idle resource amount, the routing feature and resource demand of the at least two standby jump routes, determine the target routing level of the at least two standby jump routes, including: According to the network state data and the routing feature of the at least two standby jump routes, determine the initial routing level of the at least two standby jump routes; Based on the amount of idle network resources and the resource requirements of the at least two backup hop routes, the initial routing levels of the at least two backup hop routes are adjusted to obtain the target routing levels of the at least two backup hop routes.

5. The method of claim 4, wherein, For any backup hop route, based on the network status data and the routing characteristics of the backup hop route, determine the initial routing class of the backup hop route, including: Based on the network status data, an evaluation model for the backup hop route is determined, wherein the evaluation model is a first intent prediction model and / or a second intent prediction model; Using the first intent prediction model and / or the second intent prediction model, the routing characteristics of the backup hop route are processed to obtain the first hop prediction data and / or the second hop prediction data of the backup hop route, and the initial routing level of the backup hop route is determined based on the first hop prediction data and / or the second hop prediction data of the backup hop route.

6. The method of claim 4, wherein, The step of adjusting the initial routing class of the at least two backup hop routes based on the amount of idle network resources and the resource requirements of the at least two backup hop routes to obtain the target routing class of the at least two backup hop routes includes: The total resource requirement of the at least two backup jump routes is obtained by summing their resource requirements. Determine whether the total resource requirement of the backup jump route is less than the amount of network idle resources; If the total resource requirement of the backup hop routes is less than the amount of network idle resources, then the target routing level of the at least two backup hop routes is determined as the initial routing level of the at least two backup hop routes. If the total resource requirement of the backup hop routes is not less than the amount of network idle resources, then based on the route evaluation data of at least two backup hop routes, the difference between the amount of network idle resources and the total resource requirement of the backup hop routes, the initial route level of the at least two backup hop routes is adjusted to obtain the target route level of the at least two backup hop routes.

7. The method of claim 1, wherein, After determining the resource caching scheme for the at least two alternative redirect routes, the method further includes: If an adjustment instruction for the routing resource caching scheme is received, the resource caching scheme of the at least two backup hop routes is adjusted based on the adjustment instruction. The adjustment indication for the routing resource caching scheme can be a network status change indication, a session status change indication, a cache pressure indication, a device resource anomaly indication, or a routing resource cache anomaly indication.

8. An electronic device, comprising: The electronic device includes: At least one processor; and a memory communicatively connected to said at least one processor; The memory stores a computer program that can be executed by the at least one processor, which enables the at least one processor to perform the caching method for routing resources according to any one of claims 1 to 7.

9. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer instructions for causing the processor to implement the cache method of routing resources as claimed in any one of claims 1 to 7 when executed.

10. A computer program product comprising a computer program, characterized in that, The computer program, when executed by the processor, implements the cache method of routing resources as claimed in any one of claims 1 to 7.

Images