Q1: Based on the information in the graphic shown, design a network addressing scheme that will supply the minimum number of hosts per subnet, and allow enough extra subnets and hosts for 70% growth in all areas without using VLSM. Circle each subnet on the graphic and answer the questions below. Ft. Worth 1000 Hosts S 0/0/1 FOO IP address 112.0.0.0 $0/0/0 $0/0/1 FO/O Router $0/0/0 $0/0/1 F0/1 Dallas 1500 Hosts
Q1: Based on the information in the graphic shown, design a network addressing scheme that will supply the minimum number of hosts per subnet, and allow enough extra subnets and hosts for 70% growth in all areas without using VLSM. Circle each subnet on the graphic and answer the questions below. Ft. Worth 1000 Hosts S 0/0/1 FOO IP address 112.0.0.0 $0/0/0 $0/0/1 FO/O Router $0/0/0 $0/0/1 F0/1 Dallas 1500 Hosts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
![Q1: Based on the information in the graphic shown, design a network addressing
scheme that will supply the minimum number of hosts per subnet, and allow
enough extra subnets and hosts for 70% growth in all areas without using VLSM.
Circle each subnet on the graphic and answer the questions below.
Ft. Worth
1000 Hosts
Address class
Custom subnet mask
Router
S 0/0/1
F 0/0
RE
Router
D
Minimum number of subnets needed
Extra subnets required for 70% growth +
(Round up to the next whole number)
Total number of subnets needed =
IP address 112.0.0.0
S 0/0/0 S 0/0/1/
F0/0
$ 0/0/0
$0/0/1
Number of host addresses in the largest subnet group
Number of addresses needed for 70% growth in the largest subnet +
(Round up to the next whole number)
Total number of address needed for the largest subnet =
Start with the first subnet and arrange your
F0/1
sub-networks from the largest group to the smallest :
Subnet 1: IP address range for Dallas
Subnet 2: IP address range for Ft. Worth
Subnet 3: IP address range for Router A to Router B serial connection
Subnet 4: IP address range for Router A to Router C serial connection
Subnet 5: IP address range for Router C to Router D serial connection
Dallas
1500 Hosts
----
----
-----
----
Class A
255.255.248.0.
5.Subnets..
----
1
6
1800
540
2340
10.0.0.1-10.0.7254
10.0.8.1-10.0.15.254
10.0.16.1.
10.0.1 6.5
102.16.9](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fbbc8a687-c0f0-429c-86f1-046930399c86%2Fa51d08a8-c861-4b07-8b08-cda45649421f%2Fwmbxlz7_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Q1: Based on the information in the graphic shown, design a network addressing
scheme that will supply the minimum number of hosts per subnet, and allow
enough extra subnets and hosts for 70% growth in all areas without using VLSM.
Circle each subnet on the graphic and answer the questions below.
Ft. Worth
1000 Hosts
Address class
Custom subnet mask
Router
S 0/0/1
F 0/0
RE
Router
D
Minimum number of subnets needed
Extra subnets required for 70% growth +
(Round up to the next whole number)
Total number of subnets needed =
IP address 112.0.0.0
S 0/0/0 S 0/0/1/
F0/0
$ 0/0/0
$0/0/1
Number of host addresses in the largest subnet group
Number of addresses needed for 70% growth in the largest subnet +
(Round up to the next whole number)
Total number of address needed for the largest subnet =
Start with the first subnet and arrange your
F0/1
sub-networks from the largest group to the smallest :
Subnet 1: IP address range for Dallas
Subnet 2: IP address range for Ft. Worth
Subnet 3: IP address range for Router A to Router B serial connection
Subnet 4: IP address range for Router A to Router C serial connection
Subnet 5: IP address range for Router C to Router D serial connection
Dallas
1500 Hosts
----
----
-----
----
Class A
255.255.248.0.
5.Subnets..
----
1
6
1800
540
2340
10.0.0.1-10.0.7254
10.0.8.1-10.0.15.254
10.0.16.1.
10.0.1 6.5
102.16.9
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education