Laura Ricci - Academia.edu (original) (raw)

Papers by Laura Ricci

Research paper thumbnail of JaDE: A JXTA support for distributed virtual environments

2008 IEEE Symposium on Computers and Communications, 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of JaDE: A JXTA support for distributed virtual environments

2008 IEEE Symposium on Computers and Communications, 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of DDT: A distributed data structure for the support of P2P range query

Proceedings of the 5th International ICST Conference on Collaborative Computing: Networking, Applications, Worksharing, 2009

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Integration of P2P and Clouds to support Massively Multiuser Virtual Environments

2010 9th Annual Workshop on Network and Systems Support for Games, 2010

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Service and Resource Discovery supports over P2P overlays

2009 International Conference on Ultra Modern Telecommunications & Workshops, 2009

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Reducing traffic in DHT-based discovery protocols for dynamic resources

Grids, P2P and Services Computing, 2010

Existing peer-to-peer approaches for resource location based on distributed hash tables focus mai... more Existing peer-to-peer approaches for resource location based on distributed hash tables focus mainly on optimizing lookup query resolution. The underlying assumption is that the arrival ratio of lookup queries is higher than the ratio of resource publication operations. We propose a set of optimization strategies to reduce the network traffic generated by the data publication and update process when resources have dynamic-valued attributes. We aim at reducing the publication overhead of supporting multi-attribute range queries. We develop ...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Distributed Virtual Environments: From client server to cloud and P2P architectures

2012 International Conference on High Performance Computing & Simulation (HPCS), 2012

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Reducing Server Load in MMOG via P2P Gossip

2012 11th Annual Workshop on Network and Systems Support for Games (NetGames), 2012

Abstract A fundamental problem for the development of Massively Multiplayer Online Games (MMOGs) ... more Abstract A fundamental problem for the development of Massively Multiplayer Online Games (MMOGs) is the definition of a mechanism supporting interest management, ie determining all the entities of the virtual world that are relevant for a given peer. To this end, we propose a hybrid architecture combining centralized and P2P solutions. Our proposal exploits a P2P gossip-based approach supporting a best-effort resolution of interest management, so that it can be mostly supported through the P2P overlay, with minimal intervention of a ...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Probabilistic Dropping in Push and Pull Dissemination over Distributed Hash Tables

2011 IEEE 11th International Conference on Computer and Information Technology, 2011

Abstract Dynamic information management via Distributed Hash Tables (DHT) is an important problem... more Abstract Dynamic information management via Distributed Hash Tables (DHT) is an important problem which revolves around the trade-off between data freshness and the overhead due to information updates. We propose two different algorithms based on information pull and information push models, that enable dynamic information dissemination with low overhead over a DHT. We exploit the concept of popularity of specific items, which is evaluated by performing a real-time analysis of the query distribution, and ...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Integrating peer-to-peer and cloud computing for massively multiuser online games

Peer-to-Peer Networking and Applications, 2013

ABSTRACT Cloud computing has recently become an attractive solution for massively multiplayer onl... more ABSTRACT Cloud computing has recently become an attractive solution for massively multiplayer online games, also known as MMOGs, as it lifts operators from the burden of buying and maintaining large amount of computational, storage and communication resources, while offering the illusion of infinite scalability. Yet, cloud resources do not come for free: a careful orchestration is needed to minimize the economical cost. This paper proposes a novel architecture for MMOGs that combines an elastic cloud infrastructure with user-provided resources, to boost both the scalability and the economical sustainability provided by cloud computing. Our system dynamically reconfigures the platform while managing the trade-off between economical cost and quality of service, exploiting user-provided resources whenever possible. Simulation results show that a negligible reduction in the quality of service can reduce the cost of the platform up to 60 % percent.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Managing Virtual Entities in MMOGs: A Voronoi-Based Approach

Communications in Computer and Information Science, 2014

ABSTRACT The definition of a distributed architecture for Massively Multiplayer Online Game raise... more ABSTRACT The definition of a distributed architecture for Massively Multiplayer Online Game raises several research challenges. Among these, the problem of managing the virtual entities of the MMOG and of maintaining their persistence is one of the most relevant ones. The management of the entities cannot be simply delegated to the peers, because the load assigned to a single peer may be high. Furthermore, a centralized server is needed to manage the state of the entities when all the peers leave the game. This paper proposes an integrated server/P2P architecture for MMOG and focus on the problem of the assignment of the virtual entities to the server/peers. We propose to define this assignment through a Voronoi Tessellation which is defined by exploiting the position of the peers. Each peer manages the entities located in the intersection of a superset of its Area of Interest and of its Voronoi region, while the entities located outside these areas are assigned to the server. A set of experimental results proving the effectiveness of our approach are presented.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of State management in Distributed Virtual Environments: A Voronoi base approach

International Congress on Ultra Modern Telecommunications and Control Systems, 2010

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Managing Virtual Entities in MMOGs: A Voronoi-Based Approach

Communications in Computer and Information Science, 2014

