Capacity reservation for multimedia traffic
Reads0
Chats0
TLDR
A new scheduling algorithm for multimedia traffic using capacity reservation appears to give a noticeably improved quality of service to delay-sensitive traffic.Abstract:
We introduce a new scheduling algorithm for multimedia traffic using capacity reservation. We compare it with other algorithms in the literature. It has been implemented and its worst-case performance has been analysed. It appears to give a noticeably improved quality of service to delay-sensitive traffic.read more
Citations
More filters
Book ChapterDOI
SOS: sender oriented signaling for a simplified guaranteed service
Evgueni Ossipov,Gunnar Karlsson +1 more
TL;DR: SOS - a simple signaling protocol for guaranteed service connections overcomes poor scalability of RSVP and is simpler than existing proposals: it does not require per-flow soft states in core routers; it is robust and can handle losses of all types of signaling messages.
Book ChapterDOI
A Simplified Guaranteed Service for the Internet
Evgueni Ossipov,Gunnar Karlsson +1 more
TL;DR: This paper focuses on the issues related to providing a guaranteed service in a high-speed network, and gives a description of the service, which includes a lightweight signaling protocol and a non-work-conserving scheduling algorithm.
Journal ArticleDOI
Cross-layer quality-based resource reservation for scalable multimedia
TL;DR: A novel static reservation scheme for VBR multimedia traffic that takes into account the end-user Quality of Experience (QoE) and applies a two-step process that uses a simple video model and a Markov queue model for the reservation.
Proceedings Article
Analysis of a discrete-time priority queue with place reservations and geometric service times
Book ChapterDOI
On the location-awareness of bandwidth allocation and admission control for the support of real-time traffic in class-based IP networks
TL;DR: The implications of topological placement of both bandwidth allocation and admission control schemes show that their performance depends highly on the location of the employed procedures with respect to the end-users and the various network boundaries, and conclude that the strategies for applying these schemes should be location-aware.
References
More filters
Journal ArticleDOI
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
Abhay Parekh,Robert G. Gallager +1 more
TL;DR: Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments.
Journal ArticleDOI
Analysis and simulation of a fair queueing algorithm
TL;DR: In this article, a fair gateway queueing algorithm based on an earlier suggestion by Nagle is proposed to control congestion in datagram networks, based on the idea of fair queueing.
Proceedings ArticleDOI
Analysis and simulation of a fair queueing algorithm
TL;DR: It is found that fair queueing provides several important advantages over the usual first-come-first-serve queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth and protection from ill-behaved sources.
Journal ArticleDOI
A calculus for network delay. I. Network elements in isolation
TL;DR: A calculus is developed for obtaining bounds on delay and buffering requirements in a communication network operating in a packet switched mode under a fixed routing strategy, and burstiness constraints satisfied by the traffic that exits the element are derived.
Journal ArticleDOI
Service disciplines for guaranteed performance service in packet-switching networks
TL;DR: Several service disciplines that are proposed in the literature to provide per-connection end-to-end performance guarantees in packet-switching networks are surveyed and a general framework for studying and comparing these disciplines is presented.