seminar: Distributed heuristics for full graph colouring: a model for autonomic deployment of network services
speaker: Fabrice Saffre (BT Group CTO)abstract: (co-authored with Keith Briggs) We deal with the problem of deploying complementary service components in a network of arbitrary initial topology. We argue that, in the special case where all components need to be present in the immediate neighbourhood of every host, the problem amounts to a restricted form of graph colouring, which we refer to as "full graph colouring". We also show evidence that, in the absence of central control or global information about system state, a stable configuration satisfying the requirements of full graph colouring can be approximated through distributed heuristics, though careful calibration of the parameters governing local decision is required. Implications for the design of autonomic network services are discussed.
timetable:
Thu 20 Sep, 11:00 - 12:30, Aula Dini
<< Go back