PeerWise Discovery and Negotiation of Faster Paths

6th ACM Workshop on Hot Topics in Networks, HotNets 2007

Volumn , Issue , 2007, Pages

  Lumezanu, Cristian ^a   Levin, Dave ^a   Spring, Neil ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRUCTION PROCESS; FASTEST PATHS; OVERLAY CONSTRUCTION; OVERLAY ROUTING; PEER NODES; ROUTING-PROTOCOL; ROUTINGS;

EID: 85134054862     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. L. Anderegg and S. Eidenbenz. Ad hoc-VCG: A truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In MobiCom, 2003.
2. D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris. Resilient overlay networks. In SOSP, 2001.
3. B. Cohen. Incentives build robustness in BitTorrent. In IPTPS, 2003.
4. F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: a decentralized network coordinate system. In SIGCOMM, 2004.
5. K. Gummadi, S. Saroiu, and S. Gribble. King: Estimating latency between arbitrary Internet end hosts. In IMW, 2002.
6. K. P. Gummadi, et al. Improving the reliability of internet paths with one-hop source routing. In OSDI, 2004.
7. C. Labovitz, A. Ahuja, A. Abose, and F. Jahanian. An experimental study of delayed Internet routing convergence. In SIGCOMM, 2000.
8. J. Ledlie, P. Gardner, and M. Seltzer. Network coordinates in the wild. In NSDI, 2007.
9. D. Levin. Punishment in selfish wireless networks: A game theoretic analysis. In NetEcon, 2006.
10. D. Levin, R. Sherwood, and B. Bhattacharjee. Fair file swarming with FOX. In IPTPS, 2006.
11. T. Moscibroda, S. Schmid, and R. Wattenhofer. On the topologies formed by selfish peers. In PODC, 2006.
12. A. Nakao and L. Peterson. Scalable routing overlay networks. In ACM SIGOPS Operating Systems Review, 2006.
13. A. Nakao, L. Peterson, and A. Bavier. A routing underlay for overlay networks. In SIGCOMM, 2003.
14. T. S. E. Ng and H. Zhang. Predicting Internet network distance with coordinates-based approaches. In INFOCOM, 2002.
15. C. Perkins, E. Belding-Royer, and S. Das. Ad hoc on-demand distance vector (AODV) routing. RFC 3561, IETF, 2003.
16. Y. Rekhter and K. Lougheed. A Border Gateway Protocol 4 (BGP-4). RFC 1771, IETF, 1994.
17. S. Savage, et al. Detour: A case for informed Internet routing and transport. IEEE Micro, 19(1):50-59, 1999.
18. Y. Shavitt and T. Tankel. Big-bang simulation for embedding network distances in euclidean space. In INFOCOM, 2003.
19. R. Sherwood and N. Spring. Touring the Internet in a TCP sidecar. In IMC, 2006.
20. M. Sirivianos, J. H. Park, X. Yang, and S. Jarecki. Dandelion: Cooperative content distribution with robust incentives. In USENIX, 2007.
21. ∼strib/pl app/.
22. L. Subramanian, I. Stoica, H. Balakrishnan, and R. Katz. OverQoS: An overlay based architecture for enhancing Internet QoS. In NSDI, 2004.
23. G. Wang, B. Zhang, and T. S. E. Ng. Towards network triangle inequality violation aware distributed systems. In IMC, 2007.
24. B. Wong, A. Slivkins, and E. G. Sirer. Meridian: A lightweight network location service without virtual coordinates. In SIGCOMM, 2005.
25. S. Zhong, J. Chen, and Y. R. Yang. Sprite: A simple, cheat-proof, credit-based system for mobile ad-hoc networks. In INFOCOM, 2003.