Showcases
navigate_next
Emulation
search
Quick search
code
Show Source
Table Of Contents
Showcases
Emulation
Testing a Linux Routing Daemon in a Simulated Environment
Using Simulated Applications in a Real Network
Using Real Applications in a Simulated Network
Ethernet
Ethernet Preemption
Ethernet Cut-Through Switching
Generic
PCAP Recording
Differentiated Services
Mobility
Mobility Models
Combining Mobility Models
3D Mobility
Routing
MANET Routing Protocols
Visualization
Visualizing Packet Drops
Visualizing Transport Path Activity
Visualizing Network Path Activity
Visualizing Data Link Activity
Visualizing Physical Link Activity
Visualizing Radio Medium Activity
Visualizing Routing Tables
Displaying IP Addresses and Other Interface Information
Visualizing IEEE 802.11 Network Membership
Visualizing Transport Connections
Visualizing the Spectrum of Radio Signals
Visualizing Node Mobility
Instrument Figures
Styling and Appearance
Visualizing Submodule Information
Visualizing Statistics
3D Visualization
Visualizing Network Nodes
Visualizing the Physical Environment
Visualizing Terrain and Urban Environment
Wireless
Path Loss Models
Modeling Directional Antennas
MAC Protocols for Wireless Sensor Networks
IEEE 802.15.4 Smart Home
Power Consumption
Coexistence of IEEE 802.11 and 802.15.4
Wireless Signal Analog Domain Representations
IEEE 802.11 Throughput
IEEE 802.11 Handover
IEEE 802.11 Rate Control
IEEE 802.11 Fragmentation
IEEE 802.11 Quality of Service
IEEE 802.11 Block Acknowledgment
IEEE 802.11 Frame Aggregation
IEEE 802.11 Transmit Opportunity
Packet Loss vs. Distance Using Various WiFi Bitrates
The Hidden Node Problem
Multiple Wireless Interfaces
Crosstalk between adjacent IEEE 802.11 channels
Tutorials
Wireless
Step 1. Two hosts communicating wirelessly
Step 2. Setting up some animations
Step 3. Adding more nodes and decreasing the communication range
Step 4. Setting up static routing
Step 5. Taking interference into account
Step 6. Using CSMA to better utilize the medium
Step 7. Turning on ACKs in CSMA
Step 8. Modeling energy consumption
Step 9. Configuring node movements
Step 10. Configuring ad-hoc routing (AODV)
Step 11. Adding obstacles to the environment
Step 12. Changing to a more realistic radio model
Step 13. Configuring a more accurate path loss model
Step 14. Introducing antenna gain
Conclusion
IPv4 Network Configurator
Step 1. Fully automatic IP address assignment
Step 2. Manually overriding individual IP addresses
Step 3. Automatically assigning IP addresses to a subnet from a given range
Step 4. Fully automatic static routing table configuration
Step 5. Manually overriding individual routes
Step 6. Using a different metric for automatic routing table configuration
Step 7. Configuring a hierarchical network
Step 8. Configuring a mixed wired/wireless network
Step 9. Leaving some parts of the network unconfigured
Step 10. Configuring a completely wireless network
Step 11. Manually modifying an automatically created configuration
Step 12. Mixing different kinds of autorouting
Conclusion
Queueing
Active Source - Passive Sink
Passive Source - Active Sink
Enqueueing Packets
Dropping Packets from a Finite Queue
Ordering the Packets in the Queue
Storing Packets on Behalf of Multiple Queues
Priority Classifier
Weighted Round-Robin Classifier
Content-Based Classifier
Markov-Chain-Based Classifier
Generic Classifier
Priority Scheduler
Weighted Round-Robin Scheduler
Content-Based Scheduler
Markov-Chain-Based Scheduler
Generic Scheduler
Priority Buffer
Priority Queue
Building Complex Queues via Composition
Content-Based Filtering (Active Source)
Content-Based Filtering (Active Sink)
Ordinal-Based Dropper
RED Dropper
Time-Based Server
Token-Based Server
Generating Tokens Periodically
Generating Tokens after Received Packets
Generating Tokens When a Queue Becomes Empty
Generating Tokens Based on Received Signals
Limiting the Data Rate of a Packet Stream
Requesting Protocol-Specific Behavior for Packets
Requesting Protocol-Specific Behavior Based on Packet Data
Labeling Packets with Textual Tags
Leaky Bucket
Token Bucket
Delaying Packets
Connecting Multiple Active Sources to a Passive Sink
Connecting a Passive Source to Multiple Active Sinks
Blocking/Unblocking Packet Flow (Active Source)
Blocking/Unblocking Packet Flow (Active Sink)
Duplicating Packets from One Input to One Output
Duplicating Packets Based On Their Ordinal Number
Cloning Packets from One Input To Multiple Outputs
Preventing a Queue from Becoming Empty
Example: Request/Response-Based Communication
Example: Generating Telnet Traffic
Example: Simulating a Simplistic Network
Regression Testing and Fingerprints
About Fingerprint Testing
Easy to Handle Changes
Renaming a Submodule
Renaming a Module Parameter
Changing Packet Length
Changing a Timer
Adding New Events - Part 1
Adding New Events - Part 2
Removing Events
Accepting Fingerprint Changes
RIP (work in progress)
Step 1. Static routing
Step 2. Pinging after RIP convergence
Step 3. Link Breakage and Routing Table Updates
Step 4. Timeout Timer and Garbage Collection Timer
Step 5. Triggered Updates
Step 6. Count to Infinity Problem (Two-node Loop Instability)
Step 7. Counting to Infinity (Loop Instability with Higher Number of Nodes)
Step 8. Hold-down timer
Step 9. Measure RIP recovery time
Step 10. Configure an interface as NoRIP
Conclusion
BGP (work in progress)
Step 1. BGP Basic Topology
Step 2. BGP Scenario with E-BGP session only
Step 3. BGP Path Attributes
Step 4. BGP Scenario with I-BGP over directly-connected BGP speakers
Step 4a. Enable nextHopSelf on RB1 and RB2
Step 5. BGP Scenario with I-BGP over not directly-connected BGP speakers
Step 5a. BGP internal distribution
Step 5b. Enabling BGP on RB3
Step 6. BGP Scenario and using loopbacks
Step 7. BGP with RIP redistribution
Step 8. BGP with OSPF and RIP redistribution
Step 9. Using Network attribute to advertise specific networks
Step 10. LOCAL_PREF Attribute
Step 11. MED Attribute
Step 12. Multi-hop E-BGP
Step 100. BGP Policy
Conclusion
OSPF (work in progress)
Step 1. Pinging after OSPF convergence
Step 2. Change link cost
Step 2a. Reroute after link breakage
Step 3. OSPF full adjacency establishment and LSDB sync
Step 4. Router LSA
Step 4a. Advertising loopback interface
Step 5. Effect of network type of an interface on routing table routes
Step 5a. Mismatched Parameters between two OSPF neighbor
Step 6. OSPF DR/BDR election in a multi-access network (Ethernet)
Step 7. Influencing OSPF DR/BDR election
Step 8. Setting all router ids to zero
Step 9. High-priority OSPF router joins after OSPF DR/BDR election
Step 10. Network Topology Changes
Step 10a. Router R4 goes down
Step 10b. Router R2 (DROTHER) goes down
Step 10c. Router R5 (BDR) goes down
Step 10d. Router R1 (DR) goes down
Step 11. Configure an interface as NoOSPF
Step 12. Configure an interface as Passive
Step 13. Freshness of a LSA
Step 14. Hierarchical OSPF topology and summary LSA
Step 15. Set advertisement of a network to ‘false’
Step 16. OSPF topology change in multi-area OSPF
Step 17. Loop avoidance in multi-area OSPF topology
Step 17a. Make R3 an ABR - advertise its loopback to backbone
Step 17b. Make R3 an ABR - create a vitual link between R1 and R3
Step 17c. Summary LSA
Step 18. AS-External LSAs of ‘type 1 metric’ with different advertised destination
Step 18a. AS-External LSAs of ‘type 1 metric’ with the same advertised destination
Step 18b. AS-External LSAs of ‘type 2 metric’ with different advertised destination
Step 18c. AS-External LSAs of ‘type 2 metric’ with the same advertised destination
Step 18d. AS-External LSAs of mixed ‘type 1/type 2 metric’ with the same advertised destination
Step 18e. Address Forwarding
Step 19. Default-route distribution in OSPF
Step 20. Stub area
Step 21. Virtual link - connect two separate parts of a discontinuous backbone
Step 22. Virtual link - connect a disconnected area to the backbone
Step 23. OSPF Path Selection
Step 24. OSPF Path Selection - Suboptimal routes
Step 25. PCAP recording
Conclusion
User’s Guide
Introduction
Using the INET Framework
Networks
Network Nodes
Network Interfaces
Applications
Transport Protocols
The IPv4 Protocol Family
IPv6 and Mobile IPv6
Other Network Protocols
Network Autoconfiguration
Internet Routing
Ad Hoc Routing
Queueing Model
Differentiated Services
The MPLS Models
Point-to-Point Links
The Ethernet Model
The 802.11 Model
The 802.15.4 Model
MAC Protocols for Wireless Sensor Networks
Clock Model
The Physical Layer
The Transmission Medium
The Physical Environment
Node Mobility
Modeling Power Consumption
Network Emulation
Scenario Scripting
Modeling Node Failures
Collecting Results
Visualization
Instrument Figures
Appendix: Author’s Guide
History
Developer’s Guide
Introduction
Working with Packets
Using Sockets
Testing
Appendix: Author’s Guide
Migrating Code from INET 3.x
NED Reference
← Back to the INET Site
Table Of Contents
Showcases
Emulation
Testing a Linux Routing Daemon in a Simulated Environment
Using Simulated Applications in a Real Network
Using Real Applications in a Simulated Network
Ethernet
Ethernet Preemption
Ethernet Cut-Through Switching
Generic
PCAP Recording
Differentiated Services
Mobility
Mobility Models
Combining Mobility Models
3D Mobility
Routing
MANET Routing Protocols
Visualization
Visualizing Packet Drops
Visualizing Transport Path Activity
Visualizing Network Path Activity
Visualizing Data Link Activity
Visualizing Physical Link Activity
Visualizing Radio Medium Activity
Visualizing Routing Tables
Displaying IP Addresses and Other Interface Information
Visualizing IEEE 802.11 Network Membership
Visualizing Transport Connections
Visualizing the Spectrum of Radio Signals
Visualizing Node Mobility
Instrument Figures
Styling and Appearance
Visualizing Submodule Information
Visualizing Statistics
3D Visualization
Visualizing Network Nodes
Visualizing the Physical Environment
Visualizing Terrain and Urban Environment
Wireless
Path Loss Models
Modeling Directional Antennas
MAC Protocols for Wireless Sensor Networks
IEEE 802.15.4 Smart Home
Power Consumption
Coexistence of IEEE 802.11 and 802.15.4
Wireless Signal Analog Domain Representations
IEEE 802.11 Throughput
IEEE 802.11 Handover
IEEE 802.11 Rate Control
IEEE 802.11 Fragmentation
IEEE 802.11 Quality of Service
IEEE 802.11 Block Acknowledgment
IEEE 802.11 Frame Aggregation
IEEE 802.11 Transmit Opportunity
Packet Loss vs. Distance Using Various WiFi Bitrates
The Hidden Node Problem
Multiple Wireless Interfaces
Crosstalk between adjacent IEEE 802.11 channels
Tutorials
Wireless
Step 1. Two hosts communicating wirelessly
Step 2. Setting up some animations
Step 3. Adding more nodes and decreasing the communication range
Step 4. Setting up static routing
Step 5. Taking interference into account
Step 6. Using CSMA to better utilize the medium
Step 7. Turning on ACKs in CSMA
Step 8. Modeling energy consumption
Step 9. Configuring node movements
Step 10. Configuring ad-hoc routing (AODV)
Step 11. Adding obstacles to the environment
Step 12. Changing to a more realistic radio model
Step 13. Configuring a more accurate path loss model
Step 14. Introducing antenna gain
Conclusion
IPv4 Network Configurator
Step 1. Fully automatic IP address assignment
Step 2. Manually overriding individual IP addresses
Step 3. Automatically assigning IP addresses to a subnet from a given range
Step 4. Fully automatic static routing table configuration
Step 5. Manually overriding individual routes
Step 6. Using a different metric for automatic routing table configuration
Step 7. Configuring a hierarchical network
Step 8. Configuring a mixed wired/wireless network
Step 9. Leaving some parts of the network unconfigured
Step 10. Configuring a completely wireless network
Step 11. Manually modifying an automatically created configuration
Step 12. Mixing different kinds of autorouting
Conclusion
Queueing
Active Source - Passive Sink
Passive Source - Active Sink
Enqueueing Packets
Dropping Packets from a Finite Queue
Ordering the Packets in the Queue
Storing Packets on Behalf of Multiple Queues
Priority Classifier
Weighted Round-Robin Classifier
Content-Based Classifier
Markov-Chain-Based Classifier
Generic Classifier
Priority Scheduler
Weighted Round-Robin Scheduler
Content-Based Scheduler
Markov-Chain-Based Scheduler
Generic Scheduler
Priority Buffer
Priority Queue
Building Complex Queues via Composition
Content-Based Filtering (Active Source)
Content-Based Filtering (Active Sink)
Ordinal-Based Dropper
RED Dropper
Time-Based Server
Token-Based Server
Generating Tokens Periodically
Generating Tokens after Received Packets
Generating Tokens When a Queue Becomes Empty
Generating Tokens Based on Received Signals
Limiting the Data Rate of a Packet Stream
Requesting Protocol-Specific Behavior for Packets
Requesting Protocol-Specific Behavior Based on Packet Data
Labeling Packets with Textual Tags
Leaky Bucket
Token Bucket
Delaying Packets
Connecting Multiple Active Sources to a Passive Sink
Connecting a Passive Source to Multiple Active Sinks
Blocking/Unblocking Packet Flow (Active Source)
Blocking/Unblocking Packet Flow (Active Sink)
Duplicating Packets from One Input to One Output
Duplicating Packets Based On Their Ordinal Number
Cloning Packets from One Input To Multiple Outputs
Preventing a Queue from Becoming Empty
Example: Request/Response-Based Communication
Example: Generating Telnet Traffic
Example: Simulating a Simplistic Network
Regression Testing and Fingerprints
About Fingerprint Testing
Easy to Handle Changes
Renaming a Submodule
Renaming a Module Parameter
Changing Packet Length
Changing a Timer
Adding New Events - Part 1
Adding New Events - Part 2
Removing Events
Accepting Fingerprint Changes
RIP (work in progress)
Step 1. Static routing
Step 2. Pinging after RIP convergence
Step 3. Link Breakage and Routing Table Updates
Step 4. Timeout Timer and Garbage Collection Timer
Step 5. Triggered Updates
Step 6. Count to Infinity Problem (Two-node Loop Instability)
Step 7. Counting to Infinity (Loop Instability with Higher Number of Nodes)
Step 8. Hold-down timer
Step 9. Measure RIP recovery time
Step 10. Configure an interface as NoRIP
Conclusion
BGP (work in progress)
Step 1. BGP Basic Topology
Step 2. BGP Scenario with E-BGP session only
Step 3. BGP Path Attributes
Step 4. BGP Scenario with I-BGP over directly-connected BGP speakers
Step 4a. Enable nextHopSelf on RB1 and RB2
Step 5. BGP Scenario with I-BGP over not directly-connected BGP speakers
Step 5a. BGP internal distribution
Step 5b. Enabling BGP on RB3
Step 6. BGP Scenario and using loopbacks
Step 7. BGP with RIP redistribution
Step 8. BGP with OSPF and RIP redistribution
Step 9. Using Network attribute to advertise specific networks
Step 10. LOCAL_PREF Attribute
Step 11. MED Attribute
Step 12. Multi-hop E-BGP
Step 100. BGP Policy
Conclusion
OSPF (work in progress)
Step 1. Pinging after OSPF convergence
Step 2. Change link cost
Step 2a. Reroute after link breakage
Step 3. OSPF full adjacency establishment and LSDB sync
Step 4. Router LSA
Step 4a. Advertising loopback interface
Step 5. Effect of network type of an interface on routing table routes
Step 5a. Mismatched Parameters between two OSPF neighbor
Step 6. OSPF DR/BDR election in a multi-access network (Ethernet)
Step 7. Influencing OSPF DR/BDR election
Step 8. Setting all router ids to zero
Step 9. High-priority OSPF router joins after OSPF DR/BDR election
Step 10. Network Topology Changes
Step 10a. Router R4 goes down
Step 10b. Router R2 (DROTHER) goes down
Step 10c. Router R5 (BDR) goes down
Step 10d. Router R1 (DR) goes down
Step 11. Configure an interface as NoOSPF
Step 12. Configure an interface as Passive
Step 13. Freshness of a LSA
Step 14. Hierarchical OSPF topology and summary LSA
Step 15. Set advertisement of a network to ‘false’
Step 16. OSPF topology change in multi-area OSPF
Step 17. Loop avoidance in multi-area OSPF topology
Step 17a. Make R3 an ABR - advertise its loopback to backbone
Step 17b. Make R3 an ABR - create a vitual link between R1 and R3
Step 17c. Summary LSA
Step 18. AS-External LSAs of ‘type 1 metric’ with different advertised destination
Step 18a. AS-External LSAs of ‘type 1 metric’ with the same advertised destination
Step 18b. AS-External LSAs of ‘type 2 metric’ with different advertised destination
Step 18c. AS-External LSAs of ‘type 2 metric’ with the same advertised destination
Step 18d. AS-External LSAs of mixed ‘type 1/type 2 metric’ with the same advertised destination
Step 18e. Address Forwarding
Step 19. Default-route distribution in OSPF
Step 20. Stub area
Step 21. Virtual link - connect two separate parts of a discontinuous backbone
Step 22. Virtual link - connect a disconnected area to the backbone
Step 23. OSPF Path Selection
Step 24. OSPF Path Selection - Suboptimal routes
Step 25. PCAP recording
Conclusion
User’s Guide
Introduction
Using the INET Framework
Networks
Network Nodes
Network Interfaces
Applications
Transport Protocols
The IPv4 Protocol Family
IPv6 and Mobile IPv6
Other Network Protocols
Network Autoconfiguration
Internet Routing
Ad Hoc Routing
Queueing Model
Differentiated Services
The MPLS Models
Point-to-Point Links
The Ethernet Model
The 802.11 Model
The 802.15.4 Model
MAC Protocols for Wireless Sensor Networks
Clock Model
The Physical Layer
The Transmission Medium
The Physical Environment
Node Mobility
Modeling Power Consumption
Network Emulation
Scenario Scripting
Modeling Node Failures
Collecting Results
Visualization
Instrument Figures
Appendix: Author’s Guide
History
Developer’s Guide
Introduction
Working with Packets
Using Sockets
Testing
Appendix: Author’s Guide
Migrating Code from INET 3.x
NED Reference
← Back to the INET Site
Emulation
¶
The following showcases demonstrate INET’s emulation support:
Testing a Linux Routing Daemon in a Simulated Environment
Using Simulated Applications in a Real Network
Using Real Applications in a Simulated Network
Previous
Showcases
Next
Testing a Linux Routing Daemon in a Simulated Environment