Browse Prior Art Database

Application-Layer Traffic Optimization (ALTO) Problem Statement (RFC5693)

IP.com Disclosure Number: IPCOM000188775D
Original Publication Date: 2009-Oct-01
Included in the Prior Art Database: 2009-Oct-23
Document File: 28 page(s) / 34K

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

J. Seedorf: AUTHOR [+2]

Abstract

Distributed applications -- such as file sharing, real-time communication, and live and on-demand media streaming -- prevalent on the Internet use a significant amount of network resources. Such applications often transfer large amounts of data through connections established between nodes distributed across the Internet with little knowledge of the underlying network topology. Some applications are so designed that they choose a random subset of peers from a larger set with which to exchange data. Absent any topology information guiding such choices, or acting on suboptimal or local information obtained from measurements and statistics, these applications often make less than desirable choices.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 8% of the total text.

Network Working Group                                         J. Seedorf Request for Comments: 5693                                           NEC Category: Informational                                        E. Burger                                                             Neustar Inc.                                                             October 2009

     Application-Layer Traffic Optimization (ALTO) Problem Statement

Abstract

   Distributed applications -- such as file sharing, real-time    communication, and live and on-demand media streaming -- prevalent on    the Internet use a significant amount of network resources.  Such    applications often transfer large amounts of data through connections    established between nodes distributed across the Internet with little    knowledge of the underlying network topology.  Some applications are    so designed that they choose a random subset of peers from a larger    set with which to exchange data.  Absent any topology information    guiding such choices, or acting on suboptimal or local information    obtained from measurements and statistics, these applications often    make less than desirable choices.

   This document discusses issues related to an information-sharing    service that enables applications to perform better-than-random peer    selection.

Status of This Memo

   This memo provides information for the Internet community.  It does    not specify an Internet standard of any kind.  Distribution of this    memo is unlimited.

Copyright Notice

   Copyright (c) 2009 IETF Trust and the persons identified as the    document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal    Provisions Relating to IETF Documents    (http://trustee.ietf.org/license-info) in effect on the date of    publication of this document.  Please review these documents    carefully, as they describe your rights and restrictions with respect    to this document.  Code Components extracted from this document must    include Simplified BSD License text as described in Section 4.e of    the Trust Legal Provisions and are provided without warranty as    described in the BSD License.

 Seedorf & Burger             Informational                      [Page 1]
 RFC 5693                 ALTO Problem Statement             October 2009

 Table of Contents

   1.  Introduction . . . . . . . . . . . . . . . . . . . . . . . . .  3

     1.1.  Overview . . . . . . . . . . . . . . . . . . . . . . . . .  3

     1.2.  State-of-th...