C_TS410_2020 - SAP Certified Application Associate - Business Process Integration with - PDF document

Learning SAP Certified Application Associate - Business Process Integration with SAP S/4HANA 2020 Dumps Certification Get your required dump now: https://certsgot.com/product/dumps - c_ts410_2020 - sap - certified - application - associate - business - process - integration - with - sap - s - 4hana - 2020/ Copy Paste The Above URL To Get The Dump Related Information In this video, we want to get some practise analysing a s panning tree topology and determining who is the route bridge, what are the root ports, what are the designated ports, and which ports are blocking. And I wish I had been exposed to this. Prior to my interview at Walt Disney World, they asked me a very sim ilar question that we’re going to be answering here͕ and they asked me which ports are blocking in this topology. Now, at the time, I thought I knew about spanning trees. I knew that it would prevent a layer - two topological loop by not sending traffic over certain links. But what I did not understand is that on those links that are not carrying traffic, both ends are not blocking. Only one end is blocked. The other end is still a designated port because every single link has a designated port. So I missed t he question in the interview. Fortunately, I still got the job. But = wish = had known what we’re about to go over right now͘ Question number one is͗ who is the root bridge? And we know it’s the switch with the lowest bid͕ the lowest bridge =D͖ that’s the priority first, followed by the Mac address as a tiebreaker. And it looks like switches A and B have lower priorities than switches C and D. A and B have 16 384 c priorities, while D has 32 768 priorities. So it’s going to be either switch A or switch B fo r the route. And since the priorities are tied, we look at the Mac address. Who has the lowest Mac address? Well, if we take a look at the first three hexadecimal digits of the Mac address, it looks like zero is less than one. And from that, we can conclud e that switch A is the root bridge͘ Now we ask͕ “Who are the root ports?” And remember͕ there are no on the route bridge͘ A route port is the one and only port on an off - route bridge that’s closest to the route in terms of cost͘ And we’re going to use the traditional short path cost method, where a ten - gig link has a cost of two and a gig link has a cost of four. Now switch B is connected to switch A over a 10 - gigabit link͘ That’s what the tea refers to͘ =t is port number ten͘ That’s a $2 link for a 10 - giga bit connection͘ =s that the root port? Well͕ let’s figure out the cost of the other paths along the route͕ and we’ll pick the lowest one͘