Collision free protocols - nptel - Indian Institute of Technology Madras
Collision free protocols - nptel - Indian Institute of Technology Madras Collision free protocols - nptel - Indian Institute of Technology Madras
Computer Networks Prof. Hema A Murthy Adaptive Tree Walk Algorithm 4 Indian Institute of Technology Madras 1 2 3 5 a b c de f g h First contention all stations permitted to contend 6 - if collision then next slot only nodes under 2 can contend -if success next slot – Nodes under 3 -if collision then nodes under Node 4 -if success next slots Nodes under 5 7
Computer Networks Prof. Hema A Murthy Adaptive Tree Walk Algorithm • Depth first tree walk algorithm • Heavy load do not start searching at top of tree – what level to start the search? – depends on number of ready stations Indian Institute of Technology Madras
- Page 1 and 2: Computer Networks Prof. Hema A Murt
- Page 3 and 4: Computer Networks Prof. Hema A Murt
- Page 5 and 6: Computer Networks Prof. Hema A Murt
- Page 7 and 8: Computer Networks Prof. Hema A Murt
- Page 9 and 10: Computer Networks Prof. Hema A Murt
- Page 11: Computer Networks Prof. Hema A Murt
Computer Networks Pr<strong>of</strong>. Hema A Murthy<br />
Adaptive Tree Walk Algorithm<br />
• Depth first tree walk algorithm<br />
• Heavy load do not start searching at top <strong>of</strong><br />
tree<br />
– what level to start the search?<br />
– depends on number <strong>of</strong> ready stations<br />
<strong>Indian</strong> <strong>Institute</strong> <strong>of</strong> <strong>Technology</strong> <strong>Madras</strong>
Change language