ECE358: Computer Networks Fall 2014

Slides:



Advertisements
Similar presentations
EE:450 – Computer Networks
Advertisements

© Jörg Liebeherr, CS757 Three Network Technologies Telephone Network –The largest worldwide computer network, specialized for voice –Switching.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Probability Review.
CCNA3: Switching Basics and Intermediate Routing v3.0 CISCO NETWORKING ACADEMY PROGRAM Switching Concepts Introduction to Ethernet/802.3 LANs Introduction.
Fundamentals of Computer Networks ECE 478/578
CSCI-235 Micro-Computers in Science The Network. Network Fundamentals A computer network consists of two or more computers linked together to exchange.
CECS 474 Computer Network Interoperability Notes for Douglas E. Comer, Computer Networks and Internets (5 th Edition) Tracy Bradley Maples, Ph.D. Computer.
Networks: Sample Performance Problems 1 Sample Network Performance Problems.
James 1:5 If any of you lacks wisdom, he should ask God, who gives generously to all without finding fault, and it will be given to him.
Computer Networks Computer Networks Term B10 Network Delay Network Delay Performance Problems.
1 ITC242 – Introduction to Data Communications Week 8 Topic 13 Wireless WANS Reading 2.
1 K. Salah Module 2.1: QA – Putting it all together What is the max number of users/connections/sessions a particular network can support for handling.
Introduction© Dr. Ayman Abdel-Hamid, CS4254 Spring CS4254 Computer Network Architecture and Programming Dr. Ayman A. Abdel-Hamid Computer Science.
Lecture 2 Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit.
Katz, Stoica F04 EECS 122: Introduction to Computer Networks Performance Modeling Computer Science Division Department of Electrical Engineering and Computer.
Network Delays, Statistical Multiplexing
CSCI 4550/8556 Computer Networks Comer, Chapter 11: Extending LANs: Fiber Modems, Repeaters, Bridges and Switches.
Lecture Internet Overview: roadmap 1.1 What is the Internet? (A simple overview last week) Today, A closer look at the Internet structure! 1.2 Network.
Networks:Sample Performance Problems 1 Sample Network Performance Problems.
Lecture Internet Overview: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching,
Networks: Sample Performance Problems 1 Sample Network Performance Problems.
Lecture Internet Overview: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching,
Problems.
Chapter 3 Data and Signals
Advanced Computer Networks 1 Sample Network Performance Problems.
Chapter 3 part II Data and Signals
Unit 1 Network Speed Learning Objectives: Understand the network media Understand that network data speeds are measured in bits per second.
Lecture 2 Performance Metrics. Bandwidth Delay Bandwidth-delay product Latency Throughput.
3.1 Figure 3.16 Two digital signals: one with two signal levels and the other with four signal levels.
1 Computer Communication & Networks Lecture 4 Circuit Switching, Packet Switching, Delays Waleed.
Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching,
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 8.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Modulation, Multiplexing, & Public Switched Telephone.
Huda AL-Omair_ networks61 Wide Area Network. Huda AL-Omair_ networks62 What is a WAN? Wide area network or WAN is a computer network covering a wide geographical.
02 – Performance Basics 1CS Computer Networks.
CS 164: Slide Set 2: Chapter 1 -- Introduction (continued).
ICOM 6115©Manuel Rodriguez-Martinez ICOM 6115 – Computer Networks and the WWW Manuel Rodriguez-Martinez, Ph.D. Lecture 7.
CS412 Introduction to Computer Networking & Telecommunication
Lecture 2 Outline Announcements: No class next Wednesday MF lectures (1/13,1/17) start at 12:50pm Review of Last Lecture Analog and Digital Signals Information.
ECE466 - Tutorial Simple Delay and Throughput Analysis.
Lecture 8 Virtual Switching (contd.) & Message Switching.
Lecture # 03 Switching Course Instructor: Engr. Sana Ziafat.
Chapter 6 Multiplexers and Switching Concepts
Review of Network Technologies. Basic of Network concepts Computer Network – A Communication system for connecting computers/hosts Why? – Better connectivity.
Introduction 1-1 Chapter 1: roadmap 1.1 What is the Internet? 1.2 Network edge  end systems, access networks, links 1.3 Network core  circuit switching,
What is the Speed of the Internet? Internet Computing KUT Youn-Hee Han.
CSCI-235 Micro-Computer Applications The Network.
CSE 413: Computer Network Circuit Switching and Packet Switching Networks Md. Kamrul Hasan
Delay in packet switched network. Circuit switching In Circuit switched networks the resources needed along a path (buffers and link transmission rate)
Introduction Computer networks: – definition – computer networks from the perspectives of users and designers – Evaluation criteria – Some concepts: –
Data Communication & Networking. Data communication Not to be confused with telecommunication –Any process that permits the passage from a sender to one.
Computer Communication & Networks Lecture # 03 Circuit Switching, Packet Switching Nadeem Majeed Choudhary
Chapter 2 : Data Communications BENG 4522 Data Communications & Computer Networks Transmission Impairment Signals travel through the transmission.
Chapter 3 TRANSMISSION IMPAIRMENT. 3-4 TRANSMISSION IMPAIRMENT Signals travel through transmission media, which are not perfect. The imperfection causes.
Lecture # 3: WAN Data Communication Network L.Rania Ahmed Tabeidi.
CSEN 404 Introduction to Networks Amr El Mougy Lamia AlBadrawy.
Introduction1-1 Data Communications and Computer Networks Chapter 1 CS 3830 Lecture 3 Omar Meqdadi Department of Computer Science and Software Engineering.
1) By using hamming code (even – parity), Show the correct binary number that transmitted by the sender if the receiver received binary number.
Exercises on Data Link Layer.
Competence Based Education – Internet Protocols E XAMPLES AND P ROBLEMS.
CSCI-100 Introduction to Computing The Network. Network Fundamentals A computer network consists of two or more computers linked together to exchange.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
CS Lecture 2 Network Performance
Propagation & Transmission delay
Sample Network Performance Problems
Tutorial 2 This elementary problem begins to explore propagation delay and transmission delay, two central concepts in data networking. Consider two hosts,
Circuit Switched Network
Sample Network Performance Problems
Presentation transcript:

ECE358: Computer Networks Fall 2014 Solutions to Homework #1

R 11. Suppose there is exactly one packet switch between a sending host and a receiving host. The transmission rates between the sending host and the switch and between the switch and the receiving host are 𝑅 1 and 𝑅 2 , respectively. Assuming that the switch uses store-and-forward packet switching, what is the total end-to-end delay to send a packet of length 𝐿? (Ignore queuing, propagation delay, and processing delay.) A B Switch R1 R2 Store and forward Packet L t1 t2 t3 𝑑 𝑡𝑟𝑎𝑛𝑠 1 = 𝐿 𝑅1 𝑑 𝑡𝑟𝑎𝑛𝑠 2 = 𝐿 𝑅2 Transmitting 1st bit Transmitting last bit No processing delay No propagation delay Time 𝑑 𝑒𝑛𝑑−𝑡𝑜−𝑒𝑛𝑑 = 𝑑 𝑡𝑟𝑎𝑛𝑠 1 + 𝑑 𝑡𝑟𝑎𝑛𝑠 2 = 𝐿 𝑅1 + 𝐿 𝑅2

R 13. Suppose users share a 2Mbps (Megabits per second) link R 13. Suppose users share a 2Mbps (Megabits per second) link. Also suppose each user transmits continuously at 1Mbps when transmitting, but each user transmits only 20 percent of the time. a) When circuit switching is used, how many users can be supported? b) Suppose packet switching is used, why will there be essentially no queuing delay before the link if two or fewer users transmit at the same time? Circuit switching Only two users  1Mbps+1Mbps= 2Mbps X 2Mbps 1Mbps (20%) Since each user requires 1Mbps when transmitting, if two or fewer users transmit simultaneously, a maximum of 2Mbps will be required. Since the available bandwidth of the shared link is 2Mbps, there will be no queuing delay before the link. Whereas, if three users transmit simultaneously, the bandwidth required will be 3Mbps which is more than the available bandwidth of the shared link. In this case, there will be queuing delay before the link.

𝑑 𝑝𝑟𝑜𝑝 = 𝑑 𝑠 = 2500 𝑘𝑚 2.5 ∗ 10 5 𝑘𝑚/𝑠𝑒𝑐 =10 𝑚𝑠𝑒𝑐 R 18. How long does it take a packet of length 1,000 bytes to propagate over a link of distance 2,500 Km, propagation speed 2.5 X 108 m/s, and transmission rate 2Mbps? More generally, how long does it take a packet of length L to propagate over a link of distance d, propagation speed s, and transmission rate R bps? Does this delay depend on packet length? Does this delay depend on transmission rate? A B d=2500km S =2.5∗ 10 8 𝑚/𝑠𝑒𝑐 Packet L=1000 Bytes R=2Mbps 𝑑 𝑝𝑟𝑜𝑝 = 𝑑 𝑠 = 2500 𝑘𝑚 2.5 ∗ 10 5 𝑘𝑚/𝑠𝑒𝑐 =10 𝑚𝑠𝑒𝑐 Depending on packet length  No Depending on transmission rate  No

