The Gateway to Computer Science Excellence
0 votes
27 views
Write a program to simulate routing using flooding. Each packet should contain a
counter that is decremented on each hop. When the counter gets to zero, the packet is
discarded. Time is discrete, with each line handling one packet per time interval.
Make three versions of the program: all lines are flooded, all lines except the input
line are flooded, and only the (statically chosen) best k lines are flooded. Compare
flooding with deterministic routing (k = 1) in terms of both delay and the bandwidth
used.
in Computer Networks by Boss (10.5k points) | 27 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,654 questions
56,166 answers
193,872 comments
94,261 users