Skip to main content
Log in

Load Estimation and Control in Best-Effort Network Domains

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

A mechanism for the estimation of the available bandwidth between two end-points of a best-effort network is presented. The estimation is obtained by a simple statistical analysis of the effect that the network has on a synchronous train of packets. The possibility of exploiting self-similar characteristics of the delay jitters is also discussed, and a possible use of the estimates for management actions is suggested.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

REFERENCES

  1. S. Okubo, S. Dunstam, G. Morrison, M. Nilsson, H. Radha, D. L. Skram, and G. Thom, ITU-T standardization of audiovisual communications systems in ATM and LAN environments, IEEE Journal of Selected Areas in Communications, Vol. 15, No. 6, pp. 965–982, 1997.

    Google Scholar 

  2. N. Brownlee, Network management and realtime traffic flow measurement, Journal of Network and Systems Management, Vol. 6, No. 2, pp. 223–227, 1998.

    Google Scholar 

  3. F. Davoli, O. Kahn, and P. Maryni, Estimating the available bandwidth for real-time traffic over best effort networks. In Protocols for High-Speed Networks V, W. Dabbous and C. Diot, (eds.), IFIP, Chapman and Hall, pp. 3–12, 1996.

  4. A. K. Parekh and R. G. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The single node case, IEEE/ACM Transactions on Networking, Vol. 1, pp. 344–357, 1993.

    Google Scholar 

  5. A. Demers, S. Keshav, and S. Shenker, Analysis and simulation of a fair queueing algorithm, Internetworking: Research and Experience, Vol. 1, No. 1, pp. 3–26, 1990.

    Google Scholar 

  6. L. Zhang, VirtualClock: A new traffic control algorithm for packet switching networks, ACM Transactions on Computer Systems, Vol. 9, pp. 101–124, May 1991.

    Google Scholar 

  7. A. Varma and D. Stiliadis, Hardware implementation of fair queueing algorithms for asyn-chronous transfer mode networks, IEEE Communications Magazine, Vol. 35, No. 12, pp. 54–68, December 1997.

    Google Scholar 

  8. A. T. Campbell and G. Coulson, QoS adaptive transports: Delivering scalable media to the desktop, IEEE Network, Vol. 11, No. 2, pp. 18–27, March/April 1997.

    Google Scholar 

  9. Van Jacobson, Pathchar—a tool to infer characteristics of Internet paths, Technical Report, Network Research Group, Lawrence Berkeley National Laboratory, Berkeley, California, April 21 1997, available at: ftp://ftp.ee.lbl.gov/pathchar.

    Google Scholar 

  10. V. Paxson, On calibrating measurements of packet transit times, in SIGMETRICS '98/PERFORMANCE '98 Joint International Conference on Measurement and Modeling of Computer Systems, ACM, Madison, Wisconsin, Vol. 26, No. 1, pp. 11–21, June 1998.

    Google Scholar 

  11. N. Seiz, S. Wolf, S. Voran, and R. Bloomfield, User-oriented measures of telecommunication quality, IEEE Communications Magazine, Vol. 1, No. 32, pp. 56–66, January 1994.

    Google Scholar 

  12. D. Ferrari, Client requirements for real-time communication services, IEEE Communications Magazine, Vol. 28, No. 11, pp. 65–72, November 1990.

    Google Scholar 

  13. R. Frederik, Experiences with real-time software video compression, Xerox PARC, July 1994. Available at ftp://parcftp.xerox.com/pub/net-research/nv-paper.ps.

  14. B. Mandelbrot, The Fractal Geometry of Nature, Freeman, New York, 1983.

    Google Scholar 

  15. W. E. Leland, W. Willinger, M. S. Taqqu, and D. V. Wilson, On the self similar nature of ethernet traffic (Extended Version),” IEEE/ACM Transactions on Networking, Vol. 2, No. 1, pp. 1–15, February 1994.

    Google Scholar 

  16. A. Erramilli, O. Narayan, and W. Willinger, Experimental queueing analysis with long-range dependent packet traffic, IEEE/ACM Transactions on Networking, Vol. 4, No. 2, pp. 209–222, April 1996.

    Google Scholar 

  17. B. Tsybakov and N. D. Georganas, On self-similar traffic in ATM queues: Definition, overflow probability bound, and cell delay distribution, IEEE/ACM Transactions on Networking, Vol. 5, No. 3, pp. 397–409, June 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maryni, P., Davoli, F. Load Estimation and Control in Best-Effort Network Domains. Journal of Network and Systems Management 8, 527–541 (2000). https://doi.org/10.1023/A:1026434517164

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1026434517164

Navigation