SwePub
Sök i LIBRIS databas

  Utökad sökning

(LAR1:cth) pers:(Karlsson Magnus 1967) srt2:(2015-2019)
 

Sökning: (LAR1:cth) pers:(Karlsson Magnus 1967) srt2:(2015-2019) > Channel allocation ...

Channel allocation in elastic optical networks using traveling salesman problem algorithms

Bhar, Chayan, 1988 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
Agrell, Erik, 1965 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
Keykhosravi, Kamran, 1990 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
visa fler...
Karlsson, Magnus, 1967 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
Andrekson, Peter, 1960 (författare)
Chalmers tekniska högskola,Chalmers University of Technology
visa färre...
 (creator_code:org_t)
2019
2019
Engelska.
Ingår i: Journal of Optical Communications and Networking. - 1943-0620 .- 1943-0639. ; 11:10, s. C58-C66
  • Tidskriftsartikel (refereegranskat)
Abstract Ämnesord
Stäng  
  • Elastic optical networks have been proposed to support high data rates in metro and core networks. However, frequency allocation of the channels (i.e., channel ordering) in such networks is a challenging problem. This requires arranging the optical channels within the frequency grid with the objective of ensuring a minimum signal-to-noise ratio (SNR). An optimal arrangement results in the highest SNR margin for the entire network. However, determining the optimal arrangement requires an exhaustive search through all possible arrangements (permutations) of the channels. The search space increases exponentially with the number of channels. This discourages an algorithm employing an exhaustive search for the optimal frequency allocation. We utilize the Gaussian noise (GN) model to formulate the frequency allocation (channel ordering) problem as a variant of the traveling salesman problem (TSP) using graph theory. Thereafter, we utilize graph-theoretic tools for the TSP from the existing literature to solve the channel ordering problem. Performance figures obtained for the proposed scheme show that it is marginally inferior to the optimal search (through all possible permutations) and outperforms any random allocation scheme. Moreover, the proposed scheme is implementable for a scenario with a large number of channels. In comparison, an exhaustive search with the GN model and split-step Fourier method simulations are shown to be feasible for a small number of channels only. It is also illustrated that the SNR decreases with an increase in bandwidth when the frequency separation is high.

Ämnesord

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)
TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Kommunikationssystem (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Communication Systems (hsv//eng)
TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Signalbehandling (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Signal Processing (hsv//eng)

Publikations- och innehållstyp

art (ämneskategori)
ref (ämneskategori)

Hitta via bibliotek

Till lärosätets databas

Sök utanför SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy