4.05-2. Generalized forwarding: specifying a flow table entry (b). Consider the three-node network below, that uses flow-based generalized forwarding (e.g. as in OpenFlow) inthe network's routers. In the question below, we'll want to create match+action entries in the flow table at router r2, with three ports labelled 1,2.3 (in black). In the question,matches are constrained to be over only four fields: the IP source address, the IP destination address, the upper-layer protocol field of the IP datagram, and the destination portnumber of the transport-layer segment. The actions are either to drop or to forward(i). that is, to forward a matching packet on port i. The default action (uniess stated othenwise) isthat if a packet doesn't match a rule, it will be dropped.OpenFlowcontroller128.119/164353.106/1622.33/161matchactionsource IPdest. IPprotocoldest. portТСР(b) Suppose we want to implement the following behavior, and that the default configuration is that all traffic from 22.33/16 should be allowed to be forwarded by r2 to the outsidenetwork. However, we also want to implement a higher priority rule (which would be earlier in the table, for example) so that users within the 22.33/18 network are never allowedto connect to an external web server on port 80. Specify the flow table row entries to implement this rule, by indicating the column entries below. The * is a wildcard match, whichmatches everything - you should use * over more specific answers whenever possible.(Note: You can find more exarmples of problerrs simiar to this here|In the "source IP" column, the flow table entry should be:|In the "dest. IP" column, the flow table entry should be:|In the "dest port" column, the flow table entry should be:|In the "action" column, the flow table entry should be:A. 80B. 22.33/18C. 53.108/16D. 128.119/18E. dropF. UDPG. forward(1)H.*I. forward(2)

It is defined as a group of computers linked to each other that enables the computer to communicate…

