Abstract: Wavelength Division Multiplexing (WDM)
technology is the most promising technology for the proper
utilization of huge raw bandwidth provided by an optical fiber. One
of the key problems in implementing the all-optical WDM network is
the packet contention. This problem can be solved by several
different techniques. In time domain approach the packet contention
can be reduced by incorporating Fiber Delay Lines (FDLs) as optical
buffer in the switch architecture. Different types of buffering
architectures are reported in literatures. In the present paper a
comparative performance analysis of three most popular FDL
architectures are presented in order to obtain the best contention
resolution performance. The analysis is further extended to consider
the effect of different fiber non-linearities on the network
performance.
Abstract: Wavelength Division Multiplexing (WDM) is the dominant transport technology used in numerous high capacity backbone networks, based on optical infrastructures. Given the importance of costs (CapEx and OpEx) associated to these networks, resource management is becoming increasingly important, especially how the optical circuits, called “lightpaths”, are routed throughout the network. This requires the use of efficient algorithms which provide routing strategies with the lowest cost. We focus on the lightpath routing and wavelength assignment problem, known as the RWA problem, while optimizing wavelength fragmentation over the network. Wavelength fragmentation poses a serious challenge for network operators since it leads to the misuse of the wavelength spectrum, and then to the refusal of new lightpath requests. In this paper, we first establish a new Integer Linear Program (ILP) for the problem based on a node-link formulation. This formulation is based on a multilayer approach where the original network is decomposed into several network layers, each corresponding to a wavelength. Furthermore, we propose an efficient heuristic for the problem based on a greedy algorithm followed by a post-treatment procedure. The obtained results show that the optimal solution is often reached. We also compare our results with those of other RWA heuristic methods
Abstract: For several high speed networks, providing resilience against failures is an essential requirement. The main feature for designing next generation optical networks is protecting and restoring high capacity WDM networks from the failures. Quick detection, identification and restoration make networks more strong and consistent even though the failures cannot be avoided. Hence, it is necessary to develop fast, efficient and dependable fault localization or detection mechanisms. In this paper we propose a new fault localization algorithm for WDM networks which can identify the location of a failure on a failed lightpath. Our algorithm detects the failed connection and then attempts to reroute data stream through an alternate path. In addition to this, we develop an algorithm to analyze the information of the alarms generated by the components of an optical network, in the presence of a fault. It uses the alarm correlation in order to reduce the list of suspected components shown to the network operators. By our simulation results, we show that our proposed algorithms achieve less blocking probability and delay while getting higher throughput.
Abstract: Tanzania is a developing country, which significantly lags behind the rest of the world in information communications technology (ICT), especially for the Internet. Internet connectivity to the rest of the world is via expensive satellite links, thus leaving the majority of the population unable to access the Internet due to the high cost. This paper introduces the concept of an optical WDM network for Internet infrastructure in Tanzania, so as to reduce Internet connection costs, and provide Internet access to the majority of people who live in both urban and rural areas. We also present a proposed optical WDM network, which mitigates the effects of system impairments, and provide simulation results to show that the data is successfully transmitted over a longer distance using a WDM network.
Abstract: This paper presents a new heuristic algorithm useful
for long-term planning of survivable WDM networks. A multi-period
model is formulated that combines network topology design and
capacity expansion. The ability to determine network expansion
schedules of this type becomes increasingly important to the
telecommunications industry and to its customers. The solution
technique consists of a Genetic Algorithm that allows generating
several network alternatives for each time period simultaneously and
shortest-path techniques to deduce from these alternatives a least-cost
network expansion plan over all time periods. The multi-period
planning approach is illustrated on a realistic network example.
Extensive simulations on a wide range of problem instances are
carried out to assess the cost savings that can be expected by
choosing a multi-period planning approach instead of an iterative
network expansion design method.