×

Constraining topology size and recursively calculating routes in large networks

  • US 8,817,798 B2
  • Filed: 08/10/2012
  • Issued: 08/26/2014
  • Est. Priority Date: 08/10/2012
  • Status: Active Grant
First Claim
Patent Images

1. A method of managing a network comprising a plurality of nodes, the method comprising:

  • each node maintaining a respective topology database containing topology information of the network within a local region of the node, the local region encompassing a subset of the plurality of nodes of the network; and

    the nodes of the network implementing a Recursive Path Computation algorithm to compute end-to-end routes through the network;

    wherein implementing a Recursive Path Computation algorithm comprises a first node performing the steps of;

    determining whether a destination address is in a respective topology database of the first node;

    when the destination address is not in the respective topology database of the first node;

    sending a request message to each boundary node of the first node'"'"'s local region, the request message containing the destination address;

    receiving a respective reply message from at least one of the boundary nodes, each reply message including path information defining a path from the respective boundary node to the destination address;

    for at least one received reply message, calculating a respective candidate path from the first node to the destination address via the respective boundary node; and

    selecting, from among the calculated candidate paths, a best path from the first node to the destination address.

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