Traffic Grooming Scheme Research Articles

Traffic grooming with greedy-based priority routing and wavelength assignment for passive optical networks

Abstract Today, in passive optical networks (PON) the major issue is call blocking and it is getting worse as there is an increase in the number of connection requests but the wavelength channels in fiber links are limited. In this research, greedy-based priority routing and wavelength assignment traffic grooming (GPRWATG) technique is proposed aimed at reducing call blockage. In this scheme, to avoid optical–electrical–optical correspondence, firstly the grooming of connection requests with same source destination (s–d) is performed. According to the priority of these groomed connection requests, wavelength assignment and routing is assigned. This approach not only addresses the call blocking issue but also aligns with industry demands for improved network infrastructure. The proposed work performance is analyzed for blocking probability (BP), congestion, and its performance is compared with the non-priority-based routing and wavelength assignment traffic grooming (NPRWATG) and priority-based routing and wavelength assignment traffic grooming (PRWATG) schemes. The proposed method has 23.6 % lower congestion as compared to PRWATG and 21 % lower congestion as compared to NPRWATG. Also, the BP of GPRWATG is 26 % less than PRWATG and 21 % less than NPRWATG. Thus, it can be analyzed that by using the proposed technique, the BP as well as the congestion of the network altogether is reduced in comparison to the existing state-of-art techniques.

Enhancement of failure independent path protection preconfigured cycles for electric power communication networks

For the purpose of improving the resources utilization efficiency and decrease network redundancy of electric power communication network (EPCN), the paper explores using failure independent path protection preconfigured cycle (FIPP p-Cycle) to provide backup paths for electric communication service and presents a protection algorithm of enhanced FIPP p-Cycle with traffic grooming (EFIPP-TG). Firstly, the multiplexing conditions of FIPP p-Cycle are analyzed specifically, and we propose a FIPP p-Cycle multiplexing algorithm to improve the utilization efficiency of backup resources. Then segment protection algorithm for working path is designed to decrease service blocking ratio as much as possible. In addition, by taking advantage of traffic grooming strategy, the routing paths of services are optimized, yielding effective decrease of network blocking probability. Simulation results from different topologies demonstrate that compared with traditional FIPP p-Cycle scheme, other p-Cycle based protection algorithms and shared backup path protection algorithm, the proposed EFIPP-TG algorithm can significantly reduce the redundancy and blocking probability of networks, shorten the length of backup path and hence improve the reliability of service and performance of network survivability.

Anycast Service Grooming Algorithm of Cloud Computing Based on Wireless Communication Network

In order to improve the energy efficiency of optical interconnection network between data centers, a hybrid path transmission energy-saving routing algorithm with service duration awareness is proposed for Anycast service. In order to reduce the number of new optical path and working components, single path transmission is preferred; If the traffic is blocked, the transmission energy consumption is minimized. In addition, the traffic grooming strategy based on spectrum reservation is introduced to reduce the cost of protecting bandwidth and optical transceiver. Simulation results show that: compared with the traditional energy-saving routing algorithm, the proposed algorithm can significantly reduce the network energy consumption, effectively avoid the excessive increase of traffic blocking rate, and achieve the balance of network energy consumption and performance.

AI-assisted intent-based traffic grooming in a dynamically shared 5g optical fronthaul network.

The extremely high number of services with large bandwidth requirements and the increasingly dynamic traffic patterns of cell sites pose major challenges to optical fronthaul networks, rendering them incapable of coping with the extensive, uneven, and real-time traffic that will be generated in the future. In this paper, we first present the design of an adaptive graph convolutional network with gated recurrent unit (AGCN-GRU) network to learn the temporal and spatial dependencies of traffic patterns of cell sites to provide accurate traffic predictions, in which the AGCN model can capture potential spatial relations according to the similarity of network traffic patterns in different areas. Then, we innovatively consider how to deal with the unpredicted burst traffic and propose an AI-assisted intent-based traffic grooming scheme to realise automatic and intelligent cell sites clustering and traffic grooming. Finally, a software-defined testbed for 5G optical fronthaul network was established, on which the proposed schemes were deployed and evaluated by considering traffic datasets of existing optical networks. The experimental results showed that the proposed scheme can optimize network resource allocation, increase the average efficient resource utilization and reduce the average delay and the rejection ratio.

Energy-Saving in IP Over WDM Networks by Putting Protection Router Cards to Sleep

