Maintaining colored trees for disjoint multipath routing under node failures
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
electronics seminars
Active In SP

Posts: 694
Joined: Nov 2009
14-12-2009, 11:58 AM

Colored Trees (CTs) is an efficient approach to route packets along link-or node-disjoint paths in packet-switched networks. her two trees, namely red and blue, are constructed rooted at a drain such that the path from any node to the drain are link-or node-disjoint. For applications where both the trees are used simultaneously, it is critical to maintain the trees after link or node failures. this seminar and presentation discuss an algorithm, referred to as SimCT, that efficiently constructs and maintains colored trees under failures using only local informa-tion. Even when the entire tree needs to be recomputed, the SimCT algorithm requires 40% lesser messages than previous techniques. The convergence time of the SimCT algorithm is linear in the number of nodes. We show through extensive simulations that the average length of the disjoint paths obtained using the SimCT algorithm is lesser compared to the previously known techniques. The above-mentioned improvements are obtained by exploiting the relationship between DFS numbering, lowpoint values, and the potentials employed for maintaining partial ordering of nodes.
Use Search at wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion
Active In SP

Posts: 1
Joined: Feb 2010
05-08-2010, 12:57 AM

i need multipath tcp flow charts

Important Note..!

If you are not satisfied with above reply ,..Please


So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page

Quick Reply
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)