Traffic grooming

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Traffic grooming is the process of grouping many small telecommunications flows into larger units, which can be processed as single entities. For example, in a network using both time-division multiplexing (TDM) and wavelength-division multiplexing (WDM), two flows which are destined for a common node can be placed on the same wavelength, allowing them to be dropped by a single optical add-drop multiplexer. Often the objective of grooming is minimizing the cost of the network. The cost of line terminating equipment (LTE) (also called add/drop multiplexers or ADMs) is the most dominant component in an optical WDM network's cost. Thus grooming typically involves minimizing the usage of ADMs.

This is similar to the use of virtual channels and virtual paths in ATM networks.

Effective grooming requires consideration of the topology of the network and the different routes in use. This is especially useful when dealing with mesh networks.

Grooming Algorithms[edit]

The traffic grooming problem has proven to be computationally intractable in the general case. Hence heuristic solutions are typically used.

References[edit]