Skip to Main content Skip to Navigation
Conference papers

Optimal Solution of the Maximum All Request Path Grooming Problem

Jean-Claude Bermond 1 Michel Cosnard 1 David Coudert 1, * Stéphane Pérennes 1
* Corresponding author
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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.
Complete list of metadata

https://hal.inria.fr/inria-00429167
Contributor : David Coudert <>
Submitted on : Sunday, November 1, 2009 - 1:43:37 PM
Last modification on : Tuesday, November 17, 2020 - 11:18:04 PM
Long-term archiving on: : Thursday, June 17, 2010 - 6:53:14 PM

File

BCCP-AICT06.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes. Optimal Solution of the Maximum All Request Path Grooming Problem. Advanced International Conference on Telecommunications (AICT), Feb 2006, Le Gosier, Guadeloupe, France. ⟨10.1109/AICT-ICIW.2006.144⟩. ⟨inria-00429167⟩

Share

Metrics

Record views

313

Files downloads

257