CSE_4589_Homework4

pdf

School

SUNY Buffalo State College *

*We aren’t endorsed by this school

Course

589

Subject

Computer Science

Date

Jan 9, 2024

Type

pdf

Pages

3

Uploaded by BrigadierMosquito3947

Report
CSE 4/589 – Modern Networking Concepts Homework 4 - Due Date: Dec 11th (11:59 PM) Notes: – Academic integrity: Print the following statement at the very beginning of your homework file: “I have read and understood the course academic integrity policy in the syllabus of the class.” Your homework will NOT be graded if you didn’t print the sen- tence. – You should work on this homework individually. – Submit the homework through UBLearns as PDF files. – For the calculation, you need to write down how the results are derived and your final answer also should be correct to obtain the credits for that question. – Please state any assumptions you are making while answering a question. – Total Credits: 100 with 4 Questions. You may discuss ideas with others in the class, but your solutions and presentation must be your own. Do not look at anyone else’s solutions or copy them from anywhere. 1 Distance Vector Routing (25 pts) Consider the network in the following figure. Distance vector routing is used, and the following vectors have just come in to router C: from B: (5, 0, 8, 12, 6, 2); from D: (16, 12, 6, 0, 9, 10); and from E: (7, 6, 3, 9, 0, 4). The cost of the links from C to B, D, and E, are 6, 3, and 5, respectively. What is C’s new routing table? Give both the outgoing line to use and the costs. 1
Note: The costs shown coming in from each node correspond to the distance vectors estimated for those nodes to the nodes in the following order (A, B, C, D, E, F). You can see how the cost to themselves are ‘0’ for each of the updates coming from B, D, and E. 2 Network Routers Hops (30 pts) A datagram network allows routers to drop packets whenever they need to. The probability of a router discarding a packet is p . Consider the case of a source host connected to the source router, which is connected to the destination router, and then to the destination host. If either of the routers discards a packet, the source host eventually times out and tries again. If both host-router and router-router lines are counted as hops, what is the mean number of (a) hops a packet makes per transmission? (10 points) (b) transmissions a packet makes? (10 points) (c) hops required per received packet? (10 points) 3 AS Routing (30 pts) (a) Will a BGP router always choose the loop-free route with the shortest AS-path length? Justify your answer (10 points) Consider the network shown below. Suppose AS3 and AS2 are running OSPF for their intra-AS routing protocol. Suppose AS1 and AS4 are running RIP 2
for their intra-AS routing protocol. Suppose eBGP and iBGP are used for the inter-AS routing protocol. Initially suppose there is no physical link between AS2 and AS4. (b) Router 3c learns about prefix x from which routing protocol: OSPF, RIP, eBGP, or iBGP? (5 points) (c) Router 3a learns about x from which routing protocol? (5 points) (d) Router 1c learns about x from which routing protocol? (5 points) (e) Router 1d learns about x from which routing protocol? (5 points) 4 IPv4 (15 pts) A router is blasting out IP packets whose total length (data plus header) is 1024 bytes. Assuming that packets live for 10 sec, what is the maximum line speed the router can operate at without danger of cycling through the IP datagram ID number space? 3
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help

Related Documents

test-1-mock.pdf
Deom_for_GMIY.docx
Response_for_GMIY.docx
Lesson_Plan_for_GMIY.docx
Week 13-2 CA Final Exam review P2.pdf
Solutions for Practice Problems for Exam (1).pdf
Assignment 1A-9.docx
week 6.docx
Answer_Key_Version_3.pdf
Answer_Key_Version_4.pdf
Task P3 solution.pdf
CSE_232_Exam3_v4_answers.pdf
Recommended textbooks for you
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781305627482
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage
Text book image
Oracle 12c: SQL
Computer Science
ISBN:9781305251038
Author:Joan Casteel
Publisher:Cengage Learning
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781285196145
Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel
Publisher:Cengage Learning
SEE MORE TEXTBOOKS
Recommended textbooks for you
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781305627482
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Text book image
Np Ms Office 365/Excel 2016 I Ntermed
Computer Science
ISBN:9781337508841
Author:Carey
Publisher:Cengage
Text book image
Oracle 12c: SQL
Computer Science
ISBN:9781305251038
Author:Joan Casteel
Publisher:Cengage Learning
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781285196145
Author:Steven, Steven Morris, Carlos Coronel, Carlos, Coronel, Carlos; Morris, Carlos Coronel and Steven Morris, Carlos Coronel; Steven Morris, Steven Morris; Carlos Coronel
Publisher:Cengage Learning
SEE MORE TEXTBOOKS