COMPUTER NETWORKS & PROTOCOLS (BEC702)

COMPUTER NETWORKS & PROTOCOLS

Course Code BEC702 
CIE Marks 50
Teaching Hours/Week (L: T: P: S) (3:0:2:0) 
SEE Marks 50
Total Hours of Pedagogy 40 hours Theory + 13 Lab slots
Total Marks 100
Credits 04 
Exam Hours 03

Module-1

Introduction: Data communication: Components, Data representation, Data flow, Networks:

Network criteria, Physical Structures, Network types: LAN, WAN, Switching, The Internet..

Network Models: TCP/IP Protocol Suite: Layered Architecture, Layers in TCP/IP suite,

Description of layers, Encapsulation and Decapsulation, Addressing, Multiplexing and

Demultiplexing, The OSI Model: OSI Versus TCP/IP. Data-Link Layer: Introduction: Nodes

and Links, Services, Two Categories’ of link, Sublayers, Link Layer addressing: Types of

addresses, ARP(1.1,1.2, 1.3.1to 1.3.4,2.2, 2.3 ,9.1, 9.2.1, 9.2.2 )

Module-2

Data Link Control (DLC) services: Framing, Flow and Error Control. Media Access Control:

Random Access: ALOHA, CSMA, CSMA/CD, CSMA/CA. Connecting Devices: Hubs,

Switches, Virtual LANs: Membership, Configuration, Communication between Switches,

Advantages. Wired and Wireless LANs: Ethernet Protocol, Standard Ethernet. Introduction to

wireless LAN: Architectural Comparison, Characteristics, Access Control. (11.1,12.1,13.1,

13.2.1 to 13.2.5,15.1,17.1,17.2 )

Module-3

Network Layer: Introduction, Network Layer services: Packetizing, Routing and Forwarding,

Other services, Packet Switching: Datagram Approach, Virtual Circuit Approach, IPV4

Addresses: Address Space, Classful Addressing, Classless Addressing, DHCP, Network

Address Resolution Network Layer Protocols: Internet Protocol (IP): Datagram Format,

Fragmentation, Options, Security of IPv4 Datagrams. IPv6 addressing and Protocol. Unicast

Routing: Introduction, Routing Algorithms: Distance Vector Routing, Link State Routing,

Path vector routing. (18.1(excluding 18.1.3), 18.2, 18.4,19.1,20.1, 20.2,22.1 and 22.2 )

Module-4

Transport Layer: Introduction: Transport Layer Services, Connectionless and Connection

oriented Protocols, Transport Layer Protocols: Simple protocol, Stop and wait protocol, GoBackN Protocol, Selective repeat protocol, Piggybacking Transport-Layer Protocols in the

Internet: User Datagram Protocol: User Datagram, UDP Services, UDP Applications,

Transmission Control Protocol: TCP Services, TCP Features, Segment, Connection, State

Transition diagram, Windows in TCP, Error control, TCP congestion control. (23.1, 23.2.1,

23.2.2, 23.2.3, 23.2.4, 23.2.5,24.2, 24.3.1, 24.3.2, 24.3.3, 24.3.4, 24.3.6, 24.3.8, 24.3.9 )

Module-5

Application Layer: Introduction: providing services, Application- layer paradigms, Standard

Client Server Protocols: Hyper Text Transfer Protocol, FTP: Two connections, Control

Connection, Data Connection, Electronic Mail: Architecture, Domain Name system: Name

space, DNS in internet, Resolution, DNS Messages, Registrars, DDNS, security of DNS.

Quality of Service (25.1, 26.1.2, 26.2, 26.3, 26.6, 30.1, 30.2.)

PRACTICAL COMPONENT OF IPCC

Experiments

1 Implement a point to point network with four nodes and duplex links

between them. Analyze the network performance by setting the queue size and

varying the bandwidth.

2 Implement a four node point to point network with links n0-n2, n1-n2 and

n2-n3. Apply TCP agent between n0-n3 and UDP between n1-n3. Apply

relevant applications over TCP and UDP agents changing the parameter and

determine the number of packets sent by TCP/UDP.

3 Implement Ethernet LAN using n (6-10) nodes. Compare the throughput by

changing the error rate and data rate.

4 Implement Ethernet LAN using n nodes and assign multiple traffic to the

nodes and obtain congestion window for different sources/ destinations.

5 Implement ESS with transmission nodes in Wireless LAN and obtain the

performance parameters.

6 Implementation of Link state routing algorithm

Implement the following using programming languages C/C++ etc,.

7 Write a program for a HLDC frame to perform the following.

i) Bit stuffing ii) Character stuffing.

8 Write a program for distance vector algorithm to find suitable path for

transmission

9 Implement Dijkstra‘s algorithm to compute the shortest routing path.

10 For the given data, use CRC-CCITT polynomial to obtain CRC code.

Verify the program for the cases : i)with out error ii)with error

11 Implementation of Stop and Wait Protocol and Sliding Window Protocol

12 Write a program for congestion control using leaky bucket algorithm.

Suggested Learning Resources:

Text Book:

 Data Communications and Networking, Forouzan, 5th Edition, McGraw Hill,

2016 ISBN: 1-25-906475-3

Reference Books:

1.A.S Tanenbaum - Computer Networks, 4th Edition, PHI, 2003

2.Computer Networks, James J Kurose, Keith W Ross, Pearson Education, 2013, ISBN: 0-273-76896-4

3.Introduction to Data Communication and Networking, Wayarles Tomasi,

Pearson Education, 2007, ISBN:0130138282