SCED+: efficient management of quality of service guarantees

No abstract is available for this paper.

• Publication year

  1998

• Venue

  Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98

• Publication date

  1998-03-29

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1109/INFCOM.1998.665083
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services

  2000cited by this paper
• On Deterministic Traffic Regulation and Service Guarantees : A Systematic Approach by Filtering

  1998cited by this paper
• Hierarchical packet fair queueing algorithms

  1997cited by this paper
• High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networks

  1997cited by this paper
• Eecient Network Qos Provisioning Based on per Node Traac Shaping

  1996cited by this paper
• Exact admission control for networks with a bounded delay service

  1996cited by this paper
• Hardware-efficient fair queueing architectures for high-speed networks

  1996cited by this paper
• Group priority scheduling

  1996cited by this paper
• Efficient network QoS provisioning based on per node traffic shaping

  1996cited by this paper
• Bandwidth scheduling for wide-area ATM networks using virtual finishing times

  1996cited by this paper
• Latency-rate servers: a general model for analysis of traffic scheduling algorithms

  1996cited by this paper
• A service-curve approach to performance guarantees in integrated-service networks

  1996cited by this paper
• Network Calculus Made Easy

  1996cited by this paper
• Service Guarantees for Window Flow Control 1

  1996cited by this paper
• Link-sharing and resource management models for packet networks

  1995cited by this paper
• Service disciplines for guaranteed performance service in packet-switching networks

  1995cited by this paper
• Quality of Service Guarantees in Virtual Circuit Switched Networks

  1995cited by this paper
• Scheduling for quality of service guarantees via service curves

  1995cited by this paper
• A New Approach for Allocating Buffers and Bandwidth to Heterogeneous Regulated Traffic in an ATM Node

  1995cited by this paper
• Optimal multiplexing on a single link: delay and buffer requirements

  1994cited by this paper
• On the ability of establishing real-time channels in point-to-point packet-switched networks

  1994cited by this paper
• Rate-Controlled Service Disciplines

  1994cited by this paper
• End-to-End Queueing Delay in ATM Networks

  1994cited by this paper
• The priority token bank: Integrated scheduling and admission control for an integrated-services network

  1993cited by this paper
• Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism

  1992cited by this paper
• Service Burstiness and Dynamic Burstiness Measures: A Framework

  1992cited by this paper
• A calculus for network delay, Part II: Network analysis

  1991cited by this paper
• Congestion-free communication in high-speed packet networks

  1991cited by this paper
• A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case*

  1991cited by this paper
• A calculus for network delay, Part I: Network elements in isolation

  1991cited by this paper
• Analysis and simulation of a fair queueing algorithm

  1989cited by this paper

• Non-linear Programming for the Network Calculus Analysis of FIFO Feedforward Networks

  2025cites this paper
• Minimal Per-Flow Backlog Bounds at an Aggregate FIFO Server under Piecewise-Linear Arrival Curves

  2025cites this paper
• Network Synthesis under Delay Constraints: The Power of Network Calculus Differentiability

  2022cites this paper
• Network Calculus With Flow Prolongation – A Feedforward FIFO Analysis Enabled by ML

  2022cites this paper
• Scalable Damper-based Deterministic Networking

  2022cites this paper
• Constant Delay Switching: Asynchronous Traffic Shaping with Jitter Control

  2022cites this paper
• Tightening Network Calculus Delay Bounds by Predicting Flow Prolongations in the FIFO Analysis

  2021cites this paper
• Analysis of Dampers in Time-Sensitive Networks With Non-Ideal Clocks

  2021influential citation
• Multi-interface Communication: Interface Selection Under Statistical Performance Constraints

  2018cites this paper
• A Fluid-Flow Interpretation of SCED Scheduling

  2018cites this paper
• Duality of the Max-Plus and Min-Plus Network Calculus

  2017cites this paper
• End-to-End Backlog and Delay Bound Analysis for Multi-Hop Vehicular Ad Hoc Networks

  2017cites this paper
• Scheduling Strategy for Multimedia Heterogeneous High-Speed Train Networks

  2017cites this paper
• Stochastic Upper and Lower Bounds for General Markov Fluids

  2016cites this paper
• SNC-Meister: Admitting More Tenants with Tail Latency SLOs

  2016cites this paper
• Advances in Theory and Applicability of Stochastic Network Calculus

  2016cites this paper
• IMPLEMENTATION OF DIFFERENTIAL SERVICES BASED ON PRIORITY, TOKEN BUCKET, ROUND ROBIN ALGORITHMS

  2015cites this paper
• proposal : Meeting tail latency SLOs in shared networked storage

  2015cites this paper
• Modeling and Performance Analysis of Networks with Flow Transformations

  2015cites this paper
• Scheduling analysis with martingales

  2014cites this paper
• Network calculus for parallel processing

  2014cites this paper
• Sharp per-flow delay bounds for bursty arrivals: The case of FIFO, SP, and EDF scheduling

  2014influential citation
• Sharp bounds in stochastic network calculus

  2013cites this paper
• Non-asymptotic performance evaluation and sampling-based parameter estimation for communication networks with long memory traffic

  2013cites this paper
• Modular Methodology for the Network Calculus in a Time-Varying Context

  2013cites this paper
• Scalable Trajectory Approach for ensuring deterministic guarantees in large networks. (Passage à l'échelle de l'approche par trajectoire dans de larges réseaux)

  2013cites this paper
• A leftover service curve approach to analyze demultiplexing in queueing networks

  2012cites this paper
• Design and implementation of a differentiated service based qos model for real-time interactive traffic on constrained bandwidth ip networks

  2012cites this paper
• Perspectives on network calculus: no free lunch, but still good value

  2012cites this paper
• Validation of a DiffServ based QoS model implementation for real-time traffic in a test bed

  2012cites this paper
• On delay stable communications in asynchronous networks

  2012cites this paper
• A real-time data aggregation method for fault-tolerant wireless sensor networks

  2012cites this paper
• On the Impact of Link Scheduling on End-to-End Delays in Large Networks

  2011cites this paper
• Providing quality of service in packet switched networks

  2011cites this paper
• On the convergence to fairness in overloaded FIFO systems

  2011cites this paper
• Q O S OPTIMIZATION THROUGH CAPACITY AGGREGATION OF MULTIPLE LINKS IN HETEROGENEOUS WIRELESS NETWORKS

  2011cites this paper
• A General Framework for Parameterized Schedulability Bound Analysis of Real-Time Systems

  2010cites this paper
• On the Impact of Packet Scheduling on End-to-End Delays in Large Networks

  2010influential citation
• Strategies for adaptive smoothing and rebuffering via dynamic network calculus

  2010cites this paper
• EFFECTIVE VOICE CALLS ADMISSION FOR AUTHORIZED USER IN INTER VOIP NETWORK

  2010cites this paper
• An admission control approach for multifractal network traffic flows using effective envelopes

  2010cites this paper
• Tight Arrival Curve at the Output of a Work-Conserving Blind Multiplexing Server

  2010cites this paper
• On Computing Bounds on Average Backlogs and Delays with Network Calculus

  2010cites this paper
• Does Link Scheduling Matter on Long Paths?

  2010cites this paper
• Performance bounds in wormhole routing, a network calculus approach

  2010cites this paper
• Computation and Tightness Assessment of End-to-end Delay Bounds in FIFO-multiplexing Tandems 1

  2010cites this paper
• Analysis of Multi-Server Scheduling Paradigm for Service Guarantees during Network Mobility

  2010cites this paper
• J ul 2 00 5 An End-to-End Probabilistic Network Calculus with Moment Generating Functions for Efficient Utilization of Independence ∗

  2009cites this paper
• Scaling of buffer and capacity requirements of voice traffic in packet networks

  2009cites this paper
• Survey of deterministic and stochastic service curve models in the network calculus

  2009influential citation
• A Service-Curve Framework for Packet Scheduling With Switch Configuration Delays

  2008cites this paper
• Stochastic Analysis of Expected Schedulability for Real-Time Tasks on a Single Computing System

  2008cites this paper
• Dioid of formal power series for the determination of performance parameters of communication networks

  2008cites this paper
