A help matrix of the merge flows in optimization problems of packings on multicommodity networks
Abstract
The method for computing the help matrix of merging the small packages of discrete flows during solving the optimization of packings problem in multicommodity networks with restrictions on the period of delivery or the number of merges of flows is proposed. On the basis of the proved statements, efficient computing algorithms for determining the nodes of merge and merged flows with the use of the help matrix for all pairs in a network are developed. Algorithms may be used inside the basic optimization schemes for calcu-lating the time of delivery of flows to the destination and checking for the appropriate restrictions during solving the various optimization problems of packings on transport networks, and also during the design and analysis of message transfers in virtual contain-ers in the state-of-the-art trunk data networks such as Backbone.
References
Vasyanyn V.A., Trofymchuk A.N. Zadacha vыbora yerarkhycheskoy strukturы mnohoproduktovoy kommunykatsyonnoy sety s melkopartyonnыmy dyskretnыmy potokamy // Ekolohichna bezpeka ta pryrodokorystuvannya: Zb. nauk. prats'. — Kyyiv, 2012. — Vyp. 10. — S. 182–204.
Vasyanyn V.A. Ob odnoy zadache dyskretnoy optymyzatsyy v protsessakh upravlenyya perevozkamy na mul'typotokovыkh transportnыkh setyakh // Kybernetyka y vыchyslyt. tekhnyka. — 1983. — Vыp. 60. — S. 82–87.
Vasyanyn V.A. Sravnytel'naya эffektyvnost' alhorytmov optymyzatsyy upakovok v mul'typotokovыkh setyakh // Dyskretnыe systemы upravlenyya: Sb. nauch. tr. — Kyev: Yn-t kybernetyky ym V.M. Hlushkova AN USSR, 1988. — S. 36–45.
