Energy-efficient Traffic Grooming Under Sliding Scheduled Traffic Model for IP over WDM Optical Networks

In this paper,we investigate on the problem of energy-efficient traffic grooming under sliding scheduled traffic model for IP over WDM optical networks,so as to minimize the total energy consumption of the core network.We present a two-layer auxiliary graph model and propose a new energyefficient traffic grooming heuristic named Two-Dimension Green Traffic Grooming(TDGTG) algorithm,which takes both space and time factors into consideration for network energy efficiency.We compare our proposed TDGTG algorithm with the previous traffic grooming algorithms for scheduled traffic model in terms of total energy consumption and blocking probability.The simulation results in three typical carrier topologies show the efficiency of our proposed TDGTD algorithm.

A traffic model of optical networks based on time-space complexity and traffic grooming

This paper researched the traffic of optical networks in time-space complexity,proposed a novel traf-fic model for complex optical networks based on traffic grooming,designed a traffic generator GTS(gener-ator based on time and space)with 'centralized+distributed' idea,and then made a simulation in Clanguage.Experiments results show that GTS can produce the virtual network topology which can changedynamically with the characteristic of scaling-free network.GTS can also groom the different traffic andtrigger them under real-time or scheduling mechanisms,generating different optical connections.Thistraffic model is convenient for the simulation of optical networks considering the traffic complexity.

Combined Analysis of Cost and Traffic Grooming Policies for Hybrid Networks Under Dynamic Traffic Requests

The benefit of a two-layer hybrid IP/MPLS （multi-protocol label switching） over a wavelength division multiplexing network has been analyzed considering both the cost and different grooming policies. A detailed cost and performance analysis of hybrid networks is done for three different grooming policies. The hybrid network cost is compared with that of an opaque network for equal traffic demand and equal blocking probability of dynamic requests of label switched paths. An algorithm is given to design optimum hybrid nodes for different grooming policies to provide the desired blocking probability for a given number of dynamic connection requests. The results show that all three applied grooming policies （IP layer first, optical layer first, and one hop first） result in lower costs of the hybrid network architecture than for the opaque network. In addition, an adaptive one hop first method is given to improve the best of the applied grooming policies, which limits grooming in heavily loaded hybrid nodes to achieve load balancing. The simulation resuits show that the new policy significantly reduces the overall blocking probability.

Dynamic multicast traffic grooming in WDM networks

Dynamic multicast traffic grooming in wave-length division multiplexing(WDM)networks was analyzed to minimize networkwide costs and to increase the network resource utilization.A network model was developed for dynamic multicast traffic grooming with resource constraints and an algorithm that can provide quality of service(QoS)was proposed.The QoS is measured by the maximum number of lightpaths passing between the source and the destinations.The blocking probability of the algorithm was assessed in simulations.The results show that a higher QoS requirement results in higher blocking probability,and when the QoS requirement is low,changes in the QoS require-ments have only small effects on the blocking probability.

A Routing Algorithm in WDM Mesh Networks with Grooming Capacities

Most of the work in traffic grooming has been in the area of providing efficient network designs in Wavelength division multiplexing （WDM）. The objective of these traffic grooming algorithms is to reduce the cost of overall networks. In this paper, a routing algorithm based on transiently chaotic neural network is proposed to solve the problem in WDM logical topology. The objectives of the routing algorithm are ac commodating all traffic requirements and using less network resource. The simulation shows that the proposed algorithm is efficient in the routing selection, meanwhile the algorithm can use less network resource.

Network Resource Provisioning for IP over Multi-Granular Optical Networks

In the internet protocol（IP） over multi-granular optical switch network （IP/MG-OXC）, the network node is a typical multilayer switch comprising several layers, the IP packet switching （PXC） layer, wavelength switching （WXC） layer and fiber switching （FXC） layer. This network is capable of both IP layer grooming and wavelength grooming in a hierarchical manner. Resource provisioning in the multi-granular network paradigm is called hierarchical grooming problem. An integer linear programming （ILP） model is proposed to formulate the problem. An iterative heuristic approach is developed for solving the problem in large networks. Case study shows that IP/MG-OXC network is much more extendible and can significantly save the overall network cost as compared with IP over wavelength division multiplexing network.