1 / 6

Efficient Overlay Construction for Minimizing Latency in Distributed Systems

This research focuses on constructing efficient overlay trees to optimize traffic and latency from an event source to subscribers in a distributed Internet environment. We examine two models: Model 1 restricts subscribers from relaying traffic using a restricted Steiner tree and presents a new approximation algorithm with a factor of 4.1. Model 2 allows subscribers to relay traffic, applying existing strategies for the minimum Steiner tree problem. Additionally, we address load balancing events where machines act as dispatchers or servers, exploring variations of optimization objectives.

teal
Télécharger la présentation

Efficient Overlay Construction for Minimizing Latency in Distributed Systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Constructing Efficient Overlays • Problem formulation • Given a set of subscribers and a set of machines, distributed in the Internet • Construct an overlay tree to minimize the traffic/latency from the event source to the subscribers

  2. Constructing Efficient Overlays (Cont.) • Model 1 • Subscribers cannot relay traffic • Restricted steiner tree • Developed a new approximation algorithm with a factor of 4.1 • Model 2 (p2p) • Subscribers can relay traffic • Minimum steiner tree problem • Apply existing approximation algorithms

  3. Load Balancing events • Given a set of machines • Machine i can handle Di rectangles as a dispatcher or Si rectangles as a server • Problem: • Which set of machines are servers, and which set of machines aredispatcher? • How to assign server machines to dispatcher machines? • Objective function min(max sj/Sj or dj/Dj) D D D S S S S S

  4. Four Variations of the Problem • Configured or not • Whether each machine is already configured to be a dispatcher or a server • Unique or not • Whether each server can only be assigned to a unique dispatcher or multiple dispatchers

  5. Approaches Optimization objective: min(max sj/Sj or dj/Dj)

More Related