Frame Allocation Algorithms for Multi-threaded Network Cameras

  • Jos’e Miguel Piquer
  • Javier Bustos-Jim’enez
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6271)


This paper presents a first attempt to solve a challenging problem, proposing novel and successful algorithms to efficiently distribute video frames from network cameras to many concurrent clients.

The usual scenario studied is composed of a camera generating video frames at a given rate and distributing them over a network to several concurrent clients. In general, the idea is to allocate one thread per client at the camera, sharing a pool of one-frame buffers. The algorithms studied consider the allocation of buffers to new frames and the allocation of frames to clients.

We study different combinations of algorithms, buffers and clients in order to find an optimal solution for the usual scenarios we face when the network camera is under heavy use. The main conclusion is that frame allocation algorithms have a strong impact on system performance: under the same conditions, client performance improves from 4 to 25 frames per second with the best algorithm combination at the camera.


Video over IP frame allocation network camera 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Smith, B., Rowe, L.: Compressed domain processing of jpeg-encoded images. Real-Time Imaging 1(2), 3–17 (1996)CrossRefGoogle Scholar
  2. 2.
    Bolot, J., Turletti, T.: Experience with control mechanisms for packet video. ACM Communication Reviews 28(1) (1998)Google Scholar
  3. 3.
    Floyd, S., Paxson, V.: Difficulties in simulating the internet. IEEE/ACM Transaction on Networking (Feburary 2001)Google Scholar
  4. 4.
    ITU-T: Video coding for low bitrate communication. Tech. rep., ITU-T Recommendation H.263, version 2 (January 1998)Google Scholar
  5. 5.
    JTC1, I.: Coding of audio-visual objects - part 2: Visual. Tech. rep., ISO/IEC 14496-2 (MPEG-4 Visual Version 1) (April 1999)Google Scholar
  6. 6.
    Zhang, L., Deering, S., Estrin, D., et al.: Rsvp: A new resource reservation protocol. IEEE Network 5, 8–18 (1993)CrossRefGoogle Scholar
  7. 7.
    Paxson, V.: End-to-end internet packet dynamics. In: ACM SIGCOMM 1997, Cannes, France (April 1997)Google Scholar
  8. 8.
    Floyd, S., Fall, K.: Promoting the use of end-to-end congestion control in the internet. IEEE/ACM Trans. on Networking 7(4), 458–472 (1999)CrossRefGoogle Scholar
  9. 9.
    Raghavan, S., Tripathi, S., Prabhakaran, B.: On qos parameters and services for multimedia applications. Tech. Rep. 3167, Dept. of Computer Science, Univ. of Maryland, MD (1994)Google Scholar
  10. 10.
    Varadarajan, S., Ngo, H., Srivastava, J.: Error spreading: A perception-driven approach to handling error in continuous media streaming. IEEE/ACM Trans. on Networking 10(1), 139–152 (2002)CrossRefGoogle Scholar
  11. 11.
    Silberschatz, A., Galvin, P.B.: The Readers and Writers Problem. In: Operating System Concepts, 5th edn., pp. 173–175. Addison Wesley Longman, Inc., Amsterdam (1998)Google Scholar
  12. 12.
    Wiegand, T., Sullivan, G.J., Bjontegaard, G., Luthra, A.: Overview of the h.264/avc video coding standard. IEEE Trans. on Circuits and Systems for Video Technology 13(7) (July 2003)Google Scholar
  13. 13.
    Wenger, S.: H.264/avc over ip. IEEE Trans. on Circuits and Systems for Video Technology 13(7), 645–656 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Jos’e Miguel Piquer
    • 1
  • Javier Bustos-Jim’enez
    • 2
  1. 1.Departamento de Ciencias de la Computacion (DCC)Universidad de ChileChile
  2. 2.Escuela de Ingenier’ýa Inform’aticaUniversidad Diego PortalesChile

Personalised recommendations