DocumentCode :
1688421
Title :
Optimal routing in a network with unreliable links
Author :
Economides, Anastasios A. ; Silvester, John A.
Author_Institution :
Dept. of Electr. Eng.-Syst., Univ. of Southern California, Los Angeles, CA, USA
fYear :
1988
Firstpage :
288
Lastpage :
297
Abstract :
An investigation is conducted of the routing of packets in a network in which the link error rates vary. A queuing network model that incorporates the effect of the link error rates is developed and is used to find optimal routing assignments for fixed error rates. Single-path and multiple-path dynamic routing algorithms that minimize the average packet delay or the failure probability of packet transmission are proposed. In case the network state is not exactly known, stochastic learning automata are proposed to drive the routing process.<>
Keywords :
automata theory; data communication systems; delays; learning systems; packet switching; probability; queueing theory; stochastic processes; switching theory; telecommunication networks; average packet delay; failure probability; link error rates; multiple-path dynamic routing algorithms; optimal routing assignments; packet routing computer networks data communication systems; queuing network model; stochastic learning automata; unreliable links; Dynamic programming; Error analysis; Heuristic algorithms; Intelligent networks; Learning automata; Performance evaluation; Routing; Stochastic processes; Telecommunication traffic; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Networking Symposium, 1988., Proceedings of the
Conference_Location :
Washington, DC, USA
Print_ISBN :
0-8186-0835-8
Type :
conf
DOI :
10.1109/CNS.1988.5007
Filename :
5007
Link To Document :
بازگشت