×

Digraph based mesh communication network

  • US 8,194,655 B2
  • Filed: 08/05/2004
  • Issued: 06/05/2012
  • Est. Priority Date: 08/05/2004
  • Status: Active Grant
First Claim
Patent Images

1. In a multi-hop packet-switched communication network, a method for routing packets comprising:

  • creating at least a portion of one or more digraphs at a current node of a first type, wherein the one or more digraphs are defined in the multi-hop packet-switched communication network, wherein each digraph of the one or more digraphs defines a plurality of nodes and a plurality of directional links connecting the plurality of nodes, wherein the plurality of directional links comprise zero or more incoming and one or more outgoing directional links associated with each node of the plurality of nodes, and wherein each directional link defined by a particular digraph is associated with a label of a same value;

    andtransmitting, using a transmitter, a packet from the current node directly to a next node of a set of next nodes of a second type or indirectly through a node of a third type, wherein content of the packet indicates a digraph for the packet to flow along, wherein the packet is transmitted to the next node along one or more outgoing directional links of the indicated digraph, wherein the one or more outgoing directional links of the indicated digraph are each associated with a label of a same specific value associated with the indicated digraph, and wherein the indicated digraph comprises one of the one or more digraphs for which at least a portion was created at the current node.

View all claims
  • 4 Assignments
Timeline View
Assignment View
    ×
    ×