Conference Proceeding

An educational RWA network planning tool for dynamic flows

Univ. Politec. de Cartagena, Cartagena
International Federation for Information Processing Digital Library; Optical Network Design and Modelling (ONDM 2008); 04/2008; DOI:10.1109/ONDM.2008.4578387 ISBN: 978-3-901882-27-2 In proceeding of: Optical Network Design and Modeling, 2008. ONDM 2008. International Conference on
Source: OAI

ABSTRACT This paper presents the Dyn-MatPlanWDM tool, an educational network planning tool for wavelength-routing WDM networks. The tool considers the on-line or dynamic network operation. Traffic is composed of higher level traffic connections. The planning algorithms dynamically decide on the virtual topology design and the routing of the flows on top of it. The input parameters to the planning problem are the network physical topology, technological constraints like the number of transmitters, receivers, optical converters, the generator module and the planning module to test. The tool is implemented as a MATLAB toolbox. The set of generators and planning modules included can be easily extended. In particular, a set of libraries are provided to ease the composition of new heuristic algorithms. A graphical user interface is supplied which aids the user to test and trace the network evolution. The GUI is designed to support an educational use of the tool.

0 0
 · 
0 Bookmarks
 · 
100 Views
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: Blocking has been the key performance index in the design of an all-optical network. Existing research demonstrates that an effective routing and wavelength assignment strategy and a proper wavelength converter placement algorithm are the two primary vehicles for improving the blocking performance. However, these two issues have largely been investigated separately in that the existing RWA algorithms have seldom considered the presence of wavelength conversion, while the wavelength converter placement algorithms have largely assumed that a static routing and random wavelength assignment algorithm is employed. The main objective of this article is to present some strong evidence that these two issues need to be considered jointly, and call for the reexamination of both RWA and wavelength converter placement.
    IEEE Communications Magazine 09/2003; · 3.66 Impact Factor
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: The problem of designing a logical topology over a wavelength-routed all-optical network (AON) physical topology is studied. The physical topology consists of the nodes and fiber links in the network. On an AON physical topology, we can set up lightpaths between pairs of nodes, where a lightpath represents a direct optical connection without any intermediate electronics. The set of lightpaths along with the nodes constitutes the logical topology. For a given network physical topology and traffic pattern, our objective is to design the logical topology and the routing algorithm so as to minimize the network congestion while constraining the average delay seen by a source-destination pair and the amount of processing required at the nodes (degree of the logical topology). Ignoring the delay constraints can result in fairly convoluted logical topologies with very long delays. On the other hand, in all our examples, imposing it results in a minimal increase in congestion. While the number of wavelengths required to imbed the resulting logical topology on the physical all optical topology is also a constraint in general, we find that in many cases of interest this number can be quite small. We formulate the combined logical topology design and routing problem described above as a mixed integer linear programming problem which we then solve for a number of cases of a six-node network. This programming problem is split into two subproblems: logical topology design, and routing. We then compare the performance of several heuristic topology design algorithms against that of randomly generated topologies, as well as lower bounds
    IEEE Journal on Selected Areas in Communications 07/1996; · 3.12 Impact Factor
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: Optical dense wavelength division multiplexed (DWDM) networks are an attractive candidate for the next generation Internet and beyond. In this paper, we consider routing and wavelength assignment in a wide area wavelength routed backbone network that employs circuit-switching. When a session request is received by the network, the routing and wavelength assignment (RWA) task is to establish a lightpath between the source and destination. That is, determine a suitable path and assign a set of wavelengths for the links on this path. We consider a link state protocol approach and use Dijkstras shortest path algorithm, suitably modified for DWDM networks, for computing the shortest paths. In [1] we proposed WDM aware weight functions that included factors such as available wavelengths per link, total wavelengths per link. In this paper, we present new weight functions that exploit the strong correlation between blocking probability and number of hops involved in connection setup to increase the performance of the network. We also consider alternate path routing that computes the alternate paths based on WDM aware weight functions. The impact of the weight functions on the blocking probability and delay is studied through discrete event simulation. The system parameters varied include number of network nodes, wavelengths, degree of wavelength conversion, and load. The results show that the weight function that incorporates both hop count and available wavelength provides the best performance in terms of blocking probability.
    Photonic Network Communication 06/2001; 3(3):227-236. · 0.45 Impact Factor

Full-text (3 Sources)

View
1 Download
Available from

P. Pavon-Marino