Written Assignment unit 5
Bachelor of Computer Science
University of the People
CS 2204-01: Communication and Networking
Dr. William Sexton
December 17, 2024
Q1: Router Actions Based on CIDR Entries
Given the CIDR entries in the routing table, we will determine how the router processes packets
for each specified IP address.
Routing Table
Address/Mask Next Hop
135.46.56.0/22 Interface 0
135.46.60.0/22 Interface 1
192.53.40.0/23 Router 1
Default Router 2
IP Address Analysis
1. 135.46.63.10
Subnet Match: The address falls within the range of 135.46.60.0/22 (135.46.60.0
to 135.46.63.255).
Action: Forward to Interface 1.
2. 135.46.57.14
Subnet Match: This address is part of 135.46.56.0/22 (135.46.56.0 to
135.46.59.255).
Action: Forward to Interface 0.
3. 135.46.52.2
Subnet Match: This address does not match any entries in the routing table.
Action: Forward to Router 2 (default route).
4. 192.53.40.7
Subnet Match: This address is part of 192.53.40.0/23 (192.53.40.0 to
192.53.41.255).
Action: Forward to Router 1.
5. 192.53.56.7
Subnet Match: This address does not match any entries in the routing table.
Action: Forward to Router 2 (default route).
Q2: IP Address Assignments for Organizations
Given the starting IP address of 198.16.0.0, we will allocate IP addresses for organizations A, B,
C, and D based on their requests.
Address Allocations
Organization A (4000 addresses)
First IP Address: 198.16.0.0
Last IP Address: 198.16.15.255
Subnet Mask: /20 (provides 4096 addresses)
Organization B (2000 addresses)
First IP Address: 198.16.16.0
Last IP Address: 198.16.23.255
Subnet Mask: /21 (provides 2048 addresses)
Organization C (4000 addresses)
First IP Address: 198.16.24.0
Last IP Address: 198.16.39.255
Subnet Mask: /20 (provides 4096 addresses)
Organization D (8000 addresses)
First IP Address: 198.16.40.0
Last IP Address: 198.16.55.255
Subnet Mask: /19 (provides 8192 addresses)
Q3: Updated Distance-Vector Table for Router R
Given Router R's initial distance-vector table and the report received from R1, we will update R's
table based on the new information.
Initial Distance-Vector Table
Destination Cost Next Hop
A 2 R1
B 3 R2
C 4 R1
D 5 R3
Report from R1
dest: A, cost: 1
dest: B, cost: 1
dest: C, cost: 4
dest: D, cost: 4
Updated Table Calculation
For destination A:
New Cost = Cost to R1 (1) + Cost from R to R1 (1) = Total Cost = 2
No change; still via R1.
For destination B:
New Cost = Cost to R1 (1) + Cost from R to R1 (1) = Total Cost = 2
Update entry to reflect a lower cost via R1.
For destination C:
New Cost = Cost to R1 (4) + Cost from R to R1 (1) = Total Cost = 5
No change; still via R1.
For destination D:
New Cost = Cost to R1 (4) + Cost from R to R1 (1) = Total Cost = 5
No change; still via R3.
Updated Distance-Vector Table
Destination Cost Next Hop
A 2 R1
B 2 R1
C 4 R1
D 5 R3
Conclusion
The router processes incoming packets based on its routing table entries, allocating IP addresses
efficiently among organizations, and updates its distance-vector table based on new information
received from neighboring routers.
References
Dordal, P. (2019). An introduction to computer networks
Radish A Simple Routing Table Structure for CIDR
Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation
Strategy
