CN113392350A - Page routing processing method, device, equipment, storage medium and program product - Google Patents
Page routing processing method, device, equipment, storage medium and program product Download PDFInfo
- Publication number
- CN113392350A CN113392350A CN202110656436.6A CN202110656436A CN113392350A CN 113392350 A CN113392350 A CN 113392350A CN 202110656436 A CN202110656436 A CN 202110656436A CN 113392350 A CN113392350 A CN 113392350A
- Authority
- CN
- China
- Prior art keywords
- node
- page
- nodes
- idc
- target page
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/957—Browsing optimisation, e.g. caching or content distillation
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Transfer Between Computers (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application provides a page routing processing method, a page routing processing device, page routing processing equipment, a storage medium and a program product. The page routing processing method comprises the following steps: acquiring information of at least one target page of an IDC self-service platform; the target page is a page which can be acquired from the IDC self-service platform through a client of the IDC self-service platform by a user; the target page is obtained by rendering at least one component; acquiring a node set of components of at least one target page provided in the IDC self-service platform according to the information of the at least one target page; the method comprises the steps that a network flow graph model of the IDC self-service platform is built based on nodes in a node set, the network flow graph model is used for indicating routing information corresponding to each target page, the routing information is used for indicating a plurality of nodes of the target page provided in the node set, and the sequence of components is obtained from the plurality of nodes. The method and the device can shorten the page jump time of the IDC from the service platform.
Description
Technical Field
The present application relates to the field of page processing technologies, and in particular, to a page routing processing method, apparatus, device, storage medium, and program product.
Background
With the continuous improvement of the informatization level, enterprise users begin to use more and more informatization systems so as to better meet the requirements of daily management, service customers and the like. However, when different informatization system developers build systems, planning and design of the systems are often different, which results in that the informatization systems used by users cannot be integrated. Platform as a Service (PaaS) provided by an Internet Data Center (IDC) provides a unified Platform-based Service for software research, development, testing and operation and maintenance for users, and can well solve the problem of system integration. The PaaS platform is also called an IDC self-service platform.
At present, a page routing processing method of an IDC self-service platform page is to configure all routing information on a top-level component and embody different levels through a nested relation. This approach requires each component to obtain its associated routing information and re-render it through the top-level component each time a page is loaded or refreshed.
For the IDC self-service platform with huge user quantity and data amount to be processed, the existing page routing processing method ensures that when a user obtains a client page of the IDC self-service platform or performs related operation on the page, the IDC self-service platform needs to consume a large amount of time to render the page, and further page jump consumes a long time.
Disclosure of Invention
The application provides a page routing processing method, a device, equipment, a storage medium and a program product, which are used for solving the problem that the current page routing processing method consumes long time for page jump.
In a first aspect, the present application provides a page routing processing method, where the page routing processing method is applied to an IDC self-service platform, where the IDC self-service platform includes a plurality of nodes, and the plurality of nodes form a de-centering peer-to-peer network, and the method includes:
acquiring information of at least one target page of the IDC self-service platform; the target page is a page which can be acquired from the IDC self-service platform through a client of the IDC self-service platform by a user; the target page is obtained by rendering at least one component;
acquiring a node set of components of the at least one target page provided in the IDC self-service platform according to the information of the at least one target page;
constructing a network flow graph model of the IDC self-service platform based on the nodes in the node set, wherein the network flow graph model is used for indicating routing information corresponding to each target page, the routing information is used for indicating a plurality of nodes which provide the target pages in the node set, and acquiring the sequence of components from the plurality of nodes.
Optionally, the constructing a network flow graph model of the IDC self-service platform based on the node set internal nodes includes:
generating an initial mapping relation table according to the node set, wherein the initial mapping relation table comprises: source node, sink node, 2N intermediate nodes, wherein, 2N intermediate nodes include: n master nodes and N slave nodes; n is a positive integer greater than 0; each master node has at least one slave node; the initial mapping relationship table includes: when the source node is used as a path starting point and the sink node is used as a path end point, the initial routing relation table is formed by the 2N intermediate nodes;
aiming at an ith main node, randomly generating a mapping relation table of the ith main node according to the initial mapping relation table, wherein i is an integer which is greater than 0 and less than or equal to N;
acquiring at least one first mapping relation of the ith main node from the mapping relation table of the ith main node, wherein each first mapping relation represents a routing relation between the ith main node and one slave node;
acquiring a target mapping relation of the ith host node; the target mapping relationship of the ith master node is determined from the at least one first mapping relationship and the at least one second mapping relationship, and the second mapping relationship is used for representing the routing relationship between the ith master node and one slave node, which is obtained by other master nodes based on the mapping relationship tables of the other master nodes;
and constructing the network flow graph model by using the target mapping relations of the N main nodes, the source node and the sink node.
Optionally, the randomly generating a mapping relationship table of the ith master node includes:
carrying out dislocation rearrangement on the mapping relation in the initial mapping relation table to obtain a plurality of dislocation rearranged mapping relation tables of the ith main node;
and selecting a staggered mapping relation table with a random error smaller than or equal to a preset error threshold value from the staggered mapping relation tables of the ith main node as the mapping relation table of the ith main node.
Optionally, the obtaining the target mapping relationship of the ith master node includes:
sending each first mapping relation and the generation time of each first mapping relation to the ith main node;
receiving a target mapping relation obtained by the ith main node based on each second mapping relation from the other main nodes, the generation time of each second mapping relation, each first mapping relation and the generation time of each first mapping relation; the target mapping relation is the mapping relation which has the most repeated occurrence times and the earliest generation time in the first mapping relation and the second mapping relation.
Optionally, the sending each first mapping relationship to the ith master node, and the generation time of each first mapping relationship include:
and sending the first mapping relation and the generation time of the first mapping relation in an encryption mode by using the key of the ith main node.
Optionally, the ith master node and the slave node of the ith master node indicated by the target mapping relationship bind the routing relationship characterized by the target mapping relationship.
Optionally, after the network flow graph model is constructed by using the target mapping relationships of the N master nodes, the source node and the sink node, the method further includes:
determining neighbor nodes of the ith master node from the node set;
and storing a first mapping relation and a second mapping relation of the ith main node except the target mapping relation into the neighbor nodes.
Optionally, the determining neighbor nodes of the ith master node from the node set includes:
acquiring the XOR distance between the ith main node and other nodes according to the at least one first mapping relation and the at least one second mapping relation of the ith main node;
and taking the node with the minimum XOR distance as the neighbor node of the i main nodes.
Optionally, the storing, to the neighbor node, a first mapping relationship and a second mapping relationship of the ith master node except for the target mapping relationship includes:
generating a subtree which meets a k-buckets routing table mechanism by using a first mapping relation and a second mapping relation of the ith main node except the target mapping relation;
storing the subtree into the neighbor node.
In a second aspect, the present application provides a page routing processing method, where the page routing processing method is applied to an IDC self-service platform, where the IDC self-service platform includes a plurality of nodes, and the plurality of nodes form a de-centering peer-to-peer network, and the method further includes:
receiving a request message from a client of the IDC self-service platform, wherein the request message is used for requesting to acquire a first target page; the first target page is any one of at least one target page of the IDC self-service platform;
extracting the routing information of the first target page from a network flow graph model of the IDC self-service platform according to the current page of the client; the component indicated by the routing information of the first target page is a component which forms the first target page on the basis of the current page; the network flow graph model is used for indicating routing information corresponding to each target page, the routing information is used for indicating a plurality of nodes which provide the target pages in the node set, and acquiring the sequence of components from the nodes;
acquiring a component of the first target page according to the routing information of the first target page;
and sending the component of the first target page to the client so that the client renders and displays the first target page by utilizing the component of the first target page.
Optionally, the obtaining, according to the routing information of the first destination page, a component of the first destination page includes:
and acquiring the components of the first target page through vue-router according to the routing information of the first target page.
In a third aspect, the present application provides a page routing processing apparatus, where the page routing processing apparatus is applied to an IDC self-service platform, where the IDC self-service platform includes a plurality of nodes, and the plurality of nodes form a decentralized peer-to-peer network, and the apparatus includes:
the first acquisition module is used for acquiring information of at least one target page of the IDC self-service platform; the target page is a page which can be acquired from the IDC self-service platform through a client of the IDC self-service platform by a user; the target page is obtained by rendering at least one component;
a second obtaining module, configured to obtain, according to the information of the at least one target page, a node set of a component of the at least one target page provided in the IDC self-service platform;
a third obtaining module, configured to construct a network flow graph model of the IDC self-service platform based on the node set internal nodes, where the network flow graph model is used to indicate routing information corresponding to each target page, and the routing information is used to indicate a plurality of nodes that provide the target page in the node set, and obtain an order of components from the plurality of nodes.
In a fourth aspect, the present application provides a page routing processing apparatus, where the page routing processing apparatus is applied to an IDC self-service platform, where the IDC self-service platform includes a plurality of nodes, and the plurality of nodes form a de-centering peer-to-peer network, and the apparatus further includes:
a first obtaining module, configured to receive a request message from a client of the IDC self-service platform, where the request message is used to request to obtain a first target page; the first target page is any one of at least one target page of the IDC self-service platform;
a second obtaining module, configured to extract, according to a current page of the client, routing information of the first target page from a network flow graph model of the IDC self-service platform; the component indicated by the routing information of the first target page is a component which forms the first target page on the basis of the current page; the network flow graph model is used for indicating routing information corresponding to each target page, the routing information is used for indicating a plurality of nodes which provide the target pages in the node set, and acquiring the sequence of components from the nodes;
the third acquisition module is used for acquiring the components of the first target page according to the routing information of the first target page;
and the sending module is used for sending the component of the first target page to the client so that the client renders and displays the first target page by using the component of the first target page.
In a fifth aspect, the present application provides an electronic device, where the electronic device is applied to an IDC self-service platform, where the IDC self-service platform includes a plurality of nodes, and the plurality of nodes form a decentralized peer-to-peer network, and the electronic device includes: at least one processor and memory;
the memory stores computer-executable instructions;
the at least one processor executing the computer-executable instructions stored by the memory causes the electronic device to perform the method of any of the first or second aspects.
In a sixth aspect, the present application provides a computer-readable storage medium having stored thereon computer-executable instructions for implementing the method of any one of the first or second aspects when executed by a processor.
In a seventh aspect, the present application provides a computer program product comprising a computer program that, when executed by a processor, implements the method of any of the first or second aspects.
The page routing processing method, the device, the equipment, the storage medium and the program product can construct a network flow graph model capable of acquiring components of at least one target page based on information of the target page which can be provided for a user on an IDC self-service platform, and the network flow graph model can represent and acquire routing information of the components of each target page. In this way, after acquiring a request of a user for a certain page, the subsequent IDC self-service platform may dynamically extract routing information corresponding to each component in the page from the network flow graph model based on the network flow graph model and the current page, so that which components are rendered when the page is generated by rendering may be determined based on the dynamically determined routing information. According to the method, all components of the page requested by the user do not need to be rendered, namely, the same components in the page do not need to be rendered repeatedly, the page reuse rate is improved, the loading time of the page is shortened, and the user experience is improved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application.
Fig. 1 is a schematic diagram of a network architecture applied to a page routing processing method according to an embodiment of the present application;
fig. 2 is a schematic flowchart of a page routing processing method according to an embodiment of the present application;
FIG. 3 is a diagram illustrating an example network flow graph model provided by an embodiment of the present application;
fig. 4 is a schematic flowchart of another page routing processing method according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a page routing processing apparatus according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of another page routing processing apparatus according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
With the above figures, there are shown specific embodiments of the present application, which will be described in more detail below. These drawings and written description are not intended to limit the scope of the inventive concepts in any manner, but rather to illustrate the inventive concepts to those skilled in the art by reference to specific embodiments.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, like numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present application, as detailed in the appended claims.
The terms referred to in this application are explained first:
the node is an active electronic device which has a certain electronic storage space, can be connected with a network and participates in IDC distributed computing of cloud computing. The IDC self-service platform comprises a plurality of nodes, and the nodes form a de-center peer-to-peer network. Wherein, decentering means that there is no central server.
By decentralized peer-to-peer network is meant that every node in the network owns and maintains all the data in the network in common. Each node in the de-centralized peer-to-peer network of the IDC self-service platform can provide bandwidth resources, storage space and computing power for other nodes in the network.
The IDC is a page of the service platform and can be rendered by at least one component and displayed. Any node in a decentralized peer-to-peer network of the IDC self-service platform, which needs to acquire a page, can acquire a component needed for loading the page from at least one other node providing the component in the network. And at least one routing path to the node of the providing component can be reached from the node needing to acquire the page.
The IDC related to the application can be cloud computing IDC.
A conventional IDC generally refers to a machine room storing a large number of physical servers, and a conventional IDC is a cluster of physical servers for transmitting, accelerating, displaying, calculating, and storing data information on a network infrastructure. The traditional IDC can provide services such as large-scale, high-quality, safe and reliable professional server hosting, space renting and the like for users. In cloud computing IDC, on the basis of traditional IDC, a large-scale entity server is integrated and virtualized to a cloud end, and a new generation internet data center which can provide Infrastructure as a Service (IaaS), platform Service (PaaS) and Software Service (SaaS) for users is constructed.
The IDC self-service platform related by the application can be a PaaS platform provided by the cloud computing IDC.
The IDC self-service platform is a distributed development and operation platform of software, and can provide software development, testing and operation and maintenance services for users, such as Application Programming Interface (API) services. The user can acquire a page from the IDC self-service platform through the client, and the page can be a management page. After the management page is obtained, the user can obtain corresponding authority through identity authentication and perform corresponding operation according to the requirement of the user. The corresponding authority refers to the authority for software development, test and operation and maintenance operation on the IDC self-service platform after being authenticated by the IDC self-service platform. The corresponding operation refers to the operations of login, refreshing, software development, testing, operation and maintenance and the like performed by a user on an IDC self-service platform page.
Different users do not have the problems of incompatibility and incapability of integration among different software developed from the service platform through the IDC. For enterprises with high informatization degree, the IDC self-service platform is used for information system planning, so that the problem that data and processes between different information systems cannot be fused can be avoided, and the system can be interconnected and intercommunicated.
At present, a page routing processing method of an IDC self-service platform page is to configure routing information of all pages on a top-level component and embody different levels through a nested relation. That is, the routing information for all pages is pre-set on the top-level component. The routing information for each page is used to indicate the route for all components that acquire the page.
Under the processing method, when a user requests to acquire a certain page from the IDC self-service platform, the IDC self-service platform client needs to acquire the routing information of the page from the top-layer component of the IDC self-service platform, and then, based on the routing information, each component is acquired from the decentration peer-to-peer network of the IDC self-service platform and then rendered.
However, at present, pages requested to be acquired by a user from an IDC self-service platform gradually increase explosively, so that when the IDC self-service platform provides the pages for the user based on the user requirements, the reusability among the pages cannot be fully utilized, the situation of repeated rendering of the same component may occur, a large amount of time is consumed for rendering the pages by the IDC self-service platform, and further, the time consumed for page jumping is long.
In view of the above, the present application provides a page routing processing method. The method can determine and bind the routing path between the nodes again through the constructed network flow graph model and store the routing path, so that the page of the IDC self-service platform can be loaded according to the current page and the network flow graph model, the components required by the loading are dynamically determined, and the condition of repeatedly rendering the same components is reduced, thereby improving the page reuse rate, shortening the page loading time and improving the user experience.
The page routing method provided by the application can be applied to the network architecture schematic diagram shown in fig. 1. As shown in fig. 1, the network architecture includes: IDC self-service platform and electronic equipment. The IDC self-service platform can provide services for users, such as software development testing and operation and maintenance services. The electronic equipment can realize interaction with the IDC self-service platform by operating the IDC self-service platform development end.
The electronic device may be, for example, any terminal or server having processing capabilities. The terminal referred to herein may also be referred to as a terminal device, a User Equipment (UE), a Mobile Station (MS), a Mobile Terminal (MT), and the like, and may be, for example, a mobile phone (mobile phone), a tablet computer (pad), or a computer with a wireless transceiving function.
It should be understood that the network architecture shown in fig. 1 is an architecture that exemplifies that the electronic device is independent of devices outside the IDC self-service platform. For example, the electronic device may also be a node in the IDC self-service platform, which is not limited to this.
The following describes the technical solutions of the present application and how to solve the above technical problems with specific embodiments. The following several specific embodiments may be combined with each other, and details of the same or similar concepts or processes may not be repeated in some embodiments. Embodiments of the present application will be described below with reference to the accompanying drawings.
Fig. 2 is a schematic flowchart of a page routing method according to an embodiment of the present application. As shown in fig. 2, the method of the present application may include:
s101, obtaining information of at least one target page of the IDC self-service platform.
The target page is a page which can be acquired by a user from the IDC self-service platform through a client of the IDC self-service platform. The target page may be an IDC self-service platform page corresponding to various operation requirements of the user. Such as a login page for the user.
The information of the target page may be, for example, the number and types of components acquired by the electronic device and required for displaying the target page. After the electronic device obtains the number and the type of the components corresponding to the target page, the node information of each component can be obtained according to the information. Alternatively, the information of the target page may also include the number and type of components corresponding to the target page, and node information of each component.
Wherein the node information includes at least one node providing components in the target page. When the node providing the components is greater than or equal to two, the node information further includes an order of the components acquiring the target page from the nodes.
It should be understood that a target page may correspond to at least one component, and a component may correspond to at least one node.
The present application does not limit the manner of obtaining the above-mentioned target page information. For example, the information of the target page may be acquired from a peer-to-peer network of the IDC self-service platform after the electronic device interacts with the platform, or may be input into the electronic device by the user after acquiring the information.
S102, acquiring a node set of components providing the at least one target page in the IDC self-service platform according to the information of the at least one target page.
Illustratively, when the target page information only includes the number and types of components required for displaying the target page, the electronic device may acquire node information of each component according to the target page information, and collect at least one node corresponding to at least one target page according to the acquired node information to combine into one node set. When the information of the target page includes the number and type of the components corresponding to the target page and node information of each component, the electronic device may collect at least one node corresponding to at least one target page according to the obtained target page information to combine into a node set.
It should be understood that, when there is one target page, the node set is composed of at least one node corresponding to the target page; when the target page is more than one, the node set consists of all nodes corresponding to all the target pages.
S103, constructing a network flow graph model of the IDC self-service platform based on the nodes in the node set.
The network flow graph model is used for indicating routing information corresponding to each target page, the routing information is used for indicating a plurality of nodes which provide the target pages in a node set, and the sequence of components is obtained from the nodes.
Fig. 3 is a diagram illustrating an example of a network flow graph model provided in an embodiment of the present application. As shown in fig. 3, the network flow graph model refers to a directed graph having one unique source node and one unique sink node, and at least one interior node. The source node refers to a node with zero inflow, such as the S node in fig. 3; and the sink node is a node with zero outflow, such as the T node in fig. 3; the remaining flows, both incoming and outgoing, are referred to as intermediate nodes, e.g., all nodes in fig. 3 except the S and T nodes. The inflow is the flow which points to the node from other nodes according to the direction of the network flow graph; the outflow is a flow directed from the node to another node in the direction of the network flow graph.
Although fig. 3 is a schematic diagram illustrating an example of a network flow graph model having a master node layer and a slave node layer. The number of layers of the network flow graph model and the number of nodes included at a time are not limited in this application.
As a possible implementation manner, the electronic device may generate an initial mapping relationship table according to the node set. The initial mapping relationship table includes: source node, sink node, 2N intermediate nodes.
For example, the determining manner of the source node, the sink node, and the 2N intermediate nodes may be determined after the electronic device obtains the node set and each node in the node set performs negotiation, or determined after user-defined setting, or randomly selected by the electronic device.
The 2N intermediate nodes include: n master nodes and N slave nodes. Wherein N is a positive integer greater than 0. Each master node has at least one slave node.
The master node is an intermediate node having a next-level intermediate node according to the network flow direction of the network flow graph model. The network flow direction of the network flow graph model refers to a direction from a source node to a sink node. In contrast, the slave node has a higher level according to the network flow direction of the network flow graph modelAn intermediate node of the intermediate nodes. For example, M in FIG. 31And S2I.e. a pair of master-slave points and slave nodes. Wherein "upper level" or "lower level" only represents the relative positions of two nodes in the network flow graph model, and is not related to the priority between the nodes.
The initial mapping relationship table includes: and when the source node is used as a path starting point and the sink node is used as a path end point, the initial routing relation table is formed by the 2N intermediate nodes.
For the ith host node, the electronic device may randomly generate the mapping relationship table of the ith host node according to the initial mapping relationship table, where i is an integer greater than 0 and less than or equal to N.
For example, the electronic device may perform misalignment rearrangement on the mapping relationships in the initial mapping relationship table, that is, rearrange and combine the initial routing relationships in the initial mapping relationship table to obtain the mapping relationship table. Because the specific mode of dislocation rearrangement has a plurality of modes, the obtained mapping relation table of the ith main node has a plurality of tables.
For example, the electronic device may select, from the multiple staggered and rearranged mapping relationship tables of the ith master node, a staggered and rearranged mapping relationship table with a random error smaller than or equal to a preset error threshold as the mapping relationship table of the ith master node. Alternatively, the electronic device may send all of the mapping relationship tables rearranged by the misalignment to the ith master node. And then the ith master node calculates random errors, selects a mapping relation table of the node according to a preset error threshold value, and sends the selected mapping relation table to the electronic equipment.
For example, when the random errors of the multiple misaligned mapping tables are all greater than the preset error threshold, the electronic device may perform the misaligned rearrangement on the initial mapping table again until the generated mapping table is less than or equal to the preset error threshold.
For example, the electronic device may use a taylor formula to calculate the random errors of the multiple mapping relationship tables, and for a specific manner of calculating the random error of the misalignment rearrangement using the taylor formula, reference may be made to related records in the prior art, which is not described herein again.
The preset error threshold value can be determined by user-defined according to user requirements, and can also be determined according to empirical values.
After determining the mapping relationship table of the ith master node, the electronic device may obtain at least one first mapping relationship of the ith master node from the mapping relationship table of the ith master node, where each first mapping relationship represents a routing relationship between the ith master node and one slave node. Then, the electronic device may send each first mapping relationship and generation time of each first mapping relationship to the ith master node.
For example, the electronic device may send the first mapping relationship and the generation time of the first mapping relationship in an encrypted manner by using a key of the ith master node.
For example, the electronic device may encrypt, by using a Public Key (Public Key) of the ith host node, at least one first mapping relationship and a generation time thereof obtained from the mapping relationship table of the ith host node, and then send the encrypted first mapping relationship and the generated time to the node. After receiving the first mapping relationship, the ith host node may decrypt the first mapping relationship by using a Private Key (Private Key) to obtain each first mapping relationship and the generation time thereof.
It should be understood that the electronic device may perform the above mapping table and the first mapping table obtaining action on any host node in the decentralized peer-to-peer network. After receiving the first mapping relationship sent by the electronic device, any one of the master nodes may send the first mapping relationship to all other master nodes in the decentralized peer-to-peer network. Similarly, the any master node may also receive the second mapping sent from all other master nodes in the decentralized peer-to-peer network.
After receiving the at least one first mapping relation, the at least one second mapping relation, and the generation time of each first mapping relation and each second mapping relation, the ith host node may determine a target mapping relation.
For example, the ith master node may select, as the target mapping relationship of the master node, the mapping relationship that has the largest number of repeated occurrences and the earliest generation time from the received at least one first mapping relationship and at least one second mapping relationship.
After the target mapping relationship is determined, the ith master node and the slave node of the ith master node indicated by the target mapping relationship may bind the routing relationship represented by the target mapping relationship according to the obtained target mapping relationship.
For example, the ith master node and the slave node of the ith master node indicated by the target mapping relationship may bind the routing relationship characterized by the target mapping relationship by using a locking instruction, for example, a lock map instruction. The electronic device may also send the bound routing relationship to the slave node indicated in the target mapping relationship.
Then, the ith master node may further send the bound target mapping relationship to the electronic device. The electronic device may construct the network flow graph model using the target mapping relationships of the N master nodes, and the source node and the sink node.
The constructed network flow graph model comprises the routing information obtained by the components of at least one target page. When a user sends information of a page request at a client, the electronic device may obtain routing information of a component corresponding to the page from the network flow graph model, and directly obtain components rendered by other nodes according to the routing information. And performing combined display on the acquired components to finish one-time page display. And the page routing processing is carried out according to the network flow graph model, so that the rendering times of the client page are reduced, and the page loading time is shortened.
Optionally, the electronic device may determine neighbor nodes of the ith master node from the set of nodes; and storing a first mapping relation and a second mapping relation of the ith main node except the target mapping relation into the neighbor nodes.
As a possible implementation manner, the electronic device may obtain an exclusive or distance between the ith master node and another node according to the at least one first mapping relationship and the at least one second mapping relationship of the ith master node; and taking the node with the minimum XOR distance as the neighbor node of the i main nodes.
The XOR distance is the node distance represented by the counted number after XOR operation is performed on any two nodes and the counted number is 1.
The above storing the first mapping relationship and the second mapping relationship of the ith master node except the target mapping relationship into the neighbor node specifically means:
generating a subtree which meets a k-buckets routing table mechanism by using a first mapping relation and a second mapping relation of the ith main node except the target mapping relation; storing the subtree into the neighbor node.
After organizing the first mapping relation and the second mapping relation except the target mapping relation into a sub-tree and storing the sub-tree in the neighbor node, if the event that the routing relation cannot be realized is caused by crash or disconnection of the slave node indicated in the target mapping relation, the ith master node can reselect a new target mapping relation from the first mapping relation and the second mapping relation stored in the neighbor node and directly call the sub-tree routing of the target mapping relation. The selection mode of the new target mapping relation may be random, or may select the one with the largest number of repeated occurrences, or may select the one with the earliest generation time.
After the network flow graph model is built based on the nodes in the node set, the network flow graph model can be applied to the acquisition of the IDC platform page in the following manner. Fig. 4 is a schematic flowchart of another page routing processing method according to an embodiment of the present application. As shown in fig. 4, the method of the present application includes:
s201, receiving a request message from a client of the IDC self-service platform, wherein the request message is used for requesting to acquire a first target page.
Wherein the first target page is any one of at least one target page of the IDC self-service platform.
After receiving the first target page request information from the client, any node in the peer-to-peer network may obtain the identification information of the first target page, for example, the custom code of the first target page.
S202, according to the current page of the client, extracting the routing information of the first target page from a network flow graph model of the IDC self-service platform.
Wherein the component indicated by the routing information of the first destination page is a component constituting the first destination page on the basis of the current page.
The network flow graph model may be constructed based on the steps S101 to S103 described in the above embodiment.
Any node in the decentralized peer-to-peer network can acquire the routing information of the first target page from the network flow graph model according to the identity identification information of the first target page.
The network flow graph model may be sent to the IDC self-service platform after the electronic device is built, may also be sent to the IDC self-service platform by using other media, and may also be a way that, when the electronic device is built, each mapping relationship in the network flow graph model is bound to each node by using the ith master node and a slave node of the ith master node indicated by the target mapping relationship to bind the routing relationship represented by the target mapping relationship.
It should be understood that, when the electronic device performing the steps S101 to S103 described in the above embodiment is any node in the IDC self-service platform, the network flow graph model may also exist in the electronic device, and other nodes may also access the electronic device to obtain the network flow graph model. The method and the device do not limit how the nodes of the IDC self-service platform acquire the network flow graph model.
S203, acquiring the component of the first target page according to the routing information of the first target page.
Illustratively, the electronic device may obtain, through vue-router, the components of the first destination page according to the routing information of the first destination page.
Wherein, vue-router refers to the routing manager of Vue. js official, and can acquire and manage the routing information of the page components, and acquire the components from any node in the decentralized peer-to-peer network according to the routing information of the components. Js is a set of progressive JavaScript framework for constructing a user interface, and can provide a driver for a complex single page web application (SPA).
For example, the vue-router may find the routing information corresponding to the instruction according to the routing query instruction sent by the page request node, and obtain the corresponding page component through the routing path indicated by the routing information and send the page component to the page request node.
S204, sending the component of the first target page to the client, so that the client renders and displays the first target page by using the component of the first target page.
Any node in the peer-to-peer network can send the component of the first target page to the client after acquiring the component corresponding to the request page sent by vue-router, so that the client renders and displays the first target page by using the component of the first target page.
The page routing processing method provided by the embodiment of the application can construct a network flow graph model of components capable of acquiring at least one target page based on information of the target page capable of being provided for a user on an IDC self-service platform, and the network flow graph model can represent and acquire routing information of the components of each target page. In this way, after acquiring a request of a user for a certain page, the subsequent IDC self-service platform may dynamically extract routing information corresponding to each component in the page from the network flow graph model based on the network flow graph model and the current page, so that which components are rendered when the page is generated by rendering may be determined based on the dynamically determined routing information. According to the method, all components of the page requested by the user do not need to be rendered, namely, the same components in the page do not need to be rendered repeatedly, the page reuse rate is improved, the loading time of the page is shortened, and the user experience is improved.
Fig. 5 is a schematic structural diagram of a page routing processing apparatus according to an embodiment of the present application. As shown in fig. 5, the apparatus includes a first obtaining module 21, a second obtaining module 22 and a third obtaining module 23. Wherein:
a first obtaining module 21, configured to obtain information of at least one target page of the IDC self-service platform; the target page is a page which can be acquired from the IDC self-service platform through a client of the IDC self-service platform by a user; the target page is obtained by rendering at least one component;
a second obtaining module 22, configured to obtain, according to the information of the at least one target page, a node set of a component of the at least one target page provided in the IDC self-service platform;
a third obtaining module 23, configured to construct a network flow graph model based on the nodes in the node set, where the network flow graph model is used to indicate routing information corresponding to each target page, and the routing information is used to indicate a plurality of nodes that provide the target page in the node set, and obtain an order of components from the plurality of nodes.
Optionally, the third obtaining module 23 is specifically configured to:
generating an initial mapping relation table according to the node set, wherein the initial mapping relation table comprises: source node, sink node, 2N intermediate nodes, wherein, 2N intermediate nodes include: n master nodes and N slave nodes; n is a positive integer greater than 0; each master node has at least one slave node; the initial mapping relationship table includes: when the source node is used as a path starting point and the sink node is used as a path end point, the initial routing relation table is formed by the 2N intermediate nodes;
aiming at an ith main node, randomly generating a mapping relation table of the ith main node according to the initial mapping relation table, wherein i is an integer which is greater than 0 and less than or equal to N;
acquiring at least one first mapping relation of the ith main node from the mapping relation table of the ith main node, wherein each first mapping relation represents a routing relation between the ith main node and one slave node;
acquiring a target mapping relation of the ith host node; the target mapping relationship of the ith master node is determined from the at least one first mapping relationship and at least one second mapping relationship, and the second mapping relationship is used for representing the routing relationship between the ith master node and one slave node, which is obtained by other master nodes based on the mapping relationship tables of the other master nodes;
and constructing the network flow graph model by using the target mapping relations of the N main nodes, the source node and the sink node.
Optionally, the third obtaining module 23 is specifically configured to perform misalignment rearrangement on the mapping relationship in the initial mapping relationship table to obtain a plurality of misalignment rearranged mapping relationship tables of the ith master node; and selecting a staggered mapping relation table with a random error smaller than or equal to a preset error threshold value from the staggered mapping relation tables of the ith main node as the mapping relation table of the ith main node.
Optionally, the third obtaining module 23 is specifically configured to send each first mapping relationship and generation time of each first mapping relationship to the ith host node; receiving a target mapping relation obtained by the ith main node based on each second mapping relation from the other main nodes, the generation time of each second mapping relation, each first mapping relation and the generation time of each first mapping relation; the target mapping relation is the mapping relation which has the most repeated occurrence times and the earliest generation time in the first mapping relation and the second mapping relation.
Optionally, the third obtaining module 23 is specifically configured to send the first mapping relationship and the generation time of the first mapping relationship in an encrypted manner by using a key of the ith master node.
Optionally, the ith master node and the slave node of the ith master node indicated by the target mapping relationship bind the routing relationship characterized by the target mapping relationship.
Optionally, the third obtaining module 23 is further configured to, after the target mapping relationships using the N master nodes, and the source node and the sink node construct the network flow graph model, further: determining neighbor nodes of the ith master node from the node set; and storing a first mapping relation and a second mapping relation of the ith main node except the target mapping relation into the neighbor nodes.
Optionally, the third obtaining module 23 is specifically configured to obtain, according to the at least one first mapping relationship and the at least one second mapping relationship of the ith master node, an exclusive or distance between the ith master node and another node; and taking the node with the minimum XOR distance as the neighbor node of the i main nodes.
Optionally, the third obtaining module 23 is specifically configured to generate a subtree that satisfies a k-buckets routing table mechanism from a first mapping relationship and a second mapping relationship of the ith master node except for the target mapping relationship; storing the subtree into the neighbor node.
The page routing processing apparatus provided by the application is used for executing the embodiment of the page routing processing method, and the implementation principle and the technical effect are similar, which are not described again.
Fig. 6 is a schematic structural diagram of another page routing processing apparatus according to an embodiment of the present application. As shown in fig. 6, the apparatus includes a first obtaining module 31, a second obtaining module 32, a third obtaining module 33, and a sending module 34. Wherein:
a first obtaining module 31, configured to receive a request message from a client of the IDC self-service platform, where the request message is used to request to obtain a first target page; the first target page is any one of at least one target page of the IDC self-service platform;
a second obtaining module 32, configured to extract, according to the current page of the client, routing information of the first target page from a network flow graph model; the component indicated by the routing information of the first target page is a component which forms the first target page on the basis of the current page; the network flow graph model is used for indicating routing information corresponding to each target page, the routing information is used for indicating a plurality of nodes which provide the target pages in the node set, and acquiring the sequence of components from the nodes;
a third obtaining module 33, configured to obtain a component of the first destination page according to the routing information of the first destination page;
a sending module 34, configured to send the component of the first target page to the client, so that the client renders and displays the first target page by using the component of the first target page.
Optionally, the third obtaining module 33 is specifically configured to: and acquiring the components of the first target page through vue-router according to the routing information of the first target page.
The page routing processing apparatus provided by the application is used for executing the embodiment of the page routing processing method, and the implementation principle and the technical effect are similar, which are not described again.
Fig. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present application. As shown in fig. 7, the electronic device 400 may include: at least one processor 401 and memory 402.
A memory 402 for storing programs. In particular, the program may include program code including computer operating instructions.
The Memory 402 may include a Random Access Memory (RAM) and may also include a non-volatile Memory (non-volatile Memory), such as at least one disk Memory.
The processor 401 is configured to execute computer-executable instructions stored in the memory 402 to implement the page routing processing method described in the foregoing method embodiments. The processor 401 may be a Central Processing Unit (CPU), an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits configured to implement the embodiments of the present Application.
Optionally, the electronic device 400 may further include a communication interface 403. In a specific implementation, if the communication interface 403, the memory 402 and the processor 401 are implemented independently, the communication interface 403, the memory 402 and the processor 401 may be connected to each other through a bus and perform communication with each other. The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (EISA) bus, or the like. Buses may be classified as address buses, data buses, control buses, etc., but do not represent only one bus or type of bus.
Alternatively, in a specific implementation, if the communication interface 403, the memory 402 and the processor 401 are integrated into a single chip, the communication interface 403, the memory 402 and the processor 401 may complete communication through an internal interface.
The present application also provides a computer-readable storage medium, which may include: various media that can store program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a RAM Memory, a magnetic disk, or an optical disk, and in particular, the computer-readable storage medium stores program instructions, and the program instructions are used for the method in the above-mentioned embodiments.
The present application also provides a program product comprising execution instructions stored in a readable storage medium. The at least one processor of the electronic device may read the execution instruction from the readable storage medium, and the execution of the execution instruction by the at least one processor causes the electronic device to implement the page routing processing method provided in the various embodiments described above.
Finally, it should be noted that: the above embodiments are only used for illustrating the technical solutions of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present application.
Claims (16)
1. A page routing processing method is applied to an IDC self-service platform, wherein the IDC self-service platform comprises a plurality of nodes, and the plurality of nodes form a decentralized peer-to-peer network, and the method comprises the following steps:
acquiring information of at least one target page of the IDC self-service platform; the target page is a page which can be acquired from the IDC self-service platform through a client of the IDC self-service platform by a user; the target page is obtained by rendering at least one component;
acquiring a node set of components of the at least one target page provided in the IDC self-service platform according to the information of the at least one target page;
constructing a network flow graph model of the IDC self-service platform based on the nodes in the node set, wherein the network flow graph model is used for indicating routing information corresponding to each target page, the routing information is used for indicating a plurality of nodes which provide the target pages in the node set, and acquiring the sequence of components from the plurality of nodes.
2. The method according to claim 1, wherein the building a network flow graph model of the IDC self-service platform based on the node assembly nodes comprises:
generating an initial mapping relation table according to the node set, wherein the initial mapping relation table comprises: source node, sink node, 2N intermediate nodes, wherein, 2N intermediate nodes include: n master nodes and N slave nodes; n is a positive integer greater than 0; each master node has at least one slave node; the initial mapping relationship table includes: when the source node is used as a path starting point and the sink node is used as a path end point, the initial routing relation table is formed by the 2N intermediate nodes;
aiming at an ith main node, randomly generating a mapping relation table of the ith main node according to the initial mapping relation table, wherein i is an integer which is greater than 0 and less than or equal to N;
acquiring at least one first mapping relation of the ith main node from the mapping relation table of the ith main node, wherein each first mapping relation represents a routing relation between the ith main node and one slave node;
acquiring a target mapping relation of the ith host node; the target mapping relationship of the ith master node is determined from the at least one first mapping relationship and at least one second mapping relationship, and the second mapping relationship is used for representing the routing relationship between the ith master node and one slave node, which is obtained by other master nodes based on the mapping relationship tables of the other master nodes;
and constructing the network flow graph model by using the target mapping relations of the N main nodes, the source node and the sink node.
3. The method of claim 2, wherein the randomly generating the mapping relationship table for the ith master node comprises:
carrying out dislocation rearrangement on the mapping relation in the initial mapping relation table to obtain a plurality of dislocation rearranged mapping relation tables of the ith main node;
and selecting a staggered mapping relation table with a random error smaller than or equal to a preset error threshold value from the staggered mapping relation tables of the ith main node as the mapping relation table of the ith main node.
4. The method of claim 2, wherein the obtaining the target mapping relationship of the ith master node comprises:
sending each first mapping relation and the generation time of each first mapping relation to the ith main node;
receiving a target mapping relation obtained by the ith main node based on each second mapping relation from the other main nodes, the generation time of each second mapping relation, each first mapping relation and the generation time of each first mapping relation; the target mapping relation is the mapping relation which has the most repeated occurrence times and the earliest generation time in the first mapping relation and the second mapping relation.
5. The method of claim 4, wherein the sending each first mapping relationship to the ith master node and the generation time of each first mapping relationship comprises:
and sending the first mapping relation and the generation time of the first mapping relation in an encryption mode by using the key of the ith main node.
6. The method of claim 4, wherein the ith master node and the slave node of the ith master node indicated by the target mapping relationship bind the routing relationship characterized by the target mapping relationship.
7. The method of any of claims 2-6, wherein after constructing the network flow graph model using the target mappings for the N master nodes and the source node and the sink node, the method further comprises:
determining neighbor nodes of the ith master node from the node set;
and storing a first mapping relation and a second mapping relation of the ith main node except the target mapping relation into the neighbor nodes.
8. The method of claim 7, wherein the determining neighbor nodes of the ith master node from the set of nodes comprises:
acquiring the XOR distance between the ith main node and other nodes according to the at least one first mapping relation and the at least one second mapping relation of the ith main node;
and taking the node with the minimum XOR distance as the neighbor node of the i main nodes.
9. The method of claim 7, wherein storing the first mapping relationship and the second mapping relationship of the ith master node other than the target mapping relationship into the neighbor nodes comprises:
generating a subtree which meets a k-buckets routing table mechanism by using a first mapping relation and a second mapping relation of the ith main node except the target mapping relation;
storing the subtree into the neighbor node.
10. A page routing processing method is applied to an IDC self-service platform, wherein the IDC self-service platform comprises a plurality of nodes, and the plurality of nodes form a decentralized peer-to-peer network, and the method further comprises the following steps:
receiving a request message from a client of the IDC self-service platform, wherein the request message is used for requesting to acquire a first target page; the first target page is any one of at least one target page of the IDC self-service platform;
extracting the routing information of the first target page from a network flow graph model of the IDC self-service platform according to the current page of the client; the component indicated by the routing information of the first target page is a component which forms the first target page on the basis of the current page; the network flow graph model is used for indicating routing information corresponding to each target page, the routing information is used for indicating a plurality of nodes which provide the target pages in the node set, and acquiring the sequence of components from the nodes;
acquiring a component of the first target page according to the routing information of the first target page;
and sending the component of the first target page to the client so that the client renders and displays the first target page by utilizing the component of the first target page.
11. The method of claim 10, wherein obtaining the components of the first destination page according to the routing information of the first destination page comprises:
and acquiring the components of the first target page through vue-router according to the routing information of the first target page.
12. A page route processing apparatus, wherein the page route processing apparatus is applied to an IDC self-service platform, the IDC self-service platform includes a plurality of nodes, and the plurality of nodes form a decentralized peer-to-peer network, and the apparatus includes:
the first acquisition module is used for acquiring information of at least one target page of the IDC self-service platform; the target page is a page which can be acquired from the IDC self-service platform through a client of the IDC self-service platform by a user; the target page is obtained by rendering at least one component;
a second obtaining module, configured to obtain, according to the information of the at least one target page, a node set of a component of the at least one target page provided in the IDC self-service platform;
a third obtaining module, configured to construct a network flow graph model of the IDC self-service platform based on the node set internal nodes, where the network flow graph model is used to indicate routing information corresponding to each target page, and the routing information is used to indicate a plurality of nodes that provide the target page in the node set, and obtain an order of components from the plurality of nodes.
13. A page route processing device, wherein the page route processing device is applied to an IDC self-service platform, the IDC self-service platform includes a plurality of nodes, and the plurality of nodes form a decentralized peer-to-peer network, and the device further includes:
a first obtaining module, configured to receive a request message from a client of the IDC self-service platform, where the request message is used to request to obtain a first target page; the first target page is any one of at least one target page of the IDC self-service platform;
the second acquisition module is used for extracting the routing information of the first target page from a network flow graph model according to the current page of the client; the component indicated by the routing information of the first target page is a component which forms the first target page on the basis of the current page; the network flow graph model is used for indicating routing information corresponding to each target page, the routing information is used for indicating a plurality of nodes which provide the target pages in the node set, and acquiring the sequence of components from the nodes;
the third acquisition module is used for acquiring the components of the first target page according to the routing information of the first target page;
and the sending module is used for sending the component of the first target page to the client so that the client renders and displays the first target page by using the component of the first target page.
14. An electronic device, wherein the electronic device is applied to an IDC self-service platform, the IDC self-service platform comprises a plurality of nodes, and the plurality of nodes form a decentralized peer-to-peer network, and the electronic device comprises: at least one processor and memory;
the memory stores computer-executable instructions;
the at least one processor executing the computer-executable instructions stored by the memory causes the electronic device to perform the method of any of claims 1-11.
15. A computer-readable storage medium having computer-executable instructions stored thereon, which when executed by a processor, perform the method of any one of claims 1-11.
16. A computer program product, characterized in that it comprises a computer program which, when being executed by a processor, carries out the method of any one of claims 1-11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110656436.6A CN113392350B (en) | 2021-06-11 | 2021-06-11 | Page routing processing method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110656436.6A CN113392350B (en) | 2021-06-11 | 2021-06-11 | Page routing processing method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113392350A true CN113392350A (en) | 2021-09-14 |
| CN113392350B CN113392350B (en) | 2023-07-04 |
Family
ID=77620857
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110656436.6A Active CN113392350B (en) | 2021-06-11 | 2021-06-11 | Page routing processing method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113392350B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114253650A (en) * | 2021-12-27 | 2022-03-29 | 中国农业银行股份有限公司 | Display component transition method, device, equipment and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104580420A (en) * | 2014-12-26 | 2015-04-29 | 北京中交兴路车联网科技有限公司 | Trans-IDC (internet data center) data transmission system and method |
| WO2017036309A1 (en) * | 2015-08-31 | 2017-03-09 | 阿里巴巴集团控股有限公司 | Page rendering method, device and apparatus |
| US20190238449A1 (en) * | 2017-01-31 | 2019-08-01 | The Mode Group | High performance software-defined core network |
| CN110196721A (en) * | 2019-04-26 | 2019-09-03 | 腾讯科技（深圳）有限公司 | A kind of Internet data center's management method, system and medium |
| CN111859224A (en) * | 2020-07-31 | 2020-10-30 | 平安健康保险股份有限公司 | Server rendering method and device based on node server and computer equipment |
| CN112615786A (en) * | 2020-12-04 | 2021-04-06 | 北京神州泰岳软件股份有限公司 | Route determining method and device, electronic equipment and computer readable storage medium |
-
2021
- 2021-06-11 CN CN202110656436.6A patent/CN113392350B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104580420A (en) * | 2014-12-26 | 2015-04-29 | 北京中交兴路车联网科技有限公司 | Trans-IDC (internet data center) data transmission system and method |
| WO2017036309A1 (en) * | 2015-08-31 | 2017-03-09 | 阿里巴巴集团控股有限公司 | Page rendering method, device and apparatus |
| US20190238449A1 (en) * | 2017-01-31 | 2019-08-01 | The Mode Group | High performance software-defined core network |
| CN110196721A (en) * | 2019-04-26 | 2019-09-03 | 腾讯科技（深圳）有限公司 | A kind of Internet data center's management method, system and medium |
| CN111859224A (en) * | 2020-07-31 | 2020-10-30 | 平安健康保险股份有限公司 | Server rendering method and device based on node server and computer equipment |
| CN112615786A (en) * | 2020-12-04 | 2021-04-06 | 北京神州泰岳软件股份有限公司 | Route determining method and device, electronic equipment and computer readable storage medium |
Non-Patent Citations (3)
| Title |
|---|
| JÉRÔME KUNEGIS等: "KONECT: the Koblenz network collection", WWW \'13 COMPANION: PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON WORLD WIDE WEB, pages 1343 * |
| 楚亚鹏: "分布式路由器管理系统的设计与实现", 中国优秀硕士学位论文全文数据库 (信息科技辑), no. 4, pages 138 - 371 * |
| 高恩婷: "基于B/S模式的IDC机房虚拟仿真系统的设计与实现", 中国优秀硕士学位论文全文数据库 (信息科技辑), no. 11, pages 138 - 1126 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114253650A (en) * | 2021-12-27 | 2022-03-29 | 中国农业银行股份有限公司 | Display component transition method, device, equipment and storage medium |
| CN114253650B (en) * | 2021-12-27 | 2024-05-14 | 中国农业银行股份有限公司 | Display assembly transition method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113392350B (en) | 2023-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2020173287A1 (en) | Systems and methods for determining network shards in blockchain network | |
| CN111355723B (en) | Single sign-on method, device, equipment and readable storage medium | |
| JP7421771B2 (en) | Methods, application servers, IOT devices and media for implementing IOT services | |
| CN102299954A (en) | context-specific network resource addressing model for distributed services | |
| EP3817333B1 (en) | Method and system for processing requests in a consortium blockchain | |
| EP3308496B1 (en) | System, apparatus and method for secure coordination of a rendezvous point for distributed devices using entropy multiplexing | |
| CN111031519B (en) | Terminal access authentication method and device based on edge calculation | |
| JP2014508970A (en) | Data encryption processing apparatus and method for cloud storage system | |
| CN111178840A (en) | Service processing method, device, system, electronic equipment and storage medium | |
| CN111431818B (en) | Cross-domain request flow distribution method and device, storage medium and computer equipment | |
| CN110213250B (en) | Data processing method and terminal equipment | |
| CN109558710B (en) | User login method, device, system and storage medium | |
| CN113392350B (en) | Page routing processing method, device, equipment and storage medium | |
| US10182121B2 (en) | Cookie based session timeout detection and management | |
| CN113221154A (en) | Service password obtaining method and device, electronic equipment and storage medium | |
| CN112181599A (en) | Model training method, device and storage medium | |
| CN114205072A (en) | Authentication method, device and system | |
| US11950173B2 (en) | Method of determining shared service index based on shared service of communication credential | |
| US11936798B2 (en) | Securing a provable resource possession | |
| CN114640595A (en) | Cascading method, device, electronic equipment and storage medium | |
| CN112311551B (en) | Protecting provable resource ownership | |
| CN117176335B (en) | Data tracking method based on alliance chain and related equipment | |
| JP6246452B1 (en) | Information processing apparatus, information processing method, and information processing program | |
| Feng et al. | LPP-BPSI: A location privacy-preserving scheme using blockchain and Private Set Intersection in spatial crowdsourcing | |
| CN117979310A (en) | Model enhancement training method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |