The Design of Template Immune Networks: Path Immunity
| dc.contributor.author | Farley, Arthur M. | |
| dc.contributor.author | Proskurowski, Andrzej | |
| dc.date.accessioned | 2023-06-20T18:42:03Z | |
| dc.date.available | 2023-06-20T18:42:03Z | |
| dc.date.issued | 1989-03-24 | |
| dc.description | 13 pages | en_US |
| dc.description.abstract | A network is specified by a topology definition and a protocol definition. A network's topology, represented as a graph, defines its interconnection structure, while the protocol defines its operational behavior. A template is a connected graph. A topology G is immune to a set of templates T if G remains connected under removal of any imbedding of a single element of T. A network is template immune to a set of templates T if its topology is immune to T and its protocol guarantees that all operative sites can communicate in the presence of possible failures. A network is isolated template immune to a set of templates T if it is immune to multiple imbeddings of elements of T, where each imbedded template does not involve vertices that are neighbors of another imbedded template. We discuss networks that are isolated template immune to simple path templates of length k. | en_US |
| dc.identifier.uri | https://hdl.handle.net/1794/28428 | |
| dc.language.iso | en | en_US |
| dc.publisher | University of Oregon | en_US |
| dc.rights | Creative Commons BY-NC-ND 4.0-US | en_US |
| dc.subject | template immunity | en_US |
| dc.subject | simple path templates | en_US |
| dc.subject | topography | en_US |
| dc.subject | protocol | en_US |
| dc.title | The Design of Template Immune Networks: Path Immunity | en_US |
| dc.type | Article | en_US |