Adaptive Bandwidth Allocation Method for Long Range Dependence Traffic

  • Bong Joo Kim
  • Gang Uk Hwang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4268)


In this paper, we propose a new method to allocate bandwidth adaptively according to the amount of input traffic volume for a long range dependent traffic requiring Quality of Service (QoS). In the proposed method, we divide the input process, which is modelled by an M/G/∞ input process, into two sub-processes, called a long time scale process and a short time scale process. For the long time scale process we estimate the required bandwidth using the linear prediction. Since the long time scale process varies (relatively) slowly, the required bandwidth doesn’t need to be estimated frequently. On the other hand, for the short time scale process, we use the large deviation theory to estimate the effective bandwidth of the short time scale process based on the required QoS of the input traffic. By doing this we can capture the short time scale fluctuation by a buffer and the long time scale fluctuation by increasing or decreasing the bandwidth adaptively. Through simulations we verify that our proposed method performs well to satisfy the required QoS.


Service Time Minimum Mean Square Error Require Bandwidth Input Process Minimum Mean Square Error Linear 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Adas, A.: Supporting real time VBR video using dynamic reservation based on linear prediction. In: Proc. of IEEE Infocom., pp. 1476–1483 (1996)Google Scholar
  2. 2.
    Beran, J., Sherman, R., Taqqu, M.S., Willinger, W.: Long-range dependence in variable bit-rate video traffic. IEEE Trans. Commun. 43, 1566–1579 (1995)CrossRefGoogle Scholar
  3. 3.
    Bodamer, S., Charzinski, J.: Evaluation of effective bandwidth schemes for self-similar traffic. In: Proc. of the 13th ITC Specialist seminar on IP Measurement, Modeling and Management, Monterey, CA, pp. 21-1–21-10 (September 2000)Google Scholar
  4. 4.
    Cheng-Shang, C.: Performance Guarantees in Communication Networks, pp. 291–376. Springer, Heidelberg (1999)Google Scholar
  5. 5.
    Crovella, M.E., Bestavros, A.: Self-similarity in World Wide Web traffic: Evidence and possible causes. IEEE/ACM Trans. Networking 5(6), 835–846 (1997); Proc. ACM SIGMETRICS 1996, Philadelphia (May 1996) CrossRefGoogle Scholar
  6. 6.
    Fowler, H.J., Leland, W.E.: Local area network traffic characteristics with implications for broadband network congestion management. IEEE J. Select. Areas Commun. 9, 1139–1149 (1991)CrossRefGoogle Scholar
  7. 7.
    Garrett, M.W., Willinger, W.: Analysis, modeling, and generation of self-similar VBR video traffic. In: Proc. SIGCOMM 1994 Conf., pp. 269–280 (September 1994)Google Scholar
  8. 8.
    Garroppo, R.G., Giordano, S., Miduri, S., Pagano, M., Russo, F.: Statistical multiplxing of self-similar VBR videoconferencing traffic. In: Proc. of IEEE Infocom., pp. 1756–1760 (1997)Google Scholar
  9. 9.
    Karasaridis, A., Hatzinakos, D.: Bandwidth allocation bounds for α-stable self-similar Internet traffic models. In: IEEE Signal Processing Workshop on Higher-Order Statistics, Ceasarea, Israel (June 1999)Google Scholar
  10. 10.
    Krunz, M.M., Makowski, A.M.: Modeling video traffic using M/G/ ∞ input processes: A compromise between Markovian and LRD Models. IEEE J. Select. Areas Commun. 16(5), 733–748 (1998)CrossRefGoogle Scholar
  11. 11.
    Leland, W.E., Taqqu, M.S., Willinger, W., Wilson, D.V.: On the self-similar nature of Ethernet traffic (extended version). IEEE/ACM Trans. Networking 2(1), 1–15 (1994)CrossRefGoogle Scholar
  12. 12.
    Makowski, A.M., Parulekar, M.: Buffer asymptotics for M/G/ ∞ input processes. In: Park, K., Willinger, W. (eds.) Self-similar network traffic and performance evaluation, pp. 215–248. John Wiley & Sons, Chichester (2002)Google Scholar
  13. 13.
    Parulekar, M.: Buffer engineering for M/G/ ∞ input processes. Ph.D. dissertation, Univ. Maryland, College Park (August 1999)Google Scholar
  14. 14.
    Parulekar, M., Makowski, A.M.: M/G/ ∞ input processes: a versatile class of models for traffic network. In: Proc. of IEEE Infocom., pp. 1452–1459 (1997)Google Scholar
  15. 15.
    Paxson, V., Floyd, S.: Wide area traffic: The failure of Poisson modeling. IEEE/ACM Trans. Networking 3(3), 226–244 (1993)CrossRefGoogle Scholar
  16. 16.
    Perlingeiro, F.R., Lee, L.L.: An effective bandwidth allocation approach for self-similar traffic in a single ATM connection. In: Proc. of IEEE Globecom., pp. 1490–1494 (1999)Google Scholar
  17. 17.
    Stathis, C., Maglaris, B.: Modelling the self-similar behavior of network traffic. Computer Networks 34, 37–47 (2000)CrossRefGoogle Scholar
  18. 18.
    Tsoukatos, K.P., Makowski, A.M.: Heavy traffic limits associated with M/G/ ∞ input processes. Queueing Systems 34, 101–130 (2000)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Bong Joo Kim
    • 1
  • Gang Uk Hwang
    • 1
  1. 1.Division of Applied Mathematics and Telecommunication ProgramKorea Advanced Institute of Science and TechnologyTaejeonSouth Korea

Personalised recommendations