Tong et al., 2007 - Google Patents
Quantum varying deficit round robin scheduling over priority queuesTong et al., 2007
- Document ID
- 8217533497268423071
- Author
- Tong W
- Zhao J
- Publication year
- Publication venue
- 2007 International Conference on Computational Intelligence and Security (CIS 2007)
External Links
Snippet
At the time of this paper writing, all scheduling algorithms are looking for tradeoffs between low complexity, low latency, and fairness. The priority queuing (PQ) scheduling can meet the requirements of real-time applications but is not good at fairness; sorted priority algorithms …
- 241001522296 Erithacus rubecula 0 title 1
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
- H04L2012/5678—Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management
- H04L2012/5679—Arbitration or scheduling
-
- 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
- H04L2012/5638—Services, e.g. multimedia, GOS, QOS
- H04L2012/5646—Cell characteristics, e.g. loss, delay, jitter, sequence integrity
-
- 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
-
- 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
- H04L47/6215—Individual queue per QOS, rate or priority
-
- 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/2458—Modification of priorities while in transit
-
- 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
- H04L47/6205—Arrangements for avoiding head of line blocking
-
- 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
- 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
- H04L47/00—Traffic regulation in packet switching networks
- H04L47/10—Flow control or congestion control
- H04L47/12—Congestion avoidance or recovery
-
- 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/21—Flow control or congestion control using leaky bucket
- H04L47/215—Token bucket
-
- 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/52—Bandwidth attribution to queues
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/25—Routing or path finding through a switch fabric
- H04L49/253—Connections establishment or release between ports
- H04L49/254—Centralized controller, i.e. arbitration or scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Queuing arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/50—Overload detection; Overload protection
- H04L49/505—Corrective Measures, e.g. backpressure
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/20—Support for services or operations
- H04L49/205—Quality of Service based
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing packet switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATIONS NETWORKS
- H04W72/00—Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
- H04W72/12—Dynamic Wireless traffic scheduling; Dynamically scheduled allocation on shared channel
- H04W72/1205—Schedule definition, set-up or creation
- H04W72/1221—Schedule definition, set-up or creation based on age of data to be sent
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2862301B1 (en) | Multicast to unicast conversion technique | |
| CA2575869C (en) | Hierarchal scheduler with multiple scheduling lanes | |
| CN107733689A (en) | Dynamic weighting polling dispatching strategy process based on priority | |
| Hua et al. | Scheduling design and analysis for end-to-end heterogeneous flows in an avionics network | |
| Guo | SRR: An O (1) time-complexity packet scheduler for flows in multiservice packet networks | |
| Ramabhadran et al. | The stratified round robin scheduler: design, analysis and implementation | |
| JP3623420B2 (en) | Traffic control method | |
| Tong et al. | Quantum varying deficit round robin scheduling over priority queues | |
| Soni et al. | Integrating offset in worst case delay analysis of switched ethernet network with deficit round robbin | |
| US7599381B2 (en) | Scheduling eligible entries using an approximated finish delay identified for an entry based on an associated speed group | |
| Dwekat et al. | A practical fair queuing scheduler: Simplification through quantization | |
| Xiao et al. | Analysis of multi-server round robin scheduling disciplines | |
| Lenzini et al. | Performance analysis of modified deficit round robin schedulers | |
| Martinez et al. | Decoupling the bandwidth and latency bounding for table-based schedulers | |
| Victoria et al. | Efficient bandwidth allocation for packet scheduling | |
| Mohanty et al. | On fair scheduling in heterogeneous link aggregated services | |
| Nikolova et al. | Evaluation of surplus round robin scheduling algorithm | |
| Kos et al. | Sub-Critical Deficit Round Robin | |
| Nandhini | Improved round robin queue management algorithm for elastic and inelastic traffic flows | |
| Liu et al. | Research article packet scheduling in high-speed networks using improved weighted round robin | |
| Al-Khasib et al. | Mini round robin: an enhanced frame-based scheduling algorithm for multimedia networks | |
| Bakiras et al. | Vertical dimensioning: A novel DRR implementation for efficient fair queueing | |
| Yin et al. | Probability based weighted fair queueing algorithm with adaptive buffer management for high-speed network | |
| Hu et al. | Load-balanced differentiated services support switch | |
| Zhu et al. | A new scheduling scheme for resilient packet ring networks with single transit buffer |