Graffi et al., 2007 - Google Patents
Taxonomy of message scheduling strategies in context of peer-to-peer scenariosGraffi et al., 2007
View PDF- Document ID
- 10184282660004240468
- Author
- Graffi K
- Liebau N
- Steinmetz R
- Publication year
- Publication venue
- Technische Universität Darmstadt, Germany, Tech. Rep. Tr-2007-02
External Links
Snippet
Peer-to-peer (P2P) principles have recently attracted a lot of attention in the research community. They are of particular interest for large-scale systems, such as the Internet. P2P systems have no single point of failure because they build on the principle of …
- 230000003068 static 0 description 128
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/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/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/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/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/70—Admission control or resource allocation
- H04L47/82—Miscellaneous aspects
-
- 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/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/10—Flow control or congestion control
- H04L47/20—Policing
-
- 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/15—Flow control or congestion control in relation to multipoint traffic
-
- 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/76—Reallocation of resources, renegotiation of resources, e.g. in-call
- H04L47/762—Reallocation of resources, renegotiation of resources, e.g. in-call triggered by the network
-
- 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
- H04L12/00—Data switching networks
- H04L12/02—Details
-
- 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
-
- 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
- H04L41/5019—Ensuring SLA
-
- 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
- H04L49/00—Packet switching elements
-
- 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 |
---|---|---|
Ramabhadran et al. | Stratified round robin: A low complexity packet scheduler with bandwidth fairness and bounded delay | |
Goyal et al. | Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks | |
Goyal et al. | Generalized guaranteed rate scheduling algorithms: A framework | |
Ramabhadran et al. | The stratified round robin scheduler: design, analysis and implementation | |
Liu et al. | An efficient scheduling discipline for packet switching networks using earliest deadline first round robin | |
CN100466593C (en) | A Realization Method of Integrated Queue Scheduling Supporting Multiple Services | |
CN101212417B (en) | A Time Granularity-Based Internet Service Quality Assurance Method | |
Wang et al. | Integrating priority with share in the priority-based weighted fair queuing scheduler for real-time networks | |
Kaur et al. | Core-stateless guaranteed throughput networks | |
Kanhere et al. | Low-latency guaranteed-rate scheduling using elastic round robin | |
Graffi et al. | Taxonomy of message scheduling strategies in context of peer-to-peer scenarios | |
Jiang | Granular differentiated queueing services for QoS: structure and cost model | |
Wang et al. | Toward statistical QoS guarantees in a differentiated services network | |
Hansson et al. | Response time guarantees for ATM-networked control systems | |
Agharebparast et al. | Efficient fair queuing with decoupled delay-bandwidth guarantees | |
Wang et al. | A study of providing statistical QoS in a differentiated services network | |
Field et al. | V-NET: A versatile network architecture for flexible delay guarantees in real-time networks | |
Kanhere et al. | Prioritized elastic round robin: an efficient and low-latency packet scheduler with improved fairness | |
Mifdaoui et al. | Comparative Analysis of Scheduling Strategies for Heterogeneous Avionics Applications | |
DISC | Anaïs Finzi | |
Tang | Fair medium access control scheme for packet ring networks | |
Hashmi et al. | Comparative analysis of scheduling algorithms for integrated service networks | |
KR100757194B1 (en) | Process packet scheduling device with high resource utilization and low implementation complexity | |
Qian | End-to-end Predictability for Distributed Real-Time Systems | |
Fu | A study on differentiated service queuing scheme with an overflow buffer allocation within a UMTS core network |