R 19. Suppose Host A wants to send a large file to Host B R 19. Suppose Host A wants to send a large file to Host B. The path from Host A to Host B has three links, of rates R1= 500kbps, R2=2Mbps, and R3=1Mbps. a) Assuming no other traffic in the network, what is the throughput for the file transfer? b) Suppose the file is 4 million bytes. Dividing the file size by the throughput, roughly how long will it take to transfer the file to Host B? c) Repeat (a) and (b), but now with R_2 reduced to 100kbps. Throughput=min(R1 , R2 , R3)= R1 = 500Kbps d= 4∗ 10 6 ∗8 𝑏𝑖𝑡𝑠 500 ∗ 10 3 𝑏𝑖𝑡/𝑠𝑒𝑐 =64 𝑠𝑒𝑐 R2=100Kbps  throughput = min(R1 , R2 , R3)= R2 = 100Kbps d= 4∗ 10 6 ∗8 𝑏𝑖𝑡𝑠 100 ∗ 10 3 𝑏𝑖𝑡/𝑠𝑒𝑐 =320 𝑠𝑒𝑐 A B R1=500Kbps X R2=2Mbps R3=1Mbps

P 6. This elementary problem begins to explore propagation delay and transmission delay, two central concepts in data networking. Consider two hosts, A and B, connected by a single link of rate 𝑅 bps. Suppose that the two hosts are separated by 𝑚 meters, and suppose the propagation speed along the link ia 𝑠 meter/sec. 𝐻𝑜𝑠𝑡 𝐴 is to send a packet of size 𝐿 bits to 𝐻𝑜𝑠𝑡 𝐵. a) Express the propagation delay , 𝑑 𝑝𝑟𝑜𝑝 , in terms of 𝑚 and 𝑠. b) Determine the transmission time of the packet , 𝑑 𝑡𝑟𝑎𝑛𝑠 , in terms of 𝐿 and 𝑅. c) Ignoring processing and queuing delays, obtain an expression for the end-to-end delay. d) Suppose 𝐻𝑜𝑠𝑡 𝐴 begins to transmit the packet at time 𝑡=0. At time 𝑡= 𝑑 𝑡𝑟𝑎𝑛𝑠 , where is the last bit of the packet? e) Suppose 𝑑 𝑝𝑟𝑜𝑝 is greater than 𝑑 𝑡𝑟𝑎𝑛𝑠 . At time 𝑡= 𝑑 𝑡𝑟𝑎𝑛𝑠 , where is the first bit of the packet? f) Suppose 𝑑 𝑝𝑟𝑜𝑝 is less than 𝑑 𝑡𝑟𝑎𝑛𝑠 . At time 𝑡= 𝑑 𝑡𝑟𝑎𝑛𝑠 , where is the first bit of the packet? g) Suppose 𝑠=2.5× 10 8 𝑚/𝑠, 𝐿=120 bits, and 𝑅=56 kbps. Find the distance 𝑚 so that 𝑑 𝑝𝑟𝑝 equals 𝑑 𝑡𝑟𝑎𝑛𝑠 . 𝑑 𝑝𝑟𝑜𝑝 = 𝑚 𝑠 𝑠𝑒𝑐 A B m meters S 𝑚/𝑠𝑒𝑐 Packet L bits R bps

𝑑 𝑒𝑛𝑑−𝑡𝑜−𝑒𝑛𝑑 = 𝑑 𝑝𝑟𝑜𝑝 + 𝑑 𝑡𝑟𝑎𝑛𝑠 Continue P6. 𝑑 𝑡𝑟𝑎𝑛𝑠 = 𝐿 𝑅 𝑠𝑒𝑐 𝑑 𝑒𝑛𝑑−𝑡𝑜−𝑒𝑛𝑑 = 𝑑 𝑝𝑟𝑜𝑝 + 𝑑 𝑡𝑟𝑎𝑛𝑠 At 𝑡=𝑑 𝑡𝑟𝑎𝑛𝑠  the last bit is just leaving host A. The first bit is still in the link, and has not reached Host B yet. The first bit has aready reached host B. 𝑑 𝑝𝑟𝑜𝑝 = 𝑚 𝑠 , 𝑑 𝑡𝑟𝑎𝑛𝑠 = 𝐿 𝑅 m= 𝐿𝑠 𝑅 =536 𝑘𝑚

