Waveband grooming and IP aggregation in optical networks

An automatically switched optical network (ASON) can be used as the transport layer of generalized multiprotocol label switching (GMPLS) networks. The design of an ASON involves determining the number of optical cross-connects (OXC) in the network, the required number of ports per OXC, and the interconnection topology of the OXCs. Given the number of ports per OXC, we present a linear algorithm to find the number of OXCs and to identify a cost-effective topology. We then develop a scheme that can be used to perform waveband grooming for several different topologies of an ASON that uses single-layer multigranular OXCs. We identify the bottlenecks and investigate the effect of traffic grooming schemes in the design of an ASON as a function of the peak access rate per customer. We evaluate the topologies and architectures for a national trunk network.     

Buffering-deflection tradeoffs in optical burst switching

A very important issue in optical burst switching (OBS) networks is the excessive burst drop when no suitable network resources are found during path reservation. In this study, a network scenario is evaluated in which AWG-based optical nodes are used as burst router nodes within the optical network. The two classical solutions to solve the burst contentions on the channels outgoing from the node are considered, that is, either based on buffering within the node, or by exploiting deflection routing. A performance evaluation is carried out to evaluate and compare these solutions for different network topologies with different node and traffic parameters. Our main contribution is to set numerical tradeoffs between burst deflection through the network and buffering in the node, so that a guidance in optical network design is provided where node buffering is inherently technologically limited.     

Topology Design of OXC-Switched WDM Networks

This paper attempts to find a new analytical framework to identify cost-effective topological architectures of optical cross-connect (OXC)-switched wavelength-division multiplexing (WDM) networks. To keep the analysis tractable, we first focus on regular networks and a deterministic uniform traffic model. Regular topologies with symmetries are good approximations of metropolitan area and local area networks but only a fair resemblance of wide area networks. We find that for a regular topology the minimum-hop distance, which is normally used for gauging the size of the network, is an important parameter in dimensioning switching resources. By setting up a first-order cost model and evaluating the tradeoff between network resources, we obtain closed form solutions for the optimal node degree and network cost. For network design under stochastic traffic, we study the worst case capacity dimensioning and blocking probability among the set of all possible stochastic traffic distributions with the same mean and variance. The analytical approach presented in this paper helps us gain insights of parametric dependency of an optimal network architecture on key network design parameters.     

Mesh光网络基于有向P圈的保护配置策略

文章针对波分复用(WDM)光网络的工作机制,提出了有向P圈的概念和WDM网络基于有向P圈的保护机制及配置策略.同时,提出了对偶圈合并法则和以此为基础的P圈生成和网络保护资源配置启发式算法.为了验证配置方案的有效性,利用OPNET Modeler搭建了自动交换光网络(ASON)-WDM仿真平台,在泛欧COST239网络拓扑和北美NSFnet网络拓扑上进行了大量仿真.仿真结果证明了P圈生成算法和有向P圈配置策略的有效性和可行性.     

Capacity dimensioning and routing for hybrid satellite and terrestrial systems

Satellite network architecture plays an important role in the success of a satellite business. For future commercial broadband data satellite networks integrated with the terrestrial network, satellite network topology, link capacity, and routing have major impacts on the cost of the network and the amount of revenue the network can generate. To find the most cost-effective satellite network topology, we propose a unified mathematical framework using a two-stage stochastic programming formulation. The solution to the stochastic programming formulation gives optimal link capacities and an optimal routing strategy for different network topologies, taking into account uncertainties in long-term aggregate traffic statistic estimation. Using a simple satellite network example, we show the feasible topology regions for three different satellite topologies and show that, for some parameter values, the hybrid topology is more cost effective than nonhybrid topologies. In the limit of high traffic rejection cost, stochastic dimensioning reduces to static dimensioning. We study worst case static dimensioning for a general geosynchronous earth orbit satellite network and show the feasible topology regions, as well as effective cost comparisons for different topologies. We conclude with a discussion on network cost and architectural flexibility relating to satellite network design.     

Design of Translucent Optical Networks: Partitioning and Restoration

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.     

