CN101394339A - Method, system and apparatus for routing implementation in peer-to-peer network - Google Patents
Method, system and apparatus for routing implementation in peer-to-peer network Download PDFInfo
- Publication number
- CN101394339A CN101394339A CNA2007101541457A CN200710154145A CN101394339A CN 101394339 A CN101394339 A CN 101394339A CN A2007101541457 A CNA2007101541457 A CN A2007101541457A CN 200710154145 A CN200710154145 A CN 200710154145A CN 101394339 A CN101394339 A CN 101394339A
- Authority
- CN
- China
- Prior art keywords
- node
- virtual circuit
- bandwidth
- jumping
- message
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method, a system and a device for realizing routing in a peer to peer (P2P) network. The method comprises the steps of establishing virtual circuits from each node in the P2P network to another node by using recursive algorithm, and storing virtual circuit information including bandwidth and hop number. After receiving a service transmission request, a source node inquiries the virtual circuits which meet the service transmission bandwidth requirement and can reach a destination node according to the stored virtual circuit information and sends the request to the direct-connect node of the node, and the direct-connect node and the subsequent direct-connect node inquiry the virtual circuits which meet the service transmission bandwidth requirement and can reach the destination node until reaching the last node but one of the destination node; and the source node establishes the transmission service routing according to the virtual circuits obtained by inquiring. The method, system and device can realize routing in the P2P network on the premise of ensuring to provide stable quality of service (QoS).
Description
Technical field
The present invention relates in network, set up the route technology of message transmission, particularly a kind of method, system and device of in equity (p2p, peer to peer) network, realizing route.
Background technology
Along with the development of p2p technology, after the p2p network has experienced the first generation and the second generation, developed into well behaved third generation p2p network.Therefore, the P2P network be expected to NGN common service together in follow-on telecommunications network.
In the p2p network, adopt the p2p technology, the p2p technology is a kind of being used between the different user devices, technology without direct interaction data of trunking or service, the p2p technology has been broken the customer end/server mode of legacy network, each node status in the p2p network all is reciprocity, possesses the client and server double grading, can be simultaneously as data or/and service providers and user.
Route how to set up transmission data or service in the p2p network becomes the key issue of development p2p network.At present, there are two kinds of methods to be respectively applied in the p2p network and set up route, below be elaborated.
First kind of method of setting up route in the p2p network introduced eucaryotic cell structure in network, each intranodal at cell is provided with in the cell and intercellular routing table, be used for maintenance, node adding, cell separation and fusion to setting up route, routing table, the operation of these five kinds of programs and realization, changing fast point-to-point environment and not having to realize under the situation of central server the tissue and the cooperation route of extendible participation node, for realization p2p network lays the first stone.
This method at first is provided with route, and process is: do not give binary digital nodes sign (NodeId) of one 160 to intrasystem each node of paramecium with having conflict and equally distributed hash method, forming the first place is 0, and the position, end is 2
160-1 and end to end NodeId space; Also give one 160 numerical key sign (key) with said method for objects stored in the node, forming the first place is 0, and the position, end is 2
160-1 end to end key space; The key space segmentation of NodeId being become some does not promptly comprise and not overlapping mutually again, the cell of Xian Jieing each other, each cell identifies (left margin and right margin all are numerals) by two tuples (left margin, right margin), and the union on cell boundary covers whole NodeId space.Like this, for each node two cover routing tables are just arranged, a cover is the cell internal routing table of node, comprises the NodeId and the network address of all nodes in the cell of place; Another set of is the iuntercellular routing table of node, is made up of several rows, and every row comprises following information: the cell that arrive apart from the cell centre distance at trip node place, for the trip node its NodeId, the network address and cell boundary, place.Wherein, above-mentioned distance is chosen according to following standard: " radius of the node place cell that sets out=| right margin-left margin |/2 ", as the unit step-length, once choose following respectively: L with " R=(radius+1 of the node place cell that sets out) "
0=R * 2
0, L
1=R * 2
1, L
2=R * 2
2, L
i=R * 2
iBe less than or equal to half of digital space length, promptly 2
160/ 2.
Just can carry out transfer of data then according to the route that is provided with.
This method realizes simple, and the purpose of route is to find in comprising given Key cell and the given Key node of approaching and the most close cell left margin.If given key is in this cell then use the cell internal routing table to carry out route, otherwise route requests is sent at iuntercellular routing table mid-range objectives recently not above the node in the cell of target, certain circle, the borderland distance objective that is cell is nearest, carries out the iuntercellular route by this node again.
The technological core of this patent is typical third generation p2p technology, has resource lookup function efficiently, but the shortcoming that has the following aspects: first aspect, this patent is just located resource, promptly just determine the position and the address of target resource, do not set up a paths and be connected at source node and destination node; Second aspect, this patent is not controlled the bandwidth on the link, do not possess distribution and recovery function to bandwidth resources, whole network is in no-console condition, even the result who causes has determined the position and the address of certain resource, but may not have between source node and the destination node to connect or the bandwidth of link not enough, two nodes can't transport services or can't be guaranteed professional service quality.
Second kind in the p2p network, set up route core concept be: designed a kind of method for routing that is implemented in the pub/sub system on the structuring p2p network, this system comprises p2p layer, pub/sub layer and application layer, contains the filtercondition table in the p2p layer; The pub/sub layer is based upon on the p2p layer, and the subscription and the notification service of incident is provided to application layer.
This method possesses and comprises:
At first, all nodes being encoded, is the subspace of different levels according to the prefix of coding with described node division, for each node, selects the node that converges of a message that is used for transmitting these other nodes of subspace in each subspace;
Secondly, based on described subspace,, and write down each subspace and converge node accordingly for each node is set up corresponding route table items;
Once more,, set up corresponding filtercondition table, write down the defined subscription condition in each subspace for each node based on described subspace;
At last, when node messages is transmitted, at first, converge this message of node processing with the described node that converges of this forwards to each target subspace, then according to described routing table and the filtercondition table that converges node, this forwards is converged respective nodes in the subspace, node place to this.
This method integrates with p2p network ground Routing Protocol itself naturally, and the pub/sub system on utilization structure and the structuring p2p network, the p2p network is divided into p2p layer, pub/sub layer and three levels of application layer, as shown in Figure 1, wherein, the p2p layer is used for each event agent is formed the p2p network of a self-organizing, and the pub/sub layer is responsible for subscribing to and the forwarding of incident between each event agent, and application layer is responsible for issue and reception incident.The Routing Protocol of Pub/sub system is the Routing Protocol of pub/sub layer, and it is based upon on the p2p layer Routing Protocol.
This method has also been stipulated dynamically to add fashionablely when node, at first carries out the initialization of p2p layer, to make up corresponding routing table, carries out the initialization of pub/sub layer then, to make up the filtercondition table; When a node failure, the forwards that then will be forwarded to this failure node extremely is in other node places of same subspace with this failure node.
This method adopts based on the method for routing between the code area, can be comparatively naturally integrates with the Routing Protocol of p2p network itself, and utilizes the fault tolerant mechanism of p2p network routing protocol to improve the reliability of event transmission.As long as can reach in the p2p network between the publisher of incident and the subscriber, then subscriber one receives ordered incident surely, and only collects once.This method also has higher router efficiency, can avoid unnecessary messages to transmit.For the propagation of incident, this method detects in the targeted subnet whether the interested subscriber of pair present event is arranged, and only sends to the interested subscriber of present event.
In the method, the p2p routing algorithm of use is the routing algorithm of existing ripe Pastry network.The routing algorithm of Pastry network adopts the Routing Protocol based on key assignments, and each node all has a coding, links to each other by oriented limit between the node, and be responsible between certain code area on each output limit of node.For each node, each exports the routing table that limit and its code area of being responsible for have constituted this node.In the Pastry network, the coding of all nodes constitutes the address space of a linearity, is divided into the subspace of different levels according to the prefix of coding.The basic principle of the routing table of Pastry network is: for each subspace, this node all will be looked for one " representative " therein, be recorded in the routing table, all will be dealt into the message in this subspace in the future, all passing through this " representative " transmits, as shown in Figure 2, be the route entry schematic diagram of node 213 in whole address space, wherein each curve arrow is represented a route entry.
The routing algorithm of this method only only limits on the application layer, its core concept is the subscription condition at allocation of space in the network and node, the allocated bandwidth in the node communication routine in the p2p network is not done description, it only is the location of resource that this method has the algorithm of artis route, does not accomplish to satisfy in the Control Network route request of communication requirement.If use the multi-service service to the service quality high request in the p2p network after, this method can not guarantee the stable bandwidth demand of each business well, thereby can't guarantee in the p2p network service quality to business demand.
Summary of the invention
The embodiment of the invention provides a kind of method that realizes route in the p2p network, and this method provides under the prerequisite of stable service quality for business in assurance, realizes being used for the route of transport service in the p2p network.
The embodiment of the invention also provides a kind of device of realizing route in the p2p network, and this device provides under the prerequisite of stable service quality for business in assurance, realizes being used for the route of transport service in the p2p network.
The embodiment of the invention also provides a kind of system that realizes route in the p2p network, and this system provides under the prerequisite of stable service quality for business in assurance, realizes being used for the route of transport service in the p2p network.
According to above-mentioned purpose, the technical scheme of the embodiment of the invention is achieved in that
A kind of method that realizes route in peer-to-peer network, each node in the peer-to-peer network adopt recurrence to set up the virtual circuit of algorithm foundation from own to other nodes, and storage comprises the virtual circuit message of bandwidth and jumping figure, and this method also comprises:
After source node receives professional transmission request, virtual circuit message inquiry according to storage meets the virtual circuit that service transmission bandwidth required and can arrive destination node, this request is sent to the direct-link node of this node, meet the virtual circuit that service transmission bandwidth required and can arrive destination node by this direct-link node and follow-up direct-link node according to the virtual circuit message inquiry of self storing, up to the penult node that can arrive destination node;
Described a plurality of virtual circuits that source node obtains according to inquiry are set up the route of transport service.
A kind of system that in peer-to-peer network, realizes route, this system comprises a plurality of nodes, wherein,
Each node, be used to adopt recurrence to set up the virtual circuit that algorithm is established to other nodes, and storage comprises this virtual circuit message of bandwidth and jumping figure, when transport service, according to the virtual circuit message of self storage respectively inquiry character should service bandwidth requires and can arrive the virtual circuit of destination node, obtain a plurality of virtual circuits, set up by the route of source node to the transport service of destination node according to described a plurality of virtual circuits.
A kind of device of in peer-to-peer network, realizing route, this device comprises computing module, memory module and processing module, wherein,
Computing module is used to adopt recursive algorithm to be established to the virtual circuit of other nodes;
Memory module is used to store the virtual circuit message that comprises bandwidth and jumping figure of the virtual circuit of setting up;
Processing module, the transmission that is used to manage business, the meeting this professional bandwidth requirement and can arrive the virtual circuit of destination node of inquiry memory module storage.
From such scheme as can be seen, the embodiment of the invention is set up in the same area that satisfies bandwidth requirement between any two ordinary nodes or the virtual circuit between any two super nodes between the territory in the mode of equity, after service request arrives, bandwidth demand according to business, between source node and purpose, seeks and set up one by the virtual circuit that is provided with and meet the route that service bandwidth requires, guarantee the professional service quality of transmitting.Therefore, the method, system and device that the embodiment of the invention provides provide under the prerequisite of stable service quality for business in assurance, realize being used for the route of transport service in the p2p network.
Description of drawings
Fig. 1 is the p2p network hierarchical structure schematic diagram of art methods two;
Fig. 2 is the route entry schematic diagram in the whole address space of node 213 in the p2p network of art methods two;
Fig. 3 is the structural representation of embodiment of the invention p2p network;
Fig. 4 is an embodiment of the invention virtual circuit structural representation;
Fig. 5 is the embodiment of the invention realizes route in the p2p network a method flow diagram;
Fig. 6 is the embodiment of the invention realizes route in the p2p network a system schematic;
Fig. 7 is the embodiment of the invention realizes route in the p2p network a device schematic diagram;
Fig. 8 adopts the method flow diagram of virtual circuit transport service for the embodiment of the invention.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the embodiment of the invention is described in further detail below in conjunction with accompanying drawing.
The embodiment of the invention is set up in the same area that satisfies bandwidth requirement between any two ordinary nodes or the virtual circuit between any two super nodes between the territory in the mode of equity, after service request arrives, bandwidth demand according to business, between source node and purpose, seeks and set up one by the virtual circuit that is provided with and meet the route that service bandwidth requires, guarantee the professional service quality of transmitting.
In the p2p of present embodiment network, adopt the thought of dividing the territory, whole network is divided into a plurality of more small-scale territories, the node in each territory is divided into ordinary node (GN, General Node) and super node (SN, Super Node).Allocation rule can preestablish, and wherein, GN is more weak router or the server of some functions in institute's dividing domain, is responsible for the route of territory internal information; SN is router or a server powerful in institute's dividing domain, the control of network in the route of information and the territory between responsible territory.Concerning all GN in a territory, be reciprocity fully; Equally, all SN concerning between the territory, also be reciprocity.This network configuration has embodied the thought of p2p technology, and as shown in Figure 3: this p2p network is divided into three territories, territory 1, territory 2 and territory 3, solid circles (A in each territory, SN1, SN3, B, SN2) expression SN, empty circles is represented GN, and a1 is the source user terminal node, and b1 is a purpose user terminal node.
In the present embodiment, the notion of virtual circuit has been proposed, promptly to be established to the virtual circuit of other nodes for the node in the p2p network respectively, and virtual circuit message stored, wherein, virtual circuit message comprises source node sign-direct-link node sign-destination node sign, the bandwidth that the jumping figure of virtual circuit and virtual circuit are supported.
Virtual circuit is meant the logical links from the source node to the destination node, its direct-link node and destination node three by source node, source node determines, the direct-link node sign of employing source node sign, source node and destination node identify indicates, and this virtual circuit is stored on the source node corresponding to the jumping figure of this virtual circuit and the bandwidth of virtual circuit support.For example, the sign of each node all adopts the binary number representation of 32 bits, and then a virtual circuit need be by the binary number representation of 96 bits; Article one, source node is R1 on the virtual circuit, and direct-link node is that R2 and destination node are R3, then this virtual circuit can be recited as R1-R2-R3.
For a virtual circuit, comprise two attributes of jumping figure and bandwidth, wherein, jumping figure be this virtual circuit the interstitial content of process, bandwidth is the minimum value of the available bandwidth of all physical links on this virtual circuit.
In embodiments of the present invention, for a virtual circuit on the source node, source node pairing all nodes of this virtual circuit that do not know for sure, source node only knows that next-hop node is an one direct-link node, for other nodes between from the source node to the destination node, then determine to the virtual circuit of destination node by this direct-link node.If this direct-link node has many to the virtual circuit of destination node, a direct-link node that then adopts the bandwidth value maximum to the physical link of direct-link node, constitutes the route that source node arrives the final transmission data of destination node to the virtual circuit of destination node and source node.
Node has the d bar at most to the virtual circuit of another node, and d is a natural number, in the embodiment of the invention, d is called the number of degrees of node, promptly with the direct-connected node number of this node.
In embodiments of the present invention, virtual circuit is divided in the territory virtual circuit between virtual circuit and territory, and the principle of virtual circuit is identical in setting up virtual circuit between the territory and setting up the territory.
Fig. 4 is an embodiment of the invention virtual circuit structural representation, as shown in the figure, connects by physical link between A node and the B node, and the B node is connected by physical link with the C node, thinks that logically A node and C node have a virtual circuit.When the C node with after the D node is connected by physical link, can think that A node and D node have a virtual circuit, the A node need not be known the details of all physical links in the virtual circuit, promptly need not know the existence of C node, directly utilize virtual circuit A node-b node-D node and D node to set up route and get final product (virtual circuit of B node-C node-D node is determined by the B node).
Fig. 5 is the embodiment of the invention realizes route in the p2p network a method flow diagram, and its concrete steps are:
Wherein, the route that SN is used between the territory is set up, GN be used for same territory in SN or other GN set up route in the territory.
In this step, virtual circuit determines that by this node identification, direct-link node sign and destination node sign virtual circuit message comprises jumping figure and bandwidth, also can include only bandwidth.
In embodiments of the present invention, source node can trigger direct-link node by the transport service request, or by direct-link node by transport service request triggering following direct-link node.
In embodiments of the present invention, in fact node is exactly the router in the p2p network, is used to professional transmission that route is provided.
Fig. 6 is the embodiment of the invention realizes route in the p2p network a system schematic, and wherein, this system comprises at least one node, wherein:
Each node, be used to adopt recurrence to set up the virtual circuit that algorithm is established to other nodes, and storage comprises this virtual circuit message of bandwidth and jumping figure, when transport service, inquire about and obtain meeting the virtual circuit that this service bandwidth required and can arrive destination node respectively according to the virtual circuit message of self storing, obtain a plurality of virtual circuits, set up by the route of source node to the transport service of destination node, transport service according to described a plurality of virtual circuits.
In embodiments of the present invention, also comprise computing module, memory module and processing module in each node, wherein, computing module is used to adopt recursive algorithm to be established to the virtual circuit of other nodes; Memory module is used to store the virtual circuit message that comprises bandwidth and jumping figure of the virtual circuit of setting up; Processing module, the transmission that is used to manage business, the meeting this professional bandwidth requirement and can arrive the virtual circuit of destination node of inquiry memory module storage.
Described node is a source node, further comprises the route implementing module, is used for setting up by the route of source node to the transport service of destination node, transport service according to virtual circuit.
Fig. 7 is the embodiment of the invention realizes route in the p2p network a device schematic diagram, and wherein, this device comprises computing module, memory module and processing module, wherein:
Computing module is used to adopt recursive algorithm to be established to the virtual circuit of other nodes;
Memory module is used to store the virtual circuit message that comprises bandwidth and jumping figure of the virtual circuit of setting up;
Processing module, the transmission that is used to manage business, is established to the transport service route of destination node, transport service according to this virtual circuit at the meeting this professional bandwidth requirement and arrive the virtual circuit of destination node of inquiry memory module storage.
In embodiments of the present invention, this device further comprises the route implementing module for source node, is used for setting up by the route of source node to the transport service of destination node according to virtual circuit.
After in the p2p network, having set up the virtual circuit of support bandwidth for each node, just can transport service, Fig. 8 is the method flow diagram that the embodiment of the invention adopts the virtual circuit transport service, its concrete steps are:
The node (direct-link node) that step 802, this node identify on virtual circuit sends professional transmission request;
The node (direct-link node) that identifies on step 803, this virtual circuit is searched the virtual circuit message of storage, obtains meeting the virtual circuit to destination node of this service bandwidth requirement;
In order in the p2p network, to set up route, the embodiment of the invention need be set up virtual circuit to each node in the p2p network, the algorithm of setting up virtual circuit is that recurrence is set up algorithm, because the principle of virtual circuit is identical in setting up virtual circuit between the territory and setting up the territory, illustrate that with the foundation of virtual circuit between the territory recurrence of virtual circuit sets up process here.
Suppose to have N SN, N is a natural number, and then each SN sets up the parallel virtual circuit that is established to other SN of algorithm according to following recurrence in the p2p network.If the number of degrees of a SN are d, then after the virtual circuit foundation of SN was finished, this SN was at most the d bar to the virtual circuit of other SN.
It is 1 virtual circuit to the jumping figure of all adjacent SN with it that the 1st step: SN sets up SN, and the direct-connected SN of every virtual circuit is identical with purpose SN at this moment, and the bandwidth of every virtual circuit is exactly a corresponding physical link available bandwidth.When all jumping figures be 1 virtual circuit set up finish after, SN broadcasts the virtual circuit of setting up to its adjacent S N.
When broadcasting, if the direct-connected SN of SN is SN2, SN is not broadcast to SN2 (SN2 has been known this virtual circuit when setting up virtual circuit) with source SN to the virtual circuit of SN2.
The 2nd step: according to broadcast reception to jumping figure be the SN of 1 virtual circuit, with the purpose SN of the purpose SN on this virtual circuit as the virtual circuit that will set up, source SN on this virtual circuit as direct-connected SN, is set up this SN (this SN receives the SN that jumping figure is the broadcasting of 1 virtual circuit) and as the jumping figure of source SN is 2 virtual circuit (source SN on the virtual circuit of being set up and purpose SN can not be identical).The virtual circuit bandwidth of setting up is exactly this SN to the physical link available bandwidth of direct-connected SN and this jumping figure is the bandwidth minimum of 1 virtual circuit.
The SN that has set up jumping figure and be 2 virtual circuit preserves the virtual circuit message of being set up.
In this manner, when all jumping figures be 2 virtual circuit set up finish after, the SN that sets up jumping figure and be 2 virtual circuit is broadcast to its adjacent S N with this virtual circuit.
When broadcasting, if the direct-connected SN of SN is SN2, SN is not broadcast to SN2 (SN2 has been known this virtual circuit when setting up virtual circuit) with source SN to the virtual circuit of SN2.
The 3rd step: according to broadcast reception to jumping figure be the SN of 2 virtual circuit, with the purpose SN of the purpose SN on this virtual circuit as the virtual circuit that will set up, source SN on this virtual circuit as direct-connected SN, is set up this SN (this SN receives the SN that jumping figure is the broadcasting of 2 virtual circuit) and as the jumping figure of source SN is 3 virtual circuit (source SN on the virtual circuit of being set up and purpose SN can not be identical).The bandwidth of virtual circuit is exactly this SN to the physical link available bandwidth of direct-connected SN and this jumping figure is the bandwidth minimum of 2 virtual circuit.
If setting up jumping figure is in 3 the virtual circuit process, it is that the source SN of 2 virtual circuit is respectively identical with purpose SN that two jumping figures are arranged, and is that to set up jumping figure be 3 virtual circuit for 2 virtual circuit with regard to the jumping figure of getting the bandwidth maximum.Simultaneously, the jumping figure of being set up is that the source SN of 3 virtual circuit can not be identical with purpose SN.
The SN that has set up jumping figure and be 3 virtual circuit preserves the virtual circuit message of being set up.
In this manner, when all jumping figures be 3 virtual circuit set up finish after, the SN that sets up jumping figure and be 3 virtual circuit is broadcast to its adjacent S N with this virtual circuit.
When broadcasting, if the direct-connected SN of SN is SN2, SN is not broadcast to SN2 (SN2 has been known this virtual circuit when setting up virtual circuit) with source SN to the virtual circuit of SN2.
The 4th step: according to broadcast reception to jumping figure be the SN of 3 virtual circuit, with the purpose SN of the purpose SN on this virtual circuit as the virtual circuit that will set up, source SN on this virtual circuit as direct-connected SN, is set up this SN (this SN receives the SN that jumping figure is the broadcasting of 3 virtual circuit) and as the jumping figure of source SN is 4 virtual circuit (source SN on the virtual circuit of being set up and purpose SN can not be identical).The bandwidth of virtual circuit is exactly this SN to the physical link available bandwidth of direct-connected SN and this jumping figure is the bandwidth minimum of 3 virtual circuit.
If setting up jumping figure is in 4 the virtual circuit process, it is that the source SN of 3 virtual circuit is respectively identical with purpose SN that two jumping figures are arranged, and is that to set up jumping figure be 4 virtual circuit for 3 virtual circuit with regard to the jumping figure of getting the bandwidth maximum.Simultaneously, the jumping figure of being set up is that the source SN of 4 virtual circuit can not be identical with purpose SN.
The SN that has set up jumping figure and be 4 virtual circuit preserves the virtual circuit message of being set up.
In this manner, when all jumping figures be 4 virtual circuit set up finish after, the SN that sets up jumping figure and be 4 virtual circuit is broadcast to its adjacent S N with this virtual circuit.
When broadcasting, if the direct-connected SN of SN is SN2, SN is not broadcast to SN2 (SN2 has been known this virtual circuit when setting up virtual circuit) with source SN to the virtual circuit of SN2.
According to the description in the 3rd step or the 4th step, set up jumping figure and be 5,6 ...., the virtual circuit of N-2.
N-1 step: according to broadcast reception to jumping figure be the SN of the virtual circuit of N-2, with the purpose SN of the purpose SN on this virtual circuit as the virtual circuit that will set up, as direct-connected SN, setting up this SN (this SN receives the SN that jumping figure is the virtual circuit broadcasting of N-2) is the virtual circuit (source SN on the virtual circuit of being set up and purpose SN can not be identical) of N-1 as the jumping figure of source SN with the source SN on this virtual circuit.The bandwidth of virtual circuit is exactly this SN to the physical link available bandwidth of direct-connected SN and this jumping figure is the bandwidth minimum of the virtual circuit of N-2.
If in setting up the virtual circuit process that jumping figure is N-1, the source SN of the virtual circuit that two jumping figures are arranged is N-2 is respectively identical with purpose SN, is that the virtual circuit of N-2 is set up the virtual circuit that jumping figure is N-1 with regard to the jumping figure of getting the bandwidth maximum.Simultaneously, the jumping figure of being set up is that the source SN of the virtual circuit of N-1 can not be identical with purpose SN.
The SN that has set up jumping figure and be the virtual circuit of N-1 preserves the virtual circuit message of being set up.
At last, SN handles according to following the virtual circuit message of self preserving:
Determine to have the virtual circuit of identical direct-connected SN and purpose SN according to the virtual circuit message of self preserving, the virtual circuit of selecting the bandwidth maximum is as the virtual circuit from SN to purpose SN, if the virtual circuit of bandwidth maximum has many, the virtual circuit of then selecting the jumping figure minimum is as the virtual circuit from SN to purpose SN, and with the bandwidth of selected virtual circuit and jumping figure attribute to preserving by virtual circuit.
Like this, each SN in the p2p network has just preserved virtual circuit message between the territory of other SN.
Correspondingly,, also can be established to virtual circuit in the territory of other GN according to the method described above, and preserve the virtual circuit message in the territory of setting up for each GN in the p2p network.
According to the recurrence method for building up of above-mentioned virtual circuit as can be seen, when setting up the virtual circuit of different jumping figures, do not allow the SN virtual circuit identical in source to occur, so the problem in loop can not occur with purpose SN in each step.
After having set up virtual circuit, need safeguard the virtual circuit of being set up.When following several situations take place, need safeguard the virtual circuit in the p2p network or revise virtual circuit: first kind of situation, the physical link available bandwidth in the p2p network changes; Second kind of situation, the virtual circuit in the p2p network changes; The third situation, the node in the p2p network breaks down or lost efficacy; The 4th kind of situation added new node in the p2p network.
For virtual circuit between virtual circuit in the territory and territory, its maintenance or modification are identical, and the embodiment of the invention illustrates the maintenance process of virtual circuit under different situations respectively with the maintenance of virtual circuit between the territory.
First kind of situation safeguarded virtual circuit when the physical link available bandwidth in the p2p network changes.
In p2p network work process, the available bandwidth of the physical link between two SN can constantly change, normal in order to guarantee the p2p network, the embodiment of the invention should in time reflect the situation of change of p2p network availability bandwidth, guarantees steadily and reliably working of p2p network again.
The embodiment of the invention is provided with two system parameterss, is respectively THS1 and THS2, and according to the variation of physical link available bandwidth in following several maintenance strategy response to network.
THS1 and THS2 are to be the integer of unit with the mbit/, are the parameters that the performance according to the p2p network is provided with, and suppose that THS1 divided exactly by THS2, the merchant is for QS, and wide like this be that the bandwidth interval [0, THS1] of THS1 just is split into the individual wide bandwidth interval of THS2 [0 that is of QS, THS2), [THS2,2 * THS2) ..., [(QS-2) * THS2, (QS-1) * THS2), [(QS-1) * THS2, THS1).
In order to narrate conveniently, the physical link that embodiment of the invention supposition bandwidth changes is the physical link of SN1 to SN2, and original available bandwidth is D0 on this link, and the available bandwidth after the variation is D1.
As D0 during, following several maintenance mode is arranged less than D1:
First kind of maintenance mode, D0 〉=THS1, D1 〉=THS1, SN1 is revised as D1 with SN1 to the physical link available bandwidth of SN2.
Second kind of maintenance mode, D0＜THS1, D1 〉=THS1, SN1 is revised as D1 with SN1 to the physical link available bandwidth of SN2, and the jumping figure to SN2 that SN1 will preserve is after the available bandwidth of 1 virtual circuit is revised as D1, to carry out following processing.
SN1 sends a message to SN2, and this message is defined as M1 at present embodiment, comprises SN1 sign and the SN1 physical link available bandwidth D0 to SN2, and it is the virtual circuit message of the available bandwidth of source SN greater than D0 that this message requires to obtain with SN2.
After SN2 receives M1, (with SN2 is all virtual circuits of source SN according to the virtual circuit message of self storing, but remove with SN1 is the virtual circuit of purpose SN or direct-connected SN), search the virtual circuit of available bandwidth greater than D0, if what purpose SN was identical in such virtual circuit has many, at first choose the virtual circuit of available bandwidth maximum,, then choose minimum one of jumping figure if the virtual circuit that selects so still has many.When such all be after the bandwidth of source SN is chosen out greater than the virtual circuit to various objectives SN of D0 with SN2, SN2 returns a message to SN1, this message is defined as M2 in embodiments of the present invention, comprises each virtual circuit message of choosing out (virtual circuit identifier, jumping figure and available bandwidth).
After SN1 received M2, extracting with SN2 was the virtual circuit message of source SN.The purpose SN that supposes a virtual circuit extracting is SN3, and jumping figure is h, and available bandwidth is D2, and the minimum value of D1 and D2 is D3, and then SN1 is being direct-link node with SN2 on it, and SN3 is that the available bandwidth of the virtual circuit of purpose SN is revised as D3, and jumping figure is revised as h+1.If D3 is less than or equal to SN1 and goes up other certain is the available bandwidth of the virtual circuit of purpose SN with SN3, then SN1 no longer handles amended virtual circuit; Otherwise, (be defined as M3, comprise SN1 is source SN to message of SN1 neighbor node (except the SN2) transmission towards periphery, and SN2 is direct-connected SN, SN3 is virtual circuit identifier, jumping figure, the available bandwidth D3 of purpose SN), announcement SN1 changes to virtual circuit available bandwidth and the jumping figure of SN3.
After SN1 handles all virtual circuits that extract from M2, end process.
The third maintenance mode, D0＜THS1, D1＜THS1.At this moment, after SN1 is revised as D1 with SN1 to the physical link available bandwidth of SN2, SN1 judge D1 and D0 whether be in together one wide in the bandwidth interval of THS2, if, end process; Otherwise SN1, SN2 handle by above-mentioned second kind of maintenance mode.
As D0 during, following several maintenance mode is arranged greater than D1:
First kind of maintenance mode, D0 〉=THS1, D1 〉=THS1.After SN1 is revised as D1 with SN1 to the physical link available bandwidth of SN2, end process;
Second kind of maintenance mode, D0 〉=THS1, D1＜THS1.SN1 is revised as D1 with SN1 to the physical link available bandwidth of SN2, and the jumping figure to SN2 that SN1 will preserve is after the available bandwidth of 1 virtual circuit is revised as D1, to carry out following processing.
It is direct-connected SN, the bandwidth virtual circuit greater than D1 that SN1 searches with SN2 in the virtual circuit message of self storage, if the purpose SN of the such virtual circuit that finds is SN3, then SN1 is being direct-connected SN with SN2 on it, SN3 is that the available bandwidth of the virtual circuit of purpose SN is revised as D1, and original available bandwidth of this virtual circuit is D4.
If D4 is less than or equal to SN1 and goes up other certain is the available bandwidth of the virtual circuit of purpose SN with SN3, then SN1 no longer handles amended virtual circuit; Otherwise, SN1 is relatively more all on it to be the available bandwidth of the virtual circuit of purpose SN with SN3, the note maximum is D3, its corresponding virtual circuit is direct-connected SN (SN1-SN4-SN3) with SN4, and jumping figure is h, and message of SN1 neighbours SN (except the SN2) transmission towards periphery (is defined as M3 then, comprising SN1 is source SN, SN4 is direct-connected SN, and SN3 is virtual circuit identifier, jumping figure and the available bandwidth D3 of purpose SN), announce their SN1 and change to virtual circuit available bandwidth and the jumping figure of SN3.
After SN1 handles all virtual circuits that find, end process.
The third maintenance mode: D0＜THS1, D1＜THS1.After SN1 is revised as D1 with SN1 to the physical link available bandwidth of SN2,
SN1 judge D1 and D0 whether be in together one wide in the bandwidth interval of THS2, if, end process; Otherwise SN1, SN2 handle by above-mentioned second kind of maintenance mode.
Second kind of situation safeguarded virtual circuit when the virtual circuit in the p2p network changes.
In the p2p network, after the physical link available bandwidth of certain SN changes, may cause the virtual circuit message between SN to change, as the available bandwidth and the jumping figure generation changes of function of virtual circuit, after SN receives the announcement that virtual circuit message changes, should make appropriate responsive.The embodiment of the invention should in time reflect the situation of change of p2p network availability bandwidth, guarantees steadily and reliably working of p2p network again.
The embodiment of the invention is provided with two system parameterss, is respectively THS1 and THS2, and according to the variation of physical link available bandwidth in following several maintenance strategy response to network.The configuration of THS1 and THS2 is identical with the configuration of first kind of situation.
For convenience, that embodiment of the invention supposition SN1 receives that neighbor node SN2 sends is source SN with SN2, SN3 is the message M3 that the virtual circuit of purpose SN changes, SN1 is D1 to the available bandwidth of the direct-connected physical link of SN2, the bandwidth of the virtual circuit of receiving is D2, jumping figure is h, remembers that this virtual circuit is VL.Supposing existing is source SN with SN1, and SN2 is direct-connected SN, and SN3 is that the available bandwidth of the virtual circuit of purpose SN is D3, simultaneously, supposes with SN1 to be source SN, and SN3 is that the maximum of available bandwidth of all virtual circuits of purpose SN is D4.
At first, SN1 calculates the minimum value of D1 and D2, remembers that its result is D5, if D5 and D3 be in together one wide in the bandwidth interval of THS2, perhaps D5, D3 〉=THS1, SN1 no longer deals with;
Otherwise SN1 is being direct-connected SN with SN2 on it, and SN3 is that the virtual circuit available bandwidth of purpose SN is revised as D5, and jumping figure is revised as and continues to press the mode of stating behind the h+1 and handle.
SN1 calculates on it maximum of available bandwidth that all are the virtual circuit of purpose SN with SN3, and the virtual circuit of note available bandwidth maximum is VL, and its direct-connected SN is SN4, and available bandwidth is D6, and jumping figure is h1.
If D6 and D4 be in together one wide in the bandwidth interval of THS2, perhaps D6, D4 〉=THS1, then SN1 no longer deals with; Otherwise message of SN1 neighbours SN (except the SN4) transmission towards periphery (is defined as M3, comprising SN1 is source SN, and SN4 is direct-connected SN, and SN3 is virtual circuit identifier, jumping figure and the available bandwidth D6 of purpose SN), announcement SN1 changes end process to virtual circuit available bandwidth and the jumping figure of SN3.
The third situation, certain SN in the p2p network safeguards virtual circuit when breaking down.
Can think that SN is 0 to the physical link available bandwidth of the direct-connected SN that breaks down, the mode that adopts first kind of situation to adopt is then safeguarded virtual circuit.
The 4th kind of situation safeguarded virtual circuit when having increased SN newly in the p2p network.
When a SN adds the p2p network, this SN will communicate with its direct-connected SN, SN sends a message that obtains virtual circuit to all neighbours SN, the embodiment of the invention can be defined as M4 with this message, after neighbours SN receives message M4, all virtual circuit messages of preserving are carried at message M5 send to this SN, after SN receives message M5, just can set up the virtual circuit of this SN according to these virtual circuit messages that carry to other all SN.Simultaneously, it is 1 virtual circuit that neighbours SN also sets up its jumping figure to this SN, and then according to foregoing virtual circuit recurrence method for building up, all SN just can set up its virtual circuit to this SN.
More than be explanation, in concrete implementation process, can carry out suitable improvement, to adapt to the concrete needs of concrete condition method of the present invention to the specific embodiment of the invention.Therefore be appreciated that according to the specific embodiment of the present invention just to play an exemplary role, not in order to restriction protection scope of the present invention.
Claims (15)
1, a kind of method that realizes route in peer-to-peer network is characterized in that, each node in the peer-to-peer network adopts recurrence to set up the virtual circuit of algorithm foundation from own to other nodes, and storage comprises the virtual circuit message of bandwidth and jumping figure, and this method also comprises:
After source node receives professional transmission request, virtual circuit message inquiry according to storage meets the virtual circuit that service transmission bandwidth required and can arrive destination node, this request is sent to the direct-link node of this node, meet the virtual circuit that service transmission bandwidth required and can arrive destination node by this direct-link node and follow-up direct-link node according to the virtual circuit message inquiry of self storing, up to the penult node that can arrive destination node;
Described a plurality of virtual circuits that source node obtains according to inquiry are set up the route of transport service.
2, the method for claim 1 is characterized in that, is divided into a plurality of territories in the described peer-to-peer network, wherein, has a super node and a plurality of ordinary node in each territory,
Described each node is set up from own virtual circuit to other nodes: ordinary node is set up in the same territory super node and to the virtual circuit of other ordinary nodes; Super node is set up in the same territory virtual circuit and the cross-domain virtual circuit that is established to other super nodes of ordinary node.
3, method as claimed in claim 1 or 2 is characterized in that, described each node adopts recurrence to set up the virtual circuit that algorithm is established to other nodes, and storage comprises that the process of the virtual circuit message of bandwidth is:
1) to be established to the jumping figure with its all adjacent nodes be to preserve behind 1 the virtual circuit to each node, and the bandwidth of this virtual circuit is a corresponding physical link available bandwidth, with the virtual circuit set up to its adjacent node broadcasting;
2) each node according to broadcast reception to jumping figure be 1 virtual circuit, with the destination node of the destination node on this virtual circuit as the virtual circuit that will set up, with the source node on this virtual circuit as direct-link node, preserve after setting up this node and be 2 virtual circuit as the jumping figure of source node, this virtual circuit bandwidth is the bandwidth minimum of 1 virtual circuit to the physical link available bandwidth of direct-link node and this jumping figure for this node, with the virtual circuit set up to its adjacent node broadcasting;
3) according to step 2) described mode, each node according to broadcast reception to the jumping figure of the rapid broadcasting of previous step be the rapid virtual circuit of previous step, with the destination node of the destination node on this virtual circuit as the virtual circuit that will set up, with the source node on this virtual circuit as direct-link node, setting up this node is to preserve behind the rapid virtual circuit of previous step as the jumping figure of source node, this virtual circuit bandwidth is the physical link available bandwidth and this jumping figure bandwidth minimum for previous step rapid virtual circuit of this node to direct-link node, the virtual circuit of setting up is broadcasted to its adjacent node, all set up to other nodes in the p2p network up to being established to this node;
4) each node determines to have identical direct-link node and purpose outstanding person's virtual circuit according to the virtual circuit message of self preserving, the virtual circuit of selecting the bandwidth maximum is as the virtual circuit from this node to destination node, if the virtual circuit of bandwidth maximum has many, the virtual circuit of then selecting the jumping figure minimum is as the virtual circuit from this node to destination node, and with the bandwidth of selected virtual circuit and jumping figure attribute as this virtual circuit message to preserving by virtual circuit.
4, method as claimed in claim 3 is characterized in that, the described virtual circuit that the virtual circuit of setting up will not be set up when its adjacent node is broadcasted is broadcast to the direct-link node of this virtual circuit;
The source node and the destination node of the virtual circuit of described foundation are inequality.
5, method as claimed in claim 3 is characterized in that, the source node of the virtual circuit of the same number of hops of described foundation is identical with destination node, and this method also comprises:
The jumping figure that adopts the bandwidth maximum is that the rapid virtual circuit of previous step is set up the virtual circuit of jumping figure for this step.
6, method as claimed in claim 3 is characterized in that, described this method also comprises: the virtual circuit of setting up is safeguarded.
7, method as claimed in claim 6 is characterized in that, described maintenance process is that the physical link available bandwidth in peer-to-peer network carries out when changing,
Or the node in peer-to-peer network breaks down or carry out when losing efficacy, and process is:
THS1 and THS2 are set, and this THS1 and THS2 are to be the integer of unit with the mbit/, establish THS1 and are divided exactly by THS2, the merchant is for QS, and wide be that the bandwidth interval [0, THS1] of THS1 just is split into the individual wide bandwidth interval of THS2 [0 that is of QS, THS2), [THS2,2 * THS2) ..., [(QS-2) * THS2, (QS-1) * THS2), [(QS-1) * THS2, THS1);
If original available bandwidth is D0 on this physical link, the available bandwidth after the variation is D1;
D0 is during less than D1, and 1) D0 〉=THS1, D1 〉=THS1 is revised as D1 with this physical link available bandwidth;
2) D0＜THS1, D1 〉=THS1, this physical link available bandwidth is revised as D1, and the jumping figure to destination node that the source node of this physical link will be preserved is that source node sent a message M1 who comprises D0 to destination node after the available bandwidth of 1 virtual circuit was revised as D1; After destination node receives message M1, search the virtual circuit of self storing greater than D0, if what destination node was identical in such virtual circuit has many, at first choose the virtual circuit of available bandwidth maximum, if the virtual circuit that selects so still has many, then choose a minimum virtual circuit of jumping figure; Is all after the bandwidth of source node is chosen out greater than the virtual circuit to the various objectives node of D0 with the destination node, and destination node is returned the message M2 that carries selected virtual circuit message to the source node that sends message M1;
After source node is received message M2, extract with the destination node is that the virtual circuit message of source node is handled: the destination node of establishing a virtual circuit that extracts is a node 3, jumping figure is h, available bandwidth is D2, the minimum value of D1 and D2 is D3, then source node is being direct-link node with the destination node on it, and the destination node of this virtual circuit is that the available bandwidth of the virtual circuit of destination node is revised as D3, and jumping figure is revised as h+1; Other certain destination node with this virtual circuit is the available bandwidth of the virtual circuit of destination node on the source node if D3 is less than or equal to, and then source node is no longer handled amended virtual circuit; Otherwise source node neighbor node towards periphery sends message M3, and the announcement source node changes to the virtual circuit available bandwidth and the jumping figure of the destination node of this virtual circuit;
3) D0＜THS1, D1＜THS1, this physical link available bandwidth is revised as D1 after, source node judge D1 and D0 whether be in together one wide in the bandwidth interval of THS2, if, end process; Otherwise SN1, SN2 are by 2) step handles;
D0 is during greater than D1, and 4) D0 〉=THS1, D1 〉=THS1.After this physical link available bandwidth is revised as D1, end process;
5) D0 〉=THS1, D1＜THS1, this physical link available bandwidth is revised as D1, the jumping figure to destination node that the source node of this physical link will be preserved is after the available bandwidth of 1 virtual circuit is revised as D1, it is direct-link node, the bandwidth virtual circuit greater than D1 that source node is searched with the destination node in the virtual circuit message of self storage, if the destination node of the virtual circuit that finds is a node 3, then source node is being direct-link node with the destination node on it, node 3 is revised as D1 for the available bandwidth of the virtual circuit of destination node, and original available bandwidth of establishing this virtual circuit is D4;
Certain is the available bandwidth of the virtual circuit of destination node with node 3 if D4 is less than or equal on the source node other, and then source node is no longer handled amended virtual circuit; Otherwise, the source node comparison is all on it to be the available bandwidth of the virtual circuit of destination node with node 3, the note maximum is D3, its corresponding virtual circuit is a direct-link node with node 4, jumping figure is h, then source node towards periphery neighbor node send message M3, the announcement source node changes to the virtual circuit available bandwidth and the jumping figure of node 3;
6)D0<THS1，D1<THS1。After this physical link available bandwidth is revised as D1, source node judge D1 and D0 whether be in together one wide in the bandwidth interval of THS2, if, end process; Otherwise source node and destination node are by 5) step process handles.
8, method as claimed in claim 6 is characterized in that, the described maintenance is to carry out when the virtual circuit of setting up changes, and process is:
THS1 and THS2 are set, and this THS1 and THS2 are to be the integer of unit with the mbit/, establish THS1 and are divided exactly by THS2, the merchant is for QS, and wide be that the bandwidth interval [0, THS1] of THS1 just is split into the individual wide bandwidth interval of THS2 [0 that is of QS, THS2), [THS2,2 * THS2) ..., [(QS-2) * THS2, (QS-1) * THS2), [(QS-1) * THS2, THS1);
What suppose that source node receives that neighbor node sends is source node with the neighbor node, the message M3 that node 3 changes for the virtual circuit of destination node, source node is D1 to the available bandwidth of the direct-connected physical link of neighbor node, and the bandwidth of the virtual circuit of receiving is D2, and jumping figure is h; Suppose with the source node to be source node, neighbor node is a direct-link node, and node 3 is source node with the source node for the available bandwidth of the virtual circuit of destination node is D3, and node 3 is D4 for the maximum of the available bandwidth of all virtual circuits of destination node;
1) source node calculates the minimum value of D1 and D2, remembers that its result is D5, if D5 and D3 be in together one wide in the bandwidth interval of THS2, perhaps D5, D3 〉=THS1, source node no longer deals with; Otherwise, source node is being direct-link node with the neighbor node on it, node 3 is revised as D5 for the virtual circuit available bandwidth of destination node, jumping figure is revised as h+1, source node calculates on it maximum of available bandwidth that all are the virtual circuit of destination node with node 3, if the direct-link node of the virtual circuit of available bandwidth maximum is a node 4, available bandwidth is D6, and jumping figure is h1;
If D6 and D4 be in together one wide in the bandwidth interval of THS2, perhaps D6, D4 〉=THS1, then source node no longer deals with; Otherwise source node neighbor node towards periphery sends message M3, and the announcement source node changes to virtual circuit available bandwidth and the jumping figure of SN3.
9, method as claimed in claim 6 is characterized in that, the described maintenance carried out added node in peer-to-peer network after, and process is:
The node that adds peer-to-peer network sends message to all direct-connected neighbor nodes, after neighbor node receives message, all virtual circuit messages of preserving are carried at the node that sends to this adding peer-to-peer network in the returned packet, after the node of this adding peer-to-peer network is received returned packet, the virtual circuit and the storage virtual circuit message of other all nodes of the node of setting up this adding peer-to-peer network according to the virtual circuit message that carries in the peer-to-peer network;
The jumping figure that neighbor node is established to this adding peer-to-peer network is 1 virtual circuit and stores virtual circuit message, other nodes in the peer-to-peer network adopt recurrence to set up the virtual circuit that algorithm is set up the node from own to this adding peer-to-peer network, and storage comprises the virtual circuit message of bandwidth and jumping figure.
10, the method for claim 1 is characterized in that, this method further comprises:
According to the route transmission business.
11, a kind of system that realizes route in peer-to-peer network is characterized in that this system comprises a plurality of nodes, wherein,
Each node, be used to adopt recurrence to set up the virtual circuit that algorithm is established to other nodes, and storage comprises this virtual circuit message of bandwidth and jumping figure, when transport service, according to the virtual circuit message of self storage respectively inquiry character should service bandwidth requires and can arrive the virtual circuit of destination node, obtain a plurality of virtual circuits, set up by the route of source node to the transport service of destination node according to described a plurality of virtual circuits.
12, system as claimed in claim 11 is characterized in that, described each node also comprises computing module, memory module and processing module, wherein,
Computing module is used to adopt recursive algorithm to be established to the virtual circuit of other nodes;
Memory module is used to store the virtual circuit message that comprises bandwidth and jumping figure of the virtual circuit of setting up;
Processing module is used to inquire about meeting this professional bandwidth requirement and can arriving the virtual circuit of destination node of memory module storage.
As claim 11 or 12 described systems, it is characterized in that 13, described node is a source node, further comprises the route implementing module, be used for setting up by the route of source node to the transport service of destination node according to virtual circuit.
14, a kind of device of realizing route in peer-to-peer network is characterized in that this device comprises computing module, memory module and processing module, wherein,
Computing module is used to adopt recursive algorithm to be established to the virtual circuit of other nodes;
Memory module is used to store the virtual circuit message that comprises bandwidth and jumping figure of the virtual circuit of setting up;
Processing module, the transmission that is used to manage business, the meeting this professional bandwidth requirement and can arrive the virtual circuit of destination node of inquiry memory module storage.
15, device as claimed in claim 14 is characterized in that, this device further comprises the route implementing module for source node, is used for setting up by the route of source node to the transport service of destination node according to virtual circuit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007101541457A CN101394339A (en) | 2007-09-19 | 2007-09-19 | Method, system and apparatus for routing implementation in peer-to-peer network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2007101541457A CN101394339A (en) | 2007-09-19 | 2007-09-19 | Method, system and apparatus for routing implementation in peer-to-peer network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101394339A true CN101394339A (en) | 2009-03-25 |
Family
ID=40494422
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2007101541457A Pending CN101394339A (en) | 2007-09-19 | 2007-09-19 | Method, system and apparatus for routing implementation in peer-to-peer network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101394339A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101854310A (en) * | 2009-03-31 | 2010-10-06 | 工业和信息化部电信传输研究所 | P2P controlling unit and method for achieving the same |
| CN101924738A (en) * | 2009-06-11 | 2010-12-22 | 华为技术有限公司 | Method, system and device for realizing multipoint-to-multipoint services |
| WO2011029315A1 (en) * | 2009-09-11 | 2011-03-17 | 中兴通讯股份有限公司 | Method and system for broadcasting multimedia message |
| CN102123471A (en) * | 2010-12-15 | 2011-07-13 | 北京理工大学 | Stub network of Internet of things and seepage data transmission method thereof |
| CN104079675A (en) * | 2013-03-25 | 2014-10-01 | 联想(北京)有限公司 | Method of information processing, electronic equipment and server |
| CN112953823A (en) * | 2021-01-29 | 2021-06-11 | 广州安凯微电子股份有限公司 | Virtual circuit networking method |
-
2007
- 2007-09-19 CN CNA2007101541457A patent/CN101394339A/en active Pending
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101854310A (en) * | 2009-03-31 | 2010-10-06 | 工业和信息化部电信传输研究所 | P2P controlling unit and method for achieving the same |
| CN101924738A (en) * | 2009-06-11 | 2010-12-22 | 华为技术有限公司 | Method, system and device for realizing multipoint-to-multipoint services |
| WO2011029315A1 (en) * | 2009-09-11 | 2011-03-17 | 中兴通讯股份有限公司 | Method and system for broadcasting multimedia message |
| CN101656618B (en) * | 2009-09-11 | 2012-09-05 | 中兴通讯股份有限公司 | Multimedia message broadcasting method and system based on structural Peer-to-Peer Network (PPN) |
| US8984075B2 (en) | 2009-09-11 | 2015-03-17 | Zte Corporation | Method and system for broadcasting multimedia message |
| CN102123471A (en) * | 2010-12-15 | 2011-07-13 | 北京理工大学 | Stub network of Internet of things and seepage data transmission method thereof |
| CN102123471B (en) * | 2010-12-15 | 2013-11-06 | 北京理工大学 | Stub network of Internet of things and seepage data transmission method thereof |
| CN104079675A (en) * | 2013-03-25 | 2014-10-01 | 联想(北京)有限公司 | Method of information processing, electronic equipment and server |
| CN104079675B (en) * | 2013-03-25 | 2017-12-29 | 联想(北京)有限公司 | Method, electronic equipment and the server of information processing |
| CN112953823A (en) * | 2021-01-29 | 2021-06-11 | 广州安凯微电子股份有限公司 | Virtual circuit networking method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100544261C (en) | A kind of data distributing/obtaining method of information Network Based | |
| US8667172B2 (en) | Method and apparatus for content identifier based radius constrained cache flooding to enable efficient content routing | |
| US9705799B2 (en) | Server-side load balancing using parent-child link aggregation groups | |
| US7054271B2 (en) | Wireless network system and method for providing same | |
| CN101567796B (en) | Multimedia network with fragmented content and business method thereof | |
| CN101656618B (en) | Multimedia message broadcasting method and system based on structural Peer-to-Peer Network (PPN) | |
| EP2991254A1 (en) | Network coding for content-centric network | |
| Tu et al. | Resource-aware video multicasting via access gateways in wireless mesh networks | |
| CN103634692A (en) | CDN (content distribution network) and P2P (peer-to-peer) based hybrid stream media video-on-demand system | |
| CN104247371A (en) | Name-based neighbor discovery and multi-hop service discovery in information-centric networks | |
| CN101277248A (en) | Method and system for distributing network data | |
| Teranishi et al. | Scalable and locality-aware distributed topic-based pub/sub messaging for IoT | |
| JP2016123088A (en) | System and method for multicasting of plural sources in information-centric network | |
| CN101394339A (en) | Method, system and apparatus for routing implementation in peer-to-peer network | |
| CN105376292A (en) | Explicit strategy feedback in name-based forwarding | |
| CN103916253A (en) | Information transmission method and system on basis of information center network | |
| CN101515892B (en) | Method for realizing multi-resource processing in peer-to-peer network, equipment and system thereof | |
| CN102647364B (en) | Method, device and system for Mesh network routing | |
| CN101471838B (en) | Method, system and equipment for switching source | |
| CN114285788A (en) | Equipment connection method, device and equipment | |
| Anandaraj et al. | An efficient QOS based multimedia content distribution mechanism in P2P network | |
| Ndlovu et al. | A review of service discovery schemes in wireless mesh networks | |
| Wählisch et al. | Multicast Routing in Structured Overlays and Hybrid Networks | |
| JP5026388B2 (en) | Node device and computer program | |
| Park et al. | Distributed semantic service discovery for MANET |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20090325 |