You are on page 1of 44







Hrs / Week Sl. No. Course No. Subject L T P TA 1 2 3 4 5 6 7 8 MITNE 101 MITNE 102 MITNE 103 MITNE 104 MITNE 105 MITNE 106 MITNE 107 MITNE 108 Mathematical Foundations Data Communication & Networks Network Flow Algorithms Computer Network Administration Elective I Elective II Network Programming & Internet Lab Seminar I Total 3 3 3 3 3 3 0 0 18 1 1 1 1 0 0 0 0 4 0 0 0 0 0 0 3 2 5 25 25 25 25 25 25 25 50 225 CT 25 25 25 25 25 25 25 0 175 Evaluation Scheme (Marks) Sessional Sub Total 50 50 50 50 50 50 50 50 400 ESE Total Credits (C)

100 100 100 100 100 100 100 0 700

150 150 150 150 150 150 150 50 1100

4 4 4 4 3 3 2 1 25

Elective I (MITNE 105)

MITNE 105 1 MITNE 105 2 MITNE 105 3 MITNE 105 4

Elective II (MITNE 106)

MITNE 106 1 MITNE 106 2 MITNE 106 3 MITNE 106 4

Coding Theory Web Technologies Information Resource Management Mobile Computing

Satellite and Space Communications Autonomic & Context aware computing Secure Communication and VPN Computer Network Management

L Lecture, T Tutorial, P Practical TA CT ESE Electives: Teachers Assessment (Assignments, attendance, group discussion, Quiz, tutorials, seminars, etc.) Class Test (Minimum of two tests to be conducted by the Institute) End Semester Examination to be conducted by the University New Electives may be added by the department according to the needs of emerging fields of technology. The name of the elective and its syllabus should be submitted to the University before the course is offered. Students may select a topic for their seminar preferably in the same area as that of their project.


Hrs / Week Sl. No. Course No. Subject L T P TA 1 2 3 4 5 6 7 8 MITNE 201 MITNE 202 MITNE 203 MITNE 204 MITNE 205 MITNE 206 MITNE 207 MITNE 208 Internet Computing Cryptography & Network Security Wireless& Mobile Networks Distributed Algorithms Elective III Elective IV Network Simulation Lab Seminar II Total 3 3 3 3 3 3 0 0 18 1 1 1 1 0 0 0 0 4 0 0 0 0 0 0 3 2 5 25 25 25 25 25 25 25 50 225 CT 25 25 25 25 25 25 25 0 175 Evaluation Scheme (Marks) Sessional Sub Total 50 50 50 50 50 50 50 50 400 ESE Total Credits (C)

100 100 100 100 100 100 100 0 700

150 150 150 150 150 150 150 50 1100

4 4 4 4 3 3 2 1 25

Elective III (MITNE 205)

MITNE 205 1 MITNE 205 2 MITNE 205 3 MITNE 205 4

Elective IV (MITNE 206)

MITNE 206 - 1 MITNE 206 - 2 MITNE 206 - 3 MITNE 206 - 4

Trends in Middleware Systems Modern Digital Communication Techniques Distributed Computing Advanced Topics in Graph Theory

Soft Computing Principles of Designing & Routing Networks Optical Networks Agent Based Computing

L Lecture, T Tutorial, P Practical TA CT ESE Teachers Assessment (Assignments, attendance, group discussion, Quiz, tutorials, seminars, etc.) Class Test (Minimum of two tests to be conducted by the Institute) End Semester Examination to be conducted by the University New Electives may be added by the department according to the needs of emerging fields of technology. The name of the elective and its syllabus should be submitted to the University before the course is offered.

Electives -

Hrs / Week Sl. No. Course No. Subject L T P TA* 1 2 CT 0 0 0 Evaluation Scheme (Marks) Sessional Sub Total 50 100 150 ESE** Total (Oral) 100 0 100 150 100 250 Credits (C)


Industrial Training and Mini project Masters Thesis Phase I


0 0 0

0 0 0

20 10 30

50 100*** 150

10 5 15

TA based on a Technical Report submitted together with presentation at the end of Industrial Training and Mini Project. Evaluation of Industrial Training and Mini Project will be conducted at end of the third semester by a panel of examiners, with at least one external examiner, constituted by the university.


*** The marks will be awarded by a panel of examiners constituted by the concerned institute.

Hrs / Week Sl. No. Course No. Subject L T P TA* 1 2 MITNE 401 MITNE 402 Masters Thesis Phase II Masters Comprehensive Viva Total Grand Total of all Semesters 0 0 30 100 CT 0 Evaluation Scheme (Marks) Sessional Credits ESE** (C) (Oral Total & Sub Total Viva) 100 100 100 200 100 300 2750 15 80 15

50% of the marks to be awarded by the Project Guide and the remaining 50% to be awarded by a panel of examiners, including the Project Guide, constituted by the Department. Thesis evaluation and Viva-voce will be conducted at the end of the fourth semester by a panel of examiners, with at least one external examiner, constituted by the University. Students may choose their mini project preferably in the same area as that of their project. Students are encouraged to publish their thesis work in National and International journals and conferences. This may have an additional weightage in the evaluation process. Any paper ready for publication, the students should discuss with the guide and take necessary action to publish the paper along with the guide in due course of the semester.

** Note:



L T P C 3 1 0 4

Module 1: Introduction to Number Theory Euclidean Algorithm, Fundamental Theorem of Arithmetic and Applications, Dirichlet Progressions, Irrational Numbers, Fermat Factorization, Linear Diophantine Equations, Perfect Numbers, Mersenne Numbers, Congruence, Linear Congruence, Chinese Remainder Theorem, Wilson's and Fermat's Little Theorem, Primality Testing and Carmichael Numbers, Euler's Theorem, Properties of the Euler Phi Function. Module 2: Coding Theory The Q-Ary Symmetric Channel, Maximum-Likelihood Decoding, Error Correction, Error Detection and Erasure Correction, Linear Codes, Representation Through Generator and Parity-Check Matrices, Syndrome Decoding, Hamming Codes, Introduction to Finite Fields and Double-Error-Correcting Codes, Irreducible Polynomials, Primitivity, Double-ErrorCorrecting Codes, Bounds on the Parameters of Codes, Singleton Bound, MDS Codes, Hamming Sphere-Packing Bound, Perfect Codes, Gilbert-Varshamov Bound, Asymptotic Bounds. Module 3: Counting Theory Basic Time and Space Classes, Polynomial-Time Hierarchy, Randomized Classes: RP, BPP, RL, and their Relation to PH, Counting Classes: #P, Non-Uniform Classes, Oracles, Relativization, Interactive Proof Systems, Pseudo-Random Generators, Or do we need Randomness, Some Circuit Lower Bounds, Monotone and AC0. Module 4: Graph Theory Graph Bases and Trees, Planar Graphs, Properties and Theorem, Planar Graphs, Colouring, Properties and Theorems, Matching Properties and Theorems. References: 1: Rosen K.H, Elementary Number Theory, 6th Ed, Addison-Wesley, 2010. 2. Roth R.M, Introduction to Coding Theory, CUP, 2006. 3. MacWilliams F.J, Sloane N.J.A., The Theory of Error Correcting Codes, North Holland, 1977. 4. Lin S, Costello D.J, Error Control Coding: Fundamentals and Applications, 2nd Ed, PHI, 2004.

