Mini Project Seminar Under the Guidance of – Mr. Kiran Gautam Assistant Professor Dept. of CSE Team Members – Shrey Berry ( ) Vineet Kumar ( )

The Network Administrator is required know the entire Network Structure, which includes the number of Routers, number of LANs, inter connectivity between the network elements and so on. Given the IP Address and the Subnet Mask of the Master Network, we need to divide the entire network into a group of Sub – Networks.

VLSM is, in concept, a simple extension of standard subnet masking. With VLSM, a number of subnet masks are defined for a single network and used as needed to create different-size subnets. We need to use the Classless Inter Domain Routing (CIDR) mechanism, which implements the concept of Variable Length Subnet Mask. We prefer this strategy for subnetting as it enables us to conserve address space, making it possible to define subnets of varying sizes,

We develop an interface wherein, the Network Administrator is able to describe the structure of the Network. The interface allows for taking as input the number of Routers and LAN Segments, the Inter Connectivity among them. Having entered the appropriate inputs to the Interface, the Software calculates the IP values for each connection.

Minimum: 1.6 GHz CPU 512 MB RAM 1024x768 display 5400 RPM hard disk Recommended: 2.2 GHz or higher CPU 1 GB or more RAM 1280x1024 display 7200 RPM or higher hard disk 3.0 GB of available disk space for the full installation  System Requirements:

 Software Requirements: Operating System : Microsoft Windows XP Windows Vista/Windows 7 IDE : Microsoft Visual Studio 2008 Programming Language : C# Platform : ASP.NET Other Applications : Microsoft Office Word

Different Phases of Development Activity A : Feasible study of the problem and formulation of formal problem definition – 10 Days Activity B : Requirement analysis and specification – 7 Days Activity C : Literature study – 28 Days Activity D : Coding and unit testing – 27 Days Activity E : Integration and system testing – 26 Days Activity F : Documentation – 9 Days

A C B D E Activity F Sept Sept Oct Nov Dec Dec Jan Duration of different activities Activity A : Feasible study of the problem and formulation of formal problem definition – 10 Days Activity B : Requirement analysis and specification – 7 Days Activity C : Literature study – 28 Days Activity D : Coding and unit testing – 27 Days Activity E : Integration and system testing – 26 Days Activity F : Documentation – 9 Days

Input Subnet Calculator 0 USER Result

Verify Feasibilit y 0.1 Router Subnets 0.2 LAN Subnets 0.3 Detailed Report 0.4 Number of Valid IPs Input Subnet Mask Total IPs Feasible Router IP and Subnet Calculated LAN IP and Subnet Calculated Report

Validate Total IPs Router IP Assign Block Size Valid Hosts Number of Valid IPs Variable Length Subnet Mask Table Master Subnet Mask Master Subnet Total Valid IPs Number of Hosts Block Size LAN IPs Router IPs Number of Links Valid No. of Hosts Required IPs Validation Result

Generate Result Sum up Hosts Update number of Hosts Adjust to Upper Limit VLSM Table Number of Hosts Adjusted Updated Total LAN IPs No. of Hosts Block Size No. of Hosts

This module calculates the maximum number of IPs that are available from the Master Subnet Mask. The total number of IPs required is calculated from the Router connectivity and the number of hosts in each LAN segment. These two values are compared, and subnetting is performed if and only if the available IPs is more than the total number of IPs required after subnetting. Data Structure : Rn – Total no. of Routers in the Network. Rcn –Total number of Router Connections. Ln – Total no. of LANs in the Network. Li – Number of Hosts in LANi. Aip – Total Number IPs available. Rip – Total number of IPs needed for Router Connectivity. Lip – Total number of IPs needed for LAN Connectivity. Nip – Total number of IPs required for the Network. t[8] – An Integer Array that stores permissible values of Lip. Lip  0. T[ ] = {2, 4, 8, 16, 32, 64, 128, 256, 0} Feasibility Module – /* */

1. Begin 2. Rip  Rcn * 4 3. Lip  Lip + func (Li) 4. Nip  Rip + Lip 5. if, Aip < Nip, then 6. Generate Error 7. else, proceed for Subnetting 8. End Steps :-

