CN101938410B - Hierarchical hybrid network system and routing optimization method thereof - Google Patents
Hierarchical hybrid network system and routing optimization method thereof Download PDFInfo
- Publication number
- CN101938410B CN101938410B CN201010221201.6A CN201010221201A CN101938410B CN 101938410 B CN101938410 B CN 101938410B CN 201010221201 A CN201010221201 A CN 201010221201A CN 101938410 B CN101938410 B CN 101938410B
- Authority
- CN
- China
- Prior art keywords
- tiv
- shortcut information
- network
- routing
- unstructured
- 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
- 238000000034 method Methods 0.000 title claims abstract description 25
- 238000005457 optimization Methods 0.000 title claims abstract description 23
- 230000007246 mechanism Effects 0.000 claims description 48
- 230000006855 networking Effects 0.000 claims description 35
- 230000003993 interaction Effects 0.000 claims description 4
- 238000004891 communication Methods 0.000 description 19
- 239000010410 layer Substances 0.000 description 19
- 239000012792 core layer Substances 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000001514 detection method Methods 0.000 description 2
- 230000004888 barrier function Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a hierarchical hybrid network system which is a system combining a hybrid network of unstructured routing based on a structured hierarchical distributed hash table. The invention also discloses a routing optimization method which optimizes routing by combining a hybrid mode of unstructured routing based on a structured hierarchical distributed hash table. By using the system and the method of the invention, the invention can effectively solve the problems of high cross-domain flow and undesirable end-to-end routing performance of the existing P2P network.
Description
Technical Field
The invention relates to an overlapping networking technology in the field of internet, in particular to a layered hybrid networking system and a route optimization method thereof.
Background
With the rapid development of the internet, the traditional business of telecom operators is greatly impacted. The convergence of telecommunication network, broadcasting network and internet is occurring, the technical obstacle of convergence is eliminated, and the basis of convergence is Internet Protocol (IP) network, the current service network of telecommunication operator, i.e. IP Multimedia Subsystem (IMS), is a problem that it is often difficult to quickly respond to new services, so a point-to-point (P2P, Peer to Peer) network is occurring along with the evolution of technology to solve the problem, and as the P2P networking cost is small and convenient for expansion, as a basic distributed computing mode, it has been selected as a basic network architecture by more and more content service providers.
Although the existing P2P network has the above inherent advantages, the existing P2P network also has the following problems: the problem of how to reduce cross-domain traffic is not considered, and the problem that the end-to-end routing performance is not ideal due to the influence of the bottom-layer vastly different network routes on the end-to-end performance is not considered. If the existing structured Distributed Hash Table (DHT) is used as a basis of distributed networking, although the distributed application constructed on the DHT has the advantages of high efficiency, easy expansion and the like, and is widely applied to large-scale distributed systems, such as file sharing, content distribution, streaming media, VoIP and the like, there is no substantial help to solve the problems existing in the existing P2P network, and a scheme is urgently needed at present to thoroughly solve the problems existing in the existing P2P network, such as large cross-domain traffic and unsatisfactory end-to-end routing performance.
Disclosure of Invention
In view of the above, the main objective of the present invention is to provide a layered hybrid networking system and a route optimization method thereof, which can effectively solve the problems of large cross-domain traffic and non-ideal end-to-end routing performance of the existing P2P network.
In order to achieve the purpose, the technical scheme of the invention is realized as follows:
a layered hybrid networking system is a system based on a structured layered distributed hash table and combined with a hybrid networking mode of unstructured routing.
Wherein the layering is: based on the hierarchy of operators as a unit, each operator deploys according to the own network to form a tree-type network architecture.
Wherein the unstructured routing is: under the condition of positioning to a destination based on a distributed hash table, selecting a node as a relay node based on an unstructured routing mode, and realizing routing based on the relay node; the relay node is located between a source location and the destination to which the DHT is located.
The unstructured routing mode is realized through a discovery mechanism of inter-domain violation Triangle Inequality (TIV) shortcut information; the finding mechanism of the TIV shortcut information is as follows: a mechanism to directly obtain TIV shortcut information, and/or a mechanism to indirectly obtain TIV shortcut information.
Wherein, the mechanism for directly acquiring the TIV shortcut information is as follows: an Internet Service Provider (ISP) deploys access sensing equipment on a network outlet, and TIV shortcut information is directly reported to a regional center server through the access sensing equipment, so that a mechanism for discovering the inter-domain TIV shortcut information is realized.
The mechanism for indirectly acquiring the TIV shortcut information comprises the following steps: and through the interaction between the regional central server and the client, the inter-domain TIV shortcut information is randomly detected, and a discovery mechanism of the inter-domain TIV shortcut information is realized.
Wherein the layering further comprises: continuously dividing each layer obtained by layering based on an operator as a unit into a core overlapped network and a region overlapped network; wherein, the core overlay network of each operator is independent and adopts respective address space; the address space of the area overlay network is divided from the address space of the core overlay network and identified by a domain.
A method of route optimization, the method comprising: and carrying out route optimization based on a structured and layered distributed hash table and combining a mixed mode of unstructured routes.
Wherein, the method also comprises: when the layering is realized, the layering is carried out on the basis of an operator as a unit; each operator is deployed according to the own network to form a tree-type network architecture.
Wherein, in case of locating the destination based on the DHT, the method further comprises: when the unstructured routing is realized, selecting a node as a relay node based on an unstructured routing mode, and realizing the routing based on the relay node; the relay node is located between a source location and the destination to which the DHT is located.
The unstructured routing mode is realized through a discovery mechanism of the TIV shortcut information; the finding mechanism of the TIV shortcut information is as follows: a mechanism to directly obtain TIV shortcut information, and/or a mechanism to indirectly obtain TIV shortcut information.
Wherein, the mechanism for directly acquiring the TIV shortcut information is as follows: and the ISP deploys access sensing equipment on a network outlet, and directly reports the TIV shortcut information to the regional center server through the access sensing equipment, so that a mechanism for discovering the inter-domain TIV shortcut information is realized.
The mechanism for indirectly acquiring the TIV shortcut information comprises the following steps: and through the interaction between the regional central server and the client, the inter-domain TIV shortcut information is randomly detected, and a discovery mechanism of the inter-domain TIV shortcut information is realized.
The system is a system based on a structured and layered distributed hash table and combined with a mixed mode of unstructured routing for networking.
The invention can effectively solve the problems of large cross-domain flow and non-ideal end-to-end routing performance of the existing P2P network.
Drawings
FIG. 1 is a schematic diagram of a global networking system in an example of the system of the present invention;
FIG. 2 is a schematic diagram of the networking of the TIV of the present invention;
FIG. 3 is a flow chart illustrating an implementation of an embodiment of the method of the present invention.
Detailed Description
The basic idea of the invention is: a system based on a structured and layered distributed hash table and combined with a mixed mode of unstructured routing for networking; and during route optimization, route optimization is carried out based on a structured and layered distributed hash table and by combining a mixed mode of unstructured routes.
The following describes the embodiments in further detail with reference to the accompanying drawings.
The hybrid networking and route optimization scheme is based on the Chord's layered DHT overlapping networking technology and adopts an unstructured way to perform route optimization. The hierarchical DHT is structured, and the routing in an unstructured mode mainly adopts a discovery mechanism of the TIV shortcut information. The invention can better solve the problems of large cross-domain flow and non-ideal end-to-end performance of the existing P2P network by combining the structured hierarchical DHT with the unstructured routing mode hybrid networking model. Wherein, the Chord is a DHT model, and the detailed description thereof is shown in the literature: stoica, r.morris, d.liben-Nowell, d.r.karger, m.f.kaashoek, f.dabek, h.balakrishnan.chord: available peer-to-peer lookup protocols for Internet applications, IEEE/ACCT Transactions On Networking (TON), 2003, 11: 17-32.
The invention relates to a layered hybrid networking system and a route optimization method thereof, which mainly comprise the following two aspects:
firstly, the method comprises the following steps: in order to reduce cross-domain flow, the invention adopts a layered structure. The service network is layered by taking operators as a unit, and each operator is deployed according to the own network to form a tree-shaped network model.
II, secondly: the DHT is used as a basic network, the destination is positioned by the DHT network, once the destination is positioned, some nodes are selected as relay nodes in an unstructured mode, and the relay nodes between a source place and the positioned destination are used for routing so as to improve the end-to-end service quality.
Specifically, the unstructured method is as follows: the following two inter-domain TIV shortcut information discovery mechanisms are introduced. The first mechanism is: the mechanism for directly acquiring the TIV shortcut information is that an Internet Service Provider (ISP, Internet Service Provider) deploys an access sensing device at a network outlet, and directly reports the TIV shortcut information to a regional center server of a telecom operator through the access sensing device, so that the inter-domain TIV shortcut information discovery mechanism is realized. The second mechanism is: and a mechanism for indirectly acquiring the TIV shortcut information, namely a mechanism for discovering the TIV shortcut information between domains is realized by randomly detecting the TIV shortcut information between domains. And distributing the TIV shortcut information in the network by adopting the Gossip protocol, wherein the TIV shortcut information is not issued to a terminal client, and the Gossip protocol is only spread on networking nodes of an operator and an ISP (Internet service provider). Wherein, Gossip is a protocol of P2P, and its detailed description is shown in the document: ganesh, A.M.Kermarrec, L.Massoulie, Peer-to-Peer Membership Management for Gossip-Based Protocols, IEEETRANSACTIONS ON COMPUTERS, 2003139-.
Here, the above-mentioned TIV name is explained: the TIV refers to the Triangle InequalVision, i.e., violating the Triangle Inequality. As shown in fig. 2, in a normal case, the overhead | ab | of two hosts a and b in the network for direct communication is smaller than the overhead | ac | + | bc | relayed by the 3 rd node c. However, the topology of the network is very different, and there are many cases where | ac | + | bc | < | ab |, which is called the TIV phenomenon. The invention utilizes the existence of the TIV phenomenon to improve the end-to-end routing performance in the service process in the DHT network. In general, in the use of DHT networks, a DHT routing algorithm is used to locate a destination node of communication, and then end-to-end communication is performed directly. After the DHT routing algorithm is used for positioning, the invention searches for the TIV relay between any two nodes in the DHT network by using a discovery mechanism of the TIV shortcut information. In end-to-end performance optimization, the present invention is based primarily on the following assumptions: firstly, in an operator, the probability of occurrence of TIV in direct communication between nodes is small; TIV occurs mainly in cross-operator communication, cross-domain communication. In addition, within the regional centre-layer overlay network, there is less probability of violating TIV. Therefore, based on the above assumptions, the present invention mainly finds the TIV shortcut information between regional center layers, and then uses the TIV between these regions to perform route optimization on the end-to-end path.
Here, for a layered hybrid networking system, in order to avoid the problem of large cross-domain traffic in the prior art, the present invention adopts the layered hybrid networking system to limit a data flow as much as possible within a domain, so that a logical structure of networking corresponds to actual network deployment, and a discovery mechanism of TIV shortcut information is used to improve end-to-end communication performance. The service network is layered by taking operators as a unit, and each operator is deployed according to the own network to form a tree-shaped network model. Area overlay networks are typically built in provincial regions, while the core overlay network layer corresponds to a larger area.
Each operator deploys a core overlay network, and the core overlay networks of all the operators use the address space of the operator respectively, so that the addressing of the nodes on the core overlay networks is uniform. The address space of the area overlay network is delimited from the core overlay network, so a node locating an area overlay network needs to be identified using its domain. The common client is managed by the regional center server, and the identification of the common client needs the corresponding regional center server.
For the route optimization method of the hierarchical hybrid networking system, the core overlay network and the area overlay network both adopt the P2P technology networking, but the network does not simply adopt the structured DHT or the unstructured networking, but adopts a scheme of mixing the structured and the unstructured networking. For each node, it can be located using the DHT algorithm at the same time, or an unstructured algorithm can be used to establish sessions between nodes. The method comprises the following steps of (1) positioning by adopting a DHT algorithm during searching to search a destination; and adopting an unstructured algorithm when initiating the service session to realize the relay session. That is, the DHT algorithm is mainly used to locate the destination node, and the improvement of the end-to-end communication quality requires a discovery mechanism by means of an unstructured algorithm, i.e., TIV shortcut information. The topology of the network is very different, and a large amount of TIV shortcut information exists, so that the routing optimization can be realized in the service process in the DHT network by means of the TIV shortcut information. In the use of the DHT network, the first step can be that the destination node of communication is positioned by utilizing a DHT routing algorithm; then, the communication is directly carried out, or the end-to-end communication is carried out after the TIV shortcut information is optimized.
Comparing the present invention with the prior art, it can be seen that: compared with the prior art, the invention greatly reduces the pressure of flow transmission on a backbone network due to the reduction of cross-domain flow, and also provides a discovery mechanism of the TIV shortcut information for improving the end-to-end performance, thereby providing important basic service support for various overlapped network applications on the Internet.
The invention is illustrated below.
Example of the system:
this example is a schematic diagram of the global networking of the system of the present invention, as shown in fig. 1. The core overlay network is a top-level service network of an operator, and each operator only has one core overlay network. The core overlay networks between multiple operators are located in different address spaces. In fig. 1, the content provider may be configured in the top core overlay network or in the area overlay network. The interface between the content provider and the service layer is a tracker service interface, which provides path optimization information to the content provider, but does not directly expose the networking of the service layer to the content provider. Wherein, the detailed description of the tracker is detailed in the following documents: cohen, Bram (2001-07-02). "BitTorrent-a new P2P app". Yahoo eGroups.http://finance.groups.yahoo.com/group/decentralization/message/3160。Retrieved2007-04-15。
The deployment of the area overlay network is region-adaptive. The area overlay network is composed of an area center server, a common server and proxy server nodes of a cross-area overlay network and a core overlay network.
The regional centre server faces the end-user and its main task is to manage the end-user and provide the end-user with path optimization information. The regional centre server is the most important component for implementing operational, manageable functionality.
The proxy server node is located at the exit of the region and spans the upper and lower overlapping networks. Communication between an upper layer and a lower layer mainly depends on relay of the proxy service node, the area overlay network and the core overlay network respectively adopt a chord-based DHT as a basic networking mode, and each layer of local network adopts different ID management schemes according to a dividing strategy.
Each operator deploys a core overlay network, and the core overlay networks of the operators can use different address spaces. In the present invention, the address space of the area overlay network is delimited from the core overlay network, so a node locating an area overlay network needs to be identified using its domain. The common client is managed by the regional center server, and the identification of the common client needs the corresponding regional center server.
Let KID identify core layer ID, DID denote regional center layer ID, and CID denote the ID of common client. Therefore, in the service network, the node representation method is as follows:
core layer server: < KID >
The regional layer server: < KID, DID >
A client: < KID, DID, CID >
For example, for client a in fig. 2, its identification is < K1, D1, a >. Here, it should be noted that: since K1 is a proxy node, it has both the KID of the core layer and the DID of the area overlay network.
Example of the method:
this example is a schematic flow chart of the implementation of the method of the present invention, as shown in fig. 3, and includes the following steps:
and step 101, positioning to a destination based on the DHT.
And 102, selecting a node as a relay node through a discovery mechanism of the TIV shortcut information.
And 103, optimizing the route between the source location and the destination located by the DHT based on the selected relay node.
An example of two sets of routing tables used for route optimization is illustrated below:
although a pure DHT algorithm can accurately locate a node, the underlying network is complex in structure, and the quality of service of end-to-end direct communication cannot be guaranteed. In this case, combining unstructured hybrid networking on a structured basis can naturally accommodate the way in which communications are relayed. In the hybrid networking mode, a typical service process is as follows: firstly, a destination node needing communication is located by adopting a chord-based DHT network, and then the communication can be carried out directly or in an unstructured optimized relay mode.
Because a hybrid networking mode is adopted, nodes of one service layer need to maintain two sets of routing tables: one set is a DHT network routing table and the other set is an unstructured routing table. Meanwhile, in order to reduce the overhead of the service layer, the service layer node is only responsible for providing the path optimization information, and the session relay node is selected from a common client. Therefore, the general client must have a built-in session relay function in addition to communication with the regional center server.
Two examples of mechanisms for discovering TIV shortcut information used in route optimization are illustrated below:
example 1: for the mechanism of finding the TIV shortcut information, one solution is direct acquisition.
There are typically some paths between operators, which are typically followed by Border Gateway Protocol (BGP) gateways. These inter-operator paths may not be very wide due to non-technical barriers, and inter-operator communications are limited by these bandwidth limitations. Reflecting the end-to-end session quality, the performance may not meet the requirements of the upper layer application. On the other hand, for a secondary ISP such as the great wall broadband, the chinese telecom, china unicom lines are rented at the same time. Thus, in practice, TIV shortcut information exists in large quantities for upper layer applications. The networking model shown in fig. 1 requires the ISP to deploy an access aware device at the network egress that advertises path information to the regional centre server of the telecommunications operator. In fig. 1, the ISP has leased the lines of two operators simultaneously, with access aware equipment deployed at the network egress. The access awareness device may announce the presence of TIV shortcut information across operators to regional central servers of two operators, respectively.
Example 2: for the mechanism of finding the TIV shortcut information, another scheme is indirect acquisition.
In some cases, such as where the ISP has not previously deployed access aware devices; and more generally, there is no such direct information announcement. At this point, some active probing is required.
Periodically, the regional center layer server can interact with the client to acquire neighbor information of the client. After analyzing the neighbor information, if the node is found to be physically adjacent to a cross-domain node, the regional center layer server actively initiates a cross-domain detection by taking the node as a relay, and then compares the cross-domain detection with a direct cross-domain communication distance to obtain the TIV shortcut information.
The present invention may further comprise: and (4) issuing and acquiring the object. The invention not only considers only a simple overlapping networking scheme, but also supports the release and the acquisition of the content. Under the hybrid networking scheme of the present invention, the distribution and retrieval of information is somewhat more complex than a pure P2P network.
An example of object publishing and fetching is as follows:
for example, in fig. 1, a client a publishes an object O, which includes the following:
1. it first contacts with regional center server D1 to publish in the overlap area network, and the object publishing process in the overlap area network adopts DHT algorithm.
2. D1 publishes the object in the area overlay network according to the key value of the object, assuming that the object is stored on D2, the publishing information is < O, < K1, D1, a > >.
3. In addition to publishing the object inside the area overlay network, the object needs to be published to the core overlay network. D1 also needs to contact the overlay's proxy node K1, requesting K1 to publish on the overlay.
4. K1 publishes object O on the operator's internal core overlay, i.e., < O, < K1, D1, a > > on node K2.
5. Since K2 may not be the root node of O, K1 also needs to be published on the root node of O. Let the root node of O be K3, located in the core overlay network of operator 2. K3 stores information < O, < K1, D1, a >.
Here, it should be noted that: the structured routing tables of the core layer nodes point to the nodes of the operator, and then each node points to KID neighbor nodes of other operators at the same time.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention.
Claims (3)
1. A layered hybrid networking system is characterized in that the system is a structured layered distributed hash table based system and is networked in a hybrid mode by combining unstructured routing; wherein,
the layering is as follows: layering is carried out based on operators as units, and each operator forms a tree-shaped network architecture according to own network deployment; continuously dividing each layer obtained by layering based on an operator as a unit into a core overlapped network and a region overlapped network;
the unstructured routing is: under the condition of positioning to a destination based on a distributed hash table, selecting a node as a relay node based on an unstructured routing mode, and realizing routing based on the relay node; the relay node is located between a source location and the destination to which the DHT is located; wherein,
the unstructured routing mode is realized through a mechanism for discovering inter-domain violation triangle inequality TIV shortcut information; the finding mechanism of the TIV shortcut information is as follows: a mechanism for directly acquiring the TIV shortcut information and/or a mechanism for indirectly acquiring the TIV shortcut information;
the mechanism for directly acquiring the TIV shortcut information comprises the following steps: an Internet Service Provider (ISP) deploys access sensing equipment on a network outlet, and TIV shortcut information is directly reported to a regional center server through the access sensing equipment, so that a mechanism for discovering inter-domain TIV shortcut information is realized;
the mechanism for indirectly acquiring the TIV shortcut information comprises the following steps: and through the interaction between the regional central server and the client, the inter-domain TIV shortcut information is randomly detected, and a discovery mechanism of the inter-domain TIV shortcut information is realized.
2. The system of claim 1, wherein each operator's core overlay network is independent and uses its own address space; the address space of the area overlay network is divided from the address space of the core overlay network and identified by a domain.
3. A method for route optimization, the method comprising: carrying out route optimization based on a structured and layered distributed hash table and combining a mixed mode of unstructured routes; wherein,
the layering is as follows: layering is carried out based on operators as units, and each operator forms a tree-shaped network architecture according to own network deployment; continuously dividing each layer obtained by layering based on an operator as a unit into a core overlapped network and a region overlapped network;
the unstructured routing is: under the condition of positioning to a destination based on a distributed hash table, selecting a node as a relay node based on an unstructured routing mode, and realizing routing based on the relay node; the relay node is located between a source location and the destination to which the DHT is located; wherein,
the unstructured routing mode is realized through a mechanism for discovering inter-domain violation triangle inequality TIV shortcut information; the finding mechanism of the TIV shortcut information is as follows: a mechanism for directly acquiring the TIV shortcut information and/or a mechanism for indirectly acquiring the TIV shortcut information;
the mechanism for directly acquiring the TIV shortcut information comprises the following steps: an Internet Service Provider (ISP) deploys access sensing equipment on a network outlet, and TIV shortcut information is directly reported to a regional center server through the access sensing equipment, so that a mechanism for discovering inter-domain TIV shortcut information is realized;
the mechanism for indirectly acquiring the TIV shortcut information comprises the following steps: and through the interaction between the regional central server and the client, the inter-domain TIV shortcut information is randomly detected, and a discovery mechanism of the inter-domain TIV shortcut information is realized.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010221201.6A CN101938410B (en) | 2010-06-29 | 2010-06-29 | Hierarchical hybrid network system and routing optimization method thereof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010221201.6A CN101938410B (en) | 2010-06-29 | 2010-06-29 | Hierarchical hybrid network system and routing optimization method thereof |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101938410A CN101938410A (en) | 2011-01-05 |
| CN101938410B true CN101938410B (en) | 2014-12-10 |
Family
ID=43391552
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010221201.6A Expired - Fee Related CN101938410B (en) | 2010-06-29 | 2010-06-29 | Hierarchical hybrid network system and routing optimization method thereof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101938410B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108270557B (en) * | 2016-12-30 | 2021-02-19 | 科大国盾量子技术股份有限公司 | Backbone network system based on quantum communication and relay method thereof |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101252518A (en) * | 2008-03-18 | 2008-08-27 | 腾讯科技（深圳）有限公司 | System and method for choosing transfer node in peer-to-peer network |
| CN101483574A (en) * | 2008-01-08 | 2009-07-15 | 华为技术有限公司 | Network system, method and network appliance for providing service by the network system |
| CN101510897A (en) * | 2009-03-30 | 2009-08-19 | 北京邮电大学 | Addressing system and method for layering host identification based on superposition type DHT |
| CN101645925A (en) * | 2009-05-15 | 2010-02-10 | 中国科学院声学研究所 | Selection method of neighbor nodes related to physical topology in P2P system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102299841A (en) * | 2010-06-25 | 2011-12-28 | 中兴通讯股份有限公司 | Service-based P2P (Peer-to-Peer) path determination method and device |
-
2010
- 2010-06-29 CN CN201010221201.6A patent/CN101938410B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101483574A (en) * | 2008-01-08 | 2009-07-15 | 华为技术有限公司 | Network system, method and network appliance for providing service by the network system |
| CN101252518A (en) * | 2008-03-18 | 2008-08-27 | 腾讯科技（深圳）有限公司 | System and method for choosing transfer node in peer-to-peer network |
| CN101510897A (en) * | 2009-03-30 | 2009-08-19 | 北京邮电大学 | Addressing system and method for layering host identification based on superposition type DHT |
| CN101645925A (en) * | 2009-05-15 | 2010-02-10 | 中国科学院声学研究所 | Selection method of neighbor nodes related to physical topology in P2P system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101938410A (en) | 2011-01-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7978631B1 (en) | Method and apparatus for encoding and mapping of virtual addresses for clusters | |
| Xylomenos et al. | A survey of information-centric networking research | |
| Liu et al. | A multi-level DHT routing framework with aggregation | |
| Chai et al. | Curling: Content-ubiquitous resolution and delivery infrastructure for next-generation services | |
| US8504718B2 (en) | System and method for a context layer switch | |
| CN1992666A (en) | Virtual private network publish-subscribe multicast service | |
| US20100281163A1 (en) | Method and apparatus for maintaining routing information | |
| CN101420337A (en) | Method, device and indexing server for resource positioning | |
| Pavlou et al. | Internet-scale content mediation in information-centric networks | |
| Liu et al. | A comparative study of name resolution and routing mechanisms in information-centric networks | |
| Almeida et al. | Information Centric Networks–Design Issues, Principles and Approaches | |
| Fotiou et al. | H-pastry: An inter-domain topology aware overlay for the support of name-resolution services in the future internet | |
| CN101969458B (en) | P2P traffic optimization method supportive of hierarchical network topology | |
| Wu et al. | PeerCDN: A novel P2P network assisted streaming content delivery network scheme | |
| Calvert et al. | Separating routing and forwarding: A clean-slate network layer design | |
| CN101938410B (en) | Hierarchical hybrid network system and routing optimization method thereof | |
| D'Ambrosio et al. | Providing data dissemination services in the future internet | |
| Hasan et al. | Efficient caching for delivery of multimedia information with low latency in ICN | |
| Hassan et al. | A taxonomy of information-centric networking architectures based on data routing and name resolution approaches | |
| Poryev et al. | CARMA based MST approximation for multicast provision in P2P networks | |
| Alduán et al. | Architectures for future media Internet | |
| Chai et al. | A distributed interdomain control system for information-centric content delivery | |
| Cao et al. | Efficient message delivery models for XML-based publish/subscribe systems | |
| Fotiou et al. | H-Pastry: An adaptive multi-level overlay inter-network | |
| Buford | Management of peer-to-peer overlays |
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: 20141210 Termination date: 20170629 |