Efficient and accurate protocols for distributed delaunay triangulation under churn

Proceedings - International Conference on Network Protocols, ICNP

Volumn , Issue , 2008, Pages 124-136

  Lee, Dong Young ^a   Lam, Simon S ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELAUNAY TRIANGULATION; DYNAMIC ENVIRONMENTS; NEIGHBOR DISCOVERY; PRO-ACTIVE APPROACH; PROTOCOL EFFICIENCY; REDUNDANT INFORMATIONS; SYSTEM STATE;

NETWORK PROTOCOLS;

TRIANGULATION;

EID: 67249140976     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2008.4697031     Document Type: Conference Paper

References (16)

1. P. Bose and P. Morin, "Online routing in triangulations," SIAM Journal on Computing, vol.33, no. 4, pp. 937-951, 2004.
2. B. Delaunay, "Surla sphère vide," Izv. Akad. Nauk SSSR, Otdelenie Matematicheskii i Estestvennyka Nauk, vol.7, pp. 793-800, 1934.
3. H. Edelsbrunner, "Incremental topological flipping works for regular triangulations," Algorithmica, vol.15, no. 3, pp. 223-241, 1996. (Pubitemid 126418811)
4. P. M. Gruber and J. M. Wills, Handbook of convex geometry. North- Holland, 1993.
5. D.-Y. Lee, E. K. Chung, and S. S. Lam, "A radius geocast routing protocol," in Proc. of IEEE International Conference on High Performance Computing and Communications, Dalian, China, September 2008.
6. D.-Y. Lee and S. S. Lam, "Protocol design for dynamic Delaunay triangulation," The Univ. of Texas at Austin, Dept. of Computer Sciences, Tech. Rep. TR-06-48, October 2006.
7. -, "Efficient and Accurate Protocols for Distributed Delaunay Triangulation under Churn," The Univ. of Texas at Austin, Dept. of Computer Sciences, Tech. Rep. TR-07-59, November 2007, revised Sepetember 2008.
8. -, "Protocol design for dynamic Delaunay triangulation," in Proc. of IEEE International Conference on Distributed Computing Systems, Toronto, Ontario, Canada, June 2007.
9. J. N. Liebeherr, M. Nahas, and W. Si, "Application-layer multicasting with Delaunay triangulation overlays," IEEE Journal on Selected Areas in Communications, vol.20, no. 8, pp. 1472-1488, 2002. (Pubitemid 35220894)
10. T. S. E. Ng and H. Zhang, "Predicting Internet network distance with coordinates-based approaches," in Proceedings of IEEE Infocom, New York City, New York, USA, June 2002.
11. M. Ohnishi, R. Nishide, and S. Ueshima, "Incremental construction of Delaunay overlaid network for virtual collaborative space," in Proc. of the third International Conference on Creating, Connecting and Collaborating through Computing, Kyoto, Japan, January 2005, pp. 75- 82. (Pubitemid 43803434)
12. S. Saroiu, P. K. Gummadi, and S. D. Gribble, "A measurement study of peer-to-peer file sharing systems," in Proc. of Multimedia Computing and Networking, San Jose, California, USA, January 2002.
13. G. Simon, M. Steiner, and E. Biersack, "Distributed dynamic Delaunay triangulation in d-dimensional spaces," Institut Eurecom, Tech. Rep., August 2005.
14. M. Steiner and E. Biersack, "A fully distributed peer to peer structure based on 3D Delaunay Triangulation," in Proc. of Septièmes rencontres francopohones sur les aspects Algorithmiques des T́eĺecommunications (AlgoTel), Presqu'île de Giens, France, May 2005.
15. G. Voronöi, "Nouvelles applications des paramètres continus à la th́eorie des formes quadratiques," J. Reine Angew. Math, vol.134, pp. 198-287, 1908.
16. D. F. Watson, "Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes," The Computer Journal, vol.24, no. 2, pp. 167-172, 1981. (Pubitemid 12503887)