A new approach to cache cohrent netwroks is proposed and analyzed. This approach is highly scalable, so if is appropriate for massively parallel multiprocessores. The network switches of a MIN are enhanced such that they are capable of handling the majority of the cache cohrence burden. The latency for both breads and writes is O(log N) independent of the number of copies. The memory overhead of this approach is O(Clog2 N)