Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Sharp per-flow delay bounds for bursty arrivals : the case of FIFO, SP, and EDF scheduling

Tools
- Tools
+ Tools

Ciucu, Florin, Poloczek, Felix and Schmitt, Jens (2014) Sharp per-flow delay bounds for bursty arrivals : the case of FIFO, SP, and EDF scheduling. In: INFOCOM, 2014 Proceedings IEEE, Toronto, ON, 27 Apr - 2 May 2014. Published in: 2014 Proceedings IEEE INFOCOM pp. 1896-1904. doi:10.1109/INFOCOM.2014.6848129 ISSN 0743-166X.

[img]
Preview
PDF
WRAP_Ciucu_sboundscr.pdf - Accepted Version - Requires a PDF viewer.

Download (594Kb) | Preview
Official URL: http://dx.doi.org/10.1109/INFOCOM.2014.6848129

Request Changes to record.

Abstract

The practicality of the stochastic network calculus (SNC) is often questioned on grounds of potential looseness of its performance bounds. In this paper, it is uncovered that for bursty arrival processes (specifically Markov-Modulated On-Off (MMOO)), whose amenability to per-flow analysis is typically proclaimed as a highlight of SNC, the bounds can unfortunately be very loose (e.g., by several orders of magnitude off). In response to this uncovered weakness of SNC, the (Standard) per-flow bounds are herein improved by deriving a general sample-path bound, using martingale based techniques, which accommodates FIFO, SP, and EDF scheduling. The obtained (Martingale) bounds capture an extra exponential decay factor of O (e-αn) in the number of flows n. Moreover, numerical comparisons against simulations show that the Martingale bounds are not only remarkably accurate, but they also improve the Standard SNC bounds by factors as large as 100 or even 1000.

Item Type: Conference Item (Paper)
Subjects: Q Science > QA Mathematics
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH): Queuing theory, Markov processes, Mathematical models
Journal or Publication Title: 2014 Proceedings IEEE INFOCOM
Publisher: IEEE Computer Society
ISSN: 0743-166X
Book Title: IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
Official Date: 2014
Dates:
DateEvent
2014Published
Page Range: pp. 1896-1904
DOI: 10.1109/INFOCOM.2014.6848129
Status: Peer Reviewed
Publication Status: Published
Date of first compliant deposit: 4 April 2016
Date of first compliant Open Access: 4 April 2016
Embodied As: 1
Conference Paper Type: Paper
Title of Event: INFOCOM, 2014 Proceedings IEEE
Type of Event: Conference
Location of Event: Toronto, ON
Date(s) of Event: 27 Apr - 2 May 2014
Related URLs:
  • Publisher

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us