EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 5, Problem P17P
Explanation of Solution
Given network description:
In the given network, it consists of six interconnected autonomous systems “A”, “B”, “C”, “W”, “X” and “Y” which all are ASs but not routers. Here, “W”, “X” and “Y” are access “ISPs” and “A”, “B” and “C” is backbone providers. “A”, “B” and “C” sends traffic directly to each other and then “W” and “Y” are access “ISPs” whereas X is the multi-homed access ISP.
X’s view of the topology:
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
QUESTION 77
Consider the network topology shown below with routers labeled A through F, inclusive. Each link is labeled with its "cost" for routing purposes. The link state routing algorithm is used in this
network.
(a)Show how Djikstra's algorithm works to compute paths from Router E to all other routers (show your answer in a table format similar to the one used in the lectures).
(b)Show the final forwarding table at Router E after completion of the algorithm.
Consider a network with a ring topology, link bandwidths of
100 Mbps, and propagation speed 2 × 108 m/s. What would the
circumference of the loop be to exactly contain one 1500-byte
packet, assuming nodes do not introduce delay? What would the
circumference be if there was a node every 100 m, and each node
introduced 10 bits of delay?
1. Build a Router network which has three Generic
Routers and totally of Six networks in it. From each
Router the required switch shall be connected
through Fast Ethernet port and the switch is
connected to two users. On the whole there are '6'
networks in the configuration.
Along with the network diagram do the packet
transfer in simulation mode and write results
for three different combinations.
Chapter 5 Solutions
EBK COMPUTER NETWORKING
Ch. 5 - SECTION 5.1 R1. What is meant by a control plane...Ch. 5 - Prob. R2RQCh. 5 - Prob. R3RQCh. 5 - Prob. R4RQCh. 5 - Prob. R5RQCh. 5 - Prob. R6RQCh. 5 - Prob. R7RQCh. 5 - Prob. R8RQCh. 5 - Prob. R9RQCh. 5 - Prob. R10RQ
Ch. 5 - Prob. R11RQCh. 5 - Prob. R12RQCh. 5 - Prob. R13RQCh. 5 - Prob. R14RQCh. 5 - Prob. R15RQCh. 5 - Prob. R16RQCh. 5 - Prob. R17RQCh. 5 - Prob. R18RQCh. 5 - Prob. R19RQCh. 5 - Prob. R20RQCh. 5 - Prob. R21RQCh. 5 - Prob. R22RQCh. 5 - Prob. R23RQCh. 5 - Prob. P1PCh. 5 - Prob. P2PCh. 5 - Prob. P5PCh. 5 - Prob. P7PCh. 5 - Prob. P8PCh. 5 - Prob. P9PCh. 5 - Prob. P10PCh. 5 - Prob. P12PCh. 5 - Prob. P13PCh. 5 - Prob. P14PCh. 5 - Prob. P15PCh. 5 - Prob. P16PCh. 5 - Prob. P17PCh. 5 - Prob. P18PCh. 5 - Prob. P19PCh. 5 - Prob. P20PCh. 5 - Prob. P21PCh. 5 - Prob. P22P
Knowledge Booster
Similar questions
- Computer Networks Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is the transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward packets but instead immediately transmits each bit it…arrow_forwardProblem 2. Consider a packet of L bits that is sent over a path of Q links (i.e., a source and destination connected by a sequence of (Q-1) routers or switches). Each link transmits at R bps. This packet is the only traffic transmitted by the network (so there are no queuing delays) and the propagation delay and processing delay at routers are negligible. How long does it take to send this packet from source to destination if the network is: a) a packet-switched datagram network b) a circuit-switched network. Assume that bandwidth of R bps on each link is sliced into five individual circuits, so that cach circuit receives (R/5) bandwidth. Also assume that the circuit setup time is t,.. Give an expression for the number of links Q such that the packet delivery from the sender to the receiver will be faster over the packet-switched network, and the expression for the number of links Q such that the circuit-switched network will be faster.arrow_forwardComputer Networks Consider a packet of length L that begins at end system A and travels over three links to a destination end system. These three links are connected by two packet switches. Let d, s, and R denotes the length, propagation speed, and the transmission rate of link i, for i=1,2,3 . The packet switch delays each packet by d . Assuming no queuing delays, in terms of d, s , R, (i=1,2,3), and L, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, and the propagation speed on all three links are 3125km/sec, 10000 km/sec, and 3333km/sec respectively. The transmission rates of all three links are 2 Mbps, the packet switch processing delay is 3 msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, and the length of the last link is 1,000 km. For these values, what is the end-to-end delay? In the above problem, suppose R1=R2=R3=R and dproc=0. Further, suppose the packet switch does not store-and-forward…arrow_forward
- (b) The Internet Protocol (IP) can sometimes surprise with its flexibility. Since the overall design is close enough to the principles of the OSI Protocol Model, IP is independent of the Data Link and Physical network layers. And some Norwegians indeed showed successful IP network transmission is possible with carrier pigeons. If we would want to attempt to use carrier pigeons to establish a TCP connection between Canterbury and London, how long would it take to successfully establish the transmission under perfect conditions? (Assume the pigeons are perfectly reliable.) Explain how you come to your result. (1)arrow_forwardAssume the VC number of a virtual-circuit network is a 16-bit field. What is the maximum number of virtual circuits that can be carried over a link? If the path and the VC number for each VC are determined by a central node of the network and the same VC number is used for all links along the path of same VC, how does the central node determine the VC number at the setup time?arrow_forwardProvide the steps of Distance Vector Routing for the following routers. You can start with R1 and continue to find the routing tables of R1 and R2 routers in the diagram after examining the input from R2 and R4 for R1 and examining the input from R1 and R3 for R2. Note: Correct and detailed answer will be Upvoted else downvoted. Thank you!arrow_forward
- 2. Packet transmission. a. Consider a packet of length L that begins at end system A and travels over 2 links to a destination end system B. These two links are connected by one packet switch. Let d₁, S₁, and R₁ denote the length, propagation speed and transmission rate of link I, for i in {1, 2}. The packet switch delays each packet by dproc b. There is a queuing delay of 100 msec at the switch (but no queuing delay at A). The packet is 1500 bits in length, the propagation speed on all links is 2.5 x 108 m/sec, the transmission rate on both links is 1 Mbps, and the packet switch processing delay is 3 msec. The length of the first link is 4000 km and the second link is 1000 km. What is the end-to-end delay from A to B? c. The switch fails and is replaced. This changes the following information for the switch only. The packet switch processing delay is reduced from 3 msec to 2 msec, the queuing delay is reduced from 100 msec to 40 msec but the second transmission link increases to 8,500…arrow_forwardQuestion 5: Suppose you attach a network monitor to observe the sequence of frames that travel over a link from sender A to receiver B. The problem is to deduce what protocols, if any, could have generated the observed sequence. The following diagrams depict a flow of frames, with their corresponding sequence numbers, from the sender (A). There may be traffic from B to A, which is not depicted in the diagram. A gap between adjacent frames implies passage of time with no transmission from the sender. Note that the x-axis is time, and not space. Justify your answer. A A A ● ● ● ● 1 5 ● 3 5 0 ● 0 0 1 1 1 ● Go-Back-N ● Selective Repeat 1 0 5 0 c) For Diagram 3, the protocol is not: Stop-and-Wait Time Diagram 1 2 Time a) For Diagram 1, the most likely protocol being used is: Stop-and-Wait ● Go-Back-N (if Go-Back-N, give the window size) Selective Repeat (if Selective Repeat, give the window size) Diagram 2 Time 3 Diagram 3 1 Time b) For Diagram 2, the most likely protocol being used is:…arrow_forwardConsider the subnet in Fig. 3.11.5. 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, 06, 0, 9, 10) and from E(7, 6, 3, 9, 0, 4). The measured delays to B, D and E are 6, 3 and 5 respectively. What is C's new routing table? Give both the outgoing line to used and the expected delay ? A B E Fig. 3.11.5 F Darrow_forward
- Consider a network connecting two systems located 4000 kilometers apart. The bandwidth of the network is 500 x Mbps. The propagation speed of the media is 4 × 106 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. What is the minimum size in bits of the sequence number field?arrow_forward12. Consider the network shown below with the current measured delays between two nodes. A B 3 5 8 E F a. List all possible simple paths between C and D; simple paths are those that do not repeat a node (i.e., no loops). b. Which path provides the shortest delay?arrow_forwardThis question deals with the Poisson process and is formulated in terms of a subway station. It could as wellbe formulated in terms of a networking problem. A subway station where different train lines intersect is likeswitch/router in the communication network with the different train lines corresponding to what are calledLabelled Switched Paths (LSPs). As for the trains, you can think of them as packets or burst of packets. Onecan draw this analogy also in optical networks which forms the core of the Internet backbone. Two one-way subway lines, the A train line and the B train line, intersect at a transfer station, A trainsand B trains arrive at the station according to independently operating Poisson processes with rates λA =3 trains/hr and λB = 6 trains/hr. We assume that passenger boarding and un-boarding occurs almostinstantaneously. At a random time, Bart, a prospective passenger, arrives at the station, awaiting an A train.[Note that the superposition of two Poisson processes…arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education