scispace - formally typeset
Proceedings ArticleDOI

Optimization Computational Methods for Link Circuit Capacity and Time Delay

Reads0
Chats0
TLDR
Using this method, not only the result by the current methods, but also a link capacity assignment result with minimum network delay can be obtained, which meets the restrictive conditions of link delay differences and link capacities.
References
More filters
Journal ArticleDOI

Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks

TL;DR: A method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfermode (ATM) virtual path (VP)-based restoration and jointly optimizing working path routing and spare capacity placement.
Journal ArticleDOI

Approximating optimal spare capacity allocation by successive survivable routing

TL;DR: Numerical results comparing several SCA algorithms show that SSR has the best trade-off between solution optimality and computation speed.
Journal ArticleDOI

New Optimization Criteria for Message-Switching Networks

TL;DR: In this paper, a new class of criteria for the optimum capacity assignment in store-and-forward communication networks under a total fixed-cost constraint is presented, which are more sensitive to the needs of the individual user.
Journal ArticleDOI

Lattice networks: capacity limits, optimal routing, and queueing behavior

TL;DR: This paper studies the routing algorithms that achieve the maximum rate per node for infinite and finite buffers in the nodes and different communication models, namely uniform communications, central data gathering and border data gathering.