ABSTRACT The definition of a distributed architecture for Massively Multiplayer Online Game raise... more ABSTRACT The definition of a distributed architecture for Massively Multiplayer Online Game raises several research challenges. Among these, the problem of managing the virtual entities of the MMOG and of maintaining their persistence is one of the most relevant ones. The management of the entities cannot be simply delegated to the peers, because the load assigned to a single peer may be high. Furthermore, a centralized server is needed to manage the state of the entities when all the peers leave the game. This paper proposes an integrated server/P2P architecture for MMOG and focus on the problem of the assignment of the virtual entities to the server/peers. We propose to define this assignment through a Voronoi Tessellation which is defined by exploiting the position of the peers. Each peer manages the entities located in the intersection of a superset of its Area of Interest and of its Voronoi region, while the entities located outside these areas are assigned to the server. A set of experimental results proving the effectiveness of our approach are presented.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Voronoi models for distributed virtual environments

Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT '08, 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of AOI-Cast Strategies for P2P Massively Multiplayer Online Games

2009 6th IEEE Consumer Communications and Networking Conference, 2009

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Detecting determinate computations by bottom-up abstract interpretation

Lecture Notes in Computer Science, 1992

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Cloud Federations in Contrail

Lecture Notes in Computer Science, 2012

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Evaluating Compass Routing Based AOI-Cast by MOGs Mobility Models

Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques, 2011

Abstract The increasing popularity of Multiplayer Online Games (MOGs) is revealing a huge interes... more Abstract The increasing popularity of Multiplayer Online Games (MOGs) is revealing a huge interest from the research community. Many solutions exploiting P2P technologies have been proposed in order to overtake the limits of the centralized infrastructures. These solutions are based on the definition of a proper dynamic P2P overlay and exploit the concept of Area of Interest (AOI) to filter the information relevant for each player. An AOI-cast mechanism defines a spanning tree over the AOI so that the information generated by a ...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of AOI-cast by compass routing in Delaunay based DVE overlays

2011 International Conference on High Performance Computing & Simulation, 2011

Abstract This paper presents a AOI cast strategy for P2P Distributed Environments which is exploi... more 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, ie 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 ...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of A P2P REcommender System based on Gossip Overlays (PREGO)

2010 10th IEEE International Conference on Computer and Information Technology, 2010

Bookmarks Related papers MentionsView impact

Research paper thumbnail of JaDE: A JXTA support for distributed virtual environments

2008 IEEE Symposium on Computers and Communications, 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of JaDE: A JXTA support for distributed virtual environments

2008 IEEE Symposium on Computers and Communications, 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of DDT: A distributed data structure for the support of P2P range query

Proceedings of the 5th International ICST Conference on Collaborative Computing: Networking, Applications, Worksharing, 2009

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Integration of P2P and Clouds to support Massively Multiuser Virtual Environments

2010 9th Annual Workshop on Network and Systems Support for Games, 2010

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Service and Resource Discovery supports over P2P overlays

2009 International Conference on Ultra Modern Telecommunications & Workshops, 2009

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Reducing traffic in DHT-based discovery protocols for dynamic resources

Grids, P2P and Services Computing, 2010

Existing peer-to-peer approaches for resource location based on distributed hash tables focus mai... more Existing peer-to-peer approaches for resource location based on distributed hash tables focus mainly on optimizing lookup query resolution. The underlying assumption is that the arrival ratio of lookup queries is higher than the ratio of resource publication operations. We propose a set of optimization strategies to reduce the network traffic generated by the data publication and update process when resources have dynamic-valued attributes. We aim at reducing the publication overhead of supporting multi-attribute range queries. We develop ...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Distributed Virtual Environments: From client server to cloud and P2P architectures

2012 International Conference on High Performance Computing & Simulation (HPCS), 2012

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Reducing Server Load in MMOG via P2P Gossip

2012 11th Annual Workshop on Network and Systems Support for Games (NetGames), 2012

Abstract A fundamental problem for the development of Massively Multiplayer Online Games (MMOGs) ... more Abstract A fundamental problem for the development of Massively Multiplayer Online Games (MMOGs) is the definition of a mechanism supporting interest management, ie determining all the entities of the virtual world that are relevant for a given peer. To this end, we propose a hybrid architecture combining centralized and P2P solutions. Our proposal exploits a P2P gossip-based approach supporting a best-effort resolution of interest management, so that it can be mostly supported through the P2P overlay, with minimal intervention of a ...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Probabilistic Dropping in Push and Pull Dissemination over Distributed Hash Tables

2011 IEEE 11th International Conference on Computer and Information Technology, 2011

Abstract Dynamic information management via Distributed Hash Tables (DHT) is an important problem... more Abstract Dynamic information management via Distributed Hash Tables (DHT) is an important problem which revolves around the trade-off between data freshness and the overhead due to information updates. We propose two different algorithms based on information pull and information push models, that enable dynamic information dissemination with low overhead over a DHT. We exploit the concept of popularity of specific items, which is evaluated by performing a real-time analysis of the query distribution, and ...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Integrating peer-to-peer and cloud computing for massively multiuser online games

