CN105072046A - Delay tolerant network congestion prevention method based on data concurrence and forwarding by token control node - Google Patents
Delay tolerant network congestion prevention method based on data concurrence and forwarding by token control node Download PDFInfo
- Publication number
- CN105072046A CN105072046A CN201510400346.5A CN201510400346A CN105072046A CN 105072046 A CN105072046 A CN 105072046A CN 201510400346 A CN201510400346 A CN 201510400346A CN 105072046 A CN105072046 A CN 105072046A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- token
- grouping
- delay
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a delay tolerant network congestion prevention method based on data concurrence and forwarding by token control nodes. The method includes the steps: grouping network nodes, dynamically distributing a token through periodicity, dividing the grouped nodes according to priority, and enabling the nodes in the groups to carry out data concurrence and forwarding through a token distribution scheme based on timeslice cycling. Therefore, network congestion is prevented by increasing node data forwarding conditions.
Description
Technical field
The present invention relates to one congestion-preventing approach in DTN network, particularly relate to a kind of delay-tolerant network congestion-preventing approach forwarded based on Token Control node concurrent data.
Background technology
Delay-tolerant network is a kind of new network, features such as having high latency, be interrupted connectivity, topological mutability, node resource are limited.In order to overcome the restriction of these networks, ensureing the arrival rate of transmission of messages, the service that DTN uses transport layer to provide usually, with the trustship of hop to hop mechanism, adopting " storing-carry-forwarding " this mode to transmit message.But the feature such as DTN has high latency, is interrupted connectivity, topological mutability, node resource are limited, this just causes trustship node likely to need to preserve the message received for a long time, deal with the network delay and interruption that may occur, until receive the confirmation of down hop trustship node or message is passed to destination node.If trustship node can not forward its message received in time, network has again a large amount of messages to need to forward in time, and so network finally can exhaust the storage resources of trustship node, causes network congestion.
The congested lack of uniformity being mainly derived from Internet resources and network traffics distribution in network.Resource limited in network is shared by multiple user and is used, and owing to not having acceptance controlling method, network cannot according to resource situation limited subscriber quantity; In addition owing to lacking center-control, network also uncontrollable user uses the quantity of resource.When there is too much message in network, the performance of network can decline, and network congestion as shown in Figure 1.As shown in Figure 1: node c is trustship forward node.The link 1 that node a, b, c are formed, the link 2 that node d, e, c are formed, the destination node sending message is node i, now, the link down of c to i, when the network operation is to certain phase, the trustship storage resources of node c is depleted, namely there occurs network congestion.And in FIG, suppose the link 3 be made up of node f, g, h, c, the link 4 of node k, c composition, the destination node sent is j, now, although the path of node c and j is communicated with, but because node c storage resources is depleted, node c also cannot complete the forwarding capability on communication path.The message copy high number produced under this mechanism, network overhead is too high, easily causes network congestion due to exhausting of node resource and the final arrival rate affecting message.Traditional congestion control is not also suitable for delay-tolerant network.Therefore, for the DTN network environment of resource critical constraints, how effectively to carry out Congestion Avoidance and control to become one of key issue affecting network performance.
Current solution congestion problems mainly contains jamming control method and congestion-preventing approach.Congestion control mechanism mainly adopts packet discard policy or transfer message to solve congestion problems.Wherein dropping packets strategy mainly comprises: (1) DROPFRONT (DF), preferentially abandons the message that in spatial cache, queuing time is the longest; (2) DROPLAST (DL), preferentially abandons the up-to-date message received in spatial cache; (3) DROPOLDST (DO), preferentially abandons in spatial cache and remains lifetime (TTL) the shortest message; (4) DROPYOUNGEST (DY), preferentially abandons in spatial cache and remains lifetime most long message.(5) N-DROP congestion control policy first abandons the message that hop count (jumping figure) is more than or equal to threshold value, if still do not meet the storage demand of new message, then abandons the maximum message of hop count one by one, until buffer memory is enough to store new message.
Congestion avoidance mechanism mainly by the transfer of data in certain means net control, prevents congested generation.Congestion Avoidance correlative study work at present for DTN mainly contains E.Coe, the TokenBasedCongestionControlforDTN method that C.Raghavendra proposes, the core concept of this method is in a network in the changeless situation of token number, be uniformly distributed initial token, node must have token could send data, and the node without token sends data in the mode of using neighbor node token.This method can avoid network congestion effectively, but due to token number limited, easily occur that node is busy etc., thus data transmission is defined, the simultaneously interpolation or exit of network node causes not mating of token number and node, thus affects network performance, and therefore its autgmentability is not strong.
Based on above analysis, have for traditional congestion-preventing approach based on token: data send and are defined, the interpolation of network node or exit causes not mating of token number and node, causes the problems such as its autgmentability is not strong.
Summary of the invention
The object of the invention is the generation of congestion phenomenon in network and a kind of delay-tolerant network congestion-preventing approach forwarded based on Token Control node concurrent data is provided.
The object of the present invention is achieved like this:
Step one: divide into groups to the node in delay-tolerant network, often organizing interior joint number is n, n ∈ N
+, 0<n<L, wherein L is the maximum node numbers allowing in grouping to have, N
+it is nature manifold;
Step 2: the cycle T=2t (L+1) of dynamic assignment token in delay-tolerant network, wherein L is the maximum node numbers allowing in grouping to have, and 2t is the longest forwarding data time that after node obtains token, individual node has;
Step 3: according to DTN node grouping method for numbering serial, to the node divided into groups in I arbitrarily in delay-tolerant network according to 1,2 ... i ... the order of N carries out organizing interior numbering, is designated as I (1), I (2) ..., I (i) ... I (n); To grouping interior joint carry out node priority division according to DTN node priority division methods, the size according to priority of the node in delay-tolerant network be divided into one-level, secondary, three grades;
Step 4: number minimum peer distribution token in grouping each in delay-tolerant network;
Step 5: priority judgement is carried out to the node obtaining token in delay-tolerant network, perform DTN node for data forwarding time allocation method used therein, described DTN node for data forwarding time allocation method used therein is: first nodes is forwarding data within the 2t time; Secondary joint forwarding data within the t time; Three grades of nodes forwarding data within the 0.5t time; Wherein, 0.5t time interior nodes at least completes a data retransmission;
Step 6: judge whether the node obtaining token has data retransmission, if there is no data retransmission, then perform DTN token distribution method, if have data retransmission and the next-hop node of this node has resource to receive this data, and the size of the resource of next-hop node is more than or equal to the size of the data of this data retransmission, then perform DTN data forwarding method, if having data retransmission and the next-hop node of this node does not have resource to receive this data, then perform DTN token distribution method;
Step 7: judge in delay-tolerant network, whether grouping I has new node to add arbitrarily, if there is new node will add grouping I, then perform DTN numbering distribution method, described DTN numbering distribution method is: for dividing into groups arbitrarily, I interior joint numbering set A is: A={I (1), I (2) ... I (i) ... I (n) }, if there is new node I (q) to add grouping I, the numbering then distributing to the node that this newly adds is: I (q)=max (q)+1, wherein q ∈ A, max (q) is the numbering of numbering maximum node in set A, and the priority of the node this newly added is set to one-level,
Step 8: the cycle T judging dynamic assignment token in delay-tolerant network, if T equals 0, turns back to step one, otherwise performs step 9;
Step 9: judge whether delay-tolerant network also has data retransmission, if there is data retransmission, then performs described DTN token distribution method, otherwise turns to step 7.
The present invention also comprises some architectural features like this:
1. carrying out grouping to the node in delay-tolerant network described in is divide according to node and internodal geographical position.
2. described in step 3 kind, DTN node grouping method for numbering serial is: sorted from small to large to the numbering of node in a upper cycle in any grouping I: I (1) <I (2) < ... <I (i) < ... <I (n), the node being numbered I (n) is as lowest number No. 1 node at current period, the node being numbered I (n-1) is No. 2 nodes of current period, the like, the node being numbered I (1) is the n node of current period.
3. described in step 3 kind, DTN node priority division methods is: by nodal cache surplus ratio
size judge, wherein Y is the buffer memory total length of arbitrary node i in delay-tolerant network, and M is that the buffer memory of arbitrary node i in delay-tolerant network uses length, definition buffer memory rate
node be node, the buffer memory rate of one-level as priority
node as priority be secondary node, buffer memory rate
node be the node of three grades as priority.
4. the data forwarding method of DTN described in step 6 is: if data retransmission carries out in same grouping, then forward these data, if data retransmission does not carry out in same grouping, node in appearance different grouping is to same node for data forwarding, judge according to the node receiving data: if node for the purpose of the node of reception data, then these data of preferential receipt, if the node receiving data is all via nodes wanting the node of forwarding data, then receive the data of the high node of transmit leg priority, if the priority of transmit leg is identical, accept the data that data are less.
5. the node serial number set of dividing into groups in I is A={I (1) arbitrarily, I (2) ... I (i) ... I (n) }, wherein I (1) <I (2) < ... I (i) ... <I (n), after node obtains token, the node serial number obtaining token is added in set B, composition obtained the numbering set of the node of token, then B={I (1), I (2) ... I (i-1) }, then the next node obtaining token numbers minimum node in residue node, be designated as min (r), wherein r ∈ (A-B), if the node arbitrarily in grouping I all obtained token, then re-start token to distribute, now, A-B=φ, then the next node serial number obtaining token is min (s), wherein s ∈ A.
Compared with prior art, the invention has the beneficial effects as follows: the advantage that the present invention has: (1) the present invention passes through network packet, realize Parallel transmutation data between grouping, concurrent forwarding data in grouping, thus realize network data high-efficiency forwarding.(2) dynamic distribution token in each group, network is made to have good extensibility, realized the time data forwarding of grouping interior nodes by Token Control, that avoids multiple node in same group to produce to a node for data forwarding is congested simultaneously simultaneously.(3) make the node with higher priority have the longer time by the division of the priority to network node and carry out data retransmission, the node of lower priority has the less time and carries out data retransmission, thus it is congested to avoid network to occur.The present invention, by dividing into groups to network node, utilizes the strategy of periodically dynamic assignment token, and network packet interior joint is carried out to the division of priority, by making the concurrent forwarding data of the node in grouping based on the token allocative decision realizing round-robin.
Accompanying drawing explanation
Fig. 1 is the example of DTN congestion phenomenon in background technology of the present invention;
Fig. 2 is particular flow sheet of the present invention;
Fig. 3 (A) is the frame diagram of the first group node in specific embodiments of the invention, Fig. 3 (B) is the frame diagram of the second group node in specific embodiments of the invention, and Fig. 3 (C) is the frame diagram of the 3rd group node in specific embodiments of the invention.
Embodiment
Below in conjunction with accompanying drawing and embodiment, the present invention is described in further detail.
Composition graphs 2, the present invention is achieved in that
Step one: divide into groups to nodes according to geographical position and nodes dense degree, carries out division according to node and internodal geographical position and refers to and to divide according to geographical position distance, neighbor node is divided into one group; Often organizing interior joint number is N, N ∈ N
+, 0<N<L, L are the maximum node numbers allowing in network packet to have.
Step 2: the cycle T=2t (L+1) of dynamic assignment token in setting network, wherein L is the maximum node numbers allowing in grouping to have, and 2t is the longest forwarding data time that after node obtains token, individual node has.
Step 3: according to DTN node grouping method for numbering serial, to the node in network arbitrarily in grouping I according to from small to large 1,2 ... i ... the order of n carries out organizing interior numbering, is designated as I (1), I (2) ... I (i) ... I (n).And to grouping interior joint carry out node priority division according to DTN node priority division methods, nodes size be according to priority divided into one-level, secondary, three grades.Wherein, first nodes priority is the highest, and three grades of node priorities are minimum.
Step 4: number minimum peer distribution token in grouping each in network.
Step 5: carry out priority judgement to the node obtaining token in network, performs DTN node for data forwarding time allocation method used therein.
Step 6: judge whether obtain the node of token has data retransmission, if having data retransmission and the next-hop node of this node has enough resources to receive this data, then performs DTN data forwarding method, otherwise performs DTN token distribution method.
Step 7: judge in network, whether grouping I has new node to add arbitrarily, if there is new node will add grouping I, then perform DTN numbering distribution method.
Step 8: judge cycle T, if T equals 0, turns back to step one, otherwise performs step 9.
Step 9: judge whether network also has data retransmission, if having, performs DTN token distribution method, otherwise turns to step 7.
The DTN node grouping method for numbering serial mentioned in abovementioned steps three also comprises: sorted from small to large to the numbering of node in a upper cycle in any grouping I: I (1) <I (2) < ... I (i) ... <I (n).The node that definition is numbered I (n) at current period as lowest number No. 1 node, the node being numbered I (n-1) is No. 2 nodes of current period, the like, the node being numbered I (1) is the n node of current period.Less due to token number of times may be obtained in upper cycle numbering maximum number node I (n), so be set to lowest number 1 in current period, thus increase the possibility that it obtains token number of times.
The DTN node priority division methods mentioned in abovementioned steps three also comprises: by nodal cache surplus ratio
size judge, wherein Y is the buffer memory total length of arbitrary node i in network, M be arbitrary node i in network buffer memory use length.By
can obtain, Y size is constant, and the less α of M is larger, and network is more less likely to occur congested, so definition buffer memory rate
node be the node of one-level as priority; Buffer memory rate
node as priority be secondary node; Buffer memory rate
node be the node of three grades as priority.
The DTN node for data forwarding time allocation method used therein mentioned in abovementioned steps five also comprises: first nodes has 2t time forwarding data after obtaining token; Two-level node has t time forwarding data after obtaining token; 0.5t time forwarding data is had after three grades of nodes obtain token.Wherein, 0.5t time interior nodes at least completes a data retransmission.
The DTN data forwarding method mentioned in abovementioned steps six also comprises: if data retransmission carries out in same grouping, then normally forward these data.If occur, different grouping interior joint is to same node for data forwarding, if the node receiving data is the destination node of a certain node in this sending node, then and these data of preferential receipt.If the node receiving data is all via nodes wanting the node of forwarding data, then receive the data of the high node of transmit leg priority.If the priority of transmit leg is identical, accept the data that data are less.
The DTN token distribution method mentioned in abovementioned steps six also comprises: suppose the node serial number set A={ I (1) divided into groups arbitrarily in I, I (2) ... I (i) ... I (n) }, wherein I (1) <I (2) < ... I (i) ... I (n), after node obtains token, the node serial number obtaining token is added in set B.The node serial number set B of token={ I (1), I (2) has been obtained if current ... I (i-1) }, then the next node serial number obtaining token is min (r), wherein r ∈ (A-B).If A-B=is φ, then the next node serial number obtaining token is min (s), wherein s ∈ A.
The DTN numbering distribution method mentioned in abovementioned steps seven also comprises: gather for A={I (1) for any I grouping interior joint numbering, I (2) ... I (i) ... I (n) }, if there is new node to add grouping I, then distribute to numbering I (the q)=max (q)+1 of this node, wherein q ∈ A, and to be automatically set to priority be first nodes.
Example is depicted as with Fig. 3 (A), Fig. 3 (B) and Fig. 3 (C), suppose in network, there are 15 nodes, first cycle T=the 2t (L+1) of token dynamic assignment is determined, wherein L is the maximum node numbers allowing in grouping to have, and 2t is the longest forwarding data time that after node obtains token, individual node has.After determining cycle T, nodes is divided into groups, according to the geographic area of node and the dense degree of node, three groups have been divided to nodes in this example, often in group, have five nodes.To the interior numbering of node group in every group, the numbering of the node in this example in grouping is all respectively 1-5, for the first group node, " (cluster1; id1) " represents No. 1 node of first group, and " (clusterz, idq) " represents the q node of z group.And according to DTN node priority division methods, priority division is carried out to node, by nodal cache surplus ratio, priority division is carried out to nodes in this instance.The numbering being divided into first nodes has first group No. 1 and No. 4; No. 1 of second group and No. 5; 3rd group No. 5.The numbering of two-level node has No. 3 of first group; No. 3 of second group and No. 4; 3rd group No. 1, No. 3, No. 4.The numbering of three grades of nodes has first group No. 2 and No. 5; Second group No. 2; 3rd group No. 2.
Distribution token is carried out to nodes, often numbers minimum node in group and first obtain token.First the node being numbered 1 often organized in this example obtains token.After obtaining token, decision node priority determines that it obtains the time of data retransmission.First nodes has 2t time forwarding data after obtaining token, and two-level node has t time forwarding data after obtaining token, has 0.5t time forwarding data after three grades of nodes obtain token.Node judges whether after obtaining token that data need forward and whether have enough resources to accept the next-hop node of these data.If node does not have data retransmission or next node resource not to allow to receive this data, then this node abandons data retransmission.Token then turns in grouping to be greater than in this node serial number numbers minimum node, if present node is number maximum node in this grouping, then token turns in this grouping and numbers minimum node.For network node in first group, the node being first numbered 1 obtains token, because No. 1 node is first nodes, so obtain the 2t time to carry out data retransmission.Then judge whether No. 1 node has data to need to forward, if had, judges whether next-hop node has resource to receive this data.If there are enough resources to receive, carry out data retransmission, otherwise token turns to the node being numbered 2.After No. 5 nodes obtain token, if do not have data retransmission, then token distributes to No. 1 node of this grouping.If occur, different grouping interior joint is to same node for data forwarding, and receiving node has resource to receive data.If the node receiving data is the destination node of a certain sending node, then these data of preferential receipt.If the node receiving data is via node, then receive the data of the high node of transmit leg priority.If the priority of transmit leg is identical, accept the data that data are less.The node that token also has data 100K respectively if the node that the node that the node that the first group # is 3, the second group # are 3, the 3rd group # are 2 obtains simultaneously, 200K, 300K are 1 to the second group # sends, if the destination node that the 3rd group # is the node of 2 is the second group # be 1 node, and the node that the second group # is 1 has enough resources to receive this data, then the data of the second group # to be node preferential receipt the 3rd group # of 1 be node of 2.The via node of be the 3, second group # to be the 3, the 3rd group # be if the node that the second group # is 1 is the first group # node of 2, and the node that the second group # is 1 has enough resources to receive data, the node priority being 3 due to the first group # is the node of 2 higher than the 3rd group #, the data volume sent is less than again the node that the second group # is 3, then the first group # is the node transmission data of 3, and its their two node performs DTN token distribution method.
Judge in network, whether grouping I has new node to add arbitrarily, if there is new node will add grouping I, then perform DTN numbering distribution method.Numbering is set to No. 6 by the node newly adding second group in this example, and to arrange its priority be one-level.
Judge whether the cycle T of dynamic assignment token equals 0.If equal 0, then to network again subregion, and node serial number, priority divide, distribute the operation such as token.Otherwise judge whether network packet also has data retransmission, if there is data retransmission, performs DTN token distribution method, carries out priority judgement to the node obtaining token in network, perform the operations such as DTN node for data forwarding time allocation method used therein.If there is no data retransmission, then judge whether have the operations such as new node adds in grouping.
Claims (6)
1., based on the delay-tolerant network congestion-preventing approach that Token Control node concurrent data forwards, it is characterized in that:
Step one: divide into groups to the node in delay-tolerant network, often organizing interior joint number is n, n ∈ N
+, 0<n<L, wherein L is the maximum node numbers allowing in grouping to have, N
+it is nature manifold;
Step 2: the cycle T=2t (L+1) of dynamic assignment token in delay-tolerant network, wherein L is the maximum node numbers allowing in grouping to have, and 2t is the longest forwarding data time that after node obtains token, individual node has;
Step 3: according to DTN node grouping method for numbering serial, to the node divided into groups in I arbitrarily in delay-tolerant network according to 1,2 ... i ... the order of N carries out organizing interior numbering, is designated as I (1), I (2) ..., I (i) ... I (n); To grouping interior joint carry out node priority division according to DTN node priority division methods, the size according to priority of the node in delay-tolerant network be divided into one-level, secondary, three grades;
Step 4: number minimum peer distribution token in grouping each in delay-tolerant network;
Step 5: priority judgement is carried out to the node obtaining token in delay-tolerant network, perform DTN node for data forwarding time allocation method used therein, described DTN node for data forwarding time allocation method used therein is: first nodes is forwarding data within the 2t time; Secondary joint forwarding data within the t time; Three grades of nodes forwarding data within the 0.5t time; Wherein, 0.5t time interior nodes at least completes a data retransmission;
Step 6: judge whether the node obtaining token has data retransmission, if there is no data retransmission, then perform DTN token distribution method, if have data retransmission and the next-hop node of this node has resource to receive this data, and the size of the resource of next-hop node is more than or equal to the size of the data of this data retransmission, then perform DTN data forwarding method, if having data retransmission and the next-hop node of this node does not have resource to receive this data, then perform DTN token distribution method;
Step 7: judge in delay-tolerant network, whether grouping I has new node to add arbitrarily, if there is new node will add grouping I, then perform DTN numbering distribution method, described DTN numbering distribution method is: for dividing into groups arbitrarily, I interior joint numbering set A is: A={I (1), I (2) ... I (i) ... I (n) }, if there is new node I (q) to add grouping I, the numbering then distributing to the node that this newly adds is: I (q)=max (q)+1, wherein q ∈ A, max (q) is the numbering of numbering maximum node in set A, and the priority of the node this newly added is set to one-level,
Step 8: the cycle T judging dynamic assignment token in delay-tolerant network, if T equals 0, turns back to step one, otherwise performs step 9;
Step 9: judge whether delay-tolerant network also has data retransmission, if there is data retransmission, then performs described DTN token distribution method, otherwise turns to step 7.
2. a kind of delay-tolerant network congestion-preventing approach forwarded based on Token Control node concurrent data according to claim 1, is characterized in that: described to carry out grouping to the node in delay-tolerant network be divide according to node and internodal geographical position.
3. a kind of delay-tolerant network congestion-preventing approach forwarded based on Token Control node concurrent data according to claim 1, it is characterized in that: described in step 3 kind, DTN node grouping method for numbering serial is: the numbering of node in a upper cycle in any grouping I was sorted from small to large: I (1) <I (2) < ... <I (i) < ... <I (n), the node being numbered I (n) is as lowest number No. 1 node at current period, the node being numbered I (n-1) is No. 2 nodes of current period, the like, the node being numbered I (1) is the n node of current period.
4. a kind of delay-tolerant network congestion-preventing approach forwarded based on Token Control node concurrent data according to claim 1, is characterized in that: described in step 3 kind, DTN node priority division methods is: by nodal cache surplus ratio
size judge, wherein Y is the buffer memory total length of arbitrary node i in delay-tolerant network, and M is that the buffer memory of arbitrary node i in delay-tolerant network uses length, definition buffer memory rate
node be node, the buffer memory rate of one-level as priority
node as priority be secondary node, buffer memory rate
node be the node of three grades as priority.
5. a kind of delay-tolerant network congestion-preventing approach forwarded based on Token Control node concurrent data according to claim 1, it is characterized in that: the data forwarding method of DTN described in step 6 is: if data retransmission carries out in same grouping, then forward these data, if data retransmission does not carry out in same grouping, node in appearance different grouping is to same node for data forwarding, judge according to the node receiving data: if node for the purpose of the node of reception data, then these data of preferential receipt, if the node receiving data is all via nodes wanting the node of forwarding data, then receive the data of the high node of transmit leg priority, if the priority of transmit leg is identical, accept the data that data are less.
6. a kind of delay-tolerant network congestion-preventing approach forwarded based on Token Control node concurrent data according to claim 1, it is characterized in that: the described DTN token distribution method in step 6 is: the node serial number set arbitrarily in grouping I is A={I (1), I (2) ... I (i) ... I (n) }, wherein I (1) <I (2) < ... I (i) ... <I (n), after node obtains token, the node serial number obtaining token is added in set B, composition obtained the numbering set of the node of token, then B={I (1), I (2) ... I (i-1) }, then the next node obtaining token numbers minimum node in residue node, be designated as min (r), wherein r ∈ (A-B), if the node arbitrarily in grouping I all obtained token, then re-start token to distribute, now, A-B=φ, then the next node serial number obtaining token is min (s), wherein s ∈ A.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510400346.5A CN105072046B (en) | 2015-07-09 | 2015-07-09 | A kind of delay-tolerant network congestion-preventing approach based on the forwarding of Token Control node concurrent data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510400346.5A CN105072046B (en) | 2015-07-09 | 2015-07-09 | A kind of delay-tolerant network congestion-preventing approach based on the forwarding of Token Control node concurrent data |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105072046A true CN105072046A (en) | 2015-11-18 |
| CN105072046B CN105072046B (en) | 2018-07-31 |
Family
ID=54501332
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510400346.5A Active CN105072046B (en) | 2015-07-09 | 2015-07-09 | A kind of delay-tolerant network congestion-preventing approach based on the forwarding of Token Control node concurrent data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105072046B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108566415A (en) * | 2018-03-12 | 2018-09-21 | 广东睿江云计算股份有限公司 | A kind of Distributed concurrency control method based on web |
| CN108881049A (en) * | 2018-09-26 | 2018-11-23 | 南京邮电大学 | A kind of congestion control policy based on Epidemic routing |
| CN113315809A (en) * | 2021-04-22 | 2021-08-27 | 佛山市第二人民医院（佛山市便民医院） | High-speed data transmission delay tolerance method and system for medical equipment |
-
2015
- 2015-07-09 CN CN201510400346.5A patent/CN105072046B/en active Active
Non-Patent Citations (2)
| Title |
|---|
| ERIC COE,等: "Token Based Congestion Control for DTNs", 《2010 IEEE AEROSPACE CONFERENCE》 * |
| PEEYUSH PATIL、等: "Congestion Control in DTN", 《IPGCON-2015》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108566415A (en) * | 2018-03-12 | 2018-09-21 | 广东睿江云计算股份有限公司 | A kind of Distributed concurrency control method based on web |
| CN108881049A (en) * | 2018-09-26 | 2018-11-23 | 南京邮电大学 | A kind of congestion control policy based on Epidemic routing |
| CN113315809A (en) * | 2021-04-22 | 2021-08-27 | 佛山市第二人民医院（佛山市便民医院） | High-speed data transmission delay tolerance method and system for medical equipment |
| CN113315809B (en) * | 2021-04-22 | 2022-05-24 | 佛山市第二人民医院（佛山市便民医院） | High-speed data transmission delay tolerance method and system for medical equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105072046B (en) | 2018-07-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106027416B (en) | A kind of data center network traffic scheduling method and system based on space-time combination | |
| CN105897575A (en) | Path computing method based on multi-constrained path computing strategy under SDN | |
| CN102726009B (en) | Data flow exchange control method and relative device | |
| Ghaffari et al. | Energy-efficient and QoS-aware geographic routing protocol for wireless sensor networks | |
| CN105490962A (en) | QoS management method based on OpenFlow network | |
| CN110351187A (en) | Data center network Road diameter switches the adaptive load-balancing method of granularity | |
| CN101986628B (en) | Method for realizing multisource multicast traffic balance based on ant colony algorithm | |
| CN106209627A (en) | Vehicle-mounted distributing based on node-node transmission ability focuses on Routing Protocol method | |
| CN105072046A (en) | Delay tolerant network congestion prevention method based on data concurrence and forwarding by token control node | |
| CN105407048A (en) | Delay tolerant network node cache management method facing epidemic and probabilistic hybrid routing | |
| Wang et al. | Load balancing for heterogeneous traffic in datacenter networks | |
| Jiao et al. | DTN routing with back-pressure based replica distribution | |
| Ghaderi et al. | Connection-level scheduling in wireless networks using only MAC-layer information | |
| CN100486219C (en) | A method to realize the end-to-end stream transmission | |
| CN113162863B (en) | Fair multipath routing method based on wheel disc algorithm | |
| CN104954284B (en) | A kind of delay-tolerant network congestion-preventing approach towards probability routing | |
| CN102497325B (en) | DTN routing method based on reliable information distribution | |
| Subramaniam et al. | Efficient buffer management protocol for multicast streaming in MANET | |
| Scheuermann et al. | Backpressure multicast congestion control in mobile ad-hoc networks | |
| Jagadev et al. | A survey on bandwidth management in manet | |
| Hua et al. | A DTN congestion mechanism based on Distributed Storage | |
| Marchang et al. | Hop-Based dynamic fair scheduler for wireless Ad-Hoc networks | |
| CN102006243B (en) | Method for sending congestion messages | |
| Banerjee et al. | Delay-efficient energy and velocity conscious non-preemptive scheduler (DEV-NS) for mobile ad hoc networks | |
| Kakaraparthi et al. | Efficient message scheduling in ad hoc 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CB03 | Change of inventor or designer information | ||
| CB03 | Change of inventor or designer information |
Inventor after: Feng Guangsheng Inventor after: Wang Hezhe Inventor after: Wang Huiqiang Inventor after: Lv Hongwu Inventor after: Guo Fangfang Inventor after: Lin Junyu Inventor after: Zhang Xianlong Inventor after: Hu Yibing Inventor after: Song Jian Inventor before: Lv Hongwu Inventor before: Wang Hezhe Inventor before: Wang Huiqiang Inventor before: Feng Guangsheng Inventor before: Guo Fangfang Inventor before: Lin Junyu Inventor before: Zhang Xianlong Inventor before: Hu Yibing Inventor before: Song Jian |