1 to solve an sosp problem for a network with n nodes the distributed version of our algorithm reaches the time complexity of o log n which is less than the time complexity of o log2 n achieved by the best existing algorithm 
