Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
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. IP address 112.0.0.0 S 0/0/0 S 0/0/1 Ft. Worth 1000 Hosts Router S 0/0/1 $0/0/0 F 0/1 ROU F0/0 Router FO S 0/0/1 Address class Custom subnet mask Minimum number of subnets needed Extra subnets required for 70% growth + (Round up to the next whole number) Total number of subnets needed = 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 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

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. IP address 112.0.0.0 S 0/0/0 S 0/0/1 Ft. Worth 1000 Hosts Router S 0/0/1 $0/0/0 F 0/1 ROU F0/0 Router FO S 0/0/1 Address class Custom subnet mask Minimum number of subnets needed Extra subnets required for 70% growth + (Round up to the next whole number) Total number of subnets needed = 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 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

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

Provide the final Answers

 

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. IP address 112.0.0.0 S 0/0/0 S 0/0/1 Ft. Worth 1000 Hosts Router S 0/0/1 $0/0/0 F 0/1 ROU F0/0 Router FO S 0/0/1 Address class Custom subnet mask Minimum number of subnets needed Extra subnets required for 70% growth + (Round up to the next whole number) Total number of subnets needed = 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 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
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. IP address 112.0.0.0 S 0/0/0 S 0/0/1 Ft. Worth 1000 Hosts Router S 0/0/1 $0/0/0 F 0/1 ROU F0/0 Router FO S 0/0/1 Address class Custom subnet mask Minimum number of subnets needed Extra subnets required for 70% growth + (Round up to the next whole number) Total number of subnets needed = 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 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
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS