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

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

Resilient optical multicasting utilizing cycles in WDM optical networks

High capacity telecommunications of today is possible only because of the presence of optical networks. At the heart of an optical network is an optical fiber whose data carrying capabilities are unparalleled. Multicasting is a form of communication in wavelength division multiplexed (WDM) networks that involves one source and multiple destinations. Light trees, which employ light splitting at various nodes, are used to deliver data to multiple destinations. A fiber cut has been estimated to occur, on an average, once every four days by TEN, a pan-European carrier network. This thesis presents algorithms to make multicast sessions survivable against component failures. We consider multiple link failures and node failures in this work. The two algorithms presented in this thesis use a hybrid approach which is a combination of proactive and reactive approaches to recover from failures. We introduce the novel concept of minimal-hop cycles to tolerate simultaneous multiple link failures in a multicast session. While the first algorithm deals only with multiple link failures, the second algorithm considers the case of node failure and a link failure. Two different versions of the first algorithm have been implemented to thoroughly understand its behavior. Both algorithms were studied through simulators on two different networks, the USA Longhaul network and the NSF network. The input multicast sessions to all our algorithms were generated from power efficient multicast algorithms that make sure the power in the receiving nodes are at acceptable levels. The parameters used to evaluate the performance of our algorithms include computation times, network usage and power efficiency. Two new parameters, namely, recovery times and recovery success probability, have been introduced in this work. To our knowledge, this work is the first to introduce the concept of minimal hop cycles to recover from simultaneous multiple link failures in a multicast session in optical networks

Multicast Routing In Optical Access Networks

Widely available broadband services in the Internet require high capacity access networks. Only optical networking is able to efficiently provide the huge bandwidth required by multimedia applications. Distributed applications such as Video-Conferencing, HDTV, VOD and Distance Learning are increasingly common and produce a large amount of data traffic, typically between several terminals. Multicast is a bandwidth-efficient technique for one-to-many or many-to-many communications, and will be indispensable for serving multimedia applications in future optical access networks. These applications require robust and reliable connections as well as the satisfaction of QoS criteria. In this chapter, several access network architectures and related multicast routing methods are analyzed. Overall network performance and dependability are the focus of our analysis

Towards Scalable Cost-Effective Service and Survivability Provisioning in Ultra High Speed Networks

Optical transport networks based on wavelength division multiplexing (WDM) are considered to be the most appropriate choice for future Internet backbone. On the other hand, future DOE networks are expected to have the ability to dynamically provision on-demand survivable services to suit the needs of various high performance scientific applications and remote collaboration. Since a failure in aWDMnetwork such as a cable cut may result in a tremendous amount of data loss, efficient protection of data transport in WDM networks is therefore essential. As the backbone network is moving towards GMPLS/WDM optical networks, the unique requirement to support DOE’s science mission results in challenging issues that are not directly addressed by existing networking techniques and methodologies. The objectives of this project were to develop cost effective protection and restoration mechanisms based on dedicated path, shared path, preconfigured cycle (p-cycle), and so on, to deal with single failure, dual failure, and shared risk link group (SRLG) failure, under different traffic and resource requirement models; to devise efficient service provisioning algorithms that deal with application specific network resource requirements for both unicast and multicast; to study various aspects of traffic grooming in WDM ring and mesh networks to derive cost effective solutions while meeting application resource and QoS requirements; to design various diverse routing and multi-constrained routing algorithms, considering different traffic models and failure models, for protection and restoration, as well as for service provisioning; to propose and study new optical burst switched architectures and mechanisms for effectively supporting dynamic services; and to integrate research with graduate and undergraduate education. All objectives have been successfully met. This report summarizes the major accomplishments of this project. The impact of the project manifests in many aspects: First, the project addressed many essential problems that arisen in current and future WDM optical networks, and provided a host of innovative solutions though there was no invention or patent filing. This project resulted in more than 2 dozens publications in major journals and conferences (including papers in IEEE Transactions and journals, as well as a book chapter). Our publications have been cited by many peer researchers. In particular, one of our conference papers was nominated for the best paper award of IEEE/Create-Net Broadnets (International Conference on Broadband Communications, Networks, and Systems) 2006. Second, the results and solutions of this project were well received by DOE Labs where presentations were given by the PI. We hope to continue the collaboration with DOE Labs in the future. Third, the project was the first to propose and extensively study multicast traffic grooming, new traffic models such as sliding scheduled traffic model and scheduled traffic model. Our research has sparkled a flurry of recent studies and publications by the research community in these areas. Fourth, the project has benefited a diverse population of students by motivating, engaging, enhancing their learning and skills. The project has been conducted in a manner conducive to the training of students both at graduate and undergraduate levels. As a result, one Ph.D., Dr. Abdur Billah, was graduated. Another Ph.D. student, Tianjian Li, will graduate in January 2007. In addition, four MS students were graduated. One undergraduate student, Jeffrey Alan Shininger, completed his university honors project. Fifth, thanks to the support of this ECPI project, the PI has obtained additional funding from the National Science Foundation, the Air Force Research Lab, and other sources. A few other proposals are pending. Finally, this project has also significantly impacted the curricula and resulted in the enhancement of courses at the graduate and undergraduate levels, therefore strengthening the bond between research and education

