Efficient computation of distance sketches in distributed networks
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...
| Principais autores: | , , |
|---|---|
| Outros Autores: | |
| Formato: | Conference Paper |
| Idioma: | English |
| Publicado em: |
2013
|
| Acesso em linha: | https://hdl.handle.net/10356/98272 http://hdl.handle.net/10220/12477 |