Energy saving is of great interest in current information and communications technology applications. In this paper, we consider energy saving for an IP over wavelength division multiplexed (WDM) optical network by putting protection router cards to sleep when the network is operating normally. Doing this requires that we must jointly consider several aspects. These are multi-layer traffic grooming, network protection, and the assignment of router ports/cards for working and protection optical channels. By employing different network protection techniques and the multi-hop traffic grooming strategy, we develop mixed integer linear programming (MILP) models for the optimization problem by considering five different router port assignment schemes. These aim to minimize the total power consumption of the whole network. Subsequently, to tackle the computational difficulty of the MILP models, we propose an efficient heuristic algorithm to handle large networks. This heuristic algorithm consists of two steps, i.e., survivable traffic grooming and router port assignment. Results show that the proposed energy-saving strategy is efficient and can significantly reduce the total power consumption of an IP over WDM network, where the assignment strategy for router cards is of primary importance for energy-saving efficiency. We also observe that the proposed heuristic algorithm performs almost as well as the MILP models in terms of the energy efficiency of the system.

Mixed Channel Traffic Grooming for IP Over EON with SBPP-Based Cross-Layer Protection

We consider mixed channel traffic grooming in a shared backup path protected IP over elastic optical network (EON) and develop an auxiliary graph-based heuristic algorithm to share common optical channels between working and protection IP traffic flows. We compare integrated protection (i.e., cross-layer protection capacity sharing) with nonintegrated protection (i.e., overlay protection) to show how cross-layer sharing improves capacity utilization. Using simulations, network performance is evaluated in terms of the maximum number of frequency slots (FSs) used, the spare capacity redundancy, and the number of transponders required for a static traffic demand. For a dynamic traffic demand, the bandwidth blocking probability (BBP) is also obtained. It is found that the proposed mixed channel traffic grooming scheme can reduce both the BBP and the number of transponders required while improving the spectral efficiency compared to a system using dedicated channel traffic grooming. Integrated protection is also found to be more efficient than overlay protection under comparable conditions. We also observe that only a limited number of transponders per node and a limited number of FSs per transponder are sufficient to achieve good performance for an IP over EON with mixed channel traffic grooming and cross-layer spare capacity sharing.

Energy-efficient multicast traffic grooming strategy based on light-tree splitting for elastic optical networks

Abstract In order to address the problem of optimizing the spectrum resources and power consumption in elastic optical networks (EONs), we investigate the potential gains by jointly employing the light-tree splitting and traffic grooming for multicast requests. An energy-efficient multicast traffic grooming strategy based on light-tree splitting (EED-MTGS-LS) is proposed in this paper. Firstly, we design a traffic pre-processing mechanism to decide the multicast requests’ routing order, which considers the request’s bandwidth requirement and physical hops synthetically. Then, by dividing a light-tree to some sub-light-trees and grooming the request to these sub-light-trees, the light-tree sharing ratios of multicast requests can be improved. What’s more, a priority scheduling vector is constructed, which aims to improve the success rate of spectrum assignment for grooming requests. Finally, a grooming strategy is designed to optimize the total power consumption by reducing the use of transponders and IP routers during routing. Simulation results show that the proposed strategy can significantly improve the spectrum utilization and save the power consumption.

An auxiliary graph based dynamic traffic grooming algorithm in spatial division multiplexing enabled elastic optical networks with multi-core fibers

Abstract A proper traffic grooming strategy in dynamic optical networks can improve the utilization of bandwidth resources. An auxiliary graph (AG) is designed to solve the traffic grooming problem under a dynamic traffic scenario in spatial division multiplexing enabled elastic optical networks (SDM-EON) with multi-core fibers. Five traffic grooming policies achieved by adjusting the edge weights of an AG are proposed and evaluated through simulation: maximal electrical grooming (MEG), maximal optical grooming (MOG), maximal SDM grooming (MSG), minimize virtual hops (MVH), and minimize physical hops (MPH). Numeric results show that each traffic grooming policy has its own features. Among different traffic grooming policies, an MPH policy can achieve the lowest bandwidth blocking ratio, MEG can save the most transponders, and MSG can obtain the fewest cores for each request.

Energy-Aware Algorithms for IP Over WDM Optical Networks

To date, the main limitation to the development of telecom networks mainly depended on two factors, namely the cost of the network equipment and transmission. However, nowadays, the enormous spread and growth of the Internet has resulted in a significant increase in the energy consumption of the network equipment. Particularly, the rise in Internet traffic has led to both the increase of the amount of required equipment and the augmentation of energy consumption of such network devices. Consequently, CapEx and OpEx of modern telecommunication networks render the market penetration of such deployment laborious. This surge in power consumption may ultimately lead to an impediment to this continued growth. Since climate change and environmental protection are also of rising concern, many research efforts are being made to raise awareness of environmental issues and reduce the energy footprint of telecommunication networks. In this context, this study targets the reduction of the energy consumption of an IP over WDM backbone network. Already known lightpath bypass and traffic grooming strategies have been used. Although previously proposed schemes based on lightpath bypass approaches and traffic grooming capabilities have been implemented and consequently are able to reduce the overall power consumption of an optical core network, they do not bear in mind, first, the number of the established lightpaths in the virtual topology and second, the exploitation of the residual capacity of the existing lightpaths. This study overcomes the above drawbacks by introducing three novel heuristic schemes which manage to significantly lower the number of the established lightpaths in the virtual topology and take advantage of the remaining capacity of the optical paths by exploiting the lightpaths’ resources in a more efficient way. These power-aware heuristics will focus on energy efficiency issues related to the planning and the operation phase of a WDM optical network. Extensive simulation results indicate a promising performance improvement in terms of power consumption when these proposed heuristics are compared to similar, already developed, techniques for energy saving.

