Głąbowski et al., 2019 - Google Patents
Modelling Overflow Systems with Queuing in Primary ResourcesGłąbowski et al., 2019
View PDF- Document ID
- 6387396070074489756
- Author
- Głąbowski M
- Kmiecik D
- Stasiak M
- Publication year
- Publication venue
- Quality, Reliability, Security and Robustness in Heterogeneous Systems: 14th EAI International Conference, Qshine 2018, Ho Chi Minh City, Vietnam, December 3–4, 2018, Proceedings 14
External Links
Snippet
This article proposes a new method to determine the characteristics of multiservice overflow systems with queueing systems. A number of methods have been developed that have the advantage of determining the parameters of traffic directed to secondary resources as well …
- 238000004088 simulation 0 abstract description 10
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/70—Admission control or resource allocation
- H04L47/80—Actions related to the nature of the flow or the user
- H04L47/805—QOS or priority aware
-
- 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
- H04L47/24—Flow control or congestion control depending on the type of traffic, e.g. priority or quality of service [QoS]
- H04L47/2441—Flow classification
-
- 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
- G06F9/48—Programme initiating; Programme switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
-
- 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/5695—Admission control; Resource allocation
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/70—Admission control or resource allocation
- H04L47/82—Miscellaneous aspects
-
- 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
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
-
- 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/14—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning
-
- 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
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Hanczewski et al. | A queueing model of a multi-service system with state-dependent distribution of resources for each class of calls | |
Samouylov et al. | Sojourn time analysis for processor sharing loss system with unreliable server | |
Hanczewski et al. | Convolution model of a queueing system with the cFIFO service discipline | |
Goel et al. | Queueing based spectrum management in cognitive radio networks with retrial and heterogeneous service classes | |
Markova et al. | Queue with retrial group for modeling best effort traffic with minimum bit rate guarantee transmission under network slicing | |
Stepanov et al. | The increasing of resource sharing efficiency in network slicing implementation | |
Hottmar et al. | Analytical model of a weighted round robin service system | |
Głąbowski et al. | Modelling of multiservice networks with separated resources and overflow of adaptive traffic | |
Głąbowski et al. | Modelling Overflow Systems with Queuing in Primary Resources | |
Bushkova et al. | Resource queueing system with dual requests and their parallel service | |
Ageev et al. | Modelling of virtual radio resources slicing in 5G networks | |
Nazarov et al. | Asymptotic-diffusion analysis of multiserver retrial queueing system with priority customers | |
Strzęciwilk et al. | Modeling and performance analysis of priority queuing systems | |
Hanczewski et al. | The analytical model of 5G networks | |
Głąbowski et al. | Modified direct method for point-to-point blocking probability in multi-service switching networks with resource allocation control | |
Hilquias et al. | Two types of single-server queueing systems with threshold-based renovation mechanism | |
Raj et al. | Resource optimization for MMAP [c]/PH [c]/S catastrophic queueing model with PH retrial times | |
Hida et al. | Joint deployment of virtual routing function and virtual firewall function in NFV-based network with minimum network cost | |
Głąbowski et al. | Analytical modelling of multi-tier cellular networks with traffic overflow | |
Vytovtov et al. | Modeling and Analysis of Multi-channel Queuing System Transient Behavior for Piecewise-Constant Rates | |
Hanczewski et al. | Simulation studies of queueing systems | |
Bogdanova et al. | Characteristics of lost and served packets for retrial queueing system with general renovation and recurrent input flow | |
Hanczewski et al. | The analytical model of complex non-full-availability system | |
Mahdian et al. | Robustness of join-the-shortest-queue scheduling to communication delay | |
Le et al. | Throughput‐based fair bandwidth allocation in OBS networks |