CN104243224A - Detecting method for routing loop and device thereof - Google Patents
Detecting method for routing loop and device thereof Download PDFInfo
- Publication number
- CN104243224A CN104243224A CN201310227098.XA CN201310227098A CN104243224A CN 104243224 A CN104243224 A CN 104243224A CN 201310227098 A CN201310227098 A CN 201310227098A CN 104243224 A CN104243224 A CN 104243224A
- Authority
- CN
- China
- Prior art keywords
- packet
- node
- flex point
- described packet
- route
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
An embodiment of the invention provides a detecting method for a routing loop and a device thereof. The detecting method comprises the steps of: determining whether a local node is an inflection point according to an expected routing expenditure of a data packet and an expenditure of a selected path by a local node for the data packet; if the local node is the inflection point, marking the data packet; and if the data packet which is marked by the local node is received, determining occurrence of the routing loop. The detecting method and the device provided by the embodiment of the invention effectively prevents resource wastage caused by routing loop and ensures normal operation of a network.
Description
Technical field
The present invention relates to the communications field, particularly relate to detection method and the device of the route loop in a kind of Ad Hoc network.
Background technology
When packet is propagated in Wireless Ad Hoc network, the forwarding of multiple node is usually needed to arrive destination node.When packet is repeated to forward by a series of node mutually, it has just been absorbed in route loop.By unlimited forwarding, but destination node will cannot be arrived by the packet of route loop.If can not solve route loop problem in time, it will cause the waste of the communication resource, and affect the normal work of network.
Convention resolution method adopts history information table to detect route loop usually.The information of the packet that the in store node of history information table sent.If node receives a packet, but the information of this packet has appeared in history information table, then show have route loop to exist.In conventional method, all nodes on the routed path of packet all need the information of this packet to be stored in history information table.So although the history information table in conventional method can detect and solve route loop problem, when data volume in network is very large, history information table will take a large amount of internal memories.
Above it should be noted that, just conveniently to technical scheme of the present invention, clear, complete explanation is carried out to the introduction of technical background, and facilitate the understanding of those skilled in the art to set forth.Only can not think that technique scheme is conventionally known to one of skill in the art because these schemes have carried out setting forth in background technology part of the present invention.
Summary of the invention
The main purpose of the embodiment of the present invention is the detection method and the device that provide a kind of route loop, to avoid the wasting of resources caused because there is route loop.
The above-mentioned purpose of the embodiment of the present invention is achieved by the following technical solution:
A node in Ad Hoc network, wherein, described node comprises:
Resolution unit, it resolves the information in the packet received;
Judging unit, according to the flex point list in described packet or the flex point relevant information in history information table, it judges whether described node carried out mark to described packet;
Processing unit, it was when described node carried out mark to described packet, determined route loop occurs.
A detection method for route loop, wherein, described method comprises:
Judge whether local node is flex point according to the cost that the expectation Metric of the packet received and local node are the route that described packet is selected;
If local node is flex point, then described packet is marked;
If receive the packet that local node is labeled, then determine to there occurs route loop.
The beneficial effect of the embodiment of the present invention is, by the method and apparatus of the embodiment of the present invention, avoiding the wasting of resources caused because there is route loop, ensure that the normal work of network.
With reference to explanation hereinafter and accompanying drawing, disclose in detail particular implementation of the present invention, specifying principle of the present invention can adopted mode.Should be appreciated that, thus embodiments of the present invention are not restricted in scope.In the spirit of claims and the scope of clause, embodiments of the present invention comprise many changes, amendment and are equal to.
The feature described for a kind of execution mode and/or illustrate can use in one or more other execution mode in same or similar mode, combined with the feature in other execution mode, or substitutes the feature in other execution mode.
Should emphasize, term " comprises/comprises " existence referring to feature, one integral piece, step or assembly when using herein, but does not get rid of the existence or additional of one or more further feature, one integral piece, step or assembly.
Accompanying drawing explanation
With reference to following accompanying drawing a lot of aspects that the present invention may be better understood.Parts in accompanying drawing are not proportional draftings, and just in order to illustrate principle of the present invention.For the ease of illustrating and describing some parts of the present invention, in accompanying drawing, corresponding part may be exaggerated or reduce.The element described in an accompanying drawing of the present invention or a kind of execution mode and feature can combine with the element shown in one or more other accompanying drawing or execution mode and feature.In addition, in the accompanying drawings, similar label represents parts corresponding in several accompanying drawing, and can be used for instruction more than the corresponding component used in a kind of execution mode.
In the accompanying drawings:
Fig. 1 is the flow chart of the route loop detection method of the embodiment of the present invention;
Fig. 2 a is the flow chart that in example one, source node sends an execution mode of packet;
Fig. 2 b is the flow chart that in example one, source node sends another execution mode of packet;
Fig. 3 is the flow chart of example one routing nodes forwarding data bag;
Fig. 4 a is the flow chart that in example two, source node sends an execution mode of packet;
Fig. 4 b is the flow chart that in example two, source node sends another execution mode of packet;
Fig. 5 is the flow chart of example two routing nodes forwarding data bag;
Fig. 6 is the renewal flow chart of history information table in example two;
Fig. 7 is the composition schematic diagram of the node of the embodiment of the present invention.
Embodiment
With reference to accompanying drawing, by specification below, the aforementioned and further feature of the embodiment of the present invention will become obvious.These execution modes are exemplary, are not limitations of the present invention.
In order to enable those skilled in the art to easily to understand principle of the present invention and execution mode, the embodiment of the present invention is described for Ad-hoc network, but be appreciated that, the embodiment of the present invention is not limited to Ad-hoc network, such as, the method and apparatus that the embodiment of the present invention provides also is applicable to other multihop networks such as sensor network.
In Ad hoc network, routing table stores the routing iinformation of node.Embodiment of the present invention supposition node has router-table structure as shown in table 1.In Table 1, node N
i(i=1 .., n) is the neighbor node of present node.Data can be directly transmitted to any one neighbor node by present node.As can be seen from Table 1, present node is through node N
1forwarding data is to node N
dest, the Metric of needs is C
1; Through N
nforwarding data is to node N
dest, the Metric of needs is C
n.Usually, the routed path that sensor selection problem Metric is minimum carries out data retransmission.
Table 1: the structure of routing table
In embodiments of the present invention, flex point refers to that the cost for the route of packet selection is more than or equal to the node of the expectation Metric of this packet.Such as, node N receives needs forwarding data bag, and the expectation cost of packet is C
1, the cost that node N is the route that this packet is selected by table of query and routing is C
2if, C
2>=C
1, then node N is flex point; Otherwise node N is not flex point.
With reference to the accompanying drawings the preferred embodiment of the present invention is described.
Embodiment 1
Embodiments provide a kind of detection method of route loop.Fig. 1 is the flow chart of the method, please refer to Fig. 1, and the method comprises:
Step 101: judge whether local node is flex point according to the cost that the expectation Metric of the packet received and local node are the route that described packet is selected;
Wherein, local node can be that described packet selects the minimum route of Metric by table of query and routing, and by the cost of the expectation Metric of comparing data bag and the route of selection, determines whether local node is flex point.
Wherein, if the cost of the route selected is more than or equal to the Metric of expectation, then think that local node is flex point, that is, this packet forwarded through this node is also likely returned, thus forms route loop, affects the normal work of network; If the cost of the route selected is less than the Metric of expectation, then think that local node is not flex point.
Step 102: if local node is flex point, then described packet is marked;
Wherein, by the judgement of step 101, if confirm that local node is flex point, then need to mark this packet, and then forward the packet marked.Reason is, local node is the Metric that the Metric of route that this packet is selected is more than or equal to this packet and expects, this packet is caused likely to be forwarded, thus generation route loop, by marking this packet, can confirm whether the packet received once was forwarded, thus determine whether route loop to occur, for subsequent treatment provides foundation.
Wherein, by the judgement of step 101, if confirm that local node is not flex point, then forward this packet in a conventional manner, such as, revise the sending node address (LS) in this packet, receiving node address (LD) and expect Metric (Cost) and forward.
Wherein, will be described following the mode that packet marks.
Step 103: if receive the labeled packet of local node, then determine to there occurs route loop.
Wherein, after determining to there occurs route loop, can perform and solve the operation of route loop, such as, abandon described packet, upgrade routing table, or forwarding data bag etc. again.
In above embodiment, local node is after receiving packet, determine whether to mark this packet according to the flex point whether local node is this packet, but, the present embodiment is not in this, as restriction, in other examples, a node also can directly mark the packet that it generates, to carry out the detection of route loop, such as, certain node marks the packet that it generates, and namely judges to there occurs route loop once receive its labeled packet.Wherein, except the packet generated it marks, the Metric that this packet is expected also can be added in this packet by this node simultaneously, so that the node receiving this packet can determine whether it is the flex point of this packet accordingly.
Wherein, because the method according to step 102 marks the packet that route loop may occur, or according to preceding method, the packet generated is marked, then local node is when receiving a packet, can judge whether local node carried out mark to this packet, if carried out mark, then illustrate local node once this packet forwarded over or this packet be exactly the local packet generated, also namely there occurs route loop.Because once forwarded over or sent this packet, now, local node can be selected to lose this packet, does not do any process to it.If through judging to confirm that local node did not carry out mark to this packet, then continue the process of step 101 ~ 102, also namely by selecting route to confirm whether this locality is flex point for this packet, thus forward again after this packet being marked when local node is flex point, directly forward this packet when local node is not flex point.In the process of forwarding data bag (forward the packet after marking or forward unlabelled packet), the Metric of this packet can be added in this packet by this node, so that according to step 101, the node receiving this packet can determine whether itself is flex point.
Wherein, because the mode that marks packet is different, then judge that whether the packet that receives is that the mode of the labeled packet of local node is also different, specifically will be described following.
In the execution mode of step 102, if local node is flex point, then can mark this packet, in embodiments of the present invention, provide two kinds of labeling methods, a kind of is join in the flex point list of described packet by the information of local node, and another is joined in the flex point relevant information of flex point history information table the information of described packet.By these two kinds of methods, this packet is marked, when local node receives this packet again, this packet forwarded over can be confirmed thus, also namely define route loop, in order to avoid affecting the normal work of network, can select to abandon this packet.
Wherein, the method for aforementioned two kinds of flag data bags just illustrates, the embodiment of the present invention is not in this, as restriction, and any method marked packet under the spiritual guidance of the embodiment of the present invention is all contained in the protection range of the embodiment of the present invention.
In the present embodiment, if a kind of method marks packet before adopting, also namely by the flex point list that the information of local node joined packet, packet is marked, then in step 103, when the information of local node is arranged in the flex point list of the packet received, confirm that the packet that receives is the labeled packet of local node, also namely local node carried out mark to this packet.
In the present embodiment, the frame structure of this packet is as shown in table 2.
Table 2: data packet frame structure
| GS | GD | LS | LD | Cost | No | TP | Seq | Len | Data |
Wherein, GS (Global Source) is the address of source node; GD (Global Destination) is the address of destination node; LS (Local Source) is the address of sending node; LD (Local Destination) is the address of receiving node; Cost is the Metric expected; No is the number of flex point; TP (Turning Point) is flex point information list (being called for short flex point list); Seq (Sequence) is the sequence number of packet; Len (Length) is the length of data area; Data is data field.
In the present embodiment, in packet, the concrete structure of TP data segment is as shown in table 3.
Table 3:TP data segment structure
| TP_1 | TP_2 | ... | TP_No |
Wherein, TP_i(i=1,2 ... No) be the flex point information of i-th flex point.This flex point information can comprise the address of flex point.
In the present embodiment, when a node receives a packet, when finding that local node is flex point by the judgement of step 101, then its relevant information is put into the flex point list of this packet by this node, this completes the mark (step 102) to this packet.Afterwards, when this node receives a packet again, and its address is when being arranged in the flex point list of this packet, then confirm to carry out mark to this packet, also i.e. once this packet forwarded over, now this node can perform the operation solving route loop, such as, abandon this packet (step 103).
Wherein, the structure of the TP data segment shown in table 3 just illustrates, the embodiment of the present invention is not in this, as restriction.Such as, in other implementations, each flex point corresponding, can comprise the address of this flex point and the address of receiving node (this flex point forwards receiving node during this packet).Also namely, when this node marks this packet, not only the address of oneself is put into the flex point list of this packet, the address of the receiving node of this packet is also put into the flex point list of this packet simultaneously.Thus, when a node receives a packet, then when its address is arranged in the flex point list of this packet, confirm once to carry out mark to this packet.Meanwhile, receiving node address when forwarding this packet last time can be obtained from the flex point list of node.Packet is transmitted to this receiver address and there occurs route loop, therefore can upgrade the routing iinformation of this receiving node, such as increase the Metric etc. of this receiving node.
In the present embodiment, if a kind of method marks packet after adopting, also namely by the history information table that the information of packet joined flex point, packet is marked, then in step 103, when the information of the packet received is arranged in the history information table of flex point, confirm that the packet that receives is the labeled packet of local node, also namely local node carried out mark to this packet.
In the present embodiment, the frame structure of this packet is as shown in table 4.
Table 4: data packet frame structure
| GS | GD | LS | LD | Cost | Seq | Len | Data |
Wherein, GS (Global Source) is the address of source node; GD (Global Destination) is the address of destination node; LS (Local Source) is the address of sending node; LD (Local Destination) is the address of receiving node; Cost is the Metric expected; Seq (Sequence) is the sequence number of packet; Len (Length) is the length of data area; Data is data field.
In the present embodiment, the structure of the history information table of flex point is as shown in table 5.
Table 5: historical information list structure
| GS | Seq start | Seq end | LD | UT |
| N 1 | S 1 | E 1 | D 1 | T 1 |
| ... | ... | ... | ... | ... |
| N n | S n | E n | D n | T n |
Wherein, GS (Global Source) is the source node address of packet; Seq
start(Start Sequence) start sequence number; Seq
end(End Sequence) stops sequence number; LD (Local Destination) is receiving node address; The update time that UT (Update Time) is this entry.For table 5, source node address is N by present node
1, sequence number is at S
1and E
1between packet all forward and give node D
1, up-to-date update time is T
1.
In the present embodiment, when a node receives a packet, when finding that local node is flex point by the judgement of step 101, then this node by the address of the source node of this packet, sequence number, receiving node stored in its correspondence bar now, and upgrade the update time of this entry, this completes the mark (step 102) to this packet.Afterwards, when this node receives a packet again, and the address of the source node of this packet, sequence number are when being arranged in the flex point history information table of this node, then confirm to carry out mark to this packet, also i.e. once this packet forwarded over, now this node is determined to there occurs route loop, can perform the operation (step 103) solving route loop.
Wherein, the structure of the history information table shown in table 5 just illustrates, the embodiment of the present invention is not in this, as restriction.Such as, in other implementations, the sequence number that can not store packet is interval, and only store the sequence number of packet, as shown in table 6, when being judged as that local node is flex point by step 101, if not to should the entry of packet in history information table, then the source node address of this packet, sequence number, receiving node address stored in an entry, and are upgraded the update time of this entry; If had in history information table should the entry of packet, then only upgrade the update time of this entry.Again such as, the address of the receiving node in table 5 is also optional, in other implementations, also this content can not be stored, and only store the source node address of this packet, sequence number/sequence number interval and update time, when judging whether to carry out mark to the packet received, only judge according to above information.
Table 6: historical information list structure two
| GS | Seq | LD | UT |
| N 1 | S 1 | D 1 | T 1 |
| ... | ... | ... | ... |
| N n | S n | D n | T n |
In the present embodiment, after determining that route loop occurs, the operation solving route loop can be performed, such as, directly lose this packet; Or, upgrade routing table information and forwarding data bag again; Or the cost of routing node when can also be forwarded described packet the last time in the local routing table of described node is set to maximum, and reason is, there occurs route loop on the route, then this route is unsuitable for forwarding data bag.
In order to make the route loop detection method of the embodiment of the present invention clearly understandable, respectively the mode by the information of flex point being put into packet is marked packet below by way of two examples, and by the mode of the information of packet stored in the history information table of flex point is marked packet, the enforcement of the method for the embodiment of the present invention is described.
Example one
In this example, be labeled as example, be described the method for the embodiment of the present invention in the mode address of flex point being put into packet to packet, wherein, the frame structure of packet is for table 2, and the structure of flex point list is for table 3.
Fig. 2 a is the operational flowchart that in an execution mode of this example, source node sends information.
Please refer to Fig. 2 a, when node S needs to send data to node N, from routing table, first search destination node address be N and the minimum routing node of Metric, node address is designated as route_best, and Metric is designated as cost_min; Then build packet, make GD=N, GS=S, LD=route_best, LS=S, Cost=cost_min, No=0; Finally, this packet is sent.
Fig. 2 b is the operational flowchart that in another execution mode of this example, source node sends information.
Please refer to Fig. 2 b, with Fig. 2 a unlike, in this embodiment, transmission packet before, node S first marks this packet, in the example of Fig. 2 b, be by the frame structure of Update Table bag, this packet is marked, such as, its GS is put into this packet, such as, its GS is put into flex point list, and flex point number is added 1.Concrete mark mode as previously mentioned, does not repeat them here.
Fig. 3 is the flow chart forwarded the data in this packet after routing node receives this packet.
Please refer to Fig. 3, after node R receives a new packet, the first information of resolution data bag, the destination address of packet is designated as GD
in, source node address is designated as GS
in, sending node address is designated as LS
in, receiving node address is designated as LD
in, expect that Metric is designated as C
in, flex point list is TP
in.
Node R only processes receiving node LD
infor R(also namely local node be the receiving node of this packet) packet, other packets should abandon.If GD in the packet that node R receives
in=R, also namely node R is the destination node of this packet, then this packet is passed to upper-layer protocol by this node R; Otherwise this node R needs to forward packet.
During forwarding, first node R checks the flex point list TP of this packet
inif the address of node R is arranged in the flex point list of this packet, then illustrate that packet have passed through a route loop, node R is this packet forwarded over once, then node R detects route loop, performs the operation solving route loop, such as, by this data packet discarding.If the address of node R is not in flex point list, then node R is this packet selection route, and such as, from routing table, search destination node address is GD
inand the node of least cost, node address is designated as route_best, expects that Metric is designated as cost_min.
Then, node R builds packet, and in packet, destination node address is GD
in, source node address is GS
in, sending node address is R, and receiving node address is route_best.
Wherein, when cost_min is more than or equal to C
intime, also, node R is the Metric of route that this packet is selected when being more than or equal to the expectation Metric of this packet, then determine that node R is the flex point of this packet, the address of oneself joins in flex point list by node R, No=No+1, TP_No=R.
Finally, this packet is sent.
The method of this example marks packet by the information of flex point is put into packet, whether can judge whether route loop occurs in the packet received according to the address of oneself thus, solve the problem of route loop in time, avoid the waste of the communication resource, and ensure that the normal work of network.
Example two
In this example, so that the information of packet is labeled as example stored in the mode of the history information table of flex point to packet, the method for the embodiment of the present invention is described, wherein, the frame structure of packet is for table 4, and the structure of the history information table of flex point is for table 5.
Fig. 4 a is the operational flowchart that in an execution mode of this example two, source node sends information.
Please refer to Fig. 4 a, when node S needs to send data to node N, from routing table, first search destination node address be N and the minimum routing node of Metric, node address is designated as route_best, and Metric is designated as cost_min; Then build packet, make GD=N, GS=S, LD=route_best, LS=S, Cost=cost_min; Finally, this packet is sent.
Fig. 4 b is the operational flowchart that in another execution mode of this example two, source node sends information.
Please refer to Fig. 4 b, with Fig. 4 a unlike, in this embodiment, before transmission packet, node S first marks this packet, with the mark mode of Fig. 2 b unlike, in the example of Fig. 4 a, be by amendment history information table, this packet is marked, such as, its GS, Seq and route_best inserted in history information table.Concrete mark mode as previously mentioned, does not repeat them here.
Fig. 5 is the flow chart forwarded the data in this packet after routing node receives this packet.Please refer to Fig. 5, after node R receives a new packet, the first information of resolution data bag, the destination address of packet is designated as GD
in, source node address is designated as GS
in, sending node address is designated as LS
in, receiving node address is designated as LD
in, expect that Metric is designated as C
in, the sequence number of packet is Seq
in.
Node R only processes receiving node LD
infor R(also namely local node be the receiving node of this packet) packet, other packets should abandon.If GD in the packet that node R receives
in=R, also namely node R is the destination node of this packet, then this packet is passed to upper-layer protocol by this node R; Otherwise this node R needs to forward packet.
During forwarding, first node R checks the local flex point history information table stored, if this packet is arranged in this history information table, then illustrate that packet have passed through a route loop, also i.e. node R once this packet forwarded over, the then operation of node R startup solution route loop, such as, this node R upgrades routing table, and the cost of routing node when forwarding by last time is set to maximum.If this packet is not in this history information table, then node R is this packet selection route, and such as, from routing table, search destination node address is GD
inand the node of least cost, node address is designated as route_best, expects that Metric is designated as cost_min.
Then, node R builds packet, and in packet, destination node address is GD
in, source node address is GS
in, sending node address is R, and receiving node address is route_best.
Wherein, when cost_min is more than or equal to C
intime, also, node R is the Metric of route that this packet is selected when being more than or equal to the expectation Metric of this packet, then determine that node R is the flex point of this packet, node R is by (GS
in, Seq
in, route_best) and add history information table.
Finally, this packet is sent.
Fig. 6 is that node R adds the flow chart of new entry to history information table.
Please refer to Fig. 6, node R is by the information (GS of packet
in, Seq
in, route_best) and when inserting history information table, first search history information table.
If N in history information table
i=GS
in, D
i=route_best, E
i=Seq
in+ 1, upgrade N
icorresponding entry, make termination sequence number add 1, update time is current time.
If do not have above-mentioned information in history information table, then insert new entry, wherein source node address is GS
in, start sequence number is Seq
in, termination sequence number is Seq
in, receiving node address is route_best, and update time is current time.
When certain entry in history information table exceed certain hour do not upgrade time, then delete this entry.Now, this operation can be realized by a timer.
The method of this example is by marking the information of packet packet stored in the history information table of flex point, whether can judge whether route loop occurs in the history information table of flex point according to the information of the packet received thus, solve the problem of route loop timely, avoid the waste of the communication resource, and ensure that the normal work of network.
The embodiment of the present invention additionally provides a kind of node, as as described in the following examples 2, the method for the principle of dealing with problems due to this node and embodiment 1 is similar, therefore, its concrete enforcement can with reference to the enforcement of the method for embodiment 1, the no longer repeat specification of content something in common.
Embodiment 2
Embodiments provide the node in a kind of Ad Hoc network.Fig. 7 is the composition schematic diagram of this node, please refer to Fig. 7, and this node comprises:
Resolution unit 71, it resolves the information in the packet received;
Judging unit 72, according to the flex point list in described packet or the flex point relevant information in history information table, it judges whether described node carried out mark to described packet;
Processing unit 73, it was when described node carried out mark to described packet, determined route loop occurs.
In one embodiment, this node also comprises:
Indexing unit 74, it marks the packet that described node generates, or be judged as that described node did not carry out mark to the described packet received at described judging unit 72, and the cost that described node is the route that the described packet received is selected is when being more than or equal to the expectation Metric of described packet, the described packet received is marked.
Wherein, this indexing unit 74 can by marking the packet of described generation or the packet that receives in the flex point list of packet that the information of described node is added generation or the packet received, and also can mark the packet generated or the packet received by the packet of generation or the information of packet that receives being added in the flex point relevant information of described history information table.
In one embodiment, this node also comprises:
Retransmission unit 75, it is for after indexing unit 74 marks the packet that described node generates, send described packet, or mark was not carried out to the described packet received at described indexing unit 74, and the cost that described node is the route that the described packet received is selected is when being more than or equal to the expectation Metric of described packet, forward the described packet after mark; Mark was not carried out to the described packet received at described indexing unit 74, but when the cost that described node is the route that the described packet received is selected is less than the expectation Metric of above-mentioned packet, forwarded described packet.
Wherein, if described indexing unit 74 marks packet by the flex point list that described address of node added packet, then the packet after mark comprises: the Metric of source node address, destination node address, sending node address, receiving node address, expectation, flex point number, flex point list, packet sequence number, data packet length and data field.
Wherein, if described indexing unit 74 marks packet by the information of packet being added in described history information table, then the packet after mark comprises: the Metric of source node address, destination node address, sending node address, receiving node address, expectation, packet sequence number, data packet length and data field.
In one embodiment, this node can also comprise:
Data construct unit 76, it is for before the described packet after described retransmission unit 75 forwards mark, or before forwarding described packet, the Metric of described packet is added in described packet, so that the node receiving this packet is by determining whether to there occurs route loop to the parsing of these data.
In one embodiment, described processing unit 73 also for determining to occur after route loop, performs the operation solving route loop, and such as, the cost of routing node when being forwarded described packet the last time in the local routing table of described node is set to maximum.
The node of the present embodiment judges whether route loop occurs according to the packet received by marking packet, and solves the problem of route loop timely, avoids the waste of the communication resource, and ensure that the normal work of network.
The embodiment of the present invention additionally provides a kind of communication network, and this communication network comprises the node described in one or more embodiment 2.Its content is incorporated in this, does not repeat them here.
The embodiment of the present invention additionally provides a kind of computer-readable program, and wherein when performing this program in terminal equipment, this program makes computer in described terminal equipment, perform route loop detection method described in embodiment 1.
The embodiment of the present invention additionally provides a kind of storage medium storing computer-readable program, and wherein this computer-readable program makes computer in terminal equipment, perform route loop detection method described in embodiment 1.
More than describe the preferred embodiment of the present invention with reference to the accompanying drawings.Many feature and advantage of these execution modes are clearly according to this detailed description book, and therefore claims are intended to all these feature and advantage fallen in its true spirit and scope covering these execution modes.In addition, owing to those skilled in the art will find apparent that a lot of amendment and changing, therefore not embodiments of the present invention to be limited to precision architecture that is illustrated and that describe and operation, but can contain and fall into all suitable modifications within the scope of it and equivalent.
To describe or frame can be understood in flow chart or in this any process otherwise described or method, represent and comprise one or more for realizing the module of the code of the executable instruction of the step in specific logical function or process, fragment or part, and the scope of the preferred embodiment of the present invention comprises other realization, wherein, can not according to order that is shown or that discuss, comprise according to involved function by the mode while of basic or by contrary order, carry out n-back test, this should those skilled in the art described by the present invention understand.
Claims (10)
1. the node in Ad Hoc network, wherein, described node comprises:
Resolution unit, it resolves the information in the packet received;
Judging unit, according to the flex point list in described packet or the flex point relevant information in history information table, it judges whether described node carried out mark to described packet;
Processing unit, it was when described node carried out mark to described packet, determined route loop occurs.
2. node according to claim 1, wherein, described node also comprises:
Indexing unit, it marks the packet that described node generates, or be judged as that described node did not carry out mark to the described packet received at described judging unit, and the cost that described node is the route that the described packet received is selected is when being more than or equal to the expectation Metric of described packet, the described packet received is marked.
3. node according to claim 2, wherein, described indexing unit is by adding in the flex point list of described packet by the information of described node, or, the information of described packet is added in the flex point relevant information of described history information table, to the packet of described generation or described in the packet that receives mark.
4. node according to claim 2, wherein, described node also comprises:
Retransmission unit, it did not carry out mark to the described packet received at described node, and the cost that described node is the route that the described packet received is selected is when being more than or equal to the expectation Metric of described packet, forward the described packet after mark; Mark was not carried out to the described packet received at described node, but when the cost that described node is the route that the described packet received is selected is less than the expectation Metric of described packet, forwarded described packet.
5. node according to claim 4, wherein, described node also comprises:
Data construct unit, the Metric of described packet for before the described packet after described retransmission unit forwards mark, or before forwarding described packet, is added in described packet by it.
6. a detection method for route loop, wherein, described method comprises:
Judge whether local node is flex point according to the cost that the expectation Metric of the packet received and local node are the route that described packet is selected;
If local node is flex point, then described packet is marked;
If receive the packet that local node is labeled, then determine to there occurs route loop.
7. method according to claim 6, wherein, judges that whether local node is that the step of flex point comprises:
If the cost that local node is the route that described packet is selected is more than or equal to the expectation Metric of described packet, then determine that local node is flex point.
8. method according to claim 6, wherein, comprises the step that described packet marks:
The information of local node is joined in the flex point list of described packet; Or
The information of described packet is joined in the flex point relevant information of flex point history information table.
9. method according to claim 8, wherein,
If the information of described local node is in the flex point list of described packet, then determine that described packet is the labeled packet of local node; Or,
If the information of described packet is in the flex point relevant information of the flex point history information table of described local node, then determine that described packet is the labeled packet of local node.
10. method according to claim 6, wherein, described method also comprises:
The Metric of described packet is added in described packet, and forwards the packet after marking or forward unlabelled packet.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310227098.XA CN104243224B (en) | 2013-06-08 | 2013-06-08 | The detection method and device of route loop |
| JP2014115641A JP2014239437A (en) | 2013-06-08 | 2014-06-04 | Method and device for detecting routing loop |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310227098.XA CN104243224B (en) | 2013-06-08 | 2013-06-08 | The detection method and device of route loop |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104243224A true CN104243224A (en) | 2014-12-24 |
| CN104243224B CN104243224B (en) | 2017-11-10 |
Family
ID=52136226
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310227098.XA Expired - Fee Related CN104243224B (en) | 2013-06-08 | 2013-06-08 | The detection method and device of route loop |
Country Status (2)
| Country | Link |
|---|---|
| JP (1) | JP2014239437A (en) |
| CN (1) | CN104243224B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106792857A (en) * | 2016-12-27 | 2017-05-31 | 上海斐讯数据通信技术有限公司 | Loop detecting method, loop detection means and system |
| CN107395523A (en) * | 2016-05-16 | 2017-11-24 | 智邦科技股份有限公司 | control method and network architecture |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP6459558B2 (en) * | 2015-01-27 | 2019-01-30 | 富士通株式会社 | Wireless communication apparatus, wireless communication method, and wireless communication program |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090129316A1 (en) * | 2007-08-20 | 2009-05-21 | Bbn Technologies Corp. | Systems and methods for adaptive routing in mobile ad-hoc networks and disruption tolerant networks |
| CN101784067A (en) * | 2010-01-14 | 2010-07-21 | 重庆邮电大学 | Method for quickly sensing meeting nodes based on cross-layer triggering in opportunistic network |
-
2013
- 2013-06-08 CN CN201310227098.XA patent/CN104243224B/en not_active Expired - Fee Related
-
2014
- 2014-06-04 JP JP2014115641A patent/JP2014239437A/en not_active Withdrawn
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090129316A1 (en) * | 2007-08-20 | 2009-05-21 | Bbn Technologies Corp. | Systems and methods for adaptive routing in mobile ad-hoc networks and disruption tolerant networks |
| CN101784067A (en) * | 2010-01-14 | 2010-07-21 | 重庆邮电大学 | Method for quickly sensing meeting nodes based on cross-layer triggering in opportunistic network |
Non-Patent Citations (1)
| Title |
|---|
| 吕志鹏等: "无线Ad hoc网络中防止路由环路方案", 《电子测量技术》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107395523A (en) * | 2016-05-16 | 2017-11-24 | 智邦科技股份有限公司 | control method and network architecture |
| CN107395523B (en) * | 2016-05-16 | 2021-04-13 | 智邦科技股份有限公司 | Control method and network architecture |
| CN106792857A (en) * | 2016-12-27 | 2017-05-31 | 上海斐讯数据通信技术有限公司 | Loop detecting method, loop detection means and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104243224B (en) | 2017-11-10 |
| JP2014239437A (en) | 2014-12-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8451744B2 (en) | Partitioning directed acyclic graph (DAG) topologies | |
| US9800493B2 (en) | Routing messages in a computer network using deterministic and probalistic source routes | |
| US8824471B2 (en) | Maintained message delivery during routing domain migration | |
| US20110228696A1 (en) | Dynamic directed acyclic graph (dag) topology reporting | |
| US8792360B2 (en) | Duplicate packet suppression | |
| US20120155463A1 (en) | Increased Communication Opportunities with Low-Contact Nodes in a Computer Network | |
| CN106161237B (en) | Centralized routing method, device and system | |
| US20140029610A1 (en) | Managing grey zones of unreachable nodes in computer networks | |
| US9300569B2 (en) | Compressing data packet routing information using bloom filters | |
| US20140129734A1 (en) | Push-based short-cut requests within a directed acyclic graph | |
| EP2882149A1 (en) | Distance-based routing in an information-centric network | |
| CN107342939A (en) | The method and apparatus for transmitting data | |
| CN112134795B (en) | Method, device and system for sending multicast protocol message | |
| US20120307653A1 (en) | Reachability rate computation without link layer acknowledgments | |
| CN106470158A (en) | Message forwarding method and device | |
| CN106130819A (en) | The detection method of VTEP exception and device | |
| CN113691445B (en) | Message forwarding backup path determining method and related equipment | |
| CN104022956A (en) | Method and device for data message processing in location/ID separation protocol network | |
| US20120155477A1 (en) | Multi hop routing apparatus and multi hop routing method | |
| CN104243224A (en) | Detecting method for routing loop and device thereof | |
| US20030012146A1 (en) | Methods and arrangements for building a subsource address multicast distribution tree using traced routes | |
| CN113904985B (en) | Segment list acquisition method, message forwarding method, device and electronic equipment | |
| US9401859B2 (en) | Method to setup protocol independent multicast trees in the presence of unidirectional tunnels | |
| WO2021254173A1 (en) | Routing processing method and related device | |
| JP2007181056A (en) | Path selection 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20171110 Termination date: 20180608 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |