December 2019
Intermediate to advanced
346 pages
9h 8m
English
Routing is a process via which a packet of information is sent across the network so that it reaches the intended node. Routing can be adaptive, that is, it responds to changes in the network topology by continuously taking information from adjacent nodes, or non-adaptive, that is, they are static and is where routing information is downloaded to nodes when the network is booted. Routing algorithms need to be chosen to make sure there are no deadlocks. For example, in 2D torus, all the pathways go from east to west and north to south to avoid any deadlock scenarios. We will look at 2D torus in more detail later in this chapter.
Read now
Unlock full access