Nothing Special   »   [go: up one dir, main page]

Kim, 2022 - Google Patents

Finite‐Buffer M/G/1 Queues with Time and Space Priorities

Kim, 2022

View PDF @Full View
Document ID
10802020371152861040
Author
Kim K
Publication year
Publication venue
Mathematical Problems in Engineering

External Links

Snippet

Many communication systems have finite buffers and service delay‐sensitive and loss‐ sensitive types of traffic simultaneously. To meet the diverse QoS requirements of these heterogeneous types of traffic, it is desirable to offer delay‐sensitive traffic time priority over …
Continue reading at onlinelibrary.wiley.com (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/32—Network-specific arrangements or communication protocols supporting networked applications for scheduling or organising the servicing of application requests, e.g. requests for application data transmissions involving the analysis and optimisation of the required network resources
    • H04L67/322—Network-specific arrangements or communication protocols supporting networked applications for scheduling or organising the servicing of application requests, e.g. requests for application data transmissions involving the analysis and optimisation of the required network resources whereby quality of service [QoS] or priority requirements are taken into account
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L29/00—Arrangements, apparatus, circuits or systems, not covered by a single one of groups H04L1/00 - H04L27/00 contains provisionally no documents
    • H04L29/02—Communication control; Communication processing contains provisionally no documents
    • H04L29/06—Communication control; Communication processing contains provisionally no documents characterised by a protocol
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/50—Network service management, i.e. ensuring proper service fulfillment according to an agreement or contract between two parties, e.g. between an IT-provider and a customer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security

Similar Documents

Publication Publication Date Title
Adan et al. Queueing models with multiple waiting lines
Shan et al. Modeling and performance analysis of QoS-aware load balancing of web-server clusters
Sun et al. Analysis of multiserver queueing system with opportunistic occupation and reservation of servers
Kim et al. Erlang loss queueing system with batch arrivals operating in a random environment
Kim Finite‐Buffer M/G/1 Queues with Time and Space Priorities
Melikov et al. Analyzing the models of systems with heterogeneous servers
Xie et al. Performance analysis of service systems with priority upgrades
Olsen et al. Polling systems with periodic server routeing in heavy traffic: distribution of the delay
Głąbowski et al. Modelling of multiservice networks with separated resources and overflow of adaptive traffic
Bouillard et al. Tight performance bounds in the worst-case analysis of feed-forward networks
Granville et al. On a 2-class polling model with reneging and k_i ki-limited service
Dudin et al. Analysis of a Priority Queue with Phase‐Type Service and Failures
Klimenok et al. Retrial tandem queue with controllable strategy of repeated attempts
Ansell et al. Generalised ‘join the shortest queue’policies for the dynamic routing of jobs to multi-class queues
Stepanov Model of joint servicing of real-time service traffic and data traffic. I
Lichtzinder et al. Batch poissonian arrival models of multiservice network traffic
Vasiliadis et al. Class‐Based Weighted Fair Queuing Scheduling on Dual‐Priority Delta Networks
Bouillard et al. Worst-case analysis of tandem queueing systems using network calculus
Sun et al. MAP+ MAP/M2/N/∞ queueing system with absolute priority and reservation of servers
Yashina et al. Loss probability in priority limited processing queueing system
Ferreira et al. Moments of losses during busy-periods of regular and nonpreemptive oscillating M^ X/G/1/n MX/G/1/n systems
Raj et al. Resource optimization for MMAP [c]/PH [c]/S catastrophic queueing model with PH retrial times
Chang et al. A novel approach to queue stability analysis of polling models
Głąbowski et al. Modelling Overflow Systems with Queuing in Primary Resources
Kim (N, n)‐Preemptive‐Priority M/G/1 Queues with Finite and Infinite Buffers