Ricardo Santos

Internet routing: characterization via an algebraic property of cycles and a polynomial-time algorithm

This paper identifies an algebraic property of cycles, which is called centripetalism, that characterizes the existence of unique stable routings for all possible destinations in a network and failure scenarios and presents the Consistent-Tree algorithm, which either produces a stable routing or reports the presence of a non-centripetal cycle.