CN103391315B - A kind of P2P network file method of data synchronization - Google Patents
A kind of P2P network file method of data synchronization Download PDFInfo
- Publication number
- CN103391315B CN103391315B CN201310263048.7A CN201310263048A CN103391315B CN 103391315 B CN103391315 B CN 103391315B CN 201310263048 A CN201310263048 A CN 201310263048A CN 103391315 B CN103391315 B CN 103391315B
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- nodes
- platform
- adjacent
- 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.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A kind of P2P network file method of data synchronization, comprising: each node searching in network, and find the node being adjacent, then timing by its around the topological diagram of node send to platform; Platform is dyeing theory according to the map, from the communicating joint point diagram being formed by several connected nodes, pick out a node and its periphery neighbor node as the host node in communicating joint point diagram, and by host node number, original is cut into multiple packets, then send a packet to each host node, notify all nodes in communicating joint point diagram to obtain all packets of original from the adjacent node of its periphery simultaneously; All nodes are notified according to platform, obtain respectively successively each packet of original from the adjacent node of its periphery, and according to the data synchronization request of other nodes, the Packet Generation that self has been received is given other nodes. The invention belongs to network communications technology field, the file data that can realize fast all nodes in P2P network is synchronous.
Description
Technical field
The present invention relates to a kind of P2P network file method of data synchronization, belong to network communications technology field.
Background technology
Along with the continuous expansion of internet scale, the information technology that Internet is relevant has obtained fast development. But network is usedThe network congestion that family number explosive growth causes, becomes the bottleneck that restricts internet development day by day, therefore, how to improve netThe consumption, the lifting user that when network content service quality, effectively reduce resource experience, and are that internet and mobile network apply neckOne of subject matter that territory faces.
In order to overcome poor expandability that the traditional client/server structure that adopts in internet exists, be prone to network congestion,The shortcomings such as utilization of resources rate is lower, equity calculate (Peer ?to ?Peer, be called for short P2P, " point-to-point " is otherwise known as) technologyArise at the historic moment. P2P network is the distributed network based on shared, and the participant of network is called node (being Peer), all ginsengsEqual with person, node be client be also server. Between P2P node, organize together by certain mode,In the time of node request resource, locate the node that has institute's request resource by certain search strategy, and therefrom obtain in fileHold. Between this node of P2P technology and node, directly link and the mode of swap data, allow directly to enter between personal computerSharing of row resource and service, thus take full advantage of the bandwidth resources between node, alleviate to a great extent rear end, website clothesThe flow pressure of business device, has realized the load balancing of whole network better. In view of above feature and the technical advantage of P2P technology,It has been widely used in ecommerce, file-sharing, live on line, video request program, the web advertisement, long-distance education, long-range doctorThe application of numerous internet arenas such as treatment, video conference.
Is file data how to realize fast all nodes in P2P network synchronous? some relevant solutions have also been proposed at present:
Patent application CN201210588198.0 (application title: the passive distribution method of a kind of P2P data and node client,Applicant: happy view information technology (Beijing) limited company, the applying date: 2012-12-31) a set of P2P data quilt proposedThe technical scheme of moving distribution method. For the P2P network that comprises multiple nodes, first by the neighbour of central server search nodeOccupy node and from these neighbor node downloading datas, thereby set up the data message table of node; Then set up the company between two nodesConnect, destination node sends the download request of data to source node; Whether the data that judge request are present in source node; If so,Source point transmits described data to destination node, and if not, source node informs that the data that destination node is asked are not present in source jointPoint in. It is synchronous that this scheme has mainly solved data between destination node and source node, do not relate to all joints in P2P networkThe data of point are synchronous, especially for mobile network, and the data that the neighbor node of each node and neighbor node haveAll, in dynamic change, this scheme also cannot dynamically be adjusted searching of each destination node according to present node situation in P2P networkStrategy, to locate the source node that has institute's request resource.
Therefore, is file data how to realize fast all nodes in P2P network synchronous? being still a unsolved technology asksTopic.
Summary of the invention
In view of this, the object of this invention is to provide a kind of P2P network file method of data synchronization, can realize fast P2P netIn network, the file data of all nodes is synchronous.
In order to achieve the above object, the invention provides a kind of P2P network file method of data synchronization, include:
Each node searching in step 1, network, the node that also discovery is adjacent, then timing opening up node around itFlutter figure and send to platform;
Step 2, platform dyeing theory according to the map picks out one from the communicating joint point diagram being made up of several connected nodesIndividual node and its periphery neighbor node be as the host node in described communicating joint point diagram, and by host node number, original is cut intoMultiple packets, then send a packet to each host node, notify all nodes in communicating joint point diagram from its week simultaneouslyThe adjacent node on limit obtains all packets of original;
Step 3, all nodes are notified according to platform, obtain respectively successively every number of original from the adjacent node of its peripheryAccording to bag, and according to the data synchronization request of other nodes, the Packet Generation that self has been received is given other nodes, thereby realizesIn communicating joint point diagram, the file data of all nodes is synchronous,
Step 1 further includes:
Step 11, each node are monitored at a port, and near the node of scanning, if having WIFI near findingSignal, access send packet to the listening port of the other side's node, to find its adjacent node, then by adjacent nodeInformation sends to platform by certain synchronization of time intenals;
Step 12, platform are monitored at fixing port, and the information of the adjacent node sending according to all nodes, calculateThe topological diagram of all nodes;
Step 13, platform, according to the connectivity between node, are divided into several communicating joint point diagrams by the topological diagram of all nodes,All nodes of each communicating joint point diagram are not connected with all nodes of other communicating joint point diagrams.
Compared with prior art, the invention has the beneficial effects as follows: original synchronous needs is cut into multiple packets by platform,And dyeing theory according to the map, distribute different packets to two adjacent host nodes, then by the data between host nodeTransmit, the file data of having realized fast all host nodes is synchronous, and execution efficiency is high, and effectively reduces accounting for platform resourceBy rate; According to the packet accepting state of periphery neighbor node, the time series collection, the packet that calculate respectively each node receiveCollection and packet source collect, with specify each node not in the same time, to the different packet of different neighbor node requests, therebyThe file data of realizing fast all nodes is synchronous; Each node can also be according to the present situation, comparison self node and adjacent node,Or the network cost value size between platform, thereby can further obtain corresponding packet according to minimum network cost;The present invention is applicable in mobile network and internet.
Brief description of the drawings
Fig. 1 is a kind of P2P network file of the present invention method of data synchronization flow chart.
Fig. 2 is the concrete operations flow chart of Fig. 1 step 1.
Detailed description of the invention
For making the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing, the present invention is done further in detailDescribe.
As shown in Figure 1, a kind of P2P network file of the present invention method of data synchronization, includes:
Each node searching in step 1, network, the node that also discovery is adjacent, then timing opening up node around itFlutter figure and send to platform;
Step 2, platform dyeing theory according to the map picks out one from the communicating joint point diagram being made up of several connected nodesIndividual node and its periphery neighbor node be as the host node in described communicating joint point diagram, and by host node number, original is cut intoMultiple packets, then send a packet to each host node, notify all nodes in communicating joint point diagram from its week simultaneouslyThe adjacent node on limit obtains all packets of original;
Step 3, all nodes are notified according to platform, obtain respectively successively every number of original from the adjacent node of its peripheryAccording to bag, and according to the data synchronization request of other nodes, the Packet Generation that self has been received is given other nodes, thereby realizesIn communicating joint point diagram, the file data of all nodes is synchronous.
As shown in Figure 2, described step 1 further includes:
Step 11, each node are monitored at a port, and near the node of scanning, if having WIFI near findingSignal, access send packet to the listening port of the other side's node, to find its adjacent node, then by adjacent nodeInformation sends to platform by certain synchronization of time intenals, and the information of described adjacent node includes signal power, the network of nodeDelay, the network bandwidth etc., described synchronization of time intenals can arrange different time values according to the place at node place, for example:The sync interval time of the node of fixed-site can be slightly long, and the sync interval time of the node in mobile place can be slightly short;
Step 12, platform are monitored at fixing port, and the information of the adjacent node sending according to all nodes, calculateThe topological diagram of all nodes;
Can certain threshold value be set to the signal power of node, when the signal power between two nodes is during lower than threshold value, sayBright two nodes are non-conterminous; When the signal power between two nodes is during higher than threshold value, illustrate that two nodes are adjacent;
Step 13, platform, according to the connectivity between node, are divided into several communicating joint point diagrams by the topological diagram of all nodes,All nodes of each communicating joint point diagram are not connected with all nodes of other communicating joint point diagrams.
Described step 2 further includes:
Each node that step 21, platform calculate in communicating joint point diagram arrives the network cost value sum of all neighbor nodes around, andSelect the node and the host node of its periphery neighbor node as communicating joint point diagram, institute of a network cost value sum minimumState network cost value and can choose the network bandwidth, network delay or expense etc. between node because usually calculating according to actual conditions,Then dyeing theory according to the map, calculates each host node to described communicating joint point diagram at t0The data package size value of moment transmission:Wherein xiThe data package size value of platform to i host node transmission, piThat i host node is to platformNetwork cost value,Be the network cost value sums of all host nodes to platform, X is original sizes values, and N is UNICOMHost node number in node diagram, finally according at t0The data package size value of each packet of moment transmission, cuts originalBe slit into N packet (for example,, in the time that host node number is 4, original is cut into 4 packets by platform);
Step 22, platform are that time series collection TS of each primary node constructs, packet receive collection DS and packet sourceCollection SS, and according to the network bandwidth and data package size value, calculate each host node and receive platform at t0The packet of moment transmissionMoment, and host node receive the packet that platform sends after, continue to receive from other host nodes other numbers of originalsAccording to the moment of bag, then the time of reception of each packet of host node and corresponding packet ID and transmit leg ID are addedConcentrate in the time series collection, packet reception collection and the packet source that are added to host node, wherein, and TS:{t1，t2，…tNInt1、t2、…、tNRespectively the moment that node receives each packet, DS:{b1，b2，…，bNIn b1、b2，…、bNRespectively that node is at t1、t2、…、tNThe packet ID that moment is received, SS:{s1，s2，…，sNIn s1、s2、…、sNRespectively the received packet b of node1、b2，…、bNTransmit leg ID;
In the present invention, platform by according in step 21 calculate data package size value, by corresponding Packet Generation to host node,Then between host node, transmit mutually remaining packet, synchronous first to realize file data between host node, then continue logicalCross host node and transmit packet to other node, thereby it is synchronous to realize the file data of all nodes in communicating joint point diagram. Therefore,Receive collection DS and packet source collection SS, t for time series collection TS, the packet of host node1That host node receivesThe moment of the packet sending to platform, b1The packet ID that platform sends to host node, s1Platform ID, t2、…、tNThe moment that host node receives the packet that other host nodes send, b2，…、bNThat host node is at t2、…、tNTimeCarve the packet ID that other received host nodes send, s2、…、sNTo send packet b2，…、bNOther are mainNode ID;
Step 23, platform are from the adjacent node of the node that builds time series collection of communicating joint point diagram, and order is also chosen oneDo not build the node of time series collection, for described node builds a time series collection, packet receives collection and packet source collection,Described time series collection, packet receive collection and packet source collection is initially sky, and the extraction all joints adjacent with described nodeThe time series collection, packet of point receives collection and packet source collection, then from the time order of the adjacent all nodes of described nodeRow are concentrated and are picked out a minimal instant Tmin；
In described step 23, platform, can basis from the adjacent node of the node that builds time series collection of communicating joint point diagramAdjacent node arrives the path of host node to be come sequentially to choose a node that does not also build time series collection, has first chosen instituteThere is the adjacent node of host node, and then choose the adjacent node of the adjacent node of all host nodes, and the like;
Step 24, platform find minimal instant TminThe adjacent node that place time series set pair is answered and the packet of adjacent node connectCollect, count described adjacent node at minimal instant TminThe all packets that received, and judge that described adjacent node isHour carve TminDoes the packet that each packet in all packets that received is present in described node receive concentrated? asFruit be, from described adjacent node at minimal instant TminIn all packets that received, delete the number that has been present in described nodeReceive concentrated packet according to bag, then continue step 25; If not, continue step 25;
Step 25, judge that described adjacent node is at minimal instant TminDo are all packets that received empty? if so,Continue step 26; If not, from described adjacent node at minimal instant TminIn all packets that received, random choose goes outA packet, according to the file size value of the network bandwidth of node and adjacent node and described packet, calculates from minimumMoment TminStart to count, described node will receive the moment T of described packet, respectively by described packet ID, moment TAdd time series collection, packet reception collection and the packet source of described node with corresponding adjacent node order to and concentrate, continueContinuous step 26;
Step 26, add up all packets that described node has received at moment T, and it is former to judge whether described node has receivedAll packets of file? if so, turn to step 27; If not, continue from all adjacent nodes of described nodeTime series is concentrated and is picked out moment T minimal instant T afterwardsmin, and turn to step 24;
Do step 27, platform judge whether all nodes in communicating joint point diagram have all built time series collection? if so, continueStep 28; If not, turn to step 23;
Step 28, platform receive collection and packet source collection according to the time series collection of all nodes, packet, to all nodesSend packet obtain notification message, with indicate each node one by one according to the each moment in its time sequence sets, to packetOriginate adjacent node corresponding to concentrated transmit leg ID, acquisition request packet receives concentrated packet corresponding to packet ID;
The time series collection TS:{t of for example certain node1，t2，t3, packet receive collection DS:{b1，b2，b3And packetSource collection SS:{s1，s2，s3, platform, obtaining in notification message to the packet of its transmission, indicates this node at t1TimeCarve to adjacent node s1Acquisition request packet b1, at t2Moment is to adjacent node s2Acquisition request packet b2, at t31MomentTo adjacent node s3Acquisition request packet b3；
Step 29, platform are at t0N the packet that moment is cut step 21 starts respectively to each host node transmission.
Described step 3 also includes:
The packet that node sends according to platform obtains notification message, extract one by one each moment and corresponding transmit leg ID thereof andPacket ID, and calculate network cost value and self node between self node and adjacent node corresponding to transmit leg IDAnd network cost value between platform, then select minimum of a value, then in each moment to adjacent node corresponding to minimum of a valueOr platform transmission data synchronization request, to obtain the corresponding packet of packet ID according to minimum network cost value.
Above are only preferred embodiment of the present invention, not in order to limit the present invention, all the spirit and principles in the present invention itIn, any amendment of making, be equal to replacement, improvement etc., within all should being included in the scope of protection of the invention.
Claims (9)
1. a P2P network file method of data synchronization, is characterized in that, includes:
Each node searching in step 1, network, the node that also discovery is adjacent, then timing opening up node around itFlutter figure and send to platform;
Step 2, platform dyeing theory according to the map picks out one from the communicating joint point diagram being made up of several connected nodesIndividual node and its periphery neighbor node be as the host node in described communicating joint point diagram, and by host node number, original is cut intoMultiple packets, then send a packet to each host node, notify all nodes in communicating joint point diagram from its week simultaneouslyThe adjacent node on limit obtains all packets of original;
Step 3, all nodes are notified according to platform, obtain respectively successively every number of original from the adjacent node of its peripheryAccording to bag, and according to the data synchronization request of other nodes, the Packet Generation that self has been received is given other nodes, thereby realizesIn communicating joint point diagram, the file data of all nodes is synchronous,
Step 1 further includes:
Step 11, each node are monitored at a port, and near the node of scanning, if having WIFI near findingSignal, access send packet to the listening port of the other side's node, to find its adjacent node, then by adjacent nodeInformation sends to platform by certain synchronization of time intenals;
Step 12, platform are monitored at fixing port, and the information of the adjacent node sending according to all nodes, calculateThe topological diagram of all nodes;
Step 13, platform, according to the connectivity between node, are divided into several communicating joint point diagrams by the topological diagram of all nodes,All nodes of each communicating joint point diagram are not connected with all nodes of other communicating joint point diagrams.
2. method according to claim 1, is characterized in that, the signal that the information of described adjacent node includes node is strongWeak, network delay, the network bandwidth, described synchronization of time intenals comes setup times value, fixed-site according to the place at node placeSync interval time of node long, the sync interval time of the node in mobile place is short.
3. method according to claim 1, is characterized in that, step 12 also includes:
Signal power to node arranges certain threshold value, when the signal power between two nodes is during lower than threshold value, and two jointsPoint is non-conterminous; When the signal power between two nodes is during higher than threshold value, two nodes are adjacent.
4. method according to claim 1, is characterized in that, step 2 further includes:
Each node that step 21, platform calculate in communicating joint point diagram arrives the network cost value sum of all neighbor nodes around, andSelect the node and the host node of its periphery neighbor node as communicating joint point diagram of a network cost value sum minimum, soAfter dyeing theory according to the map, calculate each host node to described communicating joint point diagram at t0The data package size value of moment transmission:Wherein xiThe data package size value of platform to i host node transmission, piThat i host node is to platformNetwork cost value,Be the network cost value sums of all host nodes to platform, X is original sizes values, and N is UNICOMHost node number in node diagram, finally according at t0The data package size value of each packet of moment transmission, cuts originalBe slit into N packet;
Step 22, platform are at t0N the packet that moment is cut step 21 starts respectively to each host node transmission.
5. method according to claim 4, is characterized in that, described network cost value, according to actual conditions, is chosen nodeBetween the network bandwidth, network delay or expense calculate.
6. method according to claim 4, is characterized in that, between step 21 and 22, also includes:
Step (1), platform are that time series collection TS of each primary node constructs, packet receive collection DS and packet sourceCollection SS, and according to the network bandwidth and data package size value, calculate each host node and receive platform at t0The packet of moment transmissionMoment, and host node receive the packet that platform sends after, continue to receive from other host nodes other numbers of originalsAccording to the moment of bag, then the time of reception of each packet of host node and corresponding packet ID and transmit leg ID are addedConcentrate in the time series collection, packet reception collection and the packet source that are added to host node, wherein, and TS:{t1，t2，…tNInt1、t2、…、tNRespectively the moment that node receives each packet, DS:{b1，b2，…，bNIn b1、b2，…、bNRespectively that node is at t1、t2、…、tNThe packet ID that moment is received, SS:{s1，s2，…，sNIn s1、s2、…、sNRespectively the received packet b of node1、b2，…、bNTransmit leg ID;
Step (2), platform are from the adjacent node of the node that builds time series collection of communicating joint point diagram, and order is chosen oneAlso do not build the node of time series collection, for described node builds a time series collection, packet receives collection and packet sourceCollection, described time series collection, packet receive collection and packet source collection is initially sky, and the extraction institute adjacent with described nodeHave the time series collection, packet of node to receive collection and packet source collection, then from the adjacent all nodes of described node timeBetween pick out a minimal instant T in sequence setsmin；
Step (3), platform find minimal instant TminThe adjacent node that place time series set pair is answered and the packet of adjacent nodeReceive collection, count described adjacent node at minimal instant TminThe all packets that received, and judge that described adjacent node existsMinimal instant TminDoes the packet that each packet in all packets that received is present in described node receive concentrated?If so, from described adjacent node at minimal instant TminIn all packets that received, deletion has been present in described nodePacket receives concentrated packet, then continues step (4); If not, continue step (4);
Step (4), judge that described adjacent node is at minimal instant TminDo are all packets that received empty? if so,Continue step (5); If not, from described adjacent node at minimal instant TminIn all packets that received, choose at randomSelect a packet, according to the file size value of the network bandwidth of node and adjacent node and described packet, calculate fromMinimal instant TminStart to count, described node will receive the moment T of described packet, respectively by described packet ID, timeCarve that time series collection, packet that T and corresponding adjacent node order add described node to receive collection and concentrate in packet source,Continue step (5);
Step (5), add up all packets that described node has received at moment T, and judge whether described node has receivedAll packets of original? if so, turn to step (6); If not, continue all adjacent segments from described nodeThe time series of point is concentrated and is picked out moment T minimal instant T afterwardsmin, and turn to step (3);
Do step (6), platform judge whether all nodes in communicating joint point diagram have all built time series collection? if so, continueContinuous step (7); If not, turn to step (2);
Step (7), platform receive collection and packet source collection according to the time series collection of all nodes, packet, to all jointsPoint send packet obtain notification message, with indicate each node one by one according to the each moment in its time sequence sets, to dataConcentrated corresponding adjacent node, the acquisition request packet of transmit leg ID in bag source receives concentrated data corresponding to packet IDBag.
7. method according to claim 6, is characterized in that, in step (1), for the time series collection of host nodeTS, packet receive collection DS and packet source collection SS, t1That host node receives the packet that platform sendsMoment, b1The packet ID that platform sends to host node, s1Platform ID, t2、…、tNThat host node receives other mastersThe moment of the packet that node sends, b2，…、bNThat host node is at t2、…、tNOther host nodes that moment is receivedThe packet ID sending, s2、…、sNTo send packet b2，…、bNOther host nodes ID.
8. method according to claim 6, is characterized in that, in step (2), platform is from the structure of communicating joint point diagramBuild in the adjacent node of node of time series collection, the path that arrives host node according to adjacent node also sequentially chooses oneDo not build the node of time series collection.
9. method according to claim 1, is characterized in that, step 3 also includes:
The packet that node sends according to platform obtains notification message, extract one by one each moment and corresponding transmit leg ID thereof andPacket ID, and calculate network cost value and self node between self node and adjacent node corresponding to transmit leg IDAnd network cost value between platform, then select minimum of a value, then in each moment to adjacent node corresponding to minimum of a valueOr platform transmission data synchronization request, to obtain the corresponding packet of packet ID according to minimum network cost value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310263048.7A CN103391315B (en) | 2013-06-27 | 2013-06-27 | A kind of P2P network file method of data synchronization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310263048.7A CN103391315B (en) | 2013-06-27 | 2013-06-27 | A kind of P2P network file method of data synchronization |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103391315A CN103391315A (en) | 2013-11-13 |
| CN103391315B true CN103391315B (en) | 2016-05-04 |
Family
ID=49535470
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310263048.7A Active CN103391315B (en) | 2013-06-27 | 2013-06-27 | A kind of P2P network file method of data synchronization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103391315B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105187465B (en) * | 2014-06-20 | 2019-03-01 | 中国科学院深圳先进技术研究院 | A kind of sharing method of file, apparatus and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101141388A (en) * | 2007-08-23 | 2008-03-12 | 武汉理工大学 | Method for implementing optimization energy consumption in Ad hoc network |
| CN101217489A (en) * | 2008-01-10 | 2008-07-09 | 复旦大学 | Router with network encoding function and network organizing method based on network coding |
| CN101534205A (en) * | 2008-03-11 | 2009-09-16 | 中国网通集团宽带业务应用国家工程实验室有限公司 | Application layer multicast service realizing method, terminal and system thereof |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6791982B2 (en) * | 1999-09-29 | 2004-09-14 | Telefonaktiebolaget Lm Ericsson | Segmentation protocol that supports compressed segmentation headers |
-
2013
- 2013-06-27 CN CN201310263048.7A patent/CN103391315B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101141388A (en) * | 2007-08-23 | 2008-03-12 | 武汉理工大学 | Method for implementing optimization energy consumption in Ad hoc network |
| CN101217489A (en) * | 2008-01-10 | 2008-07-09 | 复旦大学 | Router with network encoding function and network organizing method based on network coding |
| CN101534205A (en) * | 2008-03-11 | 2009-09-16 | 中国网通集团宽带业务应用国家工程实验室有限公司 | Application layer multicast service realizing method, terminal and system thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103391315A (en) | 2013-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Song et al. | Content centric peer data sharing in pervasive edge computing environments | |
| CN101355468B (en) | Method for publishing P2P stream medium information | |
| CN103068002B (en) | A kind of HR-WPAN Mesh network method for routing efficiently | |
| CN102244670B (en) | Idle node assistance method for P2P (peer-to-peer) file transmission | |
| CN108123873B (en) | Data forwarding path selection method and device, storage medium and server | |
| CN105099902B (en) | A kind of method for routing for quantum Mesh network | |
| CN103581248A (en) | Method and device for providing content distribution network CDN service | |
| CN103024085A (en) | System and method for processing P2P (peer-to-peer) node request | |
| CN104506537B (en) | P2P system node selection method | |
| CN105681260A (en) | Cloud storage file transmission method, fusion communication platform, sending end and system | |
| CN103037015A (en) | Active P2P data distribution method and node client-side | |
| CN104320405A (en) | Internet surfing optimization method applicable to star satellite network | |
| CN106487709A (en) | A kind of file transmitting method and system | |
| CN103391315B (en) | A kind of P2P network file method of data synchronization | |
| CN104219156B (en) | A kind of multicast route method suitable for the aerial self-organizing network of stratification | |
| CN103037435B (en) | Wireless sensor network route protocol | |
| CN107018181B (en) | P2P network establishing method based on flow medium live system | |
| CN106789676B (en) | The reliable multicast method for routing of low overhead in wireless self-organization network | |
| CN102281179A (en) | VPN tunnel relay acceleration technology | |
| CN107302747B (en) | Cooperative video transmission method based on stable matching | |
| CN102387062A (en) | Method for improving transmission rate of peer-to-peer (p2p) node in crossing network by dynamic bridging contact | |
| Lacava et al. | Demo abstract: BE-Mesh: Bluetooth low energy mesh networking | |
| CN103037017A (en) | Passive P2P data distribution method and node client-side | |
| CN102035894B (en) | Distance-based state synchronization method | |
| CN102857352A (en) | Multicasting and broadcasting method and system based on overlay network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: 310013, Zhejiang, Xihu District, Wensanlu Road, No. 398, 4 floor, Hangzhou Patentee after: Dongxin Beiyou Information Technology Co., Ltd., Hangzhou Address before: 100191 Beijing, Zhichun Road, No. 9, hearing the building on the floor of the 7 floor, Patentee before: Dongxin Beiyou Information Technology Co., Ltd., Hangzhou |