System and method for packet transmission along shortest-path to multiple destinations

Patent metadata

Field	Value
Publication number	US-9049136-B2
Application number	US-201313788092-A
Country	US
Kind code	B2
Filing date	Mar 7, 2013
Priority date	Mar 7, 2013
Publication date	Jun 2, 2015
Grant date	Jun 2, 2015

Abstract

A system, method and apparatus arranged for efficient usage of network resources. Embodiments include nodes linked together, and the links having differing costs, e.g., bandwidth, frequency, and/or monetary cost, or any combination of these. Embodiments may identify neighboring nodes as either next-hop-neighbors or non-next-hop-neighbors. Next-hop-neighbors lie on the shortest path to any node, while non-next-hop-neighbors are nodes linked directly to a node, but the link is more costly than an alternative multi-hop path to the same node. Accordingly, embodiments may suppress packets to the non-next-hop-neighbors.

First claim

What is claimed is:

1. A method of routing or forwarding packets on two or more paths, which couple nodes on a computer network, the method comprising:
determining, via one or more network nodes, a cost of the two or more paths;
analyzing, via the one or more network nodes, the cost to determine a shortest path between nodes;
generating, via the one or more network nodes, a shortest-path routing table;
transmitting, via the one or more network nodes, a broadcast-related pack…

Assignees

• Raytheon Bbn Technologies Corp

Inventors

• Tetteh William Nii
• Merlin Christophe Jean-Claude

Classifications

• H04L47/15 Primary

  Electricity · mapped topic