• No results found

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

N/A
N/A
Protected

Academic year: 2023

Share "DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING "

Copied!
6
0
0

Loading.... (view fulltext now)

Full text

(1)

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

COURSE PLAN – PART I Name of the

programme and specialization

B.Tech

Course Title NETWORKS AND PROTOCOLS

Course Code ECPE29 No. of Credits 3

Course Code of Pre-

requisite subject(s) NONE

Session JAN 2021 Section

(if, applicable) A&B Name of Faculty Dr. B. Rebekka

Department ECE

Official Email rebekka@nitt.edu Telephone No. 04312503316 Name of Course

Coordinator(s) (if, applicable)

Official E-mail Telephone No.

Course Type (please

tick appropriately) Elective course Syllabus (approved in BoS)

Network Components, Topologies, Network hardware and software, Network Models: OSI Model & TCP/IP Protocol stack, HTTP FTP, SMTP, POP, SNMP, DNS, Socket

programming with TCP and UDP.

Transport Layer services, UDP, TCP, SCTP, Principles of reliable data transfer, Flow control, Congestion Control, Quality of Service.

Network Layer services, Datagram and Virtual circuit service, DHCP, IPV4, IPV6, ICMP, Unicast routing protocols: DV, LS and Path vector routing, Multicast routing.

Data Link Layer services, Overview of Circuit and Packet switches, ARP, Data link control:

HDLC & PPP, Multiple access protocols, Wireless LAN, Comparison wired and wireless LAN.

Network security threats, Cryptography, Security in the Internet: IP Security & Firewalls, Multimedia: Streaming stored video/ audio, RTP, Network Troubleshooting.

COURSE OBJECTIVES

To get an understanding on the fundamentals of networks and issues involved.

To acquire an understanding on the set of rules and procedures that mediates the exchange of information between communicating devices.

MAPPING OF COs with POs

(2)

Course Outcomes

Programme Outcomes (PO) (Enter Numbers only) CO1: Compare and examine, OSI and TCP/IP protocol stacks 1, 2, 3,12

CO2: Categorize services offered by all layers in TCP/IP protocol

stack 1, 2, 3,12

CO3: Analyse a network under congestion and propose solutions for reliable data

transfer

1, 2, 3,12 CO4: Examine the protocols operating at different layers of TCP/IP

model 1, 2, 3,12

CO5: Assess the cryptographic techniques, Manage a network and

propose solutions under network security threats. 1, 2, 3,12

COURSE PLAN – PART II COURSE OVERVIEW

The aim of this course is to understand the need of layered protocol architecture of a computer network and get exposed to different protocols

COURSE TEACHING AND LEARNING ACTIVITIES ( Add more rows) S.No. Week/Contact

Hours

Topic Mode of Delivery

1 1st

Introduction to Computer network : Network Components, Network

topologies ,Types of network, Understanding the need for Protocol

PPT

2 2nd

OSI layers and its functionalities ,TCP/IP protocol stack and its

comparison with OSI model ,Application layer protocols: HTTP,

Persistent and Non-persistent connections

PPT

3 3rd

FTP and its comparison with HTTP, SMTP, POP, SNMP DNS, Classes of

DNS servers, Socket programming with TCP and UDP

PPT

4 4th

Introduction to Transport layer services Connectionless transport:

UDP and its segment structure, Principles of reliable data transfer,

Protocols rdt 1.0 with FSM representation,

PPT

5 5th

rdt 2.0, rdt 2.1, rdt 2.2, rdt 3.0 the alternating bit protocol Pipelined reliable data transfer protocols, Go- Back-N(GBN), Selective Repeat(SR)

protocols

PPT

(3)

6 6th

TCP congestion control: Static and Dynamic congestion window, Datagram congestion Control

Protocol (DCCP)

PPT

7 7th

Network layer services, Virtual service and datagram networks, Dynamic Host Configuration protocol

(DHCP), Internet Control Message protocol (ICMP), The Internet protocol (IP), IPv4 datagram format

PPT

8 8th

IPv6 and its datagram format, Routing principles: Distance Vector

Routing (DVR), Intra-AS routing in Internet: Routing Information protocol

(RIP), Exterior Gateway protocol (EGP), Connectionless Network protocol (CLNP), Enhanced Interior

Gateway protocol (EIGRP)

PPT

9 9th

