Log In / Register
Virtual University of Pakistan
Home
Courses
About VU
Contact Us
Terms of Use
Find Course
View All Courses
Course Home
Course Overview
Related Links
Reference Books
Lecture Videos
Featured
Courses
Most Popular Courses
Most Visited Courses
Home
>
Courses
>
Computer Science/Information Technology
> CS432
CS432
:
Network Modeling and Simulation
Your like has been submitted!
Error! Please try again.
I like this Course
Course Info
Course Category
Computer Science/Information Technology
Course Level
Undergraduate
Credit Hours
3
Pre-requisites
CS610
Instructor
Dr. Ali Hammad Akbar
PhD
Ajou University
Course Contents
About this Course Need for NEMS What is NeMS What is Model Modeling Perspective and Intra-model relation What is Simulation part I What is Simulation part II Simulation Building Process Components of a Simulator Types of PETs and simulations Common simulation pitfalls part I Common simulation pitfalls part II (Common simulation pitfalls part III Common simulation pitfalls part IV Development of Systems Simulation Recommended Text and References Introduction to OMNET++ Overview of OMNET++ Logical architecture of OMNET++ simulation Introduction to NED Language More about NED Language Configuring OMNET++ Simulations Building and Compiling Simulations Running Simulations Animation and Tracing Organizing and performing experiments Sequence Charts 1 Sequence Charts 2 TicToc Tutorial(module1 to 16) Analyzing results Editing Datasets Computation Examples 1 Computation Examples 2 Simulation Models and INET Design Tour for INET 1 Design Tour for INET 2 Design Tour for INET 3 Introduction to top-down approach to modelling and simulation Rules for Mathematical Reading Rules for Mathematical writing Usability QoE-Planning for expansion Expanding access to data Constraints on scalability Availability Disaster Recovery Specifying Availability Requirements Five nines availability Cost of downtime Mean Time Between Failure and Mean Time to Repair Network Performance Optimum Network Utilization Throughput Throughput of inter networking devices Application layer throughput Accuracy Efficiency Delay and delay variation Causes of delay Delay variation Response time Security Identifying network assets Reconnaissance Attacks Developing Security Requirements Manageability Affordability DoS attack Making Network Design Tradeoffs Simulate FTP scenario as Application Layer Throughput Simulating DoS attack Summarizing top-down approach simulate RTP video session to show delay & jitter simulate RTP video session to show delay & jitter Client Server Architectures Web Server Modeling HTTP Modeling Non-Persistent Connections Persistent Connections Cache Response Time FTP Efficiency SMTP Scalability DNS Load Distribution P2P Scalability Torrents Efficiency Reliability of Circular DHT Week 8.2_Topic 109 (Simulate Persistent Connections) Simulate DNS Query Response TCP Server Threading Simulate HTTP Handshaking Introduction and Transport Layer Services Multiplexing and Demultiplexing Multiplexing of Traffic on a Communication Link Checksum Go Back N Selective Repeat RTT Estimation and Time Out Reliable Data Transfer Flow Control TCP Connection Management Principles of Congestion Control ATM ABR Congestion Control TCP Congestion Control Leaky Bucket and Token Bucket Quality of Service Fair Queues Priority Queues Static Window Modeling Static Window Modeling Case 2 Dynamic Window Modeling Limitations of end-to-end windows Node by node windows Little's Theorem Probabilistic form of Little's Theorem Applications of Little's Theorem Arrival Statistics--Poisson Process Service Statistics Occupancy Distribution upon Arrival Simulating Slow Start Network Service Models Virtual Circuit Networks Week 11.2_Topic 144 (Datagram Networks) Input Processing Output Processing Head of Line Blocking Random Early Detection RED with In and Out RIO Routing Algorithms Complexity of Link State Complexity of Distance Vector Count to Infinity Problem Poisoned Reverse Hierarchical Routing Complexity Elastic Aggregates and Traffic Engineering Optimal Routing Limitations of Minimum Hop Routing Formulation of Routing Problem Minimum Interference Routing QoS Rounting Nonadditive Metrics Additive Metrics; RMB Finding Feasible Routes Upper Bound on Performance Non-Rate-Based Multiplexers Efficient Longest Prefix Match Level Compressed Tries Flooding; ARPANET Algorithm Flooding w/o Periodic Updates Simulate QoS Routing Simulate Routing Updates Simulate HSRP Simulate Flooding DLL Services EDEC Techniques Parity Checks Checksumming at DLL Horizontal and vertical Parity Cyclic Redundancy Check Throughput of MAC Channel Partitioning Random Access Protocols ALOHA Slotted ALOHA CSMA/CD CSMA/CD Efficiency Min Frame Size Computation Max Frame Size Computation Fixed Frame Size Computation Multi-Protocol Label Switching Load Balancing in Data Centre Correctness of Stop and Wait Efficiency of GO Back N Character-Based Framing Bit-Oriented Framing Framing with Errors Length Fields Topology and Connectivity Link Scheduling & Capacity) Scheduling Constraints Marginal Buffering at Every Hop Arbitrary Buffering at Every Hop) Problem Set 1- Effect of BER on Channel Performance Problem Set 2- Operation of MAC Addressing Simulate Parity Scheme Failure Simulate ARP Behaviour Output Analysis on WireShark Simulate Switching vs Routing Overview of Access Technologies WiFi WiFi Operations Mobile IP Packet Cable Networks ViMax Digital Subscriber Line Wireless Personal Area Networks IEEE802.15.4 Radio Frequency Identification