SCHEME OF TEACHING AND EXAMINATION M.TECH.

- NETWORKING & INTERNET ENGINEERING I SEMESTER Teaching hours/week Course Code Subject Code Name of the Subject Practical Lecture
4 4 4 4 4 18 2 2 3 07 06

Marks for Duration of Exam in Hours

3 3 3 3 3 15

Tuto rial
2 2 2

I.A.
50# 50* 50
*

Exam
100 100 100 100 100 500

Total Marks

10LNI11 10LNI12 10LNI13 10LNI14 10LNI15 10LNI16

*

10EC004 10EC023 10EC056 10EC046 10Ecxxx 10EC911

Advanced Computer Networks Cryptography & Network Security Network Programming Linear Algebra Elective-I (10LNI15x) Mini Project/Seminar Total

150 150 150 150 150 50 800

50# 50# 50
$

300

Practical will be evaluated 25 marks and internal assesment for 25 marks. Lab journals should be maintained. # Assignments/seminar will be evaluated for 25 marks and internal assesment for 25 marks. Record of Assignments/seminar should be maintained. $ Mini projet should be done individually and is assessed for 25 marks. Seminar on Miniproject will be assessed for 25 marks. ELECTIVE I 10LNI151 10EC059 Optical Comm. & Networking 10LNI152 10EC040 Ethernet Technology I SEMESTER ADVANCED COMPUTER NETWORKS Subject Code No. of Lecture Hours /week Total no. of Lecture Hours : 10EC004 : 04 : 52 IA Marks Exam Hours Exam Marks : 50 : 03 : 100

10LNI153

10EC052

Multimedia Communications

Introduction : Computer networks; Telephone networks, Networking principles; Multiple Access, multiplexing - FDM, TDM, SM; Local Area Networks - Ethernet, token ring, FDDI; switching - circuit switching, packet switching, multicasting; Scheduling - Performance bounds, best effort disciplines, naming and addressing, protocol stack, SONET/SDH; ATM Networks - AAL, virtual circuits, SSCOP; Internet -addressing, routing, end point control; Internet protocols - IP, TCP, UDP, ICMP, HTTP; Traffic Management - Models, classes, scheduling; Control of Networks - QoS, static and dynamic routing, Markov chains, queueing models, Bellman Ford and Dijkstra's algorithms, window and rate congestion control, large deviations of a queue and network, open and closed loop flow control, control of ATM networks. Performance Metrics REFERENCE BOOKS:

1.J. Walrand and P. Varaya, High Performance Communication Networks, Harcourt Asia (Morgan Kaufmann), 2000. 2.S. Keshav, An Engineering Approach to Computer Networking, Pearson Education, 1997. 3.A. Leon-Garcia and I. Widjaja, Communication Networks: Fundamental Concepts and Key Architectures, Tata McGraw Hill, 2000. 4.J. F. Kurose and K. W. Ross, Computer Networking: A Top-Down Approach Featuring the Internet, Pearson Education, 2001. CRYPTOGRAPHY AND NETWORK SECURITY Subject Code No. of Lecture Hours /week Total no. of Lecture Hours : 10EC023 : 04 : 52 IA Marks Exam Hours Exam Marks : 50 : 03 : 100

Overview: Services, Mechanisms and attacks, OSI security architecture, Model for network security. Classical Encryption Techniques: Symmetric cipher model, Substitution techniques, Transposition techniques, Rotor machine, Steganography, Problems. Block Ciphers and DES (Data Encryption Standards): Simplified DES, Block cipher principles, DES, Strength of DES, Block cipher design principles, Block cipher modes of operation, Problems. Public Key Cryptography and RSA: Principles of public key cryptosystems, RSA algorithm, Problems.

Other Public Key Crypto Systems and Key Management: Key management, Diffie-Hellman key exchange, Elliptic curve arithmetic, Elliptic curve cryptography, Problems. Message Authentication and Hash Functions: Authentication requirements, Authentication functions, Message authentication codes, Hash functions, Security of hash functions and MACs, Problems. Digital Signature and Authentication Protocol: Digital signature, Authentication protocols, Digital signature standard. Authentication Applications: Kerberos, X.509 authentication service, Kerberos encryption technique, Problems. Electronic Mail Security: Pretty good privacy, S/MIME, Data compression using ZIP, Radix-64 conversion, PGP random number generator. IP Security: Overview, IP security architecture, Authentication header, ESP (encapsulating security pay load), Security associations, Key management, Problems.) Firewalls: Firewall design principles; Trusted systems, Problems. REFERENCE BOOKS: 1.William Stallings, Cryptography and Network Security, 3rd edition, Pearson Education (Asia) Pte. Ltd./ Prentice Hall of India, 2003. 2.C. Kaufman, R. Perlman, and M. Speciner, "Network Security: Private Communication in a Public World, 2nd edition, Pearson Education (Asia) Pte. Ltd., 2002. 3.Atul Kahate, Cryptography and Network Security, Tata McGraw-Hill, 2003. 4.Eric Maiwald, Fundamentals of Network Security, McGraw-Hill, 2003.

