DHT Broadcast Optimisation with ID Assignment Rules.
Michael Roth, Julia Schmitt, Florian Kluge, Theo Ungerer · 2013
Decision making in a self-optimising distributed Organic Computing system requires information about the sys-tem’s state. Accurate information enables the overall system to respond better to state changes. Distributed systems can use different network protocols, e.g UPD or TCP/IP, to connect the nodes. There is no guarantee that all of these network protocols are able to send broad-casts. If all used network protocols support broadcast it is still not sure that broadcasts can be sent across differ-ent protocol domains, e.g. from UPD to TCP/IP. We use therefore distributed hash tables (DHT) to enable an ap-plication layer broadcast for information dissemination, which only sends unicast messages in the network layer to spread node status information in a distributed sys-tem. In DHTs the node IDs are used to determine the communication partner. The node IDs are generated ran-domly in DHTs. In this paper we show how choosing IDs systematically, instead of generating them randomly, in-fluences the network usage by using our DHT broadcast algorithms for information dissemination.