Skip to main content

Death by Puns : Networking Protocols


  • A TCP packet walks in to a bar and says “I want a beer”, barman says “you want a beer?” and TCP packet says “yes, a beer”.
  • In high society, TCP is more welcome than UDP. At least it knows a proper handshake.
  • A bunch of TCP packets go into a bar, until it’s overcrowded. The next day, half as many go in.
  • A bunch of TCP packets walk into a bar. The bartender says, “Hang on just a second; I need to close the window.”
  • When I try to send SYNs to chicks, I don’t get any ACKs. Just FINs and RSTs.
  • IP packet with TTL=1 arrives at bar. Bartender: “Sorry can’t let you leave…and you don’t get any beer either…”.
  • The worst part about token ring jokes is that if someone starts telling one while you are telling yours, all joking stops.
  • The great thing about TCP jokes is that you always get them.
  • The problem with TCP jokes is that people keep retelling them slower until you get them.
  • I would tell some UDP jokes too but I never know if anyone gets them
  • The best thing about UDP jokes is that I don’t care if you get them or not.
  • I had a funny UDP joke to tell, but I lost it somewhere...
  • The sad thing about IPv6 jokes is that almost no one understands them and no one is using them yet.
  • I tried to come up with an IPv4 joke, but the good ones were all already exhausted.
  • A DHCP packet walks into a bar and asks for a beer. Bartender says: “here, but I’ll need that back in an hour!
  • DHCP jokes only work when there is only one person telling them
  • The worst part of SSH jokes is that, even when they're not funny, you suck it up and just pretend they were anyway.
  • The problem with token ring jokes is you need to wait your turn to laugh
  • I’d make a joke about UDP, but I don’t know if anyone’s actually listening…
Labels:
Location: Mumbai, Maharashtra, India

Comments

Post a Comment

Popular posts from this blog

Multimaster replication with Symmetric DS

Symmetric DS is an awesome tool for trigger based replication whcih works for all major database vendors, including but not limited to PostgreSQL, MySQL, MSSQL, Oracle and many others. Symmetric-DS is a java application and can execute on any platform on whcih JRE is available including Windows and Linux. Trigger based replication, in constrast to disk based (eg. DRBD ) or transaction log file shipping based or statement based , works by registering triggers on DMLs and sending the data thus generated to remote machines. Another very popular trigger based DB replication tool is Slony . Symmetric-DS in addition to being database agnostic also supports multi-master replication (MMR). MMR usecase involves multiple database nodes, connected in a pool with DML updates coming from any of them. This is different from the normal master-slave replication, where slaves are not expected to generate any data events, and the sole authority of database is the master. MMR requirement causes d...
1 comment
Read more

PC Power supply and hacks

For posterity and myself, I'm leaving some tips and tricks of PC Power Supply Unit (PSU) whcih is an SMPS (Switched Mode Power Supply). There are a variety of uses of a +12V, +5V and +3V DC power supply like lighting up an LED strip or powering a raspberry pi. There are various colored cables in a typical ATX 12V SMPS. I'll list out the various color lines and what they mean, Sr. No Cable color Number of cables in a PSU Use 1 Green exactly one (1) Wake up signal from motherboard. Pressing PC power button makes this signal carry wake up signal to PSU to start. Green needs to be touched with the any ground to make the SMPS start. For self-starting PSUs, green needs to be connected with one black all the time. 2 Blue exactly one (1) -12V 3 Purple exactly one (1) +5V standby. When power supply is on standby mode (not on by signalling green), this line can give 1-2 A current. 4 Gray exactly one (1) Power good signal. When PSU levels has reached specificati...
3 comments
Read more

Cryptographic Primitive III: RSA Asymmetric Keys

RSA cryptosystems involves, a private key (which is kept private) and a public key, which is kept public i.e. known to everyone. The security of RSA hinges on the mathematically difficult problem of finding prime factorization of a very large number. Let's quickly disuss how a public, private key pair can be generated, Let, p and q be two large primes, then $n = q \times q$ $\phi(n) = (p-1) \times (q-1)$ Here, $\phi(n)$ is called euler's totient function Choose a random number $e$ such that, $e \in \left\{0,1,2...\phi(n)-1\right\}$ and $gcd(e,\phi(n)) = 1$ The gcd condition will ensure that we have an inverse of $e$ in $\mathbb{Z}_{26}$. Now, using extended euclidian algorithm one can get the inverse of e as d such that, $d \equiv e \pmod{\phi(n)}$ So, there we have it, the private key is $e$ and the public key is $(n,d)$. Few points to note here are, $p$ and $q$ are both $\geq 2^{512}$, although the recommened size is $2^{1024}$ $n$ is $\geq 2^{1024}$, although the recommended...
Post a Comment
Read more