The design of store-and-forward (s/f) networks for computer communications
The design of store-and-forward (s/f) networks for computer communications
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
An approximate algorithm for the servers replication problem with two cost constraints in WAN
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
The three-criteria servers replication and topology assignment problem in wide area networks
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Discrete capacity and flow assignment algorithms with performance guarantee
Computer Communications
| Hi-index | 0.24 |
Joint optimization of capacity and flow assignment (CFA) is considered for a least-cost routing and bandwidth allocation in packet switched networks, in which multiple links are modeled by parallel M1 queues. A generic cost-objective function is introduced to reflect both switching and channel costs. Queueing, transmission, nodal processing and propagation delays are all incorporated into the optimization problem. The proposed CFA problem is shown to be a convex optimization problem, thus ensuring a global solution. Furthermore, a more general optimization approach has been developed to circumvent the computational limitation associated with the existing optimization formulation and to capture the discrete nature of channel allocation.