CS9265 PERFORMANCE EVALUATION OF COMPUTER SYSTEMS AND NETWORKS
UNIT I
Performance Characteristics – Requirement Analysis: Concepts –User, Device, Network
Requirements – Process –Developing RMA ,Delay, Capacity Requirements – Flow Analysis –
Identifying and Developing Flows –Flow Models –Flow Prioritization –Specification.
UNIT II
Random variables - Stochastic process –Link Delay components – Queuing Models – Little’s
Theorem – Birth & Death process – Queuing Disciplines.
UNIT III
Markovian FIFO Queuing Systems – M/M/1 – M/M/a – M/M/∞ - M/G/1 – M/M/m/m and other
Markov-Non-Markovian and self-similar models – Network of Queues –Burke’s Theorem –
Jackson’s Theorem.
UNIT IV
Multi-User Uplinks/Downlinks - Capacity Regions - Opportunistic Scheduling for Stability and
Max Throughput - Multi-Hop Routing - Mobile Networks - Throughput Optimality and
Backpressure
UNIT V
Performance of Optimal Lyapunov Networking - Energy Optimality- Energy-Delay Tradeoffs -
Virtual Cost Queues - Average Power Constraints - Flow Control with Infinite Demand - Auxiliary
Variables - Flow Control with Finite Demand - General Utility Optimization.
TEXT BOOKS
1. James D.McCabe , Network Analysis , Architecture and Design , 2nd
Edition,Elsevier,2003
2. Bertsekas & Gallager , Data Networks , second edition ,Pearson Education,2003
3. Introduction to Probability Models by Sheldon Ross (8th edition) Academic Press, New
York ,2003
REFERENCES
1. D. Bertsekas, A. Nedic and A. Ozdaglar, Convex Analysis and Optimization, Athena
Scientific, Cambridge , Massachusetts , 2003
2. Nader F.Mir Computer and Communication Networks,Pearson Education.2007
3. Paul J.Fortier, Howard E.Michel, Computer Systems Performance Evaluation and
Prediction, Elsevier,2003
UNIT I
Performance Characteristics – Requirement Analysis: Concepts –User, Device, Network
Requirements – Process –Developing RMA ,Delay, Capacity Requirements – Flow Analysis –
Identifying and Developing Flows –Flow Models –Flow Prioritization –Specification.
UNIT II
Random variables - Stochastic process –Link Delay components – Queuing Models – Little’s
Theorem – Birth & Death process – Queuing Disciplines.
UNIT III
Markovian FIFO Queuing Systems – M/M/1 – M/M/a – M/M/∞ - M/G/1 – M/M/m/m and other
Markov-Non-Markovian and self-similar models – Network of Queues –Burke’s Theorem –
Jackson’s Theorem.
UNIT IV
Multi-User Uplinks/Downlinks - Capacity Regions - Opportunistic Scheduling for Stability and
Max Throughput - Multi-Hop Routing - Mobile Networks - Throughput Optimality and
Backpressure
UNIT V
Performance of Optimal Lyapunov Networking - Energy Optimality- Energy-Delay Tradeoffs -
Virtual Cost Queues - Average Power Constraints - Flow Control with Infinite Demand - Auxiliary
Variables - Flow Control with Finite Demand - General Utility Optimization.
TEXT BOOKS
1. James D.McCabe , Network Analysis , Architecture and Design , 2nd
Edition,Elsevier,2003
2. Bertsekas & Gallager , Data Networks , second edition ,Pearson Education,2003
3. Introduction to Probability Models by Sheldon Ross (8th edition) Academic Press, New
York ,2003
REFERENCES
1. D. Bertsekas, A. Nedic and A. Ozdaglar, Convex Analysis and Optimization, Athena
Scientific, Cambridge , Massachusetts , 2003
2. Nader F.Mir Computer and Communication Networks,Pearson Education.2007
3. Paul J.Fortier, Howard E.Michel, Computer Systems Performance Evaluation and
Prediction, Elsevier,2003
i need previous year question paper for ce9265
ReplyDelete