Pages that link to "Item:Q3893288"
From MaRDI portal
The following pages link to Analysis of Shared Finite Storage in a Computer Network Node Environment Under General Traffic Conditions (Q3893288):
Displaying 14 items.
- Theory of queuing networks and its applications to the analysis of information-computing systems (Q1057005) (← links)
- A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks (Q1085077) (← links)
- An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas (Q1118524) (← links)
- Computational algorithms for blocking probabilities in circuit-switched networks (Q1197748) (← links)
- A universal building block for the approximate analysis of a shared buffer ATM switch architecture (Q1319837) (← links)
- Computation and optimization methods for multiresource queues (Q1385770) (← links)
- Harmonic buffer management policy for shared memory switches (Q1887082) (← links)
- Resource sharing model with minimum allocation for the performance analysis of network slicing (Q1980550) (← links)
- Analyzing sharing strategies for finite buffer memory in a router among outgoing channels (Q2261814) (← links)
- Numerical methods for analysis of multiflow queuing systems with virtual partition of a common buffer (Q2571533) (← links)
- Per-flow structure of losses in a finite-buffer queue (Q2671853) (← links)
- Product Forms for Stochastic Interference Systems (Q3415899) (← links)
- Congestion control using dynamic routing and flow control (Q4005826) (← links)
- Loss probability in priority limited processing queueing system (Q6137307) (← links)
