CN102546226B - Multi-node-based network service provision system and method - Google Patents
Multi-node-based network service provision system and method Download PDFInfo
- Publication number
- CN102546226B CN102546226B CN201110084806.XA CN201110084806A CN102546226B CN 102546226 B CN102546226 B CN 102546226B CN 201110084806 A CN201110084806 A CN 201110084806A CN 102546226 B CN102546226 B CN 102546226B
- Authority
- CN
- China
- Prior art keywords
- service
- node
- client
- preference
- listing
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Computer And Data Communications (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention relates to a multi-node-based network service provision system and a multi-node-based network service provision method. The system comprises a plurality of service nodes, a client and a service node control module, wherein each service node is used for checking whether the service node has corresponding service contents or not according to a service request initiated by the client; the service node control module is used for allocating service cases to the service nodes according to the acquired information of the service nodes, maintaining dynamic corresponding relationships between the service cases and the service nodes and the service provision conditions of the service nodes, and simultaneously returning a list of candidate nodes corresponding to the service case to the client in response to the node query of the client; and the client creates and dynamically maintains a preference node list according to historical service acquisition conditions, dynamically updates the preference degrees of nodes in the preference node list, and acquires service from a node capable of providing the service. By the system and the method, service response can be quickened, and network transmission performance can be improved.
Description
Technical field
The present invention relates to network service field, particularly a kind of system and method for providing services on the Internet based on multinode.
Background technology
Growing along with Internet user, the optimization that build high performance network service system, reduce operating lag, simultaneously realizes network performance becomes pendulum a major challenge in face of people.Majority of network service at present adopts multiple nodes to build and forms, and utilizes multiple nodes to provide service to user simultaneously, provides performance to promote service.In addition, in existing method, can make service node more approach user by node being realized on geographical position distribute, improve service response speed, as CDN.
The core that builds multinode network service system is: select dynamically service node for different clients.In existing method, client is static to choosing of service node, be that client is in a service acquisition procedure, only from node transmission data, when service acquisition procedure consuming time when longer, likely in service acquisition procedure, response speed faster node has become available, client cannot be changed to faster node transmission data, and system resource fails to make full use of, and client user's service experience degree does not reach optimization.In addition, aspect service node chooses, prior art is all to need to realize to service node managing and control system application candidate node list by the each request service of client.Increase the weight of so on the one hand the load of managing and control system, on the other hand due to the irregularities that causes transfer of data with enchancement factor of choosing of final service node, and caused larger Internet Transmission expense.
Summary of the invention
The object of the invention is to, propose the system and method that a kind of multinode provides services on the Internet and realize Optimized Service response speed and network transmission performance.
For solving goal of the invention, the present invention proposes a kind of system of providing services on the Internet based on multinode, and this system comprises: multiple service nodes and client; It is characterized in that, this system also comprises: service node management and control module;
Described service node, checks whether have corresponding Service Instance for the service request of initiating according to client, meanwhile, reports load and the service request probability of this node by the timing heartbeat of service node to described service node management and control module; If there is corresponding Service Instance, service node judges whether to provide respective service to described client according to strategy;
Described service node management and control module, for disposing Service Instance to service node according to the load of service node and the information of service request probability that collect; And the dynamic corresponding relation of maintenance service example and service node and the service of service node provide situation; Meanwhile, the service node of customer in response end is inquired about, and returns to the candidate node list of corresponding with service example to client;
Described client, for creating according to historical service acquisition situation and the preferred node listing of Dynamic Maintenance and dynamically update the preference of preferred node listing node; And first obtain service according to preferential node listing to described service node;
1), if the service node preferably in node listing has been disposed respective service, client is initiated service request to the highest node of preference in preferred node listing:
11) if client can be obtained service by the highest node of preference from preferred node listing, obtain respective service;
12), if client can not be obtained service by the highest node of preference from preferred node listing, the node ranked second to preference in preferred node listing is initiated service request, the like, until obtain respective service;
Above-mentioned obtain respective service in, dynamically update the preference of current service node according to the situation of the service of obtaining, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating;
13) if the current service node select degree after dynamically updating is the highest, client continues to obtain respective service;
14), if the current service node select degree after dynamically updating is not the highest, client is initiated service request to the highest node of preference in the preferred node listing after dynamically updating;
If client can the preferred node listing from dynamically updating in the highest node of preference obtain service, switch to this node and continue to obtain respective service; If client can not the preferred node listing from dynamically updating in the highest node of preference obtain service, the node ranked second to preference in preferred node listing is initiated service request, the like, until the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating continues to obtain respective service;
Above-mentioned continue to obtain respective service in, dynamically update current service node select degree according to the situation of the service of obtaining, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating;
Repeating step 13) and 14) until client is intactly obtained service from service node;
2) if the service node in preferred node listing is not all disposed respective service example, client is obtained the candidate node list with respective service to described service node management and control module, random arbitrary service node in candidate node list is initiated service request and is obtained respective service, in the service of obtaining, whether the preference that provides situation to calculate this node according to the service of current service node, carry out size by this node select degree and the service node preference in preferred node listing and relatively adjudicate and this node is added in preferred node listing; Then regularly initiate service request to the highest node of present node preference that obtains service than client in the preferred node listing after dynamically updating;
Repeat described 13) and 14) until client from the complete service of obtaining of service node.
Described service node judges whether to provide the strategy of respective service to adopt service feature and local load combinations to judge to described client;
When business is that while downloading class, the content breakpoint of service node local disposition is only greater than client-requested breakpoint just can provide service to client; In the time that business is application class, service node is will be at local disposition complete and successfully start this application and could provide service to client.
Service node in described preferred node listing is that all nodes or the client that client is crossed service crossed the highest part of nodes of preference of service.
Described service request probability refers to that between service node recording timing heart beat period, client is initiated the request number of times to a service to it.
For achieving the above object, the present invention also proposes a kind of method of providing services on the Internet based on multinode, and the method concrete steps comprise:
Step 51): the service request that service node is initiated according to client checks whether have corresponding Service Instance; Meanwhile, report load and the service request probability of this node to described service node management and control module by the timing heartbeat of service node; If there is corresponding Service Instance, service node judges whether to provide respective service to described client according to strategy;
Step 52): service node management and control module is according to described step 51) in the service node load of this node and the information of service request probability of reporting by timing heartbeat Service Instance is disposed to service node; And the dynamic corresponding relation of maintenance service example and service node and the service of service node provide situation; Meanwhile, the service node of customer in response end is inquired about, and returns to the candidate node list of corresponding with service example to client;
Step 53): client creates according to historical service acquisition situation and the preferred node listing of Dynamic Maintenance and dynamically update the preference of node in preferred node listing; If preferably the service node in node listing has been disposed respective service content, go to step 55); If preferably the service node in node listing is not all disposed respective service content, client is at random to described step 52) arbitrary service node in the candidate node list that obtains initiates service request and obtains respective service, in the service of obtaining, whether the preference that provides situation to calculate this node according to the service of current service node, carry out size by this node select degree and the service node preference in preferred node listing and relatively adjudicate and this node is added in preferred node listing; Go to step 54);
Step 54): client is according to described step 53) calculate the preference of current service node obtaining and upgrade preferred node listing;
If the current service node select degree after dynamically updating is the highest, client continues to obtain respective service;
If the current service node select degree after dynamically updating is not the highest, client is initiated service request to the highest node of preference in the preferred node listing after dynamically updating;
If client can the preferred node listing from dynamically updating in the highest node of preference obtain service, switch to this node and continue to obtain respective service;
If client can not the preferred node listing from dynamically updating in the highest node of preference obtain service, the node ranked second to preference in preferred node listing is initiated service request, the like, until the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating continues to obtain respective service;
Above-mentioned continue to obtain respective service in, dynamically update current service node select degree according to the situation of the service of obtaining, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating;
Repeat described step 54) until client from the complete service of obtaining of service node;
Step 55): client is initiated service request to the highest node of preference in preferred node listing; If client can be obtained service by the highest node of preference from preferred node listing, obtain respective service; If client can not be obtained service by the highest node of preference from preferred node listing, the node ranked second to preference in preferred node listing is initiated service request, the like, until obtain respective service;
In obtaining respective service, dynamically update the preference of current service node according to the situation of the service of obtaining, then go to step 56);
Step 56): client is regularly to described step 55) the high node of present node preference that obtains service than client in preferred node listing after dynamically updating initiates service request;
If the current service node select degree after dynamically updating is the highest, client continues to obtain respective service from current service node;
If the current service node select degree after dynamically updating is not the highest, client is initiated service request to the highest node of preference in the preferred node listing after dynamically updating;
If client can the preferred node listing from dynamically updating in the highest node of preference obtain respective service, switch to this node and continue the service of obtaining,
If client can not the preferred node listing from dynamically updating in the highest node of preference obtain respective service, the node ranked second to preference in preferred node listing is initiated service request, the like, until the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating continues to obtain respective service;
Above-mentioned continue to obtain respective service in, dynamically update the preference of current service node, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating;
Repeat described step 56) until client from the complete service of obtaining of service node.
Described service node judges whether to provide the strategy of respective service to adopt service feature and local load combinations to judge to described client;
When business is that while downloading class, the content breakpoint of service node local disposition is only greater than client-requested breakpoint just can provide service to client; In the time that business is application class, service node is will be at local disposition complete and successfully start this application and could provide service to client.
Service node in described preferred node listing is that all nodes or the client that client is crossed service crossed the highest part of nodes of preference of service.
Described service request probability refers to that between service node recording timing heart beat period, client is initiated the request number of times to a service to it.
The invention has the advantages that, first, the present invention promotes service response speed.Because network topology is relatively constant, client can the fastest node of recording responses by historical experience, and preferentially to it, service request is proposed, hit even if do not obtain, because node can initiatively be disposed the acquisition speed of speed far above client to the Service Instance of managing and control system request service example and node, by handed over service node in due course, can realize on the whole the lifting of response speed; Secondly, optimized network transmission performance of the present invention.The present invention at every turn to managing and control system application candidate node list, has reduced the load of managing and control system without client; In addition,, by according to the request behavior of client, Service Instance being disposed to optimum node, realized service acquisition request independent, discrete each client has been gathered, thereby reduced Internet Transmission expense.
Accompanying drawing explanation
Fig. 1 is the system construction drawing of providing services on the Internet based on multinode;
Fig. 2 is that to provide downloading contents based on multinode be the method flow diagram of network service example;
Fig. 3 is the flow chart that the client cycle carries out content requests to preferred node.
Embodiment
Below in conjunction with the drawings and specific embodiments, the present invention will be described in detail.
As shown in Figure 1, Fig. 1 is the system construction drawing of providing services on the Internet based on multinode.The system of providing services on the Internet based on multinode that the present invention proposes, comprising: service node management and control module, service node and client.Service node management and control module can adopt centralized or distributed deployment.
Each service node load and service request probability that service node management and control module is obtained according to the cycle heartbeat of service node, be responsible for Service Instance to dispose to service node, and the dynamic corresponding relation of maintenance service example and node and the service of node provide situation; Meanwhile, the querying node of customer in response end, returns to the candidate node list of corresponding with service example.Node in candidate node list by client to the application of management and control module, for certain service, the service node disposed.Service request probability is that between service node recording timing heart beat period, client is initiated the service request number of times to certain service to it.
The service request that service node is initiated according to client checks whether have corresponding Service Instance; Meanwhile, report load and the requested information on services of this node to described service node management and control module by the timing heartbeat of service node; If there is corresponding Service Instance, judge whether to provide respective service to described client according to strategy.
Client is responsible for creating and the preferred node listing of Dynamic Maintenance and upgrade the preference of node in preferred node listing according to historical service acquisition situation, and initiates service request to service node and obtain service.Preferably node listing and preference are all dynamic.Preferably node listing is a dynamic listing of being safeguarded according to the historical information that receives service by client, and the service node in list is arranged by preference order from high in the end.The cumulative mean value of the preference service quality that to be client enjoy in the time receiving service.
First client obtains service according to preferential node listing to service node; If preferably the service node in node listing has been disposed respective service, client is initiated service request to the highest node of preference in preferred node listing, if client can be obtained service by the highest node of preference from preferred node listing, obtain respective service; In the service of obtaining, dynamically update the preference of current service node according to the situation of the service of obtaining, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating; If client can not be obtained service by the highest node of preference from preferred node listing, the node ranked second to preference in preferred node listing is initiated service request, the like, until obtain respective service; In the service of obtaining, dynamically update the preference of current service node according to the situation of the service of obtaining, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating.Client is that service request is initiated to the node higher than current service node select degree in the service limit that edge joint receipts current service node provides.
If the current service node select degree after dynamically updating is the highest, client continues to obtain respective service; And, in the service of obtaining, dynamically update the preference of current service node according to the situation of the service of obtaining, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating; If the current service node select degree after dynamically updating is not the highest, client is initiated service request to the highest node of preference in the preferred node listing after dynamically updating; If client can the preferred node listing from dynamically updating in the highest node of preference continue to obtain respective service, switch to this node and continue to obtain respective service, and, in continuing to obtain respective service, dynamically update current service node select degree according to the situation of the service of obtaining, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating; If client can not the preferred node listing from dynamically updating in the highest node of preference continue to obtain respective service, the node ranked second to preference in preferred node listing is initiated service request, the like, until the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating continues to obtain respective service; And, in continuing to obtain respective service, dynamically update the preference of current service node, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating; This process repeats until the client service of obtaining completes.It is initiatively to be initiated by client that client switches to the preferred node service of obtaining, the state of client maintenance service.And when client switching node obtains service, be on the basis that obtains before service, client switches to the node continuation higher than current service node select degree and obtains corresponding service.
If preferably the service node in node listing is not all disposed respective service example, client is obtained the candidate node list with respective service to service node management and control module, random arbitrary service node in candidate node list is initiated service request and is obtained respective service, in the service of obtaining, whether the preference that provides situation to calculate this node according to the service of current service node, carry out size by this node select degree and the service node preference in preferred node listing and relatively adjudicate and this node is added in preferred node listing; Then regularly initiate service request to the highest node of present node preference that obtains service than client in the preferred node listing after dynamically updating.Client is that service request is initiated to the node higher than current service node select degree in the service limit that edge joint receipts current service node provides.
If the current service node select degree after dynamically updating is the highest, client continues to obtain respective service; And, in the service of obtaining, dynamically update the preference of current service node according to the situation of the service of obtaining, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating; If the current service node select degree after dynamically updating is not the highest, client is initiated service request to the highest node of preference in the preferred node listing after dynamically updating; If client can the preferred node listing from dynamically updating in the highest node of preference continue to obtain respective service, switch to this node and continue the service of obtaining, and, in the service of obtaining, dynamically update current service node select degree according to the situation of the service of obtaining, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating; If client can not the preferred node listing from dynamically updating in the highest node of preference continue to obtain respective service, the node ranked second to preference in preferred node listing is initiated service request, the like, until the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating continues to obtain respective service; And, in the service of obtaining, dynamically update the preference of current service node, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating; This process repeats until the client service of obtaining completes.It is initiatively to be initiated by client that client switches to the preferred node service of obtaining, the state of client maintenance service.And when client switching node obtains service, be on the basis that obtains before service, client switches to the node continuation higher than current service node select degree and obtains corresponding service.
Service node judges whether to provide service to client according to strategy, and regularly reports load and the requested information on services of corresponding service node to service node management and control module.Service node judges whether to provide service for client according to multiple strategy.Service node can combine judgement according to the information such as service feature, local load, and in the time that business is download, streaming service class, the content breakpoint of service node local disposition is only greater than client-requested breakpoint just can provide service; When business is application class, service node is will be at local disposition complete and successfully start this application and could provide service to client.
As shown in Figure 2, Fig. 2 is that to provide downloading contents based on multinode be the method flow diagram of network service example.Comprise the following steps:
Step 201) client application obtains before service, and content is deployed in advance part service node by management and control module, the application of client terminal start-up service acquisition.
Step 202) client judges that whether preferred node listing is empty, empty if, jumps to step 205); If be not empty, continue step 203).
Step 203) client asks downloading contents successively according to the preference quality of preferred node.
Step 204) if the preferred node of request all cannot provide download, continue step 205); If preferably in node listing, certain node can provide download, jump procedure 207).
Step 205) client is to the candidate node list of management and control module request corresponding contents.
Step 206) obtain after candidate node list, client is chosen at random a node as service node from candidate node list, and records download state.
Step 207) when downloading contents, according to node, service provides situation to client, dynamically updates the preference in node and the preferential node listing in preference value, preferential node listing; Jump procedure 208.
Step 208) download.
As shown in Figure 3, Fig. 3 is the flow chart that the client cycle carries out content requests to preferred node.Comprise the following steps:
Step 301) cycle starts client and carries out the work of content requests to node in preferred node listing.
Step 302) judge whether current download node is optimum node, if so, jump procedure 306); Otherwise, continue step 303).
Step 303) from preferred node listing, choose than the more excellent node of current download node and carry out content requests.
Service node completes following operation simultaneously:
Service node obtains after content requests, checks whether the content of request exists, if existed, replys download can be provided; If content does not exist, record service request probability; With the timing heartbeat process of service node managing and control system in, report load and the service request probability of this node.
Service node management and control module determines requested content whether Dynamical Deployment is to this service node according to receiving information that service node reports.
Step 304) in the time that more excellent node exists document breaking point that client-requested file or node disposing more than the breakpoint of client-requested, this node can provide download service for client, this node can provide download, continues step 305); If can provide download, jump procedure 306 without more excellent node).
Step 305) to switch and download extremely more excellent node of node: client is downloaded to more excellent node request, and carries the download status information such as document breaking point position, and more excellent node provides download service according to the request of client.
Step 306) finish this detection.
It should be noted last that, above embodiment is only unrestricted in order to technical scheme of the present invention to be described.Although the present invention is had been described in detail with reference to embodiment, those of ordinary skill in the art is to be understood that, technical scheme of the present invention is modified or is equal to replacement, do not depart from the spirit and scope of technical solution of the present invention, it all should be encompassed in the middle of claim scope of the present invention.
Claims (6)
1. a system of providing services on the Internet based on multinode, this system comprises: multiple service nodes and client; It is characterized in that, this system also comprises: service node management and control module;
Described service node, checks whether have corresponding Service Instance for the service request of initiating according to client, meanwhile, reports load and the service request probability of this node by the timing heartbeat of service node to described service node management and control module; If there is corresponding Service Instance, service node judges whether to provide respective service to described client according to strategy, and described service request probability refers to that between service node recording timing heart beat period, client is initiated the request number of times to a service to it;
Described service node management and control module, for disposing Service Instance to service node according to the load of service node and the information of service request probability that collect; And the dynamic corresponding relation of maintenance service example and service node and the service of service node provide situation; Meanwhile, the service node of customer in response end is inquired about, and returns to the candidate node list of corresponding with service example to client;
Described client, for creating according to historical service acquisition situation and the preferred node listing of Dynamic Maintenance and dynamically update the preference of preferred node listing node; And first obtain service according to preferential node listing to described service node;
1), if the service node preferably in node listing has been disposed respective service, client is initiated service request to the highest node of preference in preferred node listing:
11) if client can be obtained service by the highest node of preference from preferred node listing, obtain respective service;
12), if client can not be obtained service by the highest node of preference from preferred node listing, the node ranked second to preference in preferred node listing is initiated service request, the like, until obtain respective service;
Above-mentioned obtain respective service in, dynamically update the preference of current service node according to the situation of the service of obtaining, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating;
13) if the current service node select degree after dynamically updating is the highest, client continues to obtain respective service;
14), if the current service node select degree after dynamically updating is not the highest, client is initiated service request to the highest node of preference in the preferred node listing after dynamically updating;
If client can the preferred node listing from dynamically updating in the highest node of preference obtain service, switch to this node and continue to obtain respective service; If client can not the preferred node listing from dynamically updating in the highest node of preference obtain service, the node ranked second to preference in preferred node listing is initiated service request, the like, until the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating continues to obtain respective service;
Above-mentioned continue to obtain respective service in, dynamically update current service node select degree according to the situation of the service of obtaining, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating;
Repeating step 13) and 14) until client is intactly obtained service from service node;
2) if the service node in preferred node listing is not all disposed respective service example, client is obtained the candidate node list with respective service to described service node management and control module, random arbitrary service node in candidate node list is initiated service request and is obtained respective service, in the service of obtaining, whether the preference that provides situation to calculate this node according to the service of current service node, carry out size by this node select degree and the service node preference in preferred node listing and relatively adjudicate and this node is added in preferred node listing; Then regularly initiate service request to the highest node of present node preference that obtains service than client in the preferred node listing after dynamically updating;
Repeat described 13) and 14) until client from the complete service of obtaining of service node.
2. system of providing services on the Internet based on multinode according to claim 1, is characterized in that, described service node judges whether to provide the strategy of respective service to adopt service feature and local load combinations to judge to described client;
When business is that while downloading class, the content breakpoint of service node local disposition is only greater than client-requested breakpoint just can provide service to client; In the time that business is application class, service node is will be at local disposition complete and successfully start this application and could provide service to client.
3. system of providing services on the Internet based on multinode according to claim 1, it is characterized in that, the service node in described preferred node listing is that all nodes or the client that client is crossed service crossed the highest part of nodes of preference of service.
4. a method of providing services on the Internet based on multinode, the method concrete steps comprise:
Step 51): the service request that service node is initiated according to client checks whether have corresponding Service Instance; Meanwhile, report load and the service request probability of this node to described service node management and control module by the timing heartbeat of service node; If there is corresponding Service Instance, service node judges whether to provide respective service to described client according to strategy, and described service request probability refers to that between service node recording timing heart beat period, client is initiated the request number of times to a service to it;
Step 52): service node management and control module is according to described step 51) in the service node load of this node and the information of service request probability of reporting by timing heartbeat Service Instance is disposed to service node; And the dynamic corresponding relation of maintenance service example and service node and the service of service node provide situation; Meanwhile, the service node of customer in response end is inquired about, and returns to the candidate node list of corresponding with service example to client;
Step 53): client creates according to historical service acquisition situation and the preferred node listing of Dynamic Maintenance and dynamically update the preference of node in preferred node listing; If preferably the service node in node listing has been disposed respective service content, go to step 55); If preferably the service node in node listing is not all disposed respective service content, client is at random to described step 52) arbitrary service node in the candidate node list that obtains initiates service request and obtains respective service, in the service of obtaining, whether the preference that provides situation to calculate this node according to the service of current service node, carry out size by this node select degree and the service node preference in preferred node listing and relatively adjudicate and this node is added in preferred node listing; Go to step 54);
Step 54): client is according to described step 53) calculate the preference of current service node obtaining and upgrade preferred node listing;
If the current service node select degree after dynamically updating is the highest, client continues to obtain respective service;
If the current service node select degree after dynamically updating is not the highest, client is initiated service request to the highest node of preference in the preferred node listing after dynamically updating;
If client can the preferred node listing from dynamically updating in the highest node of preference obtain service, switch to this node and continue to obtain respective service;
If client can not the preferred node listing from dynamically updating in the highest node of preference obtain service, the node ranked second to preference in preferred node listing is initiated service request, the like, until the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating continues to obtain respective service;
Above-mentioned continue to obtain respective service in, dynamically update current service node select degree according to the situation of the service of obtaining, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating;
Repeat described step 54) until client from the complete service of obtaining of service node;
Step 55): client is initiated service request to the highest node of preference in preferred node listing; If client can be obtained service by the highest node of preference from preferred node listing, obtain respective service; If client can not be obtained service by the highest node of preference from preferred node listing, the node ranked second to preference in preferred node listing is initiated service request, the like, until obtain respective service;
In obtaining respective service, dynamically update the preference of current service node according to the situation of the service of obtaining, then go to step 56);
Step 56): client is regularly to described step 55) the high node of present node preference that obtains service than client in preferred node listing after dynamically updating initiates service request;
If the current service node select degree after dynamically updating is the highest, client continues to obtain respective service from current service node;
If the current service node select degree after dynamically updating is not the highest, client is initiated service request to the highest node of preference in the preferred node listing after dynamically updating;
If client can the preferred node listing from dynamically updating in the highest node of preference obtain respective service, switch to this node and continue the service of obtaining,
If client can not the preferred node listing from dynamically updating in the highest node of preference obtain respective service, the node ranked second to preference in preferred node listing is initiated service request, the like, until the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating continues to obtain respective service;
Above-mentioned continue to obtain respective service in, dynamically update the preference of current service node, then regularly initiate service request to the high node of present node preference that obtains service than client in the preferred node listing after dynamically updating;
Repeat described step 56) until client from the complete service of obtaining of service node.
5. method of providing services on the Internet based on multinode according to claim 4, is characterized in that, described service node judges whether to provide the strategy of respective service to adopt service feature and local load combinations to judge to described client;
When business is that while downloading class, the content breakpoint of service node local disposition is only greater than client-requested breakpoint just can provide service to client; In the time that business is application class, service node is will be at local disposition complete and successfully start this application and could provide service to client.
6. method of providing services on the Internet based on multinode according to claim 4, it is characterized in that, the service node in described preferred node listing is that all nodes or the client that client is crossed service crossed the highest part of nodes of preference of service.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110084806.XA CN102546226B (en) | 2010-12-08 | 2011-04-06 | Multi-node-based network service provision system and method |
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010589971 | 2010-12-08 | ||
| CN201010589971.6 | 2010-12-08 | ||
| CN201110084806.XA CN102546226B (en) | 2010-12-08 | 2011-04-06 | Multi-node-based network service provision system and method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102546226A CN102546226A (en) | 2012-07-04 |
| CN102546226B true CN102546226B (en) | 2014-06-11 |
Family
ID=46352234
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110084806.XA Expired - Fee Related CN102546226B (en) | 2010-12-08 | 2011-04-06 | Multi-node-based network service provision system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102546226B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102868935A (en) * | 2012-08-24 | 2013-01-09 | 乐视网信息技术（北京）股份有限公司 | Scheduling method for responding multiple sources in content distribution network (CDN) |
| CN104518985A (en) * | 2013-09-27 | 2015-04-15 | 国家广播电影电视总局广播科学研究院 | Method and terminal for selecting service node in distributed network environment |
| CN103747040A (en) * | 2013-12-24 | 2014-04-23 | 乐视网信息技术（北京）股份有限公司 | Node distribution method and control center |
| CN108270634B (en) * | 2016-12-30 | 2021-08-24 | 中移(苏州)软件技术有限公司 | Heartbeat detection method and system |
| CN107483621A (en) * | 2017-09-06 | 2017-12-15 | 罗慕信息科技（上海）有限公司 | A kind of internet of things equipment connection method for automatically selecting service node |
| CN108134828A (en) * | 2017-12-20 | 2018-06-08 | 金蝶软件（中国）有限公司 | Method for routing, device, computer equipment and the storage medium of service request |
| CN108600165A (en) * | 2018-03-15 | 2018-09-28 | 北京大米科技有限公司 | Communication means, client, Centroid based on TCP and communication system |
| CN110311900A (en) * | 2019-06-19 | 2019-10-08 | 微梦创科网络科技（中国）有限公司 | A kind of service calling method, device, electronic equipment and storage medium |
| CN112543212B (en) | 2019-09-23 | 2022-06-14 | 中国科学院声学研究所 | System for providing request response exact communication delay guarantee for distributed service |
| CN111901362B (en) * | 2020-08-11 | 2022-07-01 | 深圳墨世科技有限公司 | Client dynamic CDN switching method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1859213A (en) * | 2006-03-01 | 2006-11-08 | 华为技术有限公司 | System and method for securing service lelel in content distribution network |
| CN101895577A (en) * | 2010-07-06 | 2010-11-24 | 中国科学院计算技术研究所 | Distribution method of network sharing resources |
| CN102065142A (en) * | 2010-12-23 | 2011-05-18 | 网宿科技股份有限公司 | File downloading based scheduling method and system for content delivery network (CDN) |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100488146C (en) * | 2006-09-14 | 2009-05-13 | 华为技术有限公司 | Method for establishing point-to-point collection in P2P network and nodes in P2P network |
-
2011
- 2011-04-06 CN CN201110084806.XA patent/CN102546226B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1859213A (en) * | 2006-03-01 | 2006-11-08 | 华为技术有限公司 | System and method for securing service lelel in content distribution network |
| CN101895577A (en) * | 2010-07-06 | 2010-11-24 | 中国科学院计算技术研究所 | Distribution method of network sharing resources |
| CN102065142A (en) * | 2010-12-23 | 2011-05-18 | 网宿科技股份有限公司 | File downloading based scheduling method and system for content delivery network (CDN) |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102546226A (en) | 2012-07-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102546226B (en) | Multi-node-based network service provision system and method | |
| JP3646126B2 (en) | Route selection type data transfer system, route selection method in data transfer, and medium recording program for executing the method | |
| CN101540775B (en) | Method and device for distributing contents and network system for distributing contents | |
| CN109257440A (en) | A kind of service discovery and client load equalization methods based on service register center | |
| CN100556038C (en) | A kind of content distribution method based on outer condition trigger node action | |
| CN105207947B (en) | A kind of gradual traffic scheduling method and system of filtering shake | |
| CN101406060A (en) | Time-delay video downloading service by using P2P content distribution network | |
| CN102143237A (en) | Grid-based Internet content delivery method and system | |
| CN102292963A (en) | Address allocation in a network | |
| CN101557423A (en) | System and method for realizing streaming media content service | |
| CN103051551A (en) | Distributed system and automatic maintaining method for same | |
| CN102164116A (en) | Method, system and corresponding device for balancing load | |
| JP2004531824A (en) | File transmission method in network environment | |
| KR20100060304A (en) | Distributed content delivery system based on network awareness and method thereof | |
| CN104202386B (en) | A kind of high concurrent amount distributed file system and its secondary load equalization methods | |
| CN101588287B (en) | Method, device and system for scheduling and downloading peer-to-peer network data | |
| CN102257792B (en) | Method for content delivery involving a policy database | |
| CN100452741C (en) | Expandable P2P flow media system | |
| CN102055644A (en) | Method, device and system for load management in distributed directory service system | |
| CN104158904B (en) | A kind of cloud auxiliary mobile P 2 P network collaboration method for down loading | |
| CN102420863A (en) | Rapid file distribution system, method thereof and apparatus thereof | |
| CN101551781A (en) | Method of magnetic disc cache replacement in P2P video on demand system | |
| CN102947821A (en) | Indexing server and method therefor | |
| JP4604824B2 (en) | Information distribution system, processing program, management program, information distribution method, etc. | |
| EP2472416B1 (en) | Data query system and constructing method thereof and corresponding data query method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140611 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |