Referenced Items are not available for this document.
Aggregate scheduling in routers merges several flows into one aggregate flow. We propose an approach for computing the end-to-end delay bound of individual flows in a FIFO multiplexer under aggregate scheduling. A synthetic case study exhibits that the end-to-end delay bound is up to 33.6% tighter than the case without considering the traffic peak behavior.
Published in:
Design, Automation & Test in Europe Conference & Exhibition (DATE), 2012
Date of Conference: 12-16 March 2012
- Page(s):
- 538 - 541
- ISSN :
- 1530-1591
- Print ISBN:
- 978-1-4577-2145-8
- INSPEC Accession Number:
- 12656705
- Conference Location :
- Dresden
- Digital Object Identifier :
- 10.1109/DATE.2012.6176457
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
