Course Info

Course Category

Computer Science/Information Technology

Course Level

Undergraduate

Credit Hours

3

Prerequisites

CS610


Course Contents

Introduction to Modeling and Simulations, What is a Model? Model types, What is simulation? Types of simulations, Relationship between modeling and simulation? Modeling system terminology and Common pitfalls, Steps of Systems Simulation Development, Introduction to OMNET++, The NED Language, Simple Modules, Messages and Packets, The Simulation Library, Building Simulation Programs, Network Graphics And Animation, Configuring and running simulations, What is topdown approach to Network Modeling? Usability, Scalability, Availability, Network Performance Definitions, Optimum Network Utilization, Throughput, Delay and Delay Variation, Security, Developing Security Requirements, Manageability, Web Server modeling, HTTP modeling, Multiplexing of Traffic on a Communication Link, Principles of Congestion Control, Quality of Service, Modeling Latency; Static window, Modeling Latency; Dynamic window, Little's Theorem, Probabilistic Form of Little's Theorem, Applications of Little's Theorem, Arrival statisticsthe Poisson process, Service statistics, Occupancy Distribution upon Arrival, Occupancy Distribution upon Departure, Simulating priority queues, Network Layer, Random Early Detection, Routing Algorithms, Complexity of the LinkState (LS) algorithm, Complexity of the DistanceVector (DV) routing algorithm, Count to infinity problem, Poisoned Reverse, Elastic Aggregates and Traffic Engineering, Algorithms for Shortest Path Routing, Dijkstra’s Algorithm, The Bellman–Ford Algorithm, A Generalized Dijkstra Algorithm, Limitations of Min Hop Routing, Formulations of the Routing Problem, Minimum Interference Routing Formulation, QoS Routing, Simulating flooding, Data link Layer, Channel Partitioning Protocols, Random Access Protocols, Slotted Aloha, Pure Aloha, Binary exponential back off algorithm, CSMA/CD efficiency, Load balancing in data center networking, Correctness of stop and wait, Efficiency of go back n implementations, CharacterBased Framing, BitOriented Framing: Flags, Framing with Errors, Length Fields, Framing with Errors, Maximum Frame Size, Variable frame length, Fixed frame length, Topology and Connectivity, Link Scheduling and Network Capacity, Scheduling Constraints, Centralized Scheduling.


