# RFC Errata

Found 2 records.

## Status: Verified (1)

### RFC 6029, "A Survey on Research on the Application-Layer Traffic Optimization (ALTO) Problem", October 2010

Source of RFC: IRTF
Errata ID: 3097

**Status: Verified
Type: Editorial
**

Reported By: Wes Eddy

Date Reported: 2012-01-27

Verifier Name: Lars Eggert

Date Verified: 2012-01-30

Section 2.1 says:

In such a technique, given a cost function C, a set of vertexes V and their corresponding edges, the triangle inequality holds if for any triple {a, b, c} in V, C(a, c) is always less than or equal to C(a, g) + C(b, c).

It should say:

In such a technique, given a cost function C, a set of vertexes V and their corresponding edges, the triangle inequality holds if for any triple {a, b, c} in V, C(a, c) is always less than or equal to C(a, b) + C(b, c).

Notes:

A 'g' instead of a 'b' appears in the triangle inequality description.

## Status: Held for Document Update (1)

### RFC 6029, "A Survey on Research on the Application-Layer Traffic Optimization (ALTO) Problem", October 2010

Source of RFC: IRTF
Errata ID: 3099

**Status: Held for Document Update
Type: Editorial
**

Reported By: Ivica Rimac

Date Reported: 2012-01-30

Held for Document Update by: Lars Eggert

Section 2.1 says:

In such a technique, given a cost function C, a set of vertexes V and their corresponding edges, the triangle inequality holds if for any triple {a, b, c} in V, C(a, c) is always less than or equal to C(a, g) + C(b, c).

It should say:

In such a technique, given a cost function C, a set of vertices V and their corresponding edges, the triangle inequality holds if for any triple {a, b, c} in V, C(a, c) is always less than or equal to C(a, b) + C(b, c).

Notes:

"vertexes" -> "vertices"