234 research outputs found

    All optical multicasting in wavelength routing mesh networks with power considerations: design and operation

    Get PDF
    Wavelength routing Wavelength Division Multiplexing (WDM) are optical networks that support all-optical services. They have become the most appealing candidate for wide area backbone networks. Their huge available bandwidth provides the solution for the exponential growth in trayc demands that is due to the increase in the number of users and the surge of more bandwidth intensive network applications and services. A sizable fraction of these applications and services are of multi-point nature. Therefore, supporting multicast service in this network environment is very critical and unique. The all-optical support of various services has advantages, which includes achieving the signal transparency to its content. Nevertheless, the all-optical operational support comes with an associated cost and new issues that make this problem very challenging. In this thesis, we investigate the power-related issues for supporting multicast service in the optical domain, referred to as All-Optical Multicasting (AOM). Our study treats these issues from two networking contexts, namely, Network Provisioning and Connection Provisioning. We propose a number of optimal and heuristic solutions with a unique objective function for each context. In this regard, the objective function for the network provisioning problem is to reduce the network cost, while the solutions for the connection provisioning problem aim to reduce the connection blocking ratio. The optimal formulations are inherently non-linear. However, we introduce novel methods for linearizing them and formulate the problems as Mixed Integer Linear Programs. Also, the design of the heuristic solutions takes into account various optimization factors which results in efficient heuristics that can produce fast solutions that are relatively close to their optimal counterparts, as shown in the numerical results we present

    Optimal multicast routing using genetic algorithm for WDM optical networks

    Get PDF
    We consider the multicast routing problem for large-scale wavelength division multiplexing (WDM) optical networks where transmission re-quests are established by point-to-multipoint connections. To realize multicast routing in WDM optical networks, some nodes need to havelight (optical) splitting capability. A node with splitting capability can forward an incoming message to more than one output link. We con-sider the problem of minimizing the number of split-capable nodes in the network for a given set of multicast requests. The maximum number of wavelengths that can be used is specified a priori. A genetic algorithm is proposed that exploits the combination of alternative shortest paths for the given multicast requests. This algorithm is examined for two realis-tic networks constructed based on the locations of major cities in Ibaraki Prefecture and those in Kanto District in Japan. Our experimental re-sults show that the proposed algorithm can reduce more than 10% of split-capable nodes compared with the case where the split-capable node placement optimization is not performed while the specified number of wavelengths is not exceeded.Includes bibliographical reference

    QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms

    Get PDF
    Copyright @ Elsevier Ltd. All rights reserved.In this paper, two bio-inspired Quality of Service (QoS) multicast algorithms are proposed in IP over dense wavelength division multiplexing (DWDM) optical Internet. Given a QoS multicast request and the delay interval required by the application, both algorithms are able to find a flexible QoS-based cost suboptimal routing tree. They first construct the multicast trees based on ant colony optimization and artificial immune algorithm, respectively. Then a dedicated wavelength assignment algorithm is proposed to assign wavelengths to the trees aiming to minimize the delay of the wavelength conversion. In both algorithms, multicast routing and wavelength assignment are integrated into a single process. Therefore, they can find the multicast trees on which the least wavelength conversion delay is achieved. Load balance is also considered in both algorithms. Simulation results show that these two bio-inspired algorithms can construct high performance QoS routing trees for multicast applications in IP/DWDM optical Internet.This work was supported in part ny the Program for New Century Excellent Talents in University, the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1, the National Natural Science Foundation of China under Grant no. 60673159 and 70671020, the National High-Tech Reasearch and Development Plan of China under Grant no. 2007AA041201, and the Specialized Research Fund for the Doctoral Program of Higher Education under Grant no. 20070145017

    IP multicast over WDM networks

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    Multicast routing from a set of data centers in elastic optical networks

    Get PDF
    This paper introduces the Multi-Server Multicast (MSM) approach for Content Delivery Networks (CDNs) delivering services offered by a set of Data Centers (DCs). All DCs offer the same services. The network is an Elastic Optical Network (EON) and for a good performance, routing is performed directly at the optical layer. Optical switches have heterogeneous capacities, that is, light splitting is not available in all switches. Moreover, frequency slot conversion is not possible in any of them. We account for the degradation that optical signals suffer both in the splitting nodes, as well as across fiber links to compute their transmission reach. The optimal solution of the MSM is a set of light-hierarchies. This multicast route contains a light trail from one of the DCs to each of the destinations with respect to the optical constraints while optimizing an objective (e.g., minimizing a function). Finding such a structure is often an NP-hard problem. The light-hierarchies initiated from different DCs permit delivering the multicast session to all end-users with a better utilization of the optical resources, while also reducing multicast session latencies, as contents can be delivered from such DCs closer to end-users. We propose an Integer Linear Programming (ILP) formulation to optimally decide on which light-hierarchies should be setup. Simulation results illustrate the benefits of MSM in two reference backbone networks.Peer ReviewedPostprint (author's final draft

    Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks

    Get PDF
    International audienceIn sparse light splitting all-optical WDM networks, the more destinations a light-tree can accommodate, the fewer light-trees andwavelengths amulticast session will require. In this article, a Hypo-Steiner light-tree algorithm (HSLT) is proposed to construct a HSLT light-tree to include as many destinations as possible. The upper bound cost of the light-trees built by HSLT is given as N(N −1)/2, where N is the number of nodes in the network. The analytical model proves that, under the same condition, more destinations could be held in a HSLT than a Member-Only (Zhang et al., J. Lightware Technol, 18(12), 1917–1927 2000.) light-tree. Extensive simulations not only validate the proof but also show that the proposed heuristic outperforms the existing multicast routing algorithms by a large margin in terms of link stress, throughput, and efficiency ofwavelength usage

    Multicast protection and energy efficient traffic grooming in optical wavelength routing networks.

    Get PDF
    Zhang, Shuqiang.Thesis (M.Phil.)--Chinese University of Hong Kong, 2010.Includes bibliographical references (p. 74-80).Abstracts in English and Chinese.Abstract --- p.i摘要 --- p.ivAcknowledgements --- p.vTable of Contents --- p.viChapter Chapter 1 --- Background --- p.1Chapter 1.1 --- Routing and Wavelength Assignment --- p.1Chapter 1.2 --- Survivability in Optical Networks --- p.3Chapter 1.3 --- Optical Multicasting --- p.4Chapter 1.3.1 --- Routing and Wavelength Assignment of Optical Multicast --- p.5Chapter 1.3.2 --- Current Research Topics about Optical Multicast --- p.8Chapter 1.4 --- Traffic Grooming --- p.10Chapter 1.4.1 --- Static Traffic Grooming --- p.11Chapter 1.4.2 --- Dynamic Traffic Grooming --- p.13Chapter 1.5 --- Contributions --- p.15Chapter 1.5.1 --- Multicast Protection with Scheduled Traffic Model --- p.15Chapter 1.5.2 --- Energy Efficient Time-Aware Traffic Grooming --- p.16Chapter 1.6 --- Organization of Thesis --- p.18Chapter Chapter 2 --- Multicast Protection in WDM Optical Network with Scheduled Traffic --- p.19Chapter 2.1 --- Introduction --- p.19Chapter 2.2 --- Multicast Protection under FSTM --- p.22Chapter 2.3 --- Illustrative Examples --- p.28Chapter 2.4 --- Two-Step Optimization under SSTM --- p.37Chapter 2.5 --- Summary --- p.40Chapter Chapter 3 --- Energy Efficient Time-Aware Traffic Grooming in Wavelength Routing Networks --- p.41Chapter 3.1 --- Introduction --- p.41Chapter 3.2 --- Energy consumption model --- p.43Chapter 3.3 --- Static Traffic Grooming with Time awareness --- p.44Chapter 3.3.1 --- Scheduled Traffic Model for Traffic Grooming --- p.44Chapter 3.3.2 --- ILP Formulation --- p.44Chapter 3.3.3 --- Illustrative Numerical Example --- p.48Chapter 3.4 --- Dynamic Traffic Grooming with Time Awareness --- p.49Chapter 3.4.1 --- Time-Aware Traffic Grooming (TATG) --- p.51Chapter 3.5 --- Simulation Results of Dynamic Traffic Grooming --- p.54Chapter 3.5.1 --- 24-node USNET: --- p.55Chapter 3.5.2 --- 15-node Pacific Bell Network: --- p.59Chapter 3.5.3 --- 14-node NSFNET: --- p.63Chapter 3.5.4 --- Alternative Configuration of Simulation Parameters: --- p.67Chapter 3.6 --- Summary --- p.71Chapter Chapter 4 --- Conclusions and Future Work --- p.72Chapter 4.1 --- Conclusions --- p.72Chapter 4.2 --- Future Work --- p.73Bibliography --- p.74Publications during M.Phil Study --- p.8

    Design and provisioning of WDM networks for traffic grooming

    Get PDF
    Wavelength Division Multiplexing (WDM) is the most viable technique for utilizing the enormous amounts of bandwidth inherently available in optical fibers. However, the bandwidth offered by a single wavelength in WDM networks is on the order of tens of Gigabits per second, while most of the applications\u27 bandwidth requirements are still subwavelength. Therefore, cost-effective design and provisioning of WDM networks require that traffic from different sessions share bandwidth of a single wavelength by employing electronic multiplexing at higher layers. This is known as traffic grooming. Optical networks supporting traffic grooming are usually designed in a way such that the cost of the higher layer equipment used to support a given traffic matrix is reduced. In this thesis, we propose a number of optimal and heuristic solutions for the design and provisioning of optical networks for traffic grooming with an objective of network cost reduction. In doing so, we address several practical issues. Specifically, we address the design and provisioning of WDM networks on unidirectional and bidirectional rings for arbitrary unicast traffic grooming, and on mesh topologies for arbitrary multipoint traffic grooming. In multipoint traffic grooming, we address both multicast and many-to-one traffic grooming problems. We provide a unified frame work for optimal and approximate network dimensioning and channel provisioning for the generic multicast traffic grooming problem, as well as some variants of the problem. For many-to-one traffic grooming we propose optimal as well as heuristic solutions. Optimal formulations which are inherently non-linear are mapped to an optimal linear formulation. In the heuristic solutions, we employ different problem specific search strategies to explore the solution space. We provide a number of experimental results to show the efficacy of our proposed techniques for the traffic grooming problem in WDM networks
    corecore