Abstract

This paper describes a method to design a cost effective computer communication network which employs unreliable links. The design is aimed at obtaining a minimum cost network which satisfies the given constraints of grade of service defined in terms of the degree of availability of the network and the node to node traffic capacities in normal conditions. We present a general mathematical model for this problem and formulate the constraint equations. We then solve the problem by applying Lagrangean relaxation to the constraint equations based on subgradient optimization technique. >

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call