<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML//EN">
<html>
  <head>
    <title>Talk Abstract</title>
  </head>

  <body bgcolor=white>
    <font face=helvetica>
    <h1><center>Scalability in Adaptive Multi-Metric Overlays

<br>Speaker:<a href="http://www.cs.duke.edu/~razor">Adolfo Rodriguez</a>
</center>
    </h1>
    <h3><center>(03/17/2004)</center></h3>
    <H3>Abstract </H3>
<hr>
Increasing application requirements have placed heavy emphasis on
building overlay networks to efficiently deliver data to multiple
receivers. A key performance challenge is simultaneously achieving
adaptivity to changing network conditions and scalability to large
numbers of users.  In addition, most current algorithms focus on a
single performance metric, such as delay or bandwidth, particular to
individual application requirements.  In this paper, we introduce a
two-fold approach for creating robust, high-performance overlays
called Adaptive Multi-Metric Overlays (AMMO).  First, AMMO uses an
adaptive, highly-parallel, and metric-independent protocol, TreeMaint,
to build and maintain overlay trees.  Second, AMMO provides a
mechanism for comparing overlay edges along specified
application performance goals to guide TreeMaint transformations.  We
have used AMMO to implement and evaluate a single-metric
(bandwidth-optimized) tree similar to Overcast and a
two-metric (delay-constrained, cost-optimized) overlay.

<br>
<br>
<hr>
Return to the SPIDER <a href="schedule.html">schedule</a>
<br clear=all>
    <hr>
    <address><a href="mailto:jaidev@cs.duke.edu">Jaidev Patwardhan</a></address>
<!-- Created: Tue Jan 27 15:25:27 EST 2004 -->
<!-- hhmts start -->
Last modified: Tue Jan 27 15:26:39 EST 2004
<!-- hhmts end -->
  </body>
</html>
