Dynamic RSA Problem for Time-Varying Traffic in Spectrum Sliced Elastic Optical Path Network

• Autorzy: Olszewski I.

Identyfikatory

DOI

10.1515/eletel-2015-0023

• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

time-varying traffic; dynamic RSA problem; optical path; OFDM modulation

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: International Journal of Electronics and Telecommunications
• Rocznik: 2015
• Tom: Vol. 61, No. 2
• Strony: 179--184
• Opis fizyczny: Bibliogr. 7 poz., wykr.

Twórcy

autor

Olszewski I.

• Institute of Telecommunications, Faculty of Telecommunications, Informatics and Electrical Engineering, UTP University of Sciences and Technology, S. Kaliskiego 7, 85-789 Bydgoszcz, Poland

Bibliografia

• [1] X. Wan, N. Hua, X. Zeng, “Dynamic Routing and Spectrum Assignment in Spectrum –Flexible Transparent Optical Networks,”J. Opt. Commun. Netw, vol. 4, August 2012, pp. 603–613.
• [2] M. Klinkowski, K. Walkowiak, “Routing and Spectrum Assignment in Spectrum Sliced Optical Path Network,” IEEE Communications Letters, vol. 15, August 2011, pp. 884–886.
• [3] K. Christodoulopoulos, I. Tomkos, A.E. Varvarigos, ”Routing and Spectrum Allocation in OFDM-based Optical Networks with Elastic Bandwidth Allocation”. Telecommunications Conference (GLOBECOM 2010), 6-10 Dec. 2010.
• [4] K. Christodoulopoulos I. Tomkos, A.E. Varvarigos, “Routing and Spectrum Allocation Policies for Time-Varying Traffic in Flexible Optical Networks,” 16th International Conference, Optical Network Design and Modeling (ONDM), 17-20 April 2012.
• [5] I. Olszewski, “RSA Problem for Varying Traffic in Flexible Optical Networks,”. Image Processing & Communication, vol 19, no.1, 2014.
• [6] A. Kaufmann, “Graphs, Dynamic Programming and Finite Games,” Academic Press, 1967, pp 270-280.
• [7] Y. Man-Ching, J. Weijia, Ch. Chi-chung, “Efficient Distributed QoS Routing Protocol for MPLS Networks,” 11th International Conference on Parallel and Distributed Systems, 2005