Routing: Dijkstra, Bellman-Ford, OSPF and BGP
The network as a weighted graph, Dijkstra's algorithm with proof of correctness, OSPF, the Bellman-Ford equation and distance vectors, count to infinity,…
Category
Fifth-year and specialisation subjects: information systems, computer architecture, digital signal processing, telecommunication networks, antennas and electromagnetic compatibility.
190 articles
The network as a weighted graph, Dijkstra's algorithm with proof of correctness, OSPF, the Bellman-Ford equation and distance vectors, count to infinity,…
IPv4 addresses and CIDR notation, the number of hosts proved, subnet calculation with an example, aggregation and longest prefix, ARP and DHCP,…
Frame and MAC addresses, CSMA/CD and the minimum frame length proved, self-learning switches, broadcast storms, the spanning tree with proof of tree…
Utilisation, Little's law with proof, the M/M/1 queue with distribution and delay proved, growth of delay with load, a numerical example, the…
The Internet and OSI layered models, encapsulation, circuit and packet switching, the components of delay, the advantage of packet transmission proved, the…
Switching energy CV² proved, dynamic and static power, DVFS with power proportional to the cube of frequency, the energy argument for multicore,…
Processor vector extensions, the GPU SIMT model, divergence and coalesced accesses, arithmetic intensity, the roofline model with proof, the examples of the…
The MESI protocol and snooping, directory protocols, false sharing, sequential consistency with proof, store buffers and the TSO model, fences and atomic…
Multilevel average access time with proof, local and global rates, inclusive and exclusive caches, write-back, non-blocking caches and prefetching, blocking proved.
Multiple issue and IPC, the quadratic cost of control with proof, VLIW architectures and their limits, simultaneous multithreading, the ILP, memory and…