[go: up one dir, main page]

De Muynck et al., 2017 - Google Patents

Tail probabilities of the delay under a reservation-based scheduling mechanism

De Muynck et al., 2017

View PDF
Document ID
11677841521447222751
Author
De Muynck M
Bruneel H
Wittevrongel S
Publication year
Publication venue
International Conference on Queueing Theory and Network Applications

External Links

Snippet

We study the tail probabilities of the customer delay for a buffer operating under a reservation-based scheduling discipline known as R-scheduling. Previous numerical work on this model has led to a hypothesized meta-model, which was tested using simulations but …
Continue reading at www.researchgate.net (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/5693—Queue scheduling in packet switching networks
    • 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
    • G06F9/48—Programme initiating; Programme switching, e.g. by interrupt
    • G06F9/4806—Task transfer initiation or dispatching
    • G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
    • G06F9/4887—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues involving deadlines, e.g. rate based, periodic
    • 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/22—Traffic shaping
    • 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
    • H04L41/147—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning for prediction of network behaviour
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/50—Queue scheduling
    • H04L47/56—Delay aware scheduling
    • 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
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/50—Queue scheduling
    • H04L47/62—General aspects
    • 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
    • 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/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • 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

Similar Documents

Publication Publication Date Title
US20070050773A1 (en) Weighted fair queuing scheduler
Checconi et al. QFQ: Efficient packet scheduling with tight guarantees
Olsen et al. Polling systems with periodic server routeing in heavy traffic: distribution of the delay
Arunachalam et al. A fluid queue modulated by two independent birth–death processes
Bruneel et al. Queueing models for the analysis of communication systems
De Muynck et al. Tail probabilities of the delay under a reservation-based scheduling mechanism
Chen et al. A two-class MAP/PH/1 weighted fair queueing system and its application to telecommunications
Vincent Perfect simulation of monotone systems for rare event probability estimation
Efrosinin et al. Algorithmic analysis of a two-class multi-server heterogeneous queueing system with a controllable cross-connectivity
Ibrahim et al. Shortest-Job-First Scheduling in Many-Server Queues with Impatient Customers and Noisy Service-Time Estimates
Ivanova et al. Significant simulation parameters for RESTART/LRE method in teletraffic systems of network of queues
Choi et al. Analysis of priority queueing system based on thresholds and its application to signaling system no. 7 with congestion control
Master et al. An infinite dimensional model for a many server priority queue
Geleji et al. Jitter analysis of an IPP tagged traffic stream in an {IPP, M}/M/1 queue
Mirtchev et al. A generalized Erlang-C model for the enhanced living environment as a service (ELEaaS)
Nada Unfinished work & waiting time of general discrete-time communication systems
Cassandras et al. Introduction to Queueing Theory
Xiong et al. Perfect and nearly perfect sampling of work-conserving queues
Giacomazzi Statistical traffic envelopes for Markov-modulated Poisson packet sources
Chen et al. A probabilistic approach to estimate the mean waiting times in the earliest deadline first polling
Domanska et al. The influence of traffic self-similarity on QoS mechanisms
Al-Bawani et al. Comparison-based FIFO buffer management in QoS switches
Pitts et al. End-to-end QoS bounds for RTP-based service subnetworks
Fendick et al. A heavy-traffic comparison of shared and segregated buffer schemes for queues with the head-of-line processor-sharing discipline
Strzęciwilk Performance analysis of weighted priority queuing systems