Has any alternative to RSA and Discrete Logarithm been standardized for deployment? Suppose RSA and Discrete Logarithm over any group (including elliptic curves) gets broken what other schemes we have for DEPLOYMENT IMMEDIATELY do we have to rescue the internet from collapse?

So there is no other alternative and pretty much the internet is dead?

I see a lot of alternatives such as SVP based, code based alternatives floating around. Have any of these been standardized?
Since you say 


  to rescue the internet


I presume you are specifically referring to TLS. With a quick look at the supported Key Agreement Schemes in TLS 1.3, the ongoing draft of TLS, it is clear that all the Key Agreement Schemes are based upon the generalized Discrete Logarithm problem or Integer Factorization. Both of these are broken by Shor's algorithm on Quantum Computers, in the event that the physical constraints limiting the construction of such high bit quantum computers are solved. 

However, there are numerous asymmetric cryptosystems that exist with no known efficient quantum algorithm. As you noted, there are multiple based upon the Shortest Vector Problem. In addition there are other systems, such as the Anshel-Anshel Goldfeld Key Exchange, which is based on the difficulty of the conjugation problem on braid groups. There is no known efficient algorithm to solve this. 

There are standardizations for several post quantum systems, though they are not slated for inclusion in TLS. The lattice based ones have standardizations, but new variants are continually being proposed with different properties. There are standardizations for the code based schemes.