Optimal Solution of the Maximum All Request Path Grooming Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

Optimal Solution of the Maximum All Request Path Grooming Problem

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5627.pdf (168.44 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00070381 , version 1 (19-05-2006)

Identifiers

  • HAL Id : inria-00070381 , version 1

Cite

Jean-Claude Bermond, Michel Cosnard, David Coudert, Stéphane Pérennes. Optimal Solution of the Maximum All Request Path Grooming Problem. [Research Report] RR-5627, INRIA. 2006, pp.12. ⟨inria-00070381⟩
186 View
145 Download

Share

Gmail Facebook X LinkedIn More