Open Chord version 1.0.4 User's Manual
|Organization Unit:||Lehrstuhl für Praktische Informatik||Author(s):||Loesing, Karsten; Kaffille, Sven||Publishing Institution:||Lehrstuhl für Praktische Informatik|
|Publisher Information:||Bamberg : opus||Issue Date:||2007||Page count/Size:||31 S. : Ill.||Publishing Institution:||Uni||Bamberg Series:||Bamberger Beiträge zur Wirtschaftsinformatik und Angewandten Informatik||Volume:||74||Abstract:||
In recent years peer-to-peer networks have developed from unstructured to structured overlay networks. Structured peer-to-peer overlay networks facilitate a bounded number of messages in the number of peers for querying and publishing content opposed to unstructured networks, which usually flood the network with messages. To prevent the messages from overflooding the network they have a bounded life time, which may cause that some published content will be lost. Structured peer-to-peer networks guarantee that all published content can be found. One well known structured overlay network is the chord distributed hash table. An implementation of chord is only available in C, but not in Java, which is used widely and often in computer science education. This manual describes an open source implementation of chord in Java - called Open Chord - and how it can be used in Java-based applications. It provides a console-based experimentation environment to explore the functionality of chord, as well.
|Catchwords:||Peer-to-Peer-Netz / Hash-Algorithmus / Chord / Online-Publikation
||Keywords:||Chord, Verteilte Hashtabelle, Java, Peer-to-Peer, Chord, Distributed Hash Table, Java, Peer-to-Peer, Chord, Verteilte Hashtabelle, Java, Peer-to-Peer, Distributed Hash Table,||DDC Subject Keywords:||004 Datenverarbeitung; Informatik||RVK - Regensburger Verbundklassifikation:||ST 265||URI:||https://fis.uni-bamberg.de/handle/uniba/109||URN:||urn:nbn:de:bvb:473-opus-1229||Document Type:||Other||Language(s):||English||Publication date:||19. September 2019|
Items in DSpace are protected by copyright