Laboratory Experiments: Cryptography and Network Security 1. Write a program to encrypt any given message using a. Cipher model b. Substitution technique

c. Transformation techniques. 2. 3. 4. 5. 6. 7. 8. Write a program to verify the DES. Implement RSA algorithm. Demonstrate the working of Diffie-Hellman key exchange techniques. Demonstrate the Authentication using a. Message authentication b. Hash function Implement data compression using ZIP technique Implement the PGP random- number genrator . Demonstrate the IP security issues using any suitable techniques. NETWORK PROGRAMMING Subject Code No. of Lecture Hours /week Total no. of Lecture Hours : 10EC056 : 04 : 52 IA Marks Exam Hours Exam Marks : 50 : 03 : 100

Introduction and Elementary Socket: Introduction Transport Layer Sockets Introduction Elementary TCP Sockets TCP Client/Server Example Elementary SCTP Sockets SCTP Client/Server Example Name and Address Conversions Advanced Sockets: IPv4 and IPv6 Interoperability Daemon Processes and the inetd Superserver Advanced I/O Functions Unix Domain Protocols Nonblocking I/O ioctl Operations Routing Sockets Key Management Sockets Broadcasting Multicasting Advanced UDP Sockets Advanced SCTP Sockets Out-at-Band Data Signal-Driven I/O Threads IP Options Raw Sockets Data link Access Client/Server Design Alternatives REFERENCE BOOKS: 1.W. Richard Stevens, Bill Fenner, Andrew M. Rudoff: UNIX Network Programming. Volume 1, Third Edition, Pearson 2004 2.Barry Nance: Network Programming in C, PHI 2002 3.Bob Quinn, Dave Shute: Windows Socket Network Programming, Pearson 2003 4.W. Richard Stevens: UNIX Network Programming. Volume 2, Second Edition Laboratory Experiments: 1.Write a program that create 2 children and 4 grand-children. The program must print the process-id of the parent, child and grand children in the order. 2. Write a function that sends a message from a process(server) to another process (client). The client must ack the arrival of the the message and program must print the departure time and arrival time of the message. 3. Demonstrate the working of socket programming between TWO PC's. 4. Write a function in C to simulate the Routing Module. 5. Write a function in C to verify the CRC. 6. Write a program in C to verify the following: a. to channge the IP addresses in dotted-decimal notation to binary notation and visa-versa. b. that accepts an address and returns the class of the address.

that accepts the address and returns the last address in the block. 7. Given an address number (N), write a function that determines if the address can be used as the beginning address of the block with N address. 8. Write the function C to: a. calculate the checksum for an IP address b. simulate the header address module. c.simulate the reassembly module. 9. Write program to calculate the time elapsed from mid-night in millisecond when the time given as X:Y;Z AM or PM format.

c.

LINEAR ALGEBRA Subject Code No. of Lecture Hours /week Total no. of Lecture Hours : 10EC046 : 04 : 52 IA Marks Exam Hours Exam Marks : 50 : 03 : 100

Linear Equations: Fields; system of linear equations, and its solution sets; elementary row operations and echelon forms; matrix operations; invertible matrices, LU-factorization. Vector Spaces: Vector spaces; subspaces; bases and dimension; coordinates; summary of row-equivalence; computations concerning subspaces. Linear Transformations: Linear transformations; algebra of linear transformations; isomorphism; representation of transformations by matrices; linear functionals; transpose of a linear transformation. Canonical Forms: Characteristic values; annihilating polynomials; invariant subspaces; direct-sum decompositions; invariant direct sums; primary decomposition theorem; cyclic bases; Jordan canonical form. Iterative estimates of characteristic values. Inner Product Spaces: Inner products; inner product spaces; orthogonal sets and projections; Gram-Schmidt process; QR-factorization; least-squares problems; unitary operators. Symmetric Matrices and Quadratic Forms: Digitalization; quadratic forms; constrained optimization; singular value decomposition. REFERENCE BOOKS: . 1.David. C. Lay, Linear Algebra and its Applications, 3rd edition, Pearson Education (Asia) Pte. Ltd, 2005. 2.Kenneth Hoffman and Ray Kunze, "Linear Algebra," 2nd edition, Pearson Education (Asia) Pte. Ltd/ Prentice Hall of India, 2004. . 3.Bernard Kolman and David R. Hill, "Introductory Linear Algebra with Applications," Pearson Education (Asia) Pte. Ltd, 7th edition, 2003. 4.Gilbert Strang, "Linear Algebra and its Applications," 3rd edition, Thomson Learning Asia, 2003.

ELECTIVE-1 OPTICAL COMMUNICATION & NETWORKING Subject Code No. of Lecture Hours /week Total no. of Lecture Hours : 10EC059 : 04 : 52 IA Marks Exam Hours Exam Marks : 50 : 03 : 100

