A revised media feature set matching algorithm
draft-klyne-conneg-feature-match-03
Document | Type |
Expired Internet-Draft
(individual)
Expired & archived
|
|
---|---|---|---|
Author | Graham Klyne | ||
Last updated | 2000-04-07 | ||
RFC stream | (None) | ||
Intended RFC status | (None) | ||
Formats | |||
Stream | Stream state | (No stream defined) | |
Consensus boilerplate | Unknown | ||
RFC Editor Note | (None) | ||
IESG | IESG state | Expired | |
Telechat date | (None) | ||
Responsible AD | (None) | ||
Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
RFC 2533, 'A syntax for describing media feature sets', defines a format to express media feature sets that represent media handling capabilities. It also describes an algorithm for matching these feature sets, which may be used, for example, to determine whether the capabilities of a sender and receiver are compatible. This memo describes a revised form of the feature set matching algorithm, which incorporates lessons learned while implementing the original algorthm. It is anticipated that this revised algorithm description will be included in a future revision of RFC 2533. This memo does not affect any of the normative content of RFC 2533.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)