1. Consider the network shown in Figure 4.28, in which horizontal lines represent transit providers and numbered vertical lines are interprovider links. (a) How many routes to P could provider Q's BGP speakers receive? (b) Suppose Q and P adopt the policy that outbound traffic is routed to the closest link to the destination's provider, thus minimizing their own cost. What paths will traffic from host A to host B and from host B to host A take? A 1 Provider Q FIGURE 4.28 Network for Exercise 1. B 2 3 4 (c) What could Q do to have the B →→→ A traffic use the closer link 1? (d) What could Q do to have the B →→ A traffic pass through R? Provider R

1. Consider the network shown in Figure 4.28, in which horizontal lines represent transit providers and numbered vertical lines are interprovider links. (a) How many routes to P could provider Q's BGP speakers receive? (b) Suppose Q and P adopt the policy that outbound traffic is routed to the closest link to the destination's provider, thus minimizing their own cost. What paths will traffic from host A to host B and from host B to host A take? A 1 Provider Q FIGURE 4.28 Network for Exercise 1. B 2 3 4 (c) What could Q do to have the B →→→ A traffic use the closer link 1? (d) What could Q do to have the B →→ A traffic pass through R? Provider R

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Suppose most of the Internet used some form of geographical but that a large addressing,…

Q: Provide three instances of routing metrics that routers employ to find the optimal routing path…

Q: Consider the count-to-infinity issue in the distance vector routing. Can the count-to-infinity issue…

A: The crux of the Count to Infinity problem is that if node A informs node B that it has a path…

Q: Figure 1 shows a small network that uses distance-vector routing with “poisoned reverse". The number…

A: Given graph contains 7 vertices A, B, C, D, E, F and G. These vertices contains weighted edges…

Q: One of the purposes of TIME_WAIT is to handle the case of a data packet from a first incarnation of…

Q: Imagine two autonomous systems ASX and ASY, and assume all of the following: • ASY has been…

A: In this scenario, we have two autonomous systems (AS), ASX and ASY. An autonomous system is a…

Q: Consider two hosts A & B connected by a point-to-point link with a data link rate of 1 Gb/s and…

A: For first solution refer below:

Q: Consider the count-to-infinity issue in the distance vector routing. Can the count-to-infinity issue…

A: Count-to-infinity issue in the distance vector routing

Q: Suppose there are three nodes in a network, A, B, and C. A starts transmitting over the medium…

A: For CSMA/CD, nodes B and C have sensed the medium busy and will continuously keep sensing it until…

Q: One of the purposes of TIME_WAIT is to handle the case of a data packet from a first incarnation of…

A: TIME_WAIT: After getting the end ACK from the distant TCP, the nearby TCP holds back to ensure that…

Q: When we talk about the length of a connection chain containing multiple connections, we use the RTT…

A: RTT is the Round Trip Time , which is the time between the request and response between client and…

Q: Consider the throughput example presented in the figure below. Now suppose that there are 4 client-…

Q: One of the purposes of TIME_WAIT is to handle the case of a data packet from a first incarnation of…

A: The question has been answered in step2

Q: Consider a two-link network where Host A is connected to the router by a 1 Mbps link with 10 ms…

A: The answer is..

Q: Suppose the host and destination are 30km apart over two links each of equal distance. The switching…

A: Propagation delay at each link is = distance/velocity = 15km/3*108 = 15*103/3*108 = 5*10-5 = 0.05 ms…

Q: Consider a local network containing 10 hosts. How many links are required in total for the following…

A: If a local network containing 10 hosts then the links required for the following organization is:-…

Q: Consider a local network containing 10o hosts. How many links are required in total for the…

A: The computers are connected to each other in a geometric representation is known as Topology. There…

Q: 1. Consider the network shown in Figure 4.28, in which horizontal lines represent transit providers…

Q: Question 1 Suppose P packets arrive simultaneously to a link at which three packets are currently…

Q: Think about the count-to-infinity distance vector routing issue. If the cost of a connection is…

A: Count-to-infinity : A routing loop is also known as counting to infinity. Routing loops in distance…

Q: 3. In the context of computer networking, explain the differences between Distance Vector Routing…

A: In a computer network, routing is the process of figuring out the best path or route for data…

Q: One of the purposes of TIME_WAIT is to handle the case of a data packet from a first incarnation of…

A: A. the first incarnation of the connection must have closed successfully and the second must have…

Q: - Consider below topology. Each link has its own cost, suppose node A sends a packet to node G,…

A: This is the distance vector routing. We take minimum one distance from source to another node.

Q: Suppose there is a network with four switches connected in a cyclic fashion where each switch has…

A: Spanning Tree: A spanning tree is a subset of a graph that contains all of the nodes (vertices) and…

