Wrapped up with systems design rules of thumb, and course summary.
Tuesday, December 03, 2019
Wednesday, November 27, 2019
Principles of Communications - week 7/L14 28/11/2019
This week, finishing up optimisation.
Reminder, the slides plus additional notes are kept up to date in response to your requests!
Next week, we wrap up and I'll summarise what was covered and is examinable.
Reminder, the slides plus additional notes are kept up to date in response to your requests!
Next week, we wrap up and I'll summarise what was covered and is examinable.
Thursday, November 21, 2019
Principles of Communications - week 6/L11 21/11/2019
Finished Control Theory, Started Scheduling.
Further notes on control theory here .
Things to remember - we don't do the Laplace transfom to solve the sysem - we do it to see what different controllers might do in terms of stability and limits. Also note the composition rules for sysems in the s-transform are really simple....the actual controller is to be implemented "back" in the time domain of course...
Scheduling - to remember :
Further notes on control theory here .
Things to remember - we don't do the Laplace transfom to solve the sysem - we do it to see what different controllers might do in terms of stability and limits. Also note the composition rules for sysems in the s-transform are really simple....the actual controller is to be implemented "back" in the time domain of course...
Scheduling - to remember :
- conservation law
- fairness
- round robin...
Friday, November 15, 2019
Principles of Communications - week 5/L9 1/511/2019
we've started on flow control and control theory, but then had to cut over to data center networks due to calendar clash. Next week (nov 19&21) will finish up on control theory&start on scheduling.
Wednesday, October 30, 2019
Principles of Communications - week 4/L7 1/11/2019
This week sees us wrapping up bgp and multicast routing -note on course web page, I list books including an online chapter of a good book on interdomain routing by Hari Balakrishnan from MIT.
5/11/2019 will be last bit on routing - taking in random routing (we're talking telephone numbers)!
5/11/2019 will be last bit on routing - taking in random routing (we're talking telephone numbers)!
Thursday, October 24, 2019
Principles of Communications - week3/L5 24/10/2019
On BGP, traffic engineering tricks - next week, stable paths problem/formulation plus performance;
subsequently, multicast and telephone routing!
meanwhile, do not forget that the clocks go back on sunday - here's a brilliant computerphile exposition on timezones
subsequently, multicast and telephone routing!
meanwhile, do not forget that the clocks go back on sunday - here's a brilliant computerphile exposition on timezones
Friday, October 18, 2019
Principles of Communications - week 2/L3 17/10/2019
we're now just starting interdomain routing, having dealt with centralised/hybrid distributed routing.
next week, see BGP attributed, decision/alg, and model/performance
next week, see BGP attributed, decision/alg, and model/performance
Thursday, October 10, 2019
Principles of Communications - week 1/L1 10/10/2019
Aside from a visit from the Amicus Curiae (friend of the supreme court judge:),
L1 started with intro to routing. Refer people to last year's network course, and the lectures on the network.
Slide 3 has a network graph with nodes numbered 1-12, and a routing table for node 1. This is a confusing picture as it has [] against some of the entries (both for some next hops, and some destinations) so a) its a forwarding table, not a routing table; and b) it is showing the outcome of some computation - As far as I can recall, the [] represent where the SPF algo tie broke between two routes. - It is a useful exercise to work through in any case. On asking the original author of the graph (see his book for the non power point version), they're artefacts/noise and don't actually signify:-)
L1 started with intro to routing. Refer people to last year's network course, and the lectures on the network.
Slide 3 has a network graph with nodes numbered 1-12, and a routing table for node 1. This is a confusing picture as it has [] against some of the entries (both for some next hops, and some destinations) so a) its a forwarding table, not a routing table; and b) it is showing the outcome of some computation - As far as I can recall, the [] represent where the SPF algo tie broke between two routes. - It is a useful exercise to work through in any case. On asking the original author of the graph (see his book for the non power point version), they're artefacts/noise and don't actually signify:-)
Wednesday, May 15, 2019
Principles of Communications - Revision Lectures 15nd & 22nd May 2019
you should now see two sets of slides here and also be able to see Supervision Notes which includes examples of past exam questions that are (still) relevant to what was taught this year.
Subscribe to:
Posts (Atom)