Service time-varying traffic flexible optical networks require a dynamic bandwidth allocation in order to follow the source transmission rate. The problem of service time-varying traffic, assuming that the set of connection requests is not known in advance, is considered in this work. Connection requests arrive randomly and have random durations. The considered dynamic RSA problem involves minimizing the probability of future connections blocking while maintaining spectrum continuity constraints and non-overlapping spectrum assignment constraints between spectrum-adjacent connections on the network links. The proposed algorithm determines the path with the required number of slots around the reference frequency for a connection request. An analysis of the network with time-varying traffic on the network connections was carried out on the basis of spectrum expansion/contraction schemes which allow to determine average blocking probability of the additional slot requests on these connections. The obtained results have been compared with those obtained by a well known algorithm that solves the dynamic RSA problem.
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ć.