Details
| Original language | English |
|---|---|
| Title of host publication | INFOCOM 2008 |
| Subtitle of host publication | 27th IEEE Communications Society Conference on Computer Communications |
| Pages | 2342-2350 |
| Number of pages | 9 |
| Publication status | Published - 2008 |
| Externally published | Yes |
| Event | INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications - Phoenix, AZ, United States Duration: 13 Apr 2008 → 18 Apr 2008 |
Publication series
| Name | Proceedings - IEEE INFOCOM |
|---|---|
| ISSN (Print) | 0743-166X |
Abstract
Network calculus has proven as a valuable and versatile methodology for worst-case analysis of communication networks. One issue in which it is still lacking is the treatment of aggregate multiplexing, in particular if the FIFO property cannot be assumed when flows are merged. In this paper, we address the problem of bounding the delay of individual traffic flows in feed-forward networks under arbitrary multiplexing. Somewhat surprisingly, we find that direct application of network calculus results in loose bounds even in seemingly simple scenarios. The reasons for this "failure" of network calculus are discussed in detail and a method to arrive at tight delay bounds for arbitrary (aggregate) multiplexing is presented. This method is based on the solution of an optimization problem. For the special case of sink-tree networks this optimization problem is solved explicitly, thus arriving at a closed-form expression for the delay bound. Numerical experiments illustrate that in sink-tree networks the improvement over bounds based on direct application of network calculus can be considerable.
Keywords
- Arbitrary multiplexing, Feed-forward networks, Network calculus, Performance bounds, Performance evaluation
ASJC Scopus subject areas
- Computer Science(all)
- General Computer Science
- Engineering(all)
- Electrical and Electronic Engineering
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications. 2008. p. 2342-2350 4509823 (Proceedings - IEEE INFOCOM).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Delay Bounds under Arbitrary Multiplexing
T2 - INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
AU - Schmitt, Jens B.
AU - Zdarsky, Frank A.
AU - Fidler, Markus
PY - 2008
Y1 - 2008
N2 - Network calculus has proven as a valuable and versatile methodology for worst-case analysis of communication networks. One issue in which it is still lacking is the treatment of aggregate multiplexing, in particular if the FIFO property cannot be assumed when flows are merged. In this paper, we address the problem of bounding the delay of individual traffic flows in feed-forward networks under arbitrary multiplexing. Somewhat surprisingly, we find that direct application of network calculus results in loose bounds even in seemingly simple scenarios. The reasons for this "failure" of network calculus are discussed in detail and a method to arrive at tight delay bounds for arbitrary (aggregate) multiplexing is presented. This method is based on the solution of an optimization problem. For the special case of sink-tree networks this optimization problem is solved explicitly, thus arriving at a closed-form expression for the delay bound. Numerical experiments illustrate that in sink-tree networks the improvement over bounds based on direct application of network calculus can be considerable.
AB - Network calculus has proven as a valuable and versatile methodology for worst-case analysis of communication networks. One issue in which it is still lacking is the treatment of aggregate multiplexing, in particular if the FIFO property cannot be assumed when flows are merged. In this paper, we address the problem of bounding the delay of individual traffic flows in feed-forward networks under arbitrary multiplexing. Somewhat surprisingly, we find that direct application of network calculus results in loose bounds even in seemingly simple scenarios. The reasons for this "failure" of network calculus are discussed in detail and a method to arrive at tight delay bounds for arbitrary (aggregate) multiplexing is presented. This method is based on the solution of an optimization problem. For the special case of sink-tree networks this optimization problem is solved explicitly, thus arriving at a closed-form expression for the delay bound. Numerical experiments illustrate that in sink-tree networks the improvement over bounds based on direct application of network calculus can be considerable.
KW - Arbitrary multiplexing
KW - Feed-forward networks
KW - Network calculus
KW - Performance bounds
KW - Performance evaluation
UR - http://www.scopus.com/inward/record.url?scp=51449102715&partnerID=8YFLogxK
U2 - 10.1109/INFOCOM.2007.228
DO - 10.1109/INFOCOM.2007.228
M3 - Conference contribution
AN - SCOPUS:51449102715
SN - 9781424420261
T3 - Proceedings - IEEE INFOCOM
SP - 2342
EP - 2350
BT - INFOCOM 2008
Y2 - 13 April 2008 through 18 April 2008
ER -