Distributed message routing in a virtualized messaging system using recursive least squares links cost estimation with choke points

摘要

Routing data packet traffic in packet networks, expediting the flow of the data packets and reducing the effects of congestion at nodes is accomplished by capturing latency data for nodes for initial measurement times; and computing a least squares estimate of the delay as a recursive least-squares solution.