Abstract-The physical infrastructure of communication networks is vulnerable to spatially correlated failures arising from various physical stresses such as natural disasters (earthquakes and hurricanes) as well as malicious coordinated attacks using weapons of mass destruction. Some disaster events such as earthquakes and terrorist attacks may occur in more than one location in a short period of time. Hence multiple sets of correlated link failures may occur if more events occurred before the previous set of failed links were repaired. Here, the statistical properties of induced-failure patterns depend upon the spatial interaction among stress centers (e.g., interaction among earthquake or attack locations). This paper presents a stochastic model, based on spatial point processes, for representing stress centers on the geographical plane in order to facilitate the modeling of spatially inhomogeneous and correlated link failures in communication networks. This model is then used to further generate scenarios with inhibition or clustering between stress centers, which enables detailed assessment of vulnerabilities of the network to the level of inhomogeneity and spatial correlation in the stress-event centers. Detailed simulation results are presented to compare network reliability for various scenarios of link failures and to find geographically vulnerable areas of a network as well as worstcase scenarios of stress-events. Overall, this effort will provide some critical knowledge and simulation capabilities for other focus areas of research in network reliability and survivability.
Abstract-We study optimal maximum likelihood block decoding of binary codes sent over binary contagion channels with infinite and finite memory. We derive conditions on the codes and channels parameters under which maximum likelihood and minimum Hamming distance are equivalent. We also note that under these conditions, minimum distance decoding can perform better without the use of channel interleaving.
Abstract-We study the optimal maximum likelihood (ML) block decoding of general binary codes sent over two classes of binary additive noise channels with memory. Specifically, we consider the infinite and finite memory Polya contagion and queue-based channel models, which were recently shown to approximate well binary modulated correlated fading channels used with hard-decision demodulation. We establish conditions on the codes and channels parameters under which ML and minimum Hamming distance decoding are equivalent. We also present results on the optimality of classical perfect and quasi-perfect codes when used over the channels under ML decoding. Finally, we briefly apply these results to the dual problem of syndrome source coding with and without side information.Index Terms-Binary channels with finite and infinite memory, Markov noise, ML and minimum distance decoding, block codes, source-channel coding duality, syndrome source coding.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.