This work is represented by an internet draft. This maps URNs in LIFNs, which in turn are mapped to specific URLs. The hard part here is caching to make it run fast enough. This work is not being promoted as a standard but as a basis for learning more about URNs and the BFD model. Code is now available.
Information is available at and from .
Sesion II 7. One might use binary encoding of non-printable forms, but some compromise is needed. Compatibilities should be a primary concern in order to make URCs useful to other non-computer networking communities such as the library community. Should they be parsable independently, in other words are they self describing. There is also a question of whether a nested structure and precedence should be possible.