Introduction: Propagation of signals in optical fiber, different losses, nonlinear effects, solitons, optical sources, detectors. Optical Components: Couplers, isolators, circulators, multiplexers, filters, gratings, interferometers, amplifiers. Modulation Demodulation: Formats, ideal receivers, Practical detection receivers, Optical preamplifier, Noise considerations, Bit error rates, Coherent detection. Transmission System Engineering: system model, power penalty, Transmitter, Receiver, Different optical amplifiers, Dispersion. Optical Networks: Client layers of optical layer, SONET/SDH, multiplexing, layers, frame structure, ATM functions, adaptation layers, Quality of service and flow control, ESCON, HIPPI. WDM Network Elements: Optical line terminal optical line amplifiers, optical cross connectors, WDM network design, cost trade offs, LTD and RWA problems, Routing and wavelength assignment, wavelength conversion, statistical dimensioning model. Control and Management: network management functions, management frame work, Information model, management protocols, layers within optical layer performance and fault management, impact of transparency, BER measurement, optical trace, Alarm management, configuration management. Suitable number of Assignments / Tutorials can be given based on the syllabus REFERENCE BOOKS: 1.John M. Senior, Optical Fiber Communications, Pearson edition, 2000. 2.Rajiv Ramswami, N Sivaranjan, Optical Networks, M. Kauffman Publishers, 2000. 3.Gerd Keiser, Optical Fiber Communication, MGH, 1 991. 4.G. P. Agarawal, Fiber Optics Communication Systems, John Wiley NewYork, 1997 5.P.E. Green, Optical Networks, Prentice Hall, 1994.

ETHERNET TECHNOLOGY Subject Code No. of Lecture Hours /week Total no. of Lecture Hours : 10EC040 : 04 : 52 IA Marks Exam Hours Exam Marks : 50 : 03 : 100

Introduction: Introduction to Ethernet, The Evolution of Ethernet, The Ethernet System, The Media Access Control Protocol The media Access Control Protocol Full Duplex Ethernet Auto-Negotiation Ethernet Media Systems: Ethernet Media Fundamentals Twisted-Pair Media System(10Base-T) Fiber Optic Media System(10Base-F) Fast Ethernet Twisted-Pair Media System(100Base-TX) Fast Ethernet Fiber Optic Media System(100Base-FX) Gigabit Ethernet Twisted-Pair Media System(1000Base-T) Gigabit Ethernet Fiber Optic Media System (1000Base-X) Multi-Segment Configuration Guidelines Building Your Ethernet System: Structured Cabling Twisted-Pair Cables and Connectors Fiber Optic Cables and Connectors Ethernet Repeater Hubs Ethernet Switching Hubs Performance and Troubleshooting: Ethernet Performance Troubleshooting REFERENCE BOOKS: 1.Charles E. Spurgeon: Ethernet The Definitive Guide, OReilly 2004 2.Rich Seifert: Gigabit Ethernet, Addison-Wesley 1998

MULTIMEDIA COMMUNICATIONS

Subject Code No. of Lecture Hours /week Total no. of Lecture Hours

: 10EC052 : 04 : 52

IA Marks Exam Hours Exam Marks

: 50 : 03 : 100

Multimedia Communications: multimedia information representation, multimedia networks, multimedia applications, network QoS and application QoS. Information Representation: text, images, audio and video, Text and image compression, compression principles, text compression, image compression. Audio and video compression, audio compression, video compression, video compression principles, video compression standards: H.261, H.263, P1.323, MPEG 1, MPEG 2, Other coding formats for text, speech, image and video. Detailed Study of MPEG 4: coding of audiovisual objects, MPEG 4 systems, MPEG 4 audio and video, profiles and levels. MPEG 7 standardization process of multimedia content description, MPEG 21 multimedia framework, Significant features of JPEG 2000, MPEG 4 transport across the Internet. Synchronization: notion of synchronization, presentation requirements, reference model for synchronization, Introduction to SMIL, Multimedia operating systems, Resource management, process management techniques. Multimedia Communication Across Networks: Layered video coding, error resilient video coding techniques, multimedia transport across IP networks and relevant protocols such as RSVP, RTP, RTCP, DVMRP, multimedia in mobile networks, multimedia in broadcast networks. Assignments / Practicals can be given on writing the programs to encode and decode the various kinds of data by using the algorithms. Students can collect several papers from journals/conferences/Internet on a specific area of multimedia communications and write a review paper and make a presentation. REFERENCE BOOKS: 1.Fred Halsall, Multimedia Communications, Pearson education, 2001 2.K. R. Rao, Zoran S. Bojkovic, Dragorad A. Milovanovic, Multimedia Communication Systems, Pearson education, 2004 3.Raif steinmetz, Klara Nahrstedt, Multimedia: Computing, Communications and Applications, Pearson education, 2002 4.Tay Vaughan, Multimedia: Making it Work, 6th edition, Tata McGraw Hill, 2004 5.John Billamil, Louis Molina, Multimedia : An Introduction, PHI, 2002 6.Pallapa Venkataram, Multimedia information systems, Pearson education(InPress),2005.