45 research outputs found

    Architectures and dynamic bandwidth allocation algorithms for next generation optical access networks

    Get PDF

    Dynamic Optical Networks for Data Centres and Media Production

    Get PDF
    This thesis explores all-optical networks for data centres, with a particular focus on network designs for live media production. A design for an all-optical data centre network is presented, with experimental verification of the feasibility of the network data plane. The design uses fast tunable (< 200 ns) lasers and coherent receivers across a passive optical star coupler core, forming a network capable of reaching over 1000 nodes. Experimental transmission of 25 Gb/s data across the network core, with combined wavelength switching and time division multiplexing (WS-TDM), is demonstrated. Enhancements to laser tuning time via current pre-emphasis are discussed, including experimental demonstration of fast wavelength switching (< 35 ns) of a single laser between all combinations of 96 wavelengths spaced at 50 GHz over a range wider than the optical C-band. Methods of increasing the overall network throughput by using a higher complexity modulation format are also described, along with designs for line codes to enable pulse amplitude modulation across the WS-TDM network core. The construction of an optical star coupler network core is investigated, by evaluating methods of constructing large star couplers from smaller optical coupler components. By using optical circuit switches to rearrange star coupler connectivity, the network can be partitioned, creating independent reserves of bandwidth and resulting in increased overall network throughput. Several topologies for constructing a star from optical couplers are compared, and algorithms for optimum construction methods are presented. All of the designs target strict criteria for the flexible and dynamic creation of multicast groups, which will enable future live media production workflows in data centres. The data throughput performance of the network designs is simulated under synthetic and practical media production traffic scenarios, showing improved throughput when reconfigurable star couplers are used compared to a single large star. An energy consumption evaluation shows reduced network power consumption compared to incumbent and other proposed data centre network technologies

    Multichannel optical access networks : design and resource management

    Get PDF
    At present there is a strong worldwide push towards bringing fiber closer to individual homes and businesses. The next evolutionary step is the cost-effective all-optical integration of fiber-based access and metro networks. STARGATE [1] is an all-optical access-metro architecture which does not rely on costly active devices, e.g., Optical Cross-Connects (OXCs) or Fixed Wavelength Converters (FWCs), and allow low-cost PON technologies to follow low-cost Ethernet technologies from EPON access into metro networks, resulting in significantly reduced cost and complexity. It makes use of an overlay island of transparency with optical bypassing capabilities. In this thesis we first propose Optical Network Unit (ONU) architectures, and discuss several technical challenges, which allow STARGATE EPONs (SG-EPONs) to evolve in a pay-as-you-grow manner while providing backward compatibility with legacy infrastructure and protecting previous investment. Second, and considering all the hardware constraints, we present the corresponding dynamic bandwidth allocation algorithm for effective resource management in these networks and investigate their performances (delay, throughput) through simulation experiments. We further investigate the problem of transmission grant scheduling in multichannel optical access networks using a scheduling theoretic approach. We show that the problem can be modeled as an Open Shop and we formulate the joint scheduling and wavelength assignment problem as a Mixed Integer Linear Program (MJLP) whose objective is to reduce the length of a scheduling period. Since the problem is known to be NP-hard, we introduce a Tabu Search based heuristic for solving the joint problem. Different other heuristics are also considered and their performances are compared with those of Tabu and MILP. Results indicate that by appropriately scheduling transmission grants and assigning wavelengths, substantial and consistent improvements may be obtained in the network performance. For example, Tabu shows a reduction of up to 29% in the schedule length with substantial reduction in channel idle gaps yielding to both higher channel utilization and lower queuing delays. Additionally, when the number of channels in the network is not small, the benefits of performing appropriate wavelength assignment, together with transmission scheduling, are observed and discussed. We further perform a packet-level simulation on the considered network to study the benefits of efficient grant scheduling; significant improvements are shown both in terms of system utilization and packet queuing delays

    Bandwith allocation and scheduling in photonic networks

    Get PDF
    This thesis describes a framework for bandwidth allocation and scheduling in the Agile All-Photonic Network (AAPN). This framework is also applicable to any single-hop communication network with significant signalling delay (such as satellite-TDMA systems). Slot-by-slot scheduling approaches do not provide adequate performance for wide-area networks, so we focus on frame-based scheduling. We propose three novel fixed-length frame scheduling algorithms (Minimum Cost Search, Fair Matching and Minimum Rejection) and a feedback control system for stabilization.MCS is a greedy algorithm, which allocates time-slots sequentially using a cost function. This function is defined such that the time-slots with higher blocking probability are assigned first. MCS does not guarantee 100% throughput, thought it has a low blocking percentage. Our optimum scheduling approach is based on modifying the demand matrix such that the network resources are fully utilized, while the requests are optimally served. The Fair Matching Algorithm (FMA) uses the weighted max-min fairness criterion to achieve a fair share of resources amongst the connections in the network. When rejection is inevitable, FMA selects rejections such that the maximum percentage rejection experienced in the network is minimized. In another approach we formulate the rejection task as an optimization problem and propose the Minimum Rejection Algorithm (MRA), which minimizes total rejection. The minimum rejection problem is a special case of maximum flow problem. Due to the complexity of the algorithms that solve the max-flow problem we propose a heuristic algorithm with lower complexity.Scheduling in wide-area networks must be based on predictions of traffic demand and the resultant errors can lead to instability and unfairness. We design a feedback control system based on Smith's principle, which removes the destabilizing delays from the feedback loop by using a "loop cancelation" technique. The feedback control system we propose reduces the effect of prediction errors, increasing the speed of the response to sudden changes in traffic arrival rates and improving the fairness in the network through equalization of queue-lengths

    Digital signal processing optical receivers for the mitigation of physical layer impairments in dynamic optical networks

    Get PDF
    IT IS generally believed by the research community that the introduction of complex network functions—such as routing—in the optical domain will allow a better network utilisation, lower cost and footprint, and a more efficiency in energy usage. The new optical components and sub-systems intended for dynamic optical networking introduce new kinds of physical layer impairments in the optical signal, and it is of paramount importance to overcome this problem if dynamic optical networks should become a reality. Thus, the aim of this thesis was to first identify and characterise the physical layer impairments of dynamic optical networks, and then digital signal processing techniques were developed to mitigate them. The initial focus of this work was the design and characterisation of digital optical receivers for dynamic core optical networks. Digital receiver techniques allow for complex algorithms to be implemented in the digital domain, which usually outperform their analogue counterparts in performance and flexibility. An AC-coupled digital receiver for core networks—consisting of a standard PIN photodiode and a digitiser that takes samples at twice the Nyquist rate—was characterised in terms of both bit-error rate and packet-error rate, and it is shown that the packet-error rate can be optimised by appropriately setting the preamble length. Also, a realistic model of a digital receiver that includes the quantisation impairments was developed. Finally, the influence of the network load and the traffic sparsity on the packet-error rate performance of the receiver was investigated. Digital receiver technologies can be equally applied to optical access networks, which share many traits with dynamic core networks. A dual-rate digital receiver, capable of detecting optical packets at 10 and 1.25 Gb/s, was developed and characterised. The receiver dynamic range was extended by means of DC-coupling and non-linear signal clipping, and it is shown that the receiver performance is limited by digitiser noise for low received power and non-linear clipping for high received power

    Telecommunication Systems

    Get PDF
    This book is based on both industrial and academic research efforts in which a number of recent advancements and rare insights into telecommunication systems are well presented. The volume is organized into four parts: "Telecommunication Protocol, Optimization, and Security Frameworks", "Next-Generation Optical Access Technologies", "Convergence of Wireless-Optical Networks" and "Advanced Relay and Antenna Systems for Smart Networks." Chapters within these parts are self-contained and cross-referenced to facilitate further study
    corecore