A bounded optimization algorithm for capacity assignment in computer communication networks

Carol A. Niznik · International Journal of Systems Science · 1980

An algorithm is derived here for minimizing point to point delay in a store and forward computer communication network for any of the following topologies : a single node with multiple inputs (through communication processor ports), two nodes multiply connected or a multilevel (hierarchical) network composed of many single and two node combinations of multiple connections. The constraints of (1) a given lower and upper bound on each link capacity and (2) the summation of all capacities to a specific given value, for a section of the network or the entire network, are applied to formulate the capacity equations.

Read the paper · More papers on PaperTik