Patent ID: 8432830
Filing Date: 2013-04-30
Classification: H04L

Abstract:
1. A method, comprising: (a) computing a Forwarding Directed Acyclic Graph (FDAG) rooted at a destination node in a network of nodes, wherein the FDAG defines a plurality of routes for forwarding an information packet from any node in the network to the destination node, wherein the information packet includes destination data, wherein the defined plurality of routes includes forwarding proportions for forwarding an information packet from at least one network node to one of a plurality of adjacent network nodes; and (b) constructing a Multi-Neighbor Proportional Forwarding (MNPF) routing table for a first node in the network of nodes, wherein the first node forwards the information packet, wherein the first node has a plurality of allowed adjacent network nodes to which the information packet can be forwarded, wherein the MNPF routing table includes forwarding proportions that determine selection of one of the plurality of allowed adjacent network nodes without reference to the source of the information packet, wherein at least some of the forwarding proportions in the MNPF routing table are derived at least in part from said computed FDAG, wherein the network of nodes is a mixed network, wherein at least one node forwards packets according to an MNPF routing table, wherein at least one node forwards packets according to another type of routing table, wherein an FDAG for each destination node in the network is computed by at least one node of the network, and wherein network topology information used in computing the FDAG for each destination node includes information as to the type of routing table used by each node for forwarding packets.