Traffic grooming in WDM networks: past and future

Dutta, Rudra; Rouskas, George N.

doi:10.1109/mnet.2002.1081765

Cited by 326 publications

(195 citation statements)

References 27 publications

Supporting

Mentioning

185

Contrasting

Unclassified

Order By: Relevance

“…The traffic grooming problem involves the following conceptual subproblems (SPs) for sub-wavelength demands [12]:…”

Section: Hierarchical Grooming In General Topology Networkmentioning

confidence: 99%

“…

Several variants of the traffic grooming problem have been studied in the literature under a range of assumptions regarding the network topology, the nature of traffic, and the optical and electronic switching model [11,13,16,18-21, 25, 26].

…”

mentioning

confidence: 99%

See 1 more Smart Citation

Hierarchical Traffic Grooming

Rouskas¹,

Dutta²

2008

Optical Networks

View full text Add to dashboard Cite

IntroductionTraffic grooming is the field of study that is concerned with the development of algorithms and protocols for the design, operation, and control of networks with multigranular bandwidth demands [12]. As the number of logical entities (including sub-wavelength channels, wavelengths, wavebands, and fibers) that need to be controlled in a multigranular network increases rapidly with the network size, wavelength capacity, and load, a scalable framework for managing these entities becomes a sine qua non for future wide area WDM networks.Several variants of the traffic grooming problem have been studied in the literature under a range of assumptions regarding the network topology, the nature of traffic, and the optical and electronic switching model [11,13,16,18-21, 25, 26]. Typically, an integer linear programming (ILP) formulation serves as the basis for reasoning about and tackling the problem. Unfortunately, solving the ILP directly does not scale to instances with more than a handful of nodes, and cannot be applied to networks of practical size covering a national or international geographical area. Consequently, either the ILP is tackled using standard relaxation techniques, or the problem is decomposed into subproblems which are solved using heuristics.Most of the above studies regard the network as a flat entity for the purposes of lightpath routing, wavelength assignment, and traffic grooming. It is well-known, however, that in existing networks resources are typically managed and controlled in a hierarchical manner. The levels of the hierarchy either reflect the underlying organizational structure of the network or are designed in order to ensure scalability of the control and management functions. Accordingly, several studies have adopted a variety of hierarchical approaches to traffic grooming that, by virtue of decomposing the network, scale well and are more compatible with the manner in which networks operate in practice.The rest of this chapter is organized as follows. In Section 1.2 we survey hierarchical traffic grooming techniques for networks with a special topology.

show abstract

“…The traffic grooming problem involves the following conceptual subproblems (SPs) for sub-wavelength demands [12]:…”

Section: Hierarchical Grooming In General Topology Networkmentioning

confidence: 99%

“…

…”

mentioning

confidence: 99%

Hierarchical Traffic Grooming

Rouskas¹,

Dutta²

2008

Optical Networks

View full text Add to dashboard Cite

show abstract

“…For a given set of requests the objective is to minimize the number of ADMs (Add Drop Multiplexers) used. This problem has been widely studied in the literature (see the surveys [5,6,8,11]) for various physical networks in particular for the unidirectional ring networks. In [4,1] the physical network is a dipath.…”

Section: Introductionmentioning

confidence: 99%

Optimal Solution of the Maximum All Request Path Grooming Problem

Bermond

Cosnard

Coudert

et al. 2006

Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services (AICT-ICIW'0

View full text Add to dashboard Cite

Thème COM -Systèmes communicants Projet Mascotte, commun I3S-CNRS/INRIA/UNSA Rapport de recherche n°5627 -Juillet 2005 -12 pages Abstract: We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the maximum number of connections which can be established in a path of size N , where each arc has a capacity or bandwidth C (grooming factor). We present a greedy algorithm to solve the problem and an explicit formula for the maximum number of requests that can be groomed. In particular, if C = s(s + 1)/2 and N > s(s − 1), an optimal solution is obtained by taking all the requests of smallest length, that is of length 1 to s. However this is not true in general since anomalies can exist. We give a complete analysis and the exact number of such anomalies.

show abstract

“…As an integrated design approach, SONET traffic grooming in WDM networks has received considerable attention recently [4][5][6][7][8][9][10][11][12]. Traffic grooming consists of four sub-problems, which are not necessarily independent: (1) determining the virtual topology of lightpaths over a fibre network; (2) routing SONET traffic onto the virtual topology; (3) routing the lightpaths over the fibre network; and (4) performing wavelength assignments to the lightpaths.…”

Section: Introductionmentioning

confidence: 99%

A Lagrangian-Relaxation Based Network Profit Optimization For Mesh SONET-Over-WDM Networks

Zhang

Yang

et al. 2005

Photon Netw Commun

View full text Add to dashboard Cite

Abstract. In Wavelength Division Multiplexing (WDM) networks, the huge capacity of wavelength channels is generally much larger than the bandwidth requirement of individual traffic streams from network users. Traffic grooming techniques aggregate low-bandwidth traffic streams onto high-bandwidth wavelength channels. In this paper, we study the optimization problem of grooming the static traffic in mesh Synchronous Optical Network (SONET) over WDM networks. The problem is formulated as a constrained integer linear programming problem and an innovative optimization objective is developed as network profit optimization. The routing cost in the SONET and WDM layers as well as the revenue generated by accepting SONET traffic demands are modelled. Through the optimization process, SONET traffic demands will be selectively accepted based on the profit (i.e., the excess of revenue over network cost) they generate. Considering the complexity of the network optimization problem, a decomposition approach using Lagrangian relaxation is proposed. The overall relaxed dual problem is decomposed into routing and wavelength assignment and SONET traffic routing sub-problems. The subgradient approach is used to optimize the derived dual function by updating the Lagrange multipliers. To generate a feasible network routing scheme, a heuristic algorithm is proposed based on the dual solution. A systematic approach to obtain theoretical performance bounds is presented for an arbitrary topology mesh network. This is the first time that such theoretical performance bounds are obtained for SONET traffic grooming in mesh topology networks. The optimization results of sample networks indicate that the proposed algorithm achieves good sub-optimal solutions. Finally, the influence of various network parameters is studied.

show abstract

Traffic grooming in WDM networks: past and future

Cited by 326 publications

References 27 publications

Hierarchical Traffic Grooming

Hierarchical Traffic Grooming

Optimal Solution of the Maximum All Request Path Grooming Problem

A Lagrangian-Relaxation Based Network Profit Optimization For Mesh SONET-Over-WDM Networks

Contact Info

Product

Resources

About