Generalized forwarding: specifying a flow table entry (b). Consider the three-node network below, that uses flow-based generalized forwarding (e.g., as in OpenFlow work's routers. In the question below, wel want to create match+action entries in the flow table at router r2, with three ports labelled 1.2.3 (in black). In the question, es are constrained to be over only four fields: the IP source address, the IP destination address, the upper-layer protocol field of the IP datagram, and the destination port er of the transport-layer segment. The actions are either to drop or to forward(). that is, to forward a matching packet on port i. The default action (uniess stated otherwise) a packet doesn't match a rule, it will be dropped. COpenFlow controller 128.119/16 4 5

Generalized forwarding: specifying a flow table entry (b). Consider the three-node network below, that uses flow-based generalized forwarding (e.g., as in OpenFlow work's routers. In the question below, wel want to create match+action entries in the flow table at router r2, with three ports labelled 1.2.3 (in black). In the question, es are constrained to be over only four fields: the IP source address, the IP destination address, the upper-layer protocol field of the IP datagram, and the destination port er of the transport-layer segment. The actions are either to drop or to forward(). that is, to forward a matching packet on port i. The default action (uniess stated otherwise) a packet doesn't match a rule, it will be dropped. COpenFlow controller 128.119/16 4 5

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

Question 7 Chapter 2 PART 3. Distance vector routing Consider the network topology in the figure above and assume that the routers are configured to use a distance vector routing protocol. NOTES: If a cell is empty, write down NONE. If any cell is left empty, you will get ZERO for that cell. Use INF for infinite (i.e. 0) Q1. What is the initial distance vector of node Y? DV of node Y Y V Q2. Node Y has received the vectors below from its neighbors. It will then recalculate its distance vector and update i routing table. What will be the routing table of node Y? From Z From X From V From T 01 6 3 14 4 20 12 6 V 20 14 16 3 19 1 New Routing table of node Y Cost Destination Next hop Y
HTTP/2 versus HTTP/1.1: object download delays. Consider a client and a server, separated by an RTT of 4 time units. The client makes a request for 4 objects at t=0. O1 consists of 10 frames, 02 and 04 each consist of 1 frame, and 03 consists of 2 frames. In the HTTP/2 example shown below, the server is transmitting frames to the client in the order 01, 02, 03, 04 (as long as there are frames of type i to transmit, and when not the server just moves on to a frame from object i+1 mod 4). Each frame takes 1 time unit to transmit. server GET O4 GET 03 GET O2 GET 01 object data requested client O4 O2 Оз Under HTTP 1.1 (not shown below), the server would send 01, 02, 03, O4 in that first-come-first-served (FCFS) order, sending each object in its entirety before moving on to send the next object in that order. Let's define the object download delay as the time from when an object is requested (at t=0 below) to the time that object is received in its entirety. What is the average object…
Describe the Split-Horison and Split-Horison with Poison Reverse heuristics used by RIP. Explain how they address the problem of routing loops.
C PROGRAMMING you are to write a TCP/IP server that can build up a graph of a network ofnetworks (using the supplied graph library and implementation of Dijkstra’s algorithm) and thenquery that graph to find out which link between two networks should be used as the next hop tosend a packet of data from one network to another within the network of networks (using thesupplied implementation of Dijkstra’s algorithm). using the following program as a start point: /* * NetworkServer.c * ProgrammingPortfolio Skeleton * */ /* You will need to include these header files to be able to implement the TCP/IP functions */#include <stdio.h>#include <stdlib.h>#include <string.h>#include <sys/types.h>#include <netinet/in.h>#include <netdb.h>#include <fcntl.h>#include <unistd.h>#include <errno.h>#include <sys/socket.h> /* You will also need to add #include for your graph library header files */ int main(int argc, const char * argv[]){ int…
4.05-2. Generalized forwarding: specifying a flow table entry (b). Consider the three-node network below, that uses flow-based generalized forwarding (e.g., as in OpenFlow) in the network's routers. In the question below, we'll want to create match+action entries in the flow table at router r2, with three ports labelled 1,2,3 (in black). In the question, matches are constrained to be over only four fields: the IP source address, the IP destination address, the upper-layer protocol field of the IP datagram, and the destination port number of the transport-layer segment. The actions are either to drop or to forward(i), that is, to forward a matching packet on port i. The default action (unless stated otherwise) is that if a packet doesn't match a rule, it will be dropped.
Consider a bipartite network with N1 and N2 nodes in the two sets. What is the maximum number of links Lmax the network can have? How many links cannot occur compared to a non-bipartite network of sizeN=N1 +N2? If N1<<N2, what can you say about the network density, that is the total number of links over the maximum number of links, Lmax? Find an expression connecting N1, N2 and the average degree for the two sets in the bipartite network, 〈k1〉 and 〈k2〉.
IN PYTHON Given the following six-node wide area network for which the numbers attached to the links are a measure of the “delay” in using that link (e.g., some lines could be more heavily used than others and therefore have a longer wait time), answer the following question. What is the shortest path from node A to node D, where shortest path is defined as the path with the smallest sum of the delays on each individual link? Explain exactly how you went about finding that path.
60 4 50 60 1 6 . 100 S 40 5 85 D 45 75 3 8 70 30 Is there any issue with the routing (Yes, No)? . What is this problem (name the problem if applicable): Q1- The figure above assumes using the location-based-routing, by looking at the representation, answer the following questions: 10 What is the solution for the problem (if any): Where the problem happened (on which node if any): 70
3. Consider the M/M/1 queue discussed in class. Assume that packets arrive to a queue with average arrival rate A [pkts/s]. The average service rate of the queue is denoted by u [pkts/s]. (a) Write expressions for: (i) the mean time between packet arrivals to the queue, i.e., the average inter-arrival time; and (ii) the mean service time, i.e., the average time needed to transmit a packet onto the outgoing link. (b) Let N denote the number of packets in the system in steady-state. Suppose A and u = 850 %3D 1000. Find the smallest value of B such that P(N > B) < € = 10-4. Hint: Use MATLAB or some other computational tool (you could even use an Excel spreadsheet) to test different values of B.
What is the shortest path from node A to node D, where shortest path is defined as the path with the smallest sum of the delays on each individual link? Explain exactly how you went about finding that path.
06. 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); From E: (7, 6, 3, 9, 0, 4) The measured delays to B, D and E are 6,3,5. What is the C's new routing table?
6.4-4. Self Learning Switches (a). Consider the network below with six nodes, star-connected into an Ethernet switch. Suppose that A sends a frame to A, A' replies to A, then B sends a message to B' and B' replies to B. Enter the values that are present in the switch's forwarding table after B'-to-B frame is sent and received. Assumed that the table is initially empty and that entries are added to the table sequentially. Answer the questions below from the pulldown list. C' B' S A 3 A' B What is the first entry added to the table? [Choose ] [Choose ] B,2 What is the second entry added to the table? C,6 What is the third entry added to the table? What is the fourth entry added to the table? C,3 A,4 B₁,5 A,1 [Choose ] <