Bidirectional between Nodes in MATPLAN WDM Make a Big Impact in Efficiently

Optical network are being deployed on internet backbones paving the way for the next generation high speed Internet. Technology in the internet architecture brings in new challenges and performance issue. In this research we try to gain and overview of optical networks planning using MATPLAN WDM. Previously many of virtual topology has been done. For example our previous literature reviews about the MATLAB. This tool is help in networking field but MATLAB have their own weakness in designing new algorithm. We review the main research paper for optical networking with particular focus on all packet switching. Packet switching networking is a communications method in digital form that groups all transmitted data including of content, type, or structure called packets. Packet switching features delivery of variable-bit-rate data streams (sequences of packets) over a shared network. When traversing network adapters, switches, routers and other network nodes, packets are buffered and queued, resulting in variable delay and throughput depending on the traffic load in the network. We then try to create new topology using Matplan WDM to improve the network perfomance. In the end of this research we try to come out with an new topology that will solve this existing problem in the WDM

Multimedia Traffic Routing in Multilayer WDM Networks

The advent of real-time multimedia services over the Internet has stimulated new technologies for expanding the information carrying capacity of optical network backbones. Multilayer wavelength division multiplexing (WDM) packet switching is an emerging technology for increasing the bandwidth of optical networks. Two algorithms for the routing of the multimedia traffic flows were applied: (i) Capacitated Shortest Path First (CSPF) routing, which minimizes the distance of each flow linking the given source and destination nodes and satisfying capacity constraints; and (ii) Flow Deviation Algorithm (FDA) routing, which minimizes the network-wide average packet delay.Comment: 10 pages, 8 figure

A parallel iterative scheduler for asynchronous Optical Packet Switching networks

This paper presents PI-OPS (Parallel-Iterative Optical Packet Scheduler) a parallel-iterative scheduler for asynchronous Optical Packet Switching nodes with optical buffering. Optical packets are assembled by aggregating IP packets, and attaching an optical packet header. Conventional schemes process optical packet headers one by one, in a sequential form. Then, worst case algorithm response time is tightly coupled to switch size. In contrast, in PI-OPS all the optical packets received during a given time window are jointly processed to optimize the delay and output wavelength allocation, applying void filling techniques. The scheduler has a deterministic response time, independent of the traffic arrivals pattern. In addition, PI-OPS has been specifically designed to allow a parallel electronic implementation similar to the ones found in VOQ schedulers. In this respect, we evaluate the traffic loss performance of the scheduler in different settings, to dimension a set of hardware related parameters. Finally, we conduct an emulation of an FPGA implementation of a large-scale version of the scheduler. Results support the feasibility of its implementation