![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to Hypermedia Systems and Data Models We discuss the use of Freenet-like content hash GUIDs as a primitive for implementing the Xanadu model in a peer-to-peer framework. Our current prototype is able to display the implicit connection (transclusion) between two different references to the same permanent ID. We discuss the next layers required in the implementation of the Xanadu model on a world-wide peer-to-peer network. ![]() DiSC'03 © 2003 Association for Computing Machinery |