Algorithm for traffic grooming in optical networks to minimize the number of transceivers

Konda, V.R.; Chow, Timothy Y.

doi:10.1109/hpsr.2001.923635

Cited by 116 publications

(97 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Then, for each group of two matrices, a matrix that weakly dominates both is calculated. This is done by using the relaxed version of formulation (2). For the MH-VTD-VRu problem, weak domination with respect to unsplittable flows is used.…”

Section: Methods 2: Hierarchical Calculation Of the Weakly Dominating mentioning

confidence: 99%

See 1 more Smart Citation

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

et al. 2009

View full text Add to dashboard Cite

This paper addresses the problem of finding a static virtual topology design and flow routing in transparent optical WDM networks under a time-varying (multi-hour) traffic demand. Four variants of the problem are considered, using fixed or dynamically adaptable (i.e., 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 ILPs (Integer Linear Programs) and MILPs (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.

show abstract

Section: Methods 2: Hierarchical Calculation Of the Weakly Dominating mentioning

confidence: 99%

“…The cost to minimize is measured in terms of the number of lightpaths in the network, which define the number of transceivers (transmitters and receivers) needed. This number is commonly considered as a network cost criterion in planning studies [2], [3], [4].…”

Section: Introductionmentioning

confidence: 99%

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

et al. 2009

View full text Add to dashboard Cite

show abstract

“…It is important to notice, however, that this approach tries to find the best solution over the entire planning interval, whereas optimized grooming algorithms or heuristics [9,7,8] aim at finding the best solution for a certain point in time (with a certain traffic). Those techniques consider a static situation.…”

Section: Migration Pathsmentioning

confidence: 99%

“…Different from other grooming studies e.g. [7,8] we study the impact of a growing traffic demand and thus the need to expand the network. Several migration scenarios are studied and compared to one another, using investment decision techniques.…”

Section: Introductionmentioning

confidence: 99%

Techno-economic evaluation of the island based introduction of optical cross connects in an IP-over-WDM network

et al. 2006

View full text Add to dashboard Cite

This article compares several traffic grooming approaches, based on expected capital expenditures (capex) to dimension and expand the network. For small traffic demands, the link-by-link grooming approach (efficiently filling SDH frames) is most interesting. We illustrate that, as traffic increases, there comes a point where the savings in IP layer expenses realized by endto-end grooming compensate the extra expenses of introducing the needed optical cross connects (OXCs). We study the network-wide migration from link-by-link towards end-to-end grooming at a single point in time, as well as a possible migration path, where OXCs are introduced gradually in so-called end-to-end grooming islands. This approach can lead to important savings in capex. We study total equipment costs as well as incremental and cumulative costs, indicating the total expenses to be paid by the operator over a certain time. The use of the Net Present Value (NPV) technique is clarified. Finally, also the sensitivity of the obtained results to changes in the component costs is studied.

show abstract

“…Reference [7] discusses interface card amount optimization in meshed networks. In [8], traffic grooming in an IP-over-optical with TE and bifurcated grooming was considered (see also Section 3.3).…”

Section: A Note About This Optimization Problemmentioning

confidence: 99%

Logical topology design for IP rerouting: ASONs versus static OTNs

et al. 2010

View full text Add to dashboard Cite

. IP based backbone networks are gradually moving to a network model consisting of high-speed routers that are flexibly interconnected by a mesh of light paths set up by an Optical Transport Network (OTN) that consists of WDM links and Optical Cross-Connects (OXCs). In such a model, the Generalized MPLS (GMPLS) protocol suite could provide the IP centric control plane component that will be used to deliver rapid and dynamic circuit provisioning of end-to-end optical light paths between the routers. This is called an Automatically Switched Optical (transport) Network (ASON). An ASON enables reconfiguration of the logical IP topology by setting up and tearing down light paths. This allows to up-or downgrade link capacities during a router failure to the capacities needed by the new routing of the affected traffic. This way of making the IP layer survivable against (single) IP router failures can be cost effective, as capacity to the IP layer can be provided flexibly when necessary. We present and investigate a logical topology optimization problem that minimizes the total amount or cost of the needed resources (interfaces, wavelengths, WDM line-systems, amplifiers,…) in both the IP and optical layer. A novel optimization aspect in this problem is the possibility, as a result of the ASON, to reuse the physical resources (like interface cards and WDM line-systems) over the different network states (the failure free and all the router failure scenarios). We devised a simple optimization strategy in order to investigate the cost of the ASON approach and compare it with other schemes that survive single router failures.

show abstract

Algorithm for traffic grooming in optical networks to minimize the number of transceivers

Cited by 116 publications

References 5 publications

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

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

Techno-economic evaluation of the island based introduction of optical cross connects in an IP-over-WDM network

Logical topology design for IP rerouting: ASONs versus static OTNs

Contact Info

Product

Resources

About