Conferences related to Cooperative caching

Back to Top

ICC 2021 - IEEE International Conference on Communications

IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.


2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA)

Computer Architecture


2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC)

IEEE CCNC 2020 will present the latest developments and technical solutions in the areas of home networking, consumer networking, enabling technologies (such as middleware) and novel applications and services. The conference will include a peer-reviewed program of technical sessions, special sessions, business application sessions, tutorials, and demonstration sessions.


2020 IEEE Wireless Communications and Networking Conference (WCNC)

IEEE WCNC is the world premier wireless event that brings together industry professionals, academics, and individuals from government agencies and other institutions to exchange information and ideas on the advancement of wireless communications and networking technology. The conference will feature a comprehensive technical program offering numerous technical sessions with papers showcasing the latest technologies, applications and services. In addition, the conference program includes workshops, tutorials, keynote talks from industrial leaders and renowned academics, panel discussions, a large exhibition, business and industrial forums.


GLOBECOM 2020 - 2020 IEEE Global Communications Conference

IEEE Global Communications Conference (GLOBECOM) is one of the IEEE Communications Society’s two flagship conferences dedicated to driving innovation in nearly every aspect of communications. Each year, more than 2,900 scientific researchers and their management submit proposals for program sessions to be held at the annual conference. After extensive peer review, the best of the proposals are selected for the conference program, which includes technical papers, tutorials, workshops and industry sessions designed specifically to advance technologies, systems and infrastructure that are continuing to reshape the world and provide all users with access to an unprecedented spectrum of high-speed, seamless and cost-effective global telecommunications services.


More Conferences

Periodicals related to Cooperative caching

Back to Top

Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)


Communications Magazine, IEEE

IEEE Communications Magazine was the number three most-cited journal in telecommunications and the number eighteen cited journal in electrical and electronics engineering in 2004, according to the annual Journal Citation Report (2004 edition) published by the Institute for Scientific Information. Read more at http://www.ieee.org/products/citations.html. This magazine covers all areas of communications such as lightwave telecommunications, high-speed data communications, personal communications ...


Communications Surveys & Tutorials, IEEE

Each tutorial reviews currents communications topics in network management and computer and wireless communications. Available tutorials, which are 2.5 to 5 hours in length contains the original visuals and voice-over by the presenter. IEEE Communications Surveys & Tutorials features two distinct types of articles: original articles and reprints. The original articles are exclusively written for IEEE Communications Surveys & Tutorials ...


Communications, IEEE Transactions on

Telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; and communication theory. In addition to the above, ...


Computer

Computer, the flagship publication of the IEEE Computer Society, publishes peer-reviewed technical content that covers all aspects of computer science, computer engineering, technology, and applications. Computer is a resource that practitioners, researchers, and managers can rely on to provide timely information about current research developments, trends, best practices, and changes in the profession.


More Periodicals

Most published Xplore authors for Cooperative caching

Back to Top

Xplore Articles related to Cooperative caching

Back to Top

A Cooperative Caching Algorithm for Cluster-Based Vehicular Content Networks with Vehicular Caches

2017 IEEE Globecom Workshops (GC Wkshps), 2017

In this paper, a cooperative caching algorithm is proposed for cluster-based vehicular content networks (VCNs) with vehicular caches. Different from the existing non-cooperative algorithm, the proposed algorithm is designed based on the globe caching status of vehicular clusters and the caching capacity constraints of vehicles. A novel average accumulated network cost metric is defined, i.e., a weighted sum of average ...


Coordinated placement and replacement for large-scale distributed caches

Proceedings 1999 IEEE Workshop on Internet Applications (Cat. No.PR00197), 1999

In a large-scale information system such as a digital library or the World Wide Web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions. Using simulation, we examine three practical cooperative placement algorithms, including one that is provably close to optimal, and we compare these algorithms to the optimal placement algorithm and several cooperative ...


An Effective Cooperative Cache Replacement Policy for Mobile P2P Environments

2006 International Conference on Hybrid Information Technology, 2006

Recent researches in cooperative caching systems combined with P2P (peer-to- peer) web caching for mobile environments have been made quite actively owing to the advances in mobile technology. The hybrid cooperative caching technology in mobile environments enables P2P systems to achieve improved caching performance by utilizing the caches in neighbor peers. However, there is an important limitation of mobile caching ...


Cooperative Online Caching in Small Cell Networks with Limited Cache Size and Unknown Content Popularity

