PRESENTED BY:
Gaurav Singh
Himanshu Gupta
Hemant Shukla
Priyavart Singh

---

[attachment=12622]
Introduction
 Purpose of this Document:
This document contains a description for “Protocol Exsequendam” .The functional and non-functional requirements of the project, clarify the objectives of the system and how the developers will enhance the project to achieve all the objectives.
 Purpose of the Project:
In computer networks , communication occurs between entities in different systems. An entity is anything capable of sending or receiving information. However two entities cannot simply send bit streams to each other and expect to be understood. For communication to occur, entities must agree on a protocol. A protocol is a set of rules that governs data communications. A protocol defines what is communicated, how it is communicated and when it is communicated .
 Overview of the development of the project:
This project is mainly centered around implementation of routing protocols using “ C “ language .
(1) OSPF Routing Algorithm : OSPF(Open Shortest path First) uses the shortest path first (SPF) algorithm, also referred to as the Dijkstra algorithm, to determine the route to reach each destination. All routers in an area run this algorithm in parallel, storing the results in their individual topological databases. Routers with interfaces to multiple areas run multiple copies of the algorithm.
(2) Sliding Window Protocol : A sliding window protocol is a feature of packet-based data transmission protocols. Sliding window protocols are used where reliable in-order delivery of packets is required, such as in the Data Link Layer (OSI model) as well as in the Transmission Control Protocol (TCP).Conceptually, each portion of the transmission (packets in most data page link layers, but bytes in TCP) is assigned a unique consecutive sequence number, and the receiver uses the numbers to place received packets in the correct order, discarding duplicate packets and identifying missing ones. The problem with this is that there is no limit of the size of the sequence numbers that can be required.
It is also of two types :
(1)Go Back N Protocol: Go-Back-N ARQ is a specific instance of the automatic repeat request (ARQ) protocol, in which the sending process continues to send a number of frames specified by a window size even without receiving an acknowledgement (ACK) packet from the receiver. It is a special case of the general sliding window protocol with the transmit window size of N and receive window size of 1.
(2)Selective repeat ARQ : Selective Repeat ARQ / Selective Reject ARQ is a specific instance of the Automatic Repeat-reQuest (ARQ) Protocol. It may be used as a protocol for the delivery and acknowledgement of message units, or it may be used as a protocol for the delivery of subdivided message sub-units.When used as the protocol for the delivery of messages, the sending process continues to send a number of frames specified by a window size even after a frame loss. Unlike Go-Back-N ARQ, the receiving process will continue to accept and acknowledge frames sent after an initial error; this is the general case of the sliding window protocol with both transmit and receive window sizes greater than 1
 Technologies Used:
 Operating system – Windows ME/XP/Vista.
 Programming Language- C