“MeshUp”: Self-organizing mesh-based topologies for next generation radio access networks

The phenomenal growth in wireless technologies has brought about a slew of new services. Incumbent with the new technology is the challenge of providing flexible, reconfigurable, self-organizing architectures which are capable of catering to the dynamics of the network, while providing cost-effective solutions for the service providers. In this paper, we focus on mesh-based multi-hop access network architectures for next generation radio access networks. Using short, high bandwidth optical wireless links to interconnect the various network elements, we propose a non-hierarchical, multi-hop access network framework. We study two generic family of mesh-based topologies: GPeterNet, a graph theoretic framework, and FraNtiC, a fractal geometric architecture, for arbitrary access network deployments. The performance of these topologies is analyzed in terms of different system metrics – topological robustness and reliability, system costs and network exposure due to failure conditions. Our analysis shows that a combination of different mesh-based multi-hop access topologies, coupled with emerging wireless backhaul technologies, can cater carrier-class services for next generation radio access networks, providing significant advantages over existing access technologies.     

On the physical and logical topology design of large-scale optical networks

We consider the problem of designing a network of optical cross-connects (OXCs) to provide end-to-end lightpath services to large numbers of label switched routers (LSRs). We present a set of heuristic algorithms to address the combined problem of physical topology design (i.e., determine the number of OXCs required and the fiber links among them) and logical topology design (i.e., determine the routing and wavelength assignment for the lightpaths among the LSRs). Unlike previous studies which were limited to small topologies with a handful of nodes and a few tens of lightpaths, we have applied our algorithms to networks with hundreds or thousands of LSRs and with a number of lightpaths that is an order of magnitude larger than the number of LSRs. In order to characterize the performance of our algorithms, we have developed lower bounds which can be computed efficiently. We present numerical results for up to 1000 LSRs and for a wide range of system parameters such as the number of wavelengths per fiber, the number of transceivers per LSR, and the number of ports per OXC. The results indicate that it is possible to build large-scale optical networks with rich connectivity in a cost-effective manner, using relatively few but properly dimensioned OXCs.     

Mixed-line-rate optical network design with wavebanding

To cope with ever increasing and more heterogeneous traffic demands, today’s optical backbone networks are expected to support mixed line rates (MLR) over different wavelength channels. MLR networks can be designed to provide flexible rate assignments to low-bit-rate services and high-bit-rate services in a cost-effective manner. But with increasing number of wavelengths in the network, aggregating wavelengths into wavebands can further reduce the network cost.In this study, we incorporate the idea of waveband switching in MLR network design. Wavebanding or grouping of optical paths reduces the optical switch size at the optical cross-connects (OXCs). When several lightpaths share several common links, they can be grouped together and routed as a single waveband. For optical bypass at a transit node, only two optical ports are required for each waveband, hence reducing the port cost. It can be a challenge for an MLR network to waveband wavelengths of different line rates that have different transmission reaches. In our design, we present a suitable switching architecture and propose an efficient and cost-effective approach for wavebanding in an MLR network. The design problem is formulated as a mixed integer linear program (MILP) where the objective is to minimize transponder cost and port cost. A heuristic algorithm for wavebanding in MLR networks is provided. To further optimize our solution, we also present a Simulated Annealing algorithm for wavebanding. Our results show a significant improvement in cost savings compared to single-line-rate (SLR) networks with wavebanding and an MLR network employing only wavelength switching.     

The Role of Network Topologies in the Optical Core of IP-over-WDM Networks with Static Wavelength Routing

In this paper, we present a performance analysis of network topologies for the optical core of IP-over-WDM networks with static wavelength routing. The performance analysis is focused on regular degree four topologies, and, for comparison purposes, degree three topologies are also considered. It is shown that the increase of the nodal degree from three (degree three topology with smallest diameter) to four (degree four topology with smallest diameter) improves the network performance if a larger number of wavelengths per link is available. However, the influence of wavelength interchange on the nodal degree gain is small. The performance of regular degree four topologies with smallest diameter is also compared with the performance of mesh–torus topologies (which are also degree four topologies), and it is shown that the blocking probability of degree four topologies with smallest diameter is about two orders of magnitude lower than the blocking probability of mesh–torus topologies. It is also presented a performance comparison of WDM-based networks with nodal degrees ranging from two to five and it is shown that the increase of the nodal degree from two to three leads to high nodal degree gains, while de increase of the nodal degree from four to five leads to low nodal degree gains. These results show that degree three and degree four topologies are very attractive for use in the optical core of IP-over-WDM networks.     

