Skip to main content

Deploy NodeJS app to AWS EC2 Instance in 40 Steps


  1. Login to AWS
  2. Run an instance on AWS EC2
  3. Store the IP Address of the EC2 instance
  4. Terminal with SSH Support
  5. Generate a PEM file from AWS console
  6. Remotely connect to EC2 from your computer terminal
  7. One can use Babun Terminal on windows.
  8. Install Babun
  9. Check if it supports ssh
  10. Run ssh on Babun terminal
  11. Go to the folder in terminal where the PEM file is stored
  12. Run ls to check if PEM file is available
  13. Run ssh ex2-user@<ip address> -i <PEM file name>
  14. Go to root user by running sudo su
  15. Run node to check if nodejs is installed
  16. If nodejs is not installed then go to NodeJS website > Go to Download section > Go to Installing NodeJS via package Manager
  17. Based on EC2 instance select the command and copy
  18. Node.js v12.x:
    # Using Ubuntu
curl -sL https://deb.nodesource.com/setup_12.x | sudo -E bash -
sudo apt-get install -y nodejs

# Using Debian, as root
curl -sL https://deb.nodesource.com/setup_12.x | bash -
apt-get install -y nodejs
  19. Find the installation instructions for Ubuntu and Debian here: https://github.com/nodesource/distributions/blob/master/README.md
  20. Run the above command on terminal
  21. Run yum install nodejs
  22. Run node
  23. If you have your application on github then copy the link
  24. make a directory using mkdir workspace
  25. Run cd workspace
  26. Run ls
  27. Run git clone <paste github repo link>
  28. Go in the application folder
  29. Run cd <folder name>
  30. Run npm install
  31. Run node app.js
  32. Go to AWS console
  33. Go to EC2
  34. Under instances add Security Group to your instance
  35. Go to Inbound
  36. Add new rule
  37. TCP - 5000 - Anywhere
  38. Save the rule
  39. Type the IP address on browser and add '/5000' in front of it and run it.
  40. If your app is visible, then it is successful

Comments

Post a Comment

Popular posts from this blog

Python - List - Append, Count, Extend, Index, Insert, Pop, Remove, Reverse, Sort

🐍 Advance List List is widely used and it's functionalities are heavily useful. Append Adds one element at the end of the list. Syntax list1.append(value) Input l1 = [1, 2, 3] l1.append(4) l1 Output [1, 2, 3, 4] append can be used to add any datatype in a list. It can even add list inside list. Caution: Append does not return anything. It just appends the list. Count .count(value) counts the number of occurrences of an element in the list. Syntax list1.count(value) Input l1 = [1, 2, 3, 4, 3] l1.count(3) Output 2 It returns 0 if the value is not found in the list. Extend .count(value) counts the number of occurrences of an element in the list. Syntax list1.extend(list) Input l1 = [1, 2, 3] l1.extend([4, 5]) Output [1, 2, 3, 4, 5] If we use append, entire list will be added to the first list like one element. Extend, i nstead of considering a list as one element, it joins the two lists one after other. Append works in the following way. Input l1 = [1, 2, 3] l1.append([4, 5]) Output...
Post a Comment
Read more

Difference between .exec() and .execPopulate() in Mongoose?

Here I answer what is the difference between .exec() and .execPopulate() in Mongoose? .exec() is used with a query while .execPopulate() is used with a document Syntax for .exec() is as follows: Model.query() . populate ( 'field' ) . exec () // returns promise . then ( function ( document ) { console . log ( document ); }); Syntax for .execPopulate() is as follows: fetchedDocument . populate ( 'field' ) . execPopulate () // returns promise . then ( function ( document ) { console . log ( document ); }); When working with individual document use .execPopulate(), for model query use .exec(). Both returns a promise. One can do without .exec() or .execPopulate() but then has to pass a callback in populate.
1 comment
Read more

683 K Empty Slots

  Approach #1: Insert Into Sorted Structure [Accepted] Intuition Let's add flowers in the order they bloom. When each flower blooms, we check it's neighbors to see if they can satisfy the condition with the current flower. Algorithm We'll maintain  active , a sorted data structure containing every flower that has currently bloomed. When we add a flower to  active , we should check it's lower and higher neighbors. If some neighbor satisfies the condition, we know the condition occurred first on this day. Complexity Analysis Time Complexity (Java):  O(N \log N) O ( N lo g N ) , where  N N  is the length of  flowers . Every insertion and search is  O(\log N) O ( lo g N ) . Time Complexity (Python):  O(N^2) O ( N 2 ) . As above, except  list.insert  is  O(N) O ( N ) . Space Complexity:  O(N) O ( N ) , the size of  active . Approach #2: Min Queue [Accepted] Intuition For each contiguous block ("window") of  k  po...
Post a Comment
Read more