Check patentability & draft patents in minutes with Patsnap Eureka AI!

Detecting method for routing loop and device thereof

A routing and looping technology, applied in the field of communication, can solve problems such as occupying a large memory, and achieve the effect of ensuring normal operation and avoiding waste of resources

Inactive Publication Date: 2014-12-24
FUJITSU LTD
View PDF2 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Therefore, although the historical information table in the conventional method can detect and solve the problem of routing loops, when the amount of data in the network is large, the historical information table will occupy a large amount of memory

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Detecting method for routing loop and device thereof
  • Detecting method for routing loop and device thereof
  • Detecting method for routing loop and device thereof

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0038] An embodiment of the present invention provides a method for detecting a routing loop. figure 1 is the flowchart of the method, please refer to figure 1 , the method includes:

[0039] Step 101: judging whether the local node is an inflection point according to the expected route cost of the received data packet and the cost of the route selected by the local node for the data packet;

[0040] Wherein, the local node may select a route with the least routing cost for the data packet by querying the routing table, and determine whether the local node is an inflection point by comparing the expected routing cost of the data packet with the cost of the selected route.

[0041] Among them, if the cost of the selected route is greater than or equal to the expected route cost, the local node is considered to be an inflection point. Works as normal; if the cost of the chosen route is less than the expected route cost, the local node is considered not to be an inflection poin...

example 1

[0080] In this example, the method of the embodiment of the present invention is described by taking the method of marking the data packet by putting the address of the inflection point into the data packet as an example, wherein the frame structure of the data packet is shown in Table 2 as an example, and the structure of the inflection point list Take Table 3 as an example.

[0081] Figure 2a It is an operation flowchart of the source node sending information in an implementation manner of this example.

[0082] Please refer to Figure 2a, when node S needs to send data to node N, it first searches the routing table for the routing node whose target node address is N and the routing cost is the smallest, and the node address is recorded as route_best, and the routing cost is recorded as cost_min; then construct the data packet, let GD= N, GS=S, LD=route_best, LS=S, Cost=cost_min, No=0; finally, send the data packet.

[0083] Figure 2b It is an operation flowchart of th...

example 2

[0094] In this example, the method of the embodiment of the present invention is described by taking the method of storing the information of the data packet into the historical information table of the inflection point to mark the data packet as an example, wherein the frame structure of the data packet is shown in Table 4 as an example, Take Table 5 as an example for the structure of the historical information table of the inflection point.

[0095] Figure 4a It is an operation flowchart of the source node sending information in an implementation manner of the second example.

[0096] Please refer to Figure 4a , when node S needs to send data to node N, it first searches the routing table for the routing node whose target node address is N and the routing cost is the smallest, and the node address is recorded as route_best, and the routing cost is recorded as cost_min; then construct the data packet, let GD= N, GS=S, LD=route_best, LS=S, Cost=cost_min; finally, send the ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

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 [0001] The invention relates to the communication field, in particular to a method and device for detecting routing loops in an Ad Hoc network. Background technique [0002] When a data packet propagates in a wireless Ad Hoc network, it usually needs forwarding of multiple nodes to reach the target node. When a packet is repeatedly forwarded to each other by a series of nodes, it gets stuck in a routing loop. The data packets passing through the routing loop will be forwarded infinitely, but cannot reach the destination node. If the routing loop problem cannot be solved in time, it will cause a waste of communication resources and affect the normal operation of the network. [0003] A conventional solution usually uses a history information table to detect routing loops. The history information table saves the information of the data packets sent by the node. If a node receives a data packet, but the information of the data packet has already appeared in ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04L12/26H04L45/18
Inventor 李红春田军尾崎一幸温允藤田裕志
Owner FUJITSU LTD
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com