Week 11 Networks and Routing

How confident do you feel that you know how to explain in technical English how networks and routers operate ?

• Very confident

• Quite confident

• Not very confident

• Not at all confident

locations or routers in the network are called

• nodes

• points

• paths

• hops

connections between nodes in the network

• paths

• jumps

• links

• loops

a route between one node and another through many other nodes

• link

• road

• hike

• path

each jump between one node and another node in a path is called a..

• skip

• jump

• hop

• link

all the nodes which connect directly to a node are called its...

• friends

• neighbours

• connections

• brothers

what is an algorithm?

• a set or sequence of instructions for solving a problem or accomplishing a task, often by computer.

• a type of seaweed.

• a musical term.

• a person who works on a seaweed farm.

which is a commonly used algorithm for finding the most efficient path between nodes in a network?

• Bellman-Ford algorithm

• Smith-Jones algorithm

• Jones-Sellman algorithm

• Bernoulli-Davis algorithm

The Bellman-Ford algorithm is Asynchronous - which means..

• it happens at various times, independently at each node

• it happens in various places, independently at each node

• it happens in various ways, independently at each node

• it happens for various reasons, independently at each node

The Bellman-Ford algorithm is Distributed - which means..

• it happens at various times, independently at each node

• it happens in various places, independently at each node

• it happens in various ways, independently at each node

• it happens for various reasons, independently at each node