Answers to the mid-term exam of Introduction to Networking - Christian
Apr 24, 2007 - (a) Provide a formula for the total delay, that is, the queuing delay plus the transmission delay. (b) Express the total delay as a function d of L/R, ...
Answers to the mid-term exam of Introduction to Networking Christian Rinderknecht 24 April 2007 1. Consider the queuing delay in a router buffer. Suppose all the packets are L bits long, the transmission rate is R bit/sec and that N packets arrive simultaneously at the buffer every LN /R seconds. Question. Find the average queuing delay of a packet. Hint. The queuing delay for the first packet is 0; for the second packet it is L/R; for the third packet it is 2L/R etc. The last packet (number N ) has already been transmitted when the second batch (i.e., group) of packets arrives. Answer. It takes N L/R seconds to transmit the N packets. Thus, the buffer is empty when a batch of N packets arrive. The first of the N packets has no queuing delay. The second packet has a queuing delay of L/R seconds. The n-th packet has a delay of (n − 1)L/R. Therefore the average delay is N N −1 L 1 ∑ L L 1 ∑ L 1 (N − 1)N 1 (n − 1) = n= = (N − 1) 2 N n=1 R R N n=0 RN 2 R
2. Questions. Consider the queuing delay in a router buffer. Let I denote the traffic intensity, that is: I = aL/R. Suppose that the queuing delay takes the form IL/R(1 − I) for I < 1. (a) Provide a formula for the total delay, that is, the queuing delay plus the transmission delay. (b) Express the total delay as a function d of L/R, that is to say, define d(x) = . . . Answers. (a) The total delay is IL L L 1 1 I + = = R(1 − I) R R1−I a1−I
(b) Let us call d(L/R) the total delay in function of L/R. We have L 1 L = R1−I R
1 1−
aL R
=
x = d(x) 1 − ax
where x = L/R. 3. We consider sending voice from host A to host B over a packet-switched network (for example, Internet phone). Host A converts analog voice to a digital 64 Kbps bit stream on the fly. Host A then groups the bits into a 48-byte packets. There is one link between host A and B; its transmission rate is 1 Mbps and its propagation delay is 2 msec. As soon as host A gathers a packet, it sends it to host B. As soon as host B receives an entire packet, it converts the packet’s bits into an analog signal. Question. How much time elapses from the time a bit is created (from the original analog signal at host A) until the bit is decoded (as part of the analog signal at host B)? Answer. Before any bit can be transmitted, all the bits in the same packet must be gathered first. This requires 48 × 8 sec = 6 msec 64 × 103 The time required to transmit the packet is 48 × 8 sec = 0.384 msec 1 × 106 The propagation delay is 2 msec. Therefore the delay between coding and decoding is 6 msec + 0.384 msec + 2 msec = 8.384 msec
Answers to the final examination of Introduction to Networking. Christian Rinderknecht. 19 June 2007. 1. Questions. Suppose two hosts A and B, separated by ...
For example, the communication might be a download of an MP3 audio file for .... of computer networks, if a portion of the network contains details that are not ..... http://www.ciscopress.com/title/1587131641, and load scenario NA01-0112. For.
Answers to the mid-term exam on Prolog. Christian Rinderknecht. 19 October 2006. 1 Matching. Question. Show the results (Yes/No) and resulting variable ...
Answers to the Final Exam on. Prolog Programming. Christian Rinderknecht. 3 December 2008. 1 Sorting leaves in a binary tree. Question. Design a simple ...
... does not contain X. Since the heads of rules 2 and 4 match a non empty S, X must only match [] in the new rule 5, which can then be further simplified as ...
Answers to the final exam on Algebraic. Specification. Christian Rinderknecht. 17 June 2005. 1 Binary tree specification. Let us recall an algebraic specification ...
Answers to the final examination of Erlang. Christian Rinderknecht. 14 June 2007. 1 Merging sorted lists. Question. Write a function merge/2 which takes two lists ...
Oct 4, 2005 - know exactly their names for the C language, we still can find meaningful names based on what ... The method to answer these questions is simply to try small words by constructing ... Let us test the membership with x = aba:.
LBM theory, discuss essential advantages and limitations of the method, and focus on ... All theoretical and exercise lectures will be given in room CC2.21.
Apr 18, 2008 - Answer the following questions, briefly jus- tifying your answer. (a) Would a packet-switched network or a circuit-switched network be more ...
a user's card and password to be verified, the account balance (which is main- tained at the bank) to be queried, and an account withdrawal to be made. (money ...
What are the five layers in the Internet protocol stack? What are the principal responsibilities of each of these layers? 2. What information is used by a process ...
Nov 16, 2000 - procedures. This is a very brief introduction and only covers just a fraction of all of the features of SAS. ..... This introduction shows just the essentials that you need to know for using SAS ...... Limit Means Limit .... If SAS see
What are the advantages of message segmentation in packet-switched ... are variable? ... Five generic tasks are error control, flow control, segmentation and.
Dec 12, 2007 - Perturbation theory starts from what is known to evaluate what is not known, hoping that the difference is small... Let's say we know G0 that ...
Oct 29, 2001 - com Txbyte ;Invert everything ... #define b 66 ; 2400 bps for the ATtiny15L -- calculated val works ok .... send the value $FF (which is transmitted as a low-level start bit followed by all-high bits defining the $FF value and the stip
own behavior, and none of this book is to be considered legal, personal or medical advice ...... The human mind is sensitized to the number of ...... musical ability.
mode, checksum checking is not enabled and the last byte will always be 0xFF, ... if(dataResp==0x05) {debug("Done writing %d bytes\n",BLOCK);return true;} ..... a synchronous protocol with an unrestricted delay between clock cycles, one ...
Oct 7, 2004 - ... implemented as described in section 10 of the Technical Data book. ..... cpt++; printf ("%u($%x) -> ",buf&0x000000FF,buf&0x000000FF);.
Answers to quiz #1 on Algebraic Specification. Christian Rinderknecht. 17 May 2005. 1 Arrays. We want an algebraic specification of arrays. An array is a list ...
Answers to the quiz on Compilers. Christian Rinderknecht. 29 November 2005. Question. Consider the following Lex regular expression and propose a transi-.
Voting Disk >= 20MB, OCR >= 100MB. â Use storage mirroring to protect these devices. Configure shared Storage (for ASM). â Use large number of similarly ...