CN105072046B - A kind of delay-tolerant network congestion-preventing approach based on the forwarding of Token Control node concurrent data - Google Patents
A kind of delay-tolerant network congestion-preventing approach based on the forwarding of Token Control node concurrent data Download PDFInfo
- Publication number
- CN105072046B CN105072046B CN201510400346.5A CN201510400346A CN105072046B CN 105072046 B CN105072046 B CN 105072046B CN 201510400346 A CN201510400346 A CN 201510400346A CN 105072046 B CN105072046 B CN 105072046B
- Authority
- CN
- China
- Prior art keywords
- node
- data
- token
- dtn
- 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.)
- Active
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
Abstract
The present invention provides a kind of DTN congestion-preventing approach forwarded based on Token Control node concurrent data, this method is grouped network node, utilize periodically dynamic allocation token, and the division of priority is carried out to network packet interior joint, the node in grouping is set concurrently to forward data by the token allocation plan based on realization round-robin, to avoid the generation of congestion phenomenon in network by enhancing the condition of node for data forwarding.
Description
Technical field
The present invention relates to one kind in DTN networks congestion-preventing approach, more particularly to it is a kind of based on Token Control node simultaneously
Send out the delay-tolerant network congestion-preventing approach of data forwarding.
Background technology
Delay-tolerant network is a kind of new network, has high latency, interruption connectivity, topological mutability, node money
The features such as source is limited.In order to overcome these networks to limit, ensure that the arrival rate of message transmission, DTN are provided usually using transport layer
Service message is transmitted using " storage-carrying-forwarding " this mode with the trustship mechanism of hop to hop.However DTN
Have the characteristics that high latency, interruption connectivity, topological mutability, node resource are limited, this results in trustship node to be possible to
It needs to preserve the message received for a long time, to cope with the network delay being likely to occur and interruption, until receiving next-hop trustship
The confirmation message or message of node are passed to destination node.If trustship node cannot forward the message that it is received in time,
Network has a large amount of message to need forwarding in time again, then network can finally exhaust the storage resource of trustship node, causes network
Congestion.
Congestion in network is mainly derived from the lack of uniformity of Internet resources and network flow distribution.Limited money in network
Source is used by multiple users to share, due to not having acceptance controlling method, network that can not limit number of users according to resource situation；Separately
Outside due to lacking center control, network is also unable to control the quantity that user uses resource.When in network there are when excessive message,
The performance of network can decline, and network congestion is as shown in Figure 1.As shown in Fig. 1：Node c is trustship forward node.Node a,
B, c is formed by link 1, and node d, e, c are formed by link 2, and the destination node for sending message is node i, at this point, c to i
Link down, when the network operation is to certain phase, the trustship storage resource of node c is depleted, that is, network congestion has occurred.
And in Fig. 1, it is assumed that the link 3 being made of node f, g, h, c, the link 4 of node k, c composition, the destination node of transmission are
J, although at this point, node c is connected to the path of j, because node c storage resources are depleted, node c can not also complete to be connected to
Forwarding capability on path.The message copy high number generated under this mechanism, network overhead is excessively high, is easy due to node
Exhausting for resource and cause network congestion and finally influence message arrival rate.Traditional congestion control, which is not particularly suited for delay, to be held
Bear network.Therefore, for the DTN network environments of resource critical constraints, Congestion Avoidance and control, which how is effectively performed, becomes shadow
Ring one of the critical issue of network performance.
Solving congestion problems at present mainly has jamming control method and congestion-preventing approach.Congestion control mechanism mainly uses
Packet discard policy shifts message to solve congestion problems.Wherein dropping packets strategy includes mainly:(1)DROP FRONT
(DF), the longest message of queuing time in spatial cache is preferentially abandoned；(2) DROP LAST (DL), it is preferential to abandon in spatial cache
Recently received message；(3) DROP OLDST (DO), it is preferential to abandon remaining lifetime (TTL) shortest report in spatial cache
Text；(4) DROP YOUNGEST (DY), it is preferential to abandon remaining lifetime longest message in spatial cache.(5) N-DROP congestions control
Strategy processed is the message for abandoning hop count (hop count) first and being more than or equal to threshold value, if being still unsatisfactory for the storage demand of new message,
The maximum message of hop count is abandoned one by one again, until caching is enough to store new message.
Congestion avoidance mechanism is mainly the data transmission controlled by certain means in network, prevents the generation of congestion.
Mainly there are E.Coe, the Token Based that C.Raghavendra is proposed for the Congestion Avoidance correlative study of DTN work at present
Congestion Control for DTN methods, the core concept of this method is that token number is changeless in a network
In the case of, it is uniformly distributed initial token, node must possess token ability transmission data, and the node of no token is to borrow neighbor node
The mode transmission data of token.This method can be effectively prevented from network congestion, but since token number is limited, be susceptible to
Node is busy etc., to which data transmission is defined, while the addition of network node or exiting the mismatch for leading to token number and node,
To influence network performance, therefore its autgmentability is not strong.
Based on the above analysis, have for traditional congestion-preventing approach based on token：Data transmission is defined, network section
The mismatch for leading to token number and node is exited in the addition of point, leads to problems such as its autgmentability not strong.
Invention content
It is provided a kind of based on Token Control node the purpose of the invention is to avoid the generation of congestion phenomenon in network
The delay-tolerant network congestion-preventing approach of concurrent data forwarding.
The object of the present invention is achieved like this：
Step 1：Node in delay-tolerant network is grouped, every group of interior joint number is n, n ∈ N+, 0<n<L,
Middle L is to allow the most node numbers possessed, N in grouping+It is nature manifold；
Step 2：Cycle T=2t (L+1) of token is dynamically distributed in delay-tolerant network, wherein L is to allow to gather around in grouping
The most node numbers having, 2t be node obtain token after individual node have longest forwarding data time；
Step 3：According to DTN node packet numbering methods, to the node that is arbitrarily grouped in delay-tolerant network in I according to
The sequence of 1,2 ..., i ... N carry out number in group, are denoted as I (1), I (2) ..., I (i) ... I (n)；To grouping interior joint according to DTN
Node priority division methods carry out node priority division, and the size of node according to priority in delay-tolerant network is divided into one
Grade, two level, three-level；
Step 4：Token is distributed to numbering minimum node in being each grouped in delay-tolerant network；
Step 5：Node to obtaining token in delay-tolerant network carries out priority judgement, executes DTN node forwarding numbers
According to time allocation method used therein, the DTN node for data forwarding time allocation method used therein is：First nodes forward data within the 2t times；
Two level section forwards data within the t times；Three-level node forwards data within the 0.5t times；Wherein, 0.5t times interior nodes are at least
Complete a data forwarding；
Step 6：Judge whether the node for obtaining token has data forwarding, if without data forwarding, executes DTN orders
Board distribution method, if there is the next-hop node of data forwarding and this node has resource to receive this data, and next-hop node
Resource size be more than or equal to this data forwarding data size, then DTN data forwarding methods are executed, if there is data
It forwards and the next-hop node of this node does not have resource to receive this data, then execute DTN token distribution methods；
Step 7：Judge arbitrarily to be grouped whether I has new node addition in delay-tolerant network, if there is new node to be added point
Group I, then execute DTN number distribution methods, the DTN numbers distribution method is：For being arbitrarily grouped I interior joints number set A
It is：A={ I (1), I (2) ... I (i) ... I (n) } distributes to the node of the new addition if there is new node I (q) that grouping I is added
Number be：I (q)=max (q)+1, wherein q ∈ A, max (q) are the numbers of the largest number of node in set A, and this is new
The priority of the node of addition is set as level-one；
Step 8：The cycle T for judging dynamic allocation token in delay-tolerant network returns to step 1 if T is equal to 0,
Otherwise step 9 is executed；
Step 9：Judge whether delay-tolerant network also has data forwarding, if there is data forwarding, executes the DTN and enable
Board distribution method, otherwise turns to step 7.
The invention also includes some such structure features：
1. the node in delay-tolerant network, which is grouped, to be carried out according to the geographical location between node and node
It divides.
2. DTN nodes packet numbering method described in step 3 kind is：To the node that is arbitrarily grouped in I in a upper period
Number sorts from small to large：I(1)<I(2)<…<I(i)<…<I (n), the node that number is I (n) are in current period as most
No. 1 node of small number, the node that number is I (n-1) they are No. 2 nodes of current period, and so on, number is the node of (1) I
For the n nodes of current period.
3. DTN node priorities division methods described in step 3 kind are：Pass through nodal cache surplus ratioIt is big
Small to be judged, wherein Y is the caching total length of arbitrary node i in delay-tolerant network, and M is arbitrarily saved in delay-tolerant network
The caching of point i uses length, defines caching rateNode grade is the node of level-one, caching rate as priorityNode grade is the node of two level, caching rate as priorityNode as priority grade be three-level
Node.
4. DTN data forwarding methods described in step 6 is：If data forwarding carries out in the same grouping, forward
This data, if data forwarding does not carry out in the same grouping, the node occurred in different grouping is forwarded to the same node
Data are judged according to the node for receiving data：If the node for receiving data is purpose node, this number of preferential receipt
According to if the node for receiving data is the relay node of all nodes that forward data, it is high to receive sender's priority
The data of node receive the smaller data of data if the priority of sender is identical.
5. the node serial number set in arbitrarily grouping I is A={ I (1), I (2) ... I (i) ... I (n) }, wherein I (1)<I(2)
<…I(i)…<The node serial number for obtaining token is added in set B by I (n) after node obtains token, and composition obtained order
The number set of the node of board, then B={ I (1), I (2) ... I (i-1) }, then next node for obtaining token is remaining node
The minimum node of middle number, is denoted as min (r), wherein r ∈ (A-B), if the node in arbitrarily grouping I all obtained token, weighs
New to carry out token distribution, at this point, A-B=φ, then next node serial number for obtaining token is min (s), wherein s ∈ A.
Compared with prior art, the beneficial effects of the invention are as follows：The present invention has the advantage that：(1) present invention is by net
Network is grouped, and realizes Parallel transmutation data between grouping, data are concurrently forwarded in grouping, to realize that network data high-efficiency forwards.
(2) dynamically distribute token in each group, make network that there is preferable scalability, while being realized in grouping by Token Control
The time data of node forwards, and avoids in same group multiple nodes simultaneously to a node for data forwarding and the congestion that generates.
(3) make to have the node of higher priority that there is longer time to carry out data turn by the division of the priority to network node
There is the node of hair, lower priority the less time to carry out data forwarding, to avoid network that congestion occurs.The present invention passes through
Network node is grouped, using the strategy for periodically dynamically distributing token, and to network packet interior joint into row major
The division of grade makes the node in grouping concurrently forward data by the token allocation plan based on realization round-robin.
Description of the drawings
Fig. 1 be the present invention background technology in DTN congestion phenomenons example；
Fig. 2 is the particular flow sheet of the present invention；
Fig. 3 (A) is the frame diagram of the first group node in specific embodiments of the present invention, and Fig. 3 (B) is the specific reality of the present invention
The frame diagram of the second group node in example is applied, Fig. 3 (C) is the frame diagram of third group node in specific embodiments of the present invention.
Specific implementation mode
Present invention is further described in detail with specific implementation mode below in conjunction with the accompanying drawings.
In conjunction with Fig. 2, the invention is realized in this way：
Step 1：Nodes are grouped according to geographical location and nodes dense degree, according to node
It refers to being divided according to geographical location distance that geographical location between node, which divide, and neighbor node is divided into one group；Often
Group interior joint number is N, N ∈ N+, 0<N<L, L are to allow the most node numbers possessed in network packet.
Step 2：Cycle T=2t (L+1) of token is dynamically distributed in setting network, allows to possess in wherein L groupings
Most node numbers, 2t forward data time for the longest that individual node after node acquisition token has.
Step 3：According to DTN node packet numbering methods, to the node that is arbitrarily grouped in network in I according to from small to large
The sequence of 1,2 ... i ... n carries out number in group, is denoted as I (1), I (2) ... I (i) ... I (n).And grouping interior joint is saved according to DTN
Point method for dividing priorities carries out node priority division, and the size of nodes according to priority is divided into level-one, two level, three
Grade.Wherein, first nodes highest priority, three-level node priority are minimum.
Step 4：Token is distributed to numbering minimum node in being each grouped in network.
Step 5：Node to obtaining token in network carries out priority judgement, executes the DTN node for data forwarding times point
Method of completing the square.
Step 6：Judge whether the node for obtaining token has data forwarding, if there is under data forwarding and this node
One hop node has enough resources to receive this data, then executes DTN data forwarding methods, otherwise executes DTN token distribution methods.
Step 7：Judge arbitrarily to be grouped whether I has new node addition in network, if there is new node that grouping I is added, hold
Row DTN number distribution methods.
Step 8:Judge cycle T, returns to step 1 if T is equal to 0, otherwise execute step 9.
Step 9：Judge whether network also has data forwarding, DTN token distribution methods are executed if having, otherwise turns to step
Rapid seven.
The DTN node packet numbering methods being previously mentioned in abovementioned steps three further include：To the node that is arbitrarily grouped in I upper
Number in one period sorts from small to large：I(1)<I(2)<……I(i)……<I(n).The node that definition number is I (n) exists
For current period as No. 1 node of lowest number, the node that number is I (n-1) is No. 2 nodes of current period, and so on, it compiles
Number be the node of I (1) it is the n nodes of current period.Due to that may be enabled in a upper period number maximum number node I (n)
Board number is less, so being set to lowest number 1 in current period, the possibility of token number is obtained to increase it.
The DTN node priority division methods being previously mentioned in abovementioned steps three further include：Pass through nodal cache surplus ratioSize judged, wherein Y be network in arbitrary node i caching total length, M be network in arbitrary node i
Caching use length.ByIt can obtain, Y sizes are constant, and the smaller α of M are bigger, and network is less susceptible to that congestion, institute occurs
To define caching rateNode as priority grade be level-one node；Caching rateNode as excellent
First grade is the node of two level；Caching rateNode as priority grade be three-level node.
The DTN node for data forwarding time allocation method used thereins being previously mentioned in abovementioned steps five further include：First nodes are enabled
Bridge queen has the 2t times to forward data；Two-level node has the t times to forward data after obtaining token；Three-level node has after obtaining token
The 0.5t times forward data.Wherein, 0.5t times interior nodes at least complete a data forwarding.
The DTN data forwarding methods being previously mentioned in abovementioned steps six further include：If data forwarding is in the same grouping
It carries out, then normally forwards this data.If there is different grouping interior joint to same node for data forwarding, if receiving the section of data
Point is the destination node of a certain node in this sending node, then this data of preferential receipt.If the node for receiving data is institute
There is the relay node of the node of data to be forwarded, then receives the data of the high node of sender's priority.If sender's is preferential
Grade is identical, receives the smaller data of data.
The DTN token distribution methods being previously mentioned in abovementioned steps six further include：Assuming that the node serial number collection in arbitrary grouping I
Close A={ I (1), I (2) ... I (i) ... I (n) }, wherein I (1)<I(2)<... I (i) ... I (n), node obtain token
Afterwards, the node serial number for obtaining token is added in set B.If the current node serial number set B={ I for having obtained token
(1), (2) I ... I (i-1) }, then next node serial number for obtaining token is min (r), wherein r ∈ (A-B).If A-B=
φ, then next node serial number for obtaining token is min (s), wherein s ∈ A.
The DTN number distribution methods being previously mentioned in abovementioned steps seven further include：For arbitrary I grouping interior joint number set
For A={ I (1), I (2) ... I (i) ... I (n) } the number I (q) of the node is distributed to if there is new node that grouping I is added
=max (q)+1, wherein q ∈ A, and it is first nodes to be set to priority automatically.
For shown in Fig. 3 (A), Fig. 3 (B) and Fig. 3 (C), it is assumed that have 15 nodes in network, it is first determined token dynamic
Cycle T=2t (L+1) of distribution, wherein L are to allow the most node numbers possessed in grouping, and 2t is that node obtains list after token
The longest that a node has forwards data time.Nodes are grouped after determining cycle T, in this example according to section
The geographic area of point and the dense degree of node have divided in three groups, every group all nodes that there are five nodes.To every
Node in group numbered in group, and the number of the node in this example in grouping is all respectively 1-5, is with the first group node
Example, " (cluster1, id1) " represents first group of No. 1 node, and " (clusterz, idq) " represents the q nodes of z groups.
And priority division is carried out according to DTN node priority division methods to node, pass through nodal cache surplus ratio pair in this instance
Nodes carry out priority division.The number for being divided into first nodes has No. 1 and No. 4 of first group；No. 1 of second group
With No. 5；No. 5 of third group.The number of two-level node has No. 3 of first group；No. 3 of second group and No. 4；No. 1 of third group, 3
Number, No. 4.The number of three-level node has first group No. 2 and No. 5；No. 2 of second group；Third group 2.
Token is allocated to nodes, minimum node is numbered in every group and obtains token first.In this example
The node that every group of number is 1 obtains token first.Decision node priority determines that it obtains data forwarding after obtaining token
Time.First nodes have the 2t times to forward data after obtaining token, have the t times to forward data after two-level node acquisition token,
Three-level node after obtaining token there is the 0.5t times to forward data.Node obtain token after judge whether there is data need forward with
And the next-hop node for whether thering are enough resources to receive this data.If node does not have data forwarding or next node resource not
Allow to receive this data, then this node abandons data forwarding.Token, which then turns to be more than in this node serial number in grouping, numbers minimum
Node, if present node be this grouping in the largest number of node, token turn to this grouping in number minimum node.With
In first group for network node, the node that number is 1 first obtains token, since No. 1 node is first nodes, so obtaining
The 2t times carry out data forwarding.Then judge whether No. 1 node there are data to need to forward, if there is then judging that next-hop node is
It is no to there is resource to receive this data.If there is the reception of enough resources then carries out data forwarding, otherwise token turns to the section that number is 2
Point.After No. 5 nodes obtain token, if without data forwarding, token distributes to No. 1 node of this grouping.If occurring different
Interior joint is grouped to same node for data forwarding, and receiving node has resource to receive data.If the node for receiving data is certain
The destination node of one sending node, then this data of preferential receipt.If the node for receiving data is relay node, sender is received
The data of the high node of priority.Receive the smaller data of data if the priority of sender is identical.If the first group #
For 3 node, the second group # be 3 node, third group # be 2 node and meanwhile obtain token and have data respectively
The node that 100K, 200K, 300K are 1 to the second group # is sent, if the destination node for the node that third group # is 2 is the
The node that two group # are 1, and the node that the second group # is 1 has enough resources to receive this data, then and the second group # is 1
Node preferential receipt third group # be 2 node data.It is 3 that if the node that the second group # is 1, which is the first group #,
The relay node for the node that second group # is 3, third group # is 2, and the node that the second group # is 1 has enough resources to connect
Data are received, since the node priority that the first group # is 3 is higher than the node that third group # is 2, the data volume to be sent
It is less than the node that the second group # is 3, then the node transmission data that the first group # is 3 again, their two nodes execute DTN and enable
Board distribution method.
Judge arbitrarily to be grouped whether I has new node addition in network, if there is new node that grouping I is added, executes DTN volumes
Number distribution method.Number is set as No. 6 by the new node for being added second group in this example, and it is level-one that its priority, which is arranged,.
Judge whether the cycle T for dynamically distributing token is equal to 0.If being equal to 0, network again subregion and node are compiled
Number, priority divide, the distribution operations such as token.Otherwise judge whether network packet also has data forwarding, if having data forwarding
DTN token distribution methods are executed, the node to obtaining token in network carries out priority judgement, executes DTN node for data forwarding
The operations such as time allocation method used therein.If without data forwarding, judge whether there are the operations such as new node addition in grouping.
Claims (3)
1. a kind of delay-tolerant network congestion-preventing approach based on the forwarding of Token Control node concurrent data, it is characterised in that：
Step 1：Node in delay-tolerant network is grouped, every group of interior joint number is n, n ∈ N+, 0<n<L, wherein L are
Allow the most node numbers possessed, N in grouping+It is nature manifold；
Step 2：Cycle T=2t (L+1) of token is dynamically distributed in delay-tolerant network, allows to possess in wherein L groupings
Most node numbers, 2t be node obtain token after individual node have longest forwarding data time；
Step 3：According to DTN node packet numbering methods, to the node that is arbitrarily grouped in delay-tolerant network in I according to 1,
The sequence of 2 ..., i ... N carry out number in group, are denoted as I (1), I (2) ..., I (i) ... I (n)；Grouping interior joint is saved according to DTN
Point method for dividing priorities carries out node priority division, and the size of node according to priority in delay-tolerant network is divided into one
Grade, two level, three-level；
The DTN node priorities division methods are：Pass through nodal cache surplus ratioSize judged, wherein
Y is the caching total length of arbitrary node i in delay-tolerant network, and M is that the caching of arbitrary node i in delay-tolerant network uses length
Degree defines caching rateNode grade is the node of level-one, caching rate as priorityNode as excellent
First grade is the node of two level, caching rateNode as priority grade be three-level node；Step 4：Delay is held
Bear and numbers minimum node distribution token in being each grouped in network；
Step 5：Node to obtaining token in delay-tolerant network carries out priority judgement, when executing DTN node for data forwarding
Between distribution method, the DTN node for data forwarding time allocation method used therein is：First nodes forward data within the 2t times；Two level
Section forwards data within the t times；Three-level node forwards data within the 0.5t times；Wherein, 0.5t time interior nodes are at least completed
Data forwarding；
Step 6：Judge whether the node for obtaining token has data forwarding, if without data forwarding, executes DTN tokens point
Method of completing the square, if there is the next-hop node of data forwarding and this node has resource to receive this data, and the money of next-hop node
The size in source is more than or equal to the size of the data of this data forwarding, then DTN data forwarding methods is executed, if there is data forwarding
And the next-hop node of this node does not have resource to receive this data, then executes DTN token distribution methods；
The DTN data forwarding methods are：If data forwarding carries out in the same grouping, this data is forwarded, if number
It is not carried out in the same grouping according to forwarding, the node in different grouping occurs to the same node for data forwarding, according to reception
The node of data is judged：If the node for receiving data is purpose node, this data of preferential receipt, if receiving data
Node be all nodes that forward data relay node, then the data of the high node of sender's priority are received, if hair
The priority for the side of sending is identical, receives the smaller data of data；
The DTN token distribution methods are：Node serial number set in arbitrary grouping I is A={ I (1), I (2) ... I (i) ... I
(n) }, (1) wherein I<I(2)<…I(i)…<The node serial number for obtaining token is added to collection by I (n) after node obtains token
It closes in B, composition obtained the number set of the node of token, then B={ I (1), I (2) ... I (i-1) }, then next to be enabled
The node of board is that minimum node is numbered in remaining node, is denoted as min (r), wherein r ∈ (A-B), if the section in arbitrarily grouping I
Point all obtained token, then re-started token distribution, at this point, A-B=φ, then next node serial number for obtaining token is
Min (s), wherein s ∈ A；
Step 7：Judge arbitrarily to be grouped whether I has new node addition in delay-tolerant network, if there is new node that grouping I is added,
DTN number distribution methods are then executed, the DTN numbers distribution method is：It is for being arbitrarily grouped I interior joints number set A：A
={ I (1), I (2) ... I (i) ... I (n) } distributes to the volume of the node of the new addition if there is new node I (q) that grouping I is added
Number it is：I (q)=max (q)+1, wherein q ∈ A, max (q) are the numbers of the largest number of node in set A, and by the new addition
The priority of node be set as level-one；
Step 8：The cycle T for judging dynamic allocation token in delay-tolerant network returns to step 1, otherwise if T is equal to 0
Execute step 9；
Step 9：Judge whether delay-tolerant network also has data forwarding, if there is data forwarding, executes the DTN tokens point
Otherwise method of completing the square turns to step 7.
2. a kind of delay-tolerant network congestion based on the forwarding of Token Control node concurrent data according to claim 1 is kept away
Exempt from method, it is characterised in that：It is geography according between node and node that the node in delay-tolerant network, which is grouped,
Position is divided.
3. a kind of delay-tolerant network congestion based on the forwarding of Token Control node concurrent data according to claim 1 is kept away
Exempt from method, it is characterised in that：The packet numbering methods of DTN nodes described in step 3 are：To the node that is arbitrarily grouped in I upper one
Number in period sorts from small to large：I(1)<I(2)<…<I(i)<…<I (n), the node that number is I (n) are in current week
Phase, the node that number is I (n-1) was No. 2 nodes of current period as No. 1 node of lowest number, and so on, number I
(1) node is the n nodes of current period.
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 CN105072046A (en) | 2015-11-18 |
| CN105072046B true 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) |
Families Citing this family (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 |
| CN113315809B (en) * | 2021-04-22 | 2022-05-24 | 佛山市第二人民医院（佛山市便民医院） | 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 |
|---|
| Congestion Control in DTN;Peeyush Patil、等;《IPGCON-2015》;20150325;全文 * |
| Token Based Congestion Control for DTNs;Eric Coe,等;《2010 IEEE Aerospace Conference》;20100313;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105072046A (en) | 2015-11-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106411733B (en) | A kind of SDN dynamic load leveling dispatching method based on link real time load | |
| CN105337883B (en) | It is a kind of to support multiple services network-switching equipment and its implementation | |
| CN106533960A (en) | Data center network routing method based on Fat-Tree structure | |
| CN103607358B (en) | Dynamic ECMP method and system based on link utilization rate average sum | |
| CN104767694A (en) | Data stream forwarding method facing Fat-Tree data center network architecture | |
| CN105490962B (en) | A kind of QoS management methods based on OpenFlow networks | |
| CN105357124B (en) | A kind of MapReduce bandwidth optimization methods | |
| CN105072046B (en) | A kind of delay-tolerant network congestion-preventing approach based on the forwarding of Token Control node concurrent data | |
| CN110351187A (en) | Data center network Road diameter switches the adaptive load-balancing method of granularity | |
| CN102055675A (en) | Multipath routing distribution method based on load equilibrium | |
| CN108449269A (en) | Data center network load-balancing method based on SDN | |
| US20230096063A1 (en) | Communication method and apparatus | |
| CN101986628B (en) | Method for realizing multisource multicast traffic balance based on ant colony algorithm | |
| Wu et al. | Network congestion avoidance through packet-chaining reservation | |
| CN104754589B (en) | Dynamic networking method based on traffic aware | |
| Mallik et al. | A novel proposal to effectively combine multipath data forwarding for data center networks with congestion control and load balancing using Software-Defined Networking Approach | |
| CN106330710A (en) | Data stream scheduling method and device | |
| Jiao et al. | DTN routing with back-pressure based replica distribution | |
| US7460544B2 (en) | Flexible mesh structure for hierarchical scheduling | |
| JP2000092131A (en) | Maximum flow data path setting | |
| CN104954284B (en) | A kind of delay-tolerant network congestion-preventing approach towards probability routing | |
| CN110324249A (en) | A kind of dragonfly network architecture and its multicast route method | |
| Subramaniam et al. | Efficient buffer management protocol for multicast streaming in MANET | |
| Wang et al. | Improved power of two choices for fat-tree routing | |
| CN106789712B (en) | A kind of heuristic network load balancing method |
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 |
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 |
|
| CB03 | Change of inventor or designer information |