dtnrg-3----Page:24
1  2  3  4  5  6  7  8  9  10  11  12  13  14  15  16  17  18  19  20  21  22  23  24  25  26  27  28  29  30  31  32  33  34  35  36  37  38  39  40  41 

Declarative Paradigm in SPINDLE
We have a unique declarative approach based on Deductive Databases
declare facts and rules in KB implemented in Flora-2/XSB
connectivity, naming, and bundle metadata information stored as facts
routing, forwarding and link scheduling performed by execution of rules
facilitates decision making and search in a rich space of dynamic facts/rules
flexible and extensible framework

Using the declarative paradigm, we have prototyped DTN algorithms
routing: random walk, replicated forwarding, link state, hybrid
policy: routing, forwarding, bundle scheduling, discard, …
late binding: dynamic intentional name resolution
PPT Version