Time-varying spectrum allocation policies and blocking analysis in flexible optical networks

Konstantinos Christodoulopoulos, Ioannis Tomkos, Emmanouel Varvarigos

Research output: Contribution to journalArticleResearchpeer-review

60 Citations (Scopus)


We consider the problem of serving traffic in a spectrum-flexible optical network, where the spectrum allocated to an end-to-end connection can change so as to adapt to the time-varying required transmission rate. In the proposed framework, each connection is assigned a route and is allocated a reference frequency over that route, using an appropriate Routing and Spectrum Allocation (RSA) algorithm, but the spectrum it utilizes around the reference frequency is allowed to expand and contract to match source rate fluctuations. We propose and analyze three spectrum expansion/contraction (SEC) policies for modifying the spectrum allocated to each connection. The first policy, named the Constant Spectrum Allocation (CSA) policy, allocates a number of spectrum slots for exclusive use by each connection. We also present two policies that enable the dynamic sharing of spectrum slots among connections, named the Dynamic High Expansion-Low Contraction (DHL) and the Dynamic Alternate Direction (DAD) policy. We give exact formulas for calculating the blocking probability for a connection and for the whole network under the CSA policy and provide corresponding approximate analyses under the DHL and DAD policies. We also present a simple iterative RSA algorithm that uses the developed blocking models so as to minimize the average blocking of the network. 

Original languageEnglish
Article number6381740
Pages (from-to)13-25
Number of pages13
JournalIEEE Journal on Selected Areas in Communications
Issue number1
Publication statusPublished - 2013
Externally publishedYes


  • blocking probability
  • routing and spectrum allocation
  • spectrum expansion/contraction policies
  • spectrum sharing
  • Spectrum-flexible networks
  • time-varying traffic

Cite this