Given a connected graph as input (adjacency list), with nodes as routers and edges as links - how do routers discover each other or decide the next hop when forwarding a packet? Each router starts up ...

In order to increase routing speeds, many "cut-through" techniques were used, which perform an "inspect the first packet at layer 3 and send the rest at layer 2" type of processing. Ipsilon's IP ...