Data link layer services, Introduction to circuit and Packet switches, Address resolution Protocol (ARP),

Reverse ARP (RAPR), High level Data link protocol (HDLC), Point- to-

Point protocol (PPP), Fiber Distributed data Interface (FDDI),

Frame relay

PPT

10 10th

Introduction to Network Security, types of Cryptographic algorithms

Symmetric key cryptography

PPT

11 11th Public key encryption, Access

Control: Fire walls PPT

12 12th

Internet audio/video, Streaming stored audio/video Streaming live audio/video, Interactive audio/video

PPT

COURSE ASSESSMENT METHODS (shall range from 4 to 6)

S.No. Mode of Assessment Week/Date Duration % Weightage 1

ASSESSMENT I Descriptive Type Examination

2 Units (Institute Procedure)

Last week of

February 60 minutes 20

2

ASSESSMENT II Seminar/Assignment (Institute Procedure)

First week of

March 15

3

ASSESSMENT III Descriptive Type Examination

2 Units (Institute Procedure) First week of April

60 minutes 20

(4)

4.

ASSESSMENT IV Viva/Objective type test

(Institute Procedure)

Second week of

April

15

CPA

Compensation Assessment*

(Institute Procedure) 60 minutes

4 FINAL ASSESSMENT * (Institute Procedure)

Second week

of May 120 minutes 30

*mandatory; refer to guidelines on page 4

COURSE EXIT SURVEY (mention the ways in which the feedback about the course shall be assessed)

1. Direct feedback from the students by having face-to-face meeting individually and as the class as a whole.

2. Feedback from the students during the class committee meetings

COURSE POLICY (including compensation assessment to be specified) COMPENSATION ASSESSMENT

 Attending all the assessments is MANDATORY for every student.

 If any student is not able to attend either one or both of the continuous assessments I &

II due to genuine reason, student is permitted to attend the compensation assessment (CPA) with only 20 % weightage for both the cases.

 At any case, CPA will not be considered as an improvement test.

ATTENDANCE POLICY (A uniform attendance policy as specified below shall be followed)

 At least 75% attendance in each course is mandatory.

 A maximum of 10% shall be allowed under On Duty (OD) category.

 Students with less than 65% of attendance shall be prevented from writing the final assessment and shall be awarded 'V' grade.

ACADEMIC DISHONESTY & PLAGIARISM

 As most of the assessments go online, discussing/talking to other students, sharing material and copying from others during an assessment will be treated as punishable dishonesty.

 Zero mark to be awarded for the offenders. For copying from another student, both students get the same penalty of zero mark.

 The departmental disciplinary committee including the course faculty member, PAC chairperson and the HoD, as members shall verify the facts of the malpractice and award the punishment if the student is found guilty. The report shall be submitted to the Academic office.

 The above policy against academic dishonesty shall be applicable for all the programmes.

(5)

ADDITIONAL INFORMATION, IF ANY

Students can clarify their doubts by writing to the teacher’s email rebekka@nitt.edu. Detailed discussions can be planned apart from regular classes. The students must come prepared for the discussion with background preparation. Minor doubts will be clarified after the contact hours without any prior appointment through the online platform.

FOR APPROVAL

Course Faculty __________ CC- Chairperson ________________ HOD ____________ Dr.R.Malmathanraj

(6)

References

Related documents

First we need to determine the topology for the on-chip network and then a specific routing algorithm should be chosen. A routing algorithm determines the entire path for the

Example of reactive multicast routing protocols is On-Demand Multicast Routing Protocol (OD-MRP) and Multicast Adhoc on-interest Distance Vector (MAODV).These pro- tocols

The routing table provides details for the path to be followed to reach the destination router in the best possible shortest path available.it includes details like the

In this approach nodes in the network regularly discover path to all nodes which are reachable and tries to keep consistent and up-to-date routing information in the routing

1. Understand significance and the areas of application of high-speed electronics circuits. Understand the properties of various components used in high speed electronics. Design

The selection mechanism show how to select fiber material based on the minimum delay.Delay play a major role in data transmission technology.If we are able to select a Light-Path

Based on the PLI impairments like fiber attenuation, chromatic dispersion ,cross talk, amplifier spontaneous noise and polarization mode dispersion, which reflects the

We present a KNN model and its learning algorithm for clustering based on the adjacency relation between the nodes of the network topology and a Hopfield neural- network model for