Microsoft Research330 тыс
Следующее
Опубликовано 6 сентября 2016, 16:23
We propose a novel graph decomposition that enables a scalable form of internet routing with roughly sqrt(n) memory and logarithmic delay. Subnetworks are required to be small and with small diameter, no three of them to overlap, but any two of them to do so. Our main result is that several popular models of internet-like
Свежие видео
Случайные видео