Hierarchical routing for computer networks (Record no. 54924)

MARC details
000 -LEADER
fixed length control field 03133nas|a2200409 i 4500
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260818133505.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 251198s1989 th uzm rtt 00| a1eng d
035 ## - SYSTEM CONTROL NUMBER
System control number .b10330690
099 #9 - LOCAL FREE-TEXT CALL NUMBER (OCLC)
Classification number AIT RSPR no. CS-89-8
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Shin, Jiin-kuen
245 10 - TITLE STATEMENT
Title Hierarchical routing for computer networks
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. Bangkok :
Name of publisher, distributor, etc. Asian Institute of Technology,
Date of publication, distribution, etc. 1989
300 ## - PHYSICAL DESCRIPTION
Extent 90 p.
490 1# - SERIES STATEMENT
Series statement Research studies project report ;
Volume/sequential designation no. CS-89-8
500 ## - GENERAL NOTE
General note A research study submitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology
502 ## - DISSERTATION NOTE
Dissertation note Research Studies Project Report (M. Eng.) - Asian Institute of Technology, 1989
520 ## - SUMMARY, ETC.
Summary, etc. This 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 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer networks
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Nanda, Navnit Kumar,
Relator term Chairperson
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Huynh, Ngoc Phien,
Relator term Examination Committee
700 1# - ADDED ENTRY--PERSONAL NAME
Personal name Phan, Minh Dung,
Relator term Examination Committee
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Government of Rep . Of China,
Relator term Scholarship Donor
810 2# - SERIES ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Asian Institute of Technology.
Title of a work Research studies project report ;
Volume/sequential designation no. CS-89-8
856 ## - ELECTRONIC LOCATION AND ACCESS
Materials specified Full-Text
Uniform Resource Identifier <a href="http://203.159.5.9/ait-thesis/detail.php?q=B17789">http://203.159.5.9/ait-thesis/detail.php?q=B17789</a>
907 ## - LOCAL DATA ELEMENT G, LDG (RLIN)
a .b10330690
b mnait
c y
902 ## - LOCAL DATA ELEMENT B, LDB (RLIN)
a 240402
998 ## - LOCAL CONTROL INFORMATION (RLIN)
Operator's initials, OID (RLIN) 2
Cataloger's initials, CIN (RLIN) 951012
First date, FD (RLIN) m
-- a
-- y
-- 0
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnait
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnait
945 ## - LOCAL PROCESSING INFORMATION (OCLC)
l mnarc
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 20-AIT Publication
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type 40-Archives
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050003121505
CREATED CREATED : 1995-10-14
RECORD Id RECORD # : i10411057
LPATRON LPATRON : 1016766
LCHKIN LCHKIN : 2005-11-21
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 1
-- TOT RENEW : 2
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050003121513
CREATED CREATED : 1995-10-14
RECORD Id RECORD # : i10411069
LPATRON LPATRON : 0
LCHKIN LCHKIN : -
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 0
-- TOT RENEW : 0
909 ## - LOCAL ITEMS USED
Barcode Barcode : 30050120238844
CREATED CREATED : 2016-03-30
RECORD Id RECORD # : i12912062
LPATRON LPATRON : 0
LCHKIN LCHKIN : -
RENEWALS # RENEWALS : 0
-- # OVERDUE : 0
-- IUSE3 : 0
-- TOT CHKOUT : 0
-- TOT RENEW : 0
Holdings
Withdrawn status Lost status Damaged status Not for loan Home library Current library Shelving location Date acquired Total checkouts Full call number Barcode Date last seen Copy number Price effective from Koha item type
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library AIT Publications 18/08/2026   AIT RSPR no. CS-89-8 30050003121505 18/08/2026 1 18/08/2026 20-AIT Publication
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library AIT Publications 18/08/2026   AIT RSPR no. CS-89-8 30050003121513 18/08/2026 2 18/08/2026 20-AIT Publication
      Available for Loans Asian Institute of Technology Library Asian Institute of Technology Library Archives 18/08/2026   AIT RSPR no. CS-89-8 30050120238844 18/08/2026   18/08/2026 40-Archives
คัดลอกแล้ว!