We introduce the notion of isolated template immunity in communication networks. A template is simply a connected graph. A network's topology is template immune to a set of templates T if it remains connected under removal of any imbedding of an element of T. A network's operational protocol is template immune to a set of templates T if its topology is template immune and its protocol guarantees that operating sites can communicate. Isolated template immunity to a set of templates T allows multiple failures such that one imbedded template does not contain vertices or neighbors of another imbedded template. We discuss network topologies and associated protocols represented as routing tables or calling procedures, that are isolated template immune to template sets consisting of bounded length paths.