CN106407399A - An XML_RPC service-based cloud resource retrieval method and system - Google Patents
An XML_RPC service-based cloud resource retrieval method and system Download PDFInfo
- Publication number
- CN106407399A CN106407399A CN201610838014.XA CN201610838014A CN106407399A CN 106407399 A CN106407399 A CN 106407399A CN 201610838014 A CN201610838014 A CN 201610838014A CN 106407399 A CN106407399 A CN 106407399A
- Authority
- CN
- China
- Prior art keywords
- node
- weight information
- neighbor
- xml
- routing
- 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.)
- Pending
Links
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/951—Indexing; Web crawling techniques
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/547—Remote procedure calls [RPC]; Web services
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Navigation (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides an XML_RPC service-based cloud resource retrieval method and system. The method comprises the steps that a cloud management network performs p2p communication on each node via the XML_RPC service; in the p2p communication, each node tracks an adjacent node to which it belongs; each node acquires the weight information of the adjacent node and feeds the weight information back to an initial node; the initial node generates a connectable node net type diagram according to the weight information; a processer calculates the values of the shortest paths from the initial node to the other nodes in the connectable node net type diagram according to the Dijkstra algorithm and arranges the values of the shortest paths in an ascending order; the initial node visits the other nodes according to the order. The method calculates the optimal paths from an initial node to the other nodes according to weight information and the Dijkstra algorithm and allows the initial node to visit the other nodes according to the optimal paths, so that the inter-node visit efficiency and the data resource retrieval efficiency are increased.
Description
Technical field
The present invention relates to field of computer technology, more particularly to a kind of cloud resource retrieval side based on XML_RPC service
Method and system.
Background technology
The full name of XML-RPC is XML Remote Procedure Call, i.e. XML (under standard generalized markup language
Individual subset) RMI.It is a set of allow to operate in different operating system, the program of varying environment is realized being based on
The specification of the Internet invocation of procedure and a series of realization.This remote procedure call is used http as host-host protocol, XML
Coded format as transmission information.The definition of XML-RPC maintains simply as far as possible, but can transmit simultaneously, processes, return
Reply miscellaneous data structure.
In current cloud data center, there is substantial amounts of node, different nodes stores substantial amounts of data resource.?
In concrete application, easily cause data resource in the case of this distributed storage repeats storage, not only wastes node resource,
Also cause to bear to node simultaneously.Therefore, how quick obtaining and using the resource on different nodes to determine on which node
Data resource be repeat become those skilled in the art concern problem.But, in being embodied as, if random access
Node carries out the retrieval of data resource, then lead to access efficiency relatively low,
As can be seen here, how to seek a kind of path of optimum to carry out the retrieval of the cloud resource between node is people in the art
Member ground urgently to be resolved hurrily problem.
Content of the invention
It is an object of the invention to provide a kind of cloud resource retrieval method based on XML_RPC service and system, it is used for seeking
A kind of optimum path carries out the retrieval of the cloud resource between node.
For solving above-mentioned technical problem, the present invention provides a kind of cloud resource retrieval method based on XML_RPC service, bag
Include：
Each node is carried out p2p communication by XML_RPC service by cloud management network；
Neighbor node belonging to it for each described nodes keep track in described p2p communication；
Each described node gets the weight information of described neighbor node, and described weight information is fed back to initial section
Point；
Start node generates according to described weight information can connecting node network diagramming；
Processor according to dijkstra's algorithm calculate described start node to described can be each in connecting node network diagramming
The shortest path value of remaining node, and described shortest path value is ranked up according to order from small to large；
Described start node accesses remaining node each according to described sequence；
Wherein, described start node is any one in described node.
Preferably, the weight information that described each described node gets described neighbor node specifically includes：
Obtain this node and arrive the routing node number of described neighbor node and the statistics time of other node failures of this node visit
Number；
Calculate described routing node number and the corresponding weight information of described statistics number according to predefined weight computing formula；
Wherein, described routing node number is less than maximum restriction number.
Preferably, described predefined weight computing formula is：Weight information=70%t+30%n；
Wherein, t is described routing node number, and n is described statistics number.
Preferably, obtain, by tracert order is described, routing node number and this section that this node arrives described neighbor node
Point accesses the statistics number of other node failures.
For solving above-mentioned technical problem, the present invention provides a kind of cloud resource retrieval system based on XML_RPC service, bag
Include：
Cloud management network, for carrying out p2p communication by XML_RPC service by each node；
Each described node, for following the trail of neighbor node belonging to it in described p2p communication, and closes on section described in getting
The weight information of point, described weight information is fed back to start node；
Start node, for according to described weight information generate can connecting node network diagramming, and according to sequence access each institute
State remaining node；
Processor, for according to dijkstra's algorithm calculate described start node to described can be in connecting node network diagramming
Remaining node each shortest path value, and described shortest path value is ranked up according to order from small to large；
Wherein, described start node is any one in described node.
Preferably, described each described node arrives routing node number and the basis of described neighbor node specifically for obtaining this node
The statistics number of other node failures of node visit, and calculate described routing node number and described according to predefined weight computing formula
The corresponding weight information of statistics number；
Wherein, described routing node number is less than maximum restriction number.
Preferably, described predefined weight computing formula is：Weight information=70%t+30%n；
Wherein, t is described routing node number, and n is described statistics number.
Preferably, each described node obtains, by tracert order is described, the route section that this node arrives described neighbor node
Points and the statistics number of other node failures of this node visit.
Cloud resource retrieval method based on XML_RPC service provided by the present invention and system, lead to including cloud management network
Cross XML_RPC service and each node is carried out p2p communication, neighbor node belonging to it for each nodes keep track, each node in p2p communication
Get the weight information of neighbor node, and weight information is fed back to start node, start node generates according to weight information
Can connecting node network diagramming, processor calculates start node to can be each in connecting node network diagramming according to dijkstra's algorithm
The shortest path value of remaining node, and shortest path value is ranked up according to order from small to large, start node is according to row
Sequence accesses remaining node each.As can be seen here, this method calculates start node by weight information and dijkstra's algorithm and arrives
The optimal path of remaining each node, so that start node conducts interviews to other nodes according to optimal path, improves between node
Access efficiency and data resource effectiveness of retrieval.
Brief description
In order to be illustrated more clearly that the embodiment of the present invention, the accompanying drawing of use required in embodiment will be done simply below
Introduce it should be apparent that, drawings in the following description are only some embodiments of the present invention, for ordinary skill people
For member, on the premise of not paying creative work, other accompanying drawings can also be obtained according to these accompanying drawings.
A kind of flow chart of cloud resource retrieval method based on XML_RPC service that Fig. 1 provides for the present invention；
Fig. 2 is the schematic diagram of the neighbor node of node V1 provided in an embodiment of the present invention and node V1；
Fig. 3 is the schematic diagram of the neighbor node of node V2 provided in an embodiment of the present invention and node V2；
Fig. 4 is the schematic diagram of the neighbor node of node V3 provided in an embodiment of the present invention and node V3；
Fig. 5 is the schematic diagram of the neighbor node of node V4 provided in an embodiment of the present invention and node V4；
Fig. 6 is a kind of corresponding node network diagramming of node V1- node V5 provided in an embodiment of the present invention.
Specific embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Site preparation description is it is clear that described embodiment is only a part of embodiment of the present invention, rather than whole embodiments.Based on this
Embodiment in invention, under the premise of not making creative work, obtained is every other for those of ordinary skill in the art
Embodiment, broadly falls into the scope of the present invention.
The core of the present invention is to provide a kind of cloud resource retrieval method based on XML_RPC service and device.
In order that those skilled in the art more fully understand the present invention program, with reference to the accompanying drawings and detailed description
The present invention is described in further detail.
A kind of flow chart of cloud resource retrieval method based on XML_RPC service that Fig. 1 provides for the present invention.As Fig. 1 institute
Show, the cloud resource retrieval method being serviced based on XML_RPC, including：
S10：Each node is carried out p2p communication by XML_RPC service by cloud management network.
S11：Neighbor node belonging to it for each nodes keep track in p2p communication.
S12：Each node gets the weight information of neighbor node, and weight information is fed back to start node.
S13：Start node generates according to weight information can connecting node network diagramming.
S14：Processor according to dijkstra's algorithm calculate start node to can in connecting node network diagramming each remaining
The shortest path value of node, and shortest path value is ranked up according to order from small to large.
S15：Start node accesses remaining node each according to sequence.
Wherein, start node is any one in described node.
In being embodied as, system contains substantial amounts of node, and different nodes may be stored with identical data resource,
In order to save memory space, and the quantity of saving node, need each node to be conducted interviews, to determine whether there is data
Resource repeats situation about storing.Therefore, how to carry out the access between node, which accesses after which first accesses, how could
Occurring without the problems such as Lou access just becomes the core of concern.In the present embodiment, sort by is used as by weight information and realizes visiting
Ask the way the optimization in footpath, detailed process is as follows.
First, between each node, p2p communication is carried out by XML_RPC service, each nodes keep track is belonging to it in p2p communication
Neighbor node.It is understood that each node can track one or more neighbor nodes, a node is corresponding
Neighbor node can conduct interviews, you can with by this node visit to its corresponding neighbor node.
Fig. 2 is the schematic diagram of the neighbor node of node V1 provided in an embodiment of the present invention and node V1.Fig. 3 is that the present invention is real
The schematic diagram of the neighbor node of node V2 and node V2 of example offer is provided.Fig. 4 is node V3 provided in an embodiment of the present invention and section
The schematic diagram of the neighbor node of point V3.Fig. 5 is the signal of the neighbor node of node V4 provided in an embodiment of the present invention and node V4
Figure.As shown in Figure 2, the neighbor node of node V1 is node V2, node V4 and node V5, from the figure 3, it may be seen that node V2's closes on section
Point is node V3, from the figure 3, it may be seen that the neighbor node of node V3 is node V5, as shown in Figure 4, the neighbor node of node V4 is section
Point V3 and node V5.Numeral wherein between each node is weight information, no longer describes one by one here.
Each node obtains the weight information of neighbor node, that is, for node V1, needs to obtain node V2, node V4
With the weight information of node V5, for node V2, need to obtain the weight information of node V3, for node V3, need
Obtain the weight information of node V5, for node V4, need to obtain the weight information of node V3 and node V5.
In being embodied as, start node is any one in described node, such as in the present embodiment, by node V1
As start node, the whole weight information of node V1 statistics generates node network diagramming.Fig. 6 is provided in an embodiment of the present invention one
Plant the corresponding node network diagramming of node V1- node V5.Numeral between two of which node is weight information.Table 1 is processor
The start node being calculated according to dijkstra's algorithm to remaining each node (node V1 to node V2, node V3, node V4 and
Node V5) path and weight information corresponding table.
Table 1
| Node path | Weight information |
| V1--V2 | 10 |
| V1—V4—V3 | 50 |
| V1—V4 | 30 |
| V1—V4—V3—V5 | 60 |
From the foregoing, it will be observed that the weight information of node V1 to node V2 is constant, the weight information of node V1 to node V4 is constant, section
The weight information of point V1 to node V5 from initial 100 be changed into 60 it can be seen that, access can be improved by above-mentioned path planning
Efficiency.
What the present embodiment provided includes cloud management network by XML_ based on the cloud resource retrieval method of XML_RPC service
Each node is carried out p2p communication by RPC service, neighbor node belonging to it for each nodes keep track in p2p communication, and each node gets
The weight information of neighbor node, and weight information is fed back to start node, start node generates and can connect according to weight information
Node network diagramming, processor calculates start node to can remaining section each in connecting node network diagramming according to dijkstra's algorithm
The shortest path value of point, and shortest path value is ranked up according to order from small to large, start node accesses according to sequence
Remaining node each.As can be seen here, to calculate start node by weight information and dijkstra's algorithm each to remaining for this method
The optimal path of node, so that start node conducts interviews to other nodes according to optimal path, improves the access between node
Efficiency and the effectiveness of retrieval of data resource.
Preferably embodiment, the weight information that each node gets neighbor node specifically includes：
Obtain this node and arrive the routing node number of neighbor node and the statistics number of other node failures of this node visit；
Calculate routing node number and the corresponding weight information of statistics number according to predefined weight computing formula；
Wherein, routing node number is less than maximum restriction number.
It is simply that routing node number and this node visit other node failure of node V2 will be obtained for node V1
Statistics number, the routing node number obtaining node V4 and the routing node number obtaining node V5.Other nodes repeat no more.Root
Calculate the weight information of egress V1 and node V2, node V4 and node V5 according to routing node number and statistics number, as illustrated,
It is respectively 10,30 and 100.
Preferably embodiment, predefined weight computing formula is：Weight information=70%t+30%n；
Wherein, t is routing node number, and n is statistics number.
It is understood that above-mentioned predefined weight computing formula is not a kind of only this form of expression, can also be it
The distribution of its ratio, merely just a kind of specific application scenarios.
Preferably embodiment, by tracert order obtain this node arrive neighbor node routing node number and
The statistics number of other node failures of this node visit.
A kind of cloud resource retrieval system based on XML_RPC service, including：
Cloud management network, for carrying out p2p communication by XML_RPC service by each node；
Each node, for following the trail of the neighbor node belonging to it in p2p in communicating, and gets the weight letter of neighbor node
Breath, weight information is fed back to start node；
Start node, for according to weight information generate can connecting node network diagramming, and access remaining section each according to sequence
Point；
Processor, for according to dijkstra's algorithm calculate start node to can in connecting node network diagramming each remaining
The shortest path value of node, and shortest path value is ranked up according to order from small to large；
Wherein, start node is any one in node.
In being embodied as, system contains substantial amounts of node, and different nodes may be stored with identical data resource,
In order to save memory space, and the quantity of saving node, need each node to be conducted interviews, to determine whether there is data
Resource repeats situation about storing.Therefore, how to carry out the access between node, which accesses after which first accesses, how could
Occurring without the problems such as Lou access just becomes the core of concern.In the present embodiment, sort by is used as by weight information and realizes visiting
Ask the way the optimization in footpath, detailed process is as follows.
First, between each node, p2p communication is carried out by XML_RPC service, each nodes keep track is belonging to it in p2p communication
Neighbor node.It is understood that each node can track one or more neighbor nodes, a node is corresponding
Neighbor node can conduct interviews, you can with by this node visit to its corresponding neighbor node.With Fig. 2-Fig. 5
As a example, as shown in Figure 2, the neighbor node of node V1 is node V2, node V4 and node V5, from the figure 3, it may be seen that node V2's closes on
Node is node V3, from the figure 3, it may be seen that the neighbor node of node V3 is node V5, as shown in Figure 4, the neighbor node of node V4 is
Node V3 and node V5.Numeral wherein between each node is weight information, no longer describes one by one here.
Each node obtains the weight information of neighbor node, that is, for node V1, needs to obtain node V2, node V4
With the weight information of node V5, for node V2, need to obtain the weight information of node V3, for node V3, need
Obtain the weight information of node V5, for node V4, need to obtain the weight information of node V3 and node V5.
In being embodied as, start node is any one in described node, such as in the present embodiment, by node V1
As start node, the whole weight information of node V1 statistics generates node network diagramming.The corresponding node net of node V1- node V5
Shape figure, as shown in Figure 6.Numeral between two of which node is weight information, referring to table 1.From the foregoing, it will be observed that node V1 is to node
The weight information of V2 is constant, and the weight information of node V1 to node V4 is constant, and the weight information of node V1 to node V5 is by initial
100 be changed into 60 it can be seen that, the efficiency of access can be improved by above-mentioned path planning.
What the present embodiment provided includes cloud management network based on the cloud resource retrieval device of XML_RPC service, is used for passing through
Each node is carried out p2p communication by XML_RPC service；Each node, for following the trail of the neighbor node belonging to it in p2p in communicating, and
Get the weight information of neighbor node, weight information is fed back to start node；Start node, for giving birth to according to weight information
One-tenth can connecting node network diagramming, and access remaining node each according to sequence；Processor, for calculating according to dijkstra's algorithm
Start node to can remaining node each in connecting node network diagramming shortest path value, and by shortest path value according to from little to
Big order is ranked up.As can be seen here, this device calculates start node by weight information and dijkstra's algorithm and arrives
The optimal path of remaining each node, so that start node conducts interviews to other nodes according to optimal path, improves between node
Access efficiency and data resource effectiveness of retrieval.
Preferably embodiment, each node arrives routing node number and the basis of neighbor node specifically for obtaining this node
The statistics number of other node failures of node visit, and calculate routing node number and statistics number according to predefined weight computing formula
Corresponding weight information；
Wherein, routing node number is less than maximum restriction number.
Preferably embodiment, predefined weight computing formula is：Weight information=70%t+30%n；
Wherein, t is routing node number, and n is statistics number.
Preferably embodiment, each node obtains, by tracert order, the route section that this node arrives neighbor node
Points and the statistics number of other node failures of this node visit.
Because the embodiment of components of system as directed is mutually corresponding with the embodiment of method part, therefore the embodiment of components of system as directed please
Referring to the description of the embodiment of method part, wouldn't repeat here.
Above detailed Jie is carried out to the cloud resource retrieval method based on XML_RPC service provided by the present invention and system
Continue.In specification, each embodiment is described by the way of going forward one by one, and what each embodiment stressed is and other embodiment
Difference, between each embodiment identical similar portion mutually referring to.For device disclosed in embodiment, by
Correspond to the method disclosed in Example in it, so description is fairly simple, referring to method part illustration in place of correlation.
It should be pointed out that for those skilled in the art, under the premise without departing from the principles of the invention, can also be right
The present invention carries out some improvement and modifies, and these improve and modify and also fall in the protection domain of the claims in the present invention.
Professional further appreciates that, in conjunction with the unit of each example of the embodiments described herein description
And algorithm steps, can with electronic hardware, computer software or the two be implemented in combination in, in order to clearly demonstrate hardware and
The interchangeability of software, generally describes composition and the step of each example in the above description according to function.These
Function to be executed with hardware or software mode actually, the application-specific depending on technical scheme and design constraint.Specialty
Technical staff can use different methods to each specific application realize described function, but this realization should
Think beyond the scope of this invention.
The step of the method in conjunction with the embodiments described herein description or algorithm can directly be held with hardware, processor
The software module of row, or the combination of the two is implementing.Software module can be placed in random access memory (RAM), internal memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technology
In known any other form of storage medium in field.
Claims (8)
1. a kind of cloud resource retrieval method based on XML_RPC service is it is characterised in that include：
Each node is carried out p2p communication by XML_RPC service by cloud management network；
Neighbor node belonging to it for each described nodes keep track in described p2p communication；
Each described node gets the weight information of described neighbor node, and described weight information is fed back to start node；
Start node generates according to described weight information can connecting node network diagramming；
Processor according to dijkstra's algorithm calculate described start node to described can in connecting node network diagramming each remaining
The shortest path value of node, and described shortest path value is ranked up according to order from small to large；
Described start node accesses remaining node each according to described sequence；
Wherein, described start node is any one in described node.
2. method according to claim 1 is it is characterised in that described each described node gets the power of described neighbor node
Weight information specifically includes：
Obtain this node and arrive the routing node number of described neighbor node and the statistics number of other node failures of this node visit；
Calculate described routing node number and the corresponding weight information of described statistics number according to predefined weight computing formula；
Wherein, described routing node number is less than maximum restriction number.
3. method according to claim 2 is it is characterised in that described predefined weight computing formula is：Weight information=
70%t+30%n；
Wherein, t is described routing node number, and n is described statistics number.
4. method according to claim 2 it is characterised in that arrived described by tracert order this node of described acquisition
The routing node number of neighbor node and the statistics number of other node failures of this node visit.
5. a kind of cloud resource retrieval system based on XML_RPC service is it is characterised in that include：
Cloud management network, for carrying out p2p communication by XML_RPC service by each node；
Each described node, for following the trail of the neighbor node belonging to it in described p2p communication, and gets described neighbor node
Weight information, described weight information is fed back to start node；
Start node, for according to described weight information generate can connecting node network diagramming, and according to sequence access each described its
Remaining node；
Processor, for according to dijkstra's algorithm calculate described start node to described can be each in connecting node network diagramming
The shortest path value of remaining node, and described shortest path value is ranked up according to order from small to large；
Wherein, described start node is any one in described node.
6. system according to claim 5 is it is characterised in that described each described node is specifically for obtaining this node to institute
State the routing node number of neighbor node and the statistics number of other node failures of this node visit, and calculate according to predefined weight public
Formula calculates described routing node number and the corresponding weight information of described statistics number；
Wherein, described routing node number is less than maximum restriction number.
7. system according to claim 6 is it is characterised in that described predefined weight computing formula is：Weight information=
70%t+30%n；
Wherein, t is described routing node number, and n is described statistics number.
8. system according to claim 6 is it is characterised in that each described node obtains this by tracert order is described
The routing node number to described neighbor node for the node and the statistics number of other node failures of this node visit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610838014.XA CN106407399A (en) | 2016-09-21 | 2016-09-21 | An XML_RPC service-based cloud resource retrieval method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610838014.XA CN106407399A (en) | 2016-09-21 | 2016-09-21 | An XML_RPC service-based cloud resource retrieval method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106407399A true CN106407399A (en) | 2017-02-15 |
Family
ID=57996760
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610838014.XA Pending CN106407399A (en) | 2016-09-21 | 2016-09-21 | An XML_RPC service-based cloud resource retrieval method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106407399A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110572282A (en) * | 2019-08-27 | 2019-12-13 | 中山大学 | Cloud manufacturing service combination optimization method based on k _ Dijkstra algorithm |
| CN113872850A (en) * | 2021-09-27 | 2021-12-31 | 东莞市亚太未来软件有限公司 | Real-time communication method and system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101765225A (en) * | 2008-12-24 | 2010-06-30 | 华为技术有限公司 | Virtual cluster management system and cluster node |
| CN101827024A (en) * | 2010-03-24 | 2010-09-08 | 林定伟 | Network path finding method, optimal path selecting method and system thereof |
| CN102158559A (en) * | 2011-04-18 | 2011-08-17 | 浙江工业大学 | Peer-to-peer (P2P) network-based load balancing method |
| CN103020062A (en) * | 2011-09-20 | 2013-04-03 | 佳都新太科技股份有限公司 | Front end and server interaction realization method based on XML-RPC (Extensive Makeup Language-Remote Procedure Calling) |
| CN104270313A (en) * | 2014-09-29 | 2015-01-07 | 清华大学 | Method for adjusting utilization rate of network link |
| CN105743980A (en) * | 2016-02-03 | 2016-07-06 | 上海理工大学 | Constructing method of self-organized cloud resource sharing distributed peer-to-peer network model |
-
2016
- 2016-09-21 CN CN201610838014.XA patent/CN106407399A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101765225A (en) * | 2008-12-24 | 2010-06-30 | 华为技术有限公司 | Virtual cluster management system and cluster node |
| CN101827024A (en) * | 2010-03-24 | 2010-09-08 | 林定伟 | Network path finding method, optimal path selecting method and system thereof |
| CN102158559A (en) * | 2011-04-18 | 2011-08-17 | 浙江工业大学 | Peer-to-peer (P2P) network-based load balancing method |
| CN103020062A (en) * | 2011-09-20 | 2013-04-03 | 佳都新太科技股份有限公司 | Front end and server interaction realization method based on XML-RPC (Extensive Makeup Language-Remote Procedure Calling) |
| CN104270313A (en) * | 2014-09-29 | 2015-01-07 | 清华大学 | Method for adjusting utilization rate of network link |
| CN105743980A (en) * | 2016-02-03 | 2016-07-06 | 上海理工大学 | Constructing method of self-organized cloud resource sharing distributed peer-to-peer network model |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110572282A (en) * | 2019-08-27 | 2019-12-13 | 中山大学 | Cloud manufacturing service combination optimization method based on k _ Dijkstra algorithm |
| CN110572282B (en) * | 2019-08-27 | 2021-06-08 | 中山大学 | Cloud manufacturing service combination optimization method based on k _ Dijkstra algorithm |
| CN113872850A (en) * | 2021-09-27 | 2021-12-31 | 东莞市亚太未来软件有限公司 | Real-time communication method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| El Fissaoui et al. | Energy efficient and fault tolerant distributed algorithm for data aggregation in wireless sensor networks | |
| CN104969518B (en) | Method for routing data and device | |
| Vega et al. | A technological overview of the guifi. net community network | |
| Saha et al. | Designing delay constrained hybrid ad hoc network infrastructure for post-disaster communication | |
| To et al. | PrivGeoCrowd: A toolbox for studying private spatial crowdsourcing | |
| CN101873224A (en) | Cloud computing load balancing method and equipment | |
| CN103678572B (en) | Method and system for searching for Internet of Things information based on two layers of DHTs | |
| Liao et al. | Accurate sub-swarms particle swarm optimization algorithm for service composition | |
| CN106203956A (en) | Project management system based on cloud computing | |
| CN110519090A (en) | A kind of accelerator card distribution method, system and the associated component of FPGA cloud platform | |
| CN106464584A (en) | Providing router information according to a programmatic interface | |
| CN102467389A (en) | Web browser-based business process management engine | |
| CN102594679A (en) | Method and equipment for determining operation information of network nodes in video application | |
| Kapoor et al. | Peer clouds: a P2P-based resource discovery mechanism for the Intercloud | |
| CN106407399A (en) | An XML_RPC service-based cloud resource retrieval method and system | |
| Miao et al. | Multicast virtual network mapping for supporting multiple description coding-based video applications | |
| Firdhous et al. | Cloud computing for rural ICT development: Opportunities and challenges | |
| Panadero et al. | A two-stage multi-criteria optimization method for service placement in decentralized edge micro-clouds | |
| Zhu et al. | A hybrid reliable heuristic mapping method based on survivable virtual networks for network virtualization | |
| Giatili et al. | Semantic aware resource mapping for future internet experimental facilities | |
| Gao et al. | Cloud based cyber-physical systems in the design of next-generation digital systems | |
| Xuan et al. | Multiobjective model and improved artificial raindrop algorithm for virtual network mapping | |
| Mohan et al. | Broker based trust architecture for federated healthcare cloud system | |
| Li et al. | Centaur: Dynamic message dissemination over online social networks | |
| Divoux et al. | A session protocol for wireless sensor networks. Application to oil spills monitoring |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170215 |