2007 | OriginalPaper | Buchkapitel
Strategies for Traffic Grooming over Logical Topologies
verfasst von : Arunita Jaekel, Ataul Bari, Subir Bandyopadhyay
Erschienen in: Parallel and Distributed Processing and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In WDM mesh networks, low-speed data streams from individual users are combined, using the techniques of traffic grooming, for efficient utilization of the high bandwidth of a lightpath. The objective of traffic grooming is to minimize the cost of the network and/or to maximize the network throughput. Proposed solutions for this optimization problem are computationally intractable, even for networks of moderate size. In this paper, we have presented efficient Integer Linear Program (ILP) formulations for traffic grooming on mesh WDM networks, one for minimizing the congestion and the other to maximize the throughput of the network, with an assumption that the logical topology is specified. Unlike previous formulations, our formulations can be used for practical sized networks. We have simulated our formulations with networks up to 30 nodes, and with hundreds and even thousands of low-speed data streams and have shown that the formulations are able to generate optimal solutions within a reasonable amount of time.