RSA Problem for Varying Traffic in Flexible Optical Networks

Olszewski, Ireneusz

doi:10.1515/ipc-2015-0004

Cited by 1 publication

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, the analysis is repeated 30 times for different states of the network obtained for the same load. An outline of the network analysis for both schemes of additional slots allocation is given in [5]. .…”

Section: Network Analysis For Time-varying Trafficmentioning

confidence: 99%

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

Olszewski

2015

International Journal of Electronics and Telecommunications

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Network Analysis For Time-varying Trafficmentioning

confidence: 99%