CN101969458B - P2P traffic optimization method supportive of hierarchical network topology - Google Patents
P2P traffic optimization method supportive of hierarchical network topology Download PDFInfo
- Publication number
- CN101969458B CN101969458B CN2010102918950A CN201010291895A CN101969458B CN 101969458 B CN101969458 B CN 101969458B CN 2010102918950 A CN2010102918950 A CN 2010102918950A CN 201010291895 A CN201010291895 A CN 201010291895A CN 101969458 B CN101969458 B CN 101969458B
- Authority
- CN
- China
- Prior art keywords
- flow optimization
- distance
- network
- node
- stratification
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a P2P traffic optimization method supportive of a hierarchical network topology and mainly solves the problems that hierarchical network topology information cannot be processed and effective optimization cannot be realized in the prior art. The method comprises the following steps that: a network topology information server (NTIS) in each autonomous system (AS) only collects the topology structure in the local AS and the topology structure of the entire network from a router in the local AS, creates a hierarchical topology structure of the entire network and offers to a traffic optimization server; the traffic optimization server calculates the hierarchical traffic optimization distance from a certain peer node in the local AS to any node in the entire network for the query of a traffic optimization client; and the traffic optimization client selects the peer node of relatively short distance according to the hierarchical traffic optimization distance, establishes connection with the peer node and transmits data. By the method, the hierarchical network topology information can be processed, and the value of different links is reflected; and the method can be used for reducing the P2P traffic on each layer of network.
Description
Technical field
The invention belongs to networking technology area, relate to the P2P flow optimization of supporting the stratification network topology, can be used for reducing the across a network flow of P2P software, optimize distribution and the flow direction of P2P flow in network, improve the download performance of P2P software simultaneously.
Background technology
File based on P2P (Peer-to-Peer) principle is downloaded, video stream media is shared and the networking telephone etc. becomes the main application on the Internet day by day; Meanwhile the P2P flow has occupied the overwhelming majority of online flow, on a lot of backbone networks, has reached 50% to 70% ratio.P2P software is bringing the bad dream that but becomes the ISP of ISP in quick and easy to the user.A lot of ISP think that huge P2P flow has brought network congestion, have influenced the normal operation of other network application, therefore adopt various measure restrictions even shutoff P2P flow.This can reduce P2P user's experience, and causes the contradiction between P2P user and the ISP.
Why P2P software brings so high flow to network; Partly cause comes from its internal mechanism: P2P software is not considered the real topology of bottom-layer network when making up the Overlay network; Cause the serious mismatch of Overlay network topology and bottom-layer network topology; Connection between the equity node is remote connection mostly, and mostly the flow of generation is the across a network flow.With BitTorrent is example, reciprocity node obtains reciprocity node tabulation from LIST SERVER Tracker after, from tabulation, selects 35 reciprocity nodes to connect as neighbours randomly.The two ends of these connections distance probably are far, and mostly transfer of data after this is the transmission of remote cross-network network.Research to BitTorrent shows that for the data that have copy at local network, 70-90% wherein still can download from external network at a distance.This way of ignoring the bottom-layer network topology fully, seeking something far and wide when it is within reach causes a large amount of across a network flows, has taken link between valuable relatively net, has increased the burden of ISP, has caused the antagonism mood of ISP; Simultaneously, the congested often again more serious network bottleneck of link between net, thereby also can influence the downloading rate of P2P software, reduce download performance.
Addressed this problem two kinds of thinkings: one is to use P2P Cache method, in the network of ISP control, places P2P Cache and comes buffer memory P2P flow; Another kind is exactly a P2P application layer traffic optimization method, the download policy of employing localization, and reciprocity node is selected with neighbouring node formation Overlay network, from the neighbouring node data download as far as possible.Wherein, The problem of P2P Cache method need to be to the corresponding mechanism of various active P2P software designs, to realize corresponding protocol; Workload is bigger, and the flow of P2P is huge, the object size of transmission is generally all bigger, and the Cache capacity that needs is big, speed is high; Form the single-point bottleneck easily, the Cache content also possibly cause the relevant legal issue of copyright in addition.Therefore P2P application layer traffic optimization method just becomes a kind of thinking that enjoys expectation that solves P2P software I SP friendly problem.
P2P application layer traffic optimization method is meant the flow direction in application layer optimization P2P network traffics that software produces, to avoid a large amount of across a network flows, improve simultaneously reciprocity node downloading rate, reduce download time.Particularly, be to safeguard that by ISP a server provides topology information, P2P software is as this server of client-access; Read topology information; Obtain the distance between the reciprocity node, the nearer node of chosen distance connects and the transmission data then, thereby reduces the flow in the network.But; Existing P 2P application layer traffic optimization method is only considered single range index; For example hop count or geographic distance; And consider that use a plurality of range indexs simultaneously selects, and existing flow optimization method only selects reciprocity node in a plane, and do not consider two-stage routing architecture in the territory that the Internet itself had, between the territory.Existing the Internet is not the network on a plane, but the network of a stratification: high-rise backbone network by each ISP interconnects and forms, and the intermediate layer is an aggregation networks, and bottom is an access network.In such hierarchical structure, different links have different bandwidth and different value: link needs input more between net usually, is to be worth higher link as far as ISP, and is often limited again with Time Bandwidth; Then relative bandwidth is more abundant for link in the net, and is simultaneously less expensive.Therefore, only in the process of P2P flow optimization, support the network topology of stratification, could be worth according to the difference of different links with the status and realize most economical, effective optimization effect, to embody the preference of ISP.Simultaneously, flow optimization needs topology information, and this topology information generally comes from Routing Protocol.And the routing architecture of the Internet is made up of two-stage route in the territory and between the territory: inter-domain routing protocol is responsible for constructing other topological structure of autonomous system AS level and is calculated the route between AS, and Routing Protocol is responsible for constructing the topological structure in the AS and is calculated the route in the AS in the territory.Therefore the topology information that is obtained by these two kinds of Routing Protocols must be a hierarchical setting, thereby corresponding P2P flow optimization mechanism should be able to receive the topology information of such stratification, and provides prioritization scheme according to the topology information of such stratification.But; Existing P 2P application layer traffic optimization method is not considered the stratification characteristic of the Internet topology, can not receive from the territory, the topology information of the stratification of two-stage routing architecture between the territory, and just the Internet is regarded as the single plane network; All links are made no exception; Thereby can not embody the value of different links and the preference of ISP, and can not reduce the flow on each hierarchical network from high to low, can not realize the effective optimization effect.
Summary of the invention
The objective of the invention is to the existing existing problem of P2P application layer traffic optimization method; A kind of P2P flow optimization method of supporting the stratification network topology is proposed; With the value that embodies different links and the preference of ISP; Reduce the flow on each hierarchical network from high to low, realize the effective optimization effect.
The core concept that realizes the object of the invention is: adopt distributed framework; Network topological information server NTIS in each autonomous system AS; Only the router in this AS is collected network topology structure and the topological structure of the whole network in this AS; With the topological structure of the stratification that makes up the whole network, and calculate in this AS certain reciprocity node to the flow optimization distance of the stratification between any node of the whole network, the client query of confession flow optimization according to the topological structure of such stratification; With flow optimization apart from stratification; With high-rise, low layer is two-layer or more multilayer promptly macroscopical distance is described apart from the flow optimization distance of describing between node with high-rise distance, with low layer apart from description microcosmic distance; Relatively apart from the time earlier than higher level distance, again than lower level distance; Network topology structure in this AS is from Routing Protocol in the territory, and the topological structure of the whole network is from inter-domain routing protocol.Implementation step comprises as follows:
(1) the network topological information server NTIS in each autonomous system AS, network topology structure a plurality of routers in this AS in this AS of collection and the topological structure of the whole network, the topological structure of the stratification of structure the whole network;
(2) the flow optimization server in each AS is obtained the topological structure of the whole network stratification from the network topological information server NTIS in this AS, and waits the inquiry of flow optimization client;
(3) the flow optimization server of flow optimization client in reciprocity node place AS submitted query requests to, inquires about the flow optimization distance of this peer node to other reciprocity node;
(4) after the flow optimization server is received query requests,, calculate the flow optimization distance of this equity node, and this flow optimization distance is returned to the flow optimization client to the stratification of other reciprocity node according to the topological structure of the whole network stratification;
(5) the flow optimization client receive this equity node to the flow optimization of the stratification of other reciprocity node apart from the time, select nearer reciprocity node to connect according to the distance of distance, the transmission data.
The present invention has following advantage:
(1) the present invention can embody the value of different links and the preference of ISP owing in the topological structure of stratification, calculate the flow optimization distance of stratification, reduces the flow on each hierarchical network from high to low, realizes the effective optimization effect;
(2) the present invention be owing to will be mapped to unified flow optimization distance from the topology information of different routing protocol, thus can and Internet domain in, the two-stage routing architecture adapts between the territory;
(3) the present invention since its network topological information server NTIS only the router in this AS collect the topological structure and the topological structure of the whole network of this AS, realize simply;
(4) the present invention is owing to adopt the flow optimization distance of stratification, thereby can hold the range information of multiple physical meaning simultaneously, can make up and realize complicated flow optimization effect;
(5) the present invention is owing to adopt Distributed Architecture; Not only the flow optimization server distribution is at the whole network, flow optimization server of each AS, and in an AS network topological information also a plurality of routers from AS obtain; Thereby the load dispersion, the load of each node is little in the network.
Description of drawings
Fig. 1 is the system construction drawing among the present invention;
Fig. 2 is a FB(flow block) of the present invention;
Fig. 3 is flow optimization distance type notice message format figure among the present invention;
Fig. 4 is flow optimization sign format notice message format figure among the present invention;
Fig. 5 is the exemplary plot of the flow optimization distance of stratification between two reciprocity nodes among the present invention;
Fig. 6 is the communication message format chart between flow optimization server and flow optimization client among the present invention.
Embodiment
With reference to Fig. 1, the entity in the P2P flow optimization system of support stratification network topology comprises network topological information server NTIS, flow optimization server, flow optimization client.Network topological information server NTIS is responsible in this autonomous system AS router collection network topology information everywhere, comprises the outside topology information of the inner topological sum AS of AS.The AS inner topology is mainly from Routing Protocol in the territory, like OSPF.Routing Protocol is divided into several regions with an AS in the territory of some similar OSPF, thereby NTIS needs to obtain the link-state information in this zone alternately with the interior router in each zone.The topology of AS outside is mainly from inter-domain routing protocol, like BGP; NTIS will obtain the outside topological structure of AS from the AS border router of operation BGP.After NTIS obtains the outside topology of the inner topological sum AS of AS, make up the network topology of the whole network stratification, give the flow optimization server.The flow optimization server is optimized distance according to the network topological information calculated flow rate, supplies the flow optimization client query.
With reference to Fig. 2, the present invention supports the P2P flow optimization method of stratification network topology, may further comprise the steps:
1a) through Routing Protocol in the territory, collect the network topology structure in this AS like OSPF; Routing Protocol is divided into several regions with an AS in the territory of some similar OSPF, and each regional internal router is only preserved the Link State of one's respective area, and is sent outside the zone by the link information that Area Border Router gathers the one's respective area; AS for Routing Protocol in the territory of the similar OSPF of operation; Network topological information server NTIS will collect from each regional topology information from the router in each zone; To constitute the topological structure of whole AS, this topological structure is the Link State figure that has stored connection status between interior all-network of this AS and node;
1b) through inter-domain routing protocol, collect the network topology structure of the whole network like path vector agreement BGP; BGP runs on the AS border router, and it has preserved the path vector of each AS, stored on this path vector certain AS the path the AS sequence of process; Because the existence of various routing policies, the path vector storage be not necessarily shortest path, but under the hypothesis of only considering shortest path, it is the tree of root with this AS that the network topology that BGP obtains during stable state is one, other all AS are the nodes in the tree; For the inter-domain routing protocol of similar BGP, network topological information server NTIS will obtain the topological structure of the whole network from the AS border router of this AS, and this topological structure is to be the path vector tree of root with this AS;
1c) obtain respectively to make up the topological structure of the stratification of the whole network with this after the topological structure of the interior topological structure of this AS and the whole network; Because Routing Protocol is different with the mode of inter-domain routing protocol storage networking topology in the territory; For example in the territory Routing Protocol OSPF with Link State stored in form topological structure; And inter-domain routing protocol BGP is with path vector stored in form topological structure; Therefore when the topological structure of the stratification of constructing the whole network, be to store interior topological structure of this AS and the topological structure of the whole network respectively.
Step 3, the flow optimization server of flow optimization client in reciprocity node place AS submitted query requests to, inquires about the flow optimization distance of this peer node to other reciprocity node.
The flow optimization client can be reciprocity node Peer, also can be the LIST SERVER Tracker in the P2P system; When the flow optimization client was reciprocity node Peer, reciprocity node was directly visited the flow optimization server of place AS, submitted the address of this machine and the address list of candidate's equity node to, inquired about the flow optimization distance of this machine to the reciprocity node of each candidate; If the flow optimization client is LIST SERVER Tracker; When certain reciprocity node is connected to Tracker request and returns reciprocity node tabulation; Tracker sends query requests to the flow optimization server of this equity node place AS; Submit the address of this equity node and the address list of candidate's equity node to, inquire about the flow optimization distance of this equity node to each candidate's equity node.
Step 4 after the flow optimization server is received query requests, according to the topological structure of the stratification of the whole network, is calculated the flow optimization distance of this equity node to other reciprocity node, and this flow optimization distance is returned to the flow optimization client.
4a) definition flow optimization distance be the distance of stratification, comprises many levels from high to low, describes the distance of certain physical meaning at all levels, with the macroscopical distance of high-rise distance description, with low layer apart from description microcosmic distance; For example define two-layerly, high one deck is the AS number between the node, and low one deck is the hop count of path in this AS between node; Under the flow optimization distance definition of this stratification, relatively two flow optimizations apart from the time, at first than higher one deck distance, when high-rise distance is identical or close, relatively descend one deck distance then again; The physical meaning of each laminar flow amount optimization distance has multiple; For example reflect AS number, hop count, the geographic distance of distance between reciprocity node, the expense of embodiment ISP preference, and the RTT or the inverse of available bandwidth two-way time that reflects link performance between reciprocity node; The physical meaning of each layer is by flow optimization server notification flow optimization client in the flow optimization distance of stratification; The notice message format is as shown in Figure 3: first definition layer number of times; Be the type of each layer distance then; Represent that like 0x01 hop count, 0x02 represent AS number etc., the type word length is 8; The word length of every layer of distance value is 16;
4b) flow optimization of the reciprocity node of definition is designated the sign of stratification; For example, for a reciprocity node, its sign is defined as double-layer structure, high level is AS number, and low layer is the IP address; Can define some levels as required in the reality, for example several A S constitutes an AS group, and the AS group number is top sign, is AS number secondly, is the regional number that some subnets constitute the zone then, is the IP address at last; The flow optimization server provides two kinds of inquiry services for the flow optimization client: the one, and be the flow optimization sign of stratification with address transition, the 2nd, calculation sources equity node is identified to the flow optimization distance between some purpose equity node signs; The form of flow optimization sign is by flow optimization server notification flow optimization client; The structure of its notice message is as shown in Figure 4: first definition layer number of times; Be the word length tabulation of each layer sign afterwards, represent that how many bytes are each layer sign length be, because the word length value is 8; Thereby each layer sign length be 255 bytes, the flow optimization sign between later flow optimization server and flow optimization client in the interaction data is all pressed this formal definition;
4c) according to the topological structure calculated flow rate optimize apart from the time; According to the network topology structure on each level; Calculate the flow optimization distance on each level respectively; Because the network topology at all levels is from different Routing Protocols; The topology information that these Routing Protocols are preserved has a great difference; For example Routing Protocol OSPF is a link-state protocol in the territory, and inter-domain routing protocol BGP is the path vector agreement, therefore needs the method for difference design map to the flow optimization distance;
4d) flow optimization on calculating certain level apart from the time; If the network topology structure on this level is with the Link State stored in form; Then try to achieve this equity node to the shortest path of other reciprocity node on this hierarchical network, the flow optimization distance between also just obtaining finishing a little on this layer network through shortest path first such as Floyd algorithm or dijkstra's algorithm; With the ospf protocol is example, and the weights on the link are called cost in ospf protocol, and the manufacturer's cost that has is set to the inverse of link bandwidth, if directly adopt the length of OSPF cost as the limit, then the flow optimization distance is exactly the cost sum on the shortest path; If the length of side is set to 1, then the flow optimization distance is exactly the path of shortest path, just hop count; If the length of side is made as the geographic distance between node, then the flow optimization distance be exactly shortest path the geographic distance sum of process; When the node quantity among the AS is very big, utilize the former region partitioning method of OSPF to reduce the complexity of finding the solution of shortest path;
4e) flow optimization on calculating certain level apart from the time, if the network topology structure on this level is with the path vector stored in form, then through direct this equity node of query path vector tree acquisition to the flow optimization distance of other reciprocity node on this level; With the bgp protocol is example; It is the path vector tree of root that BGP has stored with this AS; All AS of the whole network are the nodes in the tree, therefore through query path vector tree just can directly obtain from this AS to other arbitrary AS the AS number of process, as high one deck flow optimization distance; If be provided with the geographic distance between AS, then will pass through geographic distance sum on the AS path as the flow optimization distance;
4f) use 4d) and 4e) in method calculate the flow optimization distance at all levels respectively after, it is combined into the flow optimization distance of stratification; For example; If the topological structure in this AS from the topological structure of OSPF, the whole network from BGP; After the distance and the distance between AS calculated respectively in this AS; With its two-layer as in the flow optimization of the stratification distance respectively, the distance between its description AS on the middle and senior level, low layer is described the distance in this AS; At this moment, if a reciprocity node is positioned at same AS with another candidate's equity node, then the distance of the AS between them is zero, and promptly high-rise distance is zero; And the low layer distance is in the inner distance of AS, like hop count between them; If reciprocity node is positioned at different AS with another candidate's equity node, then the distance of the high level between them be between the two the AS number, be the AS distance; And the distance of the low layer between them is for being routed to the length of candidate's equity node in the part path of this AS inside, equity node place from this equity node; With Fig. 5 is example, and reciprocity node A is arranged in autonomous system AS1, and candidate's equity node B is arranged in autonomous system AS2, and the flow optimization server lookup equity node A of flow optimization client in AS1 is to the flow optimization distance of other candidate's equity node; Calculate A to B apart from the time; Suppose that A is the border router S that at first is routed to AS1 by A to the route of B; Be routed to the border router T of AS2 again by S; Be routed to B by T at last, then A to the high-rise flow optimization distance of B be AS1 to the AS number between the AS2, just what AS S has passed through to the route between the T; And A be the path of this route in AS1 inside to the low layer flow optimization of B distance, also is the hop count of A to S.
Data interaction in above-mentioned steps 3 and the step 4 between flow optimization client and the flow optimization server is connected the TLS transmission through encrypting, with the assurance fail safe.Mutual message format is as shown in Figure 6; Wherein 8 version number indicates the version of current communication protocol; 24 message length indicates the length of this message, and 16 type of message indicates the implication of back message content, and the implication of different type of message back message contents is different.For example when type of message is the flow optimization identification request, comprise the address list of the conversion of asking in the message content of back; When type of message is a flow optimization sign when replying, comprise in the message content that the address after the conversion identifies map listing with flow optimization; When type of message when being flow optimization, comprise source address or flow optimization sign and destination address or flow optimization identification list in the message of back apart from request; When type of message is a flow optimization distance when replying, message content comprise source equity node to the flow optimization of all purposes equity nodes apart from tabulation.Special error message type also should be arranged in addition, when processing makes mistakes, send.
Step 5, flow optimization client receive this equity node to the flow optimization of the stratification of other reciprocity node apart from the time, select nearer reciprocity node to connect according to the distance of distance, the transmission data.
When 5a) selecting nearer reciprocity node, be to connect based on the high level reciprocity node less earlier apart from chosen distance; If high-rise distance is identical or close, then connect based on the low layer reciprocity node less again apart from chosen distance;
5b) when the flow optimization client is reciprocity node Peer, after reciprocity node was received the flow optimization distance, the nearer reciprocity node of chosen distance connected, the transmission data; When the flow optimization client is LIST SERVER Tracker; After Tracker receives the flow optimization distance; The nearer reciprocity node of chosen distance is formed reciprocity node tabulation; The reciprocity node of request list before then this tabulation being returned to, this equity node connect the node transmission data in the tabulation again.
Terminological interpretation:
P2P:Peer-to-Peer, peer-to-peer network
ISP:Internet Service Provider, ISP
Overlay network: overlay network
P2P Cache: peer-to-peer network buffer memory
AS:Autonomous System, autonomous system
NTIS:Network Topology Information Server, the network topological information server
OSPF:Open Shortest Path First, open type shortest path priority protocol
BGP:Border Gateway Protocol, Border Gateway Protocol
Peer: reciprocity node
Tracker: LIST SERVER
RTT:Round-Trip Time, two-way time
IP:Internet Protocol, Internet protocol
Floyd algorithm: Freud's algorithm
Dijkstra's algorithm: Di Jiesitela algorithm
TLS:Transport Layer Security, Transport Layer Security
Claims (5)
1. P2P flow optimization method of supporting the stratification network topology may further comprise the steps:
(1) the network topological information server NTIS in each autonomous system AS, network topology structure a plurality of routers in this AS in this AS of collection and the topological structure of the whole network, the topological structure of the stratification of structure the whole network;
(2) the flow optimization server in each AS is obtained the topological structure of the whole network stratification from the network topological information server NTIS in this AS, and waits the inquiry of flow optimization client;
(3) the flow optimization server of flow optimization client in reciprocity node place AS submitted query requests to, inquires about the flow optimization distance of this peer node to other reciprocity node;
(4) after the flow optimization server is received query requests,, calculate the flow optimization distance of this equity node, and this flow optimization distance is returned to the flow optimization client to the stratification of other reciprocity node according to the topological structure of the whole network stratification;
(5) the flow optimization client receive this equity node to the flow optimization of the stratification of other reciprocity node apart from the time, select nearer reciprocity node to connect according to the distance of distance, the transmission data.
2. the P2P flow optimization method of support stratification network topology according to claim 1; It is characterized in that; Network topology structure the described a plurality of routers in this AS of step (1) in this AS of collection and the network topology structure of the whole network, carry out as follows:
2a) collect the network topology structure in this AS through Routing Protocol in the territory; For Routing Protocol in the territory that AS is divided into several regions, network topological information server NTIS will collect from each regional topology information from the router in each zone, to constitute the network topology structure of whole AS;
2b) pass through the network topology structure that inter-domain routing protocol is collected the whole network; For the inter-domain routing protocol of similar BGP, network topological information server NTIS will obtain the network topology structure of the whole network from the AS border router of this AS.
3. the P2P flow optimization method of support stratification network topology according to claim 1; It is characterized in that the flow optimization distance of the described stratification of step (4) comprises many levels from high to low; With high-rise distance macroscopical distance is described, with low layer apart from description microcosmic distance.
4. the P2P flow optimization method of support stratification network topology according to claim 1; It is characterized in that; The described topological structure according to the whole network stratification of step (4) calculates the flow optimization distance of this equity node to the stratification of other reciprocity node, carries out as follows:
4a) based on the network topology structure on each level, calculate the flow optimization distance on each level respectively, be combined into the flow optimization distance of stratification at last;
4b) flow optimization on calculating certain level apart from the time, if the network topology structure on this level is then tried to achieve this equity node to the flow optimization distance of other reciprocity node on this level through shortest path first with the Link State stored in form;
4c) flow optimization on calculating certain level apart from the time, if the network topology structure on this level is with the path vector stored in form, then through direct this equity node of query path vector tree acquisition to the flow optimization distance of other reciprocity node on this level.
5. based on the P2P flow optimization method of the described support stratification of claim 1 network topology; It is characterized in that; The described distance based on distance of step (5) selects nearer reciprocity node to connect, and is to connect based on the high level reciprocity node less apart from chosen distance earlier; If high-rise distance is identical or close, then connect based on the low layer reciprocity node less again apart from chosen distance.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102918950A CN101969458B (en) | 2010-11-26 | 2010-11-26 | P2P traffic optimization method supportive of hierarchical network topology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102918950A CN101969458B (en) | 2010-11-26 | 2010-11-26 | P2P traffic optimization method supportive of hierarchical network topology |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101969458A CN101969458A (en) | 2011-02-09 |
| CN101969458B true CN101969458B (en) | 2012-12-26 |
Family
ID=43548562
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102918950A Expired - Fee Related CN101969458B (en) | 2010-11-26 | 2010-11-26 | P2P traffic optimization method supportive of hierarchical network topology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101969458B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105580000A (en) * | 2013-09-26 | 2016-05-11 | 慧与发展有限责任合伙企业 | Task distribution in peer to peer networks |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102571433B (en) | 2012-01-11 | 2014-07-30 | 华为技术有限公司 | Method and device for showing network paths |
| CN104158740B (en) * | 2013-05-13 | 2017-11-24 | 华为技术有限公司 | A kind of path management method and controller |
| CN104518965B (en) * | 2013-09-30 | 2018-04-20 | 华为技术有限公司 | A kind of shortest path query method and device |
| CN106411553B (en) * | 2015-08-03 | 2020-01-07 | 中国移动通信集团公司 | Method and device for optimizing service chain path |
| CN112905591B (en) * | 2021-02-04 | 2022-08-26 | 成都信息工程大学 | Data table connection sequence selection method based on machine learning |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360003A (en) * | 2007-07-31 | 2009-02-04 | 中兴通讯股份有限公司 | Detection method and system for inter-node network distance in peer-to-peer network |
| CN101710904A (en) * | 2009-12-21 | 2010-05-19 | 中国科学院计算技术研究所 | P2p flow optimization method and system thereof |
| CN101714942A (en) * | 2009-11-12 | 2010-05-26 | 中国人民解放军国防科学技术大学 | BGP-guided method for discovering real-time autonomous system-level topology |
| CN101753567A (en) * | 2009-12-25 | 2010-06-23 | 中国科学院计算技术研究所 | Resource sharing method for operation business actively participating peer-to-peer network |
-
2010
- 2010-11-26 CN CN2010102918950A patent/CN101969458B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360003A (en) * | 2007-07-31 | 2009-02-04 | 中兴通讯股份有限公司 | Detection method and system for inter-node network distance in peer-to-peer network |
| CN101714942A (en) * | 2009-11-12 | 2010-05-26 | 中国人民解放军国防科学技术大学 | BGP-guided method for discovering real-time autonomous system-level topology |
| CN101710904A (en) * | 2009-12-21 | 2010-05-19 | 中国科学院计算技术研究所 | P2p flow optimization method and system thereof |
| CN101753567A (en) * | 2009-12-25 | 2010-06-23 | 中国科学院计算技术研究所 | Resource sharing method for operation business actively participating peer-to-peer network |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105580000A (en) * | 2013-09-26 | 2016-05-11 | 慧与发展有限责任合伙企业 | Task distribution in peer to peer networks |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101969458A (en) | 2011-02-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114128229B (en) | Method, system and apparatus for service and topology switching protocol | |
| Kim et al. | Performance analysis of in-network caching for content-centric networking | |
| US7379428B2 (en) | Autonomous system topology based auxiliary network for peer-to-peer overlay network | |
| Liu et al. | A multi-level DHT routing framework with aggregation | |
| CN101455030B (en) | Dynamic shared risk node group (srng) membership discovery | |
| EP1188280B1 (en) | On-demand overlay routing for computer-based communication networks | |
| CN102195855B (en) | Business routing method and business network | |
| CN101969458B (en) | P2P traffic optimization method supportive of hierarchical network topology | |
| CN101155134B (en) | Path computation and network topological method, structure and system | |
| CN104022911B (en) | A kind of contents construction management method of pattern of fusion content distributing network | |
| CN104967677B (en) | A kind of document transmission method and device based on NDN cache optimization | |
| Rak et al. | Information-driven network resilience: Research challenges and perspectives | |
| EP2487844B1 (en) | Control unit and method for dynamically controlling the routing within a network | |
| Hail | Iot-ndn: An iot architecture via named data netwoking (ndn) | |
| Alghamdi et al. | A novel fog computing based architecture to improve the performance in content delivery networks | |
| US20110013539A1 (en) | System and method for managing internetwork communications among a plurality of networks | |
| US9667519B2 (en) | Method, device, and system for acquiring cost between nodes | |
| Li et al. | Ant colony based forwarding method for content-centric networking | |
| CN101094168A (en) | Method for discovering unit of route calculation | |
| Anitha et al. | A survey of P2P overlays in various networks | |
| Pasquini et al. | Bloom filters in a Landmark-based Flat Routing | |
| Banerjee et al. | The survey, research challenges, and opportunities in ICN | |
| Alghamdi et al. | Fog-Based CDN Architecture Using ICN Approach for Efficient Large-Scale Content Distribution | |
| Guan et al. | Name-based routing with on-path name lookup in information-centric network | |
| Fotiou et al. | H-Pastry: An adaptive multi-level overlay inter-network |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20121226 Termination date: 20181126 |