Research note: Capacity assignment in computer communication networks with unreliable links

Authors:
Debashis Saha;Amitava Mukherjee;Sourav K Dutta
Affiliations:
Department of Computer Science and Engineering, Jadavpur University, Calcutta 700 032, India;Department of Electronics and Telecommunication Engg, Jadavpur University, Calcutta 700 032, India;Department of Computer Science and Engineering, Jadavpur University, Calcutta 700 032, India
Venue:
Computer Communications
Year:
1994

Citing 3
Cited 3

Topological design of a distributed computer communication network in a noisy environment

Computer Communications
Fiberoptic circuit network design under reliability constraints

IEEE Journal on Selected Areas in Communications
Computer-aided design procedures for survivable fiber optic networks

IEEE Journal on Selected Areas in Communications

Research: Computational analysis of an optimal routing strategy in a hierarchical computer communication network

Computer Communications
Research: An efficient link enhancement strategy for computer networks using genetic algorithm

Computer Communications
On the multidensity gateway location problem for a multilevel high speed internetwork

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

This paper considers the problem of selecting the optimum capacities of the links in a computer communication network which employs unreliable links. Given the nodes, links, link probabilities, grade of service and cost functions of the network, the objective of this problem is to find the optimum link capacities that minimize the network design cost, subject to the constraint equation involving the grade of service. This is essentially a combinatorial optimization problem. A general methematical model for this problem is formulated and a set of feasible solutions is obtained using Lagrangean relaxation and subgradient optimization techniques. A simulation study has been performed to verify the model, and favourable results obtained for a variety of nontrivial networks.