Skip to main content

AWS Networking DHCP and VPC

By

AWS Networking DHCP and VPC

AWS Networking DHCP and VPC

What is DHCP

DHCP servers dynamically assigns an IP address and other network configuration parameters to each device on a network so they can communicate with other IP networks
To get to DHCP in your VPC you ofcourse first click VPC in aws console
Click VPC

DHCP Options Set

You can set options in AWS for which address from the pool devices would get. So in AWS you can set the options such as DNS NTP NetBios servers - these are the options that devices would once they connect and get a new ip from your DHCP service this is called DHCP options set.

Click DHCP Option Set

DHCP option set is actually configuration params related to how to setup address protocol on the device that received the conf from DHCP not only how to get the ip get ip but you can also set other options.

Give DHCP option set a name

_

Give it a name

These are the options that new devices would get they would get the domain name the dns server ntp server etc.
  • Give the new dhcp option set a name.
  • Give it a domain name
  • Provide the dns server can do it later.
  • NetBIOS - do not need to set it.
Then just click create
And ! DHCP option set has been created

Subnets and DHCP Options Set

For each subnet you might need to create DHCP options.

Summary

For each subnet you might need to cretate dhcp options set. DHCP options set allow you to configure the options clients get when they connect and get a new IP such as domain name, ntp server name etc.
DHCP itself is used to provide dynamic addresses where required within your VPC

Comments

Post a Comment

Popular posts from this blog

Functional Programming in Scala for Working Class OOP Java Programmers - Part 1

By
Introduction Have you ever been to a scala conf and told yourself "I have no idea what this guy talks about?" did you look nervously around and see all people smiling saying "yeah that's obvious " only to get you even more nervous? . If so this post is for you, otherwise just skip it, you already know fp in scala ;) This post is optimistic, although I'm going to say functional programming in scala is not easy, our target is to understand it, so bare with me. Let's face the truth functional programmin in scala is difficult if is difficult if you are just another working class programmer coming mainly from java background. If you came from haskell background then hell it's easy. If you come from heavy math background then hell yes it's easy. But if you are a standard working class java backend engineer with previous OOP design background then hell yeah it's difficult. Scala and Design Patterns An interesting point of view on scala, is
14 comments
Read more

Alternatives to Using UUIDs

By
  Alternatives to Using UUIDs UUIDs are valuable for several reasons: Global Uniqueness : UUIDs are designed to be globally unique across systems, ensuring that no two identifiers collide unintentionally. This property is crucial for distributed systems, databases, and scenarios where data needs to be uniquely identified regardless of location or time. Standardization : UUIDs adhere to well-defined formats (such as UUIDv4) and are widely supported by various programming languages and platforms. This consistency simplifies interoperability and data exchange. High Collision Resistance : The probability of generating duplicate UUIDs is extremely low due to the combination of timestamp, random bits, and other factors. This collision resistance is essential for avoiding data corruption. However, there are situations where UUIDs may not be the optimal choice: Length and Readability : UUIDs are lengthy (typically 36 characters in their canonical form) and may not be human-readable. In URLs,
Post a Comment
Read more

Bellman Ford Graph Algorithm

By
The Shortest path algorithms so you go to google maps and you want to find the shortest path from one city to another.  Two algorithms can help you, they both calculate the shortest distance from a source node into all other nodes, one node can handle negative weights with cycles and another cannot, Dijkstra cannot and bellman ford can. One is Dijkstra if you run the Dijkstra algorithm on this map its input would be a single source node and its output would be the path to all other vertices.  However, there is a caveat if Elon mask comes and with some magic creates a black hole loop which makes one of the edges negative weight then the Dijkstra algorithm would fail to give you the answer. This is where bellman Ford algorithm comes into place, it's like the Dijkstra algorithm only it knows to handle well negative weight in edges. Dijkstra has an issue handling negative weights and cycles Bellman's ford algorithm target is to find the shortest path from a single node in a graph t
1 comment
Read more