METHOD FOR SCALABLE ROUTING WITH GREEDY EMBEDDING

摘要

A method and apparatus is disclosed herein for scalable routing with greedy embedding. In one embodiment, the method comprises storing log(n) coordinates in a routing table, where n is the number of nodes in a network, and further wherein the log(n) coordinates are generated by constructing a greedy embedding that embeds a graph topology depicting connections between n nodes of a network into a geometric space so as to use greedy forwarding by generating a spanning tree out of a connection graph representing the connections between the n nodes of the network, decomposing the tree into at most n branches, assigning a set of geometric coordinates to vertices in the tree in an n-dimensional space, and projecting the set of geometric coordinates onto a k-dimensional space, where k is less than n, to create the log(n) coordinates; and routing packets via nodes of the network using the log(n) coordinates in the routing table.