CN101854304A - Processing method of transferred message under memory route system in delay-tolerant network - Google Patents
Processing method of transferred message under memory route system in delay-tolerant network Download PDFInfo
- Publication number
- CN101854304A CN101854304A CN201010193485A CN201010193485A CN101854304A CN 101854304 A CN101854304 A CN 101854304A CN 201010193485 A CN201010193485 A CN 201010193485A CN 201010193485 A CN201010193485 A CN 201010193485A CN 101854304 A CN101854304 A CN 101854304A
- Authority
- CN
- China
- Prior art keywords
- message
- transferred
- stage
- node
- 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
Images
Abstract
The invention discloses a processing method of a transferred message under a memory route system in a delay-tolerant network, comprising the following steps: (1) direct forwarding step of looking up a table: after transferring a transferred message from a source node to an agent node, looking up the routing table of the agent node firstly; if the routing table has next hop of route path of the transferred message, sending the transferred message to the next hop; if the routing table does not have the next hop of route path of the transferred message, entering the step that the message waits to be gotten back; (2) waiting step at fixed time: waiting a massage sent by the source node to get back the message when the transferred message is in the agent node; (3) active inquiring step: alternately sending an inquiring massage package to the agent node by the source node according to certain time interval for judging the link breakage situation in the delay-tolerant network; and (4) message heavy-route forwarding step. The invention can effectively optimize the processing process of the transferred message so as to improve message transmission rate, lower time delay and prevent the generation of new congestion nodes.
Description
Technical field
The present invention is mainly concerned with field of network communication, refers in particular to the multistage processing method that is transferred message in a kind of delay-tolerant network.
Background technology
Existing Internet architecture and TCP/IP protocol suite and the improved many agreements of carrying out on this basis all can't well adapt to the network of long delay link and intermittent link, when the restriction of communication node energy and storage resources very has in limited time, problem will worsen more.In the challenge network environment, as the Ad-hoc net, wireless sensor network, military mobile network, satellite network etc., because the fast moving of node and the disruptive often of link, there is not the connection of " end-to-end " in the network, and the Local Area Network of many isomeries uses the exclusive agreement of oneself because independently use separately, be flooded with the variety of protocol standard in the network, make and realize relatively difficulty of network interconnection intercommunication, so need set up a kind of new network architecture, in order to satisfy in the reliable transmission that does not have the network message under the extremely limited condition of end-to-end connection and network node resource, this has just facilitated a kind of rise of the new network system that is called " delay-tolerant network " newly.Delay-tolerant network is Delay Tolerant Network again, it do not satisfy that end-to-end path exists and traditional Internet such as low delay in basic assumption, it has adopted the design of a series of Internet of being different from: data bundle replaces packet, reliable and secure hop-by-hop route (hop-by-hop) transmission to replace terminal-to-terminal service (end-to-end), replace route, part based on the address to connect network diagram replacement fully-connected network figure based on the route of title.Simultaneously, its agreement is on the basis that does not change the legacy network protocol architecture, between transport layer and application layer, added one " bundle (Bundle) layer ", the forwarding of the data bundle of use in " storage-forwarding " schema management heterogeneous network of information, especially adopt keeping to transmit (CustodyTransfer) mechanism and handle the internetwork frequent disconnection of challenge, high latency, isomerism and heterogeneity problems such as (asymmetry), guarantee the reliable transmission of communication data in complex network environment.The keeping transfer mechanism confirms to have realized reliability of data transmission by hop-by-hop, can discharge the trunk memory resource of communication node simultaneously as soon as possible, improves the utilance of network storage resource.But in order to satisfy persistent requirement, a communication node can not discharge does not usually finish the message that keeping transmits, therefore its memory faces final depleted danger, and this situation be easy to cause this communication node do not have enough memory resources go to bear afterwards must be by its other messages, even the output link of these messages be at that time available also can't allow it pass through should communication node, in some situation even may cause the link drop message, therefore because the memory resource of communication node exhausts, will inevitably cause the reduction of communication efficiency, the decline of communication quality.
The existing message processing policy that is transferred mainly is " Pull operation " in " Push-Pull operation ", be after source node stores resource pressure is alleviated to some extent, to send the Pull operation requests to agent node, agent node will be carried out the Pull operation after the request of receiving, send back source node with being transferred the message that comes.This method does not take into full account the characteristics that interrupt the chain Louis between the node that the dynamic mobility of delay-tolerant network node brings, and its intrinsic deficiency is arranged, and causes the message transmissions rate to descend easily and the appearance of new congested node.If because the time variation of delay-tolerant network topology, original link down, be transferred message and also wait for the Pull request of source node at agent node, and source node also can't find the position of its previous message that shifts, use the mode of sending out inundation inquiry bag to remove to seek other adjacent communication node, must finish to fetch being transferred the message operation, this situation will be considered as message by former custodial node and successfully be transmitted.Be transferred message and abandoned by agent node because of expiring life cycle the most at last, unless this link-recovery during this, but possibility is very little.
The existing main deficiency that is transferred the message processing policy:
(1) in the Push-Pull mechanism, agent node is received before the request of fetching, can judge whether to have the path of transmitting the message that is transferred according to former routing table information, and passive wait source node sends the Pull request, do not give the agent node mechanism that heavy-route is transmitted after link down, in the delay-tolerant network that intermittence connects, may cause message possibly can't send success, be dropped the most at last.
(2) initiatively inquiry is not machine-processed for agent node or source node, but sending the Pull request, passive wait source node fetches message, because the intermittence that delay-tolerant network connects, before fetching message, (compare) for a long time and be connected and interrupt with the stand-by period, and because initiatively inquiry is not machine-processed, source node and agent node all can't in time be learnt the link crack conditions before source node sends the Pull request, the time of this section useless waiting will be great waste so, strengthened the time delay of message transmissions, cause new congested node to occur, also may cause the overtime of message to abandon, the reliability of message transmissions can not get ensureing.
Summary of the invention
The technical problem to be solved in the present invention just is: the technical problem that exists at prior art, thereby the invention provides a kind ofly can effectively optimize the message transmissions rate that improves, reduce time delay the processing procedure that is transferred message, the processing method of transferred message under memory route system in the delay-tolerant network that the new congested node of prevention produces.
For solving the problems of the technologies described above, the present invention by the following technical solutions:
The processing method of transferred message under memory route system is characterized in that in a kind of delay-tolerant network, and step is:
(1) tables look-up the direct forwarding stage: after being transferred message and being transferred to agent node, at first the routing table of agent node is searched,, then will be transferred message and be sent to next jumping if there be next that be transferred message to jump routed path in the routing table from source node; If be not transferred next jumping routed path of message in the routing table then enter message and wait for the stage that is retrieved, message waits for that the stage that is retrieved comprises regularly loitering phase and initiatively inquire after the stage that described timing loitering phase is with initiatively the stage of inquiring after respectively accounts for half that the message wait is retrieved total stand-by period in stage;
(2) timing loitering phase: be transferred message and only wait for that in agent node source node sends the message of fetching message;
(3) initiatively inquire after the stage: alternately send to apply for information at interval according to certain hour by source node and wrap, in order to judge link crack conditions in the delay-tolerant network to agent node;
(4) the message heavy-route is transmitted the stage: when be transferred message wait for through the direct forwarding stage of tabling look-up, message be retrieved the stage after, this moment since total stand-by period expires or agent node and source node between the link fracture can't send back to and be transferred message, then start the heavy-route forwarding mechanism.
As a further improvement on the present invention:
In the described step (1), if in the routing table of agent node, found next the jumping routed path that is transferred message, then to be transferred message in message and the local storage carry out the message urgency, at the latest available route, message size, life cycle rest parameter comparison, meet the condition of preferential transmission then send to next jumping if this is transferred message, if do not meet preferential transmission condition, then be transferred message to be sent fetching such as agent nodes up to the requirement of source node transmission message.
In the described step (1), message waits for that being retrieved total stand-by period in stage is according to obtaining message remaining time life cycle and link down probability calculation.
In the described step (3), the described time interval is according to calculating message remaining time life cycle and network bandwidth occupancy.
In the described step (3), described transmission is applied for information and is comprised three message bags that need not to reply and the message bag that needs are replied; Initiatively inquiring after in the stage,, the message of fetching message is being attached in any one message bag sends to agent node if the source node free time.
In the described step (4), agent node has found the routed path that is transferred message, then other priority of messages relatively sends in message and the local storage according to being transferred, if priority is low, in waiting for the way, receive the message request of fetching that source node sends, then will be transferred message and beam back source node, otherwise be transferred message by the agent node forwarding; When the routed path that does not have to find to be transferred message, what be transferred that message will continue in agent node that the wait source node sends fetches message message, expires life cycle and is dropped up to message.
Compared with prior art, the invention has the advantages that:
1. the present invention adopts the multistage processing policy, utilized sufficiently and reasonably that to be transferred message priority, emergency not high, normally since the current time just can have the latest available forwarding route message (available at the latest route) and the longest life cycle message characteristics, based on time order and function only processing policy of each stage is combined, reach the optimization of utilization ratio of storage resources and message transmissions performance.
2. in the incipient stage of processing method of the present invention, judge whether to have the path that forwarding is transferred message, so just accelerate to be transferred message forwarding, reduced the message transmissions time delay, improved the transmission probability of message according to former routing table information; Transmit as soon as possible simultaneously, also be beneficial to the congestion condition of alleviating agent node itself.
3. the present invention adopts regularly waiting mechanism, it fully takes into account source node may have certain time delay from taking care of new start of heading to forwarding, as, this keeping message priority is all high unlike all messages that originally just have in the node, and cause the time delay of in formation, waiting for, inquire after and uneconomical so give out a contract for a project at the very start, and regularly loitering phase is not inquired after the transmission of data, reduced the expense of link and storage resources from another point of view, avoided new congested.
4. the present invention adopts the mechanism of initiatively inquiring after, having avoided waiting as long for source node like this fetches in the process of message, the agent node useless waiting time that the link premature interruption causes, agent node and source node can both in time be found link down, take next step operation, reduced the time delay of message transmissions.Another kind of situation is to have avoided link down time overlength, and message expires life cycle after the agent node stand-by period overlength, and the situation of dropping packets takes place.The mechanism of HELLO bag " 3 do not reply+1 reply " also meets the asymmetric characteristics of link in addition, is difficult for causing link to stop up relatively.
5. the present invention adopts rerouting mechanism, taken into full account that to be transferred message long life cycle, but route and node connect the characteristics of probability justice at the latest, this mechanism is not have on the basis of link in phase I strategy Central Plains routing table to implement, after adopting HELLO detective inquiry mechanism to learn link down, start rerouting mechanism immediately and seek the path, full powers replace source node that message is forwarded to destination node, reduce the packet loss rate, improve the reliability of message transmissions.
Description of drawings
Fig. 1 is the schematic flow sheet of processing method of the present invention.
Embodiment
Below with reference to Figure of description and specific embodiment the present invention is described in further details.
As shown in Figure 1, the processing method of transferred message under memory route system mainly comprises four-stage in the delay-tolerant network of the present invention, and it is respectively: the direct forwarding stage of tabling look-up, regularly loitering phase, initiatively inquire after stage and the message heavy-route forwarding stage.
Phase I: table look-up the direct forwarding stage;
Be transferred message w
iAfter successfully being transferred to agent node from source node n, at first the former routing table in the agent node is searched, be not transferred message w if find
iDirectly next jumping (perhaps next jumping is exactly a destination node) of transmitting, then enter message and wait for the stage that is retrieved, message waits for that the stage that is retrieved comprises regularly loitering phase and initiatively inquire after the stage, regularly loitering phase the and initiatively stage of inquiring after respectively accounts for half that the message wait is retrieved total stand-by period in stage.Regularly loitering phase promptly is transferred message w
iJust in the permanent memory of agent node, wait for after source node n frees out and send the message of fetching message.In the stand-by period, fetch message message as if receiving, then will be transferred message w
iBeam back source node n, otherwise will wait always by the time next operational phase of strategy just initiatively inquires after the stage.
If found in the former routing table in agent node and be transferred message w
iNext jumping of routed path, that will will be transferred message w
iJoin in the waiting list, compare with the local original message of agent node, consider the message urgency, at the latest available route, message size, life cycle parameter such as residue, judge whether preferential transmission.If meet preferential transmission condition, then send it to next jumping with destination node routing iinformation; Otherwise this is transferred message w
iMust continue to wait by the time all local message priorities all are lower than this and are transferred message w
iJust send behind the forwarding priority.In the stand-by period, even surpass message and wait for and be retrieved total stand-by period in stage.If be transferred message w
iPriority never meet and transmit rule, wait until never that also source node fetches the message of message, then directly change over to initiatively and inquire after the stage.
Second stage: timing loitering phase;
Fully take into account and be transferred message w
iNot high, the message of priority emergency life cycle long and have at the latest a characteristic such as route, allow it wait for that certain hour is rational, can also give the transmission use in advance of the high message of dispensing emergency strong precedence level more Internet resources like this, this moment, wait did not quietly have the transmission and the acceptance of apply for information bag, saved node resource and link circuit resource, also prevented increasing the weight of of Congestion Level SPCC from other one side.
Message waits for whether the reasonable value of total stand-by period in the stage that is retrieved is related to the time delay and the transfer rate of message, need take all factors into consideration message life cycle, the link down probability makes up the stand-by period.Regularly loitering phase is with initiatively the stage of inquiring after respectively accounts for half that the message wait is retrieved total stand-by period in stage.
If message waits for that being retrieved total stand-by period in stage is T
Time, message remaining time life cycle is T
Remain, link down probability P between source node and the agent node
Discont, then message waits for that being retrieved total stand-by period computing formula in stage is:
T
time＝(T
remain(1-P
discont))/2
Wherein, T
Remain=T
Survival-T
Current, T
SurvivalBe message expiration time life cycle, T
CurrentBe the current time; P
DiscontBelong to network and connect knowledge base, derive from the empirical value accumulation that network connects, this value is to utilize idle data updated, P as calculated and often on each node in the network-wide basis
Discont∈ [0,1], 1 expression link disconnects the probability maximum, and there is not link in (the each institute's interlude that upgrades of this value) always promptly for a long time, represents that link is unobstructed always for 0, and value is accurate to behind the decimal point one.
By above-mentioned formula as can be seen, work as P
DiscontIn the time of → 1, T
Time→ 0, when disconnecting probability and diminish gradually, the stand-by period can increase progressively in proportion, and here regulation maximum wait time can only be 1/2 of message remaining time life cycle.
Phase III: initiatively inquire after the stage;
After reasonably regularly waiting for, that does not still receive source node fetches message message, then enters source node and initiatively inquires the stage.Because the time variation of delay-tolerant network topology is connected the fair distribution of probability with network, after waiting for certain hour, the possibility that network connects fracture has just uprised, begin initiatively to inquire proper this moment, this stage mainly is the crack conditions of inquiring after path (link), can inquire after when fracture takes place most probable.If before the free time, inquired after link down at source node, source node is abandoned reclaiming this and is transferred message, and this moment, agent node was acted on behalf of the work of source node with full powers, implemented the next stage strategy, began heavy-route according to the destination node address in the message.
The acute variation of delay-tolerant network topology causes link often to interrupt, and the bandwidth of link forward channel is often greater than the bandwidth of backward channel in addition, usually differ tens times, even hundreds of times, because the bandwidth of backward channel is narrow, will cause the congested of response message, performance of transport protocols is descended.
In order to reduce the message transmissions time delay, the congested problem of the asymmetric response message that causes easily that improves the message forward rate and consider channel, existing P ull mechanism all are that agent node waits for that source node sends the message of fetching message.Source node sends to be fetched before the message, if link has disconnected, is transferred message w
iJust need not wait for, waste the time, occupy the space, and have only and wait for that link reconnects or be transferred message w because of the existence expiration abandons
iTherefore on existing P ull mechanism, for source node adds a kind of mechanism of initiatively inquiring after---mechanism is ask in the HELLO detective.When being transferred message w
iAfter successfully sending to agent node, behind table look-up direct forwarding stage and timing loitering phase, still be not forwarded away, also do not fetched by source node, begin to send HELLO and inquire after packets of information this moment.
Consider and to find link cracking situation and front and back bandwidth difference as early as possible to channel, the transmission of HELLO bag is defined as: send the HELLO bag by source node, the HELLO bag that 3 of the identical time-interleaved transmissions in interval need not to reply and 1 HELLO bag that needs are replied, obviously reduce the occupancy of backward channel, be fit to very much the asymmetric network of link.This method does not need agent node to reply, if agent node has continuous 3 time periods not receive that all the HELLO bag just illustrates that link has disconnected, this moment, agent node can know at once that link disconnects, and then taked the processing policy of next stage.And for source node, if regulation (3 do not need section turnaround time+1 needs section turnaround time+1 acknowledgement transmissions time) in 5 time periods is not all received response packet, illustrate that this moment, link disconnected, source node stops to send the HELLO bag, abandons being transferred message w
iRecovery, the carte blanches agent node is handled and to be transferred message w
iBefore link does not disconnect, if the source node free time, then need withdrawal to be transferred message, the request of fetching message can be loaded in any one the HELLO bag that is about to send and together send.
The form of Hello bag is as follows:
Source node HELLO machine contracting system initiatively, what mainly need consideration is the time interval that bag sends, because the consumption that can increase Internet resources is inquired after in the active of HELLO bag, the reasonable balance that is related to network bandwidth utilance and occupancy of the value in the time interval also is related to message transmissions time delay and efficient.This time interval value algorithm is as follows:
If network bandwidth occupancy P
Bandwidth, message remaining time life cycle is T
Remain, the time interval is T
Slot, make up algorithmic formula:
T
slot＝T
remain/((1-P
bandwidth)×10
n)
Wherein, P
BandwidthBelong to network and connect knowledge base, span is 0-1, and value is accurate to behind the decimal point one, and it is nervous more to be worth big more explanation bandwidth; T
Remain=T
Survival-T
Current, T
SurvivalBe message expiration time life cycle, T
CurrentBe the current time.
Because P
Bandwidth∈ (0,1), it directly as multiplier in order to message is remained T life cycle
RemainBe divided into plurality of sections and generate time interval T
SlotDo not meet actual conditions, need here this value is amplified, consider network bandwidth occupancy P
BandwidthTo the influence that n gets occurrence, get n=1/P
Bandwidth, work as P
BandwidthIn the time of → 1, the n value is from 10 values to 1 of successively decreasing.
By above-mentioned formula we as can be seen, work as P
BandwidthIn the time of → 1, along with the change macroreticular bandwidth of this value is nervous all the more, when reaching peaked, T
SlotAlso get maximum, expression is along with the raising of bandwidth usage, and the time interval that the message bag sends also will strengthen, and reduces bandwidth usage to send out the message bag less.
The quadravalence section: the message heavy-route is transmitted the stage;
When being transferred message w
iThrough the direct forwarding stage of tabling look-up, regularly loitering phase, initiatively inquire after the stage after, this moment since between agent node and the source node path rupture and can't send message back to.Owing to be transferred message w
iHave low priority, available route and long life cycle at the latest, do not take drop policy this moment at once, but adopt agent node according to being transferred message w
iIn the address information of destination node initiate path finding, will be transferred message w as much as possible
iSend to destination node.This is to have taken all factors into consideration the characteristic of message itself and the dynamic fairness of network linking (chance that each node meets in delay-tolerant network is impartial), therefore for being transferred message w
iOriginally do not arrive under the prerequisite of destination node routed path, after after a while, can find the probability of routed path to increase substantially from agent node, so carry out path finding is rational, also be to improve whole network message transfer rate, reduces congested and time delay than good strategy.Here the method for routing of taking is with the whole network route, if heavy-route does not find the path that arrives destination node, just abandon this and be transferred message w this moment
i
Below only be preferred implementation of the present invention, protection scope of the present invention also not only is confined to the foregoing description, and all technical schemes that belongs under the thinking of the present invention all belong to protection scope of the present invention.Should be pointed out that for those skilled in the art the some improvements and modifications not breaking away under the principle of the invention prerequisite should be considered as protection scope of the present invention.
Claims (6)
1. the processing method of transferred message under memory route system in the delay-tolerant network is characterized in that step is:
(1) tables look-up the direct forwarding stage: after being transferred message and being transferred to agent node, at first the routing table of agent node is searched,, then will be transferred message and be sent to next jumping if there be next that be transferred message to jump routed path in the routing table from source node; If be not transferred next jumping routed path of message in the routing table then enter message and wait for the stage that is retrieved, message waits for that the stage that is retrieved comprises regularly loitering phase and initiatively inquire after the stage that described timing loitering phase is with initiatively the stage of inquiring after respectively accounts for half that the message wait is retrieved total stand-by period in stage;
(2) timing loitering phase: be transferred message and only wait for that in agent node source node sends the message of fetching message;
(3) initiatively inquire after the stage: alternately send to apply for information at interval according to certain hour by source node and wrap, in order to judge link crack conditions in the delay-tolerant network to agent node;
(4) the message heavy-route is transmitted the stage: when be transferred message wait for through the direct forwarding stage of tabling look-up, message be retrieved the stage after, this moment since total stand-by period expires or agent node and source node between the link fracture can't send back to and be transferred message, then start the heavy-route forwarding mechanism.
2. the processing method of transferred message under memory route system in the delay-tolerant network according to claim 1, it is characterized in that: in the described step (1), if in the routing table of agent node, found next the jumping routed path that is transferred message, then the message that is transferred in message and the local storage is carried out the message urgency, available at the latest route, message size, life cycle rest parameter comparison, meet the condition of preferential transmission then send to next jumping if this is transferred message, if do not meet preferential transmission condition, then be transferred message to be sent fetching such as agent nodes up to the requirement of source node transmission message.
3. the processing method of transferred message under memory route system in the delay-tolerant network according to claim 1, it is characterized in that: in the described step (1), message waits for that being retrieved total stand-by period in stage is according to obtaining message remaining time life cycle and link down probability calculation.
4. the processing method of transferred message under memory route system in the delay-tolerant network according to claim 1 is characterized in that: in the described step (3), the described time interval is according to calculating message remaining time life cycle and network bandwidth occupancy.
5. the processing method of transferred message under memory route system in the delay-tolerant network according to claim 1, it is characterized in that: in the described step (3), described transmission is applied for information and is comprised three message bags that need not to reply and the message bag that needs are replied; Initiatively inquiring after in the stage,, the message of fetching message is being attached in any one message bag sends to agent node if the source node free time.
6. according to the processing method of transferred message under memory route system in claim 1 or 2 or 3 or the 4 or 5 described delay-tolerant networks, it is characterized in that: in the described step (4), agent node has found the routed path that is transferred message, then other priority of messages relatively sends in message and the local storage according to being transferred, if priority is low, in waiting for the way, receive the message request of fetching that source node sends, then will be transferred message and beam back source node, otherwise be transferred message by the agent node forwarding; When the routed path that does not have to find to be transferred message, what be transferred that message will continue in agent node that the wait source node sends fetches message message, expires life cycle and is dropped up to message.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101934852A CN101854304B (en) | 2010-06-09 | 2010-06-09 | Processing method of transferred message under memory route system in delay-tolerant network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010101934852A CN101854304B (en) | 2010-06-09 | 2010-06-09 | Processing method of transferred message under memory route system in delay-tolerant network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101854304A true CN101854304A (en) | 2010-10-06 |
| CN101854304B CN101854304B (en) | 2012-07-18 |
Family
ID=42805580
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010101934852A Expired - Fee Related CN101854304B (en) | 2010-06-09 | 2010-06-09 | Processing method of transferred message under memory route system in delay-tolerant network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101854304B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102752799A (en) * | 2012-06-29 | 2012-10-24 | 中国联合网络通信集团有限公司 | Routing method, device and system for delay tolerant network |
| CN108667746A (en) * | 2018-04-03 | 2018-10-16 | 北京理工大学 | A method of it is delayed in tolerant network in deep space and realizes service priority |
| CN114612049A (en) * | 2022-05-11 | 2022-06-10 | 弥费实业(上海)有限公司 | Path generation method and device, computer equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040042402A1 (en) * | 1997-02-11 | 2004-03-04 | Claude Galand | Method and system for a local and fast non-disruptive path switching in high speed packet switching networks |
| CN1798086A (en) * | 2004-12-29 | 2006-07-05 | 中兴通讯股份有限公司 | Method of transmission control for adaptation layer 2 in asynchronous transfer mode |
| CN101304380A (en) * | 2008-06-30 | 2008-11-12 | 杭州华三通信技术有限公司 | Traffic transmission method of elastic packet loop and elastic packet loop node |
| CN101436980A (en) * | 2007-11-12 | 2009-05-20 | 中国科学院计算机网络信息中心 | Generation of data packet forwarding table by flooding method |
| CN101515892A (en) * | 2009-04-10 | 2009-08-26 | 华为技术有限公司 | Method for realizing multi-resource processing in peer-to-peer network, equipment and system thereof |
-
2010
- 2010-06-09 CN CN2010101934852A patent/CN101854304B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040042402A1 (en) * | 1997-02-11 | 2004-03-04 | Claude Galand | Method and system for a local and fast non-disruptive path switching in high speed packet switching networks |
| CN1798086A (en) * | 2004-12-29 | 2006-07-05 | 中兴通讯股份有限公司 | Method of transmission control for adaptation layer 2 in asynchronous transfer mode |
| CN101436980A (en) * | 2007-11-12 | 2009-05-20 | 中国科学院计算机网络信息中心 | Generation of data packet forwarding table by flooding method |
| CN101304380A (en) * | 2008-06-30 | 2008-11-12 | 杭州华三通信技术有限公司 | Traffic transmission method of elastic packet loop and elastic packet loop node |
| CN101515892A (en) * | 2009-04-10 | 2009-08-26 | 华为技术有限公司 | Method for realizing multi-resource processing in peer-to-peer network, equipment and system thereof |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102752799A (en) * | 2012-06-29 | 2012-10-24 | 中国联合网络通信集团有限公司 | Routing method, device and system for delay tolerant network |
| CN102752799B (en) * | 2012-06-29 | 2015-07-22 | 中国联合网络通信集团有限公司 | Routing method, device and system for delay tolerant network |
| CN108667746A (en) * | 2018-04-03 | 2018-10-16 | 北京理工大学 | A method of it is delayed in tolerant network in deep space and realizes service priority |
| CN108667746B (en) * | 2018-04-03 | 2020-06-16 | 北京理工大学 | Method for realizing service priority in deep space delay tolerant network |
| CN114612049A (en) * | 2022-05-11 | 2022-06-10 | 弥费实业(上海)有限公司 | Path generation method and device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101854304B (en) | 2012-07-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110139319B (en) | Routing method for minimizing transmission delay of high dynamic delay network | |
| EP2421205B1 (en) | Flooding-based routing protocol having average-rate and burst-rate control | |
| US8811379B2 (en) | Control apparatus and control method | |
| CN102595504B (en) | Dynamic multi-path OLSR (Optimized Link State Routing) routing method based on link congestion degree | |
| CN101932062B (en) | Multipath routing method in Ad Hoc network environment | |
| JP2014027548A (en) | Base station device, radio terminal device, and packet distribution method | |
| CN102883397B (en) | Data forwarding method of delay/disruption tolerant network (DTN) facing space environment | |
| CN103546377B (en) | A kind of Delay Tolerant Network data transmission method based on improving transmission probability estimation | |
| CN104010343A (en) | Wireless network optimization method for intelligent meter reading system | |
| Tran et al. | Routing with congestion awareness and adaptivity in mobile ad hoc networks | |
| Rault et al. | WSN lifetime optimization through controlled sink mobility and packet buffering | |
| CN106953803A (en) | A kind of improvement probabilistic routing method based on deep space delay-tolerant network | |
| CN104717238A (en) | Ant colony algorithm-based distributed service composition method in mobile ad hoc network | |
| CN103402234A (en) | Data aggregation method of wireless sensor network | |
| CN103974365A (en) | Ad Hoc mobile network route restoring method | |
| CN108462983B (en) | Multi-robot communication networking method based on improved ant colony AODV protocol | |
| CN101854304B (en) | Processing method of transferred message under memory route system in delay-tolerant network | |
| Ahmad et al. | Congestion avoidance and fairness in wireless sensor networks | |
| CN103560947B (en) | A kind of method and device avoiding intermediate system neighborhood to shake | |
| CN104735743A (en) | Routing optimization method for embedded wireless self-organized network | |
| CN104883304A (en) | Method for routing part entangled quantum pair bridging communication network | |
| CN101262430A (en) | A distributed keeping alive routing device and method | |
| WO2013129670A1 (en) | Terminal, route generation method, and route generation program | |
| CN102595552B (en) | Packet radio network on-demand routing maintenance method based on adaptive dynamic mechanism | |
| CN104243353A (en) | Network transmission energy reserving method and system and network transmission method and system |
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 | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120718 Termination date: 20140609 |