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 result for any two readers who happen to read a value at the same moment in time.
- Availability, which means the database can be read by any reader at any moment in time.
- Partionability, which means the database can be partitioned.
Brewer, in explaining the relationship between the three in a 2012 article, says—
The CAP theorem, therefore, represents a two out of three situation—yet another two out of three “set” we encounter in the real world, probably grounded someplace in the larger space of complexity. We’ll leave the relationship to complexity on the side for the moment, however, and just look at how Continue reading
Register for SDxCentrals first ever Future of the Converged Data Center Report Webinar sponsored by Big Switch Networks on April 6th at 10:00am PT.

This will be the Year of the Hybrid Cloud.
It’s based on OpenStack, COTS hardware, and a pod architecture.
Dell anticipates declining demand for proprietary networking and storage architectures.