A Methodology for Deriving Per-Flow End-to-End Delay Bounds in Sink-Tree DiffServ Domains with FIFO Multiplexing

机译：一种通过FIFO复用推导Sink-树DiffServ域中的每个流的端到端延迟范围的方法

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

In a DiffServ architecture, packets with the same marking are treated as an aggregate at core routers, independently of the flow they belong to. Nevertheless, for the purpose of QoS provisioning, derivation of upper bounds on the delay of individual flows is required. In this paper, we consider the derivation of per-flow end-to-end delay bounds in DiffServ domains where per-egress (or sink-tree) FIFO aggregation is in place. We expose a general methodology to derive delay bounds, and we instantiate it on a case study. We show that the methodology yields a tighter bound than those available from the literature, and we express a worst-case scenario for the case study network, in which the bound is actually achieved.

机译：在DiffServ架构中，具有相同标记的数据包在核心路由器处被视为聚合，而与它们所属的流无关。然而，出于QoS设置的目的，需要推导各个流的延迟的上限。在本文中，我们考虑了在具有逐出（或宿树）FIFO聚合的DiffServ域中逐流端到端延迟范围的推导。我们公开了一种通用方法来推导延迟界限，并在案例研究中实例化它。我们表明，该方法产生的约束比文献中的约束更严格，并且我们为案例研究网络表达了最坏的情况，在这种情况下，实际上已达到了界限。

著录项

来源
《International Symposium on Computer and Information Sciences(ISCIS 2004); 20041027-29; Kemer-Antalya(TR)》|2004年|P.604-614|共11页
会议地点 Kemer-Antalya(TR)
作者
Luciano Lenzini; Linda Martorini; Enzo Mingozzi; Giovanni Stea;
展开▼
作者单位

Dipartimento di Ingegneria dell'Informazione, University of Pisa Via Diotisalvi 2, I-56122 Pisa, Italy;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类计算技术、计算机技术;
关键词

相似文献

外文文献
中文文献
专利

1. Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks [J] . Luciano Lenzini, Linda Martorini, Enzo Mingozzi, Performance Evaluation . 2006,第9a10期

机译：FIFO复用宿树网络中严格的端到端每流延迟范围
2. A Methodology For Computing End-to-end Delay Bounds In Fifo-multiplexing Tandems [J] . Luciano Lenzini, Enzo Mingozzi, Giovanni Stea Performance Evaluation . 2008,第11a12期

机译：Fifo多路复用坦德姆中端到端延迟边界的计算方法
3. Numerical analysis of worst-case end-to-end delay bounds in FIFO tandem networks [J] . Luca Bisti, Luciano Lenzini, Enzo Mingozzi, Real-time systems . 2012,第5期

机译：FIFO串联网络中最坏情况下的端到端延迟范围的数值分析
4. A Methodology for Deriving Per-Flow End-to-End Delay Bounds in Sink-Tree DiffServ Domains with FIFO Multiplexing [C] . Luciano Lenzini, Linda Martorini, Enzo Mingozzi, International Symposium on Computer and Information Sciences . 2004

机译：具有FIFO多路复用的下沉树DiffServ域中的每流端端到端延迟界限的方法
5. Queueing analysis of network multiplexers: Loss ratio and end-to-end delay distribution. [D] . Kim, Han Seok. 2003

机译：网络多路复用器的排队分析：损耗比和端到端延迟分布。
6. Administration of a Synthetic Peptide Derived from the E-domain Region of Mechano-Growth Factor Delays Decompensation Following Myocardial Infarction [O] . KM Shioura, JR Pena, PH Goldspink -1

机译：心肌梗死后机械生长因子的E结构域区域衍生的合成肽的给药延误代偿。
7. Sharp Per-Flow Delay Bounds for Bursty Arrivals: The Case of FIFO, SP, and EDF Scheduling [O] . Florin Ciucu, Felix Poloczek, Jens Schmitt 2016

机译：突发性到达的急剧每流延迟界限：FIFO，sp和EDF调度的情况

A Methodology for Deriving Per-Flow End-to-End Delay Bounds in Sink-Tree DiffServ Domains with FIFO Multiplexing

摘要

著录项

相似文献

相关主题

期刊订阅