M.Tech 1st sem CS Syllabus (pdf)

M.Tech in Computer Science and Engineering I SEMESTER 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 LANSwitches – Learning Bridges, Spanning Tree Algorithm, Broadcast and Multicast, Limitations of Bridges; cell switching (ATM) – Cells, Segmentation and Reassembly, Virtual Paths, Physical Layers for ATM.

Image credit

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).

The above is sample. Click on Download to get the complete 

syllabus

                       DOWNLOAD

                                                    How to download?

Please comment.......