Efficient computation of distance sketches in distributed networks

• Main Authors: Das Sarma, Atish., Dinitz, Michael., Pandurangan, Gopal.
• Other Authors: School of Physical and Mathematical Sciences
• Format: Conference or Workshop Item
• Language: English
• Published: 2013
• Online Access: https://hdl.handle.net/10356/98272; http://hdl.handle.net/10220/12477
• Institution: Nanyang Technological University

Distance computation (e.g., computing shortest paths) is one of the most fundamental primitives used in communication networks. The cost of effectively and accurately computing pairwise network distances can become prohibitive in large-scale networks such as the Internet and Peer-to-Peer (P2P) netwo...