Capacity and Flow Assignments in Large Computer Networks

11 Pages Posted: 31 Oct 2008

See all articles by Bezalel Gavish

Bezalel Gavish

Independent

Irina Neuman

affiliation not provided to SSRN

Date Written: January 1986

Abstract

This paper presents a model and the correspondingsolution method for the problem of jointly selecting a setof primary routes and assigning capacities to the links ina computer communication network. The network topologyand the traffic characteristics are known; a set ofcandidate routes for each communicating pair of nodes,and a set of candidate capacities for each link are alsogiven. The goal is to obtain the least costly feasible design,where the costs include both capacity and queuingcomponents.The resulting combinatorial optimization problem issolved using Lagrangean relaxation and subgradient optimizationtechniques. The method was tested on severaltopologies, and in all cases good feasible solutions, as wellas tight lower bounds were obtained.

Suggested Citation

Gavish, Bezalel and Neuman, Irina, Capacity and Flow Assignments in Large Computer Networks (January 1986). NYU Working Paper No. IS-86-02, Available at SSRN: https://ssrn.com/abstract=1289753

Irina Neuman

affiliation not provided to SSRN

No Address Available

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
42
Abstract Views
588
PlumX Metrics