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

On multiplexing flows : does it hurt or not?

Tools
- Tools
+ Tools

Ciucu, Florin and Poloczek, Felix (2015) On multiplexing flows : does it hurt or not? In: IEEE Infocom 2015, Hong Kong, 26 Apr - 01 May 2015. Published in: 2015 IEEE Conference on Computer Communications (INFOCOM) pp. 1122-1130. ISBN 9781477983810. doi:10.1109/INFOCOM.2015.7218486

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

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

Request Changes to record.

Abstract

This paper analyzes queueing behavior subject to
multiplexing a stochastic process M(n) of flows, and not a
constant as conventionally assumed. By first considering the case
when M(n) is iid, it is shown that flows’ multiplexing ‘hurts’
the queue size (i.e., the queue size increases in distribution). The
simplicity of the iid case enables the quantification of the ‘best’
and ‘worst’ distributions of M(n), i.e., minimizing/maximizing
the queue size. The more general, and also realistic, case when
M(n) is Markov-modulated reveals an interesting behavior:
flows’ multiplexing ‘hurts’ but only when the multiplexed flows
are sufficiently long. An important caveat raised by such observations
is that the conventional approximation of M(n) by a
constant can be very misleading for queueing analysis.

Item Type: Conference Item (Paper)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science, Engineering and Medicine > Science > Computer Science
Library of Congress Subject Headings (LCSH): Queuing theory, Multiplexing, Queuing networks (Data transmission)
Journal or Publication Title: 2015 IEEE Conference on Computer Communications (INFOCOM)
Publisher: IEEE
ISBN: 9781477983810
Official Date: 2015
Dates:
DateEvent
2015Published
2014Accepted
Page Range: pp. 1122-1130
DOI: 10.1109/INFOCOM.2015.7218486
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Date of first compliant deposit: 4 April 2016
Date of first compliant Open Access: 4 April 2016
Funder: Deutsche Forschungsgemeinschaft (DFG)
Grant number: Ci 195/1-1
Conference Paper Type: Paper
Title of Event: IEEE Infocom 2015
Type of Event: Conference
Location of Event: Hong Kong
Date(s) of Event: 26 Apr - 01 May 2015
Related URLs:
  • Organisation

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