A new proposal of an efficient algorithm for routing and wavelength assignment in optical networks.

The routing and wavelength assignment (RWA) algorithms used in optical networks are critical to achieve good network performance. However, despite several previous studies to optimize the RWA, which is classified as an NP-Hard, it seems that there is not, a priori, any solution that would lead to standardization of this process. This article presents the proposed RWA algorithm based on a Generic Objective Function (GOF) which aims to establish a base from which it is possible to develop a standard or multiple standards for optical networks. The GOF algorithm introduces the concept of implicit constraint, which guarantees a simple solution to a problem not as trivial as the RWA

Optical control plane: theory and algorithms

In this thesis we propose a novel way to achieve global network information dissemination in which some wavelengths are reserved exclusively for global control information exchange. We study the routing and wavelength assignment problem for the special communication pattern of non-blocking all-to-all broadcast in WDM optical networks. We provide efficient solutions to reduce the number of wavelengths needed for non-blocking all-to-all broadcast, in the absence of wavelength converters, for network information dissemination. We adopt an approach in which we consider all nodes to be tap-and-continue capable thus studying lighttrees rather than lightpaths. To the best of our knowledge, this thesis is the first to consider “tap-and-continue” capable nodes in the context of conflict-free all-to-all broadcast. The problem of all to-all broadcast using individual lightpaths has been proven to be an NP-complete problem [6]. We provide optimal RWA solutions for conflict-free all-to-all broadcast for some particular cases of regular topologies, namely the ring, the torus and the hypercube. We make an important contribution on hypercube decomposition into edge-disjoint structures. We also present near-optimal polynomial-time solutions for the general case of arbitrary topologies. Furthermore, we apply for the first time the “cactus” representation of all minimum edge-cuts of graphs with arbitrary topologies to the problem of all-to-all broadcast in optical networks. Using this representation recursively we obtain near-optimal results for the number of wavelengths needed by the non-blocking all-to-all broadcast. The second part of this thesis focuses on the more practical case of multi-hop RWA for non- blocking all-to-all broadcast in the presence of Optical-Electrical-Optical conversion. We propose two simple but efficient multi-hop RWA models. In addition to reducing the number of wavelengths we also concentrate on reducing the number of optical receivers, another important optical resource. We analyze these models on the ring and the hypercube, as special cases of regular topologies. Lastly, we develop a good upper-bound on the number of wavelengths in the case of non-blocking multi-hop all-to-all broadcast on networks with arbitrary topologies and offer a heuristic algorithm to achieve it. We propose a novel network partitioning method based on “virtual perfect matching” for use in the RWA heuristic algorithm

All Optical Signal Processing Technologies in Optical Fiber Communication

Due to continued growth of internet at starling rate and the introduction of new broadband services, such as cloud computing, IPTV and high-definition media streaming, there is a requirement for flexible bandwidth infrastructure that supports mobility of data at peta-scale. Elastic networking based on gridless spectrum technology is evolving as a favorable solution for the flexible optical networking supportive next generation traffic requirements. Recently, research is centered on a more elastic spectrum provision methodology than the traditional ITU-T grid. The main issue is the requirement for a transmission connect, capable of accommodating and handling a variety of signals with distinct modulation format, baud rate and spectral occupancy. Segmented use of the spectrum could lead to the shortage of availableness of sufficiently extensive spectrum spaces for high bitrate channels, resulting in wavelength contention. On-demand space assignment creates not only deviation from the ideal course but also have spectrum fragmentation, which reduces spectrum resource utilization. This chapter reviewed the recent research development of feasible solutions for the efficient transport of heterogeneous traffic by enhancing the flexibility of the optical layer for performing allocation of network resources as well as implementation of optical node by all optical signal processing in optical fiber communication

Survivable multicasting in WDM optical networks