P 7. In this problem, we consider sending real-time voice from Host A to Host B over a packet-switching network (VoIP). Host A converts analog voice to a digital 64 kbps bit streaming on the fly. Host A then groups the bits into 56-byte packets. There is one link between Hosts A and B; its transmission rate is 2Mbps and its propagation delay is 10 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 to an analog signal. How much time elapses from the time a bit created (from the original analog signal at Host A) until the bit is decoded ( as part of analog signal at host B)? A B Packet L = 56 bytes Encode rate= 64Kbps R=2M bps 𝑑 𝑝𝑟𝑜𝑝 =10 𝑚𝑠𝑒𝑐 time 𝑑 𝑝𝑟𝑜𝑐 𝑑 𝑡𝑟𝑎𝑛𝑠 𝑑 𝑝𝑟𝑜𝑝 Generating the packet 𝑑 𝑝𝑟𝑜𝑐 = 56∗8 𝑏𝑖𝑡𝑠 64∗ 10 3 𝑏𝑝𝑠 =7𝑚𝑠𝑒𝑐, 𝑑 𝑡𝑟𝑎𝑛𝑠 = 56∗8 𝑏𝑖𝑡𝑠 2∗ 10 6 𝑏𝑝𝑠 =0.224𝑚𝑠𝑒𝑐 Delay till decodeing =7+0.224+10=17.224msec

P 10. Consider a packet of length 𝐿 which begins at end system 𝐴 and travels over three links to a destination end system. These three links are connected by two packet switches. Let 𝑑 𝑖 , 𝑠 𝑖 and 𝑅 𝑖 denote the length, propagation speed, and the transmission rate of link 𝑖, for 𝑖=1, 2, 3. The packet switch delays each packet by 𝑑 𝑝𝑟𝑜𝑐 . Assuming no queuing delays, in terms of 𝑑 𝑖 , 𝑠 𝑖 , 𝑅 𝑖 , (𝑖=1, 2, 3), and 𝐿, what is the total end-to-end delay for the packet? Suppose now the packet is 1,500 bytes, the propagation speed on all three links is 2.5 x 108 m/s, the transmission rates of all three links are 2Mbps, the packet switch processing delay is 3msec, the length of the first link is 5,000 km, the length of the second link is 4,000 km, the length of the last link is 1,000 km . for these values, what is the end-to-end delay? A B Packet L R1 time 𝑑 𝑝𝑟𝑜𝑐 2 𝑑 𝑡𝑟𝑎𝑛𝑠 1 𝑑 𝑝𝑟𝑜𝑝 1 R2 R3 d1 d2 d3 s1 s2 s3 𝑑 𝑡𝑟𝑎𝑛𝑠 2 𝑑 𝑝𝑟𝑜𝑝 2 𝑑 𝑝𝑟𝑜𝑐 3 𝑑 𝑡𝑟𝑎𝑛𝑠 3 𝑑 𝑝𝑟𝑜𝑝 3 𝑑 𝑒𝑛𝑑−𝑡𝑜−𝑒𝑛𝑑 = 𝑑 𝑡𝑟𝑎𝑛𝑠 1 + 𝑑 𝑡𝑟𝑎𝑛𝑠 2 + 𝑑 𝑡𝑟𝑎𝑛𝑠 3 + 𝑑 𝑝𝑟𝑜𝑝 1 + 𝑑 𝑝𝑟𝑜𝑝 2 + 𝑑 𝑝𝑟𝑜𝑝 3 + 𝑑 𝑝𝑟𝑜𝑐 2 + 𝑑 𝑝𝑟𝑜𝑐 3 = 𝐿 𝑅1 + 𝐿 𝑅2 + 𝐿 𝑅3 + 𝑑1 𝑠1 + 𝑑2 𝑠2 + 𝑑3 𝑠3 +2∗ 𝑑 𝑝𝑟𝑜𝑐 =64𝑚𝑠𝑒𝑐

P 11. In the above problem. Suppose 𝑅 1 = 𝑅 2 = 𝑅 3 =𝑅 and 𝑑 𝑝𝑟𝑜𝑐 =0 P 11. In the above problem. Suppose 𝑅 1 = 𝑅 2 = 𝑅 3 =𝑅 and 𝑑 𝑝𝑟𝑜𝑐 =0. Further suppose the packet switch does not store-and– forward packets but instead immediately transmits each bit it receives before waiting for the entire packet to arrive. What is the end-to-end delay? A B Packet L R time 𝑑 𝑡𝑟𝑎𝑛𝑠 1 𝑑 𝑝𝑟𝑜𝑝 1 d1 d2 d3 s1 s2 s3 𝑑 𝑝𝑟𝑜𝑝 2 𝑑 𝑝𝑟𝑜𝑝 3 𝑑 𝑒𝑛𝑑−𝑡𝑜−𝑒𝑛𝑑 = 𝑑 𝑡𝑟𝑎𝑛𝑠 1 + 𝑑 𝑝𝑟𝑜𝑝 1 + 𝑑 𝑝𝑟𝑜𝑝 2 + 𝑑 𝑝𝑟𝑜𝑝 3 = 𝐿 𝑅 + 𝑑1 𝑠1 + 𝑑2 𝑠2 + 𝑑3 𝑠3