Advanced Topics in Computer Communications Networks
Hanoch Levy ( hanoch@math.tau.ac.il )
2nd Semester, 1998/99 - Wed 12-15
Note: DEADLINE for PROJECT SUBMISSION is: October 1, 1999!
Project List
-
MUX
a. Given set of streams that are expected in a MUX -- derive
a good structure of hierarchical MUX (priority bins).
Questions: a) Should it be hierarchical.
b) How to form the hierarchy.
c) What performance will it have?
b. Study the advantages/disadvantages of feeding one phase of
hierarchical MUX into the other.
-
Implement prioritizing mechanizm (fair queueing) for Internet
traffic. Possibilities:
a) Web Server side (HTTP level / TCP level)
b) Client Side (e.g. between FTP and Browser).
-
Virtual path planning:
a. Suggest an algorithm for virtual path design whose
major objective is efficient failure recovery
(tradeoff - between the amount of work to move the VP,
to the likelihood of finding an empty space).
b. Consider all factors for VP design and propose the parameters
on which a VP algorithm should work (input is routing of sessions,
output is VP design).
-
Quality of Service:
a. Study the issue of Quality of Service in IP networks.
b. How QOS in IP networks can/should be mapped into ATM standards?
c. Differentiated Services in IP: How this new approach will be used
to provide QOS in IP networks?
-
Caching:
a. Compare local caching/prefetching to pool(proxy) caching/prefetching.
b. Evaluate the value of prefetching.
Messages to Students:
Last updated June 23 1999
redesigned by barak soreq