Dynamic data transfer demands are often being a challenge for present communication networks, as they appear in unpredictable time and must be satisfied prior to deadline. Important kind are the multi-target demands occurring in task of replication, backup, database synchronization or file transferring in pear-to-pear networks. Optimal scheduling usually depends of the nature of transport network. In the paper dynamic deadlinedriven multicast scheduling problem over elastic optical network is considered. Particularly, the method for improving link utilization by traffic balance for multicast demands is proposed. Few heuristic algorithms and results of experiments, proving the benefits of balancing concept are presented
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
This work introduces ANB (Ant Algorithm for Non-Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern the use of ant algorithms in the assignment of static flows in connection-oriented networks. We analyze the major characteristics of the ANB and try to explain its performance. We report results of many experiments over various networks.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.