510110 Network Design, Modeling and Analysis Teaching Scheme Lectures: 3 Hrs/week Examination Scheme Theory: 100 Marks
Total Credits : 03
1. Essentials of Probability Probability on a Sample Space, Basic Operations on Events, Probability on Events, Other Properties, Conditional Probability, Bayes Formula ,Independence, Random Variables, Random Variable as a Measurement, Probability Mass Function for a Random Variable, Cumulative Distribution Function, PMF and CDF for the 3 Coin Toss Example, Expectation of a Random Variable, Important Random Variables, Bernoulli Random Variable, Binomial Random Variable, Geometric Random Variable, Poisson Random Variable, Continuous-valued Random Variables, Properties of Continuous Random Variables, Expectation of a Continuous Random Variable, Important Continuous Random Variable: Exponential, Memory less Property of the Exponential 2. Delay Models in Data Networks Multiplexing of Traffic on a Communication Link, Queuing Models- Littles Theorem, Littles Theorem, Probabilistic Form of Littles Theorem, Application of Littles Theorem, The M/M/1 Queuing System, Arrival Statistics, Service Statistics, Markov Chain Formulation, Deviation of the Stationary Distribution, Occupancy Distribution upon Arrival, Occupancy Distribution upon Departure, The M/M/m, M/M/, M/M/m/m, AND Other Markov Systems, The M/M/m: The m-Server Case, M/M/: The Infinite-Server Case, M/M/m/m: The m-Server Loss System, ltidimensional Markov Chains- Applications in Circuit Switching, The M/G/1 System, M/G/1 Queues with Vacations, Reservations and Polling, Priority Queuing 3. Inside an IMP Queuing in the Network Layer at an IMP, Basic Single Queue Model, Applications of Queuing Analysis Outside of Networking, The Poisson Arrival Model, Properties of a Poisson Process, Interarrival Times of a Poisson Process, The M/M/1 Queue, Aside: Queuing Notation, Aside: The D/D/1 Queue, State Analysis of an M/M/1 Queue, Balance Equations , Solving the Balance Equations, The Finite Buffer Case: M/M/1/N, Blocking Probability and the Right Size Buffer, Throughput in the Finite Buffer Case, Approximation of a Finite Buffer System by the Infinite Buffer Model, Little's Formula and Queuing Delay, Applying Little's Formula to an M/M/1 Queue, Applying the M/M/1 Results to a Single Network Link, Other Queuing Models
22
4. Network Design Problem definition : Multipoint line layout heuristics, CMST algorithm, ESAUWilliams algorithm, Sharmas algorithm, Unified algorithm, Bin packing, Terminal assignments, Concentrator location 5. Network Analysis Queuing Networks, Closed Queuing Network Example, Nodes in a Packet Switched Network (PSN), Queuing Network Model of Nodes in a PSN, Queuing Network Analysis of a PSN, performance analysis of Data Link Layer, Network layer, QoS, 6. Network Administration Functions and responsibilities, Network planning and implementation, Sub-netting, Bandwidth management, security issues, Tools for BW and security management, modifying network implementation Reference Books 1. Kershenbaum A., Telecommunication Network Design Algorithms, Tata McGraw Hill 2. Keshav S., An Engineering Approach to Computer Networking, AddisonWesley,1997. 3. Bertsekas D. and Gallager R., Data Networks, 2nd Ed., Prentice-Hall, Englewood Cliffs, N.J., 1992. 4. Vijay Ahuja, Design and Analysis of Computer Communication Networks, McGraw Hill 5. Stallings W., High Speed Networks and Internet : Performance and Quality of Service, PrenticeHall 6. Zacker, Networking The Complete Reference, Tata McGraw Hill
23
