majke

104 ms·

451.
Brian Krebs' Blog Hit by 665 Gbps DDoS Attack(securityweek.com)
4 points by majke 10y ago|1 comments
452.
Many "listen" TCP sockets slow down Linux – The revenge of the listening sockets(blog.cloudflare.com)
10 points by majke 10y ago|1 comments
453.
The only way to understand x86 coding – ALL x86 OPCODES ARE CODED IN OCTAL(dabo.de)
2 points by majke 10y ago|0 comments
454.
by majke 10y ago
When you run servers, you might want to record plenty of parameters. From received packets counters, via disk io operations, to cpu load. If you want to identify issues with good precision, you will record _hundreds_ of counters per each se
455.
by majke 10y ago
file:// urls are awesome! People forget about them and nobody actually understands what to expect from these urls. Consider cross-origin policy implications. Is file:///home/john/bar.html on the same origi
456.
How to delete your Google+ profile(support.google.com)
2 points by majke 10y ago|0 comments
457.
by majke 10y ago
This was never the intention. Part of the problem is inertion - cf operates large and complex application that was designed back when we had only a handful of customers. Part of the problem is technical - the privacy-centric anti-abuse tech
458.
by majke 10y ago
[disclaimer: I work for CF] CloudFlare also regularly speaks about attacks and mitigations, therefore is helping the community to build better defences. Other providers stay shy and never disclose their magic. We believe DDoS is an internet
459.
Richard Stevens – frequently asked questions(kohala.com)
2 points by majke 10y ago|0 comments
460.
by majke 10y ago
Oh god. > The typeface Comic Sans was created for Microsoft Bob.
461.
by majke 10y ago
> For the reasons I mentioned, as long as the socket is open in the application on host B, I don't think the kernel can conclude that the program is done with it. Wow. Awesome explanation. Ok, so basically as long as socket is in
462.
by majke 10y ago
This article describes a case when close() is _not_ being called in the first place. But indeed, it's very interesting what exactly the application can do after it receives FIN. I suspect it has 60 seconds tops to send any remaining da
463.
by majke 10y ago
>> A little known fact is that it's not possible to have any packet loss or congestion on the loopback interface. > This seems a bit misleading, given the two counterexamples that the article describes after this. Ok, allo
464.
by majke 10y ago
Correct. To be hit by this problem you need leaking sockets AND a client that opens and closes sockets rapidly. What I didn't write is that we had a "bind before connect" on the client side, which means you could hit the CLOS
465.
by majke 10y ago
Absolutely! (almost) everything in computer science can be summed up as: I've seen the same 10 years ago but a bit different. The differences are: - my understanding is that pf module is written in C and runs in kernel mode. - my under
466.
by majke 10y ago
The pessimistic case is when the attack signature matches exactly the signature of real operating system. For example, if the attack resembles Linux, with the p0f-to-BPF you can generate a BPF that matches Linux SYN packets. This allows you
467.
by majke 10y ago
Browsers vary drastically in javascript performance. Counting something can take couple of milliseconds on your desktop and seconds on some old mobile phone. Ok, so you could differentiate the work for User-Agent, but then one could spoof u
468.
by majke 10y ago
You should watch for upcoming presentations of Mateusz Jurczyk @j00ru . I'm not entirely sure where he's going to present next though.
469.
by majke 10y ago
This is amazing. The video avoids too technical language, and basically explains the whole process of reverse engineering. I think this is the best explanation of reverse engineering I've seen in a long time.
470.
by majke 10y ago
> A single socket can be shared by multiple cores Absolutely, it can . But everybody sane avoids that, pinning worker processes to specific CPU's and not sharing sockets between them. The rule of thumb is that spinlocks on the hot
471.
by majke 10y ago
> This is because the kernel suffers from some lock contention when accessing the table containing the socket descriptors. This would indicate the problem is with packet delivery to application. From my experience even packet delivery to
472.
by majke 10y ago
The "very fast userspace process" has direct access to hardware NIC RX queue and is doing busy polling. It uses 100% CPU all the time. The process is faster then kernel because: - it does less only since it implements only some su
473.
Why we use the Linux kernel's TCP stack(blog.cloudflare.com)
254 points by majke 10y ago|51 comments
474.
Schengen Routing(en.wikipedia.org)
2 points by majke 10y ago|0 comments
475.
The browser cache is Vary broken (2014)(jakearchibald.com)
13 points by majke 10y ago|1 comments
476.
by majke 10y ago
Years pass but I still prefer languages with reference counting over languages with proper GC. Main reasons for me: - Reference counting is deterministic (barring refcnt loops, which can usually be avoided by a careful programmer). Each run
477.
by majke 11y ago
I've never heard about SMR before. I wonder - does it mean that a write to one area must be done in multiple disk rotations? Ie: if a sequential write to one file be aggregated into a single location on the disk or will it be spread ar
478.
by majke 11y ago
> If I can't make your worst-performing page load 50% faster, you don't have to pay the bill. Interesting approach. This is also nicely recursive, with each run being more expensive. I would prefer that statement to have a cost
479.
The ode to self-taught programmer: Practising Software Engineering(lshift.net)
2 points by majke 11y ago|0 comments
480.
by majke 11y ago
In order to reduce the number of packets hitting the bad bucket. With LHTABLE of size 32 port 16257 will hit bad bucket. With other sizes port 16257 may not hit the naughty bucket.

More ›