Principles of Communications - Week 3

 By now, we're roughly up to BGP and traffiic engineering - see

Course Sequencing and associated problems

for the timing and also some suggested  problems to tackle as you're folloowing along. Also, I'm intending having a Q&A "drop in" zoom session on Tue Oct 27th, 11-12 - Zoom link is on moodle... 

Email me ahead of time if you have specific questions/things you've tackled you want feedback on! Asynchronous working is a far better way than lots of online meetings in  my experience...

Principles of Communications - Week 2

 This week we are up to centralised routing, both on paper, and in practice with ways to control MPLS or SR, for example - the Sequence, timing and problems for lectures are online too.

Principles of Communications - Week 1

You should have access to moodle/panopto + lab web pages with cached downloaded mp4s as well.

The intro to the course & to routing section is where we're roughly be up to now.

there's also an index for lecture order & data the material should be "covered' by, plus some suggested simple problems to look at, to test your understanding.

thanks (already) to folks who emailed corrections&bug reports on videos! appreciated - keep 'em comiing!

take care, and hope to see people eventually

cheers

jon

Principles of Communications - week 8/L17 3/12/2019

Wrapped up with systems design rules of thumb, and course summary.

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.

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 :

• conservation law
• fairness
• round robin...

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.

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)!

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

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

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:-)

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.

Principles of Communications, 2018/2019 - Week "6" 26,28 Nov 2018

This week, wrapping up with optimisation and adaptive traffic, and
traffic engineering/signaling/provisioning

supervisions might want to review these notes/example questions + list of what in past papers is (and by implication is not) relevant to this year's material:

Principles of Communications, 2018/2019 - Week "5" 19,21 ,23 Nov 2018

This week, we've looked at scheduling and queue management - for more details of the underlying theory, please see the Original GPS paper
For more details of Qjump, the code is linked from the published paper! 

Principles of Communications, 2018/2019 - Week "4" 12,14,16 Nov 2018

Control Theory:- see notes here

Original Paper by James Clerk Maxwell!

on governors basically for steam engines

Principles of Communications, 2018/2019 - Week "3" 5,7,9 Nov 2018

This week, we covered

multicast, mobile, and meanderandom routing, and 

made a very brief start on flow control, just dealing with open loop (call setup/admission control and parsimonious flow descriptors).

corporate/brand top level domains

was teaching about internet standards process today, and was asked about gTLDs being handed out to the likes of Apple etc - here's an interesting set of data about the success of that process - it seems also to have caused some political debate:-)

Principles of Communications, 2018/2019 - Week "2" 29.10, 31.10, 2.11

Covering BGP core attrbiutes&hacks, model, and performance.

Why might you be interested in BGP, today:
just one traffic redirection/interception story


Next week, multicast and random routing

Principles of Communications, 2018/2019 - Week "1" 24&26.10.18

This week, course started with brief Intro (what's in course)

Then skip to last lecture on:
Systems (will revisit at end of term)

Then:
Routing 1 - intro + fibbing (hybrid central/distributed inter-as routing)

Monday 29th, will start on BGP...

white space graphs

we often form graphs by addings edges to a collection of vertices, or vertices and edges - we can also form graphs by moving (rewiring) ends of edges from one node to another, or removing edges and nodes.

how about we form graphs by cutting holes in a piece of paper (or by dropping polygonal shapes on a surface)? they can overlap....

what sort of graphs do you get when you just make them out of interstial space?