page_title: Turn restriction routing
section_title: Examples of turn restriction routing
hierarchical_section_title: Turn restriction routing / Examples of turn restriction routing
caption_attribution_description: English: All possible turns in north last routing- clockwise and anti-clockwise.
context_page_description: A routing algorithm decides the path followed by a packet from the source to destination routers in a network. An important aspect to be considered while designing a routing algorithm is avoiding a deadlock. Turn restriction routing is a routing algorithm for mesh-family of topologies which avoids deadlocks by restricting the types of turns that are allowed in the algorithm while determining the route from source node to destination node in a network.
context_section_description: A turn restriction routing can be obtained by prohibiting at least one of the four possible clockwise turns and at least one of the four possible anti-clockwise turns in the routing algorithm. This means there are at least 16 (4x4) possible turn restriction routing techniques as you have 4 clockwise turns and 4 anti-clockwise turns to choose from. Some of these techniques have been listed below.
caption: Fig 5: North last routing
exif: {"Image Artist": "ASHISH", "Image ExifOffset": "2130", "Image XPAuthor": "ASHISH", "Image Padding": "[]", "EXIF DateTimeOriginal": "2016:11:28 00:14:52", "EXIF DateTimeDigitized": "2016:11:28 00:14:52", "EXIF SubSecTimeOriginal": "39", "EXIF SubSecTimeDigitized": "39", "EXIF Padding": "[]"}