The flow deviation method: An approach to store‐and‐forward communication network design
From MaRDI portal
Publication:5454363
DOI10.1002/net.3230030202zbMath1131.90321OpenAlexW2021136283MaRDI QIDQ5454363
Mario Gerla, Luigi Fratta, Leonard Kleinrock
Publication date: 28 March 2008
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230030202
Communication networks in operations research (90B18) Sampling theory in information and communication theory (94A20)
Related Items
Allocating capacity in parallel queues to improve their resilience to deliberate attack, A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods, Multiple allocation hub-and-spoke network design under hub congestion, Integrating reliability and quality of service in networks with switched virtual circuits, A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network, Unnamed Item, A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem, An efficient graph technique based dual-type algorithm for NMNF problems with large capacity constraints, Uniqueness of the solution for optimal static routing in open BCMP queueing networks, A bundle-type algorithm for routing in telecommunication data networks, Anycasting in connection-oriented computer networks: Models, algorithms and results, Routing and capacity assignment in backbone communication networks, Subpopulation initialization driven by linkage learning for dealing with the long-way-to-stuck effect, On minimum congestion routing in rearrangeable multihop lightwave networks, Telecommunications network design: Technology impacts and future directions, A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks, A minimum mean cycle cancelling method for nonlinear multicommodity flow problems, Optimal routing for multiclass networks, Unnamed Item, A performability-oriented approach to the design and synthesis of data networks, Topological design of computer communication networks -- the overall design problem, Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks, An algorithm for network dimensioning under reliability considerations, Optimal design of LAN-WAN internetworks: An approach using simulated annealing, Topological design of wide area communication networks, Maximizing residual capacity in connection-oriented networks, Adaptive memory in multistart heuristics for multicommodity network design, Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks, Configuring wide area computer networks. Problems and models, The projected pairwise multicommodity flow polyhedron, Separable convexification and DCA techniques for capacity and flow assignment problems, Unnamed Item, A tabu search algorithm for the routing and capacity assignment problem in computer networks, Routing Algorithmen in Datennetzen - eine vergleichende Simulationsstudie. (Routing algorithms in data networks - a comparing simulation study), k -Splittable delay constrained routing problem: A branch-and-price approach, Call admission control schemes and ATM network topological design, ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems, Resource allocation in state-dependent emergency evacuation networks, Queuing effects in the solution of constrained store-and-forward network flow problems, Capacity planning in manufacturing and computer networks, A heuristic approach for capacity expansion of packet networks, Resource allocation and capacity assignment in distributed systems, Bounds for global optimization of capacity expansion and flow assignment problems, Optimal control of store-and-forward networks, An algorithm for optimal minimax routing in ATM networks, Effect of model uncertainty on some optimal routing problems, Asynchronous transfer mode networks with parallel links and multiple service classes, A heuristic for the continuous capacity and flow assignment
Cites Work