The European IST project DAVID: a viable approach toward optical packet switching

In this paper, promising technologies and a network architecture are presented for future optical packet switched networks. The overall network concept is presented and the major choices are highlighted and compared with alternative solutions. Both long and shorter term approaches are considered, as well as both the wide-area network and multiple-area networks parts of the network. The results presented in this paper were developed in the frame of the research project DAVID (Data And Voice Integration over DWDM) project, funded by the European Commission through the IST-framework.     

Joint optimization of delay and congestion in wavelength-routed optical networks using genetic algorithms

A new multipurpose genetic algorithm, based on Pareto optimality, is proposed to design logical topologies for wavelength-routed optical networks with the aim of minimizing both the congestion and the end-to-end delay. Simulation results show its efficiency when compared with other previously proposed algorithms, achieving in most cases optimal or near-optimal solutions, and in less time than other methods. Moreover, since the algorithm relies on Pareto optimality, not only does it obtain a single logical topology but a set of them, so that the network designer can easily select the most appropriate one according to the current network requirements.     

Wavelength requirements in arbitrarily connected wavelength-routedoptical networks

Wavelength division multiplexed optical networks using wavelength routing (WRONs) represent the most promising solution for future high-capacity wide-area network applications. One of the crucial factors which will determine their feasibility is the number of wavelengths required to satisfy the network traffic demand. In this paper, we consider arbitrarily connected networks as physical topologies for WRONs. By analysing a large number of randomly generated networks, bounds on the network wavelength requirements are first evaluated as a function of the physical connectivity. The advantages achievable by multifiber connections and the consequence of single link failure restoration are then assessed for several existing or planned network topologies. The results can be used in the analysis and optimization of the WRON design     

On the improvement of network resource utilization efficiency for the establishment of static dependable connections in SRLG-constrained WDM translucent networks

In this paper, we investigate the problem of establishing static connections with fault-tolerant requirements, also known as dependable connections, taking into account quality of transmission constraints. To the best of our knowledge, this is the first study that tackles the aforementioned problem under shared risk link group (SRLG) constraints in translucent WDM optical mesh networks where typically a set of strategically localized network nodes are equipped with regeneration capability to overcome physical-layer impairment effects. A novel cross-layer heuristic approach is introduced to solve the problem for an heterogeneous networked scenario relying on a cost-effective two-stage protection procedure which combines the well-known path protection and partial path protection schemes in order to ensure instantaneous recovery from any SRLG-failure event. The proposed heuristic integrates a generic auxiliary graph model that incorporates various network heterogeneity factors such as the number of transceivers at each network node, the number of wavelengths on each fiber link, and the regeneration capability of each node, represented by different edges in the constructed graph. Moreover, the integrated auxiliary graph can be applied efficiently to model either single- or mixed-line-rate translucent WDM optical networks wherein different modulation formats are employed in order to support the transmission at different line rates. Our solution approach aims at maximizing the total number of accommodated requests by reducing network resource consumption through the simultaneous use of the backup–backup and primary–backup multiplexing techniques. We, here, present extended versions of these two techniques that generalize the sharing concept to some other important node resources—specifically, regeneration equipments which constitute the major cost factor in optical transport networks—in addition to link resources (i.e., wavelength channels). As far as we know, this is the first attempt to deploy simultaneously generalized versions of the backup–backup and primary–backup multiplexing techniques when considering static traffic patterns without compromising the 100 % fault-recoverability guarantee. The performances of the proposed heuristic are evaluated and discussed through extensive numerical experiments carried out on different network topologies. Significant improvements are demonstrated, either in terms of network blocking performance or in terms of resource utilization efficiency, in comparison with previously proposed approaches.     

