Patent ID: 8417813
Filing Date: 2013-04-09
Classification: H04L

Abstract:
1. At a computer system including one or more processors and system memory, a method for partitioning a sorted linked list of node IDs representing corresponding nodes in a federation infrastructure into a hierarchical tree of rings, the method comprising: an act of accessing a sorted linked list of unique nodes IDs assigned to a federation infrastructure, each unique node ID assigned to a corresponding node in the federation infrastructure; an act of accessing a partially-ordered list of a plurality of different types of proximity criteria for partitioning the sorted linked list into a plurality of sub-rings of a hierarchical tree of rings, the partially-ordered list defining the following: an act of partitioning the node IDs in the sorted linked list into the hierarchical tree of rings based on the first, second and third proximity criteria types, the hierarchical tree of rings including: an act of generating a routing table for at least one node in the federation infrastructure, the at least one node belonging to the root ring as well as at least one sub-ring in each of the first, second, and third lower sub-ring levels, the routing table comprising routing information for the root ring as well as routing information for each sub-ring to which the at least one node belongs, for each ring the routing information including: