Elastic flows with deadlines a QoS abstraction for middleware

Raja R. Harinath, Jaideep Srivastava

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Media flows have been classified into streaming flows and elastic flows. Traditionally, admission control schemes, in middleware systems and otherwise, have dealt with streaming flows. In the Internet context, elastic TCP flows have been considered for admission control more recently - the aim being to ensure that they actually complete. In this paper, we present a simple reservation-based abstraction for middleware systems: an elastic flow with deadlines, that includes streaming flows as a special case. We use this specification in a simple model of a link. We then present a novel way to view the problem, as a maximum network flow problem. We show that this formulation also provides an admissible schedule for the flows. We then study the incremental version of the admission control problem, and present some heuristics. We finally briefly explore potential applications of this abstraction.

Original languageEnglish
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
EditorsN. Venkatasubramanian
Pages136-147
Number of pages12
Volume5305
DOIs
Publication statusPublished - 2004
Externally publishedYes
EventMultimedia Computing and Networking 2004 - San Jose, CA, United States
Duration: 21 Jan 200422 Jan 2004

Other

OtherMultimedia Computing and Networking 2004
CountryUnited States
CitySan Jose, CA
Period21/1/0422/1/04

Fingerprint

Middleware
Access control
Quality of service
Internet
Specifications
elastic systems
schedules
specifications
formulations

Keywords

  • Admission control
  • Distributed middleware
  • QoS abstraction
  • Resource reservation in advance

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

Cite this

Harinath, R. R., & Srivastava, J. (2004). Elastic flows with deadlines a QoS abstraction for middleware. In N. Venkatasubramanian (Ed.), Proceedings of SPIE - The International Society for Optical Engineering (Vol. 5305, pp. 136-147) https://doi.org/10.1117/12.538797

Elastic flows with deadlines a QoS abstraction for middleware. / Harinath, Raja R.; Srivastava, Jaideep.

Proceedings of SPIE - The International Society for Optical Engineering. ed. / N. Venkatasubramanian. Vol. 5305 2004. p. 136-147.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harinath, RR & Srivastava, J 2004, Elastic flows with deadlines a QoS abstraction for middleware. in N Venkatasubramanian (ed.), Proceedings of SPIE - The International Society for Optical Engineering. vol. 5305, pp. 136-147, Multimedia Computing and Networking 2004, San Jose, CA, United States, 21/1/04. https://doi.org/10.1117/12.538797
Harinath RR, Srivastava J. Elastic flows with deadlines a QoS abstraction for middleware. In Venkatasubramanian N, editor, Proceedings of SPIE - The International Society for Optical Engineering. Vol. 5305. 2004. p. 136-147 https://doi.org/10.1117/12.538797
Harinath, Raja R. ; Srivastava, Jaideep. / Elastic flows with deadlines a QoS abstraction for middleware. Proceedings of SPIE - The International Society for Optical Engineering. editor / N. Venkatasubramanian. Vol. 5305 2004. pp. 136-147
@inproceedings{34737abc08e645a8aa92768aa10bd17e,
title = "Elastic flows with deadlines a QoS abstraction for middleware",
abstract = "Media flows have been classified into streaming flows and elastic flows. Traditionally, admission control schemes, in middleware systems and otherwise, have dealt with streaming flows. In the Internet context, elastic TCP flows have been considered for admission control more recently - the aim being to ensure that they actually complete. In this paper, we present a simple reservation-based abstraction for middleware systems: an elastic flow with deadlines, that includes streaming flows as a special case. We use this specification in a simple model of a link. We then present a novel way to view the problem, as a maximum network flow problem. We show that this formulation also provides an admissible schedule for the flows. We then study the incremental version of the admission control problem, and present some heuristics. We finally briefly explore potential applications of this abstraction.",
keywords = "Admission control, Distributed middleware, QoS abstraction, Resource reservation in advance",
author = "Harinath, {Raja R.} and Jaideep Srivastava",
year = "2004",
doi = "10.1117/12.538797",
language = "English",
volume = "5305",
pages = "136--147",
editor = "N. Venkatasubramanian",
booktitle = "Proceedings of SPIE - The International Society for Optical Engineering",

}

TY - GEN

T1 - Elastic flows with deadlines a QoS abstraction for middleware

AU - Harinath, Raja R.

AU - Srivastava, Jaideep

PY - 2004

Y1 - 2004

N2 - Media flows have been classified into streaming flows and elastic flows. Traditionally, admission control schemes, in middleware systems and otherwise, have dealt with streaming flows. In the Internet context, elastic TCP flows have been considered for admission control more recently - the aim being to ensure that they actually complete. In this paper, we present a simple reservation-based abstraction for middleware systems: an elastic flow with deadlines, that includes streaming flows as a special case. We use this specification in a simple model of a link. We then present a novel way to view the problem, as a maximum network flow problem. We show that this formulation also provides an admissible schedule for the flows. We then study the incremental version of the admission control problem, and present some heuristics. We finally briefly explore potential applications of this abstraction.

AB - Media flows have been classified into streaming flows and elastic flows. Traditionally, admission control schemes, in middleware systems and otherwise, have dealt with streaming flows. In the Internet context, elastic TCP flows have been considered for admission control more recently - the aim being to ensure that they actually complete. In this paper, we present a simple reservation-based abstraction for middleware systems: an elastic flow with deadlines, that includes streaming flows as a special case. We use this specification in a simple model of a link. We then present a novel way to view the problem, as a maximum network flow problem. We show that this formulation also provides an admissible schedule for the flows. We then study the incremental version of the admission control problem, and present some heuristics. We finally briefly explore potential applications of this abstraction.

KW - Admission control

KW - Distributed middleware

KW - QoS abstraction

KW - Resource reservation in advance

UR - http://www.scopus.com/inward/record.url?scp=8844280058&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=8844280058&partnerID=8YFLogxK

U2 - 10.1117/12.538797

DO - 10.1117/12.538797

M3 - Conference contribution

VL - 5305

SP - 136

EP - 147

BT - Proceedings of SPIE - The International Society for Optical Engineering

A2 - Venkatasubramanian, N.

ER -