Live briefing
Everything about Routing loop
Problem in computer networking
A routing loop is a common problem with various types of networks, particularly computer networks. They are formed when an error occurs in the operation of the routing algorithm, and as a result, in a group of nodes, the path to a particular destination forms a loop. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Routing loopA 5-minute orientation
- Skim a recent paper: Closed-loop multi-objective waste management through vehicle routing problem in neutrosophic hesitant fuzzy environmentInfluential work since 2022
- Pick up a classic book: Computer NetworksThe most-reprinted book on the subject
- Read the landmark paper: Loop-free routing using diffusing computationsCited 216 times
- Go sideways: Distance-vector routing protocolA closely related topic
- Go sideways: Split horizon route advertisementA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Loop-free routing using diffusing computations
Closed-loop Inventory Routing Problem for returnable transport items
A loop-free extended Bellman-Ford routing protocol without bouncing effect
A path-finding algorithm for loop-free routing
Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet
A protocol for scalable loop-free multicast routing
Fault-tolerant routing in distributed loop networks
Optimal routing in double loop networks
🆕 Influential since 2022
Closed-loop multi-objective waste management through vehicle routing problem in neutrosophic hesitant fuzzy environment
Closed-loop inventory routing problem for perishable food with returnable transport items selection
Small and large neighborhood search for the park-and-loop routing problem with parking selection
An oracle-based algorithm for robust planning of production routing problems in closed-loop supply chains of beverage glass bottles
Simultaneous Pickup-and-Delivery Production-Routing Problem in closed-loop supply chain with remanufacturing and disassembly consideration
📚 Books worth reading
Computer NetworksAndrew S. Tanenbaum, John David Wetherall · 1981
Eloquent JavascriptMarijn Haverbeke · 2009
Home recording for musicians for dummiesJeff Strong · 2005- 📕Roadside Geology of the Trans Canada 17 and Route 638 Loop in Ontario, CanadaSteven Baumann · 2014
- 📕Contract drawings, route no. 9-0-2, Booklyn Loop lines, Centre Street from Pearl to CanalNew York (State). Board of Rapid Transit Railroad Commissioners., New York (State). Board of Rapid Transit Railroad Commissioners · 1907
- 📕Contract drawings, route no. 9-0-3, Booklyn Loop lines, Centre Street from Canal St. to Boome StNew York (State). Board of Rapid Transit Railroad Commissioners., New York (State). Board of Rapid Transit Railroad Commissioners · 1907
Hierarchy, commerce and fraud in Bourbon Spanish AmericaRuth Hill · 2004
Algorithms for Parallel ProcessingMichael T. Heath · 1999
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Distance-vector routing protocol A distance-vector routing protocol in data networks determines the best route for data packets based on distance. Distance-vector routing protocols measure…
- Split horizon route advertisement In computer networking, split-horizon route advertisement is a method of preventing routing loops in distance-vector routing protocols by prohibiting a…
- Routing Routing is the process of selecting a path for traffic in a network or between or across multiple networks. Broadly, routing is performed in many types…
- Dynamic routing In computer networking, dynamic routing (DR), also called adaptive routing (AR), is a process where a router can forward data via a different route for…
- Wireless Routing Protocol The Wireless Routing Protocol (WRP) is a proactive unicast routing protocol for mobile ad hoc networks (MANETs). WRP uses an enhanced version of the distance-ve…
- Link-state routing protocol Link-state routing protocols are one of the two main classes of routing protocols used in packet switching networks for computer communications, the others…
- Route poisoning Route poisoning is a method to prevent a router from sending packets through a route that has become invalid within computer networks. Distance-vector…
- Ad hoc On-Demand Distance Vector Routing Ad hoc On-Demand Distance Vector (AODV) Routing is a routing protocol for mobile ad hoc networks (MANETs) and other wireless ad hoc networks. It was jointly…