Spectrum allocation policy modeling for elastic optical networks

Rosa, A. N. F.; Çavdar, Çiçek; Carvalho, Solon; Costa, João B.; Wosinska, Lena

doi:10.1109/honet.2012.6421472

Cited by 82 publications

(92 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

Section: Introductionmentioning

confidence: 99%

“…For different quantification methods of fragmentation, we refer the reader to [17], [20], [21], [22]. A number of Spectrum Allocation (SA) policies have been discussed in [21] for dynamic flexgrid networks. The First-Fit (FF) policy, inspired from the FF algorithm devised for the wavelength assignment problem in WRNs [23], [24], places the incoming request in the first available spectral block starting from the low end of the spectrum.…”

Section: Introductionmentioning

confidence: 99%

“…The First-Fit (FF) policy, inspired from the FF algorithm devised for the wavelength assignment problem in WRNs [23], [24], places the incoming request in the first available spectral block starting from the low end of the spectrum. The Exact-Fit (EF) algorithm of [21] places the incoming request in the first available spectral block that exactly matches the request. The EF algorithm is computationally more intensive than FF and results are given in [21] only for the singlelink case.…”

Section: Introductionmentioning

confidence: 99%

“…The Exact-Fit (EF) algorithm of [21] places the incoming request in the first available spectral block that exactly matches the request. The EF algorithm is computationally more intensive than FF and results are given in [21] only for the singlelink case. A spectrum-consecutiveness-based spectrum allocation policy with increased computational complexity is proposed in [22] which is shown to reduce blocking probabilities compared to FF.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Class-based first-fit spectrum allocation with fragmentation avoidance for dynamic flexgrid optical networks

Yumer

Akar

Karasan

2015

Optical Switching and Networking

View full text Add to dashboard Cite

A novel Class-Based First Fit (CBFF) spectrum allocation policy is proposed for dynamic flexgrid optical networks. The effectiveness of the proposed CBFF policy is compared against the First Fit (FF) policy for singlelink and network scenarios. Throughput is shown to be consistently improved under the proposed CBFF policy with throughput gains of up to 15%, compared with the FF policy for the network scenarios we studied. The reduction in bandwidth blocking probability with CBFF with respect to FF increases as the link capacities increase. Throughput gains of CBFF compared with FF are more significant under alternate routing as opposed to fixed routing.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Class-based first-fit spectrum allocation with fragmentation avoidance for dynamic flexgrid optical networks

Yumer

Akar

Karasan

2015

Optical Switching and Networking

View full text Add to dashboard Cite

show abstract

“…É importante atentar que a fragmentação de espectro não está diretamente relacionada com a utilização do espectro, que é definida como uma proporção de espectro utilizado pela quantidade total de recursos espectrais [52]. Dessa forma, o problema de fragmentação de espectro é visto quando os recursos espectrais estão divididos em várias partes pequenas.…”

Section: Fragmentação De Espectrounclassified

Potencializando a modulação adaptativa com roteamento em múltiplos saltos em redes ópticas elásticas

Costa¹

View full text Add to dashboard Cite

Post‐Disaster least loaded lightpath routing in elastic optical networks

Ashraf

Idrus

Butt

et al. 2019

Int J Communication

View full text Add to dashboard Cite

SummaryDisaster events directly affect the physical topology of core networks and may lead to simultaneous failure of multiple lightpaths leading to massive service outages for network operators. To recover from such a failure scenario, the existing routing algorithms running on network nodes (routers or switches) typically attempt to reestablish the connections over new routes with shortest distances and hop count approach. However, this approach may result in congestion on some links, while other links may have the unutilized capacity. Hence, intelligent lightpath computing techniques are required to efficiently route network traffic over the new routes by considering traffic load of each link in addition to distance and hop count to minimize network congestion. In this paper, we have proposed a capacity‐constrained maximally spatial disjoint lightpath algorithm to tackle the provisioning and restoration of disrupted lightpaths in a postdisaster scenario in the context of elastic optical networking. This algorithm computes an alternate least loaded lightpath for disrupted primary lightpath using capacity‐constrained shortest lightpath. Alternate lightpath selection is based on a criteria parameter for a lightpath to be least loaded and constrained by either the length or the spatial distance between primary and alternate lightpaths. The spatial distance between lightpaths enables to reestablish the disrupted connection request away from disaster proximity. The performance of the proposed algorithm is evaluated through simulation for several parameters like blocking probability, network utilization, connection success rates, and minimum spatial distance.

show abstract

Spectrum allocation policy modeling for elastic optical networks

Cited by 82 publications

References 13 publications

Class-based first-fit spectrum allocation with fragmentation avoidance for dynamic flexgrid optical networks

Class-based first-fit spectrum allocation with fragmentation avoidance for dynamic flexgrid optical networks

Potencializando a modulação adaptativa com roteamento em múltiplos saltos em redes ópticas elásticas

Post‐Disaster least loaded lightpath routing in elastic optical networks

Contact Info

Product

Resources

About