Capacity assignment algorithm for packet‐switching network with unreliable links

Tokumi Yokohira, Masashi Sugano, Takeshi Nishida, Hideo Miyahara

Research output: Contribution to journalArticlepeer-review


In this paper, a link capacity assignment algorithm for a packet switched communication network is presented. This algorithm, called max‐delay‐link algorithm, prevents sharp performance degradation in a network even in case of link failures. An optimal link capacity assignment can be obtained with respect to link cost minimization, subject to the constraint that the average packet network transmission delay does not exceed a predetermined value. Robust networks against failures can be designed by assigning large capacities to links where overflow traffic and packet delay are expected to increase in case of a failure. Several numerical examples also are shown to examine the effectiveness of the algorithm in comparison with the conventional capacity assignment algorithm where link failures are not taken into account.

Original languageEnglish
Pages (from-to)13-20
Number of pages8
JournalElectronics and Communications in Japan (Part I: Communications)
Issue number9
Publication statusPublished - Sept 1991

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Capacity assignment algorithm for packet‐switching network with unreliable links'. Together they form a unique fingerprint.

Cite this