3,064 research outputs found

    Real Time Wake Computations using Lattice Boltzmann Method on Many Integrated Core Processors

    Get PDF
    This paper puts forward an efficient Lattice Boltzmann method for use as a wake simulator suitable for real-time environments. The method is limited to low speed incompressible flow but is very efficient and can be used to compute flows “on the fly”. In particular, many-core machines allow for the method to be used with the need of very expensive parallel clusters. Results are shown here for flows around cylinders and simple ship shapes

    Real Time Wake Computations using Lattice Boltzmann Method on Many Integrated Core Processors

    Get PDF
    This paper puts forward an efficient Lattice Boltzmann method for use as a wake simulator suitable for real-time environments. The method is limited to low speed incompressible flow but is very efficient and can be used to compute flows “on the fly”. In particular, many-core machines allow for the method to be used with the need of very expensive parallel clusters. Results are shown here for flows around cylinders and simple ship shapes

    Many-to-Many Matching Games for Proactive Social-Caching in Wireless Small Cell Networks

    Full text link
    In this paper, we address the caching problem in small cell networks from a game theoretic point of view. In particular, we formulate the caching problem as a many-to-many matching game between small base stations and service providers' servers. The servers store a set of videos and aim to cache these videos at the small base stations in order to reduce the experienced delay by the end-users. On the other hand, small base stations cache the videos according to their local popularity, so as to reduce the load on the backhaul links. We propose a new matching algorithm for the many-to-many problem and prove that it reaches a pairwise stable outcome. Simulation results show that the number of satisfied requests by the small base stations in the proposed caching algorithm can reach up to three times the satisfaction of a random caching policy. Moreover, the expected download time of all the videos can be reduced significantly

    A Marketplace for Efficient and Secure Caching for IoT Applications in 5G Networks

    Get PDF
    As the communication industry is progressing towards fifth generation (5G) of cellular networks, the traffic it carries is also shifting from high data rate traffic from cellular users to a mixture of high data rate and low data rate traffic from Internet of Things (IoT) applications. Moreover, the need to efficiently access Internet data is also increasing across 5G networks. Caching contents at the network edge is considered as a promising approach to reduce the delivery time. In this paper, we propose a marketplace for providing a number of caching options for a broad range of applications. In addition, we propose a security scheme to secure the caching contents with a simultaneous potential of reducing the duplicate contents from the caching server by dividing a file into smaller chunks. We model different caching scenarios in NS-3 and present the performance evaluation of our proposal in terms of latency and throughput gains for various chunk sizes
    • 

    corecore