Dynamic traffic grooming with Spectrum Engineering (TG-SE) in flexible grid optical networks

Flexible grid has emerged as an evolutionary technology to satisfy the ever increasing demand for higher spectrum efficiency and operational flexibility. To optimize the spectrum resource utilization, this paper introduces the concept of Spectrum Engineering in flex-grid optical networks. The sliceable optical transponder has been proposed to offload IP traffic to the optical layer and reduce the number of IP router ports and transponders. We discuss the impact of sliceable transponder in traffic grooming and propose several traffic-grooming schemes with Spectrum Engineering (TG-SE). Our results show that there is a tradeoff among different traffic grooming policies, which should be adopted based on the network operator’s objectives. The proposed traffic grooming with Spectrum Engineering schemes can reduce OPEX as well as increase spectrum efficiency by efficiently utilizing the bandwidth variability and capability of sliceable optical transponders.

A Static Traffic Grooming Scheme for IP over WDM Optical Internet

In order to improve the bandwidth utilization of IP over WDM (Wavelength Division Multiplexing) optical Internet, a static traffic grooming scheme was proposed by introducing the knowledge of fuzzy mathematics and microeconomics. It introduced the user traffic request delay satisfaction degree and the network relative cost. With the help of gaming analysis and layered graph, based on predatory search algorithm (PSA), it tried to find the optimal grooming solution with the comprehensive user QoS (Quality of Service) satisfaction degree maximized and the network relative cost minimized. It was simulated over actual network topologies and its performance was compared with certain existing traffic grooming scheme. Simulation results have shown that it is both feasible and effective with better performance.

Hierarchical traffic grooming: A tutorial

Traffic grooming is concerned with the design, operation, and control of networks with multigranular bandwidth demands. As the number of resources in a multigranular network increases rapidly with the network size, wavelength capacity, and load, a scalable framework for managing these entities becomes essential. Hierarchical traffic grooming facilitates the control and management of multigranular WDM networks. In this paper, we present a survey of traffic grooming schemes for optical networks that make use of architectures, algorithms and design techniques that impose a hierarchical structure on the network topology.

Traffic Grooming and QoS Management over OLS Networks

Optical label switching (OLS) has been proposed as promising technology for providing seamless integration of data transmission and optical networking while supporting data burst and packet handling using label paradig m. The current status of OLS technology can insure fast switching, contention resolution and QoS provision. The main issue in OLS networks is how to improve network efficiency according to traffics requirements, since resources managing and traffic trans mission are fundamental criteria that can influence the networking platform design. Imp roving network efficiency in OLS networks can be achieved using grooming traffic along transmission path or Label Switching Path (LSP) for providing a balance between resources allocation and utilizat ion. In this paper, we proposed a real-t ime traffic groo ming scheme through the use of an upgraded OLS core node architecture that can efficiently integrate several input traffics on the unique output port. The proposed scheme tries to increase the usage of the available resources in terms of Optical Delay Line (ODL) and wavelength conversion. This scheme introduces a new label switching framework that transports the requested information for handling suitably the grooming procedure, especially traffic requirements and real-time reachable resources. In addit ion, the p roposed scheme perfo rms a set of advanced functions including signaling tasks, resources allocation and utilizat ion mechanisms as well as dynamic QoS management. Finally, theoretical model and simu lation work will be conducted in order to validate our proposal and evaluate its performances and effectiveness.

Resource efficient network design and traffic grooming strategy with guaranteed survivability

