Why is the problem being solved?

The ARPANET Routing metric was revised in July 1987 to solve the problems in modern times. These are supposed to be the routing metric of the network, which is used to rectify the problems and issues by all the time. One can utilize all of them to resolve their matters and issues in all means. We can all use this metric for our further usages, as well.

Q no 2: Why is it interesting, relevant, and or important?                                                                     

       The APPARENT Routing metric is really interesting in true means as it is used to improve network capacity so far. It is quite relevant to the modern time's usages as Routing metric all tend to improve the networking itself . The landmark hierarchy is also very important these days as it exhibits the path lengths so far.

Q no 3: what approaches existed at the time that this work was done?

    When this work was being done. The approaches being used is the landmark hierarchy. These approaches really revolutionized the very realm of routing table sizes so far.

Q no 4: Why existing approaches were not adequate?

Existing approaches were not adequate as it was used for such a smaller purpose. Whereas the landmark hierarchy was made and designed to establish and exhibit the routing table sizes so far.

Q no 5: What is the proposed approach, and how does it compare to earlier approaches?

The earlier approaches or techniques were not designed for the shortest path to operate. Whereas the Landmark Hierarchy System is the one appropriate for the table sizes, while the others were for cluster hierarchy. So, the real propose is to smooth the system altogether for the benefit of all the computer users in all means.

Q no 6: What are the main strengths and weaknesses of the paper/proposed approach?

Usage of APPARENT Routing Metric and the Landmark Hierarchy System are the actual strength areas of the paper. Here their usage also facilitates the computing system so far. Whereas the weaknesses are we all still need to achieve many more targets in the computing world so far.

References of Routing Techniques Used in Computer Comm. Networks

Khanna A. and Zinky J. “ The Revised ARPANET Routing Metric “ Proc of ACM SIGCOMM’89,Pages 45-56,Sep 1989

-Tsuchiya P.F,The Landmark Hierarchy : A New Hierarchy For Routing in Very Large Networks “, Proceedings of ACM Sigcomm 1988,PP.128-134