About: Turn restriction routing

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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.

Property	Value
dbo:abstract	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. (en)
dbo:thumbnail	wiki-commons:Special:FilePath/Deadlock_Routing_Image.jpg?width=300
dbo:wikiPageID	52413716 (xsd:integer)
dbo:wikiPageLength	7858 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID	995204990 (xsd:integer)
dbo:wikiPageWikiLink	dbr:Router_(computing) dbr:Mesh_networking dbr:Deadlock dbr:Deadlock_prevention_algorithms dbr:Network_topology dbc:Routing dbr:Computer_network dbr:Node_(networking) dbc:Software_bugs dbc:Software_anomalies dbr:Shortest_path_problem dbr:Network_packet dbr:Policy-based_routing dbc:Internet_architecture dbr:Data_buffer dbr:Data_link dbr:Network_congestion dbc:Heuristic_algorithms dbc:Concurrency_(computer_science) dbr:Heuristic_(computer_science) dbr:Routing dbr:Network_latency dbr:Channel_(communications) dbr:Network_hop dbr:File:All_turns.jpg dbr:File:Deadlock_Routing_Image.jpg dbr:File:Feeder_router_example.png dbr:File:Negative_First_Turns.jpg dbr:File:North_Last_Turns.jpg dbr:File:West_First_Turns.jpg dbr:File:XY_Turns.jpg
dbp:wikiPageUsesTemplate	dbt:Reflist
dcterms:subject	dbc:Routing dbc:Software_bugs dbc:Software_anomalies dbc:Internet_architecture dbc:Heuristic_algorithms dbc:Concurrency_(computer_science)
rdfs:comment	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. (en)
rdfs:label	Turn restriction routing (en)
owl:sameAs	yago-res:Turn restriction routing wikidata:Turn restriction routing https://global.dbpedia.org/id/2cQjV
prov:wasDerivedFrom	wikipedia-en:Turn_restriction_routing?oldid=995204990&ns=0
foaf:depiction	wiki-commons:Special:FilePath/All_turns.jpg wiki-commons:Special:FilePath/Deadlock_Routing_Image.jpg wiki-commons:Special:FilePath/Feeder_router_example.png wiki-commons:Special:FilePath/Negative_First_Turns.jpg wiki-commons:Special:FilePath/North_Last_Turns.jpg wiki-commons:Special:FilePath/West_First_Turns.jpg wiki-commons:Special:FilePath/XY_Turns.jpg
foaf:isPrimaryTopicOf	wikipedia-en:Turn_restriction_routing
is dbo:wikiPageWikiLink of	dbr:Deadlock dbr:Ford–Fulkerson_algorithm dbr:Heuristic_routing dbr:Routing
is foaf:primaryTopic of	wikipedia-en:Turn_restriction_routing