MR-22 B.Tech.
CSE                                                                MGIT (Autonomous), Hyderabad
                                                                      MGIT (A), Hyderabad
B.Tech. V Semester
                                                                                                      L    T    P    C
                                                                                                      3    0    0    3
                             CS502PC: COMPUTER NETWORKS
                        (Common to CSE, CSBS, CSE(AI&ML), CSE (Data Science))
Course Objectives:
 ● The objective of the course is to equip the students with a general overview of the concepts and fundamentals
     of computer networks.
 ●   Familiarize the students with the standard models for the layered approach to communication between machines
     in a network and the protocols of the various layers.
Course Outcomes:
 ●   Gain the knowledge of the basic computer network technology.
 ●   Gain the knowledge of the functions of each layer in the OSI and TCP/IP reference model.
 ●   Identify and analyze various routing algorithms, congestion control algorithms.
 ●   Outline the transport layer protocols like TCP and UDP.
 ●   List and examine the applications of HTTP, WWW, DNS, Email, FTP and the underlying protocols.
UNIT - I
Network Hardware: Local Area Networks, Metropolitan Area Networks, Wide Area Networks, Internetwork. Network
software: Protocol Hierarchies, Design Issues for the Layers, Connection-Oriented and Connectionless Services.
Reference Models: OSI, TCP/IP Reference models, Comparison of OSI and TCP/IP Models Example Networks:
ARPANET, Internet. Physical Layer: Guided Transmission media: Magnetic Media, Twisted pairs, Coaxial Cable,
Fiber Optics, Unguided Transmission Media: Radio waves, Microwaves, Infrared.
UNIT - II
Data link layer: Design issues, Framing: Character Count, Character Stuffing, Bit Stuffing Error Detection and
Correction: Block Codes, Simple Parity Check, LRC, Hamming Distance, Checksum, Hamming Code, CRC,
Elementary data link protocols: simplex protocol, A simplex stop and wait protocol for an error-free channel, A simplex
stop and wait protocol for noisy channel. Sliding Window protocols: Pipelining, Piggybacking, A one-bit sliding window
protocol, A protocol using Go-Back-N, A protocol using Selective Repeat, Medium Access sub layer: The channel
allocation problem, Multiple access protocols: ALOHA, Carrier sense multiple access protocols, collision free protocols.
Wireless LANs, Connecting devices at the data link layer.
UNIT - III
Network Layer: Design issues, Routing algorithms: shortest path routing, Flooding, Hierarchical routing, Broadcast,
Multicast, distance vector routing, Link State Routing, Congestion Control Algorithms: Approaches to Congestion
Control, Traffic aware routing, Admission Control, Traffic throttling, Load shedding. Quality of Service: Traffic
Shaping, Packet scheduling, Admission Control, Integrated services, Differentiated Services, Internetworking,
Network layer in the Internet: IPv4 protocol, IP Addresses, IPv6 protocol, Internet Control Protocols: ICMP, ARP,
RARP, BOOTP, and DHCP.
UNIT - IV
Transport Layer: Transport Services: Services provided to Upper layer, Transport service primitives, Berkeley Sockets
Elements of Transport protocols: Addressing, Error and Flow Control, Multiplexing, Crash Recovery, Connection
management. Internet Transport Protocols: TCP: Service Model, TCP Protocol, Segment header, TCP Connection
establishment and Release, TCP Connection management, TCP Sliding Window, Timer management, TCP Congestion
Control. UDP: Protocol, UDP Header
MR-22 B.Tech. CSE                                                          MGIT (Autonomous), Hyderabad
                                                                  MGIT (A), Hyderabad
UNIT - V
Application Layer: Domain name system- DNS Name Space, Resource records, Name Servers. SNMP, Electronic Mail:
Architecture and Services, User Agent, Message Formats, Message Transfer, Final Delivery. SMTP, POP3, ICMP. File
transfers: FTP, TFTP, Telnet.
TEXT BOOKS:
   1. Computer Networks -- Andrew S Tanenbaum, David. j. Wetherall, 5th Edition. Pearson Education/PHI,
      2011.
    2.   Data Communications and Networking – Behrouz A. Forouzan. Fifth Edition TMH, 2017.
REFERENCE BOOKS:
    1.   An Engineering Approach to Computer Networks-S. Keshav, 2nd Edition, Pearson Education
    2.   “Data and Computer Communications” by William Stallings 9th Edition, Pearson Education 2010.TCP/IP
         Illustrated” by W. Richard Stevens, Addison-Wesley Professional 2nd edition 2011.
MR-22 B.Tech. CSE                                                                MGIT (Autonomous), Hyderabad
                                                                        MGIT (A), Hyderabad
                                                                                                 L    T     P     C
                                                                                                 0    0     2     1
B.Tech. V Semester
                             CS551PC: COMPUTER NETWORKS LAB
                        (Common to CSE, CSBS, CSE(AI&ML), CSE (Data Science))
Course Objectives:
    • To understand the working principle of various communication protocols.
    • To understand the network simulator environment and visualize a network topology and observe its
      performance
    • To analyze the traffic flow and the contents of protocol frames
Course Outcomes:
    •   Implement data link layer farming methods
    •   Analyze error detection and error correction codes.
    •   Implement and analyze routing and congestion issues in network design.
    •   Implement Encoding and Decoding techniques used in presentation layer.
    •   To be able to work with different network tools.
List of Experiments:
1. Write a program to implement framing.
i. Fixed framing, ii. Variable framings
2. Write a program to implement stuffing techniques.
i. Bit-stuffing ii. Character stuffing
3. Write a program to implement checksum
4. Write a program to compute CRC code for the polynomial CRC-12
5. Develop a simple data link layer that performs the flow control using the sliding window protocol, and loss recovery
    using the Go-Back-N mechanism.
6. Write a program to implement classful addressing.
7. Write a program to implement classless addressing.
8. Write a program to implement Dijsktra’s algorithm to compute the shortest path through a network
9. Write a program to divide a given network into n-sub networks using CISCO Packet Tracer.
10. Implement distance vector routing algorithm for obtaining routing tables at each node.
11. Write a program to implement Link state routing
12. Write a program for congestion control using Leaky bucket algorithm
13. Implement data encryption and data decryption.
14. Basic Trouble shooting commands ipconfig,ping ,tracert,nslookup,arp etc.
TEXT BOOK:
1. Computer Networks – Andrew S Tanenbaum, David.j.Wetherall, 5th Edition. Pearson Education/PHI,2011.