N Is For Networking

4.9（18則評分）
科技
每週更新

N Is For Networking deconstructs the concepts, jargon and acronyms of the data networking industry. Join grumpy old network engineer Ethan Banks with networking newcomer Holly Metlitzky for these episodes that will help you place context around networking terminology.

1 天前

IPsec Basics

It’s time to talk crypto. No, not the Bitcoin kind. Ethan and Holly introduce the basics of IPsec, the protocol that authenticates and encrypts traffic between endpoints. They discuss what it is, how it provides trustworthiness and secrecy to IP traffic, and common use cases. They review the different types of IPsec protocols and modes,... Read more »

58 分鐘
8月14日

OSPF Area Types

Ethan and Holly bring you the last installment of the OSPF series discussing OSPF area types. They discuss why OSPF areas exist, do a quick recap of what OSPF areas actually are, and then introduce the different types of OSPF areas. Lastly, see if you can answer Ethan’s rapid-fire OSPF questions. Episode Transcript: This episode... Read more »

1 小時 9 分鐘
7月31日

Well Actually . . . Listener Comments and Corrections

We ask listeners for follow up and you’ve sent it in. On today’s show we respond to listener comments and corrections on tunneling, the link aggregation control protocol, link aggregation in general, and DHCP options. We also talk about the network engineering certification journey. If you’ve got a “Well, actually” or any other follow up,... Read more »

47 分鐘
7月24日

OSPF Network Types

Ethan and Holly continue their OSPF journey this week with OSPF Network Types. They discuss the two main OSPF network types used today: the broadcast and point to point networks. They also explain designated routers, backup designated routers, and when those are used and why. Lastly they discuss some soft skills – knowing your vendor... Read more »

43 分鐘
7月17日

OSPF Neighbor Formation and Timers

Our OSPF series continues with a look at OSPF neighbor formation and related timers. We talk about the five major packet types that carry information among OSPF routers, how OSPF routers become neighbors, how they negotiate link-state database exchanges, keep-alive messages, and how they negotiate designated and backup routers when multiple devices are on the... Read more »

57 分鐘
6月26日

OSPF Basics

By popular request (and now that we have some other background topics covered) we start our series on the Open Shortest Path First (OSPF) routing protocol. We kick off the series with OSPF basics including Link State Advertisements, Link State Database, and other related essentials. We’ll explore additional OSPF topics over subsequent episodes. This week’s... Read more »

57 分鐘
6月19日

When Is It Time For a Routing Protocol?

If you need to route in your network, you can program static routes into all your routing-capable devices. And this can work. But at some point, you’re probably going to want to switch to a dynamic routing protocol. On today’s N Is For Networking, Ethan and Holly discuss the differences between static and dynamic routes,... Read more »

55 分鐘
6月12日

Network Shapes and Sizes

What shape is your network? In other words, what is its topology? On today’s episode, we discover the different types of network topologies and designs used in the enterprise, data center, and service provider networks. We cover leaf/spine, hub and spoke, point to point, mesh, and others. We also talk about how topologies affect traffic... Read more »

1 小時 3 分鐘

顯示全部 (38)

4.9

（滿分 5 顆星）

18 則評分

Finally!

3月25日

sativahoney

I’ve been looking for a podcast about computer networking for awhile, hoping to gain some more knowledge on the way to work, and this is it! The hosts are engaging and they cover a lot of topics for what seems like all knowledge levels. Thank you for making this!

N Is For Networking deconstructs the concepts, jargon and acronyms of the data networking industry. Join grumpy old network engineer Ethan Banks with networking newcomer Holly Metlitzky for these episodes that will help you place context around networking terminology.