J.-Y. L. Boudec and M. Vojnovic. Stochastic analysis of some expedited forwarding networks. In IEEE Infocom'02, New York, NY, June 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Packet Scale Rate Guarantee for non-FIFO Nodes - Le Boudec, Charny (2003) (2 citations) (Correct)
....curve. Being able to bound delay from backlog is useful in networks that use statistical multiplexing; typically there, the available buffer B at a node is less than the worst case buffer, and bounding the backlog by B can be used to deduce a bound on delay, using the delay from backlog bound [12]. Applications that need a strict delay bound and small loss are interactive audio and circuit emulation, which employ some form of FEC to correct for losses. For such applications, small network buffers are required. The alternative of having potentially large buffers in the network and having ....
M. Vojnovic and Le Boudec J.-Y., "Stochastic analysis of some expedited forwarding networks," in Proceedings of Infocom 2002.
Statistical Characterization for Per-Hop QoS - Gendy, Bose, Wang, Shin (Correct)
....and priority scheduling) and two packet marking mechanisms (edge discarding and marking) They used analytical methods in estimating the loss and delay behaviors using different combinations of these mechanisms. A rigorous theoretical study to find probabilistic bounds for EF was presented in [21]. The authors used a combination of queueing theory and network calculus to obtain delay bounds for backlogs of heterogeneous traffic as well as traffic regulated by a leaky bucket. They also derived bounds on loss ratio under statistical multiplexing of EF input flows. Our approach is purely ....
M. Vojnovic and J. L. Boudec, "Stochastic analysis of some expedited forwarding networks," in proceedings of INFOCOM'02, New York, June 2002. A Appendix The input factors (I a and C) used in each experiment scenario are listed in Tables 13, 14, and 15 for EF-EDGE, EF-CORE, and EF-CBQ, respectively.
Packet Scale Rate Guarantee for non-FIFO Nodes - Le Boudec, Charny (2 citations) (Correct)
....curve. Being able to bound delay from backlog is useful in networks that use statistical multiplexing; typically there, the available buffer B at a node is less than the worst case buffer, and bounding the backlog by B can be used to deduce a bound on delay, using the delay from backlog bound [11]. The goal of this paper is to examine these properties for non FIFO nodes (work conserving or not) Indeed, in practice, many devices cannot be accurately described by a FIFO model. Even when all packets of the aggregate share a single FIFO queue at the output (a standard DiffServ assumption) ....
M. Vojnovic and Le Boudec J.-Y., "Stochastic analysis of some expedited forwarding networks," in Proceedings of Infocom 2002.
Packet Scale Rate Guarantee for non-FIFO Nodes - Le Boudec, Charny (2002) (2 citations) (Correct)
....curve. Being able to bound delay from backlog is useful in networks that use statistical multiplexing; typically there, the available buffer B at a node is less than the worst case buffer, and bounding the backlog by B can be used to deduce a bound on delay, using the delay from backlog bound [11]. The goal of this paper is to examine these properties for non FIFO nodes (work conserving or not) Indeed, in practice, many devices cannot be accurately described by a FIFO model. Even when all packets of the aggregate share a single FIFO queue at the output (a standard DiffServ assumption) ....
M. Vojnovic and Le Boudec J.-Y., "Stochastic analysis of some expedited forwarding networks," in Proceedings of Infocom 2002.
A Theory of Deterministic Queuing Systems for the Internet - Le Boudec, Thiran (2003) (2 citations) Self-citation (Le boudec) (Correct)
No context found.
J. Y. Le Boudec M. Vojnovic. Stochastic analysis of some expedited forwarding networks. In Proceedings of Infocom 2002.
NETWORK CALCULUS Parts II and III - A Theory of.. - Le Boudec, Thiran (2004) Self-citation (Le boudec) (Correct)
No context found.
J. Y. Le Boudec M. Vojnovic. Stochastic analysis of some expedited forwarding networks. In Proceedings of Infocom 2002.
Theories and Models for Internet Quality of Service - Firoiu, Le Boudec, Towsley.. (2002) (7 citations) Self-citation (Le boudec) (Correct)
No context found.
M. Vojnovic and J.-Y. Le Boudec, "Stochastic analysis of some expedited forwarding networks, " Tech. Rep. DSC2001.
Bounds for Independent Regulated Inputs Multiplexed in a.. - Vojnovic, Le Boudec (2003) (6 citations) Self-citation (Vojnovi Le boudec) (Correct)
....to the bound of Theorem 3. For high load, the bound of Theorem 4 is fairly close to the bound of Theorem 3, except for the buffer beyond certain value when it deviates in a conservative direction. One can combine the bounds obtained in the derivation of Theorem 4 and 5 to obtain a better bound [22]. VI. CONCLUDING REMARKS Note that all the bounds in this paper, and thus the original bounds in [1] and [2] are applications of Hoeffding s inequalities [18] The method used in this paper consists of stochastic comparisons and Hoeffding s inequalities; the method also extends to bounding ....
.... and thus the original bounds in [1] and [2] are applications of Hoeffding s inequalities [18] The method used in this paper consists of stochastic comparisons and Hoeffding s inequalities; the method also extends to bounding probabilities of other events of interest, e.g. for delay and loss [22], 23] ....
M. Vojnovi c and J.-Y. Le Boudec, "Stochastic analysis of some expedited forwarding networks," in Proc. of IEEE INFOCOM 2002.
Bounds for Independent Regulated Inputs Multiplexed in a.. - Vojnovic, Le Boudec (6 citations) Self-citation (Vojnovi Le boudec) (Correct)
....3. For high load, the bound of Theorem 4 is fairly close to the bound of Theorem 3, except for the buffer level beyond certain value when it deviates in a conservative direction. One can combine the bounds obtained in the derivation of Theorem 4 and 5 to obtain a better bound; this is shown in [23]. 0 100 200 300 400 500 600 700 Theorem 4 Theorem 5 0 100 200 300 400 500 600 700 Theorem 4 Theorem 5 0 100 200 300 400 500 600 700 Theorem 3 Theorem 4 r=0.5 r=0.8 Fig. 4. Bounds of Theorems 3, 4, and 5, for the homogeneous case. The graphs are given for the loads , 0.5, and ....
.... and thus the original bounds in [1] and [2] are applications of Hoeffding s inequalities [19] The method used in this paper consists of stochastic comparisons and Hoeffding s inequalities; the method also extends to bounding probabilities of other events of interest, e.g. for delay and loss [23], 24] ....
M. Vojnovi c and J.-Y. Le Boudec, "Stochastic analysis of some expedited forwarding networks," in Proc. of IEEE INFOCOM 2002.
Packet Scale Rate Guarantee for non-FIFO Nodes - Le Boudec, Charny (2 citations) Self-citation (Le boudec) (Correct)
....curve. Being able to bound delay from backlog is useful in networks that use statistical multiplexing; typically there, the available buffer # at a node is less than the worst case buffer, and bounding the backlog by # can be used to deduce a bound on delay, using the delay from backlog bound [11]. The goal of this paper is to examine these properties for non FIFO nodes. Indeed, in practice, many devices cannot be accurately described by a FIFO model. Even when all packets of the aggregate share a single FIFO queue at the output (a standard DiffServ assumption) packets of the aggregate ....
M. Vojnovic and J.-Y. Le Boudec, "Stochastic analysis of some expedited forwarding networks, " Tech. Rep. DSC2001.
Advances in Internet Quality of Service - Firoiu, Le Boudec, Towsley, Zhang (6 citations) Self-citation (Le boudec) (Correct)
.... ## #### ### # ### # # ### # ### ### ### # ## ### # ### ## ### # # # # # ### # ### ### ### # # ## ### ### ##### # ### ### ### #### ### # ######### which, for #### # ## and # # # # is the bound in [82] Taking the minimum over a set of partitions # gives a better bound [83] See [85] for the general case where # # s are not identical. Application to DiffServ(EF) The bounds can be used for statistical guarantees. First, an EF node can be modeled as a rate latency service curve. Second, it is necessary to account for traffic inside the network. Chang et al. [82] propose the ....
....#,but# ### ### # # ### ## # ## may be decomposed from its constituent microflows at network access, which are assumed to be independent. This majorization also accounts for possible packet losses between network access and node #. Then the bounds seen above can be applied. Vojnovic et al. ([85], Theorem 2) show how this can be used to compute congestion probabilities, given that only aggregate information is available, as is usual with DiffServ. Loss ratios may differ from congestion probabilities, because packet losses do not necessarily affect all microflows in the same way. In [85] ....
[Article contains additional citation context not shown here]
M. Vojnovic and J.-Y. Le Boudec, "Stochastic analysis of some expedited forwarding networks, " Tech. Rep. DSC
Probabilistic Delay Guarantees Using Delay Distribution.. - Gopalan, Chiueh, Lin (2004) (Correct)
No context found.
J.-Y. L. Boudec and M. Vojnovic. Stochastic analysis of some expedited forwarding networks. In IEEE Infocom'02, New York, NY, June 2002.
A Network Calculus with Effective Bandwidth - Li, Burchard, Liebeherr (2003) (Correct)
No context found.
M. Vojnovic and J.-Y. Le Boudec. Stochastic analysis of some expedited forwarding networks. In Proceedings of IEEE Infocom 2002.
Buffer Overflow Bounds for Multiplexed Regulated.. - Guillemin, Likhanov, .. (Correct)
No context found.
M. Vojnovic and J-Y. Le Boudec, "Stochastic analysis of some expedited forwarding networks," in Proceedings of the IEEE INFOCOM 2002.
Statistical Point-to-Set Edge-Based Quality of Service.. - Raghunath, Kalyanaraman (Correct)
No context found.
M. Vojnovic and J.-Y. Le Boudec, "Stochastic Analysis of Some Expedited Forwarding Networks," IEEE INFOCOM 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC