a) i) With respect to computer simulation, explain the terms: steady state, pseudo randomnumber generator, stopping criteria.ii) A packet router receives packets at a rate of 1 million packets per second. The queueformation in the router is modelled as an M/M/1 queue. If the mean packet length is1000 bytes, what is the output bitrate (in bps) needed (at the router) to ensure that thePr(queue > 100 packets) ≤ 0.00001?iii) A Call Centre has no call waiting facility, and so loses blocked calls. What formula isused to evaluate call blocking probability? Use this formula, or a more convenientapproximation, to find the call blocking probability if the applied traffic is 50 Erlangs andthe number of servers is 50.

(i)Use of a computer to represent the dynamic response of a system by simulating its behavior in…

Answered: With respect to computer simulation,…

Similar questions

Don't use ai to answer I will report your answer .. Solve it Asap with explanation and all parts
(a) Suppose a server S and client C are connected over the Internet. The one-way prop- agation delay from S to C is 50 ms. The maximum throughput between S and C is R = 200 Mbps. A browser on client C makes an HTTP request for a webpage on server S. The base HTML file is of size 500 KB and it references five objects, each of size 5 MB. Find the total response time for the client to receive the entire webpage using nonpersistent HTTP with up to two parallel connections. Assume that when two par- allel connections are active, the throughput for each connection is 40% of the maximum throughput R. (b) Suppose an application running on host ece.gmu.edu needs to resolve the domain name cs.vtech.edu. Draw a diagram (with labels) showing the sequence of queries/responses in a recursive DNS query to find the answer in a scenario where all levels of the DNS hierarchy are involved.
Computer Science 1.a) In a TCP communication, the receiver set the window size, rwnd=850. On the sender side, Sf=1077 and Sn=1115. The receiver sent an acknowledgement packet with ackNo=1097 and rwnd=830. What is the sliding window size on the sender’s end? Did the window open or close on the sender’s end and from which direction/s (e.g left and/or right direction/s)? b)For the above scenario, the sender now sends 50 bytes and awaits an acknowledgment. What is the Sf and Sn now?
A frame containing http request is sent from Computer (A) [in whichever subnet it is now, make sure to show it in your figure], to the access point it is associated with. Draw the address fields (1, 2, and 3) of the frame travelling from Computer A to AP and the source and destination addresses of the frame travelling from AP to R1. The MAC addresses of AP1, AP2, and AP3 are M1, M2, and M3 respectively, and the Router R1’s MAC address connected to this Switch/AP is MRA. IP address values are already given, and the port addresses could also be used as given. The Router’s MAC address facing WAN side is MRW.
In computing, time scales usually store the current time as the number of seconds that have elapsed since the beginning of some “epoch”, which is an arbitrary date that determines the starting time. For example, the Network Time Protocol (NTP) uses an epoch of midnight on January 1st (GMT) 1900. The elapsed seconds since the epoch are stored in a 32-bit unsigned integer. In many embedded systems, it is more practical to just consider the current year. In this case, the format is often modified such that 0 corresponds to midnight on January 1stof the current year. If a clock that was initialized to 0 at midnight of 1 January 2020 currently has a count of 3665044 seconds, what day and time does it represent? (For example, your answer should be in the form June 6, 8:47:12 am) Show your work
Computer science
A message can follow different paths through servers on a network. The sender’s message can go to one of five servers for the first step; each of them can send to five servers at the second step; each of those can send to four servers at the third step, and then the message goes to the recipient’s server. a. How many paths are possible? b. If all paths are equally likely, what is the probability that a message passes through the first of four servers at the third step?
6.4-6. Self Learning Switches (c). 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, and then A sends to B and B replies to A. In this sequence of frame transmissions, how many frames have appeared at the interface at C'? Assume that the switch's table is initially empty. [Note: You can find more examples of problems similar to this here.]
Consider both questions pls....
In modern packet-switched networks, including the Internet, the source host segments long, application-layer messages (for example, an image or a music file) into smaller packets and sends the packets into the network. The receiver then reassembles the packets back into the original message. We refer to this process as message segmentation. Figure 1.27 illustrates the end-to-end transport of a message with and without message segmentation. Consider a message that is 8. 106 bits long that is to be sent from source to destination in Figure 1.27. Suppose each link in the figure is 2 Mbps. Ignore propagation, queuing, and processing delays. a. Consider sending the message from source to destination without message segmentation. How long does it take to move the message from the source host to the first packet switch? Keeping in mind that each switch uses store-and-forward packet switching, what is the total time to move the message from source host to destination host? b. Now suppose that…
Suppose that the average object size is 850,000 bits and that the average request rate from the institution’s browsers to the origin servers is 16 requests per second. Also suppose that the amount of time it takes from when the router on the Internet side of the access link forwards an HTTP request until it receives the response is three seconds on average (see Section 2.2.5). Model the total average response time as the sum of the average access delay (that is, the delay from Internet router to institution router) and the average Internet delay. For the average access delay, use Δ/(1 – Δ ), where Δ is the average time required to send an object over the access link and is the arrival rate of objects to the access link. a. Find the total average response time.b. Now suppose a cache installed in the institutional LAN, Suppose the miss rate is 0.4. Find the total response time.
TCP congestion control example. Consider the figure below, where a TCP sender sends 8 TCP segments at t = 1, 2, 3, 4, 5, 6, 7, 8. Suppose the initial value of the sequence number is 0 and every segment sent to the receiver each contains 100 bytes. The delay between the sender and receiver is 5 time units, and so the first segment arrives at the receiver at t = 6. The ACKs sent by the receiver at t = 6, 7, 8, 10, 11, 12 are shown. The TCP segments (if any) sent by the sender at t = 11, 13, 15, 16, 17, 18 are not shown. The segment sent at t=4 is lost, as is the ACK segment sent at t=7. TCP sender t=1 T t=2 t=3 t=4+ t=5- t=6+ t=11 t=12 t=13 t=14 t=15 t=16 t=17 t=18 I data segment data segment data segment data segment data segment data segment data segment data segment ACK ACK ACK ACK ACK ACK Ty A A V V htt TCP receiver t=6 t=7 t=8 t=9 t=10 t=11 t=12 t=13 What does the sender do at t=17? You can assume for this question that no timeouts have occurred.

SEE MORE QUESTIONS