AOI-cast by compass routing in Delaunay based DVE overlays

Author

Ricci, Laura ; Carlini, Emanuele ; Genovali, Luca ; Coppola, Massimo

fYear

2011

fDate

4-8 July 2011

Firstpage

135

Lastpage

142

Abstract

This paper presents a AOI cast strategy for P2P Distributed Environments which is exploited to notify the position up dates of a peer P, i.e. its heartbeats, to all the peers located in its Area of Interest. An algorithm for the construction of a spanning tree covering all the peers is presented. The algorithm exploits the properties of Delaunay Triangulations to reduce the traffic load on the P2P overlay. The paper presents a set of formal results which hold when the AOI is a circular area and the root of the tree is at the center of the area. The algorithm is then refined to take into account possible inconsistencies among the local views of the peers due to the latency of the underlying network. A set of experimental results are presented.

Keywords

computational geometry; distributed processing; mesh generation; peer-to-peer computing; trees (mathematics); AOI cast strategy; Delaunay based DVE overlays; Delaunay triangulations; P2P distributed environments; area of interest; compass routing; spanning tree construction; traffic load reduction; Clocks; Compass; Heart beat; Image edge detection; Peer to peer computing; Radiation detectors; Routing; Cooperative Information Systems and Applications; Message Passing; Peer to Peer Architectures and Networks; Routing Synchronization and Consistency;

fLanguage

English

Publisher

ieee

Conference_Titel

High Performance Computing and Simulation (HPCS), 2011 International Conference on

Conference_Location

Istanbul

Print_ISBN

978-1-61284-380-3

Type

conf

DOI

10.1109/HPCSim.2011.5999817

Filename

5999817