Articles producció científica> Enginyeria Informàtica i Matemàtiques

Greedy Routing in Circulant Networks

  • Dades identificatives

    Identificador: imarina:9261594
    Handle: https://hdl.handle.net/20.500.11797/imarina9261594
    Autors:
    Perez-Roses, HebertBras-Amoros, MariaMiguel Serradilla-Merinero, Jose
    Resum:
    We address the problem of constructing large circulant networks with given degree and diameter, and efficient routing schemes. First we discuss the theoretical upper bounds and their asymptotics. Then we apply concepts and tools from the change-making problem to efficient routing in circulant graphs. With these tools we investigate some of the families of circulant graphs that have been proposed in the literature, and we construct tables of large circulant graphs and digraphs with efficient routing properties.

  • Altres:

    Autor segons l'article: Perez-Roses, Hebert; Bras-Amoros, Maria; Miguel Serradilla-Merinero, Jose;
    Departament: Enginyeria Informàtica i Matemàtiques
    Autor/s de la URV: Bras Amoros, Maria / Pérez Rosés, Hebert / Serradilla Merinero, José Miguel
    Paraules clau: Network routing Network design Greedy algorithm Diameter problem Degree-diameter problem Degree Circulant graphs Cayley-graphs Algorithm
    Resum: We address the problem of constructing large circulant networks with given degree and diameter, and efficient routing schemes. First we discuss the theoretical upper bounds and their asymptotics. Then we apply concepts and tools from the change-making problem to efficient routing in circulant graphs. With these tools we investigate some of the families of circulant graphs that have been proposed in the literature, and we construct tables of large circulant graphs and digraphs with efficient routing properties.
    Àrees temàtiques: Theoretical computer science Mathematics Matemática / probabilidade e estatística Interdisciplinar Discrete mathematics and combinatorics Ciência da computação
    Accès a la llicència d'ús: https://creativecommons.org/licenses/by/3.0/es/
    Adreça de correu electrònic de l'autor: hebert.perez@urv.cat maria.bras@urv.cat
    Identificador de l'autor: 0000-0002-3481-004X
    Data d'alta del registre: 2024-09-07
    Versió de l'article dipositat: info:eu-repo/semantics/acceptedVersion
    Enllaç font original: https://link.springer.com/article/10.1007/s00373-022-02489-9
    URL Document de llicència: https://repositori.urv.cat/ca/proteccio-de-dades/
    Referència a l'article segons font original: Graphs And Combinatorics. 38 (3):
    Referència de l'ítem segons les normes APA: Perez-Roses, Hebert; Bras-Amoros, Maria; Miguel Serradilla-Merinero, Jose; (2022). Greedy Routing in Circulant Networks. Graphs And Combinatorics, 38(3), -. DOI: 10.1007/s00373-022-02489-9
    DOI de l'article: 10.1007/s00373-022-02489-9
    Entitat: Universitat Rovira i Virgili
    Any de publicació de la revista: 2022
    Tipus de publicació: Journal Publications

  • Paraules clau:

    Discrete Mathematics and Combinatorics,Mathematics,Theoretical Computer Science
    Network routing
    Network design
    Greedy algorithm
    Diameter problem
    Degree-diameter problem
    Degree
    Circulant graphs
    Cayley-graphs
    Algorithm
    Theoretical computer science
    Mathematics
    Matemática / probabilidade e estatística
    Interdisciplinar
    Discrete mathematics and combinatorics
    Ciência da computação

  • Documents:

    DocumentPrincipal

  • Cerca a google

    Search to google scholar