• Estimating the worst-case delay in FIFO tandems using network calculus

  2008cites this paper
• Towards Delay Assurances in FIFO Networks

  2007cites this paper
• Validating the sensor network calculus by simulations

  2007cites this paper
• End-to-end delay bounds in FIFO-multiplexing tandems

  2007cites this paper
• A Network Calculus With Effective Bandwidth

  2007cites this paper
• On efficient quality of service provisioning in the next generation internet.

  2007cites this paper
• On the way to a distributed systems calculus: an end-to-end network calculus with data scaling

  2006cites this paper
• Quality of service guarantees for FIFO queues with constrained inputs

  2006influential citation
• Per-domain packet scale rate guarantee for expedited forwarding

  2006cites this paper
• A Min-Plus Calculus for End-to-End Statistical Service Guarantees

  2006cites this paper
• Providing guaranteed rate services in the load balanced Birkhoff-von Neumann switches

  2006cites this paper
• Utilization-based delay guarantee techniques and their applications

  2006cites this paper
• Resource Sharing in the Most Regular Scheduling: Deterministic Performance and Guarantee

  2006cites this paper
• Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks

  2006cites this paper
• Worst case burstiness increase due to arbitrary aggregate multiplexing

  2006cites this paper
• The DISCO network calculator: a toolbox for worst case analysis

  2006cites this paper
• Supporting Excess Real-Time Traffic With Active Drop Queue

  2006influential citation
• Performance Bounds in Feed−Forward Networks under Blind Multiplexing

  2006cites this paper
• A Dual Approach to Network Calculus Applying the Legendre Transform

  2005cites this paper
• Server Models for Probabilistic Network Calculus

  2005cites this paper
• Traffic shaping in aggregate-based networks: implementation and analysis

  2005cites this paper
• On schedulability bounds of static priority schedulers

  2005cites this paper
• An End-to-End Probabilistic Network Calculus with Moment Generating Functions

  2005cites this paper
• Understanding how to provide service guarantees in ip-based networks

  2005cites this paper
• Scalable quality of service across multiple domains

  2005cites this paper
• Providing absolute differentiated services for real-time applications in static-priority scheduling networks

  2004cites this paper
• A Class of Shaped Deficit Round-Robin (SDRR) Schedulers

  2004cites this paper
• A novel analytical framework compounding statistical traffic modeling and aggregate-level service curve disciplines: network performance and efficiency implications

  2004cites this paper
• Path Allocation in Backbone Networks: Project Report

  2004cites this paper
• Stateless Core: A Scalable Approach for Quality of Service in the Internet

  2004cites this paper
• Link-Based Fair Aggregation: A Simple Approach to Scalable Support of Per-Flow Service Guarantees

  2004cites this paper
• QOS PROVISIONING IN GENERALIZED PROCESSOR SHARING NETWORKS

  2004cites this paper
• A parameter based admission control for differentiated services networks

  2004cites this paper
• Per-domain packet scale rate guarantee for expedited forwarding

  2003influential citation
• A Service Abstraction with Applications to Network Calculus

  2003cites this paper
• On the Impacts of Traffic Shaping on End-to-End Delay Bounds in Aggregate Scheduling Networks

  2003cites this paper
• Extending the Network Calculus Pay Bursts Only Once Principle to Aggregate Scheduling

  2003cites this paper
• Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds

  2003cites this paper
• Statistical per-flow service bounds in a network with aggregate provisioning

  2003cites this paper
• On Scalable Support of Quality of Services in the Internet

  2003cites this paper
• Providing guaranteed rate services in the load balanced Birkhoff-von Neumann switches

  2003cites this paper
• Network Calculus

  2002cites this paper
• Theories and models for Internet quality of service

  2002cites this paper
• Supporting Excess Real-time Traffic with Active Drop Queue : Linux Kernel Implementation Overview

  2002cites this paper
• Statistical Quality of Service Assurances Using Probabilistic Envelopes

  2002cites this paper
• A Class of Rate-Based Real-Time Scheduling Algorithms

  2002influential citation
• Some properties of variable length packet shapers

  2002cites this paper