Results 1 
6 of
6
On expressing networks with flow transformation in convolutionform
 In Proceedings of IEEE INFOCOM
, 1979
"... Abstract—Convolutionform networks have the property that the endtoend service of network flows can be expressed in terms of a (min;+)convolution of the pernode services. This property is instrumental for deriving endtoend queueing results which fundamentally improve upon alternative results d ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
(Show Context)
Abstract—Convolutionform networks have the property that the endtoend service of network flows can be expressed in terms of a (min;+)convolution of the pernode services. This property is instrumental for deriving endtoend queueing results which fundamentally improve upon alternative results derived by a nodebynode analysis. This paper extends the class of convolutionform networks with stochastic settings to scenarios with flow transformations, e.g., by loss, dynamic routing or retransmissions. In these networks, it is shown that by using the tools developed in this paper endtoend delays grow as O(n) in the number of nodes n; in contrast, by using the alternative nodebynode analysis, endtoend delays grow as O (n2). I.
On the scaling of nonasymptotic capacity in multiaccess networks with bursty traffic
 IN PROC. IEEE ISIT
, 2011
"... The practicality of available (throughput) capacity results in multiaccess networks, which dispense with coding schemes, is often questioned for several reasons including 1) the underlying asymptotic regimes, and 2) the assumption of saturated traffic sources. This paper jointly addresses these li ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
The practicality of available (throughput) capacity results in multiaccess networks, which dispense with coding schemes, is often questioned for several reasons including 1) the underlying asymptotic regimes, and 2) the assumption of saturated traffic sources. This paper jointly addresses these limitations by providing capacity results in nonasymptotic regimes, i.e., holding at all time scales and network sizes, for the very broad class of exponentially bounded burstiness (EBB) traffic sources. Both upper and lower bounds on capacity are derived in terms of probability distributions, which immediately yield all the moments. The explicit and closedform nature of the results enable the investigation of the impact of burstiness on nonasymptotic network capacity. In particular, the results show that for the EBB class the nonasymptotic endtoend capacity rate decays linearly in the number of hops.
The impact of link scheduling on long paths: Statistical analysis and optimal bounds
 IN PROC. OF IEEE INFOCOM
, 2011
"... We study how the choice of packet scheduling algorithms influences endtoend performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling contribution for our analysis is a significantly sharpened method f ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
We study how the choice of packet scheduling algorithms influences endtoend performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling contribution for our analysis is a significantly sharpened method for computing a statistical bound for the service given to a flow by the network as a whole. For a suitably parsimonious traffic model we develop closedform expressions for endtoend delays, backlog, and output burstiness. The deterministic versions of our bounds yield optimal bounds on endtoend backlog and output burstiness for some schedulers, and are highly accurate for endtoend delay bounds.
Statistical Analysis of Link Scheduling on Long Paths
, 2011
"... We study how the choice of packet scheduling algorithms influences endtoend performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling contribution for our analysis is a significantly sharpened method fo ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study how the choice of packet scheduling algorithms influences endtoend performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling contribution for our analysis is a significantly sharpened method for computing a statistical bound for the service given to a flow by the network as a whole. For a suitably parsimonious traffic model we develop closedform expressions for endtoend delays, backlog, and output burstiness. The deterministic versions of our bounds yield optimal bounds on endtoend backlog and output burstiness for some schedulers, and are highly accurate for endtoend delay bounds.
On the Convergence to Fairness in Overloaded FIFO Systems
"... Many of today’s computing and communication systems are based on FIFO queues whose performance, e.g., in terms of throughput and fairness, is highly impacted by load fluctuations, especially in the case of shortterm overload. This paper analytically proves that overloaded FIFO queues are fair in th ..."
Abstract
 Add to MetaCart
(Show Context)
Many of today’s computing and communication systems are based on FIFO queues whose performance, e.g., in terms of throughput and fairness, is highly impacted by load fluctuations, especially in the case of shortterm overload. This paper analytically proves that overloaded FIFO queues are fair in the sense that each flow or aggregate of flows receives a proportional fair share of the service rate. The convergence rate is evaluated with respect to flow sizes and intensity of overutilization for two broad and distinctive arrival classes: Markovian and heavytailed/selfsimilar. For the former class the paper shows smaller convergence times at higher utilizations, which is exactly the opposite behavior characteristic to underloaded queueing systems.
This article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination. IEEE TRANSACTIONS ON SMART GRID 1 Toward a Realistic Performance Analysis of Storage Systems in Smart Grids
"... Abstract—Energy storage devices (ESDs) have the potential to revolutionize the electricity grid by allowing the smoothing of variableenergy generator output and the timeshifting of demand away from peak times. A common approach to study the impact of ESDs on energy systems is by modeling them as e ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—Energy storage devices (ESDs) have the potential to revolutionize the electricity grid by allowing the smoothing of variableenergy generator output and the timeshifting of demand away from peak times. A common approach to study the impact of ESDs on energy systems is by modeling them as electric circuits in simulations. Although recent circuit models are becoming more accurate, to obtain statistically valid results, extensive simulations need to be run. In some cases, existing datasets are not large enough to obtain statistically significant results. The impact of ESDs on energy systems has also been recently studied using analytical methods, but usually by assuming ideal ESD behavior, such as infinite ESD charging and discharging rates, and zero selfdischarge. However, reallife ESDs are far from ideal. We investigate the effect of nonideal ESD behavior on system performance, presenting an analytical ESD model that retains much of the simplicity of an ideal ESD, yet captures many (though not all) nonideal behaviors for a class of ESDs that includes all battery technologies and compressed air energy storage systems. This allows us to compute performance bounds for systems with nonideal ESDs using standard teletraffic techniques. We provide performance results for five widely used ESD technologies and show that our models can closely approximate numerically computed performance bounds. Index Terms—Analytical models, energy storage, performance analysis, renewable energy sources. I.