Peer-to-Peer Networking and Applications, 2013

ABSTRACT Cloud computing has recently become an attractive solution for massively multiplayer onl... more ABSTRACT Cloud computing has recently become an attractive solution for massively multiplayer online games, also known as MMOGs, as it lifts operators from the burden of buying and maintaining large amount of computational, storage and communication resources, while offering the illusion of infinite scalability. Yet, cloud resources do not come for free: a careful orchestration is needed to minimize the economical cost. This paper proposes a novel architecture for MMOGs that combines an elastic cloud infrastructure with user-provided resources, to boost both the scalability and the economical sustainability provided by cloud computing. Our system dynamically reconfigures the platform while managing the trade-off between economical cost and quality of service, exploiting user-provided resources whenever possible. Simulation results show that a negligible reduction in the quality of service can reduce the cost of the platform up to 60 % percent.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Managing Virtual Entities in MMOGs: A Voronoi-Based Approach

Communications in Computer and Information Science, 2014

ABSTRACT The definition of a distributed architecture for Massively Multiplayer Online Game raise... more ABSTRACT The definition of a distributed architecture for Massively Multiplayer Online Game raises several research challenges. Among these, the problem of managing the virtual entities of the MMOG and of maintaining their persistence is one of the most relevant ones. The management of the entities cannot be simply delegated to the peers, because the load assigned to a single peer may be high. Furthermore, a centralized server is needed to manage the state of the entities when all the peers leave the game. This paper proposes an integrated server/P2P architecture for MMOG and focus on the problem of the assignment of the virtual entities to the server/peers. We propose to define this assignment through a Voronoi Tessellation which is defined by exploiting the position of the peers. Each peer manages the entities located in the intersection of a superset of its Area of Interest and of its Voronoi region, while the entities located outside these areas are assigned to the server. A set of experimental results proving the effectiveness of our approach are presented.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of State management in Distributed Virtual Environments: A Voronoi base approach

International Congress on Ultra Modern Telecommunications and Control Systems, 2010

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Managing Virtual Entities in MMOGs: A Voronoi-Based Approach

Communications in Computer and Information Science, 2014

ABSTRACT The definition of a distributed architecture for Massively Multiplayer Online Game raise... more ABSTRACT The definition of a distributed architecture for Massively Multiplayer Online Game raises several research challenges. Among these, the problem of managing the virtual entities of the MMOG and of maintaining their persistence is one of the most relevant ones. The management of the entities cannot be simply delegated to the peers, because the load assigned to a single peer may be high. Furthermore, a centralized server is needed to manage the state of the entities when all the peers leave the game. This paper proposes an integrated server/P2P architecture for MMOG and focus on the problem of the assignment of the virtual entities to the server/peers. We propose to define this assignment through a Voronoi Tessellation which is defined by exploiting the position of the peers. Each peer manages the entities located in the intersection of a superset of its Area of Interest and of its Voronoi region, while the entities located outside these areas are assigned to the server. A set of experimental results proving the effectiveness of our approach are presented.

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Voronoi models for distributed virtual environments

Proceedings of the 2008 ACM CoNEXT Conference on - CONEXT '08, 2008

Bookmarks Related papers MentionsView impact

Research paper thumbnail of AOI-Cast Strategies for P2P Massively Multiplayer Online Games

2009 6th IEEE Consumer Communications and Networking Conference, 2009

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Detecting determinate computations by bottom-up abstract interpretation

Lecture Notes in Computer Science, 1992

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Cloud Federations in Contrail

Lecture Notes in Computer Science, 2012

Bookmarks Related papers MentionsView impact

Research paper thumbnail of Evaluating Compass Routing Based AOI-Cast by MOGs Mobility Models

Proceedings of the 4th International ICST Conference on Simulation Tools and Techniques, 2011

Abstract The increasing popularity of Multiplayer Online Games (MOGs) is revealing a huge interes... more Abstract The increasing popularity of Multiplayer Online Games (MOGs) is revealing a huge interest from the research community. Many solutions exploiting P2P technologies have been proposed in order to overtake the limits of the centralized infrastructures. These solutions are based on the definition of a proper dynamic P2P overlay and exploit the concept of Area of Interest (AOI) to filter the information relevant for each player. An AOI-cast mechanism defines a spanning tree over the AOI so that the information generated by a ...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of AOI-cast by compass routing in Delaunay based DVE overlays

2011 International Conference on High Performance Computing & Simulation, 2011

Abstract This paper presents a AOI cast strategy for P2P Distributed Environments which is exploi... more 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, ie 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 ...

Bookmarks Related papers MentionsView impact

Research paper thumbnail of A P2P REcommender System based on Gossip Overlays (PREGO)

2010 10th IEEE International Conference on Computer and Information Technology, 2010

Bookmarks Related papers MentionsView impact