Hegons

HEGONS is a HEterogeneous Grooming Optical Network Simulator that supports mixed routing and wavelength assignment algorithms and optional wavelength conversions capability on each node. The goal of Hegons is the evaluation of different dynamic routing and wavelength assignment (RWA) algorithms in WDM optical networks in terms of several measures such as: call blocking probability, fairness (variance in blocking probability), call setup time, etc.

Tags Scientific/Engineering
Operating Systems POSIX Linux Windows Windows
Implementation C

Tweet this project Short link

Rss Recent releases

  • Rrelease-mid
  •  12 Sep 2007 10:58
  • Rrelease-after

Changes: Optionally, converter nodes can now try the same chosen channel from the previous node before doing conversion. In other words, the converter node will first act as a non-converter node; if the channel fails, only then it will do conversion. You can use this option simply by defining TRY_PREV_CHANNEL directive in the code. The purpose of this feature is to try to reduce the blocking probability by trying to maintain the same wavelengths chosen along light paths.

  • Rrelease-mid
  •  15 May 2007 03:06
  • Rrelease-after

Changes: A new "Multi-hop Partial Grooming" node type was added. A partial grooming node can now have multiple G-fabrics. This is a new concept that has never been discussed in the literature. The RWA method chosen will be applied internally in the nodes between W and G fabrics as well as externally. -px and -pn options were added for controlling the max/min number of times G-fabric switchings are done per call. Other minor fixes and changes were made.

  • Rrelease-mid
  •  11 Mar 2007 03:56
  • Rrelease-after

Changes: The -ll and -ml options were added for "Least Loaded Routing (LLR)" and "Most Loaded Routing (MLR)". This works for both grooming and non-grooming. For the grooming case, the simulator assumes the path with the least (or most) number of time slots used to be the least (or most) loaded path. However, those two methods are still not well defined for the grooming case in the literature.

  • Rrelease-mid
  •  03 Mar 2007 13:58
  • Rrelease-after

Changes: The number of nodes in a network the number of wavelengths per link are practically unlimited (2 billion). Typically, more than 18 million calls per minute can be simulated. Three types of nodes are supported: Non Grooming node, Single-Hop Grooming node, and Multi-Hop Full Grooming node. Converter nodes are supported. Four wavelength assignment (WA) algorithms are available: first fit (FF), random (R), most used (MU), and least used (LU). FAR and SPR Routing. Multiple batches can be run in separate simulation runs. The results can be saved to CSV files for easy batch running.

5e054efdfb9bbcb79eec8ed8b21a991d_thumb

Project Spotlight

episoder

A tool to tell you about new episodes of your favourite TV shows.

No-screenshot

Project Spotlight

rGallery

An image gallery Web script.