Multi-domain grooming algorithm based on hierarchical integrated multi-granularity auxiliary graph in optical mesh networks

With the size of traffic demands ranges from sub-wavelength-level to wavelength-level, traffic demands need to be aggregated and carried over the network in a cost-effective manner to make sure that the resources are utilized effectively. Therefore, the technique called multi-granularity grooming is proposed to save the cost by reducing the number of switching ports in optical cross-connects. However, the existing multi-granularity grooming algorithms are mostly limited in single-domain optical networks. Since the current optical backbone keeps enlarging and is actually divided to multiple independent domains for achieving the scalability and the confidentiality, it is necessary to study the multi-granularity grooming in multi-domain optical networks. In this paper, we propose a new heuristic algorithm called hierarchical multi-domain multi-granularity grooming (HMMG) based on hierarchical integrated multi-granularity auxiliary graph (H-IMAG) to reduce the total number of optical switching ports. The H-IMAG is composed of the inter-domain virtual topology graph (VTG) and the intra-domain integrated layered auxiliary graph (ILAG), where VTG includes a wavelength virtual topology graph (WVTG) and a waveband virtual topology graph (BVTG), and ILAG includes a wavelength layered auxiliary graph (WLAG) and a waveBand layered auxiliary graph (BLAG). Then, we can groom the sub-wavelength-level demands into lightpaths based on WVTG and WLAG and groom the wavelength-level demands into high-capacity wavebands based on BVTG and BLAG. Simulation results show that performances of H-IMAG can be significantly improved compared with previous algorithm.     

Survivable integrated grooming in multi-granularity optical networks

Survivability is an important issue to ensure the service continuity in optical network. At the same time, with the granularity of traffic demands ranging from sub-wavelength-level to wavelength-level, traffic demands need to be aggregated and carried over the network in order to utilize resources effectively. Therefore, multi-granularity grooming is proposed to save the cost and reduce the number of switching ports in Optical-Cross Connects (OXCs). However, current works mostly addressed the survivable wavelength or waveband grooming. Therefore, in this paper, we propose three heuristic algorithms called Multi-granularity Dedicated Protection Grooming (MDPG), Multi-granularity Shared Protection Grooming (MSPG) and Multi-granularity Mixed Protection Grooming (MMPG), respectively. All of them are performed based on the Survivable Multi-granularity Integrated Auxiliary Graph (SMIAG) that includes one Wavelength Integrated Auxiliary Graph (WIAG) for wavelength protection and one waveBand Integrated Auxiliary Graph (BIAG) for waveband protection. Numerical results show that MMPG has the lowest average port-cost, the best resource utilization ratio and the lowest blocking probability among these three algorithms. Compared with MDPG, MSPG has lower average port-cost, better resource utilization ratio and lower blocking probability.     

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.     

智能多粒度光交叉连接节点的设计与实现

提出了一种新型多粒度光交叉连接(MG-OXC)的体系结构,它可以完成光纤、波带、波长的交换,以及不同粒度业务的上下话路.同时介绍了由三个真实多粒度光交叉连接节点与若干虚拟光节点所组成的智能多粒度光网络试验平台的设计与实现.实验平台支持动态的可配置的网络拓扑、自动的邻居发现、受限的波长、波带路由,以及光层快速的保护与恢复.     

Multicast multi-granular grooming based on integrated auxiliary grooming graph in optical networks

In order to improve the bandwidth utilization efficiency and reduce the blocking probability for multicast requests in optical networks, the multicast traffic grooming approach was proposed to groom a lot of low-speed traffic to a few of high-speed light-trees. At the same time, in order to save the ports and the cost of optical cross-connect, the multicast waveband grooming approach was proposed to groom multiple light-trees to a few of waveband tunnels. However, the existing approaches all did not consider the joint performances of improving bandwidth utilization efficiency, reducing blocking probability and saving ports for multicast requests. Therefore, in this article, we propose a new multicast multi-granular grooming approach to perform the hierarchical sequential grooming to improve the joint performances based on a newly developed integrated auxiliary grooming graph (IAGG) that includes multiple wavelength integrated grooming graphs (WIGGs) and one waveband virtual topology layered graph (BVLG) to support both the multicast traffic grooming and multicast waveband grooming. In order to achieve the map of light-tree to the virtual topology layer in WIGG or BVLG, we present a light-segment map method, where a light-tree will be divided to several light-segments each of which will be independently mapped to the virtual topology layer. Since different definitions of blocking probability may lead to different objectives, we define two kinds of blocking probability, mean blocking probability of requests (MBPR) and mean blocking probability of users (MBPU). According to the two definitions of blocking probability, we propose two multicast multi-granular grooming heuristic algorithms, Heuristic Algorithm with minimizing MBPR and Heuristic Algorithm with minimizing MBPU based on IAGG. Simulation results show that the two proposed algorithms are both efficient and have better performances than traditional multicast grooming algorithm.     

