Low-Overhead Message Tracking for Distributed Messaging

  • Seung Jun
  • Mark Astley
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4290)


As enterprise applications rely increasingly on commodity messaging middleware, message tracking has become instrumental in testing and run-time monitoring. However, building an effective message tracking system is challenging because of the large scale and high message rate of enterprise-wide applications. To address this challenge, we consider the case of message tracking for distributed messaging middleware. We desire to record the origin, path, and destination of every application message while imposing low overhead with respect to latency, memory and storage. To achieve our goal, we propose a tunable approximation approach based on Bloom filter “histories.” Our approach is tunable in the sense that more accurate audit trails may be provided at the expense of storage space, or, conversely, storage overhead is reduced for applications requiring less accurate audit trails. We describe the design of the system and demonstrate its utility by analyzing the performance of a prototype implementation.


Hash Function Time Stamp Bloom Filter False Positive Probability Message Rate 
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.


  1. 1.
    Gryphon research project,
  2. 2.
  3. 3.
    Java 2 Platform Enterprise Edition,
  4. 4.
    Java Message Service (JMS),
  5. 5.
    Bhola, S., Strom, R.E., Bagchi, S., Zhao, Y., Auerbach, J.S.: Exactly-once delivery in a content-based publish-subscribe system. In: DSN, pp. 7–16. IEEE Computer Society, Los Alamitos (2002)Google Scholar
  6. 6.
    Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7), 422–426 (1970)CrossRefMATHGoogle Scholar
  7. 7.
    Broder, A., Mitzenmacher, M.: Network applications of Bloom filters: A survey. In: Proceedings of the 40th Annual Allerton Conference on Communication, Control and Computing, pp. 636–646 (2002)Google Scholar
  8. 8.
    Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: A scalable wide-area web cache sharing protocol. In: Proceedings of ACM SIGCOMM (1998)Google Scholar
  9. 9.
    Lange, F., Kroeger, R., Gergeleit, M.: Jewel: Design and implementation of a distributed measurement system. IEEE Transactions on Parallel and Distributed Systems 3(6), 657–672 (1992)CrossRefGoogle Scholar
  10. 10.
    Mos, A., Murphy, J.: A framework for performance monitoring, modelling and prediction of component oriented distributed systems. In: WOSP 2002: Proceedings of the Third International Workshop on Software and Performance, pp. 235–236. ACM Press, New York (2002)CrossRefGoogle Scholar
  11. 11.
    Opyrchal, L., Astley, M., Auerbach, J., Banavar, G., Strom, R., Sturman, D.: Exploiting IP Multicast in Content-Based Publish-Subscribe Systems. In: Coulson, G., Sventek, J. (eds.) Middleware 2000. LNCS, vol. 1795, pp. 185–207. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  12. 12.
    Pietzuch, P.R., Bacon, J.: Peer-to-peer overlay broker networks in an event-based middleware. In: DEBS 2003: Proceedings of the 2nd international workshop on Distributed event-based systems, pp. 1–8. ACM Press, New York (2003)Google Scholar
  13. 13.
    Rivest, R.: RFC 1321. the MD5 message-digest algorithm (April 1992)Google Scholar
  14. 14.
    Savage, S., Wetherall, D., Karlin, A., Anderson, T.: Practical network support for IP traceback. In: Proceedings of ACM SIGCOMM, pp. 295–306 (2000)Google Scholar
  15. 15.
    Snoeren, A.C., Patridge, C., Sanchez, L.A., Jones, C.E., Tchakountio, F., Schwartz, B., Kent, S.T., Strayer, W.T.: Single-packet IP traceback. IEEE/ACM Transactions on Networking (TON) 10(6), 721–734 (2002)CrossRefGoogle Scholar
  16. 16.
    Song, D.X., Perrig, A.: Advanced and authenticated marking schemes for IP traceback. In: Proceedings IEEE Infocomm 2001 (2001)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2006

Authors and Affiliations

  • Seung Jun
    • 1
  • Mark Astley
    • 2
  1. 1.College of ComputingGeorgia Institute of TechnologyAtlantaUSA
  2. 2.IBM T.J. Watson Research CenterHawthorneUSA

Personalised recommendations