Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing
Reexamination Certificate
2006-10-03
2006-10-03
Vaughn, Jr., William C. (Department: 2144)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Reexamination Certificate
active
07117270
ABSTRACT:
Conversion of subscription predicates for transmission in a publish-subscribe network. Subscriptions include Boolean-valued predicates defining content desired by a subscriber. An agent application converts the predicates into a suitable form for transmission to routers in a network core. The routers process the predicates into filter tables or data structures for use in content-based routing, which involves applying attributes in received packets to the filters. The agent also receives content corresponding with subscriptions and calls applications for presenting the content to a subscriber.
REFERENCES:
patent: 5893911 (1999-04-01), Piskiel et al.
patent: 6091724 (2000-07-01), Chandra et al.
patent: 6154781 (2000-11-01), Bolam et al.
patent: 6321267 (2001-11-01), Donaldson
patent: 6405266 (2002-06-01), Bass et al.
patent: 6523068 (2003-02-01), Beser et al.
patent: 6697961 (2004-02-01), Petrenko et al.
patent: 6728715 (2004-04-01), Astley et al.
patent: 6760340 (2004-07-01), Banavar et al.
patent: 6839730 (2005-01-01), Ramabhadran
patent: 6907011 (2005-06-01), Miller et al.
patent: 2002/0087881 (2002-07-01), Harif
patent: 2002/0162025 (2002-10-01), Sutton et al.
patent: 2003/0021258 (2003-01-01), Novaes
Chen-Chuan et al. “Predicate rewriting for translating Boolean queries in a heterogeneous information system”, ACM Transactions on Information Systems (TOIS), vol. 17 Issue 1, Jan. 1999.
Search Report issued on Mar. 29, 2004 in counterpart foreign application in WIPO under application No. PCT/US03/21338.
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. 02-05, 2002.
Andrews & Kurth LLP
Gerezgiher Yemane M.
Precache Inc.
Vaughn, Jr. William C.
LandOfFree
Method for sending and receiving a Boolean function over 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 for sending and receiving a Boolean function over a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for sending and receiving a Boolean function over a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3667671