A comprehensive study on next-generation optical grooming switches

This paper investigates the characteristics and performance of different optical grooming switches, i.e., optical cross-connects (OXCs) capable of traffic grooming, under a dynamic traffic environment. We present four optical grooming-OXC architectures, namely, single-hop grooming OXC, multihop partial-grooming OXC, multihop full-grooming OXC, and light-tree-based source-node grooming OXC. After exploring their grooming capabilities, we propose three grooming schemes and two corresponding algorithms, grooming using auxiliary graph and grooming using light-tree. Through the algorithms, we evaluate the performance of different optical grooming OXCs in a dynamic traffic environment under different connection bandwidth-granularity distributions. Our investigation uncovers the following results: (1) the multihop full-grooming OXC can achieve the best network performance, but it may encounter cost and scalability constraints; (2) by using significantly less low-granularity electronic processing and intelligent traffic-grooming algorithms, the multihop partial-grooming OXC shows reasonable network performance and, hence, can be viewed as a cost-effective alternative when a network node does not require full-grooming capability; (3) the single-hop grooming OXC may cause a large amount of capacity waste and lead to poor network performance; and (4) through its multicast capability, a light-tree-based source-node grooming OXC can significantly out-perform the performance of a single-hop grooming OXC in terms of network throughput and network resource efficiency. From our results, we also observe that the connection bandwidth-granularity distribution has a large impact on network throughput and network resource efficiency and, therefore, should be carefully considered for network design and traffic provisioning.     

A novel domain-by-domain survivable mechanism in multi-domain wavelength-division-multiplexing optical networks

In multi-domain wavelength-division-multiplexing (WDM) optical networks, the inter-domain routing is a challenge since each single-domain cannot view the full network topology. At the same time, survivability is also an important issue in optical networks since the failures of fiber links or network nodes may lead to a lot of traffic being blocked. In this paper, we study the survivability in multi-domain WDM optical networks, and propose a new survivable mechanism called load balanced domain-by-domain routing (LBDDR). In LBDDR, in order to obtain the efficient inter-domain survivable routes, we present the domain-by-domain routing (DDR) method which can find the intra-domain sub-working path and sub-backup path in each single-domain to form the inter-domain working path and backup path for each demand. In order to reduce the blocking probability, we present the load balanced routing method which can encourage the traffic to be uniformly distributed on the links with more free wavelengths. Simulation results show that, compared with conventional mechanism, LBDDR can obtain better performances.     

Waveband switching in optical networks

The rapid advances in dense wavelength-division multiplexing technology with hundreds of wavelengths per fiber and worldwide fiber deployment have brought about a tremendous increase in the size (i.e., number of ports) of photonic cross-connects, as well as in the cost and difficulty associated with controlling such large cross-connects. Waveband switching (WBS) has attracted attention for its practical importance in reducing the port count, associated control complexity, and cost of photonic cross-connects. We show that WBS is different from traditional wavelength routing, and thus techniques developed for wavelength-routed networks (including, for example, those for traffic grooming) cannot be directly applied to effectively address WBS-related problems. We describe two multigranular OXC architectures for WBS. By using the multilayer MG-OXC in conjunction with intelligent WBS algorithms for both static and dynamic traffic, we show that one can achieve considerable savings in the port count. We also present various WBS schemes and lightpath grouping strategies, and discuss issues related to waveband conversion and failure recovery in WBS networks.     

A new waveband switching method for reducing the number of ports in wavelength-division-multiplexing optical networks

