Sub-optimal routing in unreliable packet switched computer communication network

Author

Grzech, Adam

Author_Institution

Inst. of Inf. Sci. & Eng., Wroclaw Univ. of Technol., Poland

fYear

2005

fDate

16-18 Aug. 2005

Firstpage

276

Lastpage

281

Abstract

The paper is devoted to introduce and describe an approach leading to sub-optimal traffic routing in unreliable packet-switched computer network. It is assumed that average packet delay in unreliable network may be estimated based on average packet delays obtained both for the reliable and the unreliable networks; it is approximated by linear function of both considered delays. It is also assumed that optimal routing in network, when failure of particular channel occurs may be replaced by re-routing performed only in some separate part of the network containing the channel with failure.

Keywords

computer network reliability; computer networks; graph theory; packet switching; telecommunication channels; telecommunication network routing; telecommunication network topology; linear function; network channel failure; packet delay; suboptimal traffic routing; unreliable packet switched computer communication network; Communication networks; Communication switching; Computer network reliability; Computer networks; Delay estimation; Linear approximation; Packet switching; Routing; Telecommunication network reliability; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems Engineering, 2005. ICSEng 2005. 18th International Conference on

Print_ISBN

0-7695-2359-5

Type

conf

DOI

10.1109/ICSENG.2005.78

Filename

1562865