Capacity reservation for multimedia traffic

Mowbray, Miranda; Karlsson, Gunnar; Köhler, Torsten

doi:10.1088/0967-1846/5/1/002

Cited by 20 publications

(5 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Non-work-conserving schemes are described in [18], [19], [27]. In our architecture we use the non-work-conserving scheme described in [15]. Our contribution described in this section is a further evaluation of the chosen scheme, with experimental and formal justification of its suitability in our service architecture.…”

Section: Packet Scheduling In Routersmentioning

confidence: 99%

See 1 more Smart Citation

A Simplified Guaranteed Service for the Internet

Ossipov

Karlsson

2002

Protocols for High Speed Networks

Self Cite

View full text Add to dashboard Cite

Abstract. An expected growth of real-time traffic in the Internet will place stricter requirements on network performance. We are developing a new simplified service architecture that combines the strengths of the integrated and differentiated services architectures. In this paper we focus on the issues related to providing a guaranteed service in a high-speed network. We give a description of the service, which includes a lightweight signaling protocol and a non-work-conserving scheduling algorithm, and describe the system requirements and the performance evaluation. Our implementation of the protocol allows processing of 30 million signaling messages per second.

show abstract

Section: Packet Scheduling In Routersmentioning

confidence: 99%

“…We suggest a simple way of flow description based on a fixed rate. We further evaluate the non-work-conserving scheduling introduced in [15], and provide formal and experimental justification of its suitability for our service architecture.…”

Section: Introductionmentioning

confidence: 99%

A Simplified Guaranteed Service for the Internet

Ossipov

Karlsson

2002

Protocols for High Speed Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…Many other scheduling mechanisms that limit the delay of a selected flow keep track of a 'deadline' for each queued packet, such as earliest deadline first (EDF) [43,38] and alternative best-effort [26] or use virtual clocks [52]. An overview can be found in [25,40]. Another approach to accommodate delay-sensitive traffic, is to keep queues small by discarding packets before congestion can arise.…”

Section: Introductionmentioning

confidence: 99%

Transform-Domain Analysis of Packet Delay in Network Nodes with QoS-Aware Scheduling

Vuyst

Wittevrongel

Bruneel

2011

Network Performance Engineering

View full text Add to dashboard Cite

Abstract. In order to differentiate the perceived QoS between traffic classes in heterogeneous packet networks, equipment discriminates incoming packets based on their class, particularly in the way queued packets are scheduled for further transmission. We review a common stochastic modelling framework in which scheduling mechanisms can be evaluated, especially with regard to the resulting per-class delay distribution. For this, a discrete-time single-server queue is considered with two classes of packet arrivals, either delay-sensitive (1) or delay-tolerant (2). The steady-state analysis relies on the use of well-chosen supplementary variables and is mainly done in the transform domain. Secondly, we propose and analyse a new type of scheduling mechanism that allows precise control over the amount of delay differentiation between the classes. The idea is to introduce N reserved places in the queue, intended for future arrivals of class 1.

show abstract

“…Jitter can remain controlled as long as the flows are shaped to their peak rate at the network ingress [4]. Also, the deployment of non-work conserving scheduling in routers for the real-time traffic class can be beneficial for controlling jitter [5]. Therefore, we assume that the real-time traffic flows can be shaped to their peak rate at the network ingress and that the scheduling mechanism for the real-time traffic class is priority scheduling with a strict bandwidth limit and with First-In-First-Out (FIFO) service discipline.…”

Section: Introductionmentioning

confidence: 99%

On the Location-Awareness of Bandwidth Allocation and Admission Control for the Support of Real-Time Traffic in Class-Based IP Networks

Georgoulas

Trimintzios

Pavlou

et al. 2006

Autonomic Management of Mobile Multimedia Services

View full text Add to dashboard Cite

Abstract. The support of real-time traffic in class-based IP networks requires reservation of resources, accompanied by admission control in order to guarantee that newly admitted real-time traffic flows do not cause any violation to the Quality of Service (QoS) perceived by the already established ones. In this paper we highlight certain issues with respect to bandwidth allocation and admission control for supporting real-time traffic in class-based IP networks. We investigate the implications of topological placement of both bandwidth allocation and admission control schemes. We show that their performance depends highly on the location of the employed procedures with respect to the end-users and the various network boundaries. We conclude that the strategies for applying these schemes should be location-aware, because their performance at different points in a class-based IP network can be different and can deviate from the expected performance. Through simulations we also provide a quantitative view of these deviations.

show abstract

Capacity reservation for multimedia traffic

Cited by 20 publications

References 18 publications

A Simplified Guaranteed Service for the Internet

A Simplified Guaranteed Service for the Internet

Transform-Domain Analysis of Packet Delay in Network Nodes with QoS-Aware Scheduling

On the Location-Awareness of Bandwidth Allocation and Admission Control for the Support of Real-Time Traffic in Class-Based IP Networks

Contact Info

Product

Resources

About