Develop a simulation program to simulate an 8-port Ethernet switch. The switch initially has no knowledge about the hosts connected to each port. It learns frame addresses and stores-and- forwards the frames. The input text file "in.txt" contains information of the incoming frames, one frame per line. There are 4 pieces of data per line: frame ID, arrival port, frame source address, and frame destination address. The frames arrive at the switch in the order of which they appear in the input file. Destination address "X" indicates a broadcast frame. The output text file "out.txt" has 8 lines. Each line lists all the frames departing from each port, here is an example: "in.txt" contains 5 incoming frames: F1 P2 B-A F2 P6 D-C F3 P5 E--B F4 P7 F--D F5 P6 D--X "out.txt" should list the departing frames on each port: P1: F1 F2 F5 P2: F2 F3 F5 P3: F1 F2 F5 P4: F1 F2 F5 PS: F1 F2 FS P6: F1 F4 P7: FI F2 F5 I

Develop a simulation program to simulate an 8-port Ethernet switch. The switch initially has no knowledge about the hosts connected to each port. It learns frame addresses and stores-and- forwards the frames. The input text file "in.txt" contains information of the incoming frames, one frame per line. There are 4 pieces of data per line: frame ID, arrival port, frame source address, and frame destination address. The frames arrive at the switch in the order of which they appear in the input file. Destination address "X" indicates a broadcast frame. The output text file "out.txt" has 8 lines. Each line lists all the frames departing from each port, here is an example: "in.txt" contains 5 incoming frames: F1 P2 B-A F2 P6 D-C F3 P5 E--B F4 P7 F--D F5 P6 D--X "out.txt" should list the departing frames on each port: P1: F1 F2 F5 P2: F2 F3 F5 P3: F1 F2 F5 P4: F1 F2 F5 PS: F1 F2 FS P6: F1 F4 P7: FI F2 F5 I

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

Massages exchange between managers is possible in: A) SNMPv2 only B) SNMPv1 & SNMPv2 C) SNMPv2 & SNMPv3 D) SNMPv1 only
In a previous section, we mentioned that each thread running in the JVM is only allowed to have one method active at any one point in time. What information or experiences have led you to believe that this is the situation?
Pipelines often make use of programmes like sed and awk, which are designed to filter data in various ways. Which is it: true or untrue, this assertion?
the input consists of two integers x and y represented as strings of digits. The output is the sum z, also represented as a string of digits. The input can be viewed as a stream if the algorithm is first given the lowest digits of x and of y, then the second lowest, and so on. The algorithm outputs the characters of z as it proceeds. The only memory required is a single bit to store the carry bit. Because of these features, the algorithm can be modeled as a DFA.Write algorithm for Adding( ) pre-cond: The digits of two integers x and y are read in backwards in parallel. post-cond: The digits of their sum will be outputted backwards.
Please do not give solution in image format thanku are the answers right? if not solve it.
Can several data flows be captured?
Consider a program that accesses a single I/O device and compare unbuffered I/O to the use of a buffer. Show that the use of the buffer can reduce the running time by at most a factor of two.
A machine has a memory of 64 frames, with each frame being 1K bytes. Current free-frame list is: O×2E, Ox27, Ox37, Ox25, OX0C, Ox04, OXOE, Ox09, O×1D, Ox14, Ox16, Ox07, 0x22, 0×3E, and Ox30. You just scheduled a process that requires 10 frames. Show the resulting page table. Show the translation of logical address Ox240B and OX5A32 into physical addresses using your page table. Express your result in hex.
Consider user accounts on a computer system with a Web server configured to provide user Web areas. In general, this uses a standard directory name, such as “public_html,” in a user’s home directory. However, access control needs to be properly set to allow users (with or without user accounts on the system) to browse the webpages. Assuming there are one main page (index.html), two pictures files (a.jpg and b.jpg) stored in an sub-directory (Image) and one pdf file (c.pdf) stored in an sub-directory (Doc), all under the public_html. (a) Specify the access matrix for each directory (excluding home directory) and files that allows everyone to view the webpage. (b) Draw a directed graph that represented to the access matrix
Calculate the total page faults using the CLOCK algorithm and a window size = 3 frames Given the following reference string : 1 2 1 3 45 3245 6 4 3 2 Fill in chart. Include the use bit (required for last set of frames only) There is no internal fragmentation. Total page faults CLOCK algorithm The process running has at least The size of a frame is 256 bytes. The program has at least pages in the program. bytes 3 4 5265
Write an MPI program to calculate the communication time between two processes. Given an array of random integers, Write MPI_Send and MPI_Recv to send an entire array back and forth between process 0 and process 1 (two processes) for 1000 times. After one process receives the array, it sends this array back to the other process. The array is bounced back and forth between the two processes like a ping-pong ball for 1000 times. Use MPI_Wtime() to record the total time for arrays of 1 million integers, 2 million integers, 4 million integers, and 8 million integers.
using C/C++. Determine the number of page faults and page hits by considering the Frame size=3, Reference String =11 13 10 14 15 12 11 19 18 16 15 17 14 16 19 21. and imnlomont Ontimal olacemon