Need help with a network class assignment (Link State Intra-AS routing) -- 2
Budget: ₹400 – ₹750 INR
PDF attached with details, in your response you must include the value of n provided on the example of the first page on pdf, otherwise your bid will be rejected.
Summary:
In this assignment you will implement a core functionality of the Link State Intra-AS routing
algorithm for an autonomous system (AS). The input for the algorithm is a weighted directed graph
with n vertices (labeled with 1, 2, ..., n) that represents topology of a particular autonomous system.
This is followed by one line list of “gateway routers” x1, ..., xk, where xi are distinct numbers from
the set {1, 2, ...., n}. The output consists of n-k forwarding tables to gateway routers (one per
router) which allows datagram forwarding from a source router to a destination gateway AS routers
along the shortest path.
Java program should read in input and output mentioned above. Must read complete pdf before bidding
Summary:
In this assignment you will implement a core functionality of the Link State Intra-AS routing
algorithm for an autonomous system (AS). The input for the algorithm is a weighted directed graph
with n vertices (labeled with 1, 2, ..., n) that represents topology of a particular autonomous system.
This is followed by one line list of “gateway routers” x1, ..., xk, where xi are distinct numbers from
the set {1, 2, ...., n}. The output consists of n-k forwarding tables to gateway routers (one per
router) which allows datagram forwarding from a source router to a destination gateway AS routers
along the shortest path.
Java program should read in input and output mentioned above. Must read complete pdf before bidding