2011 · 10 citations · 5 references
ComputingComputer ScienceComputer NetworksFault ToleranceInterconnection NetworksMesh NetworksNetwork Capacity PlanningNetwork Fault ToleranceNetwork Performance AnalysisNetwork ReliabilityNetwork RobustnessMesh NetworkingNetwork CapacityNetwork CodingNetwork Performance OptimizationResilient NetworkingTraffic DistributionTransport CapacityUpper Bound Computation
A meshed network with N transport paths can be effectively protected against single link failures using network coding and protection cycles (p-cycles). This so called 1+N protection scheme provides instantaneous recovery from single link failures. The performance of this scheme has thus far been considered for a network with unit traffic demands, and the reported results were based on simulations. In this paper, we give an analytical upper bound on the required transport capacity for 1+N protection in full-meshed networks with unit traffic demands. Next, we consider networks with uniform and exponentially distributed traffic demands, and derive more realistic bounds for the achievable network performance of 1+N protection in full-meshed networks.We will show analytically that the gains decrease significantly relative to a unit-traffic demand distribution, independent of the protection mechanism used.
5
Rudolf Ahlswede, Ning Cai, Shuo Li et al. · IEEE Transactions on Information Theory · 2000 · 7.9K citations
Fast accurate computation of large-scale IP traffic matrices from link loads
Yin Zhang⋆, Matthew Roughan, Nick Duffield et al. · 2003 · 505 citations
Traffic matrix estimation on a large IP backbone
Anders Gunnar, Mikael Johansson, Thomas Telkamp · 2004 · 174 citations