Switch Incompatibility - 1

Weak Incompatibility:

Temporal incongruence can be fixed by moving landing sites back in time.

s1 __u’ precedes v

s2 __w’ precedes x

Previous slide

Next slide

Back to first slide

View graphic version

In this example the host switch s1 implies u’ precedes v and s2 implies w’ precedes x. These two partial orderings are not incompatible and can be accommodated on the same host tree.