Opportunities abound in the global content delivery service market and it is here that multicasting is proving to be a powerful feature. In WDM networks, optical splitting is widely used to achieve multicasting. It removes the complications of optical-electronic-optical conversions [1]. Several multicasting algorithms have been proposed in the literature for building light trees. As the amount of fiber deployment increases in networks, the risk of losing large volumes of data traffic due to a fiber span cut or due to node failure also increases. In this thesis we propose heuristic schemes to make the primary multicast trees resilient to network impairments. We consider single link failures only, as they are the most common cause of service disruptions. Thus our heuristics make the primary multicast session survivable against single link failures by offering alternate multicast trees. We propose three algorithms for recovering from the failures with proactive methodologies and two algorithms for recovering from failures by reactive methodologies. We introduce the new and novel concept of critical subtree. Through our new approach the proactive and reactive approaches can be amalgamated together using a criticality threshold to provide recovery to the primary multicast tree. By varying the criticality threshold we can control the amount of protection and reaction that will be used for recovery. The performance of these five algorithms is studied in combinations and in standalone modes. The input multicast trees to all of these recovery heuristics come from a previous work on designing power efficient multicast algorithms for WDM optical networks [1]. Measurement of the power levels at receiving nodes is indeed indicative of the power efficiency of these recovery algorithms. Other parameters that are considered for the evaluation of the algorithms are network usage efficiency, (number of links used by the backup paths) and the computation time for calculating these backup paths. This work is the first to propose metrics for evaluating recovery algorithms for multicasting in WDM optical networks. It is also the first to introduce the concept of hybrid proactive and reactive approach and to propose a simple technique for achieving the proper mix

High-Performance and Wavelength-Reused Optical Network on Chip (ONoC) Architectures and Communication Schemes for Manycore Processor

Optical Network on Chip (ONoC) is an emerging chip-scale optical interconnection technology to realize the high-performance and power-efficient inter-core communication for many-core processors. By utilizing the silicon photonic interconnects to transmit data packets with optical signals, it can achieve ultra low communication delay, high bandwidth capacity, and low power dissipation. With the benefits of Wavelength Division Multiplexing (WDM), multiple optical signals can simultaneously be transmitted in the same optical interconnect through different wavelengths. Thus, the WDM-based ONoC is becoming a hot research topic recently. However, the maximal number of available wavelengths is restricted for the reliable and power-efficient optical communication in ONoC. Hence, with a limited number of wavelengths, the design of high-performance and power-efficient ONoC architecture is an important and challenging problem. In this thesis, the design methodology of wavelength-reused ONoC architecture is explored. With the wavelength reuse scheme in optical routing paths, high-performance and power-efficient communication is realized for many-core processors only using a small number of available wavelengths. Three wavelength-reused ONoC architectures and communication schemes are proposed to fulfil different communication requirements, i.e., network scalability, multicast communication, and dark silicon. Firstly, WRH-ONoC, a wavelength-reused hierarchical Optical Network on Chip architecture, is proposed to achieve high network scalability, namely obtaining low communication delay and high throughput capacity for hundreds of thousands of cores by reusing the limited number of available wavelengths with the modest hardware cost and energy overhead. WRH-ONoC combines the advantages of non-blocking communication in each lambda-router and wavelength reuse in all lambda-routers through the hierarchical networking. Both theoretical analysis and simulation results indicate that WRH-ONoC can achieve prominent improvement on the communication performance and scalability (e.g., 46.0% of reduction on the zero-load packet delay and 72.7% of improvement on the network throughput for 400 cores with small hardware cost and energy overhead) in comparison with existing schemes. Secondly, DWRMR, a dynamical wavelength-reused multicast scheme based on the optical multicast ring, is proposed for widely existing multicast communications in many-core processors. In DWRMR, an optical multicast ring is dynamically constructed for each multicast group and the multicast packets are transmitted in a single-send-multi-receive manner requiring only one wavelength. All the cores in the same multicast group can reuse the established multicast ring through an optical token arbitration scheme for the interactive multicast communications, thereby avoiding the frequent construction of multicast routing paths dedicatedly for each core. Simulation results indicate that DWRMR can reduce more than 50% of end-to-end packet delay with slight hardware cost, or require only half number of wavelengths to achieve the same performance compared with existing schemes. Thirdly, Dark-ONoC, a dynamically configurable ONoC architecture, is proposed for the many-core processor with dark silicon. Dark silicon is an inevitable phenomenon that only a small number of cores can be activated simultaneously while the other cores must stay in dark state (power-gated) due to the restricted power budget. Dark-ONoC periodically allocates non-blocking optical routing paths only between the active cores with as less wavelengths as possible. Thus, it can obtain high-performance communication and low power consumption at the same time. Extensive simulations are conducted with the dark silicon patterns from both synthetic distribution and real data traces. The simulation results indicate that the number of wavelengths is reduced by around 15% and the overall power consumption is reduced by 23.4% compared to existing schemes. Finally, this thesis concludes several important principles on the design of wavelength-reused ONoC architecture, and summarizes some perspective issues for the future research