2018 3rd International Conference on Computer and Communication Systems (ICCCS), 2018

In this paper, we study delay-aware cooperative online content caching with limited caching space and unknown content popularity in dense small cell wireless networks. We propose a Cooperative Online Content cAching algorithm (COCA) that decides in which BS the requested content should be cached with considerations of three important factors: the residual cache space in each small cell basestation (SBS), ...


Performance of Web Caching in High Density Mobile Networks

2009 Eighth IEEE/ACIS International Conference on Computer and Information Science, 2009

Our study demonstrated that caching scheme performs better in high density mobile networks than in sporadic circumstance. Based on the analysis of correlation between cache performance and the zipf-like user behaviors, we proposed some possible methods to improve cache performance in high density mobile networks.


More Xplore Articles

Educational Resources on Cooperative caching

Back to Top

IEEE-USA E-Books

  • A Cooperative Caching Algorithm for Cluster-Based Vehicular Content Networks with Vehicular Caches

    In this paper, a cooperative caching algorithm is proposed for cluster-based vehicular content networks (VCNs) with vehicular caches. Different from the existing non-cooperative algorithm, the proposed algorithm is designed based on the globe caching status of vehicular clusters and the caching capacity constraints of vehicles. A novel average accumulated network cost metric is defined, i.e., a weighted sum of average accumulated normalized backhaul cost and average accumulated normalized vehicular caching cost. Given the mobility model and content distribution model of a vehicular cluster, the average accumulated network cost of the proposed algorithm can be obtained. Simulation results show that the proposed algorithm is more effective to reduce the average accumulated network cost compared with the existing algorithm under different scenarios.

  • Coordinated placement and replacement for large-scale distributed caches

    In a large-scale information system such as a digital library or the World Wide Web, a set of distributed caches can improve their effectiveness by coordinating their data placement decisions. Using simulation, we examine three practical cooperative placement algorithms, including one that is provably close to optimal, and we compare these algorithms to the optimal placement algorithm and several cooperative and non-cooperative replacement algorithms. We draw five conclusions from these experiments: (1) cooperative placement can significantly improve performance compared to local replacement algorithms, particularly when the size of individual caches is limited compared to the universe of objects; (2) although the Amortized Placement algorithm is only guaranteed to be within 14 times the optimal, in practice it seems to provide an excellent approximation of the optimal; (3) in a cooperative caching scenario, the GreedyDual local replacement algorithm performs much better than the other local replacement algorithms; (4) our Hierarchical GreedyDual replacement algorithm yields further improvements over the GreedyDual algorithm, especially when there are idle caches in the system; and (5) a key challenge to coordinated placement algorithms is generating good predictions of access patterns based on past accesses.

  • An Effective Cooperative Cache Replacement Policy for Mobile P2P Environments

    Recent researches in cooperative caching systems combined with P2P (peer-to- peer) web caching for mobile environments have been made quite actively owing to the advances in mobile technology. The hybrid cooperative caching technology in mobile environments enables P2P systems to achieve improved caching performance by utilizing the caches in neighbor peers. However, there is an important limitation of mobile caching system that the cache space of a mobile device is generally restricted. In this paper, we propose an effective cooperative cache replacement policy for mobile P2P environments that exploiting the sizes of objects in a system. The proposed replacement policy stores smaller objects in the local cache of each peer and stores larger objects in the local cache of its "idle" neighbor peer who has the least activity among its peers. The activity of a peer is determined by the request frequency and the latest request time. We compared the proposed replacement policy with the existing replacement policies for various mobile environments. The experiment results show that the proposed replacement policy achieves better performance than the existing replacement policies in terms of the hit ratio and the byte hit ratio. Especially when the cache size is reasonably small, the proposed replacement policy shows outstanding performance.

  • Cooperative Online Caching in Small Cell Networks with Limited Cache Size and Unknown Content Popularity

    In this paper, we study delay-aware cooperative online content caching with limited caching space and unknown content popularity in dense small cell wireless networks. We propose a Cooperative Online Content cAching algorithm (COCA) that decides in which BS the requested content should be cached with considerations of three important factors: the residual cache space in each small cell basestation (SBS), the number of coordinated connections each SBS establishes with other SBSs, and the number of served users in the coverage area of each SBS. In addition, due to limited storage space in the cache, the proposed COCA algorithm eliminates the least recently used (LRU) contents to free up the space. We compare the delay performance of the proposed COCA algorithm with the existing offline cooperative caching schemes through simulations. Simulation results demonstrate that the proposed COCA algorithm has a better delay performance than the existing offline algorithms.

  • Performance of Web Caching in High Density Mobile Networks

    Our study demonstrated that caching scheme performs better in high density mobile networks than in sporadic circumstance. Based on the analysis of correlation between cache performance and the zipf-like user behaviors, we proposed some possible methods to improve cache performance in high density mobile networks.

  • AHP Based Cooperative Cache Path Support in Mobile AD HOC Network

    All wireless networks possess self-organizing architecture with an infrastructure-less feature to combine and form an Ad Hoc network called MANET (Mobile Ad Hoc network). All mobile nodes working under this network are routers and they are connected through wireless links in those networks. Mobile routers in the wireless network have the freedom to move and they have ability to organize themselves arbitrarily. This feature makes wireless topology to change very often and the data predictability in such a dynamic environment becomes complex. This makes the data access in such environment weak and data loss may occur due to intermittent network connections. Therefore, the restricted power supplies make way for data loss. Therefore, enhanced method with Cooperative cache path is proposed in this paper. This method deals with time and energy efficient technique for local communication with an efficient caching algorithm using Analytic Hierarchy Process. Data Sharing and mobile node coordination of cached data among multiple mobile nodes enable better cache performance to have quick data access with proper latency and enhances data availability in a frequently changing dynamic mobile environment. Proper selection of wireless path with optimal solution gives significant improvement in performance of the network. This paper targets and concentrates on selecting the effective routing cache paths to transfer data in those paths by considering multiple criteria using AHP method.

  • Research on the client-side cache technology of the intelligent network disk storage system

    Intelligent network disk (IND) storage system is a novel network storage system, in this storage system, the increasing number of clients and the probability of non-contiguous data access will reduce the hit rate of limited cache and lower the performance of storage system. This paper presents a client-side cache model of IND storage system, and introduces a strategy of page swapping to protect single copy based on LRU. The experiment shows that method above can effectively reduce the negative influence of the increasing number of clients and improve the performance of IND storage system.

  • A novel greedy heuristic placement algorithm in distributed cooperative proxy systems

    We investigate the object placement problem in distributed cooperative proxy systems and build a mathematics model. We prove that the problem is a NP-hard problem and a novel greedy heuristic placement algorithm (GHPA) is proposed to get the near-optimal answer in a polynomial complexity. We perform simulation and the results reported in the paper show that the GHPA algorithm could achieve better performance than the traditional MFU algorithm in both relative placement cost and the load balance. In general, the technology proposed could be used to develop effective distributed cooperative proxy systems such as CDSP, digital libraries and so on.

  • New Algorithms for File System Cooperative Caching

    We present two new cooperative caching algorithms that allow a cluster of file system clients to cache chunks of files instead of directly accessing them from origin file servers. The first algorithm, called C-LRU (Cooperative-LRU), is based on the simple D-LRU (Distributed-LRU) algorithm, but moves a chunk's position closer to the tail of its local LRU list when the number of copies of the chunk increases. The second algorithm, called RobinHood, is based on the N-Chance algorithm, but targets chunks cached at many clients for replacement when forwarding a singlet to a peer. We evaluate these algorithms on a variety of workloads, including several publicly available traces, and find that the new algorithms significantly outperform their predecessors.

  • Profitable Cooperative Region for Distributed Online Edge Caching

    Cooperative caching can unify network storage to improve efficiency, but the effective placement and search of contents are challenging especially in distributed edge clouds with neither a-priori knowledge on content requests nor instantaneous global view. This paper establishes a new profitable cooperative region for every content request admitted at an edge server, within which the content, if cached, can be retrieved with guaranteed profit against a direct retrieval from the network backbone. This narrows down the search for the content. The caching density of the content can also be significantly reduced, e.g., to a cached copy per region. The regions are based on a novel distributed framework which allows individual servers to spontaneously admit/dispatch requests and deliver/forward contents, while asymptotically maximizing the time-average profit of caching. The cooperative region for a content is erected at individual servers by comparing the upper and lower bounds for the backlogs of unsatisfied requests of the content. Simulations show the substantially improved profit of the proposed approach over existing solutions. The regions can help automate the placement of contents with reduced density and improved efficiency.



Standards related to Cooperative caching

Back to Top

No standards are currently tagged "Cooperative caching"


Jobs related to Cooperative caching

Back to Top