Random the Book

Questions for you:

• Where in my work do I compete for shared resources, and how do I manage those conflicts?
• When I encounter a clash with someone else, would introducing randomness into my response timing actually reduce overall conflict?
• Do I understand how simple random processes can resolve coordination problems without complex negotiation?

Organisational applications:

• Resource allocation through randomised backoff:
  When multiple teams compete for shared resources (testing environments, specialist equipment, executive attention, meeting rooms), implement randomised backoff mechanisms rather than complex scheduling systems. When conflicts occur, teams wait for randomly chosen periods before requesting again. Like Ethernet collision resolution, this prevents permanent gridlock from sequential retry attempts. The elegance lies in avoiding centralised coordination—probability mathematics ensures fair access without negotiation protocols. Track whether random backoff resolves resource contention more efficiently than scheduled allocation systems, measuring both fairness (all teams get adequate access) and efficiency (minimal idle time for resources).
  
• Database transaction conflict resolution:
  Implement random backoff for business process conflicts beyond technical database systems. When multiple teams attempt incompatible actions (e.g., two departments launching conflicting campaigns, salespeople pursuing the same prospect, or parallel procurement of redundant systems), introduce deliberate random delays before escalating. Like database transaction managers, this prevents immediate escalation gridlock whilst ensuring conflicts eventually resolve. The delay provides time for one party to complete their action, making the conflict moot. Document whether random backoff reduces escalation frequency compared with immediate, hierarchy-based resolution.
  
• Self-organising queue management:
  Replace complex queuing systems with randomised backoff for service requests. When support queues, approval workflows, or review processes become backlogged, requesters automatically retry after randomly-chosen delays rather than joining ordered queues. This distributes load naturally—urgent requests retry more frequently whilst less critical ones space themselves out. The system requires no central management yet achieves emergent fairness. Test whether random backoff yields better service levels than traditional first-come, first-served or priority queuing, particularly for handling variable-demand spikes.

Further reading

On emergent order and self-organisation:

Emergence: The Connected Lives of Ants, Brains, Cities, and Software by Steven Johnson (Scribner, 2001). Explores how complex order emerges from simple rules without central control, drawing on examples from biology, technology, and urban systems to illustrate how randomness creates coordination.

The Wisdom of Crowds by James Surowiecki (Doubleday, 2004). Examines how decentralised systems often outperform centrally-controlled ones, with implications for understanding how random processes can coordinate better than deliberate planning.

Out of Control: The New Biology of Machines, Social Systems, and the Economic World by Kevin Kelly (Basic Books, 1994). Comprehensive exploration of self-organising systems, including how randomness and simple rules generate sophisticated coordination without hierarchical control.

On network protocols and coordination:

Computer Networks by Andrew S. Tanenbaum and David J. Wetherall (Pearson, 5th edition, 2010). Technical treatment of network protocols, including a detailed explanation of exponential backoff and collision resolution mechanisms underlying distributed coordination.

The Master Algorithm: How the Quest for the Ultimate Learning Machine Will Remake Our World by Pedro Domingos (Basic Books, 2015). Includes discussion of how algorithms coordinate distributed systems through randomised methods, relevant for understanding computational coordination mechanisms.

Distributed Systems: Principles and Paradigms by Andrew S. Tanenbaum and Maarten Van Steen (Pearson, 2nd edition, 2006). Academic examination of how distributed systems achieve coordination without central control, including randomised consensus protocols.

On game theory and coordination problems:

The Evolution of Cooperation by Robert Axelrod (Basic Books, 1984). A classic examination of how cooperation emerges from repeated interactions without central authority, relevant to understanding how simple strategies resolve coordination problems.

Micromotives and Macrobehavior by Thomas C. Schelling (W.W. Norton, 1978). Explores how individual behaviours create unexpected collective patterns, including coordination problems that resolve through random elements rather than deliberate planning.

Thinking Strategically: The Competitive Edge in Business, Politics, and Everyday Life by Avinash K. Dixit and Barry J. Nalebuff (W.W. Norton, 1991). Game theory applications including coordination games where randomised strategies produce better outcomes than deterministic approaches.

There’s an example here of banded wrens using something analogous to random backoff in the timing of their songs to avoid getting into fights: https://pmc.ncbi.nlm.nih.gov/articles/PMC4235583/ 

Interactive exhibit

Play with different timings to see how they impact the efficiency of a network in this simple simulator…

https://experiments.randomthebook.com/ExponentialBackoff/index.html

About the image

I found the image of the RJ-45 connector in an online electronics component catalogue. The cut-out tools in Adobe Photoshop had a delightfully random impact each time I used them, and as a result each of the images are slightly different. They remind me of dinosaur skulls.

Photo montage Matt Ballantine 2026