الفهرس 
AcknowledgementOnly 14 pages are availabe for public view
 |  | from | 150 |  |  |
| | | from | 150 | | |
Abstract
EFACE The purpose of this thesis is to study routing techniques used i n packet switching cL-.)fnputer Communication networks in detail, and how they are incorporated within a network. discuss the existing t ec~-,n i q ues in currently operating networks and propose a routing ng policy which is efficient and produces better results.
Severa-I muting techniques are presented with the advantages and disadvantages of each. Also, the validity of an analytic model for an adaptive policy is discussed, along with the feaEsibility of implementing a semi dynami c routing policy that uses a deterministic and an adaptive part. An incremental adaptive routing procedure is presented and its
implementation and assumptions are discussed. A general simulation program for routing algorithms is depicted andis used to evaluate a proposed adaptive policy that uses a generalized quadratic fun;-tion in queue length.. Based of-, a
compari ti ve study, the proposed policy is shown to outperform a counter one that is used in several operating networks nowadays concerning delay time.
A conclusion is made about different routing policies favouring distributed ones. Suggestions 4o7 future work is given for the development of new adaptive routing algorithms and the computation of optimal delay time for the proposed adaptive policy using a given procedure.