5. Sipser M., Introduction to the Theory of Computation. 1 st ed. Florence, KY: Thomson/Brooks Cole, 1996. 6. Papadimitriou C. H. Computational Complexity. 1 st ed. Boston: Addison Wesley Publishing Company, 1994. 7. Handbook of Computer Science, Vol. A. Cambridge, MA: MIT Press, 1994. 8. Garey M. R., and Johnson D. S. Computers and Intractability: A Guide to the Theory of NP-Completeness, New York: W. H. Freeman, 1979. 9. Balcazar, Diaz J. L., J, and Gabarro. J, Structural Complexity I. Berlin, New York: Springer Verlag, 1988. ASIN: 0387186220. 10. Savage, John E., Models of Computation Boston: Pearson Education POD, 1997. 11. John Clark and DerekAllan Holton, A first look at Graph Theory, World Scientific, 1991.



L T P C 3 1 0 4

Module 1: Introduction Communication Concepts, Transmission Media, Analog Modulation: AM, PM, FM, Sampling Theorem, Analog Pulse Modulation, Digital Pulse Modulation (PCM), Basic Principles of Switching, Multiplexing, Multiple Access, Key Techniques - ASK, FSK, PSK, DPSK, Channel Capacity, Shannon`S Theorem. Introduction to Network Models - ISO, OSI, SNA, Appletalk and TCP/IP Models, Review of Physical Layer and Data Link Layers, Review of LAN (IEEE 802.3, 802.5, 802.11b/a/g, FDDI) and WAN (Frame Relay, ATM, ISDN) Standards. Module 2: Data Link Layer Introduction to Data Link Layer, Framing, Error Detection and Correcting Codes, Hamming Code, Block Codes and Convolution Codes, ARQ Techniques, Transmission Codes, Baudot, EBCDIC and ASCII Codes, Barcodes, Terminal Handling. ARQ Protocols: Stop & Wait Protocols, Sliding Window Protocols, Performance and Efficiency, Multi Access Protocols: ALOHA and CSMA. Module 3: Network Layer Design Issues, Routing Algorithms: Dijsktras, Bellman-Ford, Flooding and Broadcasting, Link State Routing, Network Layer Protocols: ARP, RARP, Internet Architecture and Addressing, Internetworking, IPv4, Overview of IPv6, ICMP, Routing Protocols: RIP, OSPF, BGP, IP over ATM, Unicast Routing Protocols, Multicast Routing Protocols. Module 4: Transport Layer Transport Layer: Design Issues, Connection Management, Transmission Control Protocol (TCP), User Datagram Protocol (UDP), Finite State Machine Model. Application Layer: DNS, SMTP, FTP, WWW, E-Mail, SNMP, RMON, MIME Case Studies: Study of Various Network Simulators, Network Performance Analysis Using NS2. References: 1. Kennedy, Electronic communication system - Mc Graw Hill, 1992. 2. Taub & Schilling, Principles of Communication System - Mc Graw Hill, 1996. 3. Behurouz & Forozan, Introduction to Data Communications & Networking, Mc Graw Hill, 1996.

4. Andrew S. Tanenbaum Computer Networks, 4th Edition, Pearson Education, 2008 5. William Stallings, Data and Computer Communication, 9th edition, Prentice hall, 2010. 6. William Shay, Understanding data Communication and Networks, 2 nd Edition, Thomson press, 1994. 7. Fred Halsall, Data Communication, Computer Networks & Open Systems, 4th Edition, Pearson Education Asia, 1996. 8. Behrouz A. Forouzan, TCP/IP Protocol Suit, TMH, 2000.



L T P C 3 1 0 4

Module 1: Introduction Network Flow Problems, Network Representations, Network Transformations, Complexity Analysis, Developing Polynomial Time Algorithms, Search Algorithms, Flow

Decomposition Algorithms. Module 2: Shortest Path Algorithms Shortest Paths: Label Setting Algorithms Dijstras Algorithm, Dials Implementation, Heap Implementation, Radix Heap Implementation. Shortest Paths : Label Correcting Algorithms Generic Label Correcting Algorithms, Special Implementations of the Modified Label Correcting Algorithm, Detecting Negative Cycles, All Pairs Shortest Path Problem, Minimum CosttoTime Ratio Cycle Problem. Module 3: Maximum and Minimum Flow Algorithms Maximum Flows: Generic Augmenting Path Algorithm, Labeling Algorithm and Max- Flow MinCut Theorem, Capacity Scaling Algorithm, Distance Labels and Layered Networks, Generic Pre Flow Push Algorithm, FIFO Pre Flow Push Algorithm, Flows in Unit Capacity Networks, Flows in Bipartite Networks, Flows in Planar Undirected Networks. Minimum Cost Flows: Optimality Conditions, Cycle Canceling Algorithm and the Integrity Property, Successive Shortest Path Algorithm, PrimalDual Algorithm, Outof Kilter Algorithm, Capacity Scaling Algorithm, Cost Scaling Algorithm, Minimum Mean Cycle Canceling Algorithm. Module 4: Trees And Forest Minimum Spanning Trees, Kruskals Algorithm, Prims Algorithm, Sollins Algorithm, Convex Cost Flows, Pseudo Polynomial Time Algorithm, Polynomial Time Algorithm Generalized Flows, Augmented Forest Structures, Determining Potentials and Flows for an Augmented Forest Structure, Generalized Network Simplex Algorithm. References: 1. Ravindra K. Ahuja, Thomas L. Magnanti, James B.Orlin, Network Flows Theory, Algorithms and Applications, 1st Edition, Prentice Hall, 1993. 2. Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali, Linear Programming and Network Flows, 4th Edition, John Wiley & Sons, 2009.

3. Gunther Ruhe, Kluwer, Publishers Group, 1991.

Algorithmic Aspects of Flows in Networks, Academic

4. Michael W. Lucas, Network Flow Analysis, No Starch Press, 2010. 5. Alexander Engau, Vdm Verlag Dr. Muller, Semi-Simultaneous Flows in Multiple Networks, Aktiengesellschaft & Co. Kg, 2008. 6. Wai-kai Che, Theory of Nets: Flows In Networks, John Wiley & Sons, 1990. 7. Ulrich Derigs, Programming in Networks and Graphs: On the Combinatorial

Background and Near-Equivalence of Network Flow and Matching Algorithms, 1st Edition, Springer, 1988. 8. Ford L. R. Jr., Robert G. Bland, Fulkerson D. R, Flows In Networks, Princeton University Press, 2010. 9. Alexander Hall, Scheduling And Flow-Related Problems In Networks, VDM Verlag Dr. Mueller E. K, 2007. 10. Pioro M, Routing, Flow and Capacity Design in Communication and Computer Networks, Elsevier India Private Limited, 2004.




L T P C 3 1 0 4

Module 1: Data Communication and Network Management Overview Analogy of Telephone Network Management, Data and Telecommunication Network, Distributed Computing Environment, TCP/IP Based Networks Internet and Intranet, Communication Protocols and Standards, Challenges of Information Technology Manager Network Management Goals, Organization and Functions, Network and System Management, Network Management System Platform, Current Status and Future of Network Management. Module 2: Network Management Standards and Models Basic Foundation: Standards, Models and Languages - Network Management Standards, Network Management Model, Organization Model, Information Model, Communication Model, ASN.1, Encoding Structure, Macros and Functional Model. Module 3: SNMP SNMP V1 Network Management: Organization and Information Models, Communication and Functional Models, Managed Network, International Organization and Standard SNMP Model, Organization Model, System Overview, Information Models. Module 4: SNMP & RMON Major Changes in SNMP V2 and V3 SNMP Management: RMON Remote Monitoring, SMI & MIB, RMON1, RMOPN2, ATM Remote Monitoring, Case Study of Internet Traffic Using RMON, Network Management Tools and Systems: Network Management Tools, Network Statistics Measurement Systems, Network Management Systems, Commercial Network Management Systems, System Management, Enterprise Management Solutions. References: 1. Mani Subramanian, Network Management principles and practice 1st Edition, Addison Wesley, 1999. 2. William Stalling, SNMP SNMPv2, SNMPv3 & RMON 1 and 2, 3rd Edition, Addison Wesley, 1999. 3. Steve Wisniewski, Network Administration, Prentice Hall, 2000.


MITNE 105-1


L T P C 3 0 0 3

Module 1: Introduction to Coding Theory Construction of Galois Field GF (2m) And its Basic Properties, Computation using Galois Field GF (2 m) Arithmetic, Vector Spaces and Matrices, Generator and Parity Check Matrices, Encoding Circuits, Syndrome and Error Detection, Minimum Distance Considerations, Error Detecting and Error Correcting Capabilities, Standard Array and Syndrome Decoding, Decoding Circuits, Hamming Codes, Reed Muller Codes, The (24, 12) Golay Code, Product Codes and Interleaved Codes. Module 2: Cyclic Codes Introduction, Generator and Parity Check Polynomials, Encoding using Multiplication Circuits, Systematic Cyclic Codes, Encoding Using Feed Back Shift Register Circuits, Generator Matrix for Cyclic Codes, Syndrome Computation and Error Detection, Meggitt Decoder, Error Trapping Decoding, Cyclic Hamming codes, The (23, 12) Golay Code, Shortened Cyclic Codes. Module 3: BCH Codes Binary Primitive BCH Codes, Decoding Procedures, Implementation of Galois field Arithmetic, Implementation of Error Correction, Non binary BCH Codes: q ary Linear Block Codes, Primitive BCH Codes over GF (q), Reed Solomon Codes, Decoding of Non Binary BCH and RS Codes: The Berlekamp - Massey Algorithm. Module 4: Concatenated Coding and Error Corrections Encoding of Convolution Codes, Structural Properties, Distance Properties, Viterbi Decoding Algorithm for Decoding, Soft Output Viterbi Algorithm, Stack and Fano Sequential Decoding Algorithms, Majority Logic Decoding, Concatenated Codes & Turbo Codes, Single Level Concatenated Codes, Multilevel Concatenated Codes, Soft Decision Multistage Decoding, Concatenated Coding Schemes with Convolution Inner Codes, Introduction to Turbo Coding and their Distance Properties, Design of Turbo Codes, Burst Error Correcting Codes, Burst and Random Error Correcting Codes, Concept of Inter Leaving, Cyclic Codes for Burst Error Correction Fire Codes, Convolution Codes for Burst Error Correction.


References: 1. Shu Lin & Daniel J. Costello, Jr. Error Control Coding Pearson / Prentice Hall, Second Edition, 2004. (Major Reference). 2. Blahut, R.E. Theory and Practice of Error Control Codes Addison Wesley, 1984. 3. Mac Williams F.J and Slone N.J.A, The theory of error correcting codes North Holland, 1977. 4. Peterson, W.W. & Weldon, E.J. Error-Correcting Codes MIT Press, Cambridge. Massachusetts, 1972. 5. Das, Mullick J. S.K. & Chaterjee.P.K, Principles of Digital Communications Wiley Eastern Ltd, New Delhi, 1986.


MITNE 105-2


L T P C 3 0 0 3

Module 1: Introduction to WWW and Web Protocols World Wide Web, URI, URL, Fragment Identifiers and Relative URIs, HTML, Web Protocols, HTTP, FTP, SMTP, POP3, MIME, IMAP, SOAP, Concept and Importance of Document Object Model, Dynamic HTML. Module 2: XML Introduction to XML, DTDs, Schema, Transformation, XSL, XSLT, Security, XML Namespaces, Efficient XML Interchange (EXI), Three Tier Web Based Architecture. Module 3: Network Security Ajax, Jquery, RSS, Web APIs, Network Security Concepts, Cyber Law, Firewall, Cookies, Hackers and Crackers, Introduction to Open Source based software, MVC Architecture in Web. Module 4: PHP & MySQL PHP Fundamentals, PHP as an OOL, Session Handling, Managing MySQL, Access Control, MySQL Server security, Implementing Stored Procedures and Triggers with MySQL, MySQL Query Optimizer, Accessing Databases using PHP. References: 1. Danny Goodman, Dynamic HTML; The Definitive Reference, 3 rd Edition, OREILLY, 2007. 2. Chuck Musciano, Bill Kennedy, HTML & XHTML;The Definitive Guide, Edition, OREILLY, 2006. 3. By Bragg, Mark Phodes-Ousley, Keith Strassberg, Network Security; The Complete Reference, 1 st Edition, Mc-Graw Hill Osborne Media, 2003. 4. W. Jason Gilmore, Beginning PHP and MySQL, 4 th Edition, Apress, 2010. 6th


MITNE 105-3


L T P C 3 0 0 3

Module 1: Introduction to Information Technology Information Technologies: Concept and Management, IT Support Organizational Structure, Organizing IT, IT Infrastructure, Budgeting for IT. Module 2: Organization of Enterprise System Transaction Processing, Functional Applications and Integration, Enterprise Systems, InterOrganizational and Global IS, Technologies for Developing Systems. Module 3: Project and Quality Management in IT Business Intelligence and Performance Management, Project management in IT, Managerial Decision Making, Quality in IT, Quality management. Module 4: Applications of IT Using IT for Strategic Advantage, Information Technology Economics, Acquiring IT Applications, Global IT Issues, Security, Information Architecture. References: 1. Applegate, Austin, and McFarlan,Corporate Information Strategy and Management (2007), 7th Edition, McGraw-Hill.Choo, C.W. (1995). 2. McNurlin, B.C and Sprague, R.H Information Systems Management in Practice, 7thEdition, PHI, 2006. 3. Metuchen, NJ Elements of Information Management: Scarecrow Press. (Ch. 2, 3). [R] Horton, F.W. , 1985. 4. James A OBrien/ George M Marakas, Introduction to Information Systems, 13th edition, McGraw-Hill, 2007. 5. Kerr, James M. The IRM Imperative, New York: John Wiley & Sons, 1991.


MITNE 105-4


L T P C 3 0 0 3

Module 1: Introduction to Mobile Computing & Medium Access Control Mobile Computing: Introduction, Applications, Limitations and Architecture, Wireless Transmission Frequencies for radio Transmission, Signals, Antennas, Signal Propagation, Cellular Systems, Medium Access Control: Motivation for a Specialized MAC, SDMA, FDMA, TDMA, CDMA, GSM: System Architecture, Protocols, Handover, Security, GPRS and their Architecture. Module 2: - Network & Transport Layer Mobile IP Network Layer: Mobile IP (Goals, Assumptions, Entities and Terminology, IP Packet Delivery, Agent Advertisement and Discovery, Registration, Tunneling and Encapsulation, Optimizations), Dynamic Host Configuration Protocol (DHCP). Mobile Transport Layer: Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP, Fast Retransmit / Fast Recovery, Transmission / Time-out Freezing, Selective Retransmission, Transaction Oriented TCP. Module 3: Wireless Local Loop (WLL) Introduction, WLL Architecture, Wireless Local Loop Technologies, Third Generation (3G) Mobile Services: Introduction to International Mobile Telecommunications 2000 (IMT 2000) vision, Wideband Code Division Multiple Access (W-CDMA), and CDMA 2000, Quality of services in 3G, Introduction to 4G. Module 4: WAP & Bluetooth Protocols and Tools: Wireless Application Protocol-WAP (Introduction, Protocol Architecture, Treatment of Protocols of all Layers), Bluetooth (User Scenarios, Physical Layer, MAC Layer, Networking, Security, Link Management). References: 1. Kaveh Pahlavan, Prasanth Krishnamoorthy, Principles of Wireless Networks, PHI/Pearson Education, 2003. 2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, Principles of Mobile Computing, Springer, New York, 2003. 3. Hazysztof Wesolowshi, Mobile Communication Systems, John Wiley and Sons Ltd, 2002.


MITNE 106 - 1


L T P C 3 0 0 3

Module 1: Introduction to Satellite Communications Introduction and Orbital Aspects of Satellite Communications: History of satellite communications, Types of Orbits, Keplers Laws of Planetary Motion, Orbital Parameters, Satellite Trajectory, Period, Velocity and Position of a Satellite, Geostationary Satellites, Non-Geostationary Constellations, Launching of Geostationary Satellites. Module 2: Communication Satellites Communication Satellites: Spacecraft subsystems, Payload, Repeater, Spacecraft Antennas, Attitude and Orbit Control Systems, Telemetry, Tracking and Command, Power Subsystems and Thermal Control, Communication Subsystems. Earth Stations: Antenna and Feed Systems, Satellite Tracking System, Earth Station Design, Satellite Broadcasting, Satellite TV System. Module 3: Design of Satellite Link Communication Link Design: Basic Transmission Theory, Frequency Bands Used, System Noise Temperature, Carrier-to-Noise Ration, Design of Uplink and Downlink Models, Design Satellite Links for specified C/N ratio, Very Small Aperture Terminals (VSAT), VSAT design issues. Module 4: Multiple Access Techniques Coding and Multiple Access Techniques: Digital modulation schemes, Forward Error Correction (FEC) and Automatic Repeat Request (ARQ), Frequency Division Multiple Access (FDMA), Time Division Multiple Access (TDMA), Code Division Multiple Access (CDMA). References: 1. Richharia M., Satellite Communication Systems, McGraw-Hill, 1999. 2. Ha T.T., Digital Satellite Communication, Macmillan Publishing Company, 2005. 3. Robert M. Gagliardi, Satellite Communication, CBS Publisher, 1991. 4. Pratt T. and Bostain W, Satellite Communications, John Wiley & Sons, 1986. 5. Agarwal D C, Satellite Communications, Khanna Publishers, 1996.


MITNE 106 - 2 AUTONOMIC & CONTEXT AWARE COMPUTING L T P C 3 Module 1: Introduction to Autonomic Computing Overview of Autonomic Computing: Origins, Evolution, Direction, Human Autonomic Nervous System, Creating the Autonomic Culture, Why is a Culture Important, Autonomic Computing Architecture, Life Cycle of an Autonomic Element, Relationships among Autonomic Elements, Self-* Properties in Decentralized Autonomic Computing, Exploiting Emergence in Autonomic Systems, Dynamic Collaboration in Autonomic Computing. Module 2: Algorithms for Autonomic Computing Machine Learning in Autonomic Computing Systems, Algorithms and Optimization Methods for Autonomic Computing, Autonomic Networking and Communications, Dynamic Server Allocation for Autonomic Service Centers, Autonomic Data Streaming for High-Performance Scientific Applications, Self-Management of Wireless Networks, Standards for Autonomic Computing, Autonomic Research Challenges - Scientific Challenges, Research Projects in Autonomic Computing. Module 3: Context Aware Computing Introduction to Context Aware Computing, Context, Context Awareness and Situation, Context and Self-Management, Structure and Elements of Context-Aware Pervasive Systems Sensing, Thinking, Acting, an Abstract Architecture, Infrastructures, Middleware and Toolkits, Issues of Security, Privacy and Efficiency. Module 4: Trends in Context Aware Computing Context-Aware Mobile Services Context of Mobile Device Users, Location-Based Services, Ambient Services, Proximity Based Revere Auctions, Context-Aware Artifacts, Context-Aware Mobile Software Agents, Context-Aware Addressing and Communication, Context-Aware Sensor Networks, Context-Aware Security. References: 1. Manish Parashar, Salim Hariri, Autonomic Computing: Concepts, Infrastructure, and Applications, CRC Press, Taylor and Francis, 2006. 2. Richard Murch, Autonomic Computing, IBM Press, Prentice Hall, 2004. 3. A Practical Guide to the IBM Autonomic Computing Toolkit, IBM Press, 2004. 0 0 3


4. Nancy Forbes, Imitation of Life - How Biology is inspiring computing, MIT Press, 2004. 5. Joseph L. Hellerstein, Yixin Diao, Sujay Parekh, Dawn M. Tilbury, Feedback Control of Computing Systems, John Wiley & Sons, Inc., ISBN: 9780471266372, 2004. 6. Seng Loke, Context-Aware Pervasive Systems: Architectures for a New Breed of Applications, Taylor and Francis, 2007. 7. Waltnegus Dargie, Context-Aware Computing and Self-managing Systems, CRC Press, Taylor and Francis, 2009.


MITNE 106 - 3


L T P C 3 0 0 3

Module 1: Introduction to Communication Security Threats and Solutions, Technical Threats to Communication Security, Authentication, Confidentiality, Integrity, Biometric Access Tools, Foot Printing, Internet Foot Printing, Port Scanning. Module 2: Windows Security Windows Security Features, Windows Firewalls, Remote Connectivity and VoIP Hacking, PBX Hacking, Voice Mail Hacking. Module 3: VPN Introduction to VPN, Types of VPN: Access VPN, Intranet VPN, Extranet VPN, VPN Protocols, Layer 2 Tunneling Protocol, Internet Protocol Security, Internet Key Exchange (IKE) Protocol, VPN Hacking, Voice over IP Attack. Module 4: VPN & Firewalls Secure VPN Technologies, Trusted VPN Technologies, VPN/Firewall Architecture, VPN/Firewall Security Policy, Advanced Security Policy and System Management Hybrid VPN Technologies, Site-to-Site VPN Design, Remote Access VPN Design. References: 1. Ruixi Yuan and Timothy Strayer W., Virtual Private Networks: Technologies and Solutions, Addison-Wesly, 2001. 2. Thaddeus Fortenberry, Windows 2000 Virtual Private Networking, Macmillan Technical Pub, 2007. 3. Roger J. Sutton, Secure Communications: Applications and Management, WILEY, 2002. 4. Don J. Torrieri, Principles of secure communication systems, 2nd Eedition, Artech House Publishers, 1992. 5. Stuart McClure, Joel Scambray, George Kurtz, Hacking exposed 6: network security secrets & solutions, McGraw-Hill, 6th Edition, 2009. 6. William R. Cheswick, Steven M. Bellovin, Aviel D. Rubin, Firewalls and Internet security: repelling the wily hacker, 2nd Edition, Addison-Wesley Professional, 2003. 7. Stallings W, Data and Computer Communications, 9th Edition, Pearson Education India, 2010. 20

MITNE 106 4


L T P C 3 0 0 3

Module 1: Network Management Case Histories and Examples, Organization and Information Models, SNMP Model, SNMP Management: RMON-RMON SMI and MIB, RMON1, RMON2, ATM Remote Monitoring, a Case Study of Internet Traffic Using RMON. SNMPv1 Network Management: SNMP Communication Model, Functional model. Module 2: SNMP V2 SNMPv2 Management: Major Changes in SNMPv2, SNMPv2 System Architecture, SNMPv2 Structure of Management Information, SNMPv2 Management Information Base, SNMPv2 Protocol, Compatibility with SNMPv1. Module 3: TMN Telecommunications Management Network, Operations Systems, TMN Conceptual Model, TMN Standards, TMN Architecture, TMN Management Service Architecture, An Integrated View of TMN. Module 4: Web Based Management NMS with Web Interface and Web-Based Management, Web Interface to SNMP Management, Embedded Web-Based Management, Desktop Management Interface, WebBased Enterprise Management, WBEM: Windows Management Instrumentation, Java Management Extensions, Management of a Storage Area Network, Future Directions. References: 1. Mani Subrahmanian, Network Management, Principles and Practice, Pearson Education, 1999. 2. Morris, Network management, Pearson Education, 2003. 3. Mark Burges, , Principles of Network System Administration, 2 nd Edition, Wiley Dreamtech, 2004. 4. Gilbert Held, Network Management: Techniques, Tools & Systems, John Wiley, 1992.




L T P C 0 0 3 2

Lab Experiments are based on the courses MITNE 103, MITNE 104 and elective courses. At least 10 Programs must be covered in the Lab that must include, but not restricted to, the following areas. Tools/Language used: Socket programming using C, Wireshark, Internet programming using Java Elementary socket programming in C Low level networking, Ethernet, ARP The network layer, IP, DHCP, NAT The network layer, routing, IPv6 Transport layer protocols, TCP, UDP Advanced socket programming, non-blocking sockets Server design (forking, threads, preforking), daemons XML, DTDs, Schemas XML Parsing, XSLT Client side scripting, Javascript AJAX Web server technologies, Tomcat, servlets, JSP Web server technologies, RPCs, Java RMI, XML-RPC, CORBA Web services, SOAP, WSDL, UDDI The Semantic Web, RDF, OWL Cryptography, authentication, digital signatures Network security, Kerberos, IPSec, SSL




L T P C 0 0 2 1

Each student shall present a seminar on any topic of interest related to the core / elective courses offered in the first semester of the M. Tech. Programme. He / she shall select the topic based on the references from international journals of repute, preferably IEEE journals. They should get the paper approved by the Programme Co-ordinator / Faculty member in charge of the seminar and shall present it in the class. Every student shall participate in the seminar. The students should undertake a detailed study on the topic and submit a report at the end of the semester. Marks will be awarded based on the topic, presentation, participation in the seminar and the report submitted.




L T P C 3 1 0 4

Module 1: Introduction to WWW, HTML & XML History and Evolution of Internet, WWW, Client Server Model, Internetworking, HTTP, Internet and Intranet, Internet Address, Address Space, Internet Protocols, DNS, FTP, SMTP, Telnet, Internet Tools. HTML Tags, Links, Lists, Frames, Forms, Special Tags, Cascading Style Sheets, Java Script Variables & Data Types, Statements, Operators & Message Boxes, Linking HTML Forms with Java Script, Overview of XML and SGML, XML Development Goal, Structure of XML Document, XML Parser, XML Entities. Module 2: Servlet & JSP Introduction to Servlet, Servlet Life Cycle, HTTP Servlet Class, Request Interface, Response Interface, Handling Servlet, JDBC Drivers, APIs and Techniques. Overview of JSP, Scripting Elements, JSP Expressions, Scriplets, Declarations, Predefined Variables, Structuring Generated Servlet in JSP Pages, Including Files and Applets in JSP Documents. Module 3: EJB Introduction to EJB, Java Beans, Types of Beans, Session Beans, Context and Naming Convention, Creating Beans for Web Application, Deploying Beans. Module 4: Web Security Web Security Concepts, HTTP Authentication, Application Types, Security Implementation, Retrieving Authentication Information, Security in Servlet, Form Based Custom Authorization, Retrieving SSL Authentication. References: 1. Deitel & Nieto Internet and World Wide Web How to program, 4th Edition, Pearson Education Asia, 2007. 2. Evan Bayross, HTML, DHTML, Java Script, Perl, CGI, BPB. 3. Sean McGrath XML by Example: Building E-commerce applications, Pearson Education Asia, 1998.


4. Hans Bergsten, Java Server pages, 3rd Edition, OReilly media, 2003. 5. Barry Burd JSP: Java server pages, IDG Books India, 2001. 6. Ed Roman Mastering Enterprise Java Beans and the Java 2 Platforms, 3rd Edition, Enterprise Edition, 2004.




L T P C 3 1 0 4

Module 1: Introduction to Cryptography and Network Security Concepts Security Trends, OSI Security Architecture, Classical Encryption Techniques, Cipher Principles, Block Cipher Design Principles and Modes of Operation, Evaluation criteria for AES, AES Cipher, Placement of Encryption Function, Traffic Confidentiality. Module 2: Encryption Algorithms and Case Studies Introduction to Number Theory, Confidentiality using Symmetric Encryption, Public Key Cryptography and RSA, Data Encryption Standard, Triple DES, Key Management, DiffieHellman Key Exchange, Elliptic Curve Architecture and Cryptography. Practical implementations of Cryptography/Security: Cryptographic Solutions using Java, Cryptographic Solutions using Microsoft, Cryptographic Toolkits, Security and Operating Systems. Module 3: Authentication functions-MAC & HASH Authentication Requirements, Authentication Functions, Message Authentication Codes, Hash Functions, Security of Hash Functions and MACs, MD5 message Digest Algorithm, Secure Hash Algorithm, RIPEMD, HMAC Digital Signatures, Authentication Protocols, Digital Signature Standard. Module 4: Internet Security Protocols and System Level Security Authentication Applications: Kerberos, X.509 Authentication Service, PGP, S/MIME, IP Security, Web Security. Internet Security Protocols: SSL, SHTTP, TSP, SET, SSL versus SET, 3D Secure Protocol, Electronic Money, Email Security, WAP Security, Security in GSM. System Level Security: Intrusion Detection, Password Management, Viruses and Related Threats, Virus Counter Measures, Firewall Design Principles, Trusted Systems. References: 1. William Stallings, Cryptography and Network Security Principles and Practices, Prentice Hall of India, Third Edition, 2003. 2. 3. Atul Kahate, Cryptography and Network Security, Tata McGraw-Hill, 2003. Bruce Schneier, Applied Cryptography, John Wiley & Sons Inc, 2001.



Charles B. Pfleeger, Shari Lawrence Pfleeger, Security in Computing, Third Edition, Pearson Education, 2003.

5. Eric Maiwald, Fundamentals of Network Security, TATA McGraw-Hill Publishing Co 2003.




L T P C 3 1 0 4

Module 1: Overview of Wireless Networks Basics of Wireless Networks and Mobile Computing, Overview of Wireless LAN, WAN, MAN, Wireless Internet, IEEE 802.11, IEEE 802.16. Mobility Aspects in Wireless Networks, Routing in Wireless Networks, Wireless Local Loop (WLL), Introduction to WLL Architecture, Wireless Local Loop Technologies. Module 2: Mobile Networks Introduction to Mobile Networks, Heterogeneity in Mobile Devices, Types of Mobile Communications, Types of Mobile Host Movements, Challenges Facing Mobile Networks, MAC Protocols, Location Discovery in Mobile Networks. Module 3: Ad-hoc Networks Introduction to Ad-hoc Wireless Networks, Overview, Characteristics, Issues in Designing a Routing Protocol for Ad Hoc Wireless Networks, Classifications of Routing Protocols, DSDV, WRP, AODV, DSR, TORA. Module 4: Sensor Networks Introduction to Wireless Sensor Networks, Overview, Characteristics, Network

Applications, Design Objectives, Technological Background, Wireless Sensor Networks Architecture, Classification, Protocol stack, MAC Protocols, Routing Overview. References: 1. Imielinski T. and Korth H.F., Mobile Computing, Kluwer Academic Publishers, 1996. 2. William Stallings, Wireless Communications and Networks, Prentice Hall, 2004. 3. Siva Ram Murthy C. and Manoj B. S., Ad Hoc Wireless Networks: Architectures and Protocols, 2nd Edn. Pearson Education 2005. 4. Carlos de Morais Cordeiro and Dharma Prakash Agrawal, Ad Hoc & Sensor Networks: Theory and Applications, World Scientific, 2007. 5. Toh C. K., Ad Hoc Mobile Wireless Networks Protocols and Systems, Prentice Hall, PTR, 2001. 6. Yi-Bing and Imrich Chlamtac, Wireless and Mobile Networks Architectures, John Wiley & Sons, 2001.




L T P C 3 1 0 4

Module 1: Introduction to Distributed Computing System Introduction to Model of Synchronous Distributed Computing System, Leader Election in a General Network, Simple Flooding Algorithm, Basic Breadth-First Search Algorithm, Bellman-Ford algorithm. Module 2: Algorithms in Distributed Computing System Algorithms in Synchronous Networks, Minimum Spanning Tree, Leader Election in a Synchronous Ring, LCR algorithm, HS algorithm, Time Slice Algorithm, Variable Speeds Algorithm, Lower Bound for Comparison-Based Algorithms, Maximal Independent Set, Luby MIS Algorithm, Distributed Consensus with Link Failures and Process Failures Basics. Module 3: Asynchronous Distributed Computing System Introduction to Model of Asynchronous Distributed Computing System, Send/Receive Systems, Broadcast Systems, Multicast Systems, Basic Algorithms, Peterson LeaderElection Algorithm, Local Synchronizer, Safe Synchronizer. Module 4: Resource Allocation Algorithms Asynchronous System Model, Shared Memory Systems, Environment Model, Shared Variable Types, Mutual Exclusion, Asynchronous Shared Memory Model, Dijkstra's Mutual Exclusion Algorithm, Resource Allocation, Nonexistence of Symmetric Dining Philosophers Algorithms, Right-Left Dining Philosophers Algorithm, Mutual Exclusion and Consensus, Relationship between Shared Memory and Network Models, Asynchronous Networks with Failures. References: 1. Nancy A. Lynch, Morgan, Distributed Algorithms, Kaufmann Publishers, Inc, 1996. 2. Wolfgang Reisig, W. Reisig, Elements Of Distributed Algorithms: Modeling And Analysis With Petri Nets, Springer-verlag, 2010. 3. Tel Gerard , Introduction To Distributed Algorithms, 2nd Edition, University Press, 2000. Cambridge


4. Sukumar Ghosh, Distributed Systems: An Algorithmic Approach (Hardcover), Chapman & Hall/crc, 2006. 5. Valmir C. Barbosa, An Introduction to Distributed Algorithms, The MIT Press, 1996. 6. Randy Chow, Theodore Johnson, Distributed Operating Systems and Algorithm Analysis, Pearson Education, 1997. 7. Santoro N., Nicola Santoro, Design and Analysis of Distributed Algorithms, WileyInterscience, 2006. 8. Fionnuala O'donnell, , A Simulation Framework for the Teaching and Learning of Distributed Algorithms, VDM Verlag Dr. Muller, 2009. 9. Ajay D. Kshemkalyani, Mukesh Singhal, Distributed Computing - Principles, Algorithms, And Systems, Cambridge University Press, 2007.


MITNE 205 - 1


L T P C 3 0 0 3

Module 1: Introduction to Middleware Systems Publish / Subscribe Matching Algorithm, Event Based Systems, Notification Filtering Mechanisms, Composite Event Processing, Content Based Routing, Content Based Models and Matching, Matching Algorithms, Distributed Hash Tables (DHT). Module 2: Routing & Scoping Distributed Notification Routing, Content Based Routing Algorithms, Engineering Event Based Systems, Accessing Publish / Subscribe Functionality using APIs. Scoping, Event Based Systems with Scopes, Notification Mappings, Transmission Policies, Implementation Strategies for Scoping. Module 3: Event Detection & Notification Standards Composite Event Detection, Detection Architectures, Security, Fault Tolerance, Congestion Control, Mobility, Existing Notification Standards - JMS, DDS, HLA. Module 4: Case Studies Topic Based Systems, Overlays, P2P Systems, Overlay Routing, Case Studies- REBECA, HERMES, Gryphon, Commercial Systems- IBM Websphere MQ, TIBCO Rendezvous. References: 1. Gero Muhl, Ludger Fiege, Peter R. Pietzuch, Distributed Event-Based Systems Springer, 2006. 2. Chris Britton, Peter Bye IT Architectures and Middleware, Pearson Education second Edition, 2005. 3. Yanlei Diao, and Michael J. Franklin, Query Processing for High-Volume XML Message Brokering, VLDB 2003. 4. Chee-Yong Chan, Minos Garofalakis, Rajeev Rastogi, RE-Tree: An Efficient Index Structure for Regular Expressions, VLDB 2002. 5. Peter R. Pietzuch, Brian Shand, Jean Bacon, A Framework for Event Composition in Distributed Systems, Proc. of the 4th Int. Conf. on Middleware (MW'03). 6. Carzaniga A. and Wolf A.L., Forwarding in a Content-Based Network, Proceedings of ACM SIGCOMM 2003. p. 163-174. Karlsruhe, Germany. August, 2003.


MITNE 205 - 2


L T P C 3 0 0 3

Module 1: Introduction to Digital Communication Elements of Digital Communication Systems, Communication Channels and their Characteristic, Historical Perspective in the Development of Digital Communication, Review of the Features of a Decreases Memo Less Channel, Channel Capacity Theorem. Module 2: Digital Transmission Systems Telephone Modem Standards: Properties of Media and Digital Transmission Systems, Error Detection and Correction, Two Dimensional Parity Checks, Internet Checksum, Polynomial Codes, Standardized Polynomial Codes, Error Detecting Capability of a Polynomial Code. Module 3: PCM and its applications PCM, Noise and Error Probability of PCM, VDR of PCM, DPCM, DM, ADM, CVSD, Log PCM, Performance Comparisons, Applications. Module 4: PAM & Base Band Binary Transmission Digital PAM, Binary PAM Formats, Line Coding, Band Limited Digital PAM Systems, Discrete PAM Signals, Inter-Symbol Interference (ISI) Nyquist Criterion for Distortion-less Base Band Binary Transmission, Correlative Coding, Early Pattern, Adoptive Equalization, Zero Forcing Algorithms, LMA Algorithm. References: 1. Alberto Leon, Garcia and Indra Widjaj, Communication Networks - Fundamental Concepts and Key architectures, 2nd edition Tata McGraw-Hill, 2003. 2. Simon Haykin, Digital Communication, 1st Edition, John Wiley and Sons, 1988. 3. John G Proakis, Digital Communications, 5th Edition, McGraw Hill, 2008. 4. Leon W Couch, Analog a& Digital Communication, 7 th Edition, PHI, 2006. 5. Lathi B.P, Modern Digital and Analog Communication Systems, Oxford publishers, 1998.


MITNE 205 - 3


L T P C 3 0 0 3

Module 1: Overview of Distributed Computing Introduction to Distributed Systems, Evolution, Characteristics, Design Issues, User Requirements, Examples of Distributed Systems, Network Technologies and Protocols overview, MACH & AMOEBA -overview. Module 2: Client Server Communication Client Server Communication, Group Communication, Message Passing, Features, Synchronizations, RPC- model, Implementation, Stub Generation, Messages, Marshalling, Server Management, Distributed Shared Memory Architecture, Design Issues, Structure of Shared Memory Space, Replacement Strategy, Thrashing, Synchronization, Event Ordering and Mutual Exclusion. Module 3: Scheduling Algorithms & Security Management Features of Scheduling Algorithms, Task Assignment Approach, Load Balancing, Load Sharing, Process Migration Mechanisms, Threads Scheduling, Introduction to Security, Secure Channels, Access Control, Security Management. Module 4: Transaction Recovery & Deadlocks Transaction Recovery, Its Methods, Intention Lists, Fault Tolerance, Failures, Byzantine Failures, Deadlocks in Distributed Systems, Detection and Prevention, Process Resilience, Distributed Commit, Recovery. References: 1. George Coulouris, Jean Dellimore Tim Kindberg, Distributed Systems Concepts and Design, 5th Edition, Addison Wesley, 2011. 2. Andrew S. Tenenbaum, Distributed Operating Systems, Pearson Education Asia, 1994. 3. Pradeep. K.Sinha, Distributed Operating Systems- Concepts and Design, PHI, 1996.


MITNE 205 - 4


L T P C 3 0 0 3

Module 1: Planar Graphs Plane and Planar Graphs, Different Representations of a Planar Graph, Eulers Formula, Kuratowskis Theorem, Dual of Planar Graph- Geometric Dual and Combinatorial Dual. Module 2: Directed Graphs Directed Graphs, Types of Digraphs, Digraphs and Binary Relations, In Degree and Out Degree, Bruijn Sequence, Tournaments, Traffic Flow-The Hopcroft and Tarjan Algorithm. Module 3: Network Theory and Algorithms Network Theory, Flows and Cuts, The Max-Flow and Min-Cut Theorem, The Ford and Fulkerson Algorithm, Separating Sets, Mengers Theorem. Module 4: Coloring Algorithms Vertex Colouring, Coloring Algorithms- The Simple Sequential Colouring Algorithm, The Largest-First Sequential Algorithm, The Smallest-Last Sequential Algorithm, Critical Graphs, Edge Colouring. References: 1. John Clark & Derek Allan Holton, A first look at Graph Theory, World Scientific Publishing Company, 1991. 2. Gary, Chartrand, Ping, Zhang, Chromatic graph theory, CRC Press, 2008. 3. John Adrian Bondy, Elsevier, 1976. 4. Narshing Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice-Hall of India, 2004. Murty U S R, Graph theory with Applications, American


MITNE 206 - 1


L T P C 3 0 0 3

Module 1: Introduction to Fuzzy Logic & Soft Computing Introduction to Fuzzy Logic, Fuzzy Sets, Fuzzy Rules and Fuzzy Reasoning, Fuzzy Inference Systems, Application of Fuzzy Logic Concepts in Engineering Problems, Introduction to Soft Computing, Soft Computing Tools, Soft Computing Constituents and Conventional AI. Module 2: Regression & Optimization Regression and Optimization, Least Square Estimator, Recursive Least Square Estimator, Derivative Based Optimization- Newtons Method, Step Size Determination, Conjugate Gradient Methods, Non Linear Least Square Problems, Derivative Free Optimization, Genetic Algorithms, Simulated Annealing. Module 3: Fundamentals of Fuzzy Clustering Fuzzy Query Fundamentals, Measuring Query Compatibility, Fuzzy SQL Process Flow, Fuzzy Clustering, Vocabulary-Principles of Cluster Detection, Crisp Clustering Techniques, Fuzzy C-Means Clustering, Fuzzy Adaptive Clustering. Module 4: Neural Networks Neural Networks and Probabilistic Reasoning, Adaptive Networks Architecture, Back Propagation of Adaptive Networks, Extended Back Propagation for Recurrent Networks, Supervised Learning Neural Networks, Perceptrons, Adaline, Back Propagation of Multilayer Perceptrons, Learning from Reinforcement, Temporal Difference Learning, Adaptive Heuristic Critic, Q-Learning, Introduction to Neuro-Fuzzy, Adaptive Neuro-Fuzzy Inference Systems, Soft Computing for Color Recipe Prediction, CANFIS Modeling for Color Recipe Prediction. References: 1. Fortuna L., Rozzotto G., Lavorgna M., Soft Computing: New Trends and Applications, 1 st Edition, Springer, 2001. 2. Jang, Neuro- Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence, PHI, 1997.


3. Cox, Earl, Fuzzy Modeling and Genetic Algorithms for Data Mining and Exploration, 1st Edition, Morgan Kaufmann Publishers, 2005. 4. Ross, T.J. Fuzzy Logic with Engineering Applications, Wiley India, 2010. 5. Guanrong Chen, City University of Hong Kong, Kowloon, Introduction to Fuzzy Sets, Fuzzy Logic, and Fuzzy Control Systems, 1st Edition, CRC Press, 2000.


MITNE 206 - 2


L T P C 3 0 0 3

Module 1: Introduction to Network Traffic Analyzing Business Goals and Constraints, Analyzing Technical Goals and Tradeoffs, Characterizing Network Traffic, Identifying Major Traffic Sources and Stores,

Characterizing Types of Traffic Flow (Terminal/Host, Client/Server, Thin Client, Peer-ToPeer, Server/Server, Distributed Computing, Voice Over IP Network). Module 2: Network Security Introduction to Network Security, Network Security Goals, Asset Identification, Threat Assessment, Risk Assessment, Constructing Network Security Policy, Elements of Network Security Policy, Implementing Network Security Policy, Network Security Architecture, Defining Security Zones, Device Security, Device Redundancy, Router Security. Module 3: Network Topology Calculating Theoretical Traffic Load, Estimating Traffic Load Caused by Routing Protocols, Designing Network Topology- Hierarchical Network Topology, Redundant Network Design Topologies. Module 4: Design Issues in Network Layer Network Layer Design Issues, Selecting Routing Protocols, Selecting Technologies and Devices, Case Study: Campus Network Design. References: 1. Harry G Perros, Connection oriented Networks: SONET/SDH, ATM, MPLS and OPTICALS Networks,Wiley, 2005. 2. Robert S. Cahn, Wide Area Network Design: Concepts and Tools for Optimization, The Morgan Kaufmann Series in Networking, 1998.


MITNE 206 - 3


L T P C 3 0 0 3

Module 1: Telecommunication Networks Introduction, Telecommunication Network Architecture, Services, Introduction to Optical Networks, Optical Layer, Optical Packet Switching, Client Layers, SONET/SDH, Storage Area Networks, Gigabit Ethernet, Deployment Considerations, Evolving

Telecommunication Network, Designing the Transmission Layer Using SDM, TDM, WDM, Long Haul Network Metro Networks. Module 2: WDM WDM Network Elements, Optical Line Terminals, Optical Line Amplifiers, Optical Add/Drop Multiplexers, Optical Cross Connects, WDM Network Design, Cost Trade offs, LTD and RWA Problems, Dimensioning Wavelength, Statistical Dimensioning Models, Maximum Load Dimensioning Models. Module 3: OCMP Management Control and Management, Network Management Function, Optical Layer Services, Layers With in Optical Layer, Performance and Fault Management, Configuration Management, Optical Safety, Network Suitability Basic Concepts, Protection in SONET / SDH IP Networks, Optical Layer Protection Schemes, Inter Working Layers. Module 4: Network Architecture Access Networks, Network Architecture Overview, Enhanced HFC, Fiber to The Curb (FTTC), Photonic Packet Switch, Optical TDM, Synchronization, Header Processing, Buffering, Burst Switching, Test Beds. References: 1. Rajiv Ramaswami, Kumar N Sivarajan, Optical Networks A Practical Perspective, Morgan Kaufmann Publishers, 2004. ISBN 1-55860-445-6. 2. Agrawal G.P., Fiber optic communication systems, Third Edition, John Wiley & Sons, New York, 2004. ISBN: 7302087490, 9787302087496. 3. Franz H. & Jain V.K., Optical Communication Systems, Narosa Publications, New Delhi, 1996, ISBN: 8173190615, 9788173190612.


MITNE 206 - 4


L T P C 3 0 0 3

Module 1: Concepts of Agent Based Computing Introduction, Definition, Foundations, History, Intelligent Agents, Problem Solving, Searching, Heuristics, Constraint Satisfaction Problems, Game playing. Module 2: Knowledge Representation Techniques Knowledge Representation and Reasoning: Logical Agents, First Order Logic, First Order Inference, Unification, Chaining, Resolution, Strategies, Knowledge Representation Objects, Actions, Events. Module 3: Planning Agents Planning Problem, State Space Search, Partial Order Planning, Graphs, Nondeterministic Domains, Conditional Planning, Continuous Planning, Multi Agent Planning. Module 4: Uncertainty Modeling Acting under uncertainty, Probability Notation, Bayes Rule and use, Bayesian Networks, Other Approaches, Time and Uncertainty, Temporal Models, Utility Theory, Decision Network, Complex Decisions. Higher Level Agents: Knowledge in Learning, Relevance Information, Statistical Learning Methods, Reinforcement Learning, Communication, Formal Grammar, Augmented Grammars, Future of AI. References: 1. Stuart Russell and Peter Norvig, Artificial Intelligence - A Modern Approach, 2nd Edition, Prentice Hall, 2002. 2. 3.

Michael Wooldridge, An Introduction to Multi Agent System, John Wiley, 2002. Patrick Henry Winston, Artificial Intelligence, III Edition, AW, 1999. Nils.J.Nilsson, Principles of Artificial Intelligence, Narosa Publishing House, 1992




L T P C 0 0 3 2

Lab Experiments based on the course MITNE 203 and implementation of basic protocols of computer network.
Experiment list:

A thorough study of packet capturing tool called WireShark. Familiarizing Network Simulator 2 (NS2) with suitable examples Simulate a wired network consisting of TCP and UDP Traffic using NS2 and then calculate their respective throughput using AWK script.

Performance evaluation of different routing protocols in wired network environment using NS2

Performance evaluation of different queues and effect of queues and buffers in wired network environment using NS2

Compare the behavior of different variants of TCP (Tahoe, Reno, Vegas.) in wired network using NS2. Comparison can be done on the congestion window behavior by plotting graph.

Simulation of wireless Ad hoc networks using NS2 Simulate a wireless network consisting of TCP and UDP Traffic using NS2 and then calculate their respective throughput using AWK script.

Performance evaluation of different ad-hoc wireless routing protocols (DSDV, DSR, AODV etc) using NS2

Create different Wired-cum-Wireless networks and MobileIP Simulations using NS2.




L T P C 0 0 2 1

Each student shall present a seminar on any topic of interest related to the core / elective courses offered in the second semester of the M. Tech. Programme. He / she shall select the topic based on the references from international journals of repute, preferably IEEE journals. They should get the paper approved by the Programme Coordinator / Faculty member in charge of the seminar and shall present it in the class. Every student shall participate in the seminar. The students should undertake a detailed study on the topic and submit a report at the end of the semester. Marks will be awarded based on the topic, presentation, participation in the seminar and the report submitted.




L T 0

0 20 10

The student shall undergo Industrial Training of one-month duration and Mini Project of two months duration. Industrial training should be carried out in an industry / company approved by the institution and under the guidance of a staff member in the concerned field. At the end of the training he / she has to submit a report on the work being carried out. The mini project is designed to develop practical ability and knowledge about practical tools/techniques in order to solve real life problems related to the industry, academic institutions, and computer science / information technology research. Students can take up any application level/system level project pertaining to a relevant domain. Projects can be chosen either from the list provided by the faculty or in the field of interest of the student. For external projects, students should obtain prior permission after submitting the details of the guide and synopsis of the work. The project guide should have a minimum qualification of ME/M.Tech in Information Technology or related fields. At the end of each phase, presentation and demonstration of the project should be conducted, which will be evaluated by a panel of examiners. A detailed project report duly approved by the guide in the prescribed format should be submitted for end semester assessment. Marks will be awarded based on the report and their performance during presentations and demonstrations. Publishing the work in Conference Proceedings/ Journals with National/ International status with the consent of the guide will carry an additional weightage in the review process.




L T 0

C 5

0 10

In masters thesis Phase-I, the students are expected to select an emerging research area in Information Technology or related fields. After conducting a detailed literature survey, they should compare and analyze research work done and review recent developments in the area and prepare an initial design of the work to be carried out as Masters Thesis. It is expected that the students should refer National and International Journals and proceedings of National and International conferences while selecting a topic for their thesis. He/She should select a recent topic from a reputed International Journal, preferably IEEE/ACM. Emphasis should be given for introduction to the topic, literature survey, and scope of the proposed work along with some preliminary work carried out on the thesis topic. Students should submit a copy of Phase-I thesis report covering the content discussed above and highlighting the features of work to be carried out in Phase-II of the thesis. Students should follow standard practice of thesis writing. Presenting the work, carried out by the students in a National/International Conference is encouraged. The candidate should present the current status of the thesis work and the assessment will be made on the basis of the work and the presentation, by a panel of internal examiners in which one will be the internal guide. The examiners should give their suggestions in writing to the students so that it should be incorporated in the PhaseII of the thesis.




L T 0

0 30 15

In the fourth semester the student has to continue the thesis work. Interim evaluation and final evaluation is done by a panel of teachers. Students must demonstrate their work and have to do a presentation. At the end of successfully finishing the work he / she has to submit a detailed report and has to present for a vivavoce. The work carried out should lead to a publication in a national or international conference. They should submit the paper before the evaluation of the Thesis and specific weightage will be given to accepted papers in reputed Conferences.



A comprehensive viva voce examination will be conducted at the end of the fourth semester by an internal and external examiners appointed by the university to asses the candidates overall knowledge in the specified field of specialization.