Method and apparatus for propagating content filters for a...

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S352000, C370S392000, C707S793000, C707S793000, C707S793000, C709S201000, C709S236000

Reexamination Certificate

active

07551629

ABSTRACT:
A method and apparatus provide for propagating filters in a publish-subscribe network. A plurality of filters relating to subscriptions to content in the network are received. A number of the filters is reduced based upon particular criteria, and the reduced number of filters are propagated for use in satisfying the subscriptions. A filter receiving module, a filter reduction module, and a filter propagation module may execute these steps.

REFERENCES:
patent: 5893911 (1999-04-01), Piskiel et al.
patent: 6154781 (2000-11-01), Bolam et al.
patent: 6212568 (2001-04-01), Miller et al.
patent: 6336119 (2002-01-01), Banavar et al.
patent: 6643682 (2003-11-01), Todd et al.
patent: 6728715 (2004-04-01), Astley et al.
patent: 6839730 (2005-01-01), Ramabhadran
patent: 2002/0069244 (2002-06-01), Blair et al.
patent: 2003/0135553 (2003-07-01), Pendakur
patent: 2003/0154193 (2003-08-01), Rosenblum
patent: 2007/0014302 (2007-01-01), Vincent
Gupta, P., et al., Algorithms for Packet Classification. IEEE Network, pp. 24-32, Mar./Apr. 2001.
Srinivasan, V., et al., Fast and Scalable Layer Four Switching. In Proceedings of SIGCOMM '98, pp. 191-202, 1998.
Gupta et al., Packet Classification on Multiple Fields, Proceedings of ACM SIGCOMM '99, pp. 147-160, Aug. 1999.
Lakshman, T., et al., High Speed Policy-based Packet Forwarding Using Efficient Multi-dimensional Range Matching. In Proc. ACM SIGCOMM '98, pp. 203-214, 1998.
Srinivasan, V., et al., Packet Classification using Tuple Space Search. In Proceedings of ACM SIGCOMM '99, pp. 135-146, Sep. 1999.
Adiseshu,,H., et al., Packet filter management for layer 4 switching. In Proceedings of IEEE INFOCOM, 1999.
Buddhikot, M., et al., Space decomposition techniques for fast layer-4 switching. In Proceedings of IFIP Workshop on Protocols for High Speed Networks, Salem, Massachusetts, pp. 25-41, Aug. 25-28, 1999.
Gupta et al., Packet Classification Using Hierachical Intelligent Cuttings. In Proceedings Hot Interconnects VII, Aug. 1999.
Warkhede, P.R., et al., Fast Packet Classification for Two-Dimensional Conflict-Free Filters. In Proc. INFOCOM, pp. 1434-1443, 2001.
Waldvogel, M., Multi-Dimensional Prefix Matching Using Line Search. In Proceedings of IEEE Local Computer Networks, pp. 200-207, Nov. 2000.
Eppstein, D., et al., Internet packet filter management and rectangle geometry. In Proceedings of the 12thAnnual ACM—SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 827-835, Washington, DC., Jan. 2001.
Feldmann, A., Tradeoffs for packet classification. In Proc. INFOCOM, vol. 3, pp. 1193-1202. IEEE, Mar. 2000.
Woo, T., A Modular Approach to Packet Classification: Algorithms and results. In Proc. IEEE INFOCOM, Tel-Aviv, Israel, pp. 1213-1222, Mar. 2000.
Eugster, P., et al., Event Systems, How to Have Your Cake and Eat It Too, In 22ndInternational Conference on Distributed Computing Systems Workshops (ICDCSW '02), Vienna, Austria, Jul. 2-5, 2002.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and apparatus for propagating content filters for a... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for propagating content filters for a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for propagating content filters for a... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4074162

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.