29 research outputs found

    Enabling rapid and cost-effective creation of massive pervasive games in very unstable environments

    Get PDF
    Pervasive gaming is a new form of multimedia entertainment that extends the traditional computer gaming experience out into the real world. Through a combination of personal devices, positioning systems and other sensors, combined with wireless networking, a pervasive game can respond to player's movements and context and enable them to communicate with a game engine and other players. We review our recent deployment examples of pervasive games in order to explain their distinctive characteristics as wireless ad-hoc networking applications. We then identify the network support challenges of scaling pervasive games to include potentially mass numbers of players across extremely heterogeneous and unreliable networks. We propose a P2P overlay capable of storing large amount of game related data, which is the key to combating the loss of coverage and potential dishonesty of players. The proposed protocol decreases the deployment costs of the gaming infrastructure by self organization and utilizing storage space of users' devices. We demonstrate scalability and increased availability of data offered by the proposed protocol in simulation based evaluatio

    Solving key design issues for massively multiplayer online games on peer-to-peer architectures

    Get PDF
    Massively Multiplayer Online Games (MMOGs) are increasing in both popularity and scale on the Internet and are predominantly implemented by Client/Server architectures. While such a classical approach to distributed system design offers many benefits, it suffers from significant technical and commercial drawbacks, primarily reliability and scalability costs. This realisation has sparked recent research interest in adapting MMOGs to Peer-to-Peer (P2P) architectures. This thesis identifies six key design issues to be addressed by P2P MMOGs, namely interest management, event dissemination, task sharing, state persistency, cheating mitigation, and incentive mechanisms. Design alternatives for each issue are systematically compared, and their interrelationships discussed. How well representative P2P MMOG architectures fulfil the design criteria is also evaluated. It is argued that although P2P MMOG architectures are developing rapidly, their support for task sharing and incentive mechanisms still need to be improved. The design of a novel framework for P2P MMOGs, Mediator, is presented. It employs a self-organising super-peer network over a P2P overlay infrastructure, and addresses the six design issues in an integrated system. The Mediator framework is extensible, as it supports flexible policy plug-ins and can accommodate the introduction of new superpeer roles. Key components of this framework have been implemented and evaluated with a simulated P2P MMOG. As the Mediator framework relies on super-peers for computational and administrative tasks, membership management is crucial, e.g. to allow the system to recover from super-peer failures. A new technology for this, namely Membership-Aware Multicast with Bushiness Optimisation (MAMBO), has been designed, implemented and evaluated. It reuses the communication structure of a tree-based application-level multicast to track group membership efficiently. Evaluation of a demonstration application shows i that MAMBO is able to quickly detect and handle peers joining and leaving. Compared to a conventional supervision architecture, MAMBO is more scalable, and yet incurs less communication overheads. Besides MMOGs, MAMBO is suitable for other P2P applications, such as collaborative computing and multimedia streaming. This thesis also presents the design, implementation and evaluation of a novel task mapping infrastructure for heterogeneous P2P environments, Deadline-Driven Auctions (DDA). DDA is primarily designed to support NPC host allocation in P2P MMOGs, and specifically in the Mediator framework. However, it can also support the sharing of computational and interactive tasks with various deadlines in general P2P applications. Experimental and analytical results demonstrate that DDA efficiently allocates computing resources for large numbers of real-time NPC tasks in a simulated P2P MMOG with approximately 1000 players. Furthermore, DDA supports gaming interactivity by keeping the communication latency among NPC hosts and ordinary players low. It also supports flexible matchmaking policies, and can motivate application participants to contribute resources to the system

    AoI-based Multicast Routing over Voronoi Overlays with Minimal Overhead

    Get PDF
    The increasing pervasive and ubiquitous presence of devices at the edge of the Internet is creating new scenarios for the emergence of novel services and applications. This is particularly true for location- and context-aware services. These services call for new decentralized, self-organizing communication schemes that are able to face issues related to demanding resource consumption constraints, while ensuring efficient locality-based information dissemination and querying. Voronoi-based communication techniques are among the most widely used solutions in this field. However, when used for forwarding messages inside closed areas of the network (called Areas of Interest, AoIs), these solutions generally require a significant overhead in terms of redundant and/or unnecessary communications. This fact negatively impacts both the devices' resource consumption levels, as well as the network bandwidth usage. In order to eliminate all unnecessary communications, in this paper we present the MABRAVO (Multicast Algorithm for Broadcast and Routing over AoIs in Voronoi Overlays) protocol suite. MABRAVO allows to forward information within an AoI in a Voronoi network using only local information, reaching all the devices in the area, and using the lowest possible number of messages, i.e., just one message for each node included in the AoI. The paper presents the mathematical and algorithmic descriptions of MABRAVO, as well as experimental findings of its performance, showing its ability to reduce communication costs to the strictly minimum required.Comment: Submitted to: IEEE Access; CodeOcean: DOI:10.24433/CO.1722184.v1; code: https://github.com/michelealbano/mabrav

    Structured Peer-to-Peer Overlay Deployment on MANET: A Survey

    Get PDF
    There are many common characteristics between Peer-to-Peer (P2P) overlay networks and Mobile Ad-hoc Networks (MANET). Self-organization, decentralization, dynamicity and changing topology are the most shared features. Furthermore, when used together, the two approaches complement each other. P2P overlays provide data storage/retrieval functionality, and their routing information can complement that of MANET. MANET provides wireless connectivity between clients without depending on any pre-existing infrastructure. The aim of this paper is to survey current P2P over MANET systems. Specifically, this paper focuses on and investigates structured P2P over MANET. Overall, more than thirty distinct approaches have been classified into groups and introduced in tables providing a structured overview of the area. The survey addresses the identified approaches in terms of P2P systems, MANET underlay systems and the performance of the reviewed systems

    Architectures and Algorithms for Cloud-Based Multimedia Conferencing

    Get PDF
    Multimedia conferencing is the real-time exchange of multimedia content between multiple parties. It is the basis of several applications, such as distance learning, online meetings, and massively multiplayer online games. Cloud-based provisioning of multimedia conferencing has several benefits, like resource efficiency, elasticity, and scalability. However, it remains very challenging. A challenge, for instance, is the lack of holistic architectures which cover both the infrastructure and the platform layers of cloud-based multimedia conferencing applications. Another challenge is the lack of appropriate algorithms for resource allocation in the conferencing cloud to accommodate the fluctuating number of participants, while meeting the required quality of services (QoS). Yet another example is the lack of suitable algorithms for scaling the multimedia conferencing applications in the cloud while meeting both QoS requirements and cost efficiency objective. Unfortunately, the solutions proposed so far do not address these challenges. This thesis focuses on the architectural and algorithmic challenges of cloud-based multimedia conferencing. It proposes architectural components and interfaces for multimedia conferencing application provisioning, covering both the Platform-as-a-Service (PaaS) and the Infrastructure-as-a-Service (IaaS) layers. The proposed interfaces simplify multimedia conference service provisioning for a wide range of application providers. On the algorithmic side, it proposes resource allocation mechanisms that support scalability in terms of the number of participants while meeting the QoS. These mechanisms allocate the actual resources (e.g., CPU, RAM, and storage) in an optimal manner. Besides these mechanisms, it proposes the scalability approaches for cloud-based multimedia conferencing applications. To ensure cost efficiency, these proposed solutions enable fine-grained scalability of the applications with respect to the number of participants while considering the QoS requirements. All algorithmic problems in this thesis are formulated using the Integer Linear Programming (ILP) and heuristics have been designed and validated to solve them

    A Cloud Platform-as-a-Service for Multimedia Conferencing Service Provisioning

    Get PDF
    Multimedia Conferencing is the real-time exchange of media content (e.g. voice, video and text) between multiple participants. It is the basis of a wide range of conferencing applications such as massively multi-player online games and distance learning applications. For faster development as well as cost efficiency, developers of such conferencing applications can use conferencing services (e.g. dial-in audio conference) provided by third-parties. However, the third-party service providers face several challenges with respect to conferencing service provisioning (i.e. service development, deployment and management). One challenge is mastering complex low-level details of conferencing technologies, protocols and their interactions. Another challenge is resource elasticity. Number of conference participants varies during runtime. So resource utilization in an elastic manner is a critical factor to achieve cost efficiency. Cloud Computing can help tackle these challenges. It is a paradigm for swiftly provisioning a shared pool of configurable resources (e.g. services, applications, network and storage) on demand. It has three main service models: Infrastructure-as-a-Service (IaaS), Platform-as-a-Service (PaaS) and Software-as-a-Service (SaaS). Using a PaaS, service providers can provision conferencing services easily and offer them as SaaS. Nonetheless, cloud-based provisioning of conferencing services still remains a big challenge due to the shortcomings of existing PaaS. In this thesis, a PaaS architecture for conferencing service provisioning is proposed. It is based on a business model from the state of the art. It relies on conferencing IaaSs that, instead of VMs, offer conferencing substrates (e.g. dial-in signaling, video mixer and audio mixer). The conferencing PaaS enables composition of new conferences from substrates on the fly. Moreover, it provides conferencing service providers, who are experienced in programming, with high-level interfaces to abstract the internal complexities of conferencing. In order for PaaS to scale ongoing conferences elastically, an algorithm is also presented in this thesis. The conferencing PaaS is prototyped and performance measurements are made. The proposed algorithm’s performance is also evaluated
    corecore