Main Reference PaperPrivate and Verifiable Interdomain Routing Decisions, IEEE/ACM Transactions on Networking, April 2016 [NS2].
  • That interdomain routing systems do not need to make a choice between verifiability and privacy. It is possible to have both. Using VPref algorithm for collaborative verification, networks can verify a number of nontrivial promises about each others’ BGP routing decisions without revealing anything that BGP would not already reveal.

+ Description
  • That interdomain routing systems do not need to make a choice between verifiability and privacy. It is possible to have both. Using VPref algorithm for collaborative verification, networks can verify a number of nontrivial promises about each others’ BGP routing decisions without revealing anything that BGP would not already reveal.

  • To achieve verifiability and privacy.

  • To reduce the overhead.

+ Aim & Objectives
  • To achieve verifiability and privacy.

  • To reduce the overhead.

  • The technique is contributed to further improve the privacy.

+ Contribution
  • The technique is contributed to further improve the privacy.

  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

+ Software Tools & Technologies
  • OS : Window 7 (Cygwin) / Ubuntu 12.04 LTS 64bit.

  • Simulator: NS 2.35, Language : TCL and AWK script, (C++)

  • B.E / B.Tech / M.E / M.Tech

+ Project Recommended For
  • B.E / B.Tech / M.E / M.Tech

Professional Ethics: We S-Logix would appreciate the students those who willingly contribute with atleast a line of thinking of their own while preparing the project with us. It is advised that the project given by us be considered only as a model project and be applied with confidence to contribute your own ideas through our expert guidance and enrich your knowledge.