<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of inria-00428685</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-03T14:08:51+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Designing Hypergraph Layouts to GMPLS Routing Strategies</title>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Claude</forename>
                <surname>Bermond</surname>
              </persName>
              <email type="md5">6152b43c5dee4ff74e213a261cfe369d</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">jean-claude-bermond</idno>
              <idno type="idhal" notation="numeric">739520</idno>
              <idno type="halauthorid" notation="string">13047-739520</idno>
              <idno type="ORCID">https://orcid.org/0009-0001-0454-0050</idno>
              <idno type="IDREF">https://www.idref.fr/032696256</idno>
              <affiliation ref="#struct-2466"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">David</forename>
                <surname>Coudert</surname>
              </persName>
              <email type="md5">017b8a863d5c6a335f5520c2d5c3602e</email>
              <email type="domain">inria.fr</email>
              <ptr type="url" target="https://www-sop.inria.fr/members/David.Coudert/"/>
              <idno type="idhal" notation="string">david-coudert</idno>
              <idno type="idhal" notation="numeric">1267</idno>
              <idno type="halauthorid" notation="string">1103-1267</idno>
              <idno type="IDREF">https://www.idref.fr/074539043</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-3306-8314</idno>
              <affiliation ref="#struct-2466"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Joanna</forename>
                <surname>Moulierac</surname>
              </persName>
              <email type="md5">986451761fbc9de59075593032bf1690</email>
              <email type="domain">univ-cotedazur.fr</email>
              <ptr type="url" target="https://www-sop.inria.fr/members/Joanna.Moulierac/"/>
              <idno type="idhal" notation="string">joanna-moulierac</idno>
              <idno type="idhal" notation="numeric">170385</idno>
              <idno type="halauthorid" notation="string">535-170385</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-4367-5839</idno>
              <idno type="IDREF">https://www.idref.fr/076453731</idno>
              <affiliation ref="#struct-2466"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Stéphane</forename>
                <surname>Pérennes</surname>
              </persName>
              <email type="md5">d5d8d6e6ee8e5d2dce07c36eed93fccb</email>
              <email type="domain">cnrs.fr</email>
              <idno type="idhal" notation="numeric">942945</idno>
              <idno type="halauthorid" notation="string">719184-942945</idno>
              <affiliation ref="#struct-2466"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Fernando</forename>
                <surname>Solano Donado</surname>
              </persName>
              <idno type="halauthorid">374570-0</idno>
              <affiliation ref="#struct-74983"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Joanna</forename>
                <surname>Moulierac</surname>
              </persName>
              <email type="md5">986451761fbc9de59075593032bf1690</email>
              <email type="domain">univ-cotedazur.fr</email>
            </editor>
            <funder>IST FET AEOLUS; Project “Optimization Models for NGI Core Network” (Polish Ministry of Science and Higher Education, grant N517 397334); COLOR INRIA LARECO</funder>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2009-10-29 13:48:11</date>
              <date type="whenModified">2025-10-07 15:32:02</date>
              <date type="whenReleased">2009-10-29 15:34:36</date>
              <date type="whenProduced">2009-05-25</date>
              <date type="whenEndEmbargoed">2009-10-29</date>
              <ref type="file" target="https://inria.hal.science/inria-00428685v1/document">
                <date notBefore="2009-10-29"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/inria-00428685v1/file/BCM_09_camera_ready_13May.pdf" id="file-428685-225208">
                <date notBefore="2009-10-29"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="111860">
                <persName>
                  <forename>Joanna</forename>
                  <surname>Moulierac</surname>
                </persName>
                <email type="md5">986451761fbc9de59075593032bf1690</email>
                <email type="domain">univ-cotedazur.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">inria-00428685</idno>
            <idno type="halUri">https://inria.hal.science/inria-00428685</idno>
            <idno type="halBibtex">bermond:inria-00428685</idno>
            <idno type="halRefHtml">&lt;i&gt;SIROCCO&lt;/i&gt;, May 2009, Piran, Slovenia</idno>
            <idno type="halRef">SIROCCO, May 2009, Piran, Slovenia</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-428685-225208"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNICE">Université Nice Sophia Antipolis</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
            <idno type="stamp" n="I3S">Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis</idno>
            <idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UNIV-COTEDAZUR">Université Côte d'Azur</idno>
            <idno type="stamp" n="TEST-NICE">test nice</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Designing Hypergraph Layouts to GMPLS Routing Strategies</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Claude</forename>
                    <surname>Bermond</surname>
                  </persName>
                  <email type="md5">6152b43c5dee4ff74e213a261cfe369d</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">jean-claude-bermond</idno>
                  <idno type="idhal" notation="numeric">739520</idno>
                  <idno type="halauthorid" notation="string">13047-739520</idno>
                  <idno type="ORCID">https://orcid.org/0009-0001-0454-0050</idno>
                  <idno type="IDREF">https://www.idref.fr/032696256</idno>
                  <affiliation ref="#struct-2466"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">David</forename>
                    <surname>Coudert</surname>
                  </persName>
                  <email type="md5">017b8a863d5c6a335f5520c2d5c3602e</email>
                  <email type="domain">inria.fr</email>
                  <ptr type="url" target="https://www-sop.inria.fr/members/David.Coudert/"/>
                  <idno type="idhal" notation="string">david-coudert</idno>
                  <idno type="idhal" notation="numeric">1267</idno>
                  <idno type="halauthorid" notation="string">1103-1267</idno>
                  <idno type="IDREF">https://www.idref.fr/074539043</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-3306-8314</idno>
                  <affiliation ref="#struct-2466"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Joanna</forename>
                    <surname>Moulierac</surname>
                  </persName>
                  <email type="md5">986451761fbc9de59075593032bf1690</email>
                  <email type="domain">univ-cotedazur.fr</email>
                  <ptr type="url" target="https://www-sop.inria.fr/members/Joanna.Moulierac/"/>
                  <idno type="idhal" notation="string">joanna-moulierac</idno>
                  <idno type="idhal" notation="numeric">170385</idno>
                  <idno type="halauthorid" notation="string">535-170385</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-4367-5839</idno>
                  <idno type="IDREF">https://www.idref.fr/076453731</idno>
                  <affiliation ref="#struct-2466"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Stéphane</forename>
                    <surname>Pérennes</surname>
                  </persName>
                  <email type="md5">d5d8d6e6ee8e5d2dce07c36eed93fccb</email>
                  <email type="domain">cnrs.fr</email>
                  <idno type="idhal" notation="numeric">942945</idno>
                  <idno type="halauthorid" notation="string">719184-942945</idno>
                  <affiliation ref="#struct-2466"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Fernando</forename>
                    <surname>Solano Donado</surname>
                  </persName>
                  <idno type="halauthorid">374570-0</idno>
                  <affiliation ref="#struct-74983"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>SIROCCO</title>
                  <date type="start">2009-05-25</date>
                  <date type="end">2009-05-27</date>
                  <settlement>Piran</settlement>
                  <country key="SI">Slovenia</country>
                </meeting>
                <imprint>
                  <date type="datePub">2009</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">dynamic programming.</term>
                <term xml:lang="en">approximation algorithms</term>
                <term xml:lang="en">hypergraph layout</term>
                <term xml:lang="en">label stacking</term>
                <term xml:lang="en">AOLS</term>
                <term xml:lang="en">GMPLS</term>
                <term xml:lang="en">dynamic programming</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set of requests in AOLS networks using GMPLS technology, with the aim of minimizing the number of labels required to ensure the forwarding. We first formalize the problem by associating to each routing strategy a logical hypergraph whose hyperarcs are dipaths of the physical graph, called tunnels in GMPLS terminology. Such a hypergraph is called a hypergraph layout, to which we assign a cost function given by its physical length plus the total number of hops traveled by the traffic. Minimizing the cost of the design of an AOLS network can then be expressed as finding a minimum cost hypergraph layout. We prove hardness results for the problem, namely for general directed networks we prove that it is NP- hard to find a C log n-approximation, where C is a a positive constant and n is the number of nodes of the network. For symmetric directed networks, we prove that the problem is APX-hard. These hardness results hold even is the traffic instance is a partial broadcast. On the other hand, we provide an O(log n)- approximation algorithm to the problem for a general symmetric network. Finally, we focus on the case where the physical network is a path, providing a polynomial-time dynamic programming algorithm for a bounded number of sources, thus extending the algorithm given in [2] for a single source.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-2466" status="OLD">
          <idno type="RNSR">200018393X</idno>
          <orgName>Algorithms, simulation, combinatorics and optimization for telecommunications</orgName>
          <orgName type="acronym">MASCOTTE</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-34586" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-451999" type="direct"/>
            <relation active="#struct-13009" type="indirect"/>
            <relation active="#struct-117617" type="indirect"/>
            <relation name="UMR7271" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1039632" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-74983" status="VALID">
          <orgName>Institute of Telecommunications</orgName>
          <desc>
            <address>
              <country key="PL"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-235985" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-34586" status="VALID">
          <idno type="RNSR">198318250R</idno>
          <idno type="ROR">https://ror.org/01nzkaw91</idno>
          <orgName>Centre Inria d'Université Côte d'Azur</orgName>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 06902 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/sophia/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="department" xml:id="struct-451999" status="VALID">
          <orgName>COMmunications, Réseaux, systèmes Embarqués et Distribués</orgName>
          <orgName type="acronym">Laboratoire I3S - COMRED</orgName>
          <date type="start">2016-03-02</date>
          <desc>
            <address>
              <addrLine>Laboratoire I3SCS 4012106903 Sophia Antipolis Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/comred</ref>
          </desc>
          <listRelation>
            <relation active="#struct-13009" type="direct"/>
            <relation active="#struct-117617" type="indirect"/>
            <relation name="UMR7271" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1039632" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-13009" status="VALID">
          <idno type="IdRef">050320491</idno>
          <idno type="ISNI">0000000105613840</idno>
          <idno type="RNSR">201220432L</idno>
          <idno type="ROR">https://ror.org/01215r597</idno>
          <orgName>Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis</orgName>
          <orgName type="acronym">I3S</orgName>
          <desc>
            <address>
              <addrLine>2000, route des Lucioles - Les Algorithmes - bât. Euclide B 06900 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-117617" type="direct"/>
            <relation name="UMR7271" active="#struct-441569" type="direct"/>
            <relation active="#struct-1039632" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-117617" status="VALID">
          <idno type="IdRef">026403498</idno>
          <idno type="ISNI">0000000123372892</idno>
          <idno type="ROR">https://ror.org/02k9vew78</idno>
          <orgName>Université Nice Sophia Antipolis (1965 - 2019)</orgName>
          <orgName type="acronym">UNS</orgName>
          <date type="start">1965-10-23</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 06100 Nice</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://unice.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-1039632" status="VALID">
          <idno type="IdRef">241035694</idno>
          <idno type="ROR">https://ror.org/019tgvf94</idno>
          <orgName>Université Côte d'Azur</orgName>
          <orgName type="acronym">UniCA</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 28, avenue Valrose 06108 Nice Cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://univ-cotedazur.fr</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-235985" status="VALID">
          <idno type="ROR">https://ror.org/00y0xnp53</idno>
          <orgName>Warsaw University of Technology [Warsaw]</orgName>
          <date type="start">2016-12-01</date>
          <desc>
            <address>
              <addrLine>Pl. Politechniki 1 00-661 Warsaw</addrLine>
              <country key="PL"/>
            </address>
            <ref type="url">http://www.pw.edu.pl/engpw</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>