Q: One connection may deliver several packets between hosts. Explain freight processing times. Does one…

A: In the world of computer networking, data is transmitted from one host to another through a series…

Concept explainers

Network transmission cabling

A network is a collection of devices connected by communication links. A device can be a computer or any instrument capable of sending and receiving data or information formed by other nodes toward the network. A channel that connects people or things is known as a network. It sends the data from one place to another. It is the basic concept of a computer, network, and data communications.

Question

1. Consider the network shown in Figure 4.28, in which horizontal
lines represent transit providers and numbered vertical lines are
interprovider links.
(a) How many routes to P could provider Q's BGP speakers
receive?
(b) Suppose Q and P adopt the policy that outbound traffic is
routed to the closest link to the destination's provider, thus
minimizing their own cost. What paths will traffic from host A
to host B and from host B to host A take?
A
1
Provider Q
FIGURE 4.28 Network for Exercise 1.
B
2
3
(c) What could Q do to have the B →→ A traffic use the closer
link 1?
(d) What could Q do to have the B → A traffic pass through R?
Provider R

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

A host-to-host link may carry numerous packets. Give me a breakdown of freight load processing time. Should one delay's length be fixed, while the other's may vary?
The stop-and-wait technique is explained in detail. What are the primary drawbacks and drawbacks of this method of communication? Using this example, come up with a formula for calculating connection use.
One proposed solution that allowed mobile users to maintain their IP addresses as they movedamong foreign networks was to have a foreign network advertise a highly specific route to themobile user and use the existing routing infrastructure to propagate this information throughoutthe network. We identified scalability as one concern. Suppose that when a mobile user movesfrom one network to another, the new foreign network advertises a specific route to the mobileuser, and the old foreign network withdraws its route. Consider how routing informationpropagates in a distance-vector algorithm (particularly for the case of inter-domain routing amongnetworks that span the globe). a) Will other routers be able to route datagrams immediately to the new foreign network assoon as the foreign network begins advertising its route? Why? b) Is it possible for different routers to believe that different foreign networks contain themobile user? Why? c) Discuss the timescale over which other routers in…
33. In the figure below suppose that there is another stub network V that is a customer of ISP A. Suppose that B and C have a peering relationship, and A is a customer of both B and C. Suppose that A would like to have the traffic destined to W to come from B only, and the traffic destined to V from either B or C. How should A advertise its routes to B and C? What AS routes does C receive? W A B X Key: Provider network Customer network
Assume that there are two routers, each router is connected with pc A and pc B. Find the number of node-to-node delivery, process-to-process delivery and draw the packet format by enabling weighted fair queuing.
1. Consider the network shown in Figure 4.28, in which horizontal lines represent transit providers and numbered vertical lines are interprovider links. (a) How many routes to P could provider Q's BGP speakers receive? (b) Suppose Q and P adopt the policy that outbound traffic is routed to the closest link to the destination's provider, thus minimizing their own cost. What paths will traffic from host A to host B and from host B to host A take? A 1 Provider Q FIGURE 4.28 Network for Exercise 1. B 2 3 (c) What could Q do to have the B →→ A traffic use the closer link 1? (d) What could Q do to have the B → A traffic pass through R? Provider R
Consider the throughput example presented in the figure below. Now suppose that there are 4 client-server pairs. Denote Rs1, Rs2, Rs3,Rs4 ,Rc1 ,Rc2 ,Rc3, Rc4 and R for the rates of the server links, client links, and network link. Assume all other links have abundant capacity and that there is no other traffic in the network besides the traffic generated by the 4 client-server pairs. Question:derive a general expression for throughput for the Client Server pair 1, in terms of Rsi, ,Rciand R.
I need the answer quickly
Think about the count-to-infinity distance vector routing issue. If the cost of a connection is decreased, is it feasible to have a count-to-infinity issue? Why? Consider connecting two unconnected nodes together.
In step 4 of the CSMA/CA protocol, a station that successfully transmits a frame begins the CSMA/CA protocol for a second frame at step 2, rather than at step 1. What rationale might the designers of CSMA/CA have had in mind by having such a station not transmit the second frame. Immediately (if the channel is sensed idle)?
Consider the throughput example presented in the figure below. Now suppose that there are 4 client-server pairs. Denote RS1, RS2, RS3, RS4, RC1, RC2, RC3, RC4 and R for the rates of the server links, client links, and network link. Assume all other links have abundant capacity and that there is no other traffic in the network besides the traffic generated by the 4 client-server pairs. Question:Assume that for i = {1,2,3,4}, RSi = RCi = R. Furthermore, assume that all routers have infinite buffer capacity, meaning that packets are never dropped and are eventually forwarded by a router. What is the throughput for the Client Server pair 1? What is the throughput for Client Server pair 3?