Design of computer communication networks under link reliability constraints

Author

Saha, D. ; Mukherjee, A. ; Dutta, S.K.

Author_Institution

Dept. of Comput. Sci. & Eng., Jadavpur Univ., Calcutta, India

Volume

1

fYear

1993

fDate

19-21 Oct. 1993

Firstpage

188

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.<>

Keywords

fault tolerant computing; reliability; Lagrangean relaxation; computer communication networks; constraint equations; general mathematical model; link reliability constraints; minimum cost network; node to node traffic capacities; subgradient optimization technique; unreliable links; Availability; Communication networks; Computer network reliability; Computer networks; Costs; Design methodology; Equations; Telecommunication network reliability; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON '93. Proceedings. Computer, Communication, Control and Power Engineering.1993 IEEE Region 10 Conference on

Conference_Location

Beijing, China

Print_ISBN

0-7803-1233-3

Type

conf

DOI

10.1109/TENCON.1993.319960

Filename

319960