Abstract
Many Internet applications are both delay and loss sensitive, and need network performance guarantees that include bandwidth, delay/delay jitter, and packet loss rate. It is very important to quantify and exploit the capabilities of guaranteed service provisioning of communication networks. In this paper, we study the queueing behaviors of non-feedforward networks (a non-feedforward network is a network in which at least one set of acyclic traffic routes forms a cycle; a feedforward network is a network in which any set of acyclic traffic routes does not form a cycle) with FIFO scheduling discipline and Regulated, Markov On-Off, and Fractional Brownian traffic sources. We develop a new methodology to analyze the probabilistic bounds on the delays experienced by traffic. By leveraging the large deviations and fixed-point techniques, we turn probability problems into deterministic optimization problems and translate a probabilistic delay bound into a fixed point of a non-linear real function. Our contribution in this paper is the derivation of a probabilistic bound on the delays experienced by traffic in non-feedforward networks, based on an assumption, i.e., the tail probability of the difference between the beginning time of a busy interval of a server and the earliest arriving time at the corresponding network ingress of the traffic arrivals that arrive at this server during this busy interval can be bounded by the maximum of the violation probabilities of the accumulative upper stream delay bound suffered by this server‘s traffic arrivals. Consequently, our new results not only consummate the theory of stochastic analysis of network performance, but also facilitate the design of protocols and algorithms for non-feedforward networks to provide performance guarantees to various applications with diverse performance requirements.
Similar content being viewed by others
Abbreviations
- C :
-
link/server capacity
- H :
-
maximum number of hops traversed by any flow
- ρ :
-
traffic flow average rate
- ℘:
-
probability transition matrix of Markov chain
- Π:
-
stationary distribution vector of Markov chain
- ℐ:
-
column vector with unit entries
- Θ :
-
Hurst parameter of fractional Brownian motion
- β 2 :
-
variance of traffic flow at t=1
- Ai,h[t]:
-
total flow-i traffic arrivals at its h th hop during [0,t]
- \({\mathcal{Q}}_{l}\) :
-
set of flows that are served by server l
- Al[t]:
-
server-l total traffic arrivals during [0,t]
- \({\mathcal{G}}^{\varepsilon }_{l}(\tau,D)\) :
-
modified statistical traffic envelope of server-l aggregated traffic arrivals experienced delays no more than D before arriving at server l
- D ε :
-
a bound with violation probability ε on the delays experienced by any traffic arrival at any server
- D ε l :
-
a bound with violation probability ε on the delays experienced by any traffic arrival at server l
- \({\overline{D}}^{\varepsilon }\) :
-
minimum bound with violation probability ε on the delays experienced by any traffic arrival at any server
- \({\overline{D}}^{\varepsilon }_{l}\) :
-
minimum bound with violation probability ε on the delays experienced by any traffic arrival at server l
References
Andrews, M. (2004). Instability of FIFO in session-oriented networks. Journal of Algorithms, 50(2), 232–245.
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., & Weiss, W. (1998). An architecture for differentiated services. Internet RFC 2475.
Bonald, T., Proutiere, A., & Roberts, J. (2001). Statistical performance guarantees for streaming flows using expedited forwarding. In Proceedings of IEEE INFOCOM 2001, Anchorage, Alaska, Apr. 2001.
Boorstyn, R. R., Burchard, A., Liebeherr, J., & Oottamakorn, C. (2000). Statistical service assurances for traffic scheduling algorithms. IEEE Journal on Selected Areas in Communications, 18(12), 2651–2664.
Boudec, J.-Y. L., & Thiran, P. (2001). Network calculus. Lecture Notes in Computer Science, vol. 2050. Berlin: Springer.
Bucklew, J. A. (1990). Large deviation techniques in decision, simulation and estimation. New York: Wiley.
Chang, C. S. (1992). Stability, queue length and delay part I: Deterministic queueing networks. In Proceedings of IEEE conference on decision and control (pp. 999–1004), Tucson, AZ, Dec. 1992.
Chang, C. S. (1994). Stability, queue length, and delay of deterministic and stochastic queueing networks. IEEE Transactions on Automatic Control, 39(5), 913–931.
Chang, C. S. (2000). Performance guarantees in communication networks. Berlin: Springer.
Charny, A., & Boudec, J.-Y. L. (2000). Delay bounds in a network with aggregated scheduling. In Proceedings of the first COST 263 international workshop on quality of future Internet services, Berlin, Germany, September 2000.
Choi, B., Xuan, D., Li, C., Bettati, R., & Zhao, W. (2000). Scalable QoS guaranteed communication service for real-time application. In Proceedings of IEEE ICDCS 2000, Taipei, Taiwan, April 2000.
Ciucu, F., Burchard, A., & Liebeherr, J. (2005). A network service curve approach for the stochastic analysis of networks. In Proceedings of ACM SIGMETRICS ’05, Alberta, Canada, June 2005.
Cruz, R. (1991). A calculus for network delay, parts I and II. IEEE Transactions on Information Theory, 37(1), 114–141.
Firoiu, V., Boudec, J.-Y. L., Towsley, D., & Zhang, Z.-L. (2002). Theories and models for Internet quality of service. Proceedings of the IEEE, 90(9), 1565–1591.
Jiang, Y. (2006). A basic stochastic network calculus. In Proceedings of ACM SIGCOMM ’06 (pp. 123–134), Pisa, Italy, Sept. 2006.
Kelly, F. (1996). Notes on effective bandwidths. In Stochastic networks: theory and applications. Oxford: Oxford University Press.
Knightly, E., & Shroff, N. (1999). Admission control for statistical QoS: Theory and practice. IEEE Network, 13(2), 20–29.
Kurose, J. (1992). On computing per-session performance bounds in high-speed multi-hop computer networks. In Proceedings of ACM SIGMETRICS ’92 (pp. 128–139), Newport, RI, June 1992.
Kweon, S. (1998). Real-time communication in integrated services packet networks. PhD dissertation, University of Michigan, 1998.
Li, C., Burchard, A., & Liebeherr, J. (2007). Network calculus with effective bandwidth. IEEE/ACM Transactions on Networking, 15(6), 1442–1453.
Li, C., Raha, A., & Zhao, W. (1997). Stability of ATM networks. In Proceedings of INFOCOM 1997, Kobe, Japan, 1997.
Norros, I. (1995). On the use of fractional brownian motion in the theory of connectionless networks. IEEE Journal on Selected Areas in Communications, 13(6), 953–962.
Parekh, A., & Gallager, R. (1994). A generalized processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Transactions on Networking, 2(2), 137–150.
Philips, T. K., & Nelson, R. (1995). The moment bound is tighter than Chernoff‘s bound for positive tail probabilities. The American Statistician, 49(2), 175–178.
Starobinski, D., Karpovsky, M., & Zakrevski, L. (2003). Application of network calculus to general topologies using turn-prohibition. IEEE/ACM Transactions on Networking, 11(3), 411–421.
Tassiulas, L., & Georgiadis, L. (1996). Any work-conserving policy stabilizes the ring with spatial re-use. IEEE/ACM Transactions on Networking, 4(2), 205–208.
Vojnovic, M., & Boudec, J.-Y. L. (2002). Stochastic analysis of some expedited forwarding networks. In Proceedings of IEEE INFOCOM ’02, New York, 2002.
Zhang, H. (1995). Service disciplines for guaranteed performance service in packet-switching networks. Proceedings of the IEEE, 83(10), 1374–1399.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Li, C., Zhao, W. Stochastic performance analysis of non-feedforward networks. Telecommun Syst 43, 237–252 (2010). https://doi.org/10.1007/s11235-009-9211-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11235-009-9211-8