Computer Networks: Homework 1 Chapter 15: –Problem 14 –Problem 16.

Slides:



Advertisements
Similar presentations
Chapter 5 IPv4 Addresses TCP/IP Protocol Suite
Advertisements

19.1 Chapter 19 Network Layer: Logical Addressing Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 19 Network Layer: Logical Addressing Stephen Kim.
1 Computer Communication & Networks Lecture 17 & 18 Network Layer: Logical Addressing Waleed Ejaz.
Network Layer: Logical Addressing. 4-1 IPv4 ADDRESSES An IPv4 address is a 32-bit address that uniquely and universally defines the connection of a device.
Computer Networks: Homework 2 Chapter 19: –Problem 18 a. netid: 114 hostid: b. netid: hostid: 8.6 c. netid: hostid: 12 –Problem.
Prepared By: Eng.Ola M. Abd El-Latif
A supernetwork.
TCP/IP Protocol Suite 1 Chapter 5 Objectives Upon completion you will be able to: IP Addresses: Classless Addressing Understand the concept of classless.
6.1 Chapter 6 Bandwidth Utilization: Multiplexing and Spreading Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
TCP/IP Protocol Suite 1 Chapter 5 Objectives Upon completion you will be able to: IP Addresses: Classless Addressing Understand the concept of classless.
NETE0510 Presented by Dr.Apichan Kanjanavapastit
IP Addresses: Classful Addressing An IP address is a 32-bit address.
Chapter 19 Network Layer: Logical Addressing
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 19 Network Layer Logical Addressing © 2012 by McGraw-Hill Education. This is proprietary material.
Functions 1.  How long is MAC address?  How is mac address used in data communication?  What is a frame?  What does an IP address look like? 2.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 5 Subnetting/Supernetting and Classless Addressing.
21-IP addressing Dr. John P. Abraham Professor UTPA.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Chapter 4 IP Addressing.
1 1- What is the fundamental difference between network layer and data-link layer? Data-link layer only deals with efficient transmission of information.
1 Chapter 24 TCP/IP. 2 An Internet According to TCP/IP.
LECTURE # 20 IP ADDRESSING 1. Binary 2  All digital electronics use a binary method for communication.  Binary can be expressed using only two values:
1 Kyung Hee University Part 4 : Network Layer. 2 Kyung Hee University Role and Position of Network Layer o Network layer in the Internet model is responsible.
Chapter 5 IP addresses Classless Addressing
CSISCSIS Dr. ClincyLecture1 SUPERNETTING Although class A and B addresses are dwindling – there are plenty of class C addresses The problem with C addresses.
1 Kyung Hee University Chapter 5 IP addresses Classless Addressing.
Copyright © Lopamudra Roychoudhuri
19.1 Chapter 19 Network Layer: Logical Addressing Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Network Layer: Logical Addressing. Address Space Notations Classful Addressing Classless Addressing Network Address Translation (NAT) Topics Discussed.
19.1 Chapter 19 Network Layer: Logical Addressing Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
21-IP addressing Dr. John P. Abraham Professor UTPA.
HANNAM UNIVERSITY TCP/IP Protocol Suite 1 Chapter 5 Objectives Upon completion you will be able to: IP Addresses: Classless Addressing.
A. B. M. Nasiruzzaman Dept. of EEE, RUET c. The output bit rate is the inverse of the output bit duration or 1/(4μs) or 4 Mbps. This can also be deduced.
1 Kyung Hee University Prof. Choong Seon HONG Subnetting/ Supernetting and Classless Addressing.
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 5 IPv4 Addresses.
17.1 Chapter 17 SONET/SDH Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Chapter 5 IPv4 Address.
21-IP addressing Dr. John P. Abraham Professor UTPA.
IP Addresses: Classful Addressing IP Addresses. INTRODUCTION 4.1.
IP ADDRESSING Lecture 2: IP addressing Networks and Communication Department 1.
21-IP addressing Dr. John P. Abraham Professor UTPA.
TCP/IP Protocol Suite 1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Chapter 5 IPv4 Addresses.
TCP/IP Protocol Suite 1 Chapter 4 Objectives Upon completion you will be able to: IP Addresses: Classful Addressing Understand IPv4 addresses and classes.
Introduction to Internetworking. 2 The IP Addressing Scheme (IPv4) (psu.edu) Dotted Decimal Notation: A notation more convenient for humans.
Network Layer/IP Protocols 1. Outline IP Datagram (IPv4) NAT Connection less and connection oriented service 2.
19.1 Chapter 19 Network Layer: Logical Addressing Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
19.1 Chapter 19 Network Layer: Logical Addressing Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Behrouz A. Forouzan TCP/IP Protocol Suite, 3 rd Ed. IP Addressing.
Chapters 4 & 5 Addressing Part 2 of 2
4.3 Network Layer Logical Addressing
IP Addresses: Classful Addressing IP Addresses. CONTENTS INTRODUCTION CLASSFUL ADDRESSING Different Network Classes Subnetting Classless Addressing Supernetting.
Chapter 5 IPv4 Addresses TCP/IP Protocol Suite
Chapter-5 TCP/IP Suite.
4 Network Layer Part I Computer Networks Tutun Juhana
IPV4.
An IPv4 address is a 32-bit address that uniquely and universally defines the connection of a device (for example, a computer or a router) to the Internet.
Lec 9 Subnet 3.1 Computer Networks Al-Mustansiryah University
Chapter 5 Addressing Dr. Clincy Lecture.
Chapter 26 IPv6 Addressing
Chapter 19 Network Layer: Logical Addressing
Subnetting/Supernetting and Classless Addressing
Network Layer: Logical Addressing
Dr. John P. Abraham Professor UTPA
Data Communications and Networking
Dr. John P. Abraham Professor UTRGV
Dr. John P. Abraham Professor UTRGV
Chapter 5 IP addresses Classless Addressing
Part IV Network layer 10. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Dr. John P. Abraham Professor UTPA
Introduction to Network
Presentation transcript:

