Resolvability

In networked information, a prime requirement is that, given the name of an object, one can access that object. For most of the name schemes which allow this, the name is in fact a more or less a compact representation of the steps one most go through to access the object.

In some cases (such as gopher), knowledge of the data type is deemed to be part of the retrieval algorithm. In the Gopher case, the type information is always conventionally carried allong with every reference, that is, item in a gopher menu. In other cases (such as FTP), this is not practical, because the FTP server itself cannot provide type information.

One hopes that in the near future, distributed replicated look-up services will provide a more resilient way of resolving names.

(up to requirements ,

Tim BL