### Abstract

This paper proposes a design algorithm for packet‐switching networks with different classes of packets under end‐to‐end packet delay constraint and a design algorithm for fault‐tolerant networks. the former is a heuristic capacity, priority, and flow assignment algorithm which locally minimizes the network cost while satisfying a constraint that the average transmission delay of each class of packets between two arbitrary nodes never exceed a value predetermined for the class. This algorithm is composed of three subalgorithms and the cost minimization is pursued by iterating these algorithms as long as the constraint is satisfied. the latter is a design algorithm for a fault‐tolerant network which satisfies the foregoing constraint even if an arbitrary single link fails. With this algorithm, an assignment with relatively large cost but satisfying the constraint is obtained first. Then a procedure of reducing the capacity of a link whose effect on cost reduction is great but whose effect on path delay increase is not so great is iterated to reduce the network cost as long as the constraint is satisfied.

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

Pages (from-to) | 1-12 |

Number of pages | 12 |

Journal | Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi) |

Volume | 78 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1995 |

### Fingerprint

### Keywords

- capacity assignment
- fault tolerant network
- flow assignment
- Network design
- priority assignment

### ASJC Scopus subject areas

- Computer Networks and Communications
- Electrical and Electronic Engineering

### Cite this

*Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)*,

*78*(2), 1-12. https://doi.org/10.1002/ecja.4410780201

**Design algorithm for packet‐switching networks with different classes of packets‐capacity, priority, and flow assignment under endto‐end packet delay constraint.** / Sugano, Masashi; Takashina, Hiromitsu; Yokohira, Tokumi; Okamoto, Takuji.

Research output: Contribution to journal › Article

*Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)*, vol. 78, no. 2, pp. 1-12. https://doi.org/10.1002/ecja.4410780201

}

TY - JOUR

T1 - Design algorithm for packet‐switching networks with different classes of packets‐capacity, priority, and flow assignment under endto‐end packet delay constraint

AU - Sugano, Masashi

AU - Takashina, Hiromitsu

AU - Yokohira, Tokumi

AU - Okamoto, Takuji

PY - 1995

Y1 - 1995

N2 - This paper proposes a design algorithm for packet‐switching networks with different classes of packets under end‐to‐end packet delay constraint and a design algorithm for fault‐tolerant networks. the former is a heuristic capacity, priority, and flow assignment algorithm which locally minimizes the network cost while satisfying a constraint that the average transmission delay of each class of packets between two arbitrary nodes never exceed a value predetermined for the class. This algorithm is composed of three subalgorithms and the cost minimization is pursued by iterating these algorithms as long as the constraint is satisfied. the latter is a design algorithm for a fault‐tolerant network which satisfies the foregoing constraint even if an arbitrary single link fails. With this algorithm, an assignment with relatively large cost but satisfying the constraint is obtained first. Then a procedure of reducing the capacity of a link whose effect on cost reduction is great but whose effect on path delay increase is not so great is iterated to reduce the network cost as long as the constraint is satisfied.

AB - This paper proposes a design algorithm for packet‐switching networks with different classes of packets under end‐to‐end packet delay constraint and a design algorithm for fault‐tolerant networks. the former is a heuristic capacity, priority, and flow assignment algorithm which locally minimizes the network cost while satisfying a constraint that the average transmission delay of each class of packets between two arbitrary nodes never exceed a value predetermined for the class. This algorithm is composed of three subalgorithms and the cost minimization is pursued by iterating these algorithms as long as the constraint is satisfied. the latter is a design algorithm for a fault‐tolerant network which satisfies the foregoing constraint even if an arbitrary single link fails. With this algorithm, an assignment with relatively large cost but satisfying the constraint is obtained first. Then a procedure of reducing the capacity of a link whose effect on cost reduction is great but whose effect on path delay increase is not so great is iterated to reduce the network cost as long as the constraint is satisfied.

KW - capacity assignment

KW - fault tolerant network

KW - flow assignment

KW - Network design

KW - priority assignment

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

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

U2 - 10.1002/ecja.4410780201

DO - 10.1002/ecja.4410780201

M3 - Article

VL - 78

SP - 1

EP - 12

JO - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

JF - Electronics and Communications in Japan, Part I: Communications (English translation of Denshi Tsushin Gakkai Ronbunshi)

SN - 8756-6621

IS - 2

ER -