1 / 3

Universit à degli Studi di Pisa Dipartimento di Informatica

AOI CAST TOLERANCE BASED COMPASS ROUTING IN DISTRIBUTED VIRTUAL ENVIRONMENTS Michele Albano, Luca Genovali, Antonio Quartulli, Laura Ricci NETGAMES '09 Paris, November 23-24th, 2009. Universit à degli Studi di Pisa Dipartimento di Informatica. A VORONOI BASED APPROACH FOR P2P DVE.

eden-estes
Download Presentation

Universit à degli Studi di Pisa Dipartimento di Informatica

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. AOI CAST TOLERANCE BASED COMPASS ROUTING INDISTRIBUTED VIRTUAL ENVIRONMENTSMichele Albano, Luca Genovali, Antonio Quartulli,Laura RicciNETGAMES '09 Paris, November 23-24th, 2009 Università degli Studi di PisaDipartimento di Informatica

  2. A VORONOI BASED APPROACH FOR P2P DVE Definition of a Voronoi Tessellation of the DVE each peer is paired with a DVE region including the points of the DVE closer to it w.r.t. any other peer P2P Overlay: defined by the Delaunay Triangulation corresponding to the Voronoi Tessellation Our proposal: AOI-cast, a new strategy to propagate the heartbeats in the Area of Interest of a peer based on reverse compass routing, a routing algorithm exploiting the properties of the Delaunay Triangulation introduces a Tolerance threashold to guarantee the delivery of the heartbeats in presence of network delay

  3. A VORONOI BASED APPROACH FOR P2P DVE Compass Routing: A5 chooses A as next hop because RootA5A<Root A5 A1andRoot A5 A <Root A5 A4 Each node reverses compass routing to detect its sons in the AOI-cast tree: A5 is A next hop in the AOI-tree Routing algorithm: Neighbour Ordering: a node n orders its Voronoi neighbours according to a counter-clockwise ordering Define a set S of conditions to detect neighbour regions intersecting the border of the DVE Children Detection: for each neighbour p of n the angle evaluation phase is executed by considering pred(p) and/or succ(p), depending on the conditions in S

More Related