Virtual topology design and flow routing in optical networks under multihour traffic demand

This article addresses the problem of finding a static virtual topology design and flow routing in transparent optical wavelength division multiplexing networks under a time-varying (multihour) traffic demand. Four variants of the problem are considered, using fixed or dynamically adaptable (meaning variable) flow routing, which can be splittable or unsplittable. Our main objective is to minimize the number of transceivers needed which make up for the main network cost. We formulate the problem variants as exact integer linear programs (ILPs) and mixed ILPs. For larger problem instances, we also propose a family of heuristics based on the concept of domination between traffic matrices. This concept provides the theoretical foundations for a set of techniques proposed to reduce the problem complexity. We present a lower bound to the network cost for the case in which the virtual topology could be dynamically reconfigured along time. This allows us to assess the limit on the maximum possible benefit that could be achieved by using optical reconfigurable equipment. Extensive tests have been conducted, using both synthetically generated and real-traced traffic demands. In the cases studied, results show that combining variable routing with splittable flows obtains a significant, although moderate, cost reduction. The maximum cost reduction achievable with reconfigurable virtual topologies was shown to be negligible compared to the static case in medium and high loads.     

Optimal nonuniform wavebanding in WDM mesh networks

Grouping together a set of consecutive wavelengths in a WDM network and switching them together as a single waveband could achieve savings in switching costs of an optical cross-connect. This technique is known as waveband switching. While previous work has focused on either uniform band sizes or nonuniform band sizes considering a single node or ring networks, in this paper we focus on optimizing the number of wavebands and their sizes for mesh topologies. We formulate a problem of optimizing the number of wavebands in a mesh network for a given set of lightpaths. The objective of the band minimization problem is to minimize the number of nonuniform wavebands in the network while satisfying the traffic requests. We formulate an integer linear program and propose efficient heuristics. Simulation results are presented to demonstrate the effectiveness of the proposed approaches under static traffic case. Our results show that the number of switching elements can be reduced by a large amount using waveband switching compared to wavelength switching. We also apply the proposed waveband strategy to the dynamic stochastic traffic case and evaluate the network performance in terms of blocking probability through numerical simulations.     

Overspill routing in optical networks: a true hybrid optical network design

To efficiently support the highly dynamic traffic patterns of the current Internet in large-scale switches, we propose a new hybrid optical network design: Overspill Routing In Optical Networks (ORION). By taking advantage of the reduced (electronic) processing requirements of all-optical wavelength switching, the electronic bottleneck is relieved. At the same time, ORION achieves a level of statistical multiplexing comparable to the more traditional point to point WDM solutions, circumventing the bandwidth inefficiencies of all-optical wavelength switched networks, caused by dynamic traffic patterns. The result is a true hybrid optical network design, forming a bridge between these two switching concepts. In this paper the generic concept of ORION is described. An example node design, based on current advanced optical technologies, is described in detail. The ORION concept is also evaluated, comparing it with its two composing technologies, optical wavelength switching and point to point WDM, as well as a third, more trivial, hybrid one, through several case studies.     

Multicast routing and bandwidth dimensioning in overlay networks

Multicast services can be provided either as a basic network service or as an application-layer service. Higher level multicast implementations often provide more sophisticated features and can provide multicast services at places where no network layer support is available. Overlay multicast networks offer an intermediate option, potentially combining the flexibility and advanced features of application layer multicast with the greater efficiency of network layer multicast. In this paper, we introduce the multicast routing problem specific to the overlay network environment and the related capacity assignment problem for overlay network planning. Our main contributions are the design of several routing algorithms that optimize the end-to-end delay and the interface bandwidth usage at the multicast service nodes within the overlay network. The interface bandwidth is typically a key resource for an overlay network provider, and needs to be carefully managed in order to maximize the number of users that can be served. Through simulations, we evaluate the performance of these algorithms under various traffic conditions and on various network topologies. The results show that our approach is cost-effective and robust under traffic variations.