Haberleşme ağlarında sabit maliyetli 2 ayrıt bağlılık için algoritmalar

In this thesis, several algorithms are developed in order to provide cost-effectiveand survivable communication in telecommunications networks. In its broadest sense,a survivable network is one which can maintain communication even in the presenceof a physical breakdown. There are several ways of providing survivable communicationin a given network. Our choice is to hedge against single link failures and providetwo edge disjoint paths for every source and destination pair. Each edge in thenetwork is assumed to have a variable unit routing cost and a fixed usage cost.Our objective is the minimization of the total routing cost of the traffic demandand the fixed cost of the utilized links. Several constructive and improvementtype heuristics are developed and tested extensively in an experimental design setting.