After yet another series of devastating wars that have caused unbelievable destruction (and resulted in yet another trilogy from Tolkien), the inhabitants of Middle Earth have decided to set up a Security Council to maintain peace and harmony

COMP 290-078: Final project
1999/11/13

Your final class project requires you to prepare a technical report on one of the topics below (I will send email to each of you, specifying which one). Your document should be comprehensible, with ordinary effort, by a reader who is reasonably well-versed in the topic of network scheduling, but who has not participated in this class. It should be complete enough – a general introduction; proofs and examples (if necessary); conclusions; references, etc. – to be ready for submission to a workshop or conference. I will grade your report as though I were a reviewing it for possible publication.

Your report is due by noon on Monday the 6^th of December, in my office.

A. Describe how you would improve the Hierarchical Packet-fair queueing algorithm (H-PFQ) of Bennett and Zhang that was discussed in class, in order to to obtain fairness bounds that are independent of the height of the class hierarchy. Include proofs of (improved) fairness bounds and sufficient implementation details.

B. Describe your ns experiments on multiple-link transmission of fixed-length packets. Your write-up should include:

an Introduction;

a brief description of the algorithms you are testing;

a very brief description (not a manual!) of the relevant features and capabilities of ns.

the methodology you apply, and justification for doing so

Depending upon your state of progress, one of the following:

what you’re looking for (i.e., what experiments you’re performing, and why)

your findings (i.e., what experiments you performed, and what you’ve discovered)

conclusions

C. Survey the support provided by current (commercial and research) networks – in particular, routers – for fair queueing.