The topic of my research is "Backward compatibility schemes for turn prohibition". The turn prohibition approach is based on the assumption that the entire network is made of switches able of turn prohibition. In this condition, it proves to outperform the traditional Spanning Tree schemes for acyclic routing. In reality, expecially for large networks,   a complete replacemet of all the switches is not feasible. We formulate the problem for the model of network considered and report the results of our experiments.

The research is based on the previous work "Application  of Network Calculus to General Topologies using Turn-prohibition"

(http://people.bu.edu/staro/TPinfo2002.pdf).

Lab of Networking and Information Systems

Room 413 Photonics  Building

8 St Mary's Street, Boston MA 02215

Web site created by Sachin Agarwal (ska@bu.edu)