Publication

Query-load balancing in structured overlays

Karl Aberer, Anwitaman Datta
2007
Conference Papers

Abstract

Query-load (forwarding and answering) balancing in structured overlays is one of the most critical and least studied problems. It has been assumed that caching heuristics can take care of it. We expose that caching, while necessary, is not in itself sufficient. We then provide simple and effective load-aware variants of the standard greedy routing used in overlays exploiting routing redundancy (originally needed for fault- tolerance) to achieve very good query load-balancing.

Official source

https://infoscience.epfl.ch/entities/publication/9a9a78e5-adb2-4962-a64e-16069e4a4a1e

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Query-load balancing in structured overlays

Chat with Graph Search

From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization

Anchor View Allocation for Collaborative Free Viewpoint Video Streaming

Structured Overlay For Heterogeneous Environments: Design and Evaluation of Oscar