000 03133nas|a2200409 i 4500
005 20260818133505.0
008 251198s1989 th uzm rtt 00| a1eng d
035 _a.b10330690
099 9 _aAIT RSPR no. CS-89-8
100 1 _aShin, Jiin-kuen
245 1 0 _aHierarchical routing for computer networks
260 _aBangkok :
_bAsian Institute of Technology,
_c1989
300 _a90 p.
490 1 _aResearch studies project report ;
_vno. CS-89-8
500 _aA research study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology
502 _aResearch Studies Project Report (M. Eng.) - Asian Institute of Technology, 1989
520 _aThis Research study is directed towards the problems of routing of large scale networks. A computer network can be modeled at an abstract level, as a graph . The most important factor is that the network can be partitioned into cluster structures as a graph. The objective of our research is to study the network performance which is partitioned into a hierarchical network. I n this work, it is assumed that the partitioning of the net- work into hierarchical clusters is available. Each node is associated with a routing table and the existing algorithms are directed toward reduction of routing table cost, but with single clusters. In this work, hierarchical routing is achieved by selecting a critical border node in each cluster and comparing the source and destination node logic address to select the appropriate cluster level, for fast retrieval of the next node to search the destination node. A comparison of the non-hierarchical and hierarchical path shows that the routing table is reduced but the hierarchical path is not optimal. It is concluded that hierarchical routing is a better solution for large networks provided efficient partitioning can be done .
650 0 _aComputer networks
700 1 _aNanda, Navnit Kumar,
_eChairperson
700 1 _aHuynh, Ngoc Phien,
_eExamination Committee
700 1 _aPhan, Minh Dung,
_eExamination Committee
710 2 _aGovernment of Rep . Of China,
_eScholarship Donor
810 2 _aAsian Institute of Technology.
_tResearch studies project report ;
_vno. CS-89-8
856 _3Full-Text
_uhttp://203.159.5.9/ait-thesis/detail.php?q=B17789
907 _a.b10330690
_bmnait
_cy
902 _a240402
998 _b2
_c951012
_dm
_ea
_fy
_g0
945 _lmnait
945 _lmnait
945 _lmnarc
942 _c20
942 _c40
909 _aBarcode : 30050003121505
_bCREATED : 1995-10-14
_cRECORD # : i10411057
_dLPATRON : 1016766
_eLCHKIN : 2005-11-21
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 1
_jTOT RENEW : 2
909 _aBarcode : 30050003121513
_bCREATED : 1995-10-14
_cRECORD # : i10411069
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
909 _aBarcode : 30050120238844
_bCREATED : 2016-03-30
_cRECORD # : i12912062
_dLPATRON : 0
_eLCHKIN : -
_f# RENEWALS : 0
_g# OVERDUE : 0
_hIUSE3 : 0
_iTOT CHKOUT : 0
_jTOT RENEW : 0
999 _c54924
_d54924