In WDM networks, path protection has emerged as a widely accepted technique for providing guaranteed survivability of network traffic. However, it requires allocating resources for backup lightpaths, which remain idle under normal fault-free conditions. In this paper, we introduce a new design strategy for survivable network design, which guarantees survivability of all ongoing connections that requires significantly fewer network resources than protection based techniques. In survivable routing, the goal is to find a Route and Wavelength Assignment (RWA) such that the logical topology remains connected for all single link failures. However, even if the logical topology remains connected after any single link fault, it may not have sufficient capacity to support all the requests for data communication, for all single fault scenarios. To address this deficiency, we have proposed two independent but related problem formulations. To handle our first formulation, we have presented an Integer Linear Program (ILP) that augments the concept of survivable routing by allowing rerouting of sub-wavelength traffic carried on each lightpath and finding an RWA that maximizes the amount of traffic that can be supported by the network in the presence of any single link failure. To handle our second formulation, we have proposed a new design approach that integrates the topology design and the RWA in such a way that the resulting logical topology is able to handle the entire set of traffic requests after any single link failure. For the second problem, we have first presented an ILP formulation for optimally designing a survivable logical topology, and then proposed a heuristic for larger networks. Experimental results demonstrate that this new approach is able to provide guaranteed bandwidth, and is much more efficient in terms of resource utilization, compared to both dedicated and shared path protection schemes.

A Novel Static Traffic Grooming Algorithm Based on Steady Elimination Evolutionary and Gaming

In this paper, we propose a static traffic grooming method, where both wavelength layered graph and evaluation function are deployed with the objective of maximizing Quality of Service (QoS) satisfaction degree of user and minimizing comparative cost of IP over WDM optical networks, based on Steady Elimination Evolutionary Algorithm (SEEA) and gaming. Using proposed novel hybridization operation and evolutional strategy with the consideration of individual diversity in niche population, our method can eliminate the worst individual in the current niche population and generate optimized traffic grooming program. Our method has been analyzed and compared with the other traffic grooming schemes on the realistic network topologies in our simulations. Simulation results have demonstrated that our method outperforms state-of-the-art grooming schemes, which is highly feasible and effective.

Novel path computation element-based traffic grooming strategy in Internet protocol over wavelength division multiplexing networks

With the emergence of various broadband services, a lot of bandwidth fragments will be generated during the operation of services being mapped into optical channels, which will waste too many bandwidth resources and decrease the transmission performance of optical networks. Traffic grooming strategy in dynamic optical networks can optimise the utilisation of bandwidth resources and reduce the blocking probability. However, in the distributed control plane of automated switched optical networks, all the traffic grooming strategies are implemented in each control node, and resource collision will still occur because the same link resource may be used by two path computation requests or traffic engineering information flooded by open shortest path first-traffic engineering protocol may be not synchronous at each control node or signalling delay time is too long. To reduce the collision of resource, a unified control plane is designed based on path computation element (PCE) for Internet protocol over wavelength division multiplexing networks, and a novel PCE-based traffic grooming strategy is proposed in the framework of unified control plane. Based on this strategy, four PCE-based traffic grooming algorithms are proposed and compared with the distributed traffic grooming strategy without PCE on a simulation platform implemented using disperse event simulation tool OMNET++.

On path-level traffic grooming strategies in WDM metro optical networks

This article provides an overview of some of the optical grooming (aggregation) techniques that have been developed recently with IP as the client layer. We identify four kinds of aggregation strategies: point to point (P2P), point to multipoint (P2MP), multipoint to point (MP2P), and multipoint to multipoint (MP2MP). Using an auxiliary graph-based model, we evaluate the performance of these four strategies for singlehop and multihop scenarios that aggregate at the path level. In the case of partial mesh networks with dynamic traffic, we observe the following: MP2MP outperforms other architectures by multiple orders of magnitude in single-hop scenarios; P2P performs best in multihop transceiver-constrained scenarios; and P2MP performs the best in multihop wavelength-constrained scenarios.

Optical Burst Transport: A Technology for the WDM Metro Ring Networks

We propose a sublambda traffic-grooming scheme on wavelength-division-multiplexing ring networks, named optical burst transport. The network protocol and architecture are designed to support dynamic bandwidth allocation, which is more reasonable for bursty data traffic. To verify our network protocol and architecture, we build a testbed which supports burst-mode transmission. Also, we transmit streaming video over Ethernet as an application

Destination-redundancy-allowed dynamic single-hop multicast traffic grooming in wavelength division multiplexing mesh networks

A destination-redundancy-allowed multicast traffic grooming scheme is proposed to increase grooming probability in single-hop multicast traffic grooming. The proposed scheme achieves higher grooming gain in comparison with the normal scheme.

Traffic grooming on WDM rings using optical burst transport

A sublambda traffic-grooming scheme on wavelength-division-multiplexed (WDM) rings, which is called optical burst transport (OBT), is proposed. The network protocol and architecture allow increased flexibility to tailor the transport network behavior for efficient delivery of bursty data traffic. Using different network parameters, its performance is analyzed via simulation, and the implementation issues including the media-access-control (MAC) protocol, tunable-filter controller, and burst-mode receiver are addressed. Finally, the feasibility of the OBT with an experimental testbed built by the authors is demonstrated and a streaming-video application is used to present its overall functionality.