Static Traffic Grooming Research Articles

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.

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.

Energy-Efficient Traffic Grooming in WDM Networks With Scheduled Time Traffic

In this paper, we investigate both static and dynamic traffic grooming problems in a wavelength routing network, so as to minimize the total energy consumption of the core network, with the additional consideration of the holding times of the lightpaths and connection requests. In the static case, all connection requests with their setup and tear-down times are known in advance. We formulate an integer linear programming to minimize the energy consumption. In the dynamic case, we adopt a layered graph model called grooming graph and propose a new traffic grooming heuristics called time-aware traffic grooming, which takes the holding time of a new arrival connection request and the remaining holding time of existing lightpaths into consideration. We compare different traffic grooming policies, in terms of the energy efficiency, under various traffic loads. The results provide implications to select the most energy-efficient traffic grooming policies under various scenarios.

Traffic grooming, routing, and wavelength assignment in an optical WDM mesh networks based on clique partitioning

In wavelength routed optical networks, the number of wavelength channels is limited due to several constraints and each wavelength as well as each lightpath support traffic in the Gbps range. On the other hand, the traffic requested by an individual connection is still in the Mbps range. Therefore, to utilize the network resources (such as bandwidth and transceivers) effectively, several low-speed traffic streams have to be efficiently groomed or multiplexed into one or more high-speed lightpaths. The grooming problem of a static demand is considered as an optimization problem. In this work, we have investigated the traffic grooming problem with the objective of maximizing the network throughput for wavelength-routed mesh networks and map this problem to the clique partitioning problem. We have proposed an algorithm to handle general multi-hop static traffic grooming based on the clique partitioning concept. The efficiency of our approach has been established through extensive simulation on different sets of traffic demands with different bandwidth granularities for different network topologies and compared the approach with existing algorithms.

Genetic evolutionary algorithm for static traffic grooming to SONET over WDM optical networks

In recent years, minimization of SONET-ADMs (Synchronous Optical NETwork-Add-Drop Multiplexers) in WDM (Wavelength Division Multiplexing) optical networks has gained a lot of attention in both the research and commercial arenas. This motivates the research presented in this article. The enhanced searching capability of genetic evolutionary algorithm has been exploited for this purpose. The individuals (chromosomes) have been represented by different sequence of the calls in the traffic matrix. A simple algorithm that minimizes the number of required ADMs based on the shortest path and a possible alternate shortest path has been applied. Some good chromosomes based on some intuitive reasoning have been introduced in the initial population to enhance the convergence of the proposed genetic evolutionary algorithm. The distinguished feature of the proposed algorithm is in introducing the catalyst to direct the convergence of genetic evolutionary algorithm towards its solution. However, the catalyst has been kept small enough to be able to bias the solution. To establish the effectiveness of the proposed algorithm, the simulation results are compared with that of presented in literature with same network configuration and traffic matrix.

A heuristic solution to SONET ADM minimization for static traffic grooming in WDM uni-directional ring networks

In recent years, minimization of add-drop multiplexers (ADMs) in wavelength division multiplexing (WDM) optical networks has gained lots of attention in both the research and commercial areas. This motivates the research presented in this paper. A heuristic algorithm is formulated for static traffic grooming in WDM uni-directional ring networks with an eye to minimize the number of required ADMs. The distinguished feature of the proposed heuristic is that it pairs up the calls of a given static traffic to approach the solution. The proposed heuristic is compared with the previous approach with same network configuration and traffic matrix to establish its effectiveness.

A network flow approach for static and dynamic traffic grooming in WDM networks

In WDM networks , traffic grooming is a fundamental and important operation for aggregating multiple low-rate channels from the end users into a high-rate wavelength channel . In the literature, several traffic grooming problems were formulated where the common objective is to minimize the number of add-drop multiplexers required, and each of these problems was solved by specific algorithms. In this paper, we propose a network flow approach for solving a class of static and dynamic traffic grooming problems. In this approach, we transform a traffic grooming problem onto the minimum edge-cost flow problem through proper graph transformation and assignment of edge weights, and then solve this resulting network flow problem by an efficient heuristic algorithm . The network flow approach has two main advantages: (1) It is generally applicable to many static and dynamic traffic grooming problems. It can solve some existing traffic grooming problems as well as new problems that cannot be solved by the existing algorithms. (2) It performs at least as good as the best existing algorithm for static traffic grooming and significantly outperforms the existing algorithms for dynamic traffic grooming.