Computer Networks: Homework 1 Chapter 15: –Problem 14 –Problem 16

Computer Networks: Homework 1 Chapter 15: –Problem 19

Computer Networks: Homework 1 Chapter 17: –Problem 11 Each STS-n frame carries (9  n  86) bytes of bytes. SONET sends 8000 frames in each second. We can then calculate the user data rate as follows: STS-3 →  8000  (9  3  86)  8 = Mbps STS-9 →  8000  (9  9  86)  8 = Mbps STS-12 →  8000  (9  12  86)  8 = Mbps –Problem 14 The user data rate of STS-1 is (8000 × 9 × 86 × 8) = Mbps. To carry a load with a data rate , we need 10 kbps worth of dummy data. This means that we need / 8 = 750 bytes of dummy data in 8000 frames. In other words, 750 out of every 8000 frames need to allow the next byte after H3 to be empty (dummy). For example, we can have sequences of 32 frames in which the first three frames are underloaded and the next 29 are normal.

Computer Networks: Homework 1 Chapter 18: –Problem 14 The address field in Frame Relay is 16 bits. The address given is only 15 bits. It is not valid. –Problem 18

Computer Networks: Homework 1 Chapter 19: –Problem 16 a. Class C (first byte is between 192 and 223) b. Class D (first byte is between 224 and 239) c. Class A (first byte is between 0 and 127) d. Class B (first byte is between 128 and 191) –Problem 18 a. netid: 114 hostid: b. netid: hostid: 8.6 c. netid: hostid: 12

Computer Networks: Homework 1 Chapter 19: –Problem 26 The total number of addresses in this block is = The ISP can divide this large block in several ways depending on the predicted needs of its customers in the future. We assume that the future needs follow the present pattern. In other words, we assume that the ISP will have customers that belong to one of the present groups. We design four ranges: group 1, group 2, group 3, and one reserved range of addresses as shown in Figure.

Computer Networks: Homework 1 Chapter 19: –Problem 26 (Cont’d) Group 1 In the first group, we have 200 businesses. We augment this number to 256 (the next number after 200 that is a power of 2) to let 56 more customers of this kind in the future. The total number of addresses is 256 × 128 = For this group, each customer needs 128 addresses. This means the suffix length is log = 7. The prefix length is then 32 − 7 = 25. The addresses are: 1st customer: /25 to /25 2nd customer: /25 to / th customer: /25 to /25 Unused addresses to Total Addresses in group 1 = 256 × 128 = Used = 200 × 128 = Reserved: 7168, which can be assigned to 56 businesses of this size. Group 2 In the second group, we have 400 business. We augment this number to 512 (the next number after 400 that is a power of 2) to let 112 more customer of this kind in the future. The total number of addresses is = 512 × 16 = For this group, each customer needs 16 addresses. This means the suffix length is 4 log 2 16 = 4. The prefix length is then 32 − 4 = 28. The addresses are: 1st customer: /28 to /28 2nd customer: /28 to / th customer: /28 to /28 Unused addresses to Total Addresses in group 2 = 512 × 16 = 8192 Used = 400 × 16 = 6400 Reserved: 1792, which can be assigned to 112 businesses of this size.

Computer Networks: Homework 1 Chapter 19: –Problem 26 (Cont’d) Group 3 In the third group, we have 2000 households. We augment this number to 2048 (the next number after 2000 that is a power of 2) to let 48 more customer of this kind in the future. The total number of addresses is = 2048 × 4 = For this group, each customer needs 4 addresses. This means the suffix length is 2 log 2 4 = 2. The prefix length is then 32 − 2 = 30. The addresses are: 1st customer: /30 to /30 2nd customer: /30 to / th customer: /30 to /30 Unused addresses to Total Addresses in group 3 = 2048 × 4 = 8192 Used = 2000 × 4 = 8000 Reserved: 192, which can be assigned to 48 households. Reserved Range In the reserved range, we have address that are totally unused. Note that we have unused addresses in each group and a large range of unused addresses in the reserved range. Summary: The following shows the summary of used and unused addresses:

Computer Networks: Homework 1 Chapter 19: –Problem 28 Each customer has only 1 address and, therefore, only one device. Since we defined a network as 2 or more connected devices, this is not a network