In this paper, we investigate the waveband switching technique and consider the problem of reducing the number of ports in optical cross-connects in wavelength-division-multiplexing optical networks. The basic idea of waveband switching is to bind several wavelengths into one waveband which can be switched by only one port so that the switches in conventional wavelength routed networks can be reduced and the cost of optical cross-connects can be saved. Since the traditional waveband switching schemes are the simple shortest route approach and the obtained paths may not be the optimal disposals for merging waveband, we propose a new heuristic waveband switching routing method. In our proposed method, we use the k-shortest path algorithm and the rerouting approach to optimize the number of ports in optical cross-connects. Simulation results show that, compared with the traditional algorithm that does not consider the waveband switching technique, the performance improvement of our proposed method is significant and promising.     

WDM对终端业务和高层协议的影响

主要从基于 WDM网络的网络层及其高层出发 ,描述了以下问题 :业务准备算法以便最小化电复用的代价 ;波长分配算法 ;光层和电层联合保护和恢复 ;光网络拓扑对高层协议 ,如 IP选路、TCP流量控制和多层交换对光网络拓扑的影响。     

N × N optical cross-connect based on tunable fibre Bragggratings with high channel scalability

A highly channel-scalable N × N optical cross-connect (OXC) based on tunable fibre Bragg gratings is proposed. The channel scalability of the proposed OXC is owing to cascadability of individual routing modules which perform routing only for specified wavelength channels. The routing function of a 3 × 3 routing block of the proposed OXC using four OC-192 channels with a channel spacing of 0.8 nm is demonstrated, as is the upgradability of the number of ports and wavelength channels     

A new integrated auxiliary graph based routing algorithm in waveband switching optical networks

In this letter, we propose a new routing algorithm based on integrated auxiliary graph (RA-IAG) to reduce switching ports in waveband switching optical networks. The IAG is compared of a single virtual topology layer (VTL) and multiple waveband-plane layers (WPLs). For each demand, RA-IAG first computes a single-hop or multi-hop route on VTL. If the route cannot be found on VTL, RA-IAG then computes a hybrid multi-hop route by jointing VTL and WPLs. Simulation results show that, compared with previous algorithm, RA-IAG can obtain better performance.     

多粒度动态光交换结构及其波带疏导算法

针对提高交叉连接器端口效率问题,进行了线性规划探讨.采用了一种新型的多粒度光交换结构并提出了一种动态波带疏导算法,对波长资源进行动态分配,并选择NSFNet拓扑进行仿真,仿真结果表明,算法不仅可以减少多粒度交叉连接端口数,同时还可以有效地降低阻塞率,提高网络资源的利用率.     

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.     

Performance analysis and dimensioning of multi-granular optical networks

Recent years have demonstrated the limited scalability of electronic switching to realize transport networks. In response, all-optical switching has been identified as a candidate solution to enable high-capacity networking in the future. One of the fundamental challenges is to efficiently support a wide range of traffic patterns, and thus emerges the need for equipment that is both practical and economical to construct and deploy. We have previously proposed the use of multi-granular optical cross-connects (MG-OXC), which support switching on both the wavelength and sub-wavelength level. To this end, the MG-OXCs are equipped with cheap, highly scalable slow switching fabrics, as well as a small number of expensive fast switching ports. The goal of this work is two-fold: first to demonstrate that a small number of fast switching ports suffices to support a wide range of traffic requirements, and second that multi-granular optical switching can offer cost-benefits on a network-wide scale. The first objective is studied through simulation analysis of a single switching node, and results indicate that a limited number of fast switching ports can significantly improve burst blocking performance over slow only switches. Furthermore, under certain circumstances, the MG-OXC can even approach the performance of a fast only switch design. Secondly, we introduce an Integer Linear Programming model for the total network installation cost, and our evaluation indicates that multi-granular optical switching can be a cost-effective solution on the network level, in comparison to slow only or fast only approaches. Furthermore, we can achieve reduced costs of individual OXC nodes, which allows us to minimize scalability problems corresponding to emerging fast switching fabrics.     

The role of switching in reducing the number of electronic ports in WDM networks