This module takes the number of hosts in LAN segment (i) as its input. The total number of IPs for the LAN segment is determined after comparing the number of Hosts with the Standard Block Size of Subnet Masks. Func (int Li) – /* */ 1. Li  Li t[8]  Li 3. for i  0 to 9, do 4.for j  0 to 9, do 5.if, t[i] <= t[j], then 6.temp  t[i] 7.t[i]  t[j] Steps :-

8.t[j]  temp 9.end if 10.end for 11. end for 12. for I  0 to 9, do 13.if, t[i] = Li, then 14.k  i end if 16. end for 17. Return t[k] Steps (contd.) :-

This procedure calculates the IP range for each Router Connection. Since, each inter router connectivity requires just 4 IP values, so we can use the same Subnet Mask for all the Router connections and hence, determine the IP Address values. Data Structure : Rn – Total no. of Routers in the Network. Rcn – Total number of Router Connections. Ip – IP Address of Master Network. SMi – Subnet Mask for Router Connection Rij. Ip  Procedure RouterSubnetting( ) – /* */ 1. Begin 2. for i  0 to Rcn, do 3.for j  0 to 4, do 4.if, Ip1 <= 255, then 5.if, Ip2 <= 255, then Steps :-

6.if, Ip3 <= 255, then 7.if, Ip4 <= 255, then 8.if, Ip4 == 255, then 9.Ip4  0 10.Ip3  Ip else 12.Ip4  Ip end if 14.if, Ip3 == 255, then 15.Ip3  0 16.Ip2  Ip else 18.Ip3  Ip end if 20. if, Ip2 == 255, then 21.Ip2  0 22.Ip1  Ip end if 24.end for 25. SMi  end for 27. Ip_L  Ip 28. end Procedure Steps (contd.) :-

This procedure calculates the IP range for each LAN Connection. Since, the Subnet Mask of the LAN segments depend on the number of hosts, we need to compute the IP Address range for each LAN segment individually, keeping in mind the Block Size that the LAN connection belongs to. Data Structure : Ln – Total no. of LANs in the Network. Li – Number of Hosts in LANi. Ip  Ip_L Procedure LANSubnetting( ) – /* */ 1. Begin 2. for i  0 to Ln, do 3.for j  0 to Li, do 4.if, Ip1 <= 255, then 5.if, Ip2 <= 255, then Steps :-

6.if, Ip3 <= 255, then 7.if, Ip4 <= 255, then 8.if, Ip4 == 255, then 9.Ip4  0 10.Ip3  Ip else 12.Ip4  Ip end if 14.if, Ip3 == 255, then 15.Ip3  0 16.Ip2  Ip else 18.Ip3  Ip end if 20. if, Ip2 == 255, then 21.Ip2  0 22.Ip1  Ip end if 24.end for 25. end for 26. end Procedure Steps (contd.) :-

The GUI provides nice and easy approach for the user and system interaction. Warning messages have been provided to indicate errors during inputs provided by the users. This software provides the facility to divide a large network into smaller sub network. This software is very user friendly, and provides a very convenient method to subnet a large network.

Its use is restricted only to Classless networks and it cannot be implemented in cases where the Network implements Classful IP Addressing. The maximum permissible limit to the number of routers and LAN segments is 10. A further increment in the numbers is possible by adding few lines of code to the existing project. The report format generated by the system is fixed and any changes to the report format could be done with the help of the developers. The system does not deal with other elements of the network, such as Gateways, bridges, etc.

The system can have scope for incremental change. We can increase the count of routers and LAN segments to realize an enhanced implementation of the system. The same could be setup on a college LAN and we can assign IP addresses to each of the sub networks existing without wasting the address space allocated to the college.

Reference / Bibliography – Todd Lammle, “CISCO Certified Network Associate Study Guide”, Fifth Edition, PBP Publications. Richard Deal, “CISCO Certified Network Associate Study Guide”, Fourteenth Edition, Tata McGraw Hill, John Sharp, “Microsoft Visual C# 2005 Step by Step”, Prentice Hall of India, Rajib Mall, “Fundamentals of Software Engineering”, Second Edition, Prentice-Hall of India, Stephen C. Perry, “Core C# and.NET”, Prentice Hall PTR, Variable Length Subnet Mask: Classless Inter Domain Routing: