Answers to the quiz #4 in Computer Networks - Christian Rinderknecht
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 ...
Answers to the quiz #4 in Computer Networks Christian Rinderknecht 18 April 2008
Questions. 1. What advantage does a circuit-switched network have over a packetswitched network? What advantage does TDM have over FDM in a circuit-switched network? 2. Why is it that packet switching is said to employ statistical multiplexing? Contrast statistical multiplexing with the multiplexing that takes place in TDM. 3. What is meant by connection state information in a virtual circuit network? 4. Suppose you are developing a standard for a new type of network. You need to decide whether your network will use VCs or datagram routing. What are the pros and cons for using VCs? 5. What are the advantages of message segmentation in packet-switched networks? What are the disadvantages? 6. Is HFC bandwidth dedicated or shared among users? Are collisions possible in a downstream HFC channel? 7. Consider sending a series of packets from a sending host to a receiving host over a fixed route. List the delay components in the end-to-end delay for a single packet. Which of these delays are constant and which are variable? 8. Consider an application that transmits data at a steady rate: it generates an N -bit unit of data every k time units, where k is small and fixed. Also, when such an application starts, it will continue running for a long period of time. Answer the following questions, briefly justifying your answer. (a) Would a packet-switched network or a circuit-switched network be more appropriate for this application? Why? 1
(b) Suppose that a packet-switched network is used and the only traffic in this network comes from such applications as described above. Furthermore, assume that the sum of the application data rates is less than the capacities of each and every link. Is some form of congestion control needed? Why? Answers. 1. A circuit-switched network can guarantee a certain amount of endto-end bandwidth for the duration of the call. Most packet-switched networks today (including the internet) cannot make any end-to-end guarantees for bandwidth. In a circuit-switched network using TDM, an application can use the full bandwidth at periodical moments. 2. In a packet-switched network, the packets from different sources flowing into a link do not follow any fixed pattern, or route. This is why packet switching is said to employ statistical multiplexing. In case of TDM circuit switching, each host gets the same slot in a revolving TDM frame: this is completely predictable. 3. In a virtual circuit network, each packet switch keeps in memory some information (like a table translating interface numbers to virtual circuit numbers) about the virtual circuits passing through them. 4. The cons of VC’s include • the need to have a signaling protocol to set up and teardown the VCs; • the need to maintain connection state in the packet switches. The main advantage of VC networks is that they allow to guarantee an end-to-end delay. 5. One advantage of message segmentation is that it allows for pipelined transmission over a series of links. Another advantage is that, without it, small messages would be stuck behind much bigger ones in routers. 6. HFC bandwidth is shared among the users. On the downstream channel all the packets emanate from a single source, called the head end, so there are no collisions on this channel. 7. The delay components are nodal processing delays, transmission delays, propagation delays and queuing delays. Over a fixed route, all these delays are fixed, except the queuing delay, which is unpredictable. 8. (a) A circuit-switched network would be well suited to this application, because it involves long sessions with predictable bandwidth 2
requirements. So bandwidth can be reserved for each session. The delay of setting up a circuit is low compared to the time the application is running. (b) Given such generous link capacities, the network need no congestion control. In the worst case, all the applications are emitting on the same link, but the link offers enough bandwidth.
Oct 24, 2008 - Suppose a client uses a non-persistent connection to query a page made of a base html file and ten jpeg images, all objects being stored on ...
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 ...
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 ...
... 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 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 examination of Erlang. Christian Rinderknecht. 14 June 2007. 1 Merging sorted lists. Question. Write a function merge/2 which takes two lists ...
Quiz #1 of Erlang. Christian Rinderknecht. 3 April 2007. This time it is about shuffling ... Questions. Define shuffle3/3. 1. without tail recursion;. 2. with tail recursion.
Answers to the quiz on Compilers. Christian Rinderknecht. 29 November 2005. Question. Consider the following Lex regular expression and propose a transi-.
This extended version contains an extra Appendix with the proof of the claimed properties. ..... P ARx, specific to each algorithm, that may add or not some meta-.
Oct 19, 2008 - arguments of function Or, whose type, as given by the signature, is tÃt â t. It is very ... In mathematics, the integer sequence we give page 11.
Oct 31, 2008 - Property x · ǫ = ǫ · x = x holds for all strings x. ...... the same pair of nodes and listing the labels, separated by commas: q0 q1 q2. 0. 1. 0. 1. 0,1.
Compiler Engineer and Expert in Formal Methods ... Compiler Construction and Related Toolchains ... Technical Documentation and Scholarly Publications.
You also learn C, as a part of C++ or by itself (for system programming), so you are ... which is mainly an introduction to the Prolog programming language, al-.
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 ...
characters having a collective meaning; sets of lexemes with a common interpretation ... Rule 1 and 2 are non-recursive base rules, while the others define expres- sions in terms of ... An abstract syntax tree (or just syntax tree) is a compressed ve
Expert systems are more similar to a database of domain-specific infor- mations and logic rules (simpler than within proof assistants) which allow queries to be ...
Fonctionnels Et Traitement Du Diab Te Par Les Eaux De Vichy, Dumping In Dixie Race Class And. Environmental Quality Third Edition, Dynamics Of Asymmetric ...
Oct 12, 1998 - Principles of application layer protocols ... success after several days (often 5 days), the server removes the .... 3 Jul 01 15:17:39 GMT.
video-conference) because of its variable and unpredictable delays. (mainly queuing ... The advantage of message segmentation with packet switching is that.
Network access and physical media. ⢠ISPs and Internet backbones. ⢠Delay and loss in packet-switched networks. ⢠Protocol layers and their service models.
A single name server would have to handle all the dns queries. (from http requests and e-mails at hundreds of millions of hosts). ⢠A single name server cannot ...
Volume In Honor Of Samuel H Osipow Contemporary T, Corporate Resolutions ... online or by storing it on your computer, you have convenient answers with ...