CN102299841A - Service-based P2P (Peer-to-Peer) path determination method and device - Google Patents
Service-based P2P (Peer-to-Peer) path determination method and device Download PDFInfo
- Publication number
- CN102299841A CN102299841A CN2010102192794A CN201010219279A CN102299841A CN 102299841 A CN102299841 A CN 102299841A CN 2010102192794 A CN2010102192794 A CN 2010102192794A CN 201010219279 A CN201010219279 A CN 201010219279A CN 102299841 A CN102299841 A CN 102299841A
- Authority
- CN
- China
- Prior art keywords
- node
- overlay network
- path
- client
- path cost
- 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)
Abstract
The invention discloses a service-based P2P (Peer-to-Peer) path determination method and device. The method comprises the following steps of: setting a P2P overlay network according to geographical domains, and setting ID (Identity), a path overhead table and a client login algorithm of nodes according to the P2P overlay network; configuring the path overhead table according to a relationship between the nodes in the overlay network, and determining a communication path according to the path overhead table. In the method and the device, the P2P overlay network is established according to the geographical domains, and the communication overhead between the domains is taken as a basis for a Dijkstra algorithm to determine a P2P path, thereby saving the exit bandwidth of an ISP (Internet Service Provider) and improving the quality assurance of P2P applications; and moreover, according to the invention, different path overhead parameters are set according to the quality of service of different P2P applications, so that the method and the device are wide in applicability.
Description
Technical field
The present invention relates to the overlay network route technology of internet arena, method and apparatus is determined in particularly a kind of P2P path based on business.
Background technology
Peer-to-peer network (P2P, Peer-to-Peer) technology was risen the beginning of this century, distributed computing model as a kind of basis, it is dissolved in the various network applications gradually, as IP-based voice technology (VoIP, Voice over Internet Protocol), Streaming Media, file-sharing etc.When people enjoyed the technological achievement that the P2P technology brings, the P2P technology had also caused great influence to the applied environment of network.According to statistics, 70～80% flow is the P2P data flow in the network.These P2P flows have taken a large amount of bandwidth, have badly influenced the service quality of other network application.This makes operator of some ISP (ISP, Internet Service Provider) attempt P2P used and shields.But the P2P technology is as progressive sign of a kind of epoch, and it is difficult to be fallen by thorough shutoff, and more rational counte-rplan are that the management to the P2P flow is strengthened in effort, improve the P2P networks efficiency, to alleviate the pressure of P2P nerve of a covering to bottom-layer network.
In the P2P network application, node is normally according to application need, voluntarily with network in respective nodes set up session.For example, in BT downloaded, the tracker server was by the available download location of tracker announcement, and node is to download from these alternate location at random or with the minimum principle of round-trip delay (RTT, Round-Trip Time).Because these nodes are not understood the residing physical location of alternative node, it is difficult to make reasonable optimizing, and this brings influence to the performance that P2P uses; Simultaneously, because these flows spanning network border possibly, thereby tied up the outlet bandwidth of a large amount of ISP.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of P2P path based on business to determine method and apparatus, for ISP saves port band width, improves the service quality that P2P uses.
For achieving the above object, technical scheme of the present invention is achieved in that
The invention provides a kind of equity based on business (P2P) path and determine method, this method comprises:
According to geographic region the P2P overlay network is set, and setting comprises the data structure of node ID, path cost table and client login algorithm according to described P2P overlay network; According to concerning configuration path expense table between above-mentioned data structure and the P2P overlay network internal node, and determine communication path according to described path cost table.
In the such scheme, described P2P overlay network is set to two-layer: top layer is the core overlay network, and bottom is the region overlapping net; Each operator has only a core overlay network, and the region overlapping net is divided according to the region; The core overlay network of all operators moves on same address space, and the region overlapping net is positioned at different address spaces with the ID of core overlay network.
In the such scheme, described node ID setting specifically comprises: if KID represents the ID of core overlay network, DID represents the ID of region overlapping net, CID represents the ID of normal client end, and then the method for expressing of node is respectively in the overlay network: core overlay network node:＜KID 〉; Region overlapping net node:＜KID, DID 〉; Client:＜KID, DID, CID 〉.
In the such scheme, described client login algorithm specifically comprises: when client directly is linked into the regional center server of an operator, client is initiated login to logon server, detect the login message by the regional center server, if the login message points to this operator, then allow the client login; Otherwise, send the message that resets to client, forbid the login of client; When client was linked into the regional center server of a plurality of operators simultaneously by ISP (ISP), client was obtained a plurality of login IDs.
In the such scheme, described path cost table comprises: the path cost table of the path cost table of region overlapping net node and core overlay network node; Wherein,
The setting of the path cost table of region overlapping net node is specially: the path cost in the overlay network of one's respective area between source node and the destination node;
The setting of the path cost table of core overlay network node, be specially the secondary structure of arrays, wherein, path cost in the first order array representation core overlay network between each node, path cost in the array representation core overlay network node region, the second level between each node is connected by pointer between the first order and second level array; Wherein, the path cost in the first order array is the minimal path expense.
In the such scheme, described configuration path expense table comprises: the configuration of the configuration of operator's inner track expense table and the path cost table of cross operator; Wherein, the configuration of operator's inner track expense table comprises: the measurement of the path cost of the measurement of the path cost of region overlapping net node and core overlay network node; Wherein,
The measurement of the path cost of region overlapping net node is specially: source server is selected a client at random in the one's respective area, and destination server is selected a client at random in the one's respective area; Between two clients, carry out path cost and measure, and measurement result is returned to source server; Source server employing Gossip agreement at the one's respective area internal communication, forms complete intra-zone path cost table with measurement result;
The measurement of the path cost of core overlay network node is specially: source server is selected a client at random in the one's respective area, and destination server is selected a client at random in the one's respective area; Between two clients, carry out path cost and measure, and measurement result is returned to source server; Source server employing Gossip agreement at core overlay network internal communication, forms complete intra-zone path cost table with measurement result; Wherein, source server is the agent node of core overlay network;
The configuration of the path cost table of cross operator specifically comprises: make and directly carry out service communication between the client, and path cost is maintained in the path cost table of core overlay network node; Perhaps, realize that as via node the path cost between each node is measured in two operators with one of them client.
In the such scheme, describedly determine communication path, specifically comprise: when the client of two mutual communication is in same region overlapping net inside, then these two client direct communications according to the path cost table;
Be positioned at the zones of different overlay network of same operator when two clients, then by the path cost table of the core overlay network node under the client according to core overlay network node, determine the path by dijkstra's algorithm, and after choosing via node on the path, return to client;
When two clients are positioned at two operators, at first determine the path of one of them client to the operator boundary node, continue in the server of another operator, please determine subsequent path as via node by this boundary node; Described via node is the agent node across two operators.
In the such scheme, this method also comprises: select a plurality of via nodes as backup in communication process, when normal via node rolls off the production line, allow standby via node work immediately; Perhaps, service data transmission on a plurality of repeated links if certain bar link breaks down, switches to other paths immediately simultaneously, guarantees the stability and the reliability of link.
The present invention also provides a kind of P2P path based on business to determine device, and this device comprises: overlay network makes up module, data structure is provided with module, path cost maintenance module and path planning module; Wherein,
Overlay network makes up module, is used for according to geographic region the service network of P2P overlay network as operator being set;
Data structure is provided with module, is used for according to described P2P overlay network data structure being set, and comprising: node ID, path cost table and client login algorithm;
The path cost maintenance module is used for according to concerning configuration path expense table between above-mentioned data structure and the P2P overlay network internal node;
Path planning module is used for determining communication path according to described path cost table.
In the such scheme, described P2P overlay network is set to two-layer: top layer is the core overlay network, and bottom is the region overlapping net; Each operator has only a core overlay network, and the region overlapping net is divided according to the region; The core overlay network of all operators moves on same address space, and the region overlapping net is positioned at different address spaces with the ID of core overlay network.
In the such scheme, described client login algorithm specifically comprises: when client directly is linked into the regional center server of an operator, client is initiated login to logon server, flow detection Equipment Inspection login message by the regional center server, if the login message points to this operator, then allow the client login; Otherwise, send the message that resets to client, forbid the login of client; When client was linked into the regional center server of a plurality of operators simultaneously by ISP, client was obtained a plurality of login IDs.
In the such scheme, described path planning module is determined communication path according to the path cost table, specifically comprises: when the client of two mutual communication is in same region overlapping net inside, then these two client direct communications;
Be positioned at the zones of different overlay network of same operator when two clients, then by the path cost table of the core overlay network node under the client according to core overlay network node, determine the path by dijkstra's algorithm, and after choosing via node on the path, return to client;
When two clients are positioned at two operators, at first determine the path of one of them client to the operator boundary node, continue to determine subsequent path as via node by this boundary node to the server application of another operator; Described via node is the agent node across two operators.
Method and apparatus is determined in a kind of P2P path based on business provided by the present invention, according to geographic region the P2P overlay network is set, and ID, path cost table and the client login algorithm of node are set according to described overlay network; According to concerning configuration path expense table between the P2P overlay network internal node, and determine communication path according to the path cost table.Its advantage is: the present invention makes up the P2P overlay network with geographic region, and determines path end to end with the communication overhead between the territory as the basis of dijkstra's algorithm, for ISP saves port band width, has improved the P2P application quality and has guaranteed; In addition, the present invention can be provided with different path cost parameters according to the service quality (QoS, Quality of Service) that different P2P use, and is with a wide range of applications.
Description of drawings
Fig. 1 is based on determining method flow diagram in the P2P path of business in the embodiment of the invention;
Fig. 2 is that P2P overlay network structure is disposed schematic diagram in the embodiment of the invention;
Fig. 3 is the path cost hoist pennants of region overlapping net node in the embodiment of the invention;
Fig. 4 is the path cost hoist pennants of core overlay network node in the embodiment of the invention;
Fig. 5 is client login process figure in the embodiment of the invention;
Fig. 6 safeguards flow chart for operator's inner track expense table in the embodiment of the invention;
Fig. 7 safeguards flow chart for cross operator path cost table in the embodiment of the invention;
Fig. 8 carries out the flow chart that the path is determined for utilizing the path cost table in the embodiment of the invention;
Fig. 9 determines the apparatus structure schematic diagram in the embodiment of the invention based on the P2P path of business.
Embodiment
Basic thought of the present invention is: according to geographic region the P2P overlay network is set, and ID, path cost table and the client login algorithm of node are set according to described P2P overlay network; According to concerning configuration path expense table between the overlay network internal node, and determine communication path according to the path cost table.
With specific embodiment scheme of the present invention being described in detail below, is example with the VoIP business here, and the path cost parameter is made as RTT.
The present invention has used three hypothesis: at first, for telecom operators and ISP, the route in its territory all is efficiently usually; Secondly, the communication overhead between the node in the region of same operator is very little; At last, the communication overhead between the node in two subdomains of two different operators is roughly the same.
Based on above-mentioned thought, method is determined in the P2P path based on business that the embodiment of the invention provides, and as shown in Figure 1, may further comprise the steps:
Step 101: set up P2P overlay network network model, the P2P overlay network promptly is set;
In this step, because operator often makes up its service network with layer mode, so the present invention adopts the P2P overlay network to make up the service network of operator; Simultaneously, in order to be end-to-end communication planning route easily, the present invention has chosen the mode that structuring mixes with non-structural P 2 P, and the basic ideas of this networking plan are: locate in structurized mode, carry out professional route in non-structured mode.
Fig. 2 is a P2P overlay network network model in the embodiment of the invention, P2P overlay network owing to be unwilling between the operator to share, so the P2P overlay network is divided according to operator, and in each operator inside, in order to make the P2P overlay network consistent with operator internal physical net, with P2P overlay network laminated tissue, here, if with the P2P overlay network be designed to two-layer more than, can increase the expense of network, in conjunction with the expense situation of network, be designed to current P2P overlay network two-layer: top layer is the core overlay network, and each operator has only a core overlay network; The region overlapping net is divided according to the region.In order to reduce the outlet bandwidth of region overlapping net, the core overlay network of all operators moves on same address space, the ID space of region overlapping net and core overlay network demarcates, and that is to say, the ID of each region overlapping net, core overlay network is arranged in different address spaces.
Client have access to dual mode, a kind of is to link to each other with the regional center server of region overlapping net, another kind is to be inserted by ISP earlier, client is by ISP access carrier more then.Because scratch in the ID space of region overlapping net and core overlay network, in order to guarantee interlayer communication, agent node need be set, two superimposed net about the cross-over connection is responsible for linking up communication between two-layer by agent node.
Be positioned at the regional center server of region overlapping net, be used for leading subscriber as D1 and insert, flow detection equipment is installed on the regional center server, this module is an extendible net flow assorted manager of linearity; Client wants to obtain the service of operator, must at first initiate login to the logon server of operator, and logon server is managed voluntarily by each operator, and the position of this logon server is open, can obtain arbitrarily.
Step 102: related data structures is set, comprises the setting of node ID and path cost table;
In this step, at first choose node ID: because the ID space of core overlay network and the ID of region overlapping net are positioned at different spaces, therefore the node of locating in these networks needs layer structure.If KID represents the ID of core overlay network, DID represents the ID of region overlapping net, and CID represents the ID of normal client end, and then the method for expressing of node is respectively in the overlay network: core overlay network node:＜KID 〉; Region overlapping net node:＜KID, DID 〉; Client:＜KID, DID, CID 〉.
Then, the path cost table is set, the path cost table is used to plan the client route.The path cost table is different with the performance of region overlapping net at the core overlay network, describes respectively below:
A) the path cost table of region overlapping net node
It is path cost between the overlay network interior nodes of one's respective area that the path cost table of region overlapping net node only comprises server in the overlay network of one's respective area.For the node in the region overlapping net, because KID is all identical, so when expression region overlapping net node, can save KID separately, represent node separately with DID, like this, path in the region overlapping net between two nodes can be by two tuples＜sID, dID〉represent, wherein, sID represents the DID of source node, and dID represents the DID of destination node.Among Fig. 2, the K1 node is across regional overlay network and core overlay network, be responsible for communicating by letter between region overlapping net and the core overlay network, therefore this region overlapping net can identify with K1, K1 also is used for representing the agent node of this region overlapping net simultaneously, for the node that is in the region overlapping net K1, represented in the path cost table among Fig. 3 that source node is to the path cost situation between the destination node in the region overlapping net, wherein, first line display node D1 of path cost table and the path cost between the regional agent node K1.What need here is, in the present embodiment with RTT as a kind of expense, may include more expense project in the actual situation, as bandwidth etc., the path cost table of different parameters can be set according to the actual requirements.
B) the path cost table of core overlay network node
The path cost table of core overlay network node be set to a plurality of secondary structure of arrays: the path cost in the first order array representation core overlay network between each node, path cost in the array representation core overlay network node region, the second level between each node, between the first order and second level array, connect, as shown in Figure 4 by pointer.Fig. 4 represents the path cost table of each node of core overlay network of the SO1 of operator, and this table is safeguarded that by the SO1 of operator wherein the secondary array that identifies with SO1 is the path cost between inner each node of SO1 core overlay network; Secondary array with the SO2 sign is that SO1 is to the path cost between trans-regional each node of core overlay network of SO2.
For the secondary array of SO1 sign, path cost between the first order array representation core overlay network internal node, the gauge outfit of the Detail pointed second level array on each row of first order array, path cost in the array representation core overlay network node region, the second level between each node, for example: the first line display K1 in the first order array is to the path cost between the K2, the gauge outfit of the Detail pointed second level array of first row, in the array of the second level, provide the detailed path expense of K1 zone to each node between the K2 zone, D1 in the array of the second level in first row, D5, D7... represent the node in the K1 zone respectively, D2 in the secondary series, D6, D8... represent the node in the K2 zone respectively, wherein, directapath expense shown in the array gauge outfit of the second level between K1 and the K2 node, second line display node＜K1 of second level array, D1〉to＜K2, D2 between path cost, that the third line is represented is node＜K1, D5〉to＜K2, D6 between path cost; In the array of the second level, except the RTT in the gauge outfit, remaining RTT all arranges from small to large according to expense, and the minimal-overhead RTT in the array of the second level is filled out RTT item in first order array.
For SO1 for the path cost table of SO2, the core overlay network node of SO1 is shown in first tabulation of first order array, secondary series is represented the core overlay network node of SO2, for example: the K1 of first row, K3 represents the core overlay network node of SO1 respectively, the K8 of secondary series, K9 represents the core overlay network node among the SO2 respectively, wherein, the gauge outfit of the Detail pointed second level array of first row, path cost table in this second level array representation zone K1 and the K8 between each node, wherein, path cost RTT is according to arranging from small to large, and the path cost RTT of minimum is filled out RTT item in first order array.
Therefore, for the agent node of crossing over core overlay network and region overlapping net, except the path cost table of safeguarding core overlay network node, also need safeguard the path cost table of the region overlapping net node of its region.
Step 103: client login algorithm is set;
In this step, client can not determine before login which operator it has connected, and therefore, when client is logined, need initiate login to the logon server of a plurality of operators.The process of login has three roles to participate in: client, logon server, regional center server.L1 among Fig. 2 and L2 belong to the logon server of two operators respectively.Fig. 5 is the client login process, is divided into two kinds of situations below and is discussed:
1) with the direct-connected normal client end login of regional center server, as C1 among Fig. 2,
Client C1 initiates login to L1 and L2 simultaneously, with traffic classification Equipment Inspection on the direct-connected regional center server D1 of C1 to the login message, if detect the logon server that the login message also points to other operator, as the L2 among Fig. 2, then this traffic classification equipment can send the message that resets (RST) to C1, this transmission control protocol that resets (TCP, Transmission Control Protocol) connects, and so just can force 1 network that signs in to the D1 operator of C.
2) the client login that connects indirectly by ISP, as the C3 among Fig. 2,
In Fig. 2, C3 can initiate login to L1 and L2 simultaneously, these login messages point to L1 and L2 through the router difference route of ISP outlet, after traffic classification Equipment Inspection on regional center server D1 and the D3 detects the login message that points to this operator respectively, allow client C3 login, and respond C3 ID number, therefore with operator separately by L1 and L2, in this case, C3 just has two ID.
Step 104: safeguard the path cost table, i.e. configuration path expense table;
In this step, the maintenance of path cost table is divided into two class situations: a class is the maintenance of operator's inner track expense table, and its flow process is seen Fig. 6, corresponding to following 1) and 2) situation; Another kind of is the maintenance of the path cost table of cross operator among Fig. 4, corresponding to following 3) situation.
1) measurement of the path cost of region overlapping net node:
The path cost of region overlapping net node is initiated to measure each other by client, wants to measure the expense of D2 as the D1 among Fig. 2, and the client of this expense by D1 brought in to the client of D2 and measured.Its basic process is as follows: client C1 of D1 picked at random, client C3 of D2 picked at random, measure the expense of C3 then by C1, and this expense reported to D1, adopt the Gossip agreement to propagate this measurement result by D1 again, thereby formed a complete intra-zone path cost table fast in the one's respective area network internal.
2) measurement of the path cost of core overlay network node:
Different with the path cost table of Area Node, the path cost table of Core server need be measured trans-regional communication overhead, and the formation of its path cost table mainly relies on by agent node and finishes.As Fig. 2, suppose that K1 wishes to be established to the path cost table of K4, under its process: client＜K1 of K1 picked at random, D1, C1 〉, client＜K4 of K4 picked at random, D4, C2 〉, C1 measures the expense of C2 and announces and give K1 then, K1 uses the Gossip agreement in this measurement result of core overlay network internal communication, thereby has formed a complete intra-zone path cost table fast.
3) path cost of cross operator node is measured:
Because operator may be unwilling to expose its internal network topological structure, so the measurement of the path cost of cross operator can not be adopted the method for front.
Initial in the overlay network networking, the networking situation of another operator may not understood by an operator.As Fig. 2, suppose that C1 is in operator 1 time, its ID is＜K1 D1, C1 〉.Because professional needs, C1 need communicate by letter with C4.At this moment, because the node K1 on the core overlay network may not have＜K1 D1〉to＜K3, D5 path cost, have two kinds of schemes to address this problem below:
Scheme one: because K1 and K3 do not belong in the same operator, so K1 is possibly can't ask K3 to measure.And at the beginning of networking, K1 can't be ready to＜K1 D1 before professional an expansion〉to＜K3, D5 the path cost table.At this moment, K1 can only allow C1 directly carry out service communication with C4, the service path of C1 and C4 is not planned definite.The directapath expense RTT of C1 and C4 is maintained in the SO1 expense table shown in Figure 4, is used for follow-up path planning and determines.
Scheme two: triangle inequality off path (TIV, the Triangle Inequality Violation) shortcut that utilizes ISP
With reference to figure 2, when a client C3 login, it has obtained the ID of two operators simultaneously, and establishing the ID that L1 offers C3 is C3, and the ID that L2 offers C3 is C3 ', then according to operator under the C3 and zone, the position of client C3 can be expressed as respectively:＜K1, D2, C3〉and＜K3, D3, C3 ' 〉.At this moment, C3 sends the message of two ID that it obtains respectively to D2 and D3; D2 and D3 check these ID, thereby learn that there is the network of another operator in opposite side at the ISP network, and C3 has inserted two operators simultaneously; D2 and D3 measure as via node realization expense each other by C3, and measured path cost RTT are maintained in the expense table of the SO2 correspondence among Fig. 4, are used for follow-up path planning and determine.Here, because ISP may rent the circuit of a plurality of operators, as relaying, may make that a shorter path appears in D2 and communicating by letter of D3 node between two operators by C3, so this paper calls the TIV shortcut to it, this flow process as shown in Figure 7.
Step 105: carry out path planning according to the path cost table of safeguarding, promptly determine communication path according to the path cost table of configuration;
In this step, the overlay network among the present invention is used for the business of managing telecommunications operator, and these business comprise Streaming Media, VoIP etc.But this overlay network can't be born the transformation task of these business data flows, and its task is for business provides path planning, serves as relaying by the client on the path planning, and business data flow is transmitted.
Because the residing position of client difference, its path planning is also inequality, below the branch situation illustrated.If two service communication nodes are＜K1 D1, C1〉and＜K2, D2, C2 〉, its complete communication path determines that flow process is as shown in Figure 8.
1) if K1=K2, promptly two clients are in same region overlapping net inside, then C1 and C2 direct communication.
2) if K1 ≠ K2 illustrates that C1 and C2 are positioned at different region overlapping nets, if two clients are positioned at same operator, at this moment:
A) C1 attempts directly carrying out service communication with C2, if can not satisfy performance requirement, then changes b);
B) C1 asks path planning to D1, and D1 transmits this and asks K1;
C) K1 is according to the SO1 in the path cost table of core overlay network node among Fig. 4 table, uses dijkstra's algorithm to determine from＜K1 D1〉to＜K2, D2 the path;
D) D1 is according to the path of K1 planning, at＜K1, D1〉to＜K2, D2〉choose client as via node on the zone in path, the path that above-mentioned via node is conspired to create returns to C1 then.
3) cross operator service communication:
Owing to be cross operator communication, the service of operator 1 (SO1) can't be known the network organization of opposite side operator 2 (SO2) definitely, so the Core server among the SO1 possibly can't accurately be planned path end to end.In this case, the path can only be planned for the border of operator, by the agent node across two operators business datum is carried out relaying, and it understands the server planning subsequent path of another operator of continuation application.For example, in Fig. 2, one＜K1 of desire planning, D1, C1〉to＜K3, D5, C4 the path, the K1 in the operator 1 can only plan the path of C1 to C3, continues the path that request D3 is planned for C4 by C3.
Step 106: the stable and reliability assurance of link;
In this step, in communication process, there is the possibility that rolls off the production line suddenly in via node, therefore need take normally carrying out of certain measure and ensure communication.Can choose a plurality of nodes and back up,, allow alternative node join via node immediately in case the via node of proper communication rolls off the production line as relaying; Perhaps, while service data transmission on a plurality of repeated links is in case certain bar link fails switches on other path immediately.
Be that the path cost parameter is planned the path with RTT in the embodiment of the invention, make that the path has minimum RTT end to end; The present invention program can also be provided with different path cost parameters according to the service quality that different P2P use, different indexs is optimized, as: for streaming media service, the path cost parameter is set to bandwidth etc., and is therefore with a wide range of applications.
Based on said method, the embodiment of the invention also provides a kind of P2P path based on business to determine device, as shown in Figure 9, comprising: overlay network makes up module, data structure is provided with module, path cost maintenance module and path planning module; Wherein,
Overlay network makes up module, is used for according to geographic region the service network of P2P overlay network as operator being set;
Data structure is provided with module, is used for according to described P2P overlay network data structure being set, and comprising: node ID, path cost table and client login algorithm;
The path cost maintenance module is used for according to concerning configuration path expense table between above-mentioned data structure and the P2P overlay network internal node;
Path planning module is used for determining communication path according to the path cost table of configuration.
Described P2P overlay network is set to two-layer: top layer is the core overlay network, and bottom is the region overlapping net; Each operator has only a core overlay network, and the region overlapping net is divided according to the region; The core overlay network of all operators moves on same address space, and the region overlapping net is positioned at different address spaces with the ID of core overlay network.
Be positioned on the regional center server of region overlapping net flow detection equipment is installed, be used for, guarantee that client signs in to the operator under the one's respective area according to the classification of login message managing network flow.
Described data structure is provided with node ID setting in the module, specifically comprise: establish the ID that KID represents the core overlay network, DID represents the ID of region overlapping net, and CID represents the ID of normal client end, and then the method for expressing of node is respectively in the overlay network: core overlay network node:＜KID 〉; Region overlapping net node:＜KID, DID 〉; Client:＜KID, DID, CID 〉;
Described client login algorithm specifically comprises: when client directly is linked into the regional center server of an operator, client is initiated login to logon server, flow detection Equipment Inspection login message by the regional center server, if the login message points to this operator, then allow the client login; Otherwise, send the message that resets to client, forbid the login of client; When client was linked into the regional center server of a plurality of operators simultaneously by ISP, client can be obtained a plurality of login IDs.
Described path cost table comprises: the path cost table of the path cost table of region overlapping net node and core overlay network node; Wherein,
The setting of the path cost table of region overlapping net node is specially: the path cost in the overlay network of one's respective area between source node and the destination node;
The setting of the path cost table of core overlay network node, be specially the secondary structure of arrays, wherein, path cost in the first order array representation core overlay network between each node, path cost in the array representation core overlay network node region, the second level between each node is connected by pointer between the first order and second level array; Wherein, the path cost in the first order array is the minimal path expense.
Described configuration path expense table comprises: the configuration of the configuration of operator's inner track expense table and the path cost table of cross operator; Wherein, the configuration of operator's inner track expense table comprises: the measurement of the path cost of the measurement of the path cost of region overlapping net node and core overlay network node; Wherein,
The measurement of the path cost of region overlapping net node is specially: source server is selected a client at random in the one's respective area, and destination server is selected a client at random in the one's respective area; Between two clients, carry out path cost and measure, and measurement result is returned to source server; Source server adopt the Gossip agreement with measurement result at the one's respective area internal communication, thereby form a complete intra-zone path cost table;
The measurement of the path cost of core overlay network node is specially: source server is selected a client at random in the one's respective area, and destination server is selected a client at random in the one's respective area; Between two clients, carry out path cost and measure, and measurement result is returned to source server; Source server adopt the Gossip agreement with measurement result at core overlay network internal communication, thereby form a complete intra-zone path cost table; Wherein, source server is the agent node of core overlay network;
The configuration of the path cost table of cross operator specifically comprises: make and directly carry out service communication between the client, and path cost is maintained in the path cost table of core overlay network node; Perhaps, realize that as via node the path cost between each node is measured in two operators with one of them client.
Described path planning module is determined communication path according to the path cost table, specifically comprises: when the client of two mutual communication is in same region overlapping net inside, then these two client direct communications;
Be positioned at the zones of different overlay network of same operator when two clients, then by the path cost table of the core overlay network node under the client according to core overlay network node, determine the path by dijkstra's algorithm, and after choosing via node on the path, return to client;
When two clients are positioned at two operators, at first determine the path of one of them client to the operator boundary node, continue to determine subsequent path as via node by this boundary node to the server application of another operator; Described via node is the agent node across two operators.
This device also comprises: the stable module that guarantees of link, be used for selecting a plurality of via nodes as backup at communication process, and when normal via node rolls off the production line, allow standby via node work immediately; Perhaps, service data transmission on a plurality of repeated links if certain bar link breaks down, switches to other paths immediately simultaneously, guarantees the stability and the reliability of link.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (12)
1. method is determined in the equity based on business (P2P) path, it is characterized in that this method comprises:
According to geographic region the P2P overlay network is set, and setting comprises the data structure of node ID, path cost table and client login algorithm according to described P2P overlay network; According to concerning configuration path expense table between above-mentioned data structure and the P2P overlay network internal node, and determine communication path according to described path cost table.
2. method according to claim 1 is characterized in that, described P2P overlay network is set to two-layer: top layer is the core overlay network, and bottom is the region overlapping net; Each operator has only a core overlay network, and the region overlapping net is divided according to the region; The core overlay network of all operators moves on same address space, and the region overlapping net is positioned at different address spaces with the ID of core overlay network.
3. method according to claim 2, it is characterized in that, described node ID setting, specifically comprise: if KID represents the ID of core overlay network, DID represents the ID of region overlapping net, CID represents the ID of normal client end, and then the method for expressing of node is respectively in the overlay network: core overlay network node:＜KID 〉; Region overlapping net node:＜KID, DID 〉; Client:＜KID, DID, CID 〉.
4. method according to claim 1, it is characterized in that, described client login algorithm specifically comprises: when client directly is linked into the regional center server of an operator, client is initiated login to logon server, detect the login message by the regional center server, if the login message points to this operator, then allow the client login; Otherwise, send the message that resets to client, forbid the login of client; When client was linked into the regional center server of a plurality of operators simultaneously by ISP (ISP), client was obtained a plurality of login IDs.
5. method according to claim 2 is characterized in that, described path cost table comprises: the path cost table of the path cost table of region overlapping net node and core overlay network node; Wherein,
The setting of the path cost table of region overlapping net node is specially: the path cost in the overlay network of one's respective area between source node and the destination node;
The setting of the path cost table of core overlay network node, be specially the secondary structure of arrays, wherein, path cost in the first order array representation core overlay network between each node, path cost in the array representation core overlay network node region, the second level between each node is connected by pointer between the first order and second level array; Wherein, the path cost in the first order array is the minimal path expense.
6. method according to claim 5 is characterized in that, described configuration path expense table comprises: the configuration of the configuration of operator's inner track expense table and the path cost table of cross operator; Wherein, the configuration of operator's inner track expense table comprises: the measurement of the path cost of the measurement of the path cost of region overlapping net node and core overlay network node; Wherein,
The measurement of the path cost of region overlapping net node is specially: source server is selected a client at random in the one's respective area, and destination server is selected a client at random in the one's respective area; Between two clients, carry out path cost and measure, and measurement result is returned to source server; Source server employing Gossip agreement at the one's respective area internal communication, forms complete intra-zone path cost table with measurement result;
The measurement of the path cost of core overlay network node is specially: source server is selected a client at random in the one's respective area, and destination server is selected a client at random in the one's respective area; Between two clients, carry out path cost and measure, and measurement result is returned to source server; Source server employing Gossip agreement at core overlay network internal communication, forms complete intra-zone path cost table with measurement result; Wherein, source server is the agent node of core overlay network;
The configuration of the path cost table of cross operator specifically comprises: make and directly carry out service communication between the client, and path cost is maintained in the path cost table of core overlay network node; Perhaps, realize that as via node the path cost between each node is measured in two operators with one of them client.
7. method according to claim 1 is characterized in that, describedly determines communication path according to the path cost table, specifically comprises: when the client of two mutual communication is in same region overlapping net inside, then these two client direct communications;
Be positioned at the zones of different overlay network of same operator when two clients, then by the path cost table of the core overlay network node under the client according to core overlay network node, determine the path by dijkstra's algorithm, and after choosing via node on the path, return to client;
When two clients are positioned at two operators, at first determine the path of one of them client to the operator boundary node, continue to determine subsequent path as via node by this boundary node to the server application of another operator; Described via node is the agent node across two operators.
8. according to each described method of claim 1 to 7, it is characterized in that this method also comprises: in communication process, select a plurality of via nodes as backup, when normal via node rolls off the production line, allow standby via node work immediately; Perhaps, service data transmission on a plurality of repeated links if certain bar link breaks down, switches to other paths immediately simultaneously, guarantees the stability and the reliability of link.
9. device is determined in the P2P path based on business, it is characterized in that this device comprises: overlay network makes up module, data structure is provided with module, path cost maintenance module and path planning module; Wherein,
Overlay network makes up module, is used for according to geographic region the service network of P2P overlay network as operator being set;
Data structure is provided with module, is used for according to described P2P overlay network data structure being set, and comprising: node ID, path cost table and client login algorithm;
The path cost maintenance module is used for according to concerning configuration path expense table between above-mentioned data structure and the P2P overlay network internal node;
Path planning module is used for determining communication path according to described path cost table.
10. device according to claim 9 is characterized in that, described P2P overlay network is set to two-layer: top layer is the core overlay network, and bottom is the region overlapping net; Each operator has only a core overlay network, and the region overlapping net is divided according to the region; The core overlay network of all operators moves on same address space, and the region overlapping net is positioned at different address spaces with the ID of core overlay network.
11. device according to claim 9, it is characterized in that, described client login algorithm specifically comprises: when client directly is linked into the regional center server of an operator, client is initiated login to logon server, flow detection Equipment Inspection login message by the regional center server, if the login message points to this operator, then allow the client login; Otherwise, send the message that resets to client, forbid the login of client; When client was linked into the regional center server of a plurality of operators simultaneously by ISP, client was obtained a plurality of login IDs.
12. according to each described device of claim 9 to 11, it is characterized in that, described path planning module is determined communication path according to the path cost table, specifically comprises: when the client of two mutual communication is in same region overlapping net inside, then these two client direct communications;
Be positioned at the zones of different overlay network of same operator when two clients, then by the path cost table of the core overlay network node under the client according to core overlay network node, determine the path by dijkstra's algorithm, and after choosing via node on the path, return to client;
When two clients are positioned at two operators, at first determine the path of one of them client to the operator boundary node, continue to determine subsequent path as via node by this boundary node to the server application of another operator; Described via node is the agent node across two operators.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102192794A CN102299841A (en) | 2010-06-25 | 2010-06-25 | Service-based P2P (Peer-to-Peer) path determination method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102192794A CN102299841A (en) | 2010-06-25 | 2010-06-25 | Service-based P2P (Peer-to-Peer) path determination method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102299841A true CN102299841A (en) | 2011-12-28 |
Family
ID=45360028
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102192794A Pending CN102299841A (en) | 2010-06-25 | 2010-06-25 | Service-based P2P (Peer-to-Peer) path determination method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102299841A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101938410A (en) * | 2010-06-29 | 2011-01-05 | 中兴通讯股份有限公司 | Hierarchical hybrid network system and routing optimization method thereof |
| CN103152817A (en) * | 2013-03-27 | 2013-06-12 | 哈尔滨工业大学 | Distributed clock synchronizing method based on broadcast Gossip algorithm |
| CN103475578A (en) * | 2013-09-09 | 2013-12-25 | 华为技术有限公司 | Method and device for path selection |
| CN104683235A (en) * | 2015-02-07 | 2015-06-03 | 江西科技学院 | Method for optimizing QOS (Quality of Service) router based on ant colony algorithm |
| CN105657006A (en) * | 2015-12-29 | 2016-06-08 | 厦门网宿软件科技有限公司 | First visit acceleration method and system based on Internet acceleration network |
| CN105933945A (en) * | 2016-04-01 | 2016-09-07 | 西安交通大学 | Data download route design method capable of supporting P2P sharing mechanism and applicable to D2D network |
| CN108989220A (en) * | 2018-09-05 | 2018-12-11 | 中国联合网络通信集团有限公司 | Route Method And Route System |
| CN111343245A (en) * | 2020-02-13 | 2020-06-26 | 北京字节跳动网络技术有限公司 | Uploading line scheduling method and device, electronic equipment and readable storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101345628A (en) * | 2007-07-13 | 2009-01-14 | 中兴通讯股份有限公司 | Source node selection method |
| CN101483574A (en) * | 2008-01-08 | 2009-07-15 | 华为技术有限公司 | Network system, method and network appliance for providing service by the network system |
| CN101599893A (en) * | 2008-06-02 | 2009-12-09 | 华为技术有限公司 | A kind of minute territory network and obtain the method for branch territory network of network topological diagram |
-
2010
- 2010-06-25 CN CN2010102192794A patent/CN102299841A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101345628A (en) * | 2007-07-13 | 2009-01-14 | 中兴通讯股份有限公司 | Source node selection method |
| CN101483574A (en) * | 2008-01-08 | 2009-07-15 | 华为技术有限公司 | Network system, method and network appliance for providing service by the network system |
| CN101599893A (en) * | 2008-06-02 | 2009-12-09 | 华为技术有限公司 | A kind of minute territory network and obtain the method for branch territory network of network topological diagram |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101938410A (en) * | 2010-06-29 | 2011-01-05 | 中兴通讯股份有限公司 | Hierarchical hybrid network system and routing optimization method thereof |
| CN103152817A (en) * | 2013-03-27 | 2013-06-12 | 哈尔滨工业大学 | Distributed clock synchronizing method based on broadcast Gossip algorithm |
| CN103152817B (en) * | 2013-03-27 | 2015-04-15 | 哈尔滨工业大学 | Distributed clock synchronizing method based on broadcast Gossip algorithm |
| CN103475578A (en) * | 2013-09-09 | 2013-12-25 | 华为技术有限公司 | Method and device for path selection |
| CN103475578B (en) * | 2013-09-09 | 2017-03-15 | 华为技术有限公司 | A kind of routing resource and device |
| CN104683235A (en) * | 2015-02-07 | 2015-06-03 | 江西科技学院 | Method for optimizing QOS (Quality of Service) router based on ant colony algorithm |
| CN105657006B (en) * | 2015-12-29 | 2019-06-11 | 厦门网宿软件科技有限公司 | A kind of access acceleration method and system for the first time accelerating network based on online |
| CN105657006A (en) * | 2015-12-29 | 2016-06-08 | 厦门网宿软件科技有限公司 | First visit acceleration method and system based on Internet acceleration network |
| CN105933945A (en) * | 2016-04-01 | 2016-09-07 | 西安交通大学 | Data download route design method capable of supporting P2P sharing mechanism and applicable to D2D network |
| CN105933945B (en) * | 2016-04-01 | 2019-05-24 | 西安交通大学 | The data of P2P sharing mechanism are supported to download Route Design Method in D2D network |
| CN108989220A (en) * | 2018-09-05 | 2018-12-11 | 中国联合网络通信集团有限公司 | Route Method And Route System |
| CN108989220B (en) * | 2018-09-05 | 2021-04-02 | 中国联合网络通信集团有限公司 | Routing method and routing system |
| CN111343245A (en) * | 2020-02-13 | 2020-06-26 | 北京字节跳动网络技术有限公司 | Uploading line scheduling method and device, electronic equipment and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102299841A (en) | Service-based P2P (Peer-to-Peer) path determination method and device | |
| CN109040312B (en) | Multi-access edge computing network system and method | |
| CN1957568B (en) | Open service discovery and routing mechanism for configuring cross-domain telecommunication services | |
| CN100505749C (en) | Router and SIP server | |
| CN108696950A (en) | A kind of method, apparatus of session rebuilding, AMF, SMF and terminal | |
| CN110351109A (en) | The management method and device of topology information, system, storage medium, electronic device | |
| US10630508B2 (en) | Dynamic customer VLAN identifiers in a telecommunications network | |
| CN106375214A (en) | SDN-based tiered routing path determination method and device | |
| CN102739497A (en) | Automatic generation method for routes and device thereof | |
| CN101946556A (en) | Aggregating portable base stations of femtocells | |
| CN107404512A (en) | Resource subscription method, resource subscription device and resource subscription Xi System | |
| CN106789637A (en) | A kind of path establishment method of cross-domain service intercommunication, controller and system | |
| CN106850424A (en) | A kind of system of selection, the apparatus and system in IP layers of path | |
| CN108848537A (en) | Edge cloud construction method and system | |
| Wang et al. | A multi-domain SDN scalability architecture implementation based on the coordinate controller | |
| CN106899641A (en) | The acquisition methods of data resource, server, control device and communication system | |
| Phanse et al. | Design and demonstration of policy-based management in a multi-hop ad hoc network | |
| CN104683252B (en) | A kind of gateway applied to gaming network is connected into method and system | |
| SE9904841D0 (en) | Method and system for communication | |
| Krug et al. | Hybrid scheme to enable DTN routing protocols to efficiently exploit stable MANET contacts | |
| CN102316086B (en) | The trunking method of business datum and relay node | |
| EP2924919B1 (en) | Network terminal and display method therefor | |
| CN103503373A (en) | Communication system and method | |
| CN106972973A (en) | A kind of control method, controller and interchanger | |
| CN115277578B (en) | Service arrangement method, device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20111228 |