My name is Chuck Cartledge. I am a perennial student at Old Dominion University, Norfolk, Virginia. I strongly believe that the field of computer science continues to change,
and that everything that we learn or are taught has a half life of about 3 years. Because of this
belief, I have spent what some consider to be an inordinate amount of time going
back to the education well and replenishing my skill set.
To paraphrase the old adage "the more tools you have in your tool bag, the fewer problems look like nails."
BTW: One of the things that I've noticed and haven't figured a way around is that SlideShare seems to not support PPT animations (for instance on slides 5 and 8 of the presentation) and some clicks to external pages (for instance on slide 20). Inside Powerpoint, clicking on the graph on slide 20 will take you to the Youtube video shown here:
The movie starts off with a baseline graph that alternately gets attacked and repairs itself. Nodes that are isolated from the graph are shown in red, while those that are still connected to at least one other node are shown in cyan. This game goes on for 10 turns just to show how a graph can be evaluated to quantify how long it will last given that some nodes become isolated and then try to regain membership into the larger graph. These are some of the ideas behind the paper.
Movies and what-not in support of the current effort
How DOs preservation copies are spread across a set of hosts (from a host's perspective).
There are 1,000 DOs that desire to have at least 3 and no more than 5 preserved copies of themselves. Each host can have at most 5 preservation copies, and an unlimited number of locally owned/supported DOs. As each DO is added to the system, it is assigned to a host (a blue line going up) and (hopefully) a copy is preserved (red line going down). Both DOs and copies appear to be spread across all hosts evenly randomly.
How DOs preservation copies are spread across a set of hosts (from a node's perspective).
There are 1,000 DOs that desire to have at least 3 and no more than 5 preserved copies of themselves. A "wandering" DO will make connections to "fixed" DOs and then attempt to preserve copies of itself on the hosts that those fixed nodes live on. If the host has room available, then a copy will be preserved there. If the host does not have room, then the "originators" of the preserved copies will be queried to see if they have met their minimum desired number of copies. If the originator has met that minimum goal, then the originator will sacrifice one copy on that host to make room for the requesting DO. The number of preservation copies that a DO can have will grow from 0 to the minimum and then drift from the minimum to the maximum. The number of copies will never go back below the minimum.
The clc results of different preservation policies on the same graph.
