Communication and Networking pp 250-258
Experiments on an Election Algorithm for Decision Element Failures in 4D Future Internet Architecture
- Cite this paper as:
- Yue S., Xiao Y., Xie G.G. (2009) Experiments on an Election Algorithm for Decision Element Failures in 4D Future Internet Architecture. In: Ślęzak D., Kim T., Chang A.CC., Vasilakos T., Li M., Sakurai K. (eds) Communication and Networking. Communications in Computer and Information Science, vol 56. Springer, Berlin, Heidelberg
A novel 4D architecture has been presented in ,  for the future Internet, advocating a decomposition of network control functions into three distinct planes: decision, dissemination, and discovery, along with a streamlined data plane, to achieve more predictable network performance. An underlying concern with the 4D architecture is that the decision making is centralized at a single entity called Decision Element (DE), whose failure may disrupt the whole network . A simple approach has been proposed to increase the reliability of the system by attaching a few hot stand-by DEs to the network. These hot stand-by DEs collect information from other network elements and perform computation in the same manner as the master DE. In this work, we have created a set of experiments to verify the performance of the election algorithm based on the prototype of the 4D architecture, and experimentally evaluate the re-convergence time required for the election algorithm after a failure of the master DE.
KeywordsFuture Internet 4D architecture Election algorithm
Unable to display preview. Download preview PDF.