We consider the role of switching in minimizing the number of electronic ports [e.g., synchronous optical network (SONET) add/drop multiplexers] in an optical network that carries subwavelength traffic. Providing nodes with the ability to switch traffic between wavelengths, such as through the use of SONET cross-connects, can reduce the required number of electronic ports. We show that only limited switching ability is needed for significant reductions in the number of ports. First, we consider architectures where certain "hub" nodes can switch traffic between wavelengths and other nodes have no switching capability. For such architectures, we provide a lower bound on the number of electronic ports that is a function of the number of hub nodes. We show that our lower bound is relatively tight by providing routing and grooming algorithms that nearly achieve the bound. For uniform traffic, we show that the number of electronic ports is nearly minimized when the number of hub nodes used is equal to the number of wavelengths of traffic generated by each node. Next, we consider architectures where the switching ability is distributed throughout the network. Such architectures are shown to require a similar number of ports as the hub architectures, but with a significantly smaller "switching cost." We give an algorithm for designing such architectures and characterize a class of topologies, where the minimum number of ports is used. Finally, we provide a general upper bound on the amount of switching required in the network. For uniform traffic, our bound shows that as the size of the network increases, each traffic stream must be switched at most once in order to achieve the minimum port count.     

A novel Topology Aggregation approach for shared protection in multi-domain networks

Routing for shared protection in multi-domain networks is more difficult than that in single-domain networks because of the scalability requirements. We propose a novel approach for shared protection routing in multi-domain networks where the key feature is a special Topology Aggregation. In this Topology Aggregation, only some potential intra-domain paths (intra-paths for short) are selected for carrying working and backup traffic between domain border nodes. The abstraction of each intra-path to a virtual edge makes the original multi-domain network to become an aggregated network. On the aggregated network, a single-domain routing algorithm for shared protection can be applied for obtaining the complete routing solutions. The experiments show that the proposed approach is scalable. Moreover it is close to the optimal solution in single-domain networks and outperforms the previously proposed scalable solutions in multi-domain networks.     

Hybrid-hierarchical optical path network design algorithms utilizing ILP optimization

In this paper, we present design algorithms for the hierarchical optical path networks that utilize hybrid-hierarchical optical cross-connects (hybrid-HOXCs). The hybrid-HOXCs employ a waveband cross-connect for routing waveband paths and an electrical cross-connect for grooming wavelength paths. We first develop an integer linear programming model to solve the network design problem. We then propose a 2-stage ILP-based design algorithm for hierarchical optical path networks that utilize the hybrid-HOXCs. Its effectiveness is evaluated through numerical experiments. Impact of the critical parameter, electrical/optical port cost ratios, on total network cost is also investigated.     

静态波带交换中的一种波带粒度取值算法

波带交换可以有效地减少波长交换的交换端口数量,本文研究节点间业务量已知时静态波带交换中的波带粒度取值算法,提出了基于k均值聚类的波带粒度取值算法。算法将业务量相近的业务分为一组,一组内的业务用相同粒度的波带装载,以提高波带的利用率。研究表明,在没有业务疏导的环境下,与其他方法相比,算法使用的波带数量和波带内的空闲波长数量都比较少。本文还研究了静态疏导环境下不同波带粒度取值算法的性能,提出了多波带粒度下的业务装载策略。对于大粒度的波带,使用向下装载,而对于小粒度的波带,使用向上装载,意在减少波带的使用数量的同时提高波带利用率。仿真结果表明,使用静态业务疏导后,本文算法与其他方法相比,依然可以有效地减少波带数量,提高波带利用率。与基于组播路由的静态波带疏导算法相结合,使波带利用率可以达到98%以上。     

Evaluation of amount of equipment on single-layer optical path networks managing multigranularity optical paths

The authors propose novel nongrooming, optical path cross-connect (OXC), single-layer optical path (OP) networks that can route multigranularity optical paths with reduced optical switch (OSW) size. Since the multigranularity OPs are handled in one OP layer, the configuration and path administration of the OXCs become simple. The authors evaluate the network topology dependency of the network elements, i.e., the required number of OSW ports and fibers in networks consisting of 36 fixed nodes with different network topologies as well as that of a 16-OXC, 25-link NSFNET. The proposed networks require 60% fewer OSW ports, enabling efficient link resource utilization. A 60% reduction in total network cost is also confirmed.