What people are saying - Write a review
We haven't found any reviews in the usual places.
Low Intensity Flow
Local Access Network Design
4 other sections not shown
algorithm allocation approximation arc flows arc ij ARPANET assumed average delay bifurcated flows calculated CAND cluster computer networks concave concave function concentrator congestion connected considered convex convex set corresponding DECNET denotes destination directed graph dist(j edge edge-connected end Output feasible solution Frank-Wolfe function given hence hops increase initial iteration kbps knapsack problem Lagrangean relaxation layer leads line search linear link ij link lengths lower bound matrix maximise maximum miles of cable minimise module multipliers network of figure node network node-connected obtained oo oo optimal solution optimisation pair Pirkul problem of example Proof queue removed routing table satisfies shortest distance shortest path shortest route shown in figure simulated annealing solve subgradient subnet Suppose tabu tabu search terminal Theorem tion total delay transmitted tree TYMNET update variables virtual circuit zero