Computer Networks I (spring 2008)
|
|
- Alison Shelton
- 7 years ago
- Views:
Transcription
1 521261A Computer Networks I (spring 2008) Problem set #5
2 Problem solving session #5 Time: Fri at 12:15-13:45 Location: TS101 Intermediate exam #5 Time: Mon at 10:15-11:45 11:45 Location: L2 Material: lectures #9-#13#13 Remember to bring a photo ID and a calculator complying with ih the department s rules
3 Problem #1 (Q) A web page consisting of a base HTML page (10 kb in size) and ten JPEG images (each 50 kb in size) is requested by a browser in a 10 Mbps network where RTT between the browser and the serveris 100 ms. Compute the totalt HTTP response time for: (a) non-persistent HTTP with no parallel connections; (b) persistent HTTP with pipelining. For simplicity, you can ignore any server idle times, network congestion and TCP slow start (i.e. TCP is assumed to transmit at full speed immediately right after the connection is set up).
4 Problem #1 (A) (a) non-persistent HTTP with no parallel connections Total HTTP response time = response time for HTML page + response times for the ten images = connection setup (RTT) + request for HTML page (RTT) + transmission delay for HTML page + 10 x (connection setup (RTT) + request for image (RTT) + transmission delay) = 2xRTT x8/ x (2xRTT x8/ ) = 208 ms + 10 x (200 ms + 40 ms) = 208 ms ms = s (b) persistent HTTP with pipelining Total HTTP response time = response time for HTML page + response times for the ten images = 2xRTT + transmission delay to request and receive base HTML file + 1xRTT + transmission delay to request and receive the ten images = 208 ms ms ms = s
5 Problem #2 (Q) Consider the figure right, where an institutional network is connected to the Internet. Suppose that the average object size is bits and that t the average request rate from the institution s browsers to the origin servers is in total 1.5 requests per second. Suppose that the amount of time from when the router on the Internet side of the access link forwards an HTTP request to the origin servers till it receives the response is two seconds s on average. Model the total average response time as the sum of the average access delay (that is, the delay from the Internet router to the 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) Compute the total average response time. (b) Now suppose a web proxy server (cache) is installed in the institutional LAN. Suppose that the hit rate of the proxy server (that is, the proportion of the HTTP requests satisfied by the proxy server) is 0.4. Compute the total average response time, assuming that the response time is approximately zero when the request is satisfied by the proxy server.
6 Problem #2 (A) (a) The average time to transmit an object of bits over the 1.5 Mbps link: Δ = (0.9x10 6 bits) / (1.5x10 6 bits/s) = 0.6 s Arrival rate of objects to the access link: β =1.51/s Average access delay = Δ/(1 Δβ) = 0.6 s / (1 0.6 s x 1.5 1/s) = 0.6 s / (1 0.9) = 6.0 s Average Internet delay = 2.0 s Total average response time = average access delay + average Internet delay = 6.0s s = 8.0 s [Δβ =0.6s x 1.5 1/s = 0.9 is the traffic intensity on the access link]
7 Problem #2 (A) (cont.) (b) 60% of requests are satisfied by the origin servers (i.e. 40% by the proxy server), hence now the arrival rate of objects to the access link: β = 60% 1.5 1/s = 0.9 1/s Average access delay = Δ/(1 Δβ) = 0.6 s / (1 0.6 s x 0.9 1/s) = 0.6 s / (1 0.54) = 1.30 s Average response time for 60% requests satisfied by origin servers = average access delay +average Internet delay = 1.30 s s = 3.30 s Average response time for 40% requests satisfied by proxy server = 0.0 s Total average response time = 0.6 x 3.30 s x 0.0 s = 1.98 s [Now traffic intensity on the access link is 0.54]
8 Problem #3 (Q) (a) Consider the two modes of communication between a managing entity and a managed device, request response and trapping. What are the pros and cons of these two approaches in terms of: (i) () overhead; (ii) notification time when exceptional events occur; and (iii) robustness with respect to lost messages between the managing entity and the device? (b) Why do you think the designers of SNMP chose UDP rather than TCP as the transport protocol of choice for SNMP? (c) Because SNMP uses two different port numbers (UDP ports 161 and 162), a single system can easily run both a manager and an agent. What would happen if the same port number were used for both?
9 Problem #3 (A) (a) (i) Overhead Request response mode will generally have more overhead (measured in terms of the number of messages exchanged) for several reasons. First, each piece of information received by the manager requires two messages: the poll and the response. Trapping generates only a single message to the sender. If the manager really only wants to be notified when a condition occurs, polling has more overhead, since many of the polling messages may indicate that the waited-for condition has not yet occurred. Trapping generates a message only when the condition occurs. (ii) Notification time Trapping will also immediately notify the manager when an event occurs. With polling, the manager needs will need to wait for half a polling cycle (on average) between when the event occurs and the manager discovers (via its poll message) that the event has occurred. (iii) Robustness wrt. lost messages If a trap message is lost, the managed device will not send another copy. If a poll message, or its response, is lost the manager would know there has been a lost message (since the reply never arrives). Hence the manager could repoll, if needed.
10 Problem #3 (A) (cont.) (b) Often, the time when network management is most needed d is in times of stress, when the network may be severely congested and packets are being lost. With SNMP running over TCP, TCP's congestion control would cause SNMP to back-off and stop sending messages at precisely the time when the network manager needs to send SNMP messages. (c) If the same port were used for both traps and requests, separating the manager from the agent in the same system would be difficult.
11 Problem #4 (Q) Consider the following two FEC schemes. Scheme A generates a redundant d chunk for every four original chunks, by exclusive ORing the four original chunks. Scheme B piggybacks into the original i stream a lower bit-rate stream whose bit rate is 25% of the bit-rate of the original i stream. (a) How much additional bandwidth does each scheme require? (b) How much playback delay each scheme add? (c) Which scheme will provide better audio quality if the first packet is lost is every group of five packets in transmission? (d) Which scheme will provide better audio quality if the first packet is lost is every group of two packets in transmission?
12 Problem #4 (A) (a) Scheme A requires 25% more bandwidth (one redundant chunk is generated for every four original chunks) Scheme B requires 25% more bandwidth, as well. (b) Scheme A has a playback delay of 5 packets, to receive all 5 (4+1) packets. Scheme B has a playback delay of 2 packets, to receive the next packet containing the lower bit-rate chunk. (c) Scheme A. Scheme A will be able to reconstruct the original high-quality audio encoding. Scheme B will use the low quality audio encoding for the lost packets and will therefore have lower overall quality. (d) Scheme B. In scheme A many of the original packets will be lost and audio quality will be very poor. In scheme B every audio chunk will be available at the receiver, although only the low quality version will be available for every other chunk, but audio quality will still be acceptable.
13 Problem #5 (Q) Consider the figure below, where a sender begins sending packetized audio at t=1. The first packet arrives at the receiver at t=8. Each vertical/horizontal line segment has length of 1, 2, or 3 time units. (a) What are the delays (from sender to receiver, ignoring any playout delays) of 2nd, 3rd, 4th and 5th packets sent? (b) If audio playout begins as soon as the 1st packet arrives at the receiver at t=8, which of the first 8 packets will not arrive in time for playout? (c) Repeat (b) for playout beginning at t=9. (d) What is the minimum playout delay at the receiver that results in all of the first 8 packets arriving in time for playout?
14 Problem #5 (A) (a) Delays in slots (time units): 2nd packet 8, 3rd packet 8, 4th packet 7, 5th packet 9 (b) Packets 2, 3, 5, 6, 7 and 8 will not be received in time for playout, if playout begins at t=8. (c) Packets 5 and 6 will not be received in time for playout, if playout begins at t=9. (d) If playout begins at t=10, no packets will arrive after their playout time.
15 Problem #6 (Q) Consider the system on the next slide, where a token bucket polices a stream of packets. The token bucket can hold at most two tokens and it is initially full at t=0. New tokens arrive at a rate of 1 token per time slot. The output link speed is such that if two packets obtain tokens at the beginning of a time slot, they can both pass to the output link in the same slot. The timing details of the system are as follows: a. Packets (if any) arrive at the beginning of the slot. Thus, in the diagram below, packets 1 and 2 arrive in slot 0. If there are already packets in the queue, then the arriving packets join the end of the queue. Packets proceed toward the front of the queue in FIFO manner. b. If, after the arriving packets (if any) have been added d to the queue, there are any queued packets, one or two of those packets, depending on the number of available tokens, will each remove a token from the token buffer and pass to the output link during that slot. Thus, as shown in the diagram below, packets 0 and 1 each remove a token from the buffer (since there are initially two tokens) and pass to the output link during slot 0. c. A new token is added to the token bucket if it is not full, at the token generation rate of 1 token/slot. d. Time then advances to the next time slot, and steps a-d are repeated.
16 Problem #6 (Q) (cont.) In form of a table, show for each time slot from t=0 to t=8: (i) The packets that are in the queue and the number of tokens in the bucket, immediately after the arrivals have been processed (see step a above) but before any of the packets have passed through the queue and removed a token. Thus, for the t=0 time slot in the diagram, packets 1 and 2 are in the queue, and there are two tokens in the buffer. (ii) The packets that appear on the output after the token(s) have been removed from the queue. Thus, for the t=0 time slot in the diagram, packets 1 and 2 appear on the output link from the leaky buffer during slot 0. Thus, the first row in the table is: slot 0; packets 1 and 2 in queue; 2 tokens in bucket before output; packets 1 and 2 on output.
17 Problem #6 (A) Time slot Packets in queue Number of tokens before output Packets on output 0 1, 2 2 1, , , none 1 none , 9, ,
18 Problem #7 (Q) Consider the figure below. In questions (a)-(d), assuming the designated service, show in a table the time at which each of the packets 2 through 12 leaves the queue. Further, for each packet show also the delay between its arrival and the beginning g of the slot in which it is transmitted, and compute the average delay over the 12 packets. (a) FIFO service. (b) Priority service, so that odd-numbered (1, 3...) packets are high priority and even- numbered (2, 4...) packets are low priority. (c) Round robin service, so that packets 1, 2, 3, 6, 11, and 12 are from class 1, and other packets are from class 2. (d) WFQ service, so that odd-numbered packets are from class 1, and even-numbered packets are from class 2. Class 1 has a WFQ weight of 2, while class 2 has WFQ weight of 1. Note that it may not be possible to achieve an ideal WFQ schedule for each packet.
19 Problem #7 (A) (a) FIFO service. Packet Arrival slot Transmission slot Delay average delay = 19/12 = 1.583
20 Problem #7 (A) (cont.) (b) Priority service, so that odd-numbered (1, 3...) packets are high h priority and even-numbered (2, 4...) packets are low priority. Packet Class Arrival slot Transmission slot Delay 1 H L H L H L H L H L H L average delay = 19/12 = 1.583
21 Problem #7 (A) (cont.) (c) Round robin service, so that packets 1, 2, 3, 6, 11, and 12 are from class 1, and other packets are from class 2. Packet Class Arrival slot Transmission slot Delay average delay = 19/12 = 1.583
22 Problem #7 (A) (cont.) (d) WFQ service, so that odd-numbered packets are from class 1, and even-numbered packets are from class 2. Class 1 has a WFQ weight of 2, while class 2 has WFQ weight of 1. Note that it may not be possible to achieve an ideal WFQ schedule for each packet. WFQ weights effectively mean that for a set of three arrival slots we would want to transmit two packets from class 1 and one packet from class 2, so that class 1 packets go before class 2 packets. We implement WFQ by dividing time into disjoint sets of three arrival slots (0-2, 3-5, 6-8, 9-11) and for each set of arrival slots we consider the packets that are available for transmission during those three slots. Slots 0-2: it is possible to sent two class 1 packets (packets 1, 3) and one class 2 packet (packet 2). Slots 3-5: it is possible to send two class 1 packets (packets 5, 7) and one class 2 packet (packet 4). Slots 6-8: it is possible to send only one class 1 packet (packets 9), so we send two class 2 packets (packets 6,8) after sending packet 9. Slots 9-11: there is only one more class 1 packet (11) to send, followed by last two class 2 packets (10,12)
23 Problem #7 (A) (cont.) Packet Class Arrival slot Transmission slot Delay average delay = 19/12 = We see that the average delay of a packet is the same in all cases! This illustrates an important conservation n law of queuing u systems: as long as the queue u is kept busy whenever there is a packet queued, the average packet delay will be the same, regardless of the scheduling discipline. Of course, specific packets will suffer higher or lower delays under different scheduling disciplines, but the average will always be the same.
24 Problem #8 (Q) A host produces packets at a rate of 30 MB/s for the duration of 100 ms. Show the data rate of the resulting packet flow on a timeline, when the traffic generated by the host is controlled with: (a) a token bucket, which is filled to its original capacity of 1 MB and which has token arrival rate of 5 MB/s. (b) the token bucket of (a) followed with a 10 MB/s leaky bucket.
25 Problem #8 (A) (a) The amount of data produced by the host: D = 30 MB/s x 100 ms = 3.0 MB Let s first compute how long the token bucket can support the 30 MB/s burst rate: orig_cap + token_rate x burst_len = burst_rate x burst_len 1 MB + 5 MB/s x T1 = 30 MB/s x T1 T1 = 1 MB / (30 MB/s - 5 MB/s) = 40 ms The amount of data transferred during T1: D1 = 30 MB/s x 40 ms = 1.2 MB This means that 1.8 MB of data (D - D1) is remaining to be transferred according to the token arrival rate of 5 MB/s: T2 = 1.8 MB / 5 MB/s = 360 ms The data rate of the output of the token bucket on a timeline: 0 40 ms: 30 MB/s ms: 5 MB/s
26 Problem #8 (A) (cont.) (b) The cumulative output C(t) of the token bucket is: C(t) () = 30 MB/s x t, 0 < t 40 ms C(t) = 1.2 MB + 5 MB/s x (t 40 ms), 40 ms < t 400 ms C(t) () = 3.0 MB, t > 400 ms C(t) is fed to the leaky bucket, which processes L(t) = 10 MB/s x t amount of data in time t. The output of the leaky bucket is the maximum 10 MB/s as long as there is data in the leaky bucket. The amount of data left D(t) in the leaky bucket is D(t) = C(t) L(t): [D(t) = 20 MB/s x t, 0 < t 40 ms] D(t) = 1.2 MB + 5 MB/s x (t 40 ms) 10 MB/s x t, 40 ms< t 400 ms [D(t) = 3.0 MB 10 MB/s x t, t > 400 ms] 1.2 MB + 5 MB/s x (t 40 ms) 10 MB/s x t 0 t (1.2 MB 0.2 MB) / 5 MB/s = 200 ms Hence, the output of the leaky bucket on a timeline: ms: 10 MB/s ms:5 MB/s
27 Problem #9 (Q) RTP is used to transmit CD quality audio, which makes a pair of 16 bit samples times in a second, one sample for each of the stereo channels. (a) How many packets per second must RTP transmit, if audio data is transmitted in 1024 byte chunks? (b) What is the bit rate (in bps) of the resulting IP traffic?
28 Problem #9 (A) (a) Each sample occupies 4 bytes (2 x 16 bit samples). This gives a total of 1024/4 = 256 samples per packet. There are samples/s, so with 256 samples/packet, it takes 44100/256 ~ packets to transmit one second s worth of music. (b) one IP datagram = 1024 bytes (data) + 12 bytes (RTP header) + 8 bytes (UDP header) + 20 bytes (IP header) = 1064 bytes data rate = 44100/256 x 1064 bytes x 8 bits/byte = 1.47 Mbps
29 Problem #10 (Q) Consider the network below. The correspondent node sends UDP segment to the mobile bl node using Mobile bl IP. Consider the IP datagrams A, B and C. What are the source and destination IP addresses, and the payload of these datagrams?
30 Problem #10 (A) source IP destination IP payload A: UDP segment B: HA s IP datagram A C: mobile host s reply
31 Problem #11 (Q) Consider the principle of using a KDC shown below. Is it necessary for the KDC to know for sure it is talking to Alice when it receives a request for a secret key that Alice can share with Bob? Why or why not?
32 Problem #11 (A) No. Suppose that Trudy had sent the message I m Alice and I want to talk to Bob. The KDC would just return K A,KDC (K A,B ) which can be decrypted only by Alice because she is the only other entity holding the secret key K A,KDC.
33 Problem #12 (Q) Diagram below shows how Alice uses symmetric key cryptography, public key cryptography and digital signature to provide secrecy, sender authentication and message integrity. it With a similar il diagram show the corresponding operations that Bob must perform on the package received from Alice.
34 Problem #12 (A) 1. Bob deconcatenates (divides) incoming packet into K B+ (K S ) and K S (m,k A- (H(m))) 2. Bob decrypts K B+ (K S ) with his private key K B- to obtain session key K S 3. Bob decrypts K S (m,k A- (H(m))) with session key K S to obtain m,k A- (H(m)) 4. Bob deconcatenates m,k A- (H(m)) into m and K A- (H(m)) 5. Bob decrypts K A- (H(m)) with Alice s public key K A+ to obtain H(m) 6. Bob applies hash function H to m and compares the outcome to H(m) obtained in step 5
Final for ECE374 05/06/13 Solution!!
1 Final for ECE374 05/06/13 Solution!! Instructions: Put your name and student number on each sheet of paper! The exam is closed book. You have 90 minutes to complete the exam. Be a smart exam taker -
More informationFirst Midterm for ECE374 03/09/12 Solution!!
1 First Midterm for ECE374 03/09/12 Solution!! Instructions: Put your name and student number on each sheet of paper! The exam is closed book. You have 90 minutes to complete the exam. Be a smart exam
More informationFirst Semester Examinations 2011/12 INTERNET PRINCIPLES
PAPER CODE NO. EXAMINER : Martin Gairing COMP211 DEPARTMENT : Computer Science Tel. No. 0151 795 4264 First Semester Examinations 2011/12 INTERNET PRINCIPLES TIME ALLOWED : Two Hours INSTRUCTIONS TO CANDIDATES
More informationDigital Audio and Video Data
Multimedia Networking Reading: Sections 3.1.2, 3.3, 4.5, and 6.5 CS-375: Computer Networks Dr. Thomas C. Bressoud 1 Digital Audio and Video Data 2 Challenges for Media Streaming Large volume of data Each
More informationNote! The problem set consists of two parts: Part I: The problem specifications pages Part II: The answer pages
Part I: The problem specifications NTNU The Norwegian University of Science and Technology Department of Telematics Note! The problem set consists of two parts: Part I: The problem specifications pages
More information6.6 Scheduling and Policing Mechanisms
02-068 C06 pp4 6/14/02 3:11 PM Page 572 572 CHAPTER 6 Multimedia Networking 6.6 Scheduling and Policing Mechanisms In the previous section, we identified the important underlying principles in providing
More informationTransport Layer Protocols
Transport Layer Protocols Version. Transport layer performs two main tasks for the application layer by using the network layer. It provides end to end communication between two applications, and implements
More informationComputer Networks Homework 1
Computer Networks Homework 1 Reference Solution 1. (15%) Suppose users share a 1 Mbps link. Also suppose each user requires 100 kbps when transmitting, but each user transmits only 10 percent of the time.
More informationEINDHOVEN UNIVERSITY OF TECHNOLOGY Department of Mathematics and Computer Science
EINDHOVEN UNIVERSITY OF TECHNOLOGY Department of Mathematics and Computer Science Examination Computer Networks (2IC15) on Monday, June 22 nd 2009, 9.00h-12.00h. First read the entire examination. There
More informationThe network we see so far. Internet Best Effort Service. Is best-effort good enough? An Audio Example. Network Support for Playback
The network we see so far CSE56 - Lecture 08 QoS Network Xiaowei Yang TCP saw-tooth FIFO w/ droptail or red Best-effort service Web-surfing, email, ftp, file-sharing Internet Best Effort Service Our network
More information15-441: Computer Networks Homework 2 Solution
5-44: omputer Networks Homework 2 Solution Assigned: September 25, 2002. Due: October 7, 2002 in class. In this homework you will test your understanding of the TP concepts taught in class including flow
More informationBroadband Networks. Prof. Dr. Abhay Karandikar. Electrical Engineering Department. Indian Institute of Technology, Bombay. Lecture - 29.
Broadband Networks Prof. Dr. Abhay Karandikar Electrical Engineering Department Indian Institute of Technology, Bombay Lecture - 29 Voice over IP So, today we will discuss about voice over IP and internet
More informationCongestion Control Review. 15-441 Computer Networking. Resource Management Approaches. Traffic and Resource Management. What is congestion control?
Congestion Control Review What is congestion control? 15-441 Computer Networking What is the principle of TCP? Lecture 22 Queue Management and QoS 2 Traffic and Resource Management Resource Management
More informationMidterm Exam CMPSCI 453: Computer Networks Fall 2011 Prof. Jim Kurose
Midterm Exam CMPSCI 453: Computer Networks Fall 2011 Prof. Jim Kurose Instructions: There are 4 questions on this exam. Please use two exam blue books answer questions 1, 2 in one book, and the remaining
More informationQuality of Service versus Fairness. Inelastic Applications. QoS Analogy: Surface Mail. How to Provide QoS?
18-345: Introduction to Telecommunication Networks Lectures 20: Quality of Service Peter Steenkiste Spring 2015 www.cs.cmu.edu/~prs/nets-ece Overview What is QoS? Queuing discipline and scheduling Traffic
More informationClasses of multimedia Applications
Classes of multimedia Applications Streaming Stored Audio and Video Streaming Live Audio and Video Real-Time Interactive Audio and Video Others Class: Streaming Stored Audio and Video The multimedia content
More informationUnderstanding Slow Start
Chapter 1 Load Balancing 57 Understanding Slow Start When you configure a NetScaler to use a metric-based LB method such as Least Connections, Least Response Time, Least Bandwidth, Least Packets, or Custom
More informationExam 1 Review Questions
CSE 473 Introduction to Computer Networks Exam 1 Review Questions Jon Turner 10/2013 1. A user in St. Louis, connected to the internet via a 20 Mb/s (b=bits) connection retrieves a 250 KB (B=bytes) web
More informationVoice-Over-IP. Daniel Zappala. CS 460 Computer Networking Brigham Young University
Voice-Over-IP Daniel Zappala CS 460 Computer Networking Brigham Young University Coping with Best-Effort Service 2/23 sample application send a 160 byte UDP packet every 20ms packet carries a voice sample
More informationNote! The problem set consists of two parts: Part I: The problem specifications pages Part II: The answer pages
Part I: The problem specifications NTNU The Norwegian University of Science and Technology Department of Telematics Note! The problem set consists of two parts: Part I: The problem specifications pages
More informationScheduling for QoS Management
Scheduling for QoS Management Domenico Massimo Parrucci Condello isti information science Facoltà and di Scienze technology e Tecnologie institute 1/number 1 Outline What is Queue Management and Scheduling?
More information1. The subnet must prevent additional packets from entering the congested region until those already present can be processed.
Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because routers are receiving packets faster than they can forward them, one
More informationSources: Chapter 6 from. Computer Networking: A Top-Down Approach Featuring the Internet, by Kurose and Ross
Multimedia Communication Multimedia Systems(Module 5 Lesson 2) Summary: H Internet Phone Example Making the Best use of Internet s Best-Effort Service. Sources: H Chapter 6 from Computer Networking: A
More informationComputer Networks - CS132/EECS148 - Spring 2013 ------------------------------------------------------------------------------
Computer Networks - CS132/EECS148 - Spring 2013 Instructor: Karim El Defrawy Assignment 2 Deadline : April 25 th 9:30pm (hard and soft copies required) ------------------------------------------------------------------------------
More informationLecture 16: Quality of Service. CSE 123: Computer Networks Stefan Savage
Lecture 16: Quality of Service CSE 123: Computer Networks Stefan Savage Final Next week (trust Blink wrt time/location) Will cover entire class Style similar to midterm I ll post a sample (i.e. old) final
More informationCSE 473 Introduction to Computer Networks. Exam 2 Solutions. Your name: 10/31/2013
CSE 473 Introduction to Computer Networks Jon Turner Exam Solutions Your name: 0/3/03. (0 points). Consider a circular DHT with 7 nodes numbered 0,,...,6, where the nodes cache key-values pairs for 60
More informationReview: Lecture 1 - Internet History
Review: Lecture 1 - Internet History late 60's ARPANET, NCP 1977 first internet 1980's The Internet collection of networks communicating using the TCP/IP protocols 1 Review: Lecture 1 - Administration
More informationMul$media Networking. #3 Mul$media Networking Semester Ganjil PTIIK Universitas Brawijaya. #3 Requirements of Mul$media Networking
Mul$media #3 Mul$media Semester Ganjil PTIIK Universitas Brawijaya Schedule of Class Mee$ng 1. Introduc$on 2. Applica$ons of MN 3. Requirements of MN 4. Coding and Compression 5. RTP 6. IP Mul$cast 7.
More information(Refer Slide Time: 02:17)
Internet Technology Prof. Indranil Sengupta Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture No #06 IP Subnetting and Addressing (Not audible: (00:46)) Now,
More informationLecture 33. Streaming Media. Streaming Media. Real-Time. Streaming Stored Multimedia. Streaming Stored Multimedia
Streaming Media Lecture 33 Streaming Audio & Video April 20, 2005 Classes of applications: streaming stored video/audio streaming live video/audio real-time interactive video/audio Examples: distributed
More informationNetwork Management Quality of Service I
Network Management Quality of Service I Patrick J. Stockreisser p.j.stockreisser@cs.cardiff.ac.uk Lecture Outline Basic Network Management (Recap) Introduction to QoS Packet Switched Networks (Recap) Common
More informationSources: Chapter 6 from. Computer Networking: A Top-Down Approach Featuring the Internet, by Kurose and Ross
M ultimedia Communication Multimedia Systems(Module 5 Lesson 3) Summary: Beyond Best-Effort Motivating QoS Q uality of Service (QoS) Scheduling and Policing Sources: Chapter 6 from Computer Networking:
More informationTCP over Multi-hop Wireless Networks * Overview of Transmission Control Protocol / Internet Protocol (TCP/IP) Internet Protocol (IP)
TCP over Multi-hop Wireless Networks * Overview of Transmission Control Protocol / Internet Protocol (TCP/IP) *Slides adapted from a talk given by Nitin Vaidya. Wireless Computing and Network Systems Page
More informationCOMP 3331/9331: Computer Networks and Applications. Lab Exercise 3: TCP and UDP (Solutions)
COMP 3331/9331: Computer Networks and Applications Lab Exercise 3: TCP and UDP (Solutions) AIM To investigate the behaviour of TCP and UDP in greater detail. EXPERIMENT 1: Understanding TCP Basics Tools
More informationAdvanced Networking Voice over IP: RTP/RTCP The transport layer
Advanced Networking Voice over IP: RTP/RTCP The transport layer Renato Lo Cigno Requirements For Real-Time Transmission Need to emulate conventional telephone system Isochronous output timing same with
More informationFirst Midterm for ECE374 02/25/15 Solution!!
1 First Midterm for ECE374 02/25/15 Solution!! Instructions: Put your name and student number on each sheet of paper! The exam is closed book. You have 90 minutes to complete the exam. Be a smart exam
More informationinternet technologies and standards
Institute of Telecommunications Warsaw University of Technology 2015 internet technologies and standards Piotr Gajowniczek Andrzej Bąk Michał Jarociński multimedia in the Internet Voice-over-IP multimedia
More informationVoice over IP. Demonstration 1: VoIP Protocols. Network Environment
Voice over IP Demonstration 1: VoIP Protocols Network Environment We use two Windows workstations from the production network, both with OpenPhone application (figure 1). The OpenH.323 project has developed
More informationEthernet. Ethernet Frame Structure. Ethernet Frame Structure (more) Ethernet: uses CSMA/CD
Ethernet dominant LAN technology: cheap -- $20 for 100Mbs! first widely used LAN technology Simpler, cheaper than token rings and ATM Kept up with speed race: 10, 100, 1000 Mbps Metcalfe s Etheret sketch
More informationFirst Midterm for ECE374 03/24/11 Solution!!
1 First Midterm for ECE374 03/24/11 Solution!! Note: In all written assignments, please show as much of your work as you can. Even if you get a wrong answer, you can get partial credit if you show your
More informationNortel - 920-803. Technology Standards and Protocol for IP Telephony Solutions
1 Nortel - 920-803 Technology Standards and Protocol for IP Telephony Solutions QUESTION: 1 To achieve the QoS necessary to deliver voice between two points on a Frame Relay network, which two items are
More informationComputer Networks UDP and TCP
Computer Networks UDP and TCP Saad Mneimneh Computer Science Hunter College of CUNY New York I m a system programmer specializing in TCP/IP communication protocol on UNIX systems. How can I explain a thing
More informationWhite paper. Latency in live network video surveillance
White paper Latency in live network video surveillance Table of contents 1. Introduction 3 2. What is latency? 3 3. How do we measure latency? 3 4. What affects latency? 4 4.1 Latency in the camera 4 4.1.1
More informationEncapsulating Voice in IP Packets
Encapsulating Voice in IP Packets Major VoIP Protocols This topic defines the major VoIP protocols and matches them with the seven layers of the OSI model. Major VoIP Protocols 15 The major VoIP protocols
More informationInternet Control Protocols Reading: Chapter 3
Internet Control Protocols Reading: Chapter 3 ARP - RFC 826, STD 37 DHCP - RFC 2131 ICMP - RFC 0792, STD 05 1 Goals of Today s Lecture Bootstrapping an end host Learning its own configuration parameters
More informationKey Components of WAN Optimization Controller Functionality
Key Components of WAN Optimization Controller Functionality Introduction and Goals One of the key challenges facing IT organizations relative to application and service delivery is ensuring that the applications
More informationVoice over IP: RTP/RTCP The transport layer
Advanced Networking Voice over IP: /RTCP The transport layer Renato Lo Cigno Requirements For Real-Time Transmission Need to emulate conventional telephone system Isochronous output timing same with input
More informationRTP / RTCP. Announcements. Today s Lecture. RTP Info RTP (RFC 3550) I. Final Exam study guide online. Signup for project demos
Announcements I. Final Exam study guide online RTP / RTCP Internet Protocols CSC / ECE 573 Fall, 2005 N. C. State University II. III. Signup for project demos Teaching evaluations at end today copyright
More informationCS640: Introduction to Computer Networks. Applications FTP: The File Transfer Protocol
CS640: Introduction to Computer Networks Aditya Akella Lecture 4 - Application Protocols, Performance Applications FTP: The File Transfer Protocol user at host FTP FTP user client interface local file
More informationD. SamKnows Methodology 20 Each deployed Whitebox performs the following tests: Primary measure(s)
v. Test Node Selection Having a geographically diverse set of test nodes would be of little use if the Whiteboxes running the test did not have a suitable mechanism to determine which node was the best
More informationComputer Networks - CS132/EECS148 - Spring 2013 --------------------------------------------------------------------------
Computer Networks - CS132/EECS148 - Spring 2013 Instructor: Karim El Defrawy Assignment 5 Deadline : May 30th 9:30pm (hard and soft copies required) --------------------------------------------------------------------------
More informationCS268 Exam Solutions. 1) End-to-End (20 pts)
CS268 Exam Solutions General comments: ) If you would like a re-grade, submit in email a complete explanation of why your solution should be re-graded. Quote parts of your solution if necessary. In person
More informationICOM 5026-090: Computer Networks Chapter 6: The Transport Layer. By Dr Yi Qian Department of Electronic and Computer Engineering Fall 2006 UPRM
ICOM 5026-090: Computer Networks Chapter 6: The Transport Layer By Dr Yi Qian Department of Electronic and Computer Engineering Fall 2006 Outline The transport service Elements of transport protocols A
More informationCH.1. Lecture # 2. Computer Networks and the Internet. Eng. Wafaa Audah. Islamic University of Gaza. Faculty of Engineering
Islamic University of Gaza Faculty of Engineering Computer Engineering Department Networks Discussion ECOM 4021 Lecture # 2 CH1 Computer Networks and the Internet By Feb 2013 (Theoretical material: page
More informationMultimedia Networking and Network Security
CMPT371 12-1 Multimedia Networking and Network Security 1 Multimedia Networking and Network Security This note is based on Chapters 7 and 8 of the text book. Outline of multimedia networking Multimedia
More informationRequirements of Voice in an IP Internetwork
Requirements of Voice in an IP Internetwork Real-Time Voice in a Best-Effort IP Internetwork This topic lists problems associated with implementation of real-time voice traffic in a best-effort IP internetwork.
More informationReal-time apps and Quality of Service
Real-time apps and Quality of Service Focus What transports do applications need? What network mechanisms provide which kinds of quality assurances? Topics Real-time versus Elastic applications Adapting
More informationLecture 2-ter. 2. A communication example Managing a HTTP v1.0 connection. G.Bianchi, G.Neglia, V.Mancuso
Lecture 2-ter. 2 A communication example Managing a HTTP v1.0 connection Managing a HTTP request User digits URL and press return (or clicks ). What happens (HTTP 1.0): 1. Browser opens a TCP transport
More informationBurst Testing. New mobility standards and cloud-computing network. This application note will describe how TCP creates bursty
Burst Testing Emerging high-speed protocols in mobility and access networks, combined with qualityof-service demands from business customers for services such as cloud computing, place increased performance
More informationTransport and Network Layer
Transport and Network Layer 1 Introduction Responsible for moving messages from end-to-end in a network Closely tied together TCP/IP: most commonly used protocol o Used in Internet o Compatible with a
More informationCOMP 361 Computer Communications Networks. Fall Semester 2003. Midterm Examination
COMP 361 Computer Communications Networks Fall Semester 2003 Midterm Examination Date: October 23, 2003, Time 18:30pm --19:50pm Name: Student ID: Email: Instructions: 1. This is a closed book exam 2. This
More informationComputer Networks. Chapter 5 Transport Protocols
Computer Networks Chapter 5 Transport Protocols Transport Protocol Provides end-to-end transport Hides the network details Transport protocol or service (TS) offers: Different types of services QoS Data
More informationEthernet. Ethernet. Network Devices
Ethernet Babak Kia Adjunct Professor Boston University College of Engineering ENG SC757 - Advanced Microprocessor Design Ethernet Ethernet is a term used to refer to a diverse set of frame based networking
More informationProject Code: SPBX. Project Advisor : Aftab Alam. Project Team: Umair Ashraf 03-1853 (Team Lead) Imran Bashir 02-1658 Khadija Akram 04-0080
Test Cases Document VOIP SOFT PBX Project Code: SPBX Project Advisor : Aftab Alam Project Team: Umair Ashraf 03-1853 (Team Lead) Imran Bashir 02-1658 Khadija Akram 04-0080 Submission Date:23-11-2007 SPBX
More informationNames & Addresses. Names & Addresses. Hop-by-Hop Packet Forwarding. Longest-Prefix-Match Forwarding. Longest-Prefix-Match Forwarding
Names & Addresses EE 122: IP Forwarding and Transport Protocols Scott Shenker http://inst.eecs.berkeley.edu/~ee122/ (Materials with thanks to Vern Paxson, Jennifer Rexford, and colleagues at UC Berkeley)
More informationBasic Multiplexing models. Computer Networks - Vassilis Tsaoussidis
Basic Multiplexing models? Supermarket?? Computer Networks - Vassilis Tsaoussidis Schedule Where does statistical multiplexing differ from TDM and FDM Why are buffers necessary - what is their tradeoff,
More informationNetwork Layer: Network Layer and IP Protocol
1 Network Layer: Network Layer and IP Protocol Required reading: Garcia 7.3.3, 8.1, 8.2.1 CSE 3213, Winter 2010 Instructor: N. Vlajic 2 1. Introduction 2. Router Architecture 3. Network Layer Protocols
More informationDistributed Systems 3. Network Quality of Service (QoS)
Distributed Systems 3. Network Quality of Service (QoS) Paul Krzyzanowski pxk@cs.rutgers.edu 1 What factors matter for network performance? Bandwidth (bit rate) Average number of bits per second through
More informationData Networks Summer 2007 Homework #3
Data Networks Summer Homework # Assigned June 8, Due June in class Name: Email: Student ID: Problem Total Points Problem ( points) Host A is transferring a file of size L to host B using a TCP connection.
More informationIndepth Voice over IP and SIP Networking Course
Introduction SIP is fast becoming the Voice over IP protocol of choice. During this 3-day course delegates will examine SIP technology and architecture and learn how a functioning VoIP service can be established.
More informationMixer/Translator VOIP/SIP. Translator. Mixer
Mixer/Translator VOIP/SIP RTP Mixer, translator A mixer combines several media stream into a one new stream (with possible new encoding) reduced bandwidth networks (video or telephone conference) appears
More informationOverview. Securing TCP/IP. Introduction to TCP/IP (cont d) Introduction to TCP/IP
Overview Securing TCP/IP Chapter 6 TCP/IP Open Systems Interconnection Model Anatomy of a Packet Internet Protocol Security (IPSec) Web Security (HTTP over TLS, Secure-HTTP) Lecturer: Pei-yih Ting 1 2
More informationClient Server Registration Protocol
Client Server Registration Protocol The Client-Server protocol involves these following steps: 1. Login 2. Discovery phase User (Alice or Bob) has K s Server (S) has hash[pw A ].The passwords hashes are
More informationECE 358: Computer Networks. Homework #3. Chapter 5 and 6 Review Questions 1
ECE 358: Computer Networks Homework #3 Chapter 5 and 6 Review Questions 1 Chapter 5: The Link Layer P26. Let's consider the operation of a learning switch in the context of a network in which 6 nodes labeled
More informationMultimedia Communications Voice over IP
Multimedia Communications Voice over IP Anandi Giridharan Electrical Communication Engineering, Indian Institute of Science, Bangalore 560012, India Voice over IP (Real time protocols) Internet Telephony
More informationLAN Switching. 15-441 Computer Networking. Switched Network Advantages. Hubs (more) Hubs. Bridges/Switches, 802.11, PPP. Interconnecting LANs
LAN Switching 15-441 Computer Networking Bridges/Switches, 802.11, PPP Extend reach of a single shared medium Connect two or more segments by copying data frames between them Switches only copy data when
More informationLehrstuhl für Informatik 4 Kommunikation und verteilte Systeme
Chapter 2: Representation of Multimedia Data Chapter 3: Multimedia Systems Communication Aspects and Services Multimedia Applications and Communication Protocols Quality of Service and Resource Management
More informationEXPERIMENTAL STUDY FOR QUALITY OF SERVICE IN VOICE OVER IP
Scientific Bulletin of the Electrical Engineering Faculty Year 11 No. 2 (16) ISSN 1843-6188 EXPERIMENTAL STUDY FOR QUALITY OF SERVICE IN VOICE OVER IP Emil DIACONU 1, Gabriel PREDUŞCĂ 2, Denisa CÎRCIUMĂRESCU
More informationMiddleboxes. Firewalls. Internet Ideal: Simple Network Model. Internet Reality. Middleboxes. Firewalls. Globally unique idenpfiers
Ideal: Simple Network Model Middleboxes Jennifer Rexford COS 461: Computer Networks Lectures: MW 10-10:50am in Architecture N101 hgp://www.cs.princeton.edu/courses/archive/spr12/cos461/ Globally unique
More informationRARP: Reverse Address Resolution Protocol
SFWR 4C03: Computer Networks and Computer Security January 19-22 2004 Lecturer: Kartik Krishnan Lectures 7-9 RARP: Reverse Address Resolution Protocol When a system with a local disk is bootstrapped it
More informationMultimedia Requirements. Multimedia and Networks. Quality of Service
Multimedia Requirements Chapter 2: Representation of Multimedia Data Chapter 3: Multimedia Systems Communication Aspects and Services Multimedia Applications and Transfer/Control Protocols Quality of Service
More informationAn Introduction to VoIP Protocols
An Introduction to VoIP Protocols www.netqos.com Voice over IP (VoIP) offers the vision of a converged network carrying multiple types of traffic (voice, video, and data, to name a few). To carry out this
More information10CS64: COMPUTER NETWORKS - II
QUESTION BANK 10CS64: COMPUTER NETWORKS - II Part A Unit 1 & 2: Packet-Switching Networks 1 and Packet-Switching Networks 2 1. Mention different types of network services? Explain the same. 2. Difference
More informationApplication Note. Windows 2000/XP TCP Tuning for High Bandwidth Networks. mguard smart mguard PCI mguard blade
Application Note Windows 2000/XP TCP Tuning for High Bandwidth Networks mguard smart mguard PCI mguard blade mguard industrial mguard delta Innominate Security Technologies AG Albert-Einstein-Str. 14 12489
More informationLecture 15: Congestion Control. CSE 123: Computer Networks Stefan Savage
Lecture 15: Congestion Control CSE 123: Computer Networks Stefan Savage Overview Yesterday: TCP & UDP overview Connection setup Flow control: resource exhaustion at end node Today: Congestion control Resource
More informationECE 358: Computer Networks. Solutions to Homework #4. Chapter 4 - The Network Layer
ECE 358: Computer Networks Solutions to Homework #4 Chapter 4 - The Network Layer P 4. Consider the network below. a. Suppose that this network is a datagram network. Show the forwarding table in router
More informationPer-Flow Queuing Allot's Approach to Bandwidth Management
White Paper Per-Flow Queuing Allot's Approach to Bandwidth Management Allot Communications, July 2006. All Rights Reserved. Table of Contents Executive Overview... 3 Understanding TCP/IP... 4 What is Bandwidth
More informationBasic principles of Voice over IP
Basic principles of Voice over IP Dr. Peter Počta {pocta@fel.uniza.sk} Department of Telecommunications and Multimedia Faculty of Electrical Engineering University of Žilina, Slovakia Outline VoIP Transmission
More information920-803 - technology standards and protocol for ip telephony solutions
920-803 - technology standards and protocol for ip telephony solutions 1. Which CODEC delivers the greatest compression? A. B. 711 C. D. 723.1 E. F. 726 G. H. 729 I. J. 729A Answer: C 2. To achieve the
More informationCSE 123: Computer Networks
CSE 123: Computer Networks Homework 4 Solutions Out: 12/03 Due: 12/10 1. Routers and QoS Packet # Size Flow 1 100 1 2 110 1 3 50 1 4 160 2 5 80 2 6 240 2 7 90 3 8 180 3 Suppose a router has three input
More informationSFWR 4C03: Computer Networks & Computer Security Jan 3-7, 2005. Lecturer: Kartik Krishnan Lecture 1-3
SFWR 4C03: Computer Networks & Computer Security Jan 3-7, 2005 Lecturer: Kartik Krishnan Lecture 1-3 Communications and Computer Networks The fundamental purpose of a communication network is the exchange
More informationProtocolo HTTP. Web and HTTP. HTTP overview. HTTP overview
Web and HTTP Protocolo HTTP Web page consists of objects Object can be HTML file, JPEG image, Java applet, audio file, Web page consists of base HTML-file which includes several referenced objects Each
More informationDATA COMMUNICATIONS AND NETWORKING. Solved Examples
Page 1 of 10 DATA COMMUNICATIONS AND NETWORKING Solved Examples References: STA: Stallings, Data and Computer Communications, 6 th ed. TAN: Tannenbaum, Computer Networks, 4 th ed.) 1. Given the following
More informationInternet Packets. Forwarding Datagrams
Internet Packets Packets at the network layer level are called datagrams They are encapsulated in frames for delivery across physical networks Frames are packets at the data link layer Datagrams are formed
More informationGATE CS Topic wise Questions Computer Network
www.gatehelp.com GATE CS Topic wise Questions YEAR 23 Question. 1 Which of the following assertions is false about the internet Protocol (IP)? (A) It is possible for a computer to have multiple IP addresses
More informationChapter 6 Congestion Control and Resource Allocation
Chapter 6 Congestion Control and Resource Allocation 6.3 TCP Congestion Control Additive Increase/Multiplicative Decrease (AIMD) o Basic idea: repeatedly increase transmission rate until congestion occurs;
More informationSecurity (II) ISO 7498-2: Security Architecture of OSI Reference Model. Outline. Course Outline: Fundamental Topics. EE5723/EE4723 Spring 2012
Course Outline: Fundamental Topics System View of Network Security Network Security Model Security Threat Model & Security Services Model Overview of Network Security Security Basis: Cryptography Secret
More informationCS 5480/6480: Computer Networks Spring 2012 Homework 1 Solutions Due by 9:00 AM MT on January 31 st 2012
CS 5480/6480: Computer Networks Spring 2012 Homework 1 Solutions Due by 9:00 AM MT on January 31 st 2012 Important: No cheating will be tolerated. No extension. CS 5480 total points = 32 CS 6480 total
More informationLecture 2: Protocols and Layering. CSE 123: Computer Networks Stefan Savage
Lecture 2: Protocols and Layering CSE 123: Computer Networks Stefan Savage Last time Bandwidth, latency, overhead, message size, error rate Bandwidth-delay product Delay Bandwidth High-level run through
More informationWide Area Networks. Learning Objectives. LAN and WAN. School of Business Eastern Illinois University. (Week 11, Thursday 3/22/2007)
School of Business Eastern Illinois University Wide Area Networks (Week 11, Thursday 3/22/2007) Abdou Illia, Spring 2007 Learning Objectives 2 Distinguish between LAN and WAN Distinguish between Circuit
More information