CSMA/CD

AIM: To conduct an experiment to demonstrate the working of CSMA/CD using Ethernet and Ethernet cables among multiple system. THEORY: CSMA method does not specify the procedure following a collision carrier sence multiple across with collision detection argument with the algorithm to handle the collision. PROCEDURE: Power up the system. Go to start program select the network laboratory system the main menu appears. Choose layer network layer CSMA/CD the following screen will be displayed. IP address is shown in all the system where the experiment is running click on the ok button to continue. Click on the start button data rate option is enable select the data rate for transmitting the file.The data rates are 50kbps,100kbps,150kbps. Select the file from the system and transmit. Similarly select the different data rate and transmit the file and select collision for the data byte received and send.

RESULT:

DATA ENCRYPTION DECRYPTION

AIM: To conduct an experiment to demonstrate the working of data encryption and decryption.

APPARATUS REQUIRED: PC Power supply

SOFTWARE USED: Network laboratory system THEORY: Any one who needs to send a message to both can use ciphertext 1 that alice sends to bob can be calculated as C=Pe(modn).When bob receives the 2/3 completed key from alice to address the last part y to complete the key. PROCEDURE: Power up the system. Go to start program select the network laboratory system the main menu appears. Choose layer presentation layer encryption and decryption. After choosing encryption and decryption Click on the start button on the both system. Enter the IP address and key value. Click the send button to transmit the encrypted data to be destination IP address. Click the receive button to receive the encrypted data on the text area. Click the decrypt button to get the plain text message. The decrypted message is shown on the text area.

RESULT:

WORKING WITH DISTANCE VECTOR ALGORITHM

AIM: To study the distance vector algorithm.

THEORY: Distance vector routing algorithm operate by having each route maintain a table giving which line is to get three. These table are updated by exchanging information with the neighbours. In distance vector each routers maintain a routing table indexed by an and containing one entry for the each router in the subnet. To matric used might be number of hops time delay or total packets queue along the path or something similar. The router is assumed to know the distance to each of its neighbor. If the metric in hop the distance is just one hop. If the metric is delay,the router can measure it directly. In distance vector algorithm each