The forwarding index of directed networks

Yannis Manoussakis, Zsolt Tuza

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

In a given network with n vertices, a routing is defined as a set of n(n - 1) paths, one path connecting each ordered pair of vertices. The load of a vertex is the number of paths going through it. The forwarding index of the network is the minimum of the largest load taken over all routings. We give upper bounds on the forwarding index in k-connected digraphs and in digraphs with half-degrees at least k. Related conjectures are proposed.

Original languageEnglish
Pages (from-to)279-291
Number of pages13
JournalDiscrete Applied Mathematics
Volume68
Issue number3
DOIs
Publication statusPublished - Jul 24 1996

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'The forwarding index of directed networks'. Together they form a unique fingerprint.

  • Cite this