CN1466070A - Computer network system for raising network node connection effectiveness - Google Patents
Computer network system for raising network node connection effectiveness Download PDFInfo
- Publication number
- CN1466070A CN1466070A CNA021403988A CN02140398A CN1466070A CN 1466070 A CN1466070 A CN 1466070A CN A021403988 A CNA021403988 A CN A021403988A CN 02140398 A CN02140398 A CN 02140398A CN 1466070 A CN1466070 A CN 1466070A
- Authority
- CN
- China
- Prior art keywords
- processing node
- incoming event
- node
- load
- connecting state
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention is a kind of computer network which can enhance the joining efficiency of net injunctions; it is constructed on a new network which contains geography corodinate information; it can execute a learning procedure at first, each processing injunction records and updates current state when it receives an input affair and executes the affair, according to the transferring reference of enhancing the net joining efficiency, when one injunctino is overload and receives a affair, it can transfer the affair to another processing injunction in real time.
Description
Technical field
The invention relates to a kind of computer networking technology, particularly about a kind of computer network system of promoting network node binding usefulness, it is to be established on a kind of network system that contains geographic coordinate information of new proposition, and can be for example in order to implement an e-commerce system, can be in order to allow wherein any one processing node with incoming event, it for example is the binding request that client station sent, promoting network connections usefulness mode with tool changes and is linked to the another one processing node, reach whereby and promote network node binding usefulness, that is reach the transmission benefit of promoting e-commerce system.
Background technology
Computer network system is that the main frame more than two or two is connected to one by telecommunication technique, in order to allow any one client station all can be online to any main frame in this computer network system, allow client station can use software and hardware resources and the data processing function in any main frame in the network system whereby or information on its various lines that provide is provided.
The most frequently used binding framework of known computer network system is tree-shaped type and links framework.Present most computer network system, for example internet (Internet), company's internal network system (intranet), intercompany network system (extranet), or the like, all be to be established in the tree-shaped type of this kind to link framework.
In the application of computer network system, often have to need to carry out to change to link flow process; That is when client station is linked to some processing nodes, when if this processing node can't be accepted the binding request of this client station for fully loaded situation at present or be necessary the processing of request work allocation of client station institute to other processing node, then can be then be linked to the another one processing node with the binding request of this client station, allow other processing node accept the binding request of client station whereby.
Yet a shortcoming of the known tree-shaped type network architecture is that its efficient of changeing the binding flow process is lower; This is because it often need change via other processing node and reach required processing node.
In addition, (that is shorten and the processing node of institute's warp reduces when data transmission distance because the data transmission benefit between two processing nodes and distance dependent therebetween, then transmitting benefit will increase), therefore known technology is in changeing when linking flow process, and can't find the contiguous processing node in geographic position to change the binding flow process.
Moreover, arbitrary processing node may receive the specific incoming event that is transmitted by a plurality of client station between the specific period, at this moment, will cause the operating load of this processing node excessive and user that can't make way for client station obtains required service in real time; Yet opposite, other regional processing node may be in the little state of operating load, and the area that for example densely populated degree is low or number of netizens is less so, makes that whole network utilization benefit is lower, can't reach and promote the network utilization benefit.
Summary of the invention
In order to overcome the shortcoming of prior art, fundamental purpose of the present invention is to provide a kind of computer network system that network node links usefulness of promoting, and it can promote the reference frame that network node links usefulness as reaching with the geographic position and the spacing distance of processing node.
Another object of the present invention is to provide a kind of and promote the computer network system that network node links usefulness, but the operating load amount of its each processing node of balance, and the user who makes way for client station obtains required service in real time.
Computer network system of the present invention is to be established on a kind of network system that contains geographic coordinate information of new proposition; Its characteristics are at first to carry out a learning program, wherein when receiving an incoming event and carrying out this incoming event, write down and upgrade present operating state by each processing node, obtain tool according to this and promote the commentaries on classics binding reference of network connections usefulness, whereby when the running load of a processing node excessive and its when receiving an incoming event again, be linked to the another one processing node and can in real time this incoming event be changeed.
Description of drawings
Fig. 1 is a synoptic diagram, the grown form of the netted totally interconnected type network architecture of geographic coordinate locate mode that wherein shows computer network system of the present invention and adopted;
Fig. 2 is a system architecture synoptic diagram, wherein shows one of computer network system of the present invention
Embodiment;
Fig. 3 is a system architecture synoptic diagram, wherein shows another embodiment of computer network system of the present invention;
Fig. 4 is a data structure synoptic diagram, wherein shows a stored connecting state data of database structure in each main frame of the 2nd figure; And
Fig. 5 is a process flow diagram, the network system 11 processing nodes 12 processing nodes 13 processing nodes 14 processing nodes 15 processing nodes 20 enhancement network nodes of the present invention that wherein shows the handling procedure of computer network system of the present invention for incoming event. number in the figure explanation 10 contains geographical coordinate information link computer network system 21 network hosts (processing node) 21a secondary network main frame 21b secondary network main frame 21c secondary network main frame 22 network hosts (processing node) 23 network hosts (processing node) 24 network hosts (processing node) 25 network hosts (processing node) the 30 client stations 40 connecting state databases of usefulness
Embodiment
Below in conjunction with accompanying drawing, describe the technical scheme that enhancement network node of the present invention links the computer network system of usefulness in detail.
Computer network system of the present invention is the network system that contains geographic coordinate information that is established in a kind of new proposition.The detailed content of the new network system that proposes of relevant this kind sees also the patent specification of the application for a patent for invention case [network system that contains geographic coordinate information] that the present patent application people proposes simultaneously.
Below will cooperate Fig. 1 to sketch the basic concepts that this contains the network system of geographic coordinate information.
The basic concepts that contain the network system of geographic coordinate information
The synoptic diagram of Fig. 1 promptly shows the grown form of the network system that contains geographic coordinate information (as the part that frame of broken lines comprised of label 10 indications) of this new proposition.In this example, suppose that this network system 10 comprises 5 processing nodes 11,12,13,14,15 (annotating: be that example explains with 5 processing nodes only, in fact can be the processing node of any number) herein.
The characteristics of this network system 10 are wherein all to be linked to other all processing node mutually by each processing node 11,12,13,14,15, and (that is processing node 11 is to be linked to processing node 12,13,14,15 simultaneously; Processing node 12 is to be linked to processing node 11,13,14,15 simultaneously; Processing node 13 is to be linked to processing node 11,12,14,15 simultaneously; Processing node 14 is to be linked to processing node 11,12,13,15 simultaneously; Processing node 15 then is to be linked to processing node 11,12,13,14 simultaneously); And wherein each processing node 11,12,13,14,15 is set with one group of exclusive Geographical Coordinates Parameter respectively, for example be the longitude and latitude (longitude-altitude) in the place at its place, in order to indicate the geographic position at each processing node 11,12,13,14,15 places.
Suppose (α
1, β
1) represent the longitude and latitude in the geographic position at processing node 11 places; (α
2, β
2) represent the longitude and latitude in the geographic position at processing node 12 places; (α
3, β
3) represent the longitude and latitude in the geographic position at processing node 13 places; (α
4, β
4) represent the longitude and latitude in the geographic position at processing node 14 places; And (α
5, β
5) then represent the longitude and latitude in the geographic position at processing node 15 places; And wherein be for being negative value on the occasion of, west longitude with east longitude; And with north latitude for being negative value on the occasion of, south latitude.
Then any two geographic position (α
i, β
i) and (α
j, β
j), i, j=1,2,3,4,5, between surface distance D
IjCan according to the basis vector theorem try to achieve into:
D
ij＝R·｜cos-1[cosβ
icosβ
jcos(α
i-α
j)+sinβ
isinβ
j]｜
Wherein R represents the radius of the earth.
Below will deserve to be called the formula of stating and be " longitude and latitude spacing formula ".Because each processing node 11,12,13,14,15 all is set with one group of exclusive latitude and longitude coordinates parameter, the geographic position of therefore adopting the computer network system of network system of the present invention can make each processing node 11,12,13,14,15, and can make surface distance between any two processing nodes according to above-mentioned longitude and latitude spacing formula.
Enhancement network node of the present invention links the embodiment of the computer network system of usefulness
The synoptic diagram of Fig. 2 promptly shows an embodiment (as the part that frame of broken lines comprised of label 20 indications) of computer network system of the present invention, promptly is established in the aforesaid network system that contains geographic coordinate information.
In embodiment shown in Figure 2, suppose that computer network system 20 of the present invention comprises 5 network hosts (being processing node) 21,22,23,24,25 and (annotates: be that example explains with 5 network hosts only herein, in fact can be the network host of any number), wherein each network host 21,22,23,24,25 all is linked to other all network host mutually; And wherein each network host 21,22,23,24,25 are set with one according to the geographic position at its place respectively comprises each network host 21,22,23,24,25 exclusive Geographical Coordinates Parameter reach and the corresponding respectively main frame domain name that comprises of this Geographical Coordinates Parameter, the connecting state database 40 of host IP address and load condition, this Geographical Coordinates Parameter for example is the longitude and latitude in the place at its place, connecting state database 40 shown in the 4th figure is in order to indicate each network host 21,22,23,24, the geographic position at 25 places with and connecting state.Suppose (α
1, β
1) represent the longitude and latitude in the geographic position at network host 21 places; (α
2, β
2) represent the longitude and latitude in the geographic position at network host 22 places; (α
3, β
3) represent the longitude and latitude in the geographic position at network host 23 places; (α
4, β
4) represent the longitude and latitude in the geographic position at network host 24 places; And (α
5, β
5) then represent the longitude and latitude in the geographic position at network host 25 places.
In addition, each processing node in the computer network system 20 shown in Figure 2 (being network host 21,22,23,24,25) also can and then be linked to a secondary network system, for example is local LAN system.
Embodiment shown in Figure 3 is network host 21 is linked to a secondary network system, comprising a plurality of secondary treatment nodes, that is secondary network main frame 21a, 21b, 21c (annotating: be that example explains only herein, in fact can be the secondary network main frame of any number) with 3 secondary network main frames; And these 3 secondary network main frame 21a, 21b, 21c all link mutually, and respectively according to the geographic position at its place also be provided with equally one comprise Geographical Coordinates Parameter that each network host 21a, 21b, 21c are exclusive and with the corresponding respectively connecting state database that comprises main frame domain name, host IP address and load condition of this Geographical Coordinates Parameter, this Geographical Coordinates Parameter for example is the longitude and latitude in the place at its place, in order to indicate the geographic position and the operating state at each secondary network main frame 21a, 21b, 21c place.
The process flow diagram of Fig. 5 promptly shows the handling procedure of computer network system 20 of the present invention for incoming event.
At first for carrying out a learning program S10, in order to from experience, to find out the flow process that to promote the transmission benefit; The processing mode that also is about to each initial received incoming event is learnt as experience, so as in the reference frame of promoting the treatment scheme of network connections usefulness thereafter as tool.This learning program S10 comprises step S11, S12, S13, S14, and S15.
In step S11, be to receive an incoming event that is transmitted by arbitrary client station 30 by arbitrary processing node 21,22,23,24,25, then carry out step S12.
In step S12, judge by the processing node that receives this incoming event whether its running load is excessive, if then carry out step S13; Otherwise carry out step S14.
In step S13, when the present running load of the processing node that receives this incoming event is excessive, it for example is network host 21, when receiving an incoming event, if this processing node 21 can't be handled this incoming event for fully loaded situation at present, or when being necessary that work of treatment with incoming event is dispensed to other processing node, promptly calculate the contiguous and less another one processing node 22 of running load according to its connecting state database 40 with its position by this network host 21,23,24, or 25, so that carry out this incoming event, then carry out step S15 by the processing node that finds.
In step S14, when the present running load of processing node that receives this incoming event can be carried out other incoming event, promptly carry out this incoming event by it, then carry out step S15.
In step S15, write down its present treatment state by the processing node of carrying out this incoming event, for instance, the processing node of supposing this incoming event of execution is a network host 23, computer network system 20 then of the present invention can be in the connecting state database 40 of network host 23, write down in the data field position with the corresponding load condition of domain name and IP address of this network host 23 so that upgrade data in this connecting state database 40, and seeing through the TCP/IP communications protocol by the processing node of this execution incoming event transmits a update request and manages node everywhither, make each processing node receive the connecting state database 40 that is upgraded after this request separately, then carry out step S20.
In step S20, finish above-mentioned learning program S10 (be step S11, S12, S13, S14, and S15) after, can be when receiving incoming event more thereafter, the commentaries on classics that the tool that carry out step S20 is promoted network connections usefulness links flow process; That is thereafter if receive incoming event again, then the connecting state database 40 of just being tried to achieve according to learning program S10 is carried out the commentaries on classics binding flow process of tool enhancement network connections usefulness this incoming event commentaries on classics is linked to the contiguous and less processing node of running load in position.
In addition, for secondary network system shown in Figure 3, its commentaries on classics that also can provide above-mentioned tool to promote network connections usefulness links flow process.For instance, when network host 21 receives an incoming event, it for example is the binding request that a client station 30 is sent, if this network host 21 can't handle this incoming event for fully loaded situation at present or be necessary work of treatment with incoming event be dispensed to secondary network main frame 21a, 21b, when 21c handles, then this processing node 21 can be at first changes incoming event according to this connecting state database and be linked to and this processing node 21 positions are contiguous and less another one processing node 21a, 21b or the 21c of running load.Suppose that the secondary treatment node that commentaries on classics binding flow process is chosen is secondary network main frame 21b, then network host 21 can be when secondary network main frame 21b carries out the work of treatment of this incoming event, can be in the connecting state database 40 of this secondary network main frame 21b, will with the data field position of the corresponding load condition of domain name and IP address of this network host 21b in write down so that upgrade data in this connecting state database 40, so as to linking reference in the commentaries on classics of promoting network connections usefulness as tool in the future; And when receiving incoming event again, just promote the commentaries on classics binding reference of network connections usefulness and its commentaries on classics is linked to more suitable secondary treatment node according to tool.
In a word, the invention provides a kind of computer network system that network node links usefulness of promoting, it is to be established on a kind of network system that contains geographic coordinate information of new proposition; And its characteristics are at first to carry out a learning program, wherein when receiving an incoming event and carrying out this incoming event, write down and upgrade present operating state by each processing node, obtain tool according to this and promote the commentaries on classics binding reference of network connections usefulness, whereby when the running load of a processing node excessive and its when receiving an incoming event again, be linked to the another one processing node and can in real time this incoming event be changeed.
The above only is preferred embodiment of the present invention, be not in order to limit the scope of essence technology contents of the present invention, for example, connecting state database 40 shown in Figure 4, in the connecting state database 40 except that the domain name of each network host is stored corresponding to the mode of its IP address, also can only store wherein one (not icons) of the domain name of each network host or IP address, that is look closely example and decide.Essence technology contents of the present invention broadly defines in the claim scope.If any technology entity or method that other people are finished identical or be a kind of change of equivalence with the following definien of this claim scope institute, all will be regarded as being covered by in this Patent right requirement protection domain.
Claims (10)
1. promote the computer network system that network node links usefulness for one kind, it is characterized in that comprising: a plurality of processing nodes, wherein each processing node all is linked to other all processing node mutually; And wherein each processing node all according to the geographic position at its place be provided with one comprise Geographical Coordinates Parameter that each processing node is exclusive and with this Geographical Coordinates Parameter connecting state database of corresponding load condition value respectively, in order to geographic position and the operating state that indicates each processing node place; And wherein each processing node comprises at least for the processing mode of incoming event:
(1) carry out a learning program, wherein comprise at least:
(1-1) when any one processing node receives an incoming event, judge whether its running load surpasses its load that can bear;
(1-2) when the load of the processing node that receives this incoming event is excessive, promptly calculate contiguous and to find out than its running load according to this load condition value be little another one processing node according to the Geographical Coordinates Parameter in its connecting state database than its position by this processing node, so that carry out this incoming event, and proceed to step 1-4) by the processing node that finds;
(1-3) when the processing node that receives this incoming event does not surpass its load, promptly carry out this incoming event, and proceed to step (1-4) by it;
(1-4) upgrade its connecting state database, and transmit a update request by it and manage node everywhither, make each processing node receive the connecting state database that is upgraded after this request separately by the processing node of carrying out this incoming event; And
(2), then this incoming event is changeed being linked to optimal processing node according to this connecting state database thereafter if receive an incoming event again.
2. computer network system as claimed in claim 1 is characterized in that, the Geographical Coordinates Parameter under each processing node is the longitude and latitude for the geographic position at each processing node place.
3. computer network system as claimed in claim 1 is characterized in that, this system also comprises: a level network system, it be linked to those processing nodes one of them, and comprising a plurality of secondary treatment nodes; Wherein each secondary treatment node comprises at least for the processing mode of incoming event:
(1) carry out a learning program, wherein comprise at least:
(1-1) when any one secondary treatment node receives an incoming event, judge whether its running load surpasses its load that can bear;
(1-2) when the load of the secondary treatment node that receives this incoming event is excessive, promptly calculate contiguous and to find out than its running load according to this load condition value be little another one secondary treatment node according to the Geographical Coordinates Parameter in its connecting state data bank with its position by this secondary treatment node, so that carry out this incoming event, and proceed to step (1-4) by the secondary treatment node that finds;
(1-3) when the secondary treatment node that receives this incoming event does not surpass its load, promptly carry out this incoming event, and proceed to step (1-4) by it;
(1-4) by its connecting state database of secondary treatment node updates of carrying out this incoming event, and transmit one by it and update request to each secondary treatment node, make each secondary treatment node receive this request and afterwards upgraded separately connecting state database; And
(2), then this incoming event is changeed being linked to optimal secondary treatment node according to this connecting state database thereafter if receive an incoming event again.
4. computer network system as claimed in claim 1 is characterized in that, this connecting state database stores the Geographical Coordinates Parameter corresponding domain name exclusive with each processing node again.
5. computer network system as claimed in claim 1 is characterized in that, this connecting state database stores the Geographical Coordinates Parameter corresponding IP address exclusive with each processing node again.
6. promote the computer network system that network node links usefulness for one kind, it is characterized in that comprising: a plurality of processing nodes, wherein each processing node all is linked to other all processing node mutually; And wherein each processing node all according to the geographic position at its place be provided with one comprise longitude and latitude parameter that each processing node is exclusive and with this longitude and latitude parameter connecting state database of corresponding load condition value respectively, in order to geographic position and the operating state that indicates each processing node place; And wherein each processing node comprises at least for the processing mode of incoming event:
(1) carry out a learning program, wherein comprise at least:
(1-1) when any one processing node receives an incoming event, judge whether its running load surpasses its load that can bear;
(1-2) when the load of the processing node that receives this incoming event is excessive, promptly calculate contiguous and to find out than its running load according to this load condition value be little another one processing node according to the longitude and latitude parameter in its connecting state database with its position by this processing node, so that carry out this incoming event, and proceed to step (1-4) by the processing node that finds;
(1-3) when the processing node that receives this incoming event does not surpass its load, promptly carry out this incoming event, and proceed to step (1-4) by it;
(1-4) upgrade the load condition value of its connecting state database, and transmit a update request by it and manage node everywhither, make each processing node receive the connecting state database that is upgraded after this request separately by the processing node of carrying out this incoming event; And
(2), then this incoming event is changeed being linked to optimal processing node according to this connecting state database thereafter if receive an incoming event again.
7. as claim 1 or 6 described computer network systems, it is characterized in that, according to this connecting state database with incoming event change be linked to the most suitable processing node be meant one with receive the contiguous and less processing node of running load in position that this incoming event is in the excessive processing node of load.
8. computer network system as claimed in claim 3, it is characterized in that, according to this connecting state database with incoming event change be linked to optimal secondary treatment node be meant one with receive the contiguous and less secondary treatment node of running load in position that this incoming event is in the excessive secondary treatment node of load.
9. computer network system as claimed in claim 6 is characterized in that, this connecting state database stores the longitude and latitude parameter corresponding domain name exclusive with each processing node again.
10. computer network system as claimed in claim 6 is characterized in that, this connecting state database stores the longitude and latitude parameter corresponding IP address exclusive with each processing node again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA021403988A CN1466070A (en) | 2002-07-02 | 2002-07-02 | Computer network system for raising network node connection effectiveness |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA021403988A CN1466070A (en) | 2002-07-02 | 2002-07-02 | Computer network system for raising network node connection effectiveness |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN1466070A true CN1466070A (en) | 2004-01-07 |
Family
ID=34147564
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA021403988A Pending CN1466070A (en) | 2002-07-02 | 2002-07-02 | Computer network system for raising network node connection effectiveness |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1466070A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101256516B (en) * | 2007-02-28 | 2013-05-08 | Sap股份公司 | Distribution of data and task instances in grid environments |
-
2002
- 2002-07-02 CN CNA021403988A patent/CN1466070A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101256516B (en) * | 2007-02-28 | 2013-05-08 | Sap股份公司 | Distribution of data and task instances in grid environments |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102486739B (en) | Method and system for distributing data in high-performance computer cluster | |
| CN1656776A (en) | A computing services grid | |
| CN1649324A (en) | Method and apparatus for operating an open API network having a proxy | |
| CN1764191A (en) | Methods and systems for dynamically updating session state affinity | |
| CN1298147A (en) | Technique for providing service quality guarantee to virtual main machine | |
| CN1373871A (en) | Extensible computing system | |
| CN110233881A (en) | Service request processing method, device, equipment and storage medium | |
| EP2321937A2 (en) | Load balancing for services | |
| CN107317889A (en) | A kind of intelligent DNS scheduling system and dispatching method | |
| CN115134371A (en) | Scheduling method, system, equipment and medium containing edge network computing resources | |
| CN1906890B (en) | Method and apparatus for supporting transactions | |
| US8055665B2 (en) | Sorted search in a distributed directory environment using a proxy server | |
| CN1609867A (en) | Network customer's question reply system | |
| CN1127231C (en) | Implementation method for interacting between program and user and its device | |
| CN112506658B (en) | Dynamic resource allocation and task scheduling method in service chain | |
| US20040199553A1 (en) | Computing environment with backup support | |
| CN1466070A (en) | Computer network system for raising network node connection effectiveness | |
| CN1200382C (en) | Data updating method and system | |
| CN1466074A (en) | Random converting connection type computer network system | |
| CN111542074B (en) | Intelligent heterogeneous wireless access method for mobile cloud computing learning | |
| Qu et al. | New analysis on mobile agents based network routing | |
| CN1466068A (en) | Mutual aid computer network system for optimized information process | |
| CN106301924A (en) | A kind of mapping method of virtual network and device | |
| CN109246631B (en) | Method for sending short message | |
| CN1527559A (en) | Method of inquiring routing to position sorver |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |