CN103391315A - P2P (peer-to-peer) network file data synchronization method - Google Patents
P2P (peer-to-peer) network file data synchronization method Download PDFInfo
- Publication number
- CN103391315A CN103391315A CN2013102630487A CN201310263048A CN103391315A CN 103391315 A CN103391315 A CN 103391315A CN 2013102630487 A CN2013102630487 A CN 2013102630487A CN 201310263048 A CN201310263048 A CN 201310263048A CN 103391315 A CN103391315 A CN 103391315A
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- nodes
- platform
- collection
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 21
- 238000010586 diagram Methods 0.000 claims description 40
- 230000001360 synchronised effect Effects 0.000 claims description 13
- 230000002093 peripheral effect Effects 0.000 claims description 12
- 239000008186 active pharmaceutical agent Substances 0.000 claims description 7
- 230000005540 biological transmission Effects 0.000 claims description 7
- 239000012141 concentrate Substances 0.000 claims description 6
- 238000004043 dyeing Methods 0.000 claims description 6
- 238000012217 deletion Methods 0.000 claims description 2
- 230000037430 deletion Effects 0.000 claims description 2
- 238000000605 extraction Methods 0.000 claims description 2
- 238000004040 coloring Methods 0.000 abstract 1
- 238000005516 engineering process Methods 0.000 description 7
- 238000011161 development Methods 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A P2P network file data synchronization method comprises that every node in a network searches and finds the neighboring nodes and sends the topological graphs of the neighboring nodes to a platform periodically; according to the map coloring theorem, the platform selects one node and the neighboring nodes of the node from a communication node graph composed of a plurality of connected nodes as the main nodes of the communication node graph, cuts an original file into a plurality of data packets according to the number of the main nodes, then sends one data pack to every main node and meanwhile informs all nodes in the communication node graph to obtain all the data packets of the original file from the neighboring nodes; every node sequentially obtains every data packet of the original file from the neighboring nodes according to the platform information and sends the data packet received by itself to other nodes according to the data synchronization requests of other nodes. The P2P network file data synchronization method belongs to the technical field of network communication and can rapidly achieve the file data synchronization of all the nodes in a P2P network.
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.Yet, the network congestion that the explosive growth of network user's number causes, day by day become the bottleneck of restriction internet development, therefore, how effectively reduce when improving Web content service quality resource consumption, promote the user and experience, be one of subject matter of facing of internet and mobile network's application.
In order to overcome poor expandability that the traditional client/server structure that adopts in the Internet exists, be prone to network congestion, the shortcoming such as the utilization of resources rate is lower, equity calculate (Peer ?to ?Peer, be called for short P2P, " point-to-point " is otherwise known as) technology arises at the historic moment.The P2P network is based on shared distributed network, and the participant of network is called node (being Peer), and all participants' is equal, node be client be also server.Organize together by certain mode between the P2P node, when the node request resource, locate the node that has institute's request resource by certain search strategy, and therefrom obtain file content.Directly link between this node of P2P technology and node and the mode of swap data, allow between personal computer directly to carry out sharing of resource and service, thereby take full advantage of the bandwidth resources between node, alleviate to a great extent the flow pressure of website back-end server, realized better the load balancing of whole network.In view of above characteristics and the technical advantage of P2P technology, it has been widely used in the application of numerous internet arenas such as ecommerce, file-sharing, live on line, video request program, the web advertisement, long-distance education, tele-medicine, video conference.
How to realize fast that the file data of all nodes in the P2P network is synchronous? some relevant solutions have also been proposed at present:
Patent application CN201210588198.0(applies for 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: the technical scheme that 2012-12-31) proposes a passive distribution method of cover P2P data.For the P2P network that comprises a plurality of nodes, the neighbor node by the central server search node and from these neighbor node downloading datas at first, thus set up the data message table of node; Then set up the connection between two nodes, destination node sends the download request of data to source node; Whether the data of judgement request are present in source node; If source point transmits described data to destination node, if not, source node informs that the data that destination node is asked are not present in source node.The data that this scheme has mainly solved between destination node and source node are synchronous, the data that do not relate to all nodes in the P2P network are synchronous, especially for the mobile network, the data that the neighbor node of each node and neighbor node have are in dynamic change, this scheme also can't dynamically be adjusted the search strategy of each destination node according to present node situation in the P2P network, have the source node of institute's request resource with location.
Therefore, how to realize fast that the file data of all nodes in the P2P network is synchronous? be still a unsolved technical problem.
Summary of the invention
In view of this, the purpose of this invention is to provide a kind of P2P network file method of data synchronization, can realize fast that the file data of all nodes in the P2P network 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, and find then regularly the topological diagram of node around it to be sent to platform by the node be adjacent;
Step 2, platform be dyeing theory according to the map, pick out a node and its peripheral neighbor node as the host node in described communicating joint point diagram from the communicating joint point diagram that is formed by several connected nodes, and by the host node number, original is cut into a plurality of packets, then send a packet to each host node, notify simultaneously all nodes in the communicating joint point diagram to obtain all packets of original from its peripheral adjacent node;
Step 3, all nodes are notified according to platform, obtain respectively successively each packet of original from its peripheral adjacent node, and according to the data synchronization request of other nodes, the Packet Generation that self has been received is given other nodes, thereby realizes that the file data of all nodes in the communicating joint point diagram is synchronous.
Compared with prior art, the invention has the beneficial effects as follows: platform will need synchronous original to cut into a plurality of packets, and dyeing theory according to the map, to two adjacent different packets of host node distribution, then transmit by the data between host node, the file data of having realized fast all host nodes is synchronous, carries out efficiency high, and effectively reduces the occupancy to platform resource; Packet accepting state according to peripheral neighbor node, the time series collection, the packet that calculate respectively each node receive collection and packet source collection, with specify each node not in the same time, to the different packet of different neighbor node requests, thereby realize that fast the file data of all nodes is synchronous; Each node can also be according to the present situation, the network cost value size between comparison self node and adjacent node or platform, thus can further according to the network cost of minimum, obtain corresponding packet; The present invention is applicable in mobile network and the Internet.
Description of 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.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with accompanying drawing.
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, and find then regularly the topological diagram of node around it to be sent to platform by the node be adjacent;
Step 2, platform be dyeing theory according to the map, pick out a node and its peripheral neighbor node as the host node in described communicating joint point diagram from the communicating joint point diagram that is formed by several connected nodes, and by the host node number, original is cut into a plurality of packets, then send a packet to each host node, notify simultaneously all nodes in the communicating joint point diagram to obtain all packets of original from its peripheral adjacent node;
Step 3, all nodes are notified according to platform, obtain respectively successively each packet of original from its peripheral adjacent node, and according to the data synchronization request of other nodes, the Packet Generation that self has been received is given other nodes, thereby realizes that the file data of all nodes in the communicating joint point diagram is synchronous.
As shown in Figure 2, described step 1 further includes:
Can certain threshold value be set to the signal power of node, when the signal power between two nodes, during lower than threshold value, illustrate that two nodes are non-conterminous; During higher than threshold value, illustrate that two nodes are adjacent when the signal power between two nodes;
Described step 2 further includes:
Each node that step 21, platform calculate in the communicating joint point diagram arrives the network cost value sum of all neighbor nodes on every side, and select the node of a network cost value sum minimum and its peripheral neighbor node host node as the communicating joint point diagram, described network cost value can be calculated according to the factors such as the network bandwidth, network delay or expense that actual conditions are chosen between node, then dyeing theory according to the map, calculate each host node to described communicating joint point diagram at t
0The data package size value of constantly transmitting:
X wherein
iThe data package size value of platform to i host node transmission, p
iThe network cost value of i host node to platform,
Be the network cost value sums of all host nodes to platform, X is the original sizes values, and N is the host node number in the communicating joint point diagram, finally according at t
0The data package size value of each packet of transmission, cut into N packet (for example, when the host node number was 4, platform cut into 4 packets with original) with original constantly;
Step 22, platform are that time series collection TS of each primary node constructs, packet receive collection DS and packet source collection SS, and, according to the network bandwidth and data package size value, calculate each host node and receive platform at t
0The moment of the packet that constantly transmits, and host node receive the packet that platform sends after, moment of continuing to receive from other host nodes other packets of originals, then time series collection, the packet that adds the time of reception of each packet of host node and corresponding packet ID and transmit leg ID to host node receives collection and concentrate in the packet source, wherein, TS:{t
1, t
2... t
NIn t
1, t
2..., t
NRespectively the moment that node receives each packet, DS:{b
1, b
2..., b
NIn b
1, b
2..., b
NRespectively that node is at t
1, t
2..., t
NConstantly received packet ID, SS:{s
1, s
2..., s
NIn s
1, s
2..., s
NRespectively the received packet b of node
1, b
2..., b
NTransmit leg ID;
In the present invention, platform will be according to the data package size value of calculating in step 21, with the Packet Generation of correspondence to host node, then transmit mutually remaining packet between host node, synchronous first to realize the file data between host node, then continue to transmit packet by host node to other node, thereby realize that the file data of all nodes in the communicating joint point diagram is synchronous.Therefore, time series collection TS, the packet for host node receives collection DS and packet source collection SS, t
1The moment that host node receives the packet that platform sends, b
1The packet ID that platform sends to host node, s
1Platform ID, t
2..., t
NThe moment that host node receives the packet that other host nodes send, b
2..., b
NThat host node is at t
2..., t
NThe packet ID that other received host nodes of the moment send, s
2..., s
NTo send packet b
2..., b
NOther host nodes ID;
Step 23, platform are from the adjacent node of the node that builds the time series collection of communicating joint point diagram, order is chosen a node that does not also build the 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 time series collection of extraction all nodes adjacent with described node, packet receive collection and packet source collection, then from the time series of all adjacent nodes of described node, concentrates and pick out a minimal instant T
min
In described step 23, platform is from the adjacent node of the node that builds the time series collection of communicating joint point diagram, can come order to choose a node that does not also build the time series collection according to the path that adjacent node arrives host node, namely first chosen the adjacent node of all host nodes, and then choose the adjacent node of the adjacent node of all host nodes, and the like;
Step 24, platform find minimal instant T
minThe adjacent node that place time series set pair is answered and the packet of adjacent node receive collection, count described adjacent node at minimal instant T
minAll packets that received, and judge that described adjacent node is at minimal instant T
minDoes 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 T
minIn all packets that received, deletion has been present in the concentrated packet of packet reception of described node, then continues step 25; If not, continue step 25;
Step 25, the described adjacent node of judgement are at minimal instant T
minAre all packets that received empty? if so, continue step 26; If not, from described adjacent node at minimal instant T
minIn all packets that received, random choose goes out a packet,, according to the file size value of the network bandwidth and the described packet of node and adjacent node, calculates from minimal instant T
minThe moment T that start to count, described node will receive described packet, respectively with described packet ID, T and the corresponding adjacent node time series collection, the packet that sequentially add described node to receives collection and the packet source is concentrated constantly, continues step 26;
All packets that step 26, the described node of statistics have received at moment T, and judge that described node has received all packets of original? if so, turn to step 27; If not, continue to concentrate and pick out a minimal instant T after T constantly from the time series of all adjacent nodes of described node
min, and turn to step 24;
Do step 27, platform judge whether all nodes in the communicating joint point diagram have all built the time series collection? if so, continue step 28; If not, turn to step 23;
Step 28, platform receive collection and packet source collection according to time series collection, the packet of all nodes, send packets to all nodes and obtain notification message, to indicate each node, receive according to each corresponding adjacent node, the acquisition request packet of transmit leg ID constantly, to the packet source, concentrated in its time sequence sets packet corresponding to packet ID of concentrating one by one;
The time series collection TS:{t of certain node for example
1, t
2, t
3, packet receives collection DS:{b
1, b
2, b
3And packet source collection SS:{s
1, s
2, s
3, platform in the packet to its transmission obtains notification message, indicates this node at t
1Constantly to adjacent node s
1Acquisition request packet b
1, at t
2Constantly to adjacent node s
2Acquisition request packet b
2, at t
31Constantly to adjacent node s
3Acquisition request packet b
3
Step 29, platform are at t
0N the packet that constantly step 21 is cut starts respectively to each host node transmission.
Described step 3 also includes:
Node obtains notification message according to the packet that platform sends, extract one by one each moment and corresponding transmit leg ID and packet ID thereof, and calculate network cost value between self node and adjacent node corresponding to transmit leg ID and the network cost value between self node and platform, select again minimum value, then constantly to minimum value corresponding adjacent node or platform, send data synchronization request at each, with the network cost value according to minimum, obtain the corresponding packet of packet ID.
Above are only preferred embodiment of the present invention, in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of making, be equal to replacement, improvement etc., within all should being included in the scope of protection of the invention.
Claims (10)
1. a P2P network file method of data synchronization, is characterized in that, includes:
Each node searching in step 1, network, and find then regularly the topological diagram of node around it to be sent to platform by the node be adjacent;
Step 2, platform be dyeing theory according to the map, pick out a node and its peripheral neighbor node as the host node in described communicating joint point diagram from the communicating joint point diagram that is formed by several connected nodes, and by the host node number, original is cut into a plurality of packets, then send a packet to each host node, notify simultaneously all nodes in the communicating joint point diagram to obtain all packets of original from its peripheral adjacent node;
Step 3, all nodes are notified according to platform, obtain respectively successively each packet of original from its peripheral adjacent node, and according to the data synchronization request of other nodes, the Packet Generation that self has been received is given other nodes, thereby realizes that the file data of all nodes in the communicating joint point diagram is synchronous.
2. method according to claim 1, is characterized in that, step 1 further includes:
Step 11, each node are monitored at a port, near and the node scanning, if near finding, the WIFI signal is arranged, access and to the listening port of the other side's node, send packet,, to find its adjacent node, then the information of adjacent node is sent to platform by certain synchronization of time intenals;
Step 12, platform are monitored at fixing port, and the information of the adjacent node that sends according to all nodes, calculate the topological diagram of all nodes;
Step 13, platform, according to the connectivity between node, are divided into several communicating joint point diagrams with the topological diagram of all nodes, and all nodes of each communicating joint point diagram are not connected with all nodes of other communicating joint point diagrams.
3. method according to claim 2, it is characterized in that, the information of described adjacent node includes signal power, network delay, the network bandwidth of node, described synchronization of time intenals carrys out the setup times value according to the place at node place, the sync interval time of the node of fixed-site is long, and the sync interval time of the node in mobile place is short.
4. method according to claim 2, is characterized in that, step 12 also includes:
Signal power to node arranges certain threshold value, and during lower than threshold value, two nodes are non-conterminous when the signal power between two nodes; During higher than threshold value, two nodes are adjacent when the signal power between two nodes.
5. method according to claim 1, is characterized in that, step 2 further includes:
Each node that step 21, platform calculate in the communicating joint point diagram arrives the network cost value sum of all neighbor nodes on every side, and select the node of a network cost value sum minimum and its peripheral neighbor node host node as the communicating joint point diagram, then dyeing theory according to the map, calculate each host node to described communicating joint point diagram at t
0The data package size value of constantly transmitting:
X wherein
iThe data package size value of platform to i host node transmission, p
iThe network cost value of i host node to platform,
Be the network cost value sums of all host nodes to platform, X is the original sizes values, and N is the host node number in the communicating joint point diagram, finally according at t
0The data package size value of each packet of transmission, cut into N packet with original constantly;
Step 22, platform are at t
0N the packet that constantly step 21 is cut starts respectively to each host node transmission.
6. method according to claim 5, is characterized in that, described network cost value is according to actual conditions, and the network bandwidth, network delay or the expense chosen between node are calculated.
7. method according to claim 5, is characterized in that, also includes between step 21 and 22:
Step (1), platform are that time series collection TS of each primary node constructs, packet receive collection DS and packet source collection SS, and, according to the network bandwidth and data package size value, calculate each host node and receive platform at t
0The moment of the packet that constantly transmits, and host node receive the packet that platform sends after, moment of continuing to receive from other host nodes other packets of originals, then time series collection, the packet that adds the time of reception of each packet of host node and corresponding packet ID and transmit leg ID to host node receives collection and concentrate in the packet source, wherein, TS:{t
1, t
2... t
NIn t
1, t
2..., t
NRespectively the moment that node receives each packet, DS:{b
1, b
2..., b
NIn b
1, b
2..., b
NRespectively that node is at t
1, t
2..., t
NConstantly received packet ID, SS:{s
1, s
2..., s
NIn s
1, s
2..., s
NRespectively the received packet b of node
1, b
2..., b
NTransmit leg ID;
Step (2), platform are from the adjacent node of the node that builds the time series collection of communicating joint point diagram, order is chosen a node that does not also build the 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 time series collection of extraction all nodes adjacent with described node, packet receive collection and packet source collection, then from the time series of all adjacent nodes of described node, concentrates and pick out a minimal instant T
min
Step (3), platform find minimal instant T
minThe adjacent node that place time series set pair is answered and the packet of adjacent node receive collection, count described adjacent node at minimal instant T
minAll packets that received, and judge that described adjacent node is at minimal instant T
minDoes 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 T
minIn all packets that received, deletion has been present in the concentrated packet of packet reception of described node, then continues step (4); If not, continue step (4);
Step (4), the described adjacent node of judgement are at minimal instant T
minAre all packets that received empty? if so, continue step (5); If not, from described adjacent node at minimal instant T
minIn all packets that received, random choose goes out a packet,, according to the file size value of the network bandwidth and the described packet of node and adjacent node, calculates from minimal instant T
minThe moment T that start to count, described node will receive described packet, time series collection, packet reception collection and the packet source of respectively the adjacent node of described packet ID, moment T and correspondence sequentially being added to described node are concentrated, continuation step (5);
All packets that step (5), the described node of statistics have received at moment T, and judge that described node has received all packets of original? if so, turn to step (6); If not, continue to concentrate and pick out a minimal instant T after T constantly from the time series of all adjacent nodes of described node
min, and turn to step (3);
Do step (6), platform judge whether all nodes in the communicating joint point diagram have all built the time series collection? if so, continue step (7); If not, turn to step (2);
Step (7), platform receive collection and packet source collection according to time series collection, the packet of all nodes, send packets to all nodes and obtain notification message, to indicate each node, receive according to each corresponding adjacent node, the acquisition request packet of transmit leg ID constantly, to the packet source, concentrated in its time sequence sets packet corresponding to packet ID of concentrating one by one.
8. method according to claim 7, is characterized in that, in step (1), for time series collection TS, packet reception collection DS and the packet source collection SS of host node, t
1The moment that host node receives the packet that platform sends, b
1The packet ID that platform sends to host node, s
1Platform ID, t
2..., t
NThe moment that host node receives the packet that other host nodes send, b
2..., b
NThat host node is at t
2..., t
NThe packet ID that other received host nodes of the moment send, s
2..., s
NTo send packet b
2..., b
NOther host nodes ID.
9. method according to claim 7, it is characterized in that, in step (2), platform is from the adjacent node of the node that builds the time series collection of communicating joint point diagram, and the path that arrives host node according to adjacent node comes order to choose a node that does not also build the time series collection.
10. method according to claim 1, is characterized in that, step 3 also includes:
Node obtains notification message according to the packet that platform sends, extract one by one each moment and corresponding transmit leg ID and packet ID thereof, and calculate network cost value between self node and adjacent node corresponding to transmit leg ID and the network cost value between self node and platform, select again minimum value, then constantly to minimum value corresponding adjacent node or platform, send data synchronization request at each, with the network cost value according to minimum, obtain the corresponding packet of packet ID.
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 true CN103391315A (en) | 2013-11-13 |
| CN103391315B CN103391315B (en) | 2016-05-04 |
Family
ID=49535470
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310263048.7A Expired - Fee Related 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) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105187465A (en) * | 2014-06-20 | 2015-12-23 | 中国科学院深圳先进技术研究院 | File sharing method, device and system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030198226A1 (en) * | 1999-09-29 | 2003-10-23 | Lars Westberg | Segmentation protocol that supports compressed segmentation headers |
| 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 |
-
2013
- 2013-06-27 CN CN201310263048.7A patent/CN103391315B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030198226A1 (en) * | 1999-09-29 | 2003-10-23 | Lars Westberg | Segmentation protocol that supports compressed segmentation headers |
| 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 |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105187465A (en) * | 2014-06-20 | 2015-12-23 | 中国科学院深圳先进技术研究院 | File sharing method, device and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103391315B (en) | 2016-05-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Song et al. | Content centric peer data sharing in pervasive edge computing environments | |
| CN101184037B (en) | Probability effective broadcast coefficient based flooding method | |
| CN103152284B (en) | A kind of router multipath exports method and the router of intelligent load equilibrium | |
| CN102244670B (en) | Idle node assistance method for P2P (peer-to-peer) file transmission | |
| CN101145976A (en) | Super-node selection and resource search method for peer network with node priority | |
| CN103037015A (en) | Active P2P data distribution method and node client-side | |
| CN102055655A (en) | System and method for broadcasting message in structural peer-to-peer network | |
| Shah et al. | An efficient unstructured p2p overlay over manet using underlying proactive routing | |
| CN102821115B (en) | A kind of method and apparatus of point-to-point P2P transfer resource | |
| Ren et al. | Joint social, energy and transfer rate to select cluster heads in D2D multicast communication | |
| Shah et al. | An efficient structured P2P overlay over MANET | |
| CN103391315A (en) | P2P (peer-to-peer) network file data synchronization method | |
| CN103037017A (en) | Passive P2P data distribution method and node client-side | |
| CN110139126B (en) | Mobile video system resource sharing method based on user interaction behavior perception | |
| CN102035894B (en) | Distance-based state synchronization method | |
| Srinivasan et al. | Demo abstract disseminate: A demonstration of device-to-device media dissemination | |
| Baumgärtner et al. | Speak less, hear enough: On dynamic announcement intervals in wireless on-demand networks | |
| Yuan et al. | Green content sharing mode: D2D coordination multiple points transmission | |
| Kawakami et al. | A load distribution method based on distributed hashing for P2P sensor data stream delivery system | |
| Lee et al. | A configuration scheme for connectivity-aware mobile P2P networks for efficient mobile cloud-based video streaming services | |
| Dandapat et al. | Framework for collaborative download in wireless mobile environment | |
| Oztoprak | fCDN: A novel-energy efficient content delivery architecture over next generation systems | |
| CN103596221A (en) | Data transmission method and system of mobile Ad Hoc network | |
| Song et al. | Pervasive edge data sharing in MANET | |
| Li et al. | An efficient clustering method for unstructured mobile peer-to-peer networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP02 | Change in the address of a patent holder |
Address after: 310013, Zhejiang, Xihu District, Wensanlu Road, No. 398, 4 floor, Hangzhou Patentee after: EB Information Technology Ltd. Address before: 100191 Beijing, Zhichun Road, No. 9, hearing the building on the floor of the 7 floor, Patentee before: EB Information Technology Ltd. |
|
| CP02 | Change in the address of a patent holder | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20160504 |