| Author | Shin, Jiin-kuen |
| Call Number | AIT RSPR no. CS-89-8 |
| Subject(s) | Computer networks
|
| Note | A research study submitted in partial fulfillment of the
requirements for the degree of Master of Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | 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 . |
| Year | 1989 |
| Type | Research Study Project Report (RSPR) |
| School | School of Engineering and Technology (SET) |
| Department | Other Field of Studies (No Department) |
| Academic Program/FoS | Computer Science (CS) |
| Chairperson(s) | Nanda, Navnit Kumar
|
| Examination Committee(s) | Huynh Ngoc Phien ;Phan Minh Dung |
| Scholarship Donor(s) | Government of Rep . Of China |
| Degree | Research Studies Project Report (M. Eng.) - Asian Institute of Technology, 1989 |