Determination of minimum number of wavelengths required for all-optical WDM networks using graph colouring

Access Full Text

Determination of minimum number of wavelengths required for all-optical WDM networks using graph colouring

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

The minimum number of carrier wavelengths required for full interconnection of a wavelength-routed optical fibre network was determined using the graph colouring of a ‘shortest-path graph’, derived from the original network description. No two messages with the same carrier wavelength and different source/destination pass over the same communication link, and all sources connect to all possible destinations. The results are applicable to a national wave-division multiplex back-bone network.

Inspec keywords: wavelength division multiplexing; graph colouring; optical fibre networks

Other keywords: carrier wavelengths; WDM back-bone network; graph colouring; wavelength-division multiplexed network; full interconnection; all-optical WDM networks; shortest-path graph; minimum number of wavelengths; wavelength-routed optical fibre network

Subjects: Combinatorial mathematics; Communication switching; Optical communication

References

    1. 1)
      • N. Biggs , R. Wilson , R. Nelson . (1990) Some heuristics for graph colouring, Graph colourings.
    2. 2)
      • Riddington, M.: `Graph colouring by application of random methods and genetic algorithms', 1994, MSc, University College London.
    3. 3)
      • C.A. Bracket . Dense wavelength division multiplexing networks: Principles and application. IEEE J. Sel. Areas Commun. , 948 - 964
    4. 4)
      • A. Stavdas , J.E. Midwinter , P. Bayvel , C. Todd . Design of holographic concave grating used as a multiplexer/demultiplexerin dense wavelength-routed optical networks with subnanometer channel spacing. J. Mod. Opt. , 1863 - 1874
    5. 5)
      • D.J.A. Welsh , M.J.D. Powell . An upper bound for the chromatic number of a graph and its applicationsto time-tabling problems. Comput. J. , 85 - 87
    6. 6)
      • R.W. Floyd . Algorithm 97: Shortest path. Commun. ACM
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19951305
Loading

Related content

content/journals/10.1049/el_19951305
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading