logo
INET Framework
Combining Features
Initializing search
    inet-framework/inet
    • Download
    • Showcases
    • Tutorials
    • Documentation
    • Development
    • Contributing
    • People
    inet-framework/inet
    • Download
    • Showcases
      • Emulation
        • Webserver Emulation
        • Testing a Linux Routing Daemon in a Simulated Environment
        • Using Simulated Applications in a Real Network
        • Using Mininet to Set Up the Virtual Network
        • Using Real Applications in a Simulated Network
      • Time-Sensitive Networking
        • Time Synchronization
          • Clock Drift
          • Using gPTP
        • Per-Stream Filtering and Policing
          • Token-Bucket-Based Policing
          • Statistical Policing
          • Peeking Under the Hood
        • Scheduling and Traffic Shaping
          • Time-Aware Shaping
          • Credit-Based Shaping
          • Asynchronous Traffic Shaping
          • Using Different Traffic Shapers for Different Traffic Classes
          • Combining Time-Aware and Credit-Based Shaping
          • Using Traffic Shapers Independently
        • Automatic Gate Schedule Configuration
          • Eager Gate Schedule Configuration
          • SAT-Solver-based Gate Schedule Configuration
          • TSNsched-based Gate Scheduling
        • Frame Replication and Elimination for Reliability
          • Manual Stream Configuration
          • Automatic Multipath Stream Configuration
          • Automatic Stream Configuration with Failure Protection
          • Multicast Streams with Failure Protection
        • Frame Preemption
        • Cut-Through Switching
        • Combining Features
          • Effects of Time Synchronization on Time-Aware Shaping
          • Frame Replication with Time-Aware Shaping
          • In-vehicle Network
        • Combining Features
          • Effects of Time Synchronization on Time-Aware Shaping
          • Frame Replication with Time-Aware Shaping
          • In-vehicle Network
      • Ethernet
        • Q-in-Q: IEEE 802.1ad Shared Core Network
      • Generic
        • PCAP Recording
        • Differentiated Services
      • Measurement
        • Measuring Channel Throughput
        • Measuring Channel Utilization
        • Measuring End-to-end Delay
        • Measuring Packet Delay Variation
        • Measuring Transmission Time
        • Measuring Propagation Time
        • Measuring Queueing Time
        • Measuring Residence Time
        • Measuring Data Rate
        • Measuring Time Along Packet Flows
      • Mobility
        • Mobility Models
        • Combining Mobility Models
        • 3D Mobility
      • QUIC
        • QUIC Bandwidth Sharing on a Bottleneck Link
      • Routing
        • Exploring MANET Routing Protocols
        • AODV External Gateway Routing
      • 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 IPv4 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
        • Getting Started
        • 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
        • Getting Started
        • 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. Setting 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 part 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
        • Getting Started
        • 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 Transmission Channel
        • Example: Input Queue Switching
        • Example: Output Queue Switching
      • Regression Testing and Fingerprints
        • Getting Started
        • 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 Routing
        • Step 1. Static Routing
        • Step 2. Pinging after RIP Convergence
        • Step 3. Link Breakage and Routing Table Updates
        • Step 4. RIP Timers: Timeout and Garbage Collection
        • Step 5. Triggered Updates: Speeding Up Convergence
        • Step 6. Count to Infinity Problem (Two-node Loop Instability)
        • Step 7. Count to Infinity in Complex Networks
        • Step 8. Hold-Down Timer: Preventing Routing Loops
        • Step 9. Measuring RIP Recovery Time
        • Step 10. Configuring RIP Interfaces
        • Conclusion
      • BGP Routing
        • 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. Multi-hop E-BGP
        • Conclusion
      • OSPF Routing
        • 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 neighbors
        • Step 6. OSPF DR/BDR election in a multi-access network (Ethernet)
        • Step 7. Influencing OSPF DR/BDR election
        • Step 8. Setting all router priorities 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 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 virtual link between R1 and R3
        • 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
      • STP/RSTP
        • Step 1. The Problem: Broadcast Loops Without STP
        • Step 2. Basic STP Operation
        • Step 3. Root Bridge Election by Priority
        • Step 4. STP Convergence Time
        • Step 5. Topology Change with STP: Switch Failure and Recovery
        • Step 6. RSTP: Faster Convergence
        • Step 7. Topology Change with RSTP: Faster Recovery
        • Step 8. Link Reconnect with RSTP
        • Conclusion
      • Introduction
      • Installing INET
      • Getting Started
      • User's Guide
      • Developer's Guide
      • Migration Guide
      • NED Reference
      • Python API
      • Technical Presentations
      • Model Catalog
      • 3rd Party Tutorials
      • Teaching Resources
      • Repository
      • Bug Tracker
      • Mailing List
      • Coding Conventions
      • Documenting
      • Test Suite
      • Submitting Code
      • Plans
      • Progress
      • Why Contribute
      • How Can You Help
      • Getting Started
      • Contribution Ideas
      • Contributors
      • Component Advisors
      • Community Coordinators
      • Core Team

    Combining Features¶

    The demonstrated features of Time-Sensitive Networking are not independent and they affect each other.

    The following showcases demonstrate how to combine various features of Time-Sensitive Networking:

    • Effects of Time Synchronization on Time-Aware Shaping
    • Frame Replication with Time-Aware Shaping
    • In-vehicle Network
    © Copyright INET community.
    Created from commit cc574d9154 using Sphinx 9.1.1. and Sphinx-Immaterial for the OMNeT++ Discrete Event Simulator. Privacy · Cookie settings

    Cookie consent

    With your consent, this site uses Google Analytics cookies to learn how it is used, which helps us improve it. You can change your choice at any time with Cookie settings at the bottom of every page. See the privacy notice.