CN103179045A - Resource node selection method supportive of P2P (peer to peer) traffic optimization - Google Patents
Resource node selection method supportive of P2P (peer to peer) traffic optimization Download PDFInfo
- Publication number
- CN103179045A CN103179045A CN2013100494933A CN201310049493A CN103179045A CN 103179045 A CN103179045 A CN 103179045A CN 2013100494933 A CN2013100494933 A CN 2013100494933A CN 201310049493 A CN201310049493 A CN 201310049493A CN 103179045 A CN103179045 A CN 103179045A
- Authority
- CN
- China
- Prior art keywords
- resource
- node
- resource node
- pid
- address
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a resource node selection method supportive of P2P (peer to peer) traffic optimization. The method includes: receiving resource node information sent by a resource information storage entity in a P2P overlay network, wherein the resource node information includes IP (internet protocol) addresses of user nodes and a resource node list of IP addresses of each resource node corresponding to resources requested by the user nodes; calculating a link cost table and a network arear division table according to dynamic network information; and respectively determining resource priority value of each resource node relative to the user nodes according to the link cost table, the network area division table, the IP addresses of the user nodes and the IP addresses of each resource node in the resource node list, and combining a node available connection number to return an optimized resource node list to the user nodes to dynamically adjust the resource priority values. By the resource node selection method supportive of P2P traffic optimization, P2P traffic passing through a backbone network can be lowered, traffic localization can be realized, and influences on other services can be reduced.
Description
Technical field
The present invention relates to computer networking technology, relate in particular to a kind of resource node selecting method of the P2P of support flow optimization.
Background technology
Equity (peer-to-peer, be called for short P2P) network be a kind of be personal computer (personal computer for the different user node, be called for short PC) between without the technology of the direct swap data of trunking or service, in the P2P network, all user nodes all are in reciprocity status, each user node in network can serve as client, can provide resource and service to other user node as server again.Advantage due to P2P network architecture aspect, P2P service in recent years is a large amount of to be occurred, overwhelming majority content supplier adopts the P2P technology to provide relevant service for the user, but when a large amount of services based on the P2P technology are pushed out, in network, massive band width is engulfed by the P2P flow, data show that in network, the bandwidth more than 70% is shared by the flow that P2P uses generation.
P2P uses taking of the network bandwidth so serious, it is mainly as a kind of application layer technology because of P2P, all user nodes have consisted of the nerve of a covering of an application layer, and in the P2P nerve of a covering, the topological structure of the institutional framework of user node and bottom bearer network is inconsistent, cause P2P nerve of a covering and bottom bearer network not mating structurally to produce a large amount of flows and pass through, thereby increased the weight of the burden of bottom bearer network.for example in bit stream (BitTorrent) is used, be positioned at Pekinese's user node and initiate the query requests of resource, tracking server Tracker can inquire about the node that has this resource and therefrom select at random some nodes to return to the user node of request in the P2P nerve of a covering, therefore the node that has this resource that is arranged in New York may be selected and appear at the some nodes that return, if the user node of request has been selected the resource node of this node as download file, the request the user node download file time will produce from New York to the P2P of Pekinese flow, and numerous P2P application can cause producing a large amount of this flows that pass through backbone network.Because the P2P flow takies the network bandwidth in a large number, had a strong impact on normally carrying out of other business, therefore how the P2P flow being optimized is the problem that current internet service provider (Internet Service Provider is called for short ISP) needs solution badly.
Summary of the invention
The object of the present invention is to provide a kind of resource node selecting method of the P2P of support flow optimization, thereby the flow that easily causes passing through in a large number backbone network to solve existing resource node selecting method has a strong impact on the problem of other business.
The resource node selecting method that a kind of P2P of support flow optimization is provided of the present invention comprises:
Receive the resource node information that the P2P nerve of a covering sends, described resource node information comprises the IP address of user node and the resource node list corresponding with the resource of described user node request, and described resource node list comprises the IP address of at least one resource node;
Determine respectively the resource preferred value of the relatively described user node of each resource node according to the IP address of each resource node in the IP address of described user node and described resource node list, determine that in described resource node list, the resource preferred value satisfies each pre-conditioned resource node;
Return to resource node list after optimization to described user node, resource node list after described optimization comprises that the resource preferred value satisfies the IP address of each pre-conditioned resource node so that described user node set up with described optimization after the resource node list in being connected of at least one resource node and Gains resources.
adopt the beneficial effect of the invention described above technical scheme to be: to come computing network zone division table and link cost table by dynamic network information, and divide table according to described network area, the link cost table, the IP address of the IP address of each resource node and user node determines that the resource preferred value of the relative user node of each resource node sorts to each resource node, and can use the linking number table in conjunction with node, return to the resource node list that comprises after the resource preferred value satisfies the optimization of IP address of pre-conditioned resource node to user node, can reduce the P2P flow that passes through backbone network, realize flow localized, reduce the impact on other business, provide better business experience for the user simultaneously.
Description of drawings
The flow chart of the resource node selecting method of a kind of P2P of support flow optimization that Fig. 1 provides for the embodiment of the present invention one;
The signaling process figure of the resource node selecting method of a kind of P2P of support flow optimization that Fig. 2 provides for the embodiment of the present invention two.
Embodiment
The flow chart of the resource node selecting method of a kind of P2P of support flow optimization that Fig. 1 provides for the embodiment of the present invention one, as shown in Figure 1, described method can comprise the steps:
Need to prove, the executive agent of the embodiment of the present invention is that the resource node of the support P2P flow optimization disposed by ISP is selected entity, and communicates by network and P2P nerve of a covering and IP bearer network.
in embodiments of the present invention, when user node is wished Gains resources, can send resource request message to the resource information storage entity in the P2P nerve of a covering, the IP address that can comprise the user node of request resource in this resource request message, the resource name of request or the resource ID corresponding with the resource name of request, the resource information storage entity can be tracking server Tracker in the P2P nerve of a covering or the super node in structured P 2 P network, this entity is on the basis of the resource information storage that has Tracker now and locating function, the resource node list that no longer will inquire about gained directly sends to user node, but will obtain holding and the resource name of the user node request of request resource or the resource node list of the corresponding resource of resource ID by inquiry, then select entity to send the resource node information that is optimized for to the resource node list that obtains to the resource node of supporting the P2P flow optimization, support the resource node of P2P flow optimization to select entity to receive the resource node information that the resource information storage entity in the P2P nerve of a covering sends, in the present embodiment, the IP address that can comprise the user node of resource node list that the resource information storage entity obtains by inquiry and request resource in resource node information, wherein, the IP address that can comprise the resource node that at least one has this resource in the resource node list.
Support the resource node of P2P flow optimization to select entity according to the IP address of each resource node in the IP address of user node and resource node list, determine the resource preferred value of the relative user node of each resource node in the resource node list, in embodiments of the present invention, the resource preferred value can each resource node of concentrated expression and user node between the information such as physical distance, bandwidth, the path delay of time.Concrete, the resource preferred value can be passed through by the path delay of time between each resource node and user node, path available bandwidth, hop count, autonomous system (Autonomous System is called for short AS) network state information such as number and determine.
the resource node selection entity of support P2P flow optimization can be picked out the resource preferred value according to the resource preferred value of the relative user node of each resource node and satisfy pre-conditioned resource node from the resource node list that the resource information storage entity sends, and the resource preferred value of picking out is satisfied pre-conditioned resource node as the resource node list after optimizing, resource node list after this optimization is sent to the user node corresponding with the IP address of the user node of request resource, in the present embodiment, the IP address that can comprise each resource node of picking out in the resource node list after optimization, thereby the connection of at least one resource node in the resource node list of the user node that makes request resource after can Establishment and optimization and obtain corresponding resource, and enjoy business experience preferably.
In the present embodiment, by determine the resource preferred value of the relative user node of each resource node according to the IP address of the IP address of each resource node and user node, return to the resource node list that comprises after the resource preferred value satisfies the optimization of IP address of each pre-conditioned resource node to user node, can reduce the P2P flow that passes through backbone network, realize the localization of P2P flow, provide better business experience for user node simultaneously.
Concrete, in the above-described embodiments, described pre-conditioned can be that the resource preferred value reaches predetermined threshold value or resource preferred value come resource node before default figure place in sequence from high to low.The resource preferred value satisfies each pre-conditioned resource node and is: in the resource node list that the resource information storage entity in the P2P nerve of a covering sends, the resource preferred value reaches each resource node of predetermined threshold value; Or come resource node before default figure place in the resource preferred value sequence from high to low of each resource node in the resource node list, for instance, can be to come the resource node of front 10 in the resource preferred value sequence from high to low by each resource node in the resource node list, can be also to come front 10% resource node in the resource preferred value sequence from high to low by each resource node in the resource node list.
further, on the basis of above-described embodiment, before step 102, support the resource node of P2P flow optimization to select entity can also obtain network optimization information, wherein, network optimization information can comprise network area division table and link cost table, wherein, division table in network area can comprise network area identifier (the Provider-Defined Network Location Identifier of each provider's definition, be called for short PID) and at least one IP address and subnet mask corresponding with each PID, for instance, can be to distinguish corresponding IP address and the set of subnet mask with each PID, as shown in table 1 below, the link cost table can comprise source PID, purpose PID and the link cost value from source PID to purpose PID, and is as shown in table 2 below.
Table 1:
Table 2:
Therefore, step 102 specifically can comprise: divide table according to the network area, determine user node and each resource node PID of correspondence respectively; With the link cost value take PID corresponding to each resource node as source PID, take PID corresponding to user node as purpose PID in the link cost table respectively as the resource preferred value of the relative user node of each resource node.
Concrete, pre-conditioned described in above-described embodiment can also comprise the first sub-condition, the second sub-condition and the 3rd sub-condition.Division table in network area can also comprise autonomous system sign AS ID and the PID corresponding with each AS ID; Therefore, after step 102, support the resource node of P2P flow optimization to select entity to divide table according to the network area, determine user node and AS ID corresponding to each resource node; Resource preferred value according to the relative user node of each resource node, determine that same PID corresponding to user node and resource preferred value satisfy the first subconditional resource node, determine and the corresponding different PID of user node and corresponding same AS ID and satisfied the second subconditional resource node of resource preferred value, determine and the corresponding different PID of user node and corresponding different AS ID and satisfied the 3rd subconditional resource node of resource preferred value; Resource node list after optimizing in step 103 can comprise the above-mentioned IP address of satisfying the first subconditional resource node, satisfying the second subconditional resource node and satisfying the 3rd subconditional resource node.
for instance, in the embodiment of the present invention, ISP can be divided into a plurality of AS with its network according to the existing topological structure of IP bearer network, and adopt unique AS ID to identify each AS, wherein each AS internal operation one overlaps Interior Gateway Protocol (Interior Gateway Protocol, be called for short IGP), and IGP can be based on ospf (Open Shortest Path First, abbreviation OSPF) routing protocol (the Intermediate System to Intermediate System Routing Protocol of agreement or Intermediate System-to-Intermediate System, be called for short IS-IS) AS is divided into a plurality of regional Area, and the corresponding PID in each zone.Therefore, in the present invention for the localization that realizes flow and prevent resource isolation, be that Three regions is selected respectively with each resource node in the resource node list according to the different demarcation with the band of position of user node, as being positioned at same PID, being positioned at the different PID of same AS and being positioned at the different PID of different AS with user node with user node from user node; And select qualified resource node to return to user node from this zone according to the pre-conditioned of each zone, for example, select to be positioned at same PID with user node and satisfy the first subconditional resource node, be positioned at the different PID of same AS and satisfied the second subconditional resource node with user node, and user node is positioned at the different PID of different AS and satisfied the 3rd subconditional resource node returns to user node.need to prove, in the present embodiment, the described first sub-condition can be that the resource preferred value reaches predetermined threshold value that should the zone or resource preferred value are come in this zone resource node before default figure place in sequence from high to low, for example, can be a%, the second sub-condition can be that the resource preferred value reaches predetermined threshold value that should the zone or resource preferred value are come in this zone resource node before default figure place in sequence from high to low, for example, can be b%, the 3rd sub-condition can be that the resource preferred value reaches predetermined threshold value that should the zone or resource preferred value are come in this zone resource node before default figure place in sequence from high to low, for example, can be c%, satisfy simultaneously a%+b%+c%=100%.Wherein, the first sub-condition, the second sub-condition and the 3rd subconditional concrete value are relevant with flow localized degree, can arrange flexibly according to the demand of concrete enforcement.For example, if ISP wishes to realize the flow localized effect of PID level, can suitably improve the value of the first sub-condition a; If ISP wishes to realize the flow localized effect of AS level, can suitably improve so the value of the first sub-condition a and the second sub-condition b.
In the embodiment of the present invention, support the resource node of P2P flow optimization to select entity to determine resource node from multizone respectively, thereby list is optimized to resource node, avoiding the generation of the excessive localized phenomenon of flow, and provides better business experience for the user; Because the resource node selection entity of supporting the P2P flow optimization is disposed by ISP, therefore, can prevent the exposure of privacy of user, thereby realize from many aspects ISP and user's win-win in addition.
Further, be link cost value between PID due to what record in the link cost table, and be identical with link cost value that user node is positioned at the relative user node of each resource node of same PID, therefore, when carrying out the node selection, can't judge according to link cost value merely; And have the resource node of hot resource for some, and the situation that inevitably can occur excessively being selected occurs, and only judge also unreasonable this moment according to link cost value.Therefore, in embodiments of the present invention, support the resource node of P2P flow optimization to select entity to determine each resource node corresponding available linking number respectively according to the IP address of each resource node in the resource node list, wherein, can preset a linking number the highest for each resource node in the P2P nerve of a covering, after this resource node was selected, its available linking number will subtract 1, reduce to 0 after this resource node can not be selected; Otherwise its available linking number will be added 1 after the user node of the requested resource of this resource node discharges; If this resource node withdraws from the P2P nerve of a covering, its available linking number will be set to 0, if this resource node adds the P2P nerve of a covering again, its available linking number reverts to the highest default linking number.
therefore, in embodiments of the present invention, support the resource node of P2P flow optimization to select after entity can determine the resource preferred value of the relative user node of each resource node respectively according to the IP address of the IP address of user node and each resource node, can also determine that available linking number in the resource node list is not 0 resource node, then with available linking number be not 0 and the resource preferred value satisfy at least one pre-conditioned resource node and send as the user node of the resource node list after optimizing to request resource, wherein, resource node list after optimization comprises that available linking number is not 0 and the resource preferred value IP address of satisfying each pre-conditioned resource node.In embodiments of the present invention, can optimize as auxiliary the foundation that resource node is selected by the available linking number of resource node, thereby can effectively avoid the situation that a resource node is excessively chosen to occur.
Concrete, in the above-described embodiments, before the resource node selection entity of support P2P flow optimization obtains network optimization information, the PID that in the Gains resources node listing, each resource node is corresponding respectively passes through the network state informations such as number to time delay, hop count, path available bandwidth and the AS in path between PID corresponding to user node, wherein, the Congestion Level SPCC that has reflected path between two nodes the path delay of time, the distance in path between two nodes of hop count reflection, path available bandwidth have reflected the peak transfer rate in path between two nodes; The hop count of one paths its possibility of passing through backbone network more at most is just larger, and a purpose of the present embodiment to be the flow that reduces backbone network pass through, realize flow localizedly, therefore need to select the less node of hop count; The number of passing through AS has reflected the jumping figure between two node place AS, will exist as a penalty factor in the link cost computational methods, to avoid selecting to cross over the node of a plurality of AS as neighbor node.
Between the PID that in the resource node list of for example, obtaining, each resource node the is corresponding PID corresponding with user node, the time delay in path is delay
I, j, hop count is hops
i,j, path available bandwidth is available_bandwidth
i,jAnd AS to pass through number be as_path
i,j, can calculate respectively take PID corresponding to each resource node as source PID by following formula, the link cost value take PID corresponding to user node as purpose PID:
Wherein, i is the label of PID corresponding to resource node, and j is the label of PID corresponding to user node, α is the adjustment factor of path available bandwidth, the value of α can affect the susceptibility of path available bandwidth parameter, makes those available bandwidths resource node with the obvious advantage selected, 0≤α≤1; β is the adjustment factor in path delay, and the value that increases β can prevent that the larger node of those time delays is selected, β 〉=1; γ is the adjustment factor that AS passes through, and can limit those nodes that pass through a plurality of AS by adjustment γ selected, γ＞1.Need to prove, α, β and γ can determine according to the optimisation strategy of real network and ISP; Preferably, in emulation experiment, found that according to many experiments α=1, β=2, γ=10 o'clock optimum results are better.In embodiments of the present invention, link cost value is higher illustrates that source PID is nearer and bandwidth is high, it is low to postpone to the physical distance of purpose PID; And link cost value is higher, and corresponding resource preferred value is also higher, and the resource preferred value is higher illustrates that the physical distance of user node of the relative request resource of this resource node is nearer and bandwidth is high, it is low to postpone.
for example, suppose to co-exist in network N PID, support that the resource node selection entity of P2P flow optimization can be according to the path delay of time between each PID that obtains, hop count, path available bandwidth and AS pass through the network information such as number and calculate link cost value between N PID, and store into as above in table 2, after the resource node of supporting the P2P flow optimization selects entity to receive resource node information, can according in resource node information in the resource node list PID of each resource node as source PID, take the PID of the user node of request resource as purpose PID, and obtain link cost value from the link cost table, and with its resource preferred value as the user node of the relative request resource of each resource node.
further, link cost value in network between two nodes is can be to support the resource node of P2P flow optimization to select entity to calculate with certain cycle, the link cost value of therefore storing in this cycle link cost table might not correctly reflect current link circuit condition, therefore, network optimization information also comprises link cost adjustment factor table, wherein, link cost is adjusted can comprise PID and the link cost adjustment factor corresponding with PID in factor table, each is adjusted the factor and is the ratio of the link cost value of being stored in real-time link cost value take described PID as source PID and link cost table.In the various embodiments described above, after determining the resource preferred value of the relative user node of each resource node, the resource preferred value of the relative user node of each resource node can also be adjusted the product of the factor respectively as the resource preferred value after each resource node adjustment by link cost corresponding to PID corresponding with each resource node; Thereby the resource node list after optimizing comprises the IP address that the resource preferred value after adjustment satisfies each pre-conditioned resource node.In embodiments of the present invention, adjust factor table by link cost and realized the self adaptation adjustment of link cost value between each PID in the link cost table, thereby make the resource preferred value after each resource node adjustment have real-time, and reduced the complexity of system.
Further, after the resource node of supporting the P2P flow optimization selected entity to determine the resource node list after optimization, the link cost that can also adjust in link cost adjustment factor table was adjusted the factor.Specifically, PID corresponding to each resource node in resource node list after the resource node selection entity of support P2P flow optimization is determined to optimize, reduce described link cost and adjust the link cost adjustment factor of the PID that described in factor table, each resource node is corresponding, thereby can reduce the resource node selecteed probability again in this PID, make the resource node after optimization provide business experience preferably for user node.
In addition, support the resource node of P2P flow optimization to select entity can also receive the connection release message that user node returns, wherein, the IP address that can comprise each resource node of the IP address of user node and user node release connection in connection release message, and the IP PID corresponding to address of each resource node of definite release connection, adjust the link cost of PID corresponding to the IP address of each resource node in factor table and adjust the factor thereby increase described link cost, thereby can improve resource node selecteed probability again in this PID.
For instance, can reduce the link cost adjustment factor corresponding with this PID in the link cost adjustment form by upgrading factor P%, or increase link cost the adjustment factor, wherein Q%＜P%＜100% corresponding with this PID in the link cost adjustment form by upgrading factor Q %.But, too fast in order to prevent that the corresponding adjustment factor of this a certain PID from descending in repeatedly calculating in actual applications, can be according to Cost * Q
n0 select the value of P and Q, and wherein, Cost is link cost value corresponding with this PID in the link cost table, n is the selecteed total degree of each resource node in this PID.
in embodiments of the present invention, come computing network zone division table and link cost table by dynamic network information, and divide table according to described network area, the link cost table, the IP address of the IP address of each resource node and user node determines that the resource preferred value of the relative user node of each resource node and node can use the linking number table, return to the resource node list that comprises after the resource preferred value satisfies the optimization of IP address of each pre-conditioned resource node to user node, can reduce the P2P flow that passes through backbone network, reduce the impact on other business, provide better business experience for user node simultaneously.
The signaling process figure of the resource node selecting method of a kind of P2P of support flow optimization that Fig. 2 provides for the embodiment of the present invention two, as shown in Figure 2, described method can comprise:
Step 201, ISP carries out network and divides;
In the present embodiment, according to network topological diagram, network is carried out the zone by ISP and divide, the IP bearer network is divided into a plurality of PID.For instance, ISP can be divided into a plurality of AS with its network according to the existing topological structure of IP bearer network, and adopt unique AS ID to identify each AS, wherein each AS internal operation one overlaps IGP, and IGP can be divided into a plurality of Area with an AS based on ospf protocol or IS-IS, and the corresponding PID of each Area.
Need to prove, in embodiments of the present invention, support the resource node selective system of P2P flow optimization can comprise resource information storage entity, network information service entity and resource node selection entity, specifically, network information service entity have that the network information gathers, network diagram and cost figure calculates, select three kinds of functions of entity interaction with resource node; Resource node select entity have with network information service entity interaction, mutual with the resource information storage entity, node is selected with sequence, with the mutual four kinds of functions of P2P user node; The resource information storage entity is Tracker in hybrid P2P network or the super node in structured P 2 P network, this entity is on the storage of original resource information and query function basis, the resource node that no longer inquiry is obtained directly sends to P2P user, selects entity to select to carry out node optimization but offer resource node.
Step 202, network information service entity obtains the network information;
Network information service entity can periodically obtain real-time dynamic network information from ISP.
Step 203 is according to network information tectonic network zone division table and link cost table;
Network information service entity is according to the real-time dynamic network information tectonic network zone division table and the link cost table that obtain from ISP.
Step 204, the P2P user node sends resource request message to the resource information storage entity in the P2P nerve of a covering;
In embodiments of the present invention, can comprise the IP address of this P2P user node, resource name or the resource ID of request resource in resource request message.
Inquiry obtains the resource node list according to resource request message for step 205, resource information storage entity;
In embodiments of the present invention, the resource information storage entity can be inquired about local data base according to the resource request message of P2P user node, thereby obtain the resource node list, wherein, can comprise the IP address of holding with each resource node of the resource of user node request in the resource node list.
Step 206, the resource information storage entity selects entity to send resource node information to resource node;
Wherein, resource node information comprises the IP address of user node and the resource node list corresponding with the resource of described user node request, and described resource node list comprises the IP address of each resource node.
Step 207, resource node select entity to obtain network area division table and the link cost table of network information service entity structure;
Step 208, resource node select entity to carry out the node optimization selection;
In embodiments of the present invention, resource node selects entity to obtain network optimization information from network information service entity, and namely table and link cost table are divided in the network area of network information service entity structure; And receive resource node information from the resource information storage entity, resource node selects entity to obtain respectively the resource preferred value of the relative user node of each resource node according to IP address, network area division table and the link cost table of the IP address of user node and resource node, determine that in the resource node list, the resource preferred value satisfies each pre-conditioned resource node, thereby the optimization of completing resource node is selected.
Step 209, resource node select the resource node list after entity will be optimized to return to the P2P user node;
Resource node selects entity that the resource node list of optimizing is sent to the P2P user node, wherein, resource node list after optimization comprises that the resource preferred value satisfies each pre-conditioned resource node, thereby makes the connection of at least one resource node in resource node list after P2P user node Establishment and optimization and Gains resources.
One of ordinary skill in the art will appreciate that: all or part of step that realizes above-mentioned each embodiment of the method can be completed by the hardware that program command is correlated with.Aforesaid program can be stored in a computer read/write memory medium.This program is carried out the step that comprises above-mentioned each embodiment of the method when carrying out; And aforesaid storage medium comprises: the various media that can be program code stored such as ROM, RAM, magnetic disc or CD.
It should be noted that at last: above each embodiment is not intended to limit only in order to technical scheme of the present invention to be described; Although with reference to aforementioned each embodiment, the present invention is had been described in detail, those of ordinary skill in the art is to be understood that: it still can be modified to the technical scheme that aforementioned each embodiment puts down in writing, and perhaps some or all of technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the scope of various embodiments of the present invention technical scheme.
Claims (9)
1. a resource node selecting method of supporting the P2P flow optimization, is characterized in that, comprising:
Receive the resource node information that the P2P nerve of a covering sends, described resource node information comprises the IP address of user node and the resource node list corresponding with the resource of described user node request, and described resource node list comprises the IP address of at least one resource node;
Determine respectively the resource preferred value of the relatively described user node of each resource node according to the IP address of each resource node in the IP address of described user node and described resource node list, determine that in described resource node list, the resource preferred value satisfies each pre-conditioned resource node;
Return to resource node list after optimization to described user node, resource node list after described optimization comprises that the resource preferred value satisfies the IP address of each pre-conditioned resource node so that described user node set up with described optimization after the resource node list in being connected of at least one resource node and Gains resources.
2. method according to claim 1, it is characterized in that, described according to described user node the IP address and described resource node list in before the IP address of each resource node determines the resource preferred value of the relatively described user node of each resource node respectively, also comprise:
Obtain network optimization information, table and link cost table are divided in described network optimization packets of information includes network zone, described network area division table comprises the network area identifier PID of each provider's definition and IP address and the subnet mask corresponding with each PID, and described link cost table comprises source PID, purpose PID and the link cost value from source PID to purpose PID;
Described according to described user node the IP address and the IP address of described each resource node determine respectively the resource preferred value of the relatively described user node of each resource node, comprising:
Divide table according to described network area, determine described user node and each resource node PID of correspondence respectively;
With the link cost value take PID corresponding to each resource node as source PID, take PID corresponding to described user node as purpose PID in described link cost table respectively as the resource preferred value of the relatively described user node of each resource node.
3. method according to claim 2, is characterized in that, described pre-conditioned the first sub-condition, the second sub-condition and the 3rd sub-condition of comprising; Described network area division table also comprises autonomous system sign AS ID and the PID corresponding with each AS ID;
In described definite described resource node list, the resource preferred value satisfies each pre-conditioned resource node, comprising:
Divide table according to described network area, determine described user node and each resource node AS ID of correspondence respectively;
Resource preferred value according to the relatively described user node of each resource node, determine that same PID corresponding to described user node and resource preferred value satisfy the first subconditional resource node, determine and the corresponding different PID of described user node and corresponding same AS ID and satisfied the second subconditional resource node of resource preferred value, determine and the corresponding different PID of described user node and corresponding different AS ID and satisfied the 3rd subconditional resource node of resource preferred value;
Resource node list after described optimization comprises the described IP address of satisfying the first subconditional resource node, satisfying the second subconditional resource node and satisfying the 3rd subconditional resource node.
4. according to claim 1～3 described methods of any one, is characterized in that, described pre-conditionedly reach predetermined threshold value or resource preferred value come default figure place in sequence from high to low before for the resource preferred value.
5. method according to claim 4, is characterized in that, also comprises:
Determine each resource node corresponding available linking number respectively according to the IP address of each resource node in described resource node list;
In described definite described resource node list, the resource preferred value satisfies each pre-conditioned resource node, comprising:
Determine in described resource node list available linking number be not 0 and the resource preferred value satisfy each pre-conditioned resource node;
Resource node list after described optimization comprises that available linking number is not 0 and the resource preferred value IP address of satisfying each pre-conditioned resource node.
6. according to claim 2 or 3 described methods, is characterized in that, described network optimization information also comprises link cost adjustment factor table, and described link cost is adjusted factor table and comprised PID and the link cost adjustment factor corresponding with described PID;
In described definite described resource node list, the resource preferred value satisfies each pre-conditioned resource node, comprising:
The link cost that the PID that the resource preferred value of the relatively described user node of each resource node is corresponding with each resource node is corresponding is adjusted the product of the factor respectively as the resource preferred value after each resource node adjustment;
Resource preferred value after determining to adjust in described resource node list satisfies each pre-conditioned resource node;
Resource node list after described optimization comprises that the resource preferred value after adjustment satisfies the IP address of each pre-conditioned resource node.
7. method according to claim 6, is characterized in that, also comprises:
Determine PID corresponding to each resource node in the resource node list after described optimization, reduce described link cost and adjust the link cost of the PID that described in factor table, each resource node is corresponding and adjust the factor.
8. method according to claim 7, is characterized in that, also comprises:
Receive the connection release message that described user node returns, described connection release message comprises the IP address of each resource node of the IP address of described user node and described user node release connection;
Determine the IP PID corresponding to address of each resource node of described release connection, increase described link cost and adjust the link cost of PID corresponding to the IP address of each resource node in factor table and adjust the factor.
9. method according to claim 2, is characterized in that, described obtain network optimization information before, also comprise:
Obtain respectively PID that in described resource node list, each resource node is corresponding to the time delay delay in path between PID corresponding to described user node
I, j, hop count hops
I, j, path available bandwidth available_bandwidth
i,jAnd AS passes through number as_path
i,j
By following formula calculate respectively take PID corresponding to described each resource node as source PID, link cost value take PID corresponding to user node as purpose PID, and add in described link cost table:
Wherein, i is the label of PID corresponding to resource node, and j is the label of PID corresponding to described user node, and α is the adjustment factor of path available bandwidth, 0≤α≤1; β is the adjustment factor in the path delay of time, β 〉=1; γ is the adjustment factor that AS passes through, γ＞1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310049493.3A CN103179045B (en) | 2013-02-07 | 2013-02-07 | Support the resource node selecting method of P2P flow optimization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310049493.3A CN103179045B (en) | 2013-02-07 | 2013-02-07 | Support the resource node selecting method of P2P flow optimization |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103179045A true CN103179045A (en) | 2013-06-26 |
| CN103179045B CN103179045B (en) | 2016-04-13 |
Family
ID=48638676
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310049493.3A Expired - Fee Related CN103179045B (en) | 2013-02-07 | 2013-02-07 | Support the resource node selecting method of P2P flow optimization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103179045B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103532935A (en) * | 2013-09-28 | 2014-01-22 | 福建星网锐捷通讯股份有限公司 | Domain strategy-based P2P (Peer-to-Peer) streaming media transmission control method |
| CN103974138A (en) * | 2014-04-15 | 2014-08-06 | 上海聚力传媒技术有限公司 | Method and device for preloading videos in CDN |
| CN104468696A (en) * | 2014-06-13 | 2015-03-25 | 物联智慧股份有限公司 | Method, server and device for performing point-to-point connection |
| CN108337170A (en) * | 2018-01-30 | 2018-07-27 | 浙江省公众信息产业有限公司 | Distributed resource lookup method and system |
| CN110569615A (en) * | 2019-09-12 | 2019-12-13 | 中国工程物理研究院计算机应用研究所 | multi-source heterogeneous embedded software collaborative simulation test method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729581A (en) * | 2008-10-28 | 2010-06-09 | 华为技术有限公司 | Method, system and device for realizing re-orientation in P2P network |
| CN101883052A (en) * | 2010-06-25 | 2010-11-10 | 中兴通讯股份有限公司 | Method and system for realizing traffic optimization in peer-to-peer network |
| CN101964741A (en) * | 2009-07-25 | 2011-02-02 | 华为技术有限公司 | Method and equipment for sending node list |
| CN102006234A (en) * | 2010-12-09 | 2011-04-06 | 工业和信息化部电信传输研究所 | Method and device for optimizing P2P (Peer-to-Peer) network flow |
| CN102088399A (en) * | 2009-12-08 | 2011-06-08 | 华为技术有限公司 | Flow control method of peer-to-peer (P2P) network, routing equipment and communication system |
-
2013
- 2013-02-07 CN CN201310049493.3A patent/CN103179045B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729581A (en) * | 2008-10-28 | 2010-06-09 | 华为技术有限公司 | Method, system and device for realizing re-orientation in P2P network |
| CN101964741A (en) * | 2009-07-25 | 2011-02-02 | 华为技术有限公司 | Method and equipment for sending node list |
| CN102088399A (en) * | 2009-12-08 | 2011-06-08 | 华为技术有限公司 | Flow control method of peer-to-peer (P2P) network, routing equipment and communication system |
| CN101883052A (en) * | 2010-06-25 | 2010-11-10 | 中兴通讯股份有限公司 | Method and system for realizing traffic optimization in peer-to-peer network |
| CN102006234A (en) * | 2010-12-09 | 2011-04-06 | 工业和信息化部电信传输研究所 | Method and device for optimizing P2P (Peer-to-Peer) network flow |
Non-Patent Citations (2)
| Title |
|---|
| MEGUMI SHIBUYA 等: "ISP-Friendly peer selection mechanism with ALTO-like server", 《NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS), 2011 13TH ASIA-PACIFIC》 * |
| PETER RACZ 等: "BGP-based Locality Promotion for P2P Applications", 《COMPUTER COMMUNICATIONS AND NETWORKS (ICCCN), 2010 PROCEEDINGS OF 19TH INTERNATIONAL CONFERENCE》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103532935A (en) * | 2013-09-28 | 2014-01-22 | 福建星网锐捷通讯股份有限公司 | Domain strategy-based P2P (Peer-to-Peer) streaming media transmission control method |
| CN103532935B (en) * | 2013-09-28 | 2017-01-18 | 福建星网锐捷软件有限公司 | Domain strategy-based P2P (Peer-to-Peer) streaming media transmission control method |
| CN103974138A (en) * | 2014-04-15 | 2014-08-06 | 上海聚力传媒技术有限公司 | Method and device for preloading videos in CDN |
| CN103974138B (en) * | 2014-04-15 | 2018-04-10 | 上海聚力传媒技术有限公司 | For preloading the method and apparatus of video in content distributing network |
| CN104468696A (en) * | 2014-06-13 | 2015-03-25 | 物联智慧股份有限公司 | Method, server and device for performing point-to-point connection |
| CN104468696B (en) * | 2014-06-13 | 2019-04-16 | 物联智慧科技（深圳）有限公司 | Method, server and device for performing point-to-point connection |
| CN108337170A (en) * | 2018-01-30 | 2018-07-27 | 浙江省公众信息产业有限公司 | Distributed resource lookup method and system |
| CN110569615A (en) * | 2019-09-12 | 2019-12-13 | 中国工程物理研究院计算机应用研究所 | multi-source heterogeneous embedded software collaborative simulation test method |
| CN110569615B (en) * | 2019-09-12 | 2023-05-05 | 中国工程物理研究院计算机应用研究所 | Multi-source heterogeneous embedded software collaborative simulation test method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103179045B (en) | 2016-04-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107517228B (en) | Dynamic acceleration method and device in content distribution network | |
| CN103475719B (en) | The content distribution method that in a kind of CDN-P2P UNE, cross-domain flow rate minimizes | |
| CN111934999B (en) | Message transmission method and device | |
| CN104247371A (en) | Name-based neighbor discovery and multi-hop service discovery in information-centric networks | |
| CN105407055B (en) | A kind of consumption control method of content center network | |
| CN104901980A (en) | Popularity-based equilibrium distribution caching method for named data networking | |
| CN102647357B (en) | A kind of contents processing method for routing and device | |
| CN106161610A (en) | A kind of method and system of distributed storage | |
| CN103179045B (en) | Support the resource node selecting method of P2P flow optimization | |
| CN104348722B (en) | Determine content obtaining path, the methods, devices and systems of request processing | |
| JP2014522518A (en) | Content processing method, content processing device, and content processing system | |
| CN102238202B (en) | Method and device for storing and searching index information | |
| Fang et al. | Energy-efficient distributed in-network caching for content-centric networks | |
| WO2024104284A1 (en) | Nwdaf-based management and decision-making method for computing resources | |
| Miao et al. | Multicast virtual network mapping for supporting multiple description coding-based video applications | |
| CN101551781B (en) | Method of magnetic disc cache replacement in P2P video on demand system | |
| CN106161285A (en) | A kind of network resource allocation method and device | |
| CN103825916A (en) | Resource downloading method and resource downloading system | |
| US10291474B2 (en) | Method and system for distributed optimal caching of content over a network | |
| CN112087382B (en) | Service routing method and device | |
| Chao et al. | A game theoretic approach for energy-efficient in-network caching in content-centric networks | |
| WO2022257791A1 (en) | Service code processing method and apparatus based on distributed network, and device and medium | |
| CN102868682B (en) | Method and device for sharing streaming media resources | |
| CN109039896A (en) | Method for routing and device suitable for Information Network | |
| Reshadinezhad et al. | An efficient adaptive cache management scheme for named data networks |
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: 20160413 Termination date: 20170207 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |