If you're in trouble and cannot find an answer to a question which goes beyond Stack Overflow...
If you have a not-so-usual solution for your problems but need to justify it to your boss...
If you like to think on your own rather than blindly follow "common wisdom" and "profound truth"...
...then 'No Bugs' Hare on Soft.ware might be the right place for you.
Your mileage may vary. Batteries not included
 
“No Bugs” Hare
Author:“No Bugs” Hare  Follow: TwitterFacebook
Species:H.A.R.E. (as "Honest And Restless Engineer")
Job Title:Sarcastic Architect
Hobbies:Thinking Aloud, Arguing with Managers, Annoying HRs,
Calling a Spade a Spade, Keeping Tongue in Cheek
 
'No Bugs' Bunny

Once upon a time, in a rabbit outsourcing warren of Bunnylore, there was a young software developer bunny. And as a developer, he has had one very unusual treat: he was obsessed with eliminating all the bugs he can get his forelegs on. So, it is not surprising that his friends called him a “No Bugs” Bunny (or simply “NoBugs”).

Later on, he grew up, so he decided that “Bunny” in his name has became inappropriate (not to mention potential arguments with Warner Brothers), so he has asked all his friends to call him “No Bugs” Hare. He has made a career as a team lead and software architect, and they lived happily ever after.

“No Bugs” Hare Opera Omnia, Vol.1:

TCP Peculiarities as Applied to Games, Part II

Quote: “Nagle’s algorithm aims to deal with those [CENSORED] developers who’re trying to send data over TCP in really small chunks (like 1 byte each time)”
Another Quote: “it seems that “proportional rate reduction” (PRR, reportedly used by Linux kernels by default starting from 3.2) performs for gaming purposes a little bit better than the alternatives”
[]

TCP Peculiarities for Games, part 1

Quote: “the best we can hope when using a single TCP connection over 5%-loss channel – is having 1.5-second “lag spike” every 5 or so minutes, and a 3-second “lag spike” every 2 hours.”
Another Quote: “we may already have the-information-we-need on the receiving host – but this information is hidden from us by layers of abstraction on receiving side”
[]

Some Big-Os are Bigger Than Others

Quote: “Strictly speaking, for real-world computers, every algorithm which completes in a finite time can be said to be O(1)
Another Quote: “now the difference because of unfortunate ‘jumps’ over (uncached at the time) memory can lead to a 100x+ (!) performance difference. However, it is still O(1) and is rarely taken into account during performance analysis”
[]

Advocating “Obscurity Pockets” as a Complement to Security. Part II. Deployment Scenarios, More Crypto-Primitives, and Obscurity-Pocket-As-Security

Quote: “In other words – such an Obscured RNG would protect us from Debian RNG disaster(!)”
Another Quote: “such a protocol (if properly deployed on the Server Side) – would defeat Heartbleed too (even if all the details of the Client are known)”
[]