Spring for Vivaldi -- Orchestrating Hierarchical Network Coordinates

Network coordinates have become an important building block for efficient peer-to-peer applications. They allow the peers to determine those other peers to whom they are likely to experience a low round trip time. So they can preferably attach to these selected peers and thereby create efficient overlay structures. Despite the substantial interest in this topic, there is still room for improvement. In this paper we propose Hierarchical Vivaldi, a variant of the popular Vivaldi algorithm. It predicts the peers´ embedding error so that it can optimize the peer selection process. We conducted extensive studies with several sets of Internet traffic traces. They compare our proposal to Vivaldi and its previously proposed optimizations. Our results show that Hierarchical Vivaldi can improve the accuracy of the RTT predictions by an order of magnitude.