Openfabric: A Short Video of the IETF Presentation
The most current version of the draft can be found here. There is one more comment from Uma that still needs to be addressed, and one more section that needs to be added.
DC Fabric Segment Routing Use Case (1)
A couple of weeks ago, I attended a special segment routing Networking Field Day. This set me to thinking about how I would actually use segment routing in a live data center. As always, I'm
DR versus DIS: What’s the Diff?
OSPF and IS-IS, both link state protocols, use mechanisms that manage flooding on a broadcast link, as well as simplify the shortest path tree passing through the broadcast link. OSPF elects a Designated Router (or
Flooding Domains versus Areas
At a fundamental level, OSPF and IS-IS are similar in operation. They both build neighbor adjacencies. They both use Dijkstra's shortest path first (SPF) to find the shortest path to every destination in the network.
CAP Theorem and Routing
In 2000, Eric Brewer was observing and discussing the various characteristics of database systems. Through this work, he observed that a database generally has three characteristics— Consistency, which means the database will produce the same
recent comments