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 C X Key: Provider network Customer network

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 C X Key: Provider network Customer network

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

Similar questions

. 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 di, si, and Ridenote the length, propagation speed, and the transmission rate of link i, for i=1,2,3. The packet switch delays each packet by dproc. Assuming no queuing delays, in terms of di, si, Ri, (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 2.5-108m/s, 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?
Imagine you are the network administrator of University X having 10 campuses in Towson, Maryland. You want to build a connected network of servers (each server is either a regular or a routing one), one at each campus, and want to choose some of them to be the designated routing servers. A routing server will serve regular servers who connect directly to it via high speed cables, and every regular server must connect to at least one routing server. Your goal is to minimize the total length of high speed cable that you must purchase. Given the locations of the 10 campuses, design a plan that requires (1) the shortest length of cable and (2) the least number of routing servers.
A TCP message consisting of 2100 bytes is passed to IP for delivery across two networks. The first network can carry a maximum payload of 1200 bytes per frame and the second network can carry a maximum payload of 400 bytes per frame, excluding network overload. Assume that IP overhead per packet is 26 bytes. What is the total IP overhead (in bytes) in the network for this transmission?
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
Suppose, there are N = 4 nodes using the slotted ALOHA protocol. The nodes are contending for a 6 Mbps channel. Each node transmits only 50% of the time. What is the probability that at least one node succeeds in time slot 10.
In what ways does the functionality of an overlay network reveal itself, and what is an overlay network? No, routers are not included in this deal. Overlay networks have edges, but what are those edges?
Consider the following topology where A is the source and H is the sink and all the nodes are running Directed Diffusion protocol. Showing each step find how a data packet will be routed to H. A D OG H.
With OSPF, a router broadcasts its link state information to all other routers in the autonomous system to which it belongs. Is this statement true or false? whichalgorithm does it use to determine the least cost paths ?
Between Host Q and Host Y, there are ten routers in a network. How many data connections will there be between Host Q and Host Y when a packet is sent from Host Q to Host Y? (Hint: Draw something.) How many routes are there? How many frames are there?