Modelling and Analysis of Hierarchical Networks with Byzantine Robustness

From Master Projects
Jump to: navigation, search


About Modelling and Analysis of Hierarchical Networks with Byzantine Robustness


Description

Problem Description


In a paper by Radia Perlman and Charlie Kaufman [1], a hierarchical model for networks with Byzantine robustness is presented. This model extends previous work on network protocols resilient to Byzantine failures, that guarantee that nodes A and B can communicate, provided that at least one honest path connects them. The hierarchical model scales to large networks and additionally to guaranteed delivery of packets with some fair bandwidth, it also has the ability to limit the number of simultaneous sources it is receiving from and limit receipt of traffic to the rate at which the destination is capable to process.


Project Plan


In the hierarchical network model with Byzantine robustness, management of the switch/router resources is required to provide the guarantees of packet delivery and traffic rate limit on a per-flow basis. This flow resource management is important to achieve both the above defined guarantees and the scalability of the model to large networks.

To assess the scalability behavior, and the packet delivery and rate limiting guarantees, a simulation model of the hierarchical network with Byzantine robustness (HNBR) can be developed. With this simulation model different strategies can be evaluated, for example using metrics like efficiency and effectiveness, the scalability of the approach for different network sizes and topologies (network hierarchies), etc.


This project is in collaboration with Benno Overeinder and Radia Perlman. In the project we aim for a conference/journal publication in collaboration with Radia Perlman. This of course, given the obtained project results and analysis.


References


[1] Radia Perlman and Charlie Kaufman, "Hierarchical Networks with Byzantine Robustness", COMSNETS 2011.