I Sem Computer Networks( 2012 syllabus)

SCHEME OF TEACHING AND EXAMINATION FOR

M.TECH. COMPUTER SCIENCE and ENGINEERING

(I Sem)

Subject Code	Name of the Subject	Teaching hours/week		Duration of Exam in Hours	Marks for		Total Marks
		Lecture	Practical /Field Work / Assignment/ Tutorials		I.A.	Exam
12SCS11	Computer Networks	04	02#	03	50	100	150
12SCS12	Advances in Operating Systems	04	02*	03	50	100	150
12SCS13	Advances in Database Management Systems	04	02*	03	50	100	150
12SCS14	Computer Systems Performance Analysis	04	02#	03	50	100	150
12SCS15x	Elective – I	04	02	03	50	100	150
12SCS16	Seminar	--	03	--	50	--	50
Total		20	13	15	300	500	800

  

Elective I

12SCS151 Advances in Digital Image Processing

12SCS152 Computer Graphics & Visualization

12SCS153 Optical Networks

12SCS154 Embedded Systems

COMPUTER NETWORKS

Subject Code: 12SCS11 I.A. Marks : 50

Hours/Week : 04 Exam Hours: 03

Total Hours : 52 Exam Marks: 100

1. Review of Basic Concepts: Building a Network; Requirements- Connectivity, Cost-Effective Resource Sharing,

Support for Common Services; Network Architecture- Layering and Protocols, OSI Architecture, Internet

Architecture; Performance- Bandwidth and Latency, Delay× Bandwidth Product, High-Speed Networks.

2. Direct link networks: Hardware Building Blocks-nodes, links; error Detection- Two-Dimensional Parity, Internet

checksum Algorithm, cyclic Redundancy Check; reliable Transmission- Stop-and-Wait, Sliding Window, Concurrent

Logical Channels; Rings (802.5, FDDI) –Token Ring Media Access Control, Token Ring Maintenance, FDDI.

3. Packet Switching: Switching and forwarding – Datagrams,Virtual Circuit Switching, Source Routing; Bridges and

LAN Switches – Learning Bridges, Spanning Tree Algorithm, Broadcast and Multicast, Limitations of Bridges; cell

switching (ATM) – Cells, Segmentation and Reassembly, Virtual Paths, Physical Layers for ATM.

4. Internetworking: Simple internetworking (IP) – What Is an Internetwork?, Service Model, Global Address,

Datagram Forwarding in IP, Address Translation(ARP), Host Configuration(DHCP), Error Reporting(ICMP), Virtual

Networks and Tunnels; Routing – Network as a Graph, distance Vector(RIP), Link State(OSPF), Metrics, Routing for

Mobile Hosts, Global Internet – Subnetting, Classless Routing(CIDR), Interdomain Routing(BGP), Routing Areas, IP

Version 6(IPv6).

5. End –to-End Protocols: Simple demultiplexer (UDP); Reliable byte stream (TCP) – End-to-End Issues, Segment

Format, Connection Establishment and Termination, Sliding Window Revisited, Triggering Transmission, Adaptive

Retransmission, Record Boundaries, TCP Extensions, Alternative Design Choices.

6. Congestion Control and Resource Allocation: Issues in resource allocation – Network Model, Taxonomy,

Evaluation Criteria; Queuing discipline – FIFO, Fair Queuing; TCP Congestion Control – Additive

Increase/Multiplicative Decrease, Slow Start, Fast Retransmit and Fast Recovery; Congestion-Avoidance

mechanisms – DECbit, Random Early Detection (RED), Source-Based Congestion Control.

7. Applications: Traditional applications – Electronic Mail (SMTP, MIME, IMAP), World Wide Web (HTTP), Name

Service (DNS), Network management (SNMP); Web services – Custom APPLICATION Protocols (WSDL, SOAP), A

Generic application Protocol (REST).

Laboratory Work:

Using any Protocol Analyzer like Ethereal, perform the following experiments:

1. Capture the packets that are transmitted after clicking on the URL of the web site of your college. Analyze

the packets at the highest level and prepare a brief report of your analysis.

2. Analyze the data captured above at lower levels and demonstrate the layering of the protocols.

3. Capture the packets in the LAN, & filter for a unique subscriber

4. Capture the ARP packets and find the MAC addresses in the LAN in your laboratory.

Using either NS228/OPNET or any other suitable simulator, perform the following experiments:

1. Simulate an Ethernet LAN using 10 node , change error rate and data rate , and compare throughput

2. Simulate a three nodes point – to – point network with duplex links between them. Set the queue size and

vary the bandwidth and find the number of packets dropped.

3. Simulate the transmission of ping messages over a network topology consisting of 6 nodes and find the

number of packets dropped due to congestion.

4. Simulate an Ethernet LAN using n nodes and set multiple traffic nodes and plot congestion window for

different source / destination.

Implement the following in C/C++:

1. Write a program for distance vector algorithm to find suitable path for transmission.

2. Write a program for error detecting code using CRC-CCITT (16-bit)

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

TEXT BOOKS:

1. Larry L. Peterson and Bruce S. David: Computer Networks – A Systems Approach, 4th Edition, Elsevier,

2007.

REFERENCE BOOKS:

1. Behrouz A. Forouzan: Data Communications and Networking, 4th Edition, Tata McGraw Hill, 2006.

2. William Stallings: Data and Computer Communication, 8th Edition, Pearson Education, 2007.

3. Alberto Leon-Garcia and Indra Widjaja: Communication Networks -Fundamental Concepts and Key

Architectures, 2nd Edition Tata McGraw-Hill, 2004.