← Back to Patent Explorer
US5007052A Expired / Lapsed US ⏱️ 0.0 years remaining

Method for routing packets by squelched flooding

Assignee: Ricochet Networks Inc
•
Filing: 1989-04-11
•
Granted: 1991-04-09
•
Expires: 2009-04-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A technique is provided whereby broadcast or flooding packets received at a node are only rebroadcast if specific criteria are met. The criteria are based on a packet routing protocol wherein sequence information is maintained at each node on a link basis for each received packet and wherein received packets are rebroadcast only to other nodes with low sequence numbers. Each node maintains information on each other node within its communication range and assigns a link sequence number to the linked node at the time of the first exchange of a link information packet. Each node works backwards from the information sent to it to determine which other nodes should receive rebroadcast packets. In a packet flooding situation, a node rebroadcasts a flooding packet only to those other nodes which have low sequence numbers or for which the rebroadcasting node is a low sequence number of the other node.

Inventors

  • 👤 George Flammer

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 08:06
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/36; H04L12/00; H04L12/02; H04L12/16; H04L12/18; H04L12/1854; H04L45/32; H04L12/185

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 106 words
In a packet-switched communication network, a method for routing flooding packets to nodes in said network, said method comprising the steps of: assigning at each local node a link sequence value to each communication link with said local node; exchanging between each said local node and each remote nodes said link sequence value assigned to a common communication link such that each said local node is advised of the link sequence value assigned by each remote node to a communication link with said local node; and transmitting flooding packets only via communication links having link sequence values with a priority above a link sequence value threshold.
Claim 2
Dependent Claim 106 words
In a packet-switched communication network, a method for routing flooding packets to nodes in said network, said method comprising the steps of: assigning at each local node a link sequence value to each communication link with said local node; exchanging between each said local node and each remote nodes said link sequence value assigned to a common communication link such that each said local node is advised of the link sequence value assigned by each remote node to a communication link with said local node; and transmitting flooding packets only via communication links having link sequence values with a priority above a link sequence value threshold.
Claim 3
Dependent Claim 35 words
The method according to claim 1 further including the step of directing that flooding packets can only be rebroadcast away from a source node to other nodes to avoid resending packets into the source node.
Claim 4
Dependent Claim 40 words
The method according to claim 2 wherein said directing step includes directing that flooding packets be directed to nodes which are located in the far half-circular region bisected by an axis between the source node and an intermediate rebroadcasting node.
Claim 5
Dependent Claim 219 words
In a packet-switched communication network having independent nodes capable of communicating via communication links, a method for routing flooding packets to nodes in said network, said method comprising the steps of: receiving a packet at a local node from a remote node via a communication link; testing said packet to determine whether said packet originates from a new node, said new node being said remote node having no communication link established with said local node; sending from said local node to said new node a sequence number inquiry via said communication link to inquire of a sequence number assigned by said new node to said local node for said communication link; assigning at said new node a sequence number to said communication link established with said new node, said sequence number specifying a relative priority of communication via said communication link; thereafter receiving from said new node at said local node a sequence number response, said sequence number response comprising said sequence number; storing said sequence number at said local node; receiving at said local node a flooding packet, said flooding packet being a message intended for all nodes in said packet network; and retransmitting said flooding packet to said new node only if said sequence number has a higher priority than a preselected threshold for a link sequence.
Claim 6
Dependent Claim 219 words
In a packet-switched communication network having independent nodes capable of communicating via communication links, a method for routing flooding packets to nodes in said network, said method comprising the steps of: receiving a packet at a local node from a remote node via a communication link; testing said packet to determine whether said packet originates from a new node, said new node being said remote node having no communication link established with said local node; sending from said local node to said new node a sequence number inquiry via said communication link to inquire of a sequence number assigned by said new node to said local node for said communication link; assigning at said new node a sequence number to said communication link established with said new node, said sequence number specifying a relative priority of communication via said communication link; thereafter receiving from said new node at said local node a sequence number response, said sequence number response comprising said sequence number; storing said sequence number at said local node; receiving at said local node a flooding packet, said flooding packet being a message intended for all nodes in said packet network; and retransmitting said flooding packet to said new node only if said sequence number has a higher priority than a preselected threshold for a link sequence.
Claim 7
Dependent Claim 22 words
The method according to claim 4 wherein said assigning step comprises assigning said link sequence in the order that links are established.
Claim 8
Dependent Claim 30 words
The method according to claim 5 wherein the lowest link sequence number is assigned to the first communication link which is established between the remote node and the local node.
Claim 9
Dependent Claim 35 words
The method according to claim 4 further including the step of directing that a flooding packet can only be rebroadcast away from a source node in order to avoid resending packets into the source node.
Claim 10
Dependent Claim 46 words
The method according to claim 7 wherein said directing step includes directing that a flooding packet be directed to nodes which are located in the far half-circular region bisected by an axis between the source node and said local node serving as an intermediate rebroadcasting node.

References Cited (Backward Citations)

US4760572A Cited
US4920529A Cited
US4864559A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1994-04-08 1994-10-08 1995-04-09 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1998-04-08 1998-10-08 1999-04-09 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2002-04-08 2002-10-08 2003-04-09 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag