Showing papers in "Photonic Network Communications in 2004"
TL;DR: Optical burst switching nodes which employ shared wavelength converter pools and simple fiber delay line (FDL) buffers are evaluated and optimized strategies for the order of probing a wavelength converter pool and an FDL buffer for contention resolution are presented and compared.
Abstract: Optical burst switching (OBS) has attracted interest as a transport network architecture for the future optical Internet. As OBS relies on statistical multiplexing efficient contention resolution is a key issue in order to achieve a low burst loss probability. First, this paper discusses options and key design parameters for contention resolution in OBS. Then, it evaluates the performance of OBS nodes which employ shared wavelength converter pools and simple fiber delay line (FDL) buffers. Finally, optimized strategies for the order of probing a wavelength converter pool and an FDL buffer for contention resolution are presented and compared. It is shown that these strategies can be used to optimize performance for a given, for example, minimal cost, dimensioning of the wavelength converter pool and the FDL buffer.
67 citations
TL;DR: A novel genetic algorithm for solving the dynamic routing and wavelength assignment (DRWA) problem in wavelength-routed optical networks obtains low call blocking probability and employs a very short computation time, and is capable of providing fairness among connections.
Abstract: We propose a novel genetic algorithm for solving the dynamic routing and wavelength assignment (DRWA) problem in wavelength-routed optical networks. The algorithm not only obtains low call blocking probability, but it also employs a very short computation time. Moreover, it is capable of providing fairness among connections, that is, to offer approximately the same quality of service (in terms of blocking probability) for all source-destination node pairs. Since requirements on optical network availability are highly severe, we also propose an extension of the algorithm to provide fault-tolerance capability at the optical layer. It is achieved by means of protection, where each optical connection request is provided with a pair of lightpaths (a primary and a backup lightpath). Again, the genetic algorithm proves to be highly efficient, in this case, at performing routing and wavelength assignment of pairs of lightpaths.
66 citations
TL;DR: Rerouting surpasses the protection mechanisms in restorability and comes close to 100% dual failure survivability, compared to single failure planning, both shared path protection and rerouting need significantly more capacity in dual failure planning.
Abstract: Resilient optical networks are predominately designed to protect against single failures of fiber links. But in larger networks, operators also see dual failures. As the capacity was planned for single failures, disconnections can occur by dual failures even if enough topological connectivity is provided. In our approach the design of the network minimizes the average loss caused by dual failures, while single failures are still fully survived. High dual failure restorability is the primary aim, capacity is optimized in a second step. For WDM networks with full wavelength conversion, we formulate mixed integer linear programming models for dedicated path protection, shared (backup) path protection, and path rerouting with and without stub-release. For larger problem instances in path rerouting, we propose two heuristics. Computational results indicate that the connectivity is of much more importance for high restorability values than the overall protection capacity. Shared protection has similar restorability levels as dedicated protection while the capacity is comparable to rerouting. Rerouting surpasses the protection mechanisms in restorability and comes close to 100% dual failure survivability. Compared to single failure planning, both shared path protection and rerouting need significantly more capacity in dual failure planning.
64 citations
TL;DR: The results show that SSPP can make the tradeoffs between resource utilization and restoration time, and based on dynamic traffic with different load, the performance of S SPP has been investigated via simulations.
Abstract: In this paper, we investigate the problem of dynamically establishing dependable connections in wavelength division multiplexing (WDM) mesh networks with traffic-grooming capabilities. We first develop a new wavelength-plane graph (WPG) to represent the current state of the network. We then propose a dynamic shared sub-path protection (SSPP) scheme based on this WPG. To establish a dependable connection, SSPP first searches a primary path for each connection request, and then it segments the found path into several equal-length sub-paths, and computes their corresponding backup paths, respectively. If two sub-paths in SSPP are fiber-disjoint then their backup paths can share backup resources to obtain optimal spare capacity. Based on dynamic traffic with different load, the performance of SSPP has been investigated via simulations. The results show that SSPP can make the tradeoffs between resource utilization and restoration time.
62 citations
TL;DR: A cyclic polling-based DBA algorithm for differentiated classes of service in EPONs is proposed to support dynamic bandwidth distribution and it is shown that an interleaved polling scheme severely decreases downstream channel capacity for user traffic when the upstream network load is low.
Abstract: Ethernet passive optical networks (EPONs) are an emerging access network technology that provides a low-cost method of deploying optical access lines between a carrier's central office and customer sites. Dynamic bandwidth allocation (DBA) provides statistical multiplexing between the optical network units for efficient upstream channel utilization. To support dynamic bandwidth distribution, a cyclic polling-based DBA algorithm for differentiated classes of service in EPONs is proposed. It is shown that an interleaved polling scheme severely decreases downstream channel capacity for user traffic when the upstream network load is low. To obtain realistic simulation results, synthetic traffic that exhibits the properties of self-similarity and long-range dependence is used. Network performance under various loads is analyzed. Specifically, frame delays for different classes of traffic are considered.
55 citations
TL;DR: A comprehensive overview of the VPN is presented and the main issues associated with the design of IP VPN and OVPN are discussed and several OVPN architectures appeared in the literature are described.
Abstract: Recently, there has been rapid development and deployment of virtual private network (VPN) services. There are wide varieties of IP-based VPNs and optical VPNs (OVPNs) proposed in the literature and readers could easily get confused with so many different types of VPNs. The purpose of this paper is to present a comprehensive overview of the VPN and discuss the main issues associated with the design of IP VPN and OVPN. We first present a classification of the VPNs including CE-based, network based, customers provisioned, provider provisioned, connection oriented, connectionless oriented, port based, connection based, layer 1 VPN, layer 2 VPN, and layer 3 VPN, and describe different VPN protocols such as IPSec, GRE and MPLS. We then review the recent work on OVPN by different standard bodies, and outline the key requirements for OVPN service providers and customers. Finally, we describe several OVPN architectures appeared in the literature, highlight the future work in OVPN.
36 citations
TL;DR: This paper presents a novel technique for link protection in mesh networks based on the use of hierarchical trees, and provides a mathematical analysis to compute performance measures and restorability analysis for several real and arbitrary long haul networks to compare the scheme to other link protection proposals.
Abstract: This paper presents a novel technique for link protection in mesh networks based on the use of hierarchical trees. The hierarchical protection tree (or p-tree) provides hierarchical layering of the network. The straddling links that are not located in the tree are protected through tree branches to higher-layer Parent nodes. The links in the tree are protected by links to backup parent nodes. This scheme offers several advantages such as scalability, failure impact restriction, and distributed processing. We provide a mathematical analysis to compute performance measures for our link protection scheme, and perform restorability analysis for several real and arbitrary long haul networks to compare our scheme to other link protection proposals. Our results demonstrate the applicability of hierarchical p-tree link protection schemes in real long-haul networks.
35 citations
TL;DR: It is shown that by simultaneously supporting several optical switching paradigms in a single physical topology, efficient and flexible optical networks can be built and are fully compatible with the GMPLS unified control plane.
Abstract: This paper proposes a novel polymorphic framework for optical networking and a seamless evolution path from optical circuit-switched towards optical packet-switched networks. We show that by simultaneously supporting several optical switching paradigms in a single physical topology, efficient and flexible optical networks can be built. The supported paradigms are associated with different Classes of Service (CoS) in order to provide service differentiation at the optical layer. Two polymorphic architectures are presented, one based on optical circuit switching paradigms with different grades of dynamism, and a second one based on optical labeled burst-switched networks with the added capability of dynamic lightpath provisioning. These architectures provide a seamless evolution path towards an efficient IP-over-WDM approach with service differentiation. Moreover, the proposed polymorphic architectures are fully compatible with the GMPLS unified control plane. We present in a detailed form the proposed polymorphic framework, including the selection of switching paradigms, its support for CoS, the network and control architecture, and a possible seamless evolution towards optical packet-switched networks. Possible implementation examples of optical network nodes that support the proposed polymorphic architectures are also presented.
27 citations
TL;DR: An overview of the ASON and GMPLS frameworks at the current stage of their development is provided and aims in particular on comparing the concepts and pointing out some open issues.
Abstract: In automatic switched transport networks (ASTN), transport services of different granularity can be set up, modified and released on demand using the mechanisms in the control plane. Currently, this novel provisioning paradigm is being standardized under the umbrella of the automatic switched optical network (ASON) and generalized multiprotocol label switching (GMPLS) framework. This paper provides an overview of the ASON and GMPLS frameworks at the current stage of their development and aims in particular on comparing the concepts and pointing out some open issues. In this context, we first give a brief overview of ASON and GMPLS work, and then provide a concept and functionality mapping including network resource models, control plane architecture, discovery, call and control management, and resiliency. Finally we address some important provider requirements.
26 citations
TL;DR: This work considers a fairly generic all-optical packet switch architecture with a feedback optical buffer constituted of fiber delay lines (FDL) and shows that in spite of the limited queuing resources, acceptable performance can be achieved for reasonable hardware resources with an appropriate design of the time/wavelength scheduling algorithms.
Abstract: We address the problem of congestion resolution in optical packet switching (OPS). We consider a fairly generic all-optical packet switch architecture with a feedback optical buffer constituted of fiber delay lines (FDL). Two alternatives of switching granularity are addressed for a switch operating in a slotted transfer mode: switching at the slot level (i.e., fixed length packets of a single slot) or at the burst level (variable length packets that are integer multiples of the slot length). For both cases, we show that in spite of the limited queuing resources, acceptable performance in terms of packet loss can be achieved for reasonable hardware resources with an appropriate design of the time/wavelength scheduling algorithms. Depending on the switching units (slots or bursts), an adapted scheduling algorithm needs to be deployed to exploit the bandwidth and buffer resources most efficiently.
25 citations
TL;DR: It is found that, using shared path protection schemes, it is possible to build cost-effective survivable networks that provide rich connectivity among client nodes with only a modest additional amount of resources over a network with no survivability properties.
Abstract: We consider the problem of designing a network of optical cross-connects (OXCs) which provides end-to-end lightpath services to large numbers of client nodes, under the requirement that the network will survive any single-link failure. Our main objective is to quantify the additional resource requirements of implementing path protection schemes over a network with no survivability properties. To this end, we present heuristic routing and wavelength assignment algorithms for dedicated path protection and two variants of shared path protection, and integrate them into the physical and logical topology design framework we developed in an earlier study. We apply our heuristics to networks with up to 1000 client nodes, with a number of lightpaths that is an order of magnitude greater than the number of clients, and for a wide range of values for system parameters such as the number of wavelengths per fiber, the number of optical transceivers per client node, and the number of ports per OXC. Our results provide insight into the relative resource requirements of dedicated and shared path protection schemes. We also find that, using shared path protection schemes, it is possible to build cost-effective survivable networks that provide rich connectivity among client nodes with only a modest additional amount of resources over a network with no survivability properties.
TL;DR: An integer linear programming (ILP) formulation for partitioning an optical network topology into subnetworks, where the subnets are determined subject to the constraints that each subnetwork satisfies size limitations, and it is two-connected.
Abstract: We discuss the problem of designing translucent optical networks composed of restorable, transparent subnetworks interconnected via transponders. We develop an integer linear programming (ILP) formulation for partitioning an optical network topology into subnetworks, where the subnetworks are determined subject to the constraints that each subnetwork satisfies size limitations, and it is two-connected. A greedy heuristic partitioning algorithm is proposed for planar network topologies. We use section restoration for translucent networks where failed connections are rerouted within the subnetwork which contains the failed link. The network design problem of determining working and restoration capacities with section restoration is formulated as an ILP problem. Numerical results show that fiber costs with section restoration are close to those with path restoration for mesh topologies used in this study. It is also shown that the number of transponders with the translucent network architecture is substantially reduced compared to opaque networks.
TL;DR: This paper reports on a novel strategy and related algorithm for realizing dynamic routing and grooming into wavelengths of data flows (label switched paths, LSPs) in new generation optical networks based on generalized MPLS (GMPLS).
Abstract: This paper reports on a novel strategy and related algorithm for realizing dynamic routing and grooming into wavelengths of data flows (label switched paths, LSPs) in new generation optical networks based on generalized MPLS (GMPLS). The method allows arbitrary granularities of LSPs. The new generation network is modeled as a multi-layer network consisting of an IP/MPLS layer and an optical layer. In particular, the proposed solution adopts a dynamic routing algorithm based on the Dijkstra algorithm, that makes use of a weight system, integrated with a suitable method for grooming LSPs into wavelengths based on the packing criterion, thus harmonizing the features of MPLS packet flows whose bandwidth vary in a continuous range of values, with the optical world, where the wavelength bandwidth ranges according to discrete values. The weight system is based on the concepts of least resistance routing that allows to evenly distribute the traffic at the MPLS layer, while packing improves the use of optical resources by favoring more filled wavelengths with respect to the emptier ones. To assess the validity of the proposed solution a simulation model has been realized. The results obtained by simulation show that the packing criterion allows reducing the refused bandwidth from two down to about four times, for a network load of 70% and 55%, respectively, when compared with the alternative method named spreading. The dependence of the proposed solution on bandwidth granularity has been also investigated. Moreover, in order to demonstrate the superior performance of the proposed routing solution, a comparison between the proposed strategy with relevant solutions known in the literature, based on either a single or multi-layer approach, is also reported. In order to perform the comparison, all the reference routing solutions that have been considered adopt the packing method for LSP grooming into the lightpaths. The results show that our solution outperforms the others in terms of amount of traffic that can be on-line accommodated. For instance, assuming a blocking probability of 10−3, the proposed solution is able to further reduce the refused bandwidth of the best routing algorithm considered in the analysis by a factor of three times, thanks to the knowledge of optical resource availability.
TL;DR: Results show that during highly dynamic traffic conditions, AHRP possesses the lowest blocking probability, shorter setup delay, and less signaling overhead.
Abstract: An adaptive hybrid reservation protocol (AHRP) is proposed for the purpose of quickly and efficiently establishing a lightpath in dynamic wavelength routed networks. This protocol uses a special reservation-and-probe (RESV_PROB) packet and extends the signaling to integrate forward reservation and backward reservation into one monolithic process. To decrease the blocking probability that happens in cases where two end nodes associated with a specific link simultaneously reserve the same wavelength, an adaptive wavelength selection policy is specially employed in AHRP. A discrete-event simulation tool based on ns-2 is developed to investigate AHRP's performance, including its blocking probability, average lightpath setup delay, and signaling overhead. AHRP is also compared with existing protocols. Results show that during highly dynamic traffic conditions, AHRP possesses the lowest blocking probability, shorter setup delay, and less signaling overhead.
TL;DR: This paper provides a simple and generic framework to minimize the number of transceivers needed in the network and justifies the need to address the traffic grooming problem in mesh networks and argues for the validity of the approach.
Abstract: In this paper, we address the traffic grooming problem in WDM mesh networks when the offered traffic is characterized by a set of traffic matrices—a variant of dynamically changing traffic. We justify the need to address this problem in mesh networks and also argue for the validity of our approach to solve this problem. Our primary objective is to design the network in terms of the number of wavelengths and transceivers required to support any offered traffic matrix. We provide a simple and generic framework to minimize the number of transceivers needed in the network. Simulation results have been presented in contrast with a possible approach, to enable comparison with our solution strategy. An ILP formulation of our approach is also presented.
TL;DR: O-VPNs provide carriers with new revenue opportunities as well as the potential to reduce their operating and capital costs and offer carrier-customers several benefits, including lower networking costs, increased network flexibility and control, and improved network operational efficiency.
Abstract: Today's economic environment presents special challenges for telecommunication carriers—finding new ways to drive down network costs i, without limiting future growth opportunities. Minimizing operating expenses and capital expenditures is not sufficient to ensure future prosperity. New, value-added services can help carriers increase their revenues and profits—today. Virtual private networks (VPNs), both data (IP & MPLS) and optical, fit the description of value-added services. VPN services have received ample attention over the last few years as they are viewed by carriers as an attractive value added service and by customers as a cost effective replacement of leased private lines. VPNs can also help carriers reduce their costs—both capital and operational—by supporting multiple customers, each allowed with varying levels of network control and management over the same (shared) infrastructure. Optical virtual private networks (O-VPNs) represent the next step in the evolution of VPNs and provide similar underlying benefits as other VPN technologies to carriers. Although both carriers and vendors have been talking about O-VPNs for years, the first commercially viable solutions started becoming available in early 2002 [1]. O-VPNs provide carriers with new revenue opportunities as well as the potential to reduce their operating and capital costs. Additionally, O-VPNs offer carrier-customers several benefits, including lower networking costs, increased network flexibility and control, and improved network operational efficiency.
TL;DR: This paper studies the virtual topology design and reconfiguration problem of virtual private networks (VPNs) over all-optical WDM networks and proposes a balanced alternate routing algorithm (BARA) based on a genetic algorithm.
Abstract: This paper studies the virtual topology design and reconfiguration problem of virtual private networks (VPNs) over all-optical WDM networks. To support VPN service, a set of lightpaths must be established over the underlying WDM network to meet the VPN traffic demands and this set of lightpaths must also be dynamically reconfigurable in response to changing VPN traffic. To achieve good network performance and meet the service requirements of optical virtual private networks (oVPNs), we formulate the problem as an integer programming problem with multi-objectives and present a general formulation of the problem. In the formulation, we take into account the average propagation delay over a lightpath, the maximum link load, and the reconfiguration cost with objectives to minimize the three metrics simultaneously. The formulated problem is NP-hard and is therefore not practical to have exact solutions. For this reason, we use heuristics to obtain approximate optimal solutions and propose a balanced alternate routing algorithm (BARA) based on a genetic algorithm. To make the problem computationally tractable, we approximately divide BARA into two independent stages: route computing and path routing. At the route computing stage, a set of alternate routes is computed for each pair of source and destination nodes in the physical topology. At the path routing stage, an optimal route is decided from a set of alternative routes for each of the lightpaths between a pair of source and destination nodes. A decision is subject to the constraints and objectives in the formulation. To improve the computational efficiency, we use a genetic algorithm in BARA. Through simulation experiments, we show the effectiveness of BARA and the evolution process of the best solution in a population of solutions produced by the genetic algorithm. We also investigate the impact of the number of alternative routes between each pair of source and destination nodes on the optimized solutions.
TL;DR: A new routing algorithm called multi-wavelength minimum interference path routing (MW-MIPR) is proposed to provide more reliable QoS guarantees by consideration of the potential future network's congestion status by choosing a route that does not interfere too much with potential future connection requests.
Abstract: A major challenge in next generation Internet (NGI) backbone networks based on dense-wavelength division multiplexing (DWDM) is the provision of guaranteed quality-of-service (QoS) for a wide variety of multimedia applications. This paper proposes a new routing algorithm called multi-wavelength minimum interference path routing (MW-MIPR) to provide more reliable QoS guarantees by consideration of the potential future network's congestion status. This improves wavelength utilization by choosing a route that does not interfere too much with potential future connection requests. Moreover, we introduce a differentiated routing and wavelength assignment (RWA) mechanism combined with recovery strategy and the proposed MW-MIPR algorithm based on the differentiated service model in the NGI. Simulation results show that the proposed MW-MIPR algorithm achieves a smaller blocking probability than dynamic routing (DR) that yields the best performance among previous RWA algorithms. And we prove that a differentiated RWA combined with a recovery capability together with the proposed routing scheme provides satisfied QoS assurance for each service class in terms of signal quality and survivability.
TL;DR: The optical-label switched path (O-LSP) establishment and its QoS maintenance scheme based on differentiated optical QoS-service (DOQoS) classes are suggested in this paper as the key components for this DOQoS framework in assuring end-to-end QoS in an “OVPN over IP/GMPLS over DWDM” architecture.
Abstract: A “virtual private network (VPN) over Internet” has the benefit of being cost-effective and flexible. However, it has difficulties providing sufficient QoS and adequate transmission capacity for high bandwidth services. Given the increasing demand for high bandwidth Internet and the demand for QoS assurances in a “VPN over Internet”, IP/generalized multi-protocol label switching (GMPLS) based on a control plane combined with a high-bandwidth, dense-wavelength division multiplexing (DWDM) optical network is seen as a very favorable approach for realizing the future “optical VPN (OVPN) over IP/GMPLS over DWDM”. Within this architecture, providing QoS guaranteed multimedia services with a differentiated QoS guaranteed protocol framework with QoS recovery is one of the key issues to implement. Therefore, we suggest in this paper optical-label switched path (O-LSP) establishment and its QoS maintenance scheme based on differentiated optical QoS-service (DOQoS) classes. They are the key components for this DOQoS framework in assuring end-to-end QoS in an “OVPN over IP/GMPLS over DWDM” architecture.
TL;DR: A novel scheme called the differentiated integrated survivability algorithm (DISA) is designed to solve the dynamic MLIS problem, which employs flexible survivable routing strategies according to the priority of the traffic resilience request.
Abstract: In this paper, we study the problem of multi-layer integrated survivability (MLIS) for efficiently provisioning reliable traffic connections of arbitrary bandwidth granularities in the integrated optical Internet. We decompose the MLIS problem into three sub-problems: survivable strategies design (SSD), spare capacity dimensioning (SCD), and dynamic survivable routing (DSR). First, a review of network survivability in multi-layer IP/WDM networks is provided. Then, multi-layer survivability strategies are proposed and it is observed how these strategies could be applied to the integrated optical Internet architecture. We also present an enhanced integrated shared pool (ISP) method for solving the static MLIS problem (i.e., the SCD sub-problem) and the priority-based integer programming formulations are also given. Moreover, we design a novel scheme called the differentiated integrated survivability algorithm (DISA) to solve the dynamic MLIS problem (i.e., the DSR sub-problem), which employs flexible survivable routing strategies according to the priority of the traffic resilience request. Performance simulation results of DISA show that our adaptive survival schemes perform much better in terms of traffic blocking ratio, spare resource requirement, and average traffic recovery ratio compared with other solutions in the optical Internet.
TL;DR: This paper investigates the issue of routing of dynamic connections in WDM networks which are also loaded with high-priority protected static connections and proposes a new heuristic algorithm based on an occupancy cost function which takes several possible causes of blocking into account.
Abstract: Dynamic traffic is becoming important in WDM networks. In the transition towards full dynamic traffic, WDM networks optimized for a specific set of static connections will most likely also be used to support on-demand lightpath provisioning. Our paper investigates the issue of routing of dynamic connections in WDM networks which are also loaded with high-priority protected static connections. By discrete-event simulation we compare various routing strategies in terms of blocking probability and we propose a new heuristic algorithm based on an occupancy cost function which takes several possible causes of blocking into account. The behavior of this algorithm is tested in well-known case-study mesh networks, with and without wavelength conversion. Moreover, Poissonian and non-Poissonian dynamic traffics are considered.
TL;DR: A general RWA algorithm is proposed that takes a combined view of the network resource to integrate routing, wavelength assignment and gateway selection in a single routing framework and is demonstrated by comparing it with other state-of-the-art heuristics in this area.
Abstract: This paper studies the routing and wavelength assignment (RWA) problem in multi-segment optical networks. The notion of network segment is referred to any part of the network that requires special consideration of wavelength routing such as separate administrative domains in a large scale optical network, sub-networks run by various service providers, etc. In multi-segment optical networks, each segment has different resource availability or hardware characteristics. The differences between multi-segment optical networks and homogeneous optical networks are discussed. We then present a resource abstraction technique called blocking island and define a multi-segment blocking island graph (BIG) network model. Using a minimum splitting routing heuristic introduced in the context of the blocking island paradigm in conjunction with the multi-segment BIG model, we propose a general RWA algorithm that takes a combined view of the network resource to integrate routing, wavelength assignment and gateway selection in a single routing framework. In the simulation, we demonstrate the effectiveness of our proposed algorithm by comparing it with other state-of-the-art heuristics in this area.
TL;DR: The proposed algorithm, the shortest-widest-path-first (SWPF) algorithm, uses a modified Dijkstra's algorithm to find a working path and a protection path for each connection request in the wavelength graph transformed from the original network topology and outperforms existing heuristic algorithms in terms of total number of converter used and the maximum number of converters required at each node in the network.
Abstract: In this paper, we study routing and wavelength assignment of connection requests in survivable WDM optical mesh networks employing shared path protection with partial wavelength conversion while 100% restorability is guaranteed against any single failures. We formulate the problem as a linear integer program under a static traffic model. The objective is to minimize the total cost of wavelength-links and wavelength converters used by working paths and protection paths of all connections. A weight factor is used which is defined as the cost ratio of a wavelength converter and a wavelength-link. Depending on the relative cost of bandwidth and wavelength conversion, the optimization objective allows a proper tradeoff between the two. The proposed algorithm, the shortest-widest-path-first (SWPF) algorithm, uses a modified Dijkstra's algorithm to find a working path and a protection path for each connection request in the wavelength graph transformed from the original network topology. When there are multiple candidate paths that have the same minimum total cost, the path along which the maximum number of converters used at each node is minimized is chosen by the SWPF algorithm. We have evaluated the effectiveness of the proposed algorithm via extensive simulation. The results indicate that the performance of the proposed algorithm is very close to that of the optimal solutions obtained by solving the ILP formulation and outperforms existing heuristic algorithms in terms of total number of converters used and the maximum number of converters required at each node in the network. The proposed algorithm also achieves slightly better performance in terms of total cost of wavelength-links and converters used by all connections. We also investigated shared path protection employing converter sharing. The results show that the technique can reduce not only the total number of converters used in the network but also the maximum number of converters required at each node, especially when a large number of converters are needed in the network. In this study, although the ILP formulation is based on static traffic, the proposed algorithm is also applicable to routing dynamic connection requests.
TL;DR: This paper presents a dynamic distributed model supporting five different classes of protection, including protection against single and double fault, with and without sharing of backup bandwidth, and an extensive performance analysis by means of simulations.
Abstract: In the context of an optical network GMPLS can be used to provide network robustness to faults through end-to-end path protection techniques. In this paper, we present a dynamic distributed model supporting five different classes of protection, including protection against single and double fault, with and without sharing of backup bandwidth. Beyond link and node failures we also consider protection against shared risk link group (SLRG) failure. In this paper, we briefly describe the protection model and the underlying algorithms for route selection and backup bandwidth sharing. After that we face the following issue: Which subset out of the five possible protection classes is convenient for an operator to support on the same network infrastructure? To answer this question it is fundamental to have a clear view of the trade-offs between the costs and the performances associated to each class. To achieve that we carried out an extensive performance analysis by means of simulations. For each protection class, we evaluated two fundamental performance metrics: the recovery probability under multiple faults, and the average per-demand resource usage. On the basis of such results, we are able to identify some basic guidelines driving the choice of the more convenient subset of protection classes to be implemented within a single network.
TL;DR: This work addresses the virtual topology design and routing problem, where the service differentiating parameter is bit error rate (BER) in the optical domain and proposes a heuristic based approach to minimize congestion in the network while satisfying the QoS constraints.
Abstract: The need to establish wavelength-routed connections in a service differentiated manner is becoming increasingly important. In the backbone network, support of quality of service (QoS) capabilities at the lightpath level will have to be addressed in the optical domain. Providing a service differentiated connection on an arbitrary virtual topology which does not support any differentiated services will lead to the misuse of network resources. We address the virtual topology design and routing problem, where we minimize congestion in the network. In our work, the service differentiating parameter is bit error rate (BER) in the optical domain. We present a mixed integer linear programming (MILP) formulation for the above problem. We also propose a heuristic based approach to minimize the congestion in the network while satisfying the QoS constraints. These QoS constraints in our case are the differing BER requirements for each connection between each (source, destination) pair. We then present different methods of providing survivability for the virtual topology and compare the performance of these methods.
TL;DR: This paper proposes a novel fast multicast algorithm with enhanced survivability (FMES), which applies a two-stage multicast routing approach, and employs a path protection scheme for each segment of the first stage tree.
Abstract: WDM optical networking technology is expected to facilitate bandwidth-intensive multicast application by establishing a “light-tree” which regards the source node as the root and all the destination nodes as the leaves. However, the existing multicast routing algorithms are time-consuming and the generated “light-trees” are very sensitive to failures, e.g., a single fiber cut can disrupt the information from transmitting to several terminals. In this paper, we propose a novel fast multicast algorithm with enhanced survivability (FMES), which applies a two-stage multicast routing approach, and employs a path protection scheme for each segment of the first stage tree. Analysis and experimental results show that FMES has the significant advantage of a much shorter running time than that in existing schemes, and this advantage can be enlarged in the distributed routing and signaling system of the coming intelligent optical networks. We also compare FMES with non-protection and full-protection schemes. It shows that the FMES scheme achieves the best trade-off between network survivability and resource-utilization. We illustrate our study with numerical experiments based on the real-life ChinaNet topology.
TL;DR: An original module for effectively handling bandwidth resources in a multi-service MPLS network that allows accommodating more traffic with respect to traditional IP networks, reducing the network blocking probability, while preserving Class of Service requirements.
Abstract: This paper reports an original module for effectively handling bandwidth resources in a multi-service MPLS network. This module, named bandwidth engineering, allows accommodating more traffic with respect to traditional IP networks, reducing the network blocking probability, while preserving Class of Service (CoS) requirements. It consists of an algorithm that handles priority between label switched paths associated to different classes of services, and of a dynamic routing algorithm that works with the bandwidth constraint. Simulation results are reported to assess the validity of the proposed solution.
TL;DR: The granularity of the traffic demand between US metro areas is investigated for two future points in time, namely 2006 and 2010 and it is found that a significant portion of the total traffic volume at these moments in time will qualify for transport using switched connections with a capacity of 10 Gbps.
Abstract: The optical layer of the transport network is expected in the (near) future to make the transition from a statically configured layer to a fully flexible, automatic and intelligent layer. Such an intelligent optical network (ION) allows to set up (or tear down) bandwidth between two nodes on demand, following a simple request of the client network layer: the so-called switched connections. For successful deployment of these switched connections it is of utmost importance to have a well-educated idea about the granularities of the traffic flows in the optical transport network. Deploying switched connections with a capacity of 10 Gbps to transport a traffic demand with a granularity of a few hundred Mbps does not exactly make efficient use of the network resources. In this paper, the granularity of the traffic demand between US metro areas is investigated for two future points in time, namely 2006 and 2010. For this study we focus on the traffic flows between two metro area entities: the points of presence (PoPs) or the main aggregation points of the customer traffic in a metro area, and the collector central offices (COs) or the nodes a bit further in the metro area, closer to the end-customers. We have found that a significant portion of the total traffic volume at these moments in time will qualify for transport using switched connections with a capacity of 10 Gbps. According to our study, in 2006 around one third of the traffic will qualify for transportation in such 10 Gbps connections between PoPs in different metro areas, while by 2010 this amount will have increased to more than 99%. The traffic granularity between the collector COs, however, will in 2006 still be too small to justify the use of direct 10 Gbps connections, but in 2010 almost three quarter of the traffic could make use of 10 Gbps direct connections from collector CO to collector CO. These results enable us to sketch the expected network evolution scenario and determine the type and size of equipment needed in the different steps of the network evolution. The optical edge aggregation switches will have to be moved deeper into the metro area with time: in 2006 they will be needed at the PoPs, while by 2010 they could be placed at the collector COs.
TL;DR: This work compares the performance of two hop-by-hop and one parallel signaling schemes in wavelength-routed optical mesh networks, and proposes a parallel signaling scheme that is different from the existing hop- by-hop GMPLS signaling protocols.
Abstract: The next-generation optical transport network will evolve from point-to-point connectivity to mesh networking, which can provide fast and automatic provisioning with enhanced flexibility and survivability. Signaling is used to support connection setup, maintenance, and teardown in such a network. In this paper, we study the performance of two hop-by-hop and one parallel signaling schemes in wavelength-routed optical mesh networks. Based on the sequence between optical crossconnect (OXC) switching and signaling message processing, we classify hop-by-hop signaling into two types that comply with the requirements of GMPLS signaling protocols. These two types are forward before switching configuration (FBSC) and forward after switching configuration (FASC). Also, we propose a parallel signaling scheme that is different from the existing hop-by-hop GMPLS signaling protocols. Considering OXC architectures and traffic patterns, we compare the FBSC, FASC, and parallel signaling schemes using simulation experiments, in terms of network blocking probability and reservation time. The simulation data reveal that the performance of a signaling scheme depends on the nature of the signaling as well as the network setting (e.g., the OXC architecture and traffic pattern). We analyze reasons for this result and discuss tradeoffs between these signaling schemes. This work offers some insight into designing an efficient signaling protocol for wavelength-routed optical mesh networks.
TL;DR: The focus of this paper is to provide a working solution for the peer model, perform a complexity analysis of the solution, and discuss its impact on the design of the protocols and the packet and transport layer devices that must interwork to realize this model.
Abstract: This paper contributes to a much-needed understanding of the operation, design, implementation, and evaluation of the peer model in integrated optical networks. The overlay and peer models of operation form the two fundamental architectural alternatives for interworking the control planes of optical TDM/WDM networks with those of packet or cell-based networks. Of these, the overlay model is well understood, having a precedence in IP-over-ATM networks deployed in the mid 1990s. It follows a proven approach to managing multi-area, multi-domain networks. The peer model, on the other hand, has not been implemented yet, and has also not been analyzed adequately in the literature. To enable service providers to implement either model, based on the respective merits of each, it is fundamentally important to develop a working solution for the peer model. The focus of this paper is to provide such a solution, perform a complexity analysis of the solution, and discuss its impact on the design of the protocols and the packet and transport layer devices that must interwork to realize this model.