Analysis and algorithms for partial protection in mesh networks

This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fraction q of each demand remains after any single link failure. A linear program is developed to find the minimum-cost capacity allocation to meet both demand and protection requirements. For q ≤ 1/2, an exact algorithmic solution for the optimal routing and allocation is developed using multiple shortest paths. For q >; 1/2, a heuristic algorithm based on disjoint path routing is developed that performs, on average, within 1.4% of optimal, and runs four orders of magnitude faster than the minimum-cost solution achieved via the linear program. Moreover, the partial protection strategies developed achieve reductions of up to 82% over traditional full protection schemes.National Science Foundation (U.S.) (NSF grant CNS-0626781)National Science Foundation (U.S.) (NSF grant CNS-0830961)United States. Defense Threat Reduction Agency (grant HDTRA1-07-1-0004)United States. Defense Threat Reduction Agency (grant HDTRA-09-1-005)United States. Air Force (Air Force contract #FA8721-05-C-0002

Migration strategies toward all optical metropolitan access rings

This paper was published in Journal of Lightwave Technology and is made available as an electronic reprint with the permission of OSA. The paper can be found at the following URL on the IEEE website: http://dx.doi.org/10.1109/JLT.2007.901325. Systematic or multiple reproduction or distribution to multiple locations via electronic or other means is prohibited and is subject to penalties under law.Nowadays, network operators are steadily deploying optical circuit switching (OCS) equipment in their metropolitan networks in order to cope with traffic increase and, most importantly, in order to reduce capital expenditures and operational expenditures of existing active technologies. On the other hand, optical burst switching (OBS) technology is expected to become mature in the medium term, and it may be used as an alternative to current OCS networks due to its potential advantages in terms of bandwidth allocation granularity. While OBS is being extensively studied in the literature, little attention has been paid in conducting a comparative analysis of OBS versus OCS, especially concerning cost analysis. In this paper, we provide a comparative analysis of OBS versus OCS as an evolutionary technology for all-optical rings in the metropolitan-access network. This paper is specifically targeted toward optimizing the number of optoelectronic receivers and wavelengths with real traffic matrices from the metropolitan rings in Madrid, Spain. Such matrices also include traffic projections of foreseeable broadband services, which are based on a market analysis from the largest operator in Spain. Our findings show that OCS might be more efficient than OBS in the metro-access segment, which is characterized by a highly centralized traffic pattern. However, the more distributed the traffic is, the more efficient the OBS is as well. Consequently, OBS might be better suited to metro-core networks, which show a more distributed and dynamic traffic pattern.The authors would like to thank the e-Photon/ONe+ network of excellenc

On-Line Distributed Traffic Grooming

This paper addresses the problem of on-line traffic grooming in WDM paths. Each request consists of a source node, a destination node, and the desired bandwidth for the connection. Connections may be multi-hop, permitting the use of multiple lightpaths. We describe a new distributed on-line algorithm for this problem that is provably wide-sense non-blocking under cer- tain assumptions. Moreover, we use simulations to demonstrate that the algorithm is extremely effective even when some of these assumptions are relaxed

Virtual Topology Reconfrigation of WDM Optical Network with Minimum Physical Node

This paper review the reconfiguration of high capacity WDM optical Network, messages are carried in all optical form using light paths. The set of semi-permanent light paths which are set up in the network may be viewed as a virtual topology by higher layers such as SONET, ATM and IP. Reconfiguration is to charge in virtual topology to meet traffic pattern in high layers. It provides a trade off between objective value and the no. of changes to the virtual topology. In another study Objective is to design the logical topology & routing Algorithm on physical topology, so as to minimize the net work congestion while constraining the average delay seen by source destination pair and the amount of processing required at the nodes. Failure handling in WDM Networks is of prime importance due to the nature and volume of traffic, these network carry, failure detection is usually achieved by exchanging control messages among nodes with time out mechanism. Newer and more BW thirsty applications emerging on the horizon and WDM is to leveraging the capabilities of the optical fiber Wavelength  routing  is  the  ability  to  switch  a  signal  at intermediate  nodes  in  a  WDM  network  based  on  their wavelength. Virtual topology can be reconfigured when necessary to improve performance. To create the virtual topology different from the physical topology of the underlying network, is the ability of wavelength routing WDM. Keywords: WDM, Physical Topology, Virtual Topology and Reconfiguratio

Traffic engineering in dynamic optical networks

Traffic Engineering (TE) refers to all the techniques a Service Provider employs to improve the efficiency and reliability of network operations. In IP over Optical (IPO) networks, traffic coming from upper layers is carried over the logical topology defined by the set of established lightpaths. Within this framework then, TE techniques allow to optimize the configuration of optical resources with respect to an highly dynamic traffic demand. TE can be performed with two main methods: if the demand is known only in terms of an aggregated traffic matrix, the problem of automatically updating the configuration of an optical network to accommodate traffic changes is called Virtual Topology Reconfiguration (VTR). If instead the traffic demand is known in terms of data-level connection requests with sub-wavelength granularity, arriving dynamically from some source node to any destination node, the problem is called Dynamic Traffic Grooming (DTG). In this dissertation new VTR algorithms for load balancing in optical networks based on Local Search (LS) techniques are presented. The main advantage of using LS is the minimization of network disruption, since the reconfiguration involves only a small part of the network. A comparison between the proposed schemes and the optimal solutions found via an ILP solver shows calculation time savings for comparable results of network congestion. A similar load balancing technique has been applied to alleviate congestion in an MPLS network, based on the efficient rerouting of Label-Switched Paths (LSP) from the most congested links to allow a better usage of network resources. Many algorithms have been developed to deal with DTG in IPO networks, where most of the attention is focused on optimizing the physical resources utilization by considering specific constraints on the optical node architecture, while very few attention has been put so far on the Quality of Service (QoS) guarantees for the carried traffic. In this thesis a novel Traffic Engineering scheme is proposed to guarantee QoS from both the viewpoint of service differentiation and transmission quality. Another contribution in this thesis is a formal framework for the definition of dynamic grooming policies in IPO networks. The framework is then specialized for an overlay architecture, where the control plane of the IP and optical level are separated, and no information is shared between the two. A family of grooming policies based on constraints on the number of hops and on the bandwidth sharing degree at the IP level is defined, and its performance analyzed in both regular and irregular topologies. While most of the literature on DTG problem implicitly considers the grooming of low-speed connections onto optical channels using a TDM approach, the proposed grooming policies are evaluated here by considering a realistic traffic model which consider a Dynamic Statistical Multiplexing (DSM) approach, i.e. a single wavelength channel is shared between multiple IP elastic traffic flows

Research challenges on energy-efficient networking design

The networking research community has started looking into key questions on energy efficiency of communication networks. The European Commission activated under the FP7 the TREND Network of Excellence with the goal of establishing the integration of the EU research community in green networking with a long perspective to consolidate the European leadership in the field. TREND integrates the activities of major European players in networking, including manufacturers, operators, research centers, to quantitatively assess the energy demand of current and future telecom infrastructures, and to design energy-efficient, scalable and sustainable future networks. This paper describes the main results of the TREND research community and concludes with a roadmap describing the next steps for standardization, regulation agencies and research in both academia and industry.The research leading to these results has received funding from the EU 7th Framework Programme (FP7/2007–2013) under Grant Agreement No. 257740 (NoE TREND)

Traffic lifetime-aware routing considering dynamic grooming in WDM networks

Master'sMASTER OF ENGINEERIN

Green optical network design : power optimization of wide area and metropolitan area networks

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.Cataloged from PDF version of thesis.Includes bibliographical references (p. 133-134).Advancements in technology are fueling huge growth in network traffic capacity. Demand for low cost, reliable, and high bitrate transmissions grows 40-110% internationally every year. To date, most research has focused on cost minimization of wide area and metropolitan area networks. In this thesis, we concentrate instead on finding scalable WAN designs with respect to power constraints and optimal MAN topologies with minimal capital and operating expenditures. We find optical bypass networks to be most scalable with respect to power consumption, especially when quality of service and network flexibility, reliability, and protection are considered. The power consumption of the standard bypass network can be lowered further through a hybrid design in which whole wavelengths of core, stable traffic between node pairs are routed via direct, fixed lightpaths using patch panelling and unexpected, bursty traffic is switched on a standard optical bypass network. We analyze power distribution among components and find the OXC switch most scalable at each node and O/E/O switches and routers wasteful. Finally, we prove that shortest path and minimum hop routing is power optimal and traffic balanced routing should be avoided. We approximate MAN topologies with regular graphs for tractable analysis. We augment a previous cost-based joint optimization formulation [13] with power expenditure modelling and obtain closed form solutions for optimal node degree and normalized network costs. We find that the optimal node connectivity increases 20-25% due to the added operating expenditures. Normalized network cost and normalized network cost per unit traffic also rise by approximately 25%. Our results show that the Generalized Moore graph with node degree between 0.05N and 0.08N is both power and cost minimal for a purely optical network.by Katherine Xiaoyan Lin.M.Eng