Bandwidth Sharing Networks with Multiscale Traffic

Published Online:https://doi.org/10.1287/11-SSY053

References

  • Billingsley, P. (1999). Convergence of Probability Measures (second edition). Wiley Series in Probability and Statistics. Wiley-Interscience. MR1700749Google Scholar
  • Bonald, T. and Massoulié, L. (2001). Impact of fairness on Internet performance. In Proceedings of ACM SIGMETRICS/Performance 82–91.Google Scholar
  • Bonald, T. and Proutière, A. (2003). Insensitive bandwidth sharing in data networks. Queueing Syst. Theory Appl. 44 69–100. MR1989867Google Scholar
  • Bonald, T. and Proutière, A. (2004). On performance bounds for the integration of elastic and adaptive streaming flows. In SIGMETRICS 235–245.Google Scholar
  • Bonald, T., Massoulié, L., Proutière, A. and Virtamo, J. (2006). A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Syst. Theory Appl. 53 65–84. MR2230014Google Scholar
  • Borst, S. C., Jonckheere, M. and Leskelä, L. (2008). Stability of parallel queueing systems with coupled service rates. Discrete Event Dyn. Syst. 18 447–472. MR2443653Google Scholar
  • C. Kipnis, C. L. (1991). Scaling Limits of Interacting Particle Systems. Springer. MR1707314Google Scholar
  • Dai, J. G. (1995). On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Annals of Applied Probability 5 49–77. MR1325041Google Scholar
  • Darling, R. W. R. and Norris, J. R. (2008). Differential equation approximations for Markov chains. Probability Surveys 5 37. MR2395153Google Scholar
  • de Veciana, G., Konstantopoulos, T. and Lee, T.-J. (2001). Stability and performance analysis of networks supporting elastic services. IEEE/ACM Trans. Netw. 9 2–14.Google Scholar
  • Delcoigne, F., Proutière, A. and Régnié, G. (2004). Modeling integration of streaming and data traffic. Perform. Eval. 55 185–209.Google Scholar
  • Deshpande, M., Amit, A., Chang, M., Venkatasubramanian, N. and Mehrotra, S. (2007). Flashback: a peer-to-peer web server for flash crowds. International Conference on Distributed Computing Systems 15.Google Scholar
  • Engelking, R. (1977). General Topology. Monografie Matematyczne. PWN, Warszaw, Poland. MR0500780Google Scholar
  • Ethier, S. N. and Kurtz, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley. MR0838085Google Scholar
  • Feuillet, M. (2012). On the flow-level stability of data networks without congestion control: the case of linear networks and upstream trees. Queueing Systems, Theory and Applications 70 105–143. MR2886479Google Scholar
  • Gromoll, H. C. and Williams, R. J. (2009). Fluid limits for networks with bandwidth sharing and general document size distributions. Annals of Applied Probability 19 243. MR2498678Google Scholar
  • Hartman, P. (1960). A lemma in the theory of structural stability of differential equations. Proc. A.M.S. 11(4) 610–620. MR0121542Google Scholar
  • Jonckheere, M., Núñez-Queija, R. and Prabhu, B. (2010). Performance analysis of traffic surges in multi-class communication networks. In ITC 22.Google Scholar
  • Kandula, S., Katabi, D., Jacob, M. and Berger, A. W. (2005). Botz-4-Sale: surviving organized DDoS attacks that mimic flash crowds. In 2nd Symposium on Networked Systems Design and Implementation (NSDI).Google Scholar
  • Kelly, F. (1979). Reversibility and Stochastic Networks. Wiley. MR0554920Google Scholar
  • Kelly, F. (1986). Blocking probabilities in large circuit-switched networks. Adv. Appl. Probab. 18 473–505. MR0840104Google Scholar
  • Kelly, F. P., Maulloo, A. K. and Tan, D. K. H. (1998). Rate control for communication networks: shadow prices, proportional fairness and stability. The Journal of the Operational Research Society 49 237–252.Google Scholar
  • Kumar, S. and Massoulié, L. (2007). Integrating streaming and file-transfer Internet traffic: fluid and diffusion approximations. Queueing Syst. 55 195–205. MR2324634Google Scholar
  • Kurtz, T. G. (1992). Averaging for martingale problems and stochastic approximation. In Applied Stochastic Analysis, US-French Workshop. Lecture Notes in Control and Information Sciences 177 186–209. Springer Verlag. MR1169928Google Scholar
  • Massoulié, L. and Roberts, J. (2002). Bandwidth sharing: objectives and algorithms. IEEE/ACM Trans. Netw. 10 320–328.Google Scholar
  • Meyn, S. (2008). Control Techniques for Complex Networks. Cambridge University Press. MR2372453Google Scholar
  • Núñez-Queija, R., van den Berg, J. and Mandjes, M. (1999). Performance evaluation of strategies for integration of elastic and stream traffic. In ITC 16 1039–1050.Google Scholar
  • Peng, T., Lecki, C. and Ramamohanarao, K. (2007). Survey of network-based defense mechanisms countering the DoS and DDoS problems. ACM Comput. Surv. 39.Google Scholar
  • Robert, P. (2003). Stochastic Networks and Queues. Stochastic Modelling and Applied Probability Series. Springer-Verlag, New York. xvii+398 pp. MR1996883Google Scholar
  • Rogers, L. C. G. and Williams, D. (2000 (1987)). Diffusions, Markov Processes & Martingales Vol. 2: Itô Calculus. Cambridge University Press. MR1780932Google Scholar
  • Segel, L. A. and Slemrod, M. (1989). The quasi-steady-state assumption: a case study in perturbation. SIAM Review 31 446–477. MR1012300Google Scholar
  • Stavrou, A., Rubenstein, D. and Sahu, S. (2004). A lightweight, robust P2P system to handle flash crowds. Selected Areas in Communications, IEEE Journal on 22 6–17.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.