Package jline.examples.java

Comprehensive examples and gallery of queueing network models for the LINE solver.

This package provides a extensive collection of example models demonstrating various queueing network concepts, modeling techniques, and solution methods. The examples range from classical single-queue systems to complex multi-class networks with advanced features.

• Basic Networks: OpenModel, ClosedModel, MixedModel
• Advanced Topologies: ForkJoinModel, CacheModel, LayeredModel
• Specialized Models: StochPetriNet, RandomEnvironment, LoadDependent
• Routing and Control: ClassSwitching, StateDepRouting, Prio
• Classical Systems: Gallery (M/M/1, M/M/k, M/G/1, etc.)
• Analysis Tools: StateProbabilities, CDFRespT, InitState
• Getting Started: GettingStarted, Misc

• Open Networks: Jobs arrive from external sources and depart to sinks
• Closed Networks: Fixed population of jobs circulating within the system
• Mixed Networks: Combination of open and closed classes
• Layered Networks: Hierarchical models with tasks, processors, and activities
• Petri Nets: Token-based models with places, transitions, and firing rules

• Multiple scheduling strategies (FCFS, PS, LCFS, HOL, DPS, etc.)
• Various service time distributions (Exponential, Erlang, HyperExp, APH, MAP, etc.)
• Complex routing patterns (probabilistic, state-dependent, class switching)
• Load balancing and priority mechanisms
• Multi-server stations and load-dependent services
• Cache modeling and replacement strategies
• Fork-join synchronization patterns
• Random environment and Markovian arrival processes

Each example class contains static methods that return configured jline.lang.Network objects ready for analysis. These can be solved using various solvers from the jline.solvers package such as MVA, JMT, SSA, CTMC, etc.

Example usage:

Network model = GettingStarted.tut01_mm1_basics();
NetworkAvgTable results = new SolverMVA(model).getAvgTable();
results.print();