### Abstract

In a given graph with n vertices, a routing is defined as a set of n (n - 1) routes, one route connecting each ordered pair of vertices. The load of a vertex is the number of routes going through it. The forwarding index of the graph is the minimum of the largest load taken over all routings. We construct undirected graphs with a high degree of symmetry and specified diameter, in which the load of every vertex is at most constant times the number of vertices. This gives a partial solution to a problem of Chung et al. [IEEE Trans. Inf. Theory IT-33(2) 224-232 (1987)].

Original language | English |
---|---|

Pages (from-to) | 177-180 |

Number of pages | 4 |

Journal | Networks |

Volume | 28 |

Issue number | 4 |

Publication status | Published - Dec 1996 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture

### Cite this

*Networks*,

*28*(4), 177-180.

**Optimal routings in communication networks with linearly bounded forwarding index.** / Manoussakis, Yannis; Tuza, Z.

Research output: Contribution to journal › Article

*Networks*, vol. 28, no. 4, pp. 177-180.

}

TY - JOUR

T1 - Optimal routings in communication networks with linearly bounded forwarding index

AU - Manoussakis, Yannis

AU - Tuza, Z.

PY - 1996/12

Y1 - 1996/12

N2 - In a given graph with n vertices, a routing is defined as a set of n (n - 1) routes, one route connecting each ordered pair of vertices. The load of a vertex is the number of routes going through it. The forwarding index of the graph is the minimum of the largest load taken over all routings. We construct undirected graphs with a high degree of symmetry and specified diameter, in which the load of every vertex is at most constant times the number of vertices. This gives a partial solution to a problem of Chung et al. [IEEE Trans. Inf. Theory IT-33(2) 224-232 (1987)].

AB - In a given graph with n vertices, a routing is defined as a set of n (n - 1) routes, one route connecting each ordered pair of vertices. The load of a vertex is the number of routes going through it. The forwarding index of the graph is the minimum of the largest load taken over all routings. We construct undirected graphs with a high degree of symmetry and specified diameter, in which the load of every vertex is at most constant times the number of vertices. This gives a partial solution to a problem of Chung et al. [IEEE Trans. Inf. Theory IT-33(2) 224-232 (1987)].

UR - http://www.scopus.com/inward/record.url?scp=0039564772&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0039564772&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0039564772

VL - 28

SP - 177

EP - 180

JO - Networks

JF - Networks

SN - 0028-3045

IS - 4

ER -