Distributed asynchronous optimal routing in data networks


We prove convergence of a distributed gradient projection method for optimal routing in a data communication network. The analysis is carried out without any synchronization assumptions and takes into account the possibility of transients caused by updates in the routing strategy being used. 


1 Figure or Table


Citations per Year

108 Citations

Semantic Scholar estimates that this publication has 108 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics