Publish/Subscribe Systems: Design and Principles

Publish/Subscribe Systems: Design and Principles

Volumn , Issue , 2012, Pages

  Tarkoma, Sasu ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84891583788     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9781118354261     Document Type: Book

References (314)

1. Baldoni R, Querzoni L, Tarkoma S and Virgillito A (2009) Distributed event routing in publish/subscribe communication systems. MiNEMA State-of-the-Art Book. Springer.
2. Hinze A and Buchmann AP (eds) (2010) Principles and Applications of Distributed Event-Based Systems. IGI Global.
3. Tarkoma S (2010) Overlay Networks-Toward Information Networking. CRC Press.
4. Eugster PT, Felber PA, Guerraoui R and Kermarrec AM (2003) The many faces of publish/subscribe. ACM Comput Surv 35(2), 114-31.
5. Carriero N and Gelernter D (1989) Linda in context. Commun ACM 32(4), 444-58.
6. Sun (2002) Java Message Service Specification 1.1.
7. Pietzuch P, Eyers D, Kounev S and Shand B 2007 Towards a common api for publish/subscribe Proceedings of the 2007 inaugural international conference on Distributed event-based systems, pp. 152-157 DEBS '07. ACM, New York, NY, USA.
8. Carzaniga A, Rosenblum DS and Wolf AL (2001) Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems 19(3), 332-83.
9. Colouris G, Dollimore J and Kindberg T (1994) Distributed Systems: Concepts and Design, 2nd edn. Addison-Wesley, Boston, Massachusetts.
10. Object Computing, Inc. (2001) CORBA Notification Service Specification v.1.0. OCI.
11. Fleisch BD (1987) Distributed shared memory in a loosely coupled distributed system. SIGCOMM Comput Commun Rev 17, 317-27.
12. Hayes-Roth B (1985) A blackboard architecture for control. Artificial Intelligence 26(3), 251-321.
13. Krasner GE and Pope ST (1988) A cookbook for using the model-view controller user interface paradigm in smalltalk-80. J. Object Oriented Program. 1, 26-49.
14. Birman KP and Joseph TA (1987) Reliable communication in the presence of failures. ACM Transactions on Computer Systems 5, 47-76.
15. Oki BM, Pflügl M, Siegel A and Skeen D (1993) The information bus-an architecture for extensible distributed systems. Proceedings of the Fourteenth ACM Symposium on Operating System Principles, 5-8 December 1993, Asheville, North Carolina, pp. 58-68.
16. Yan TW and Garcia-Molina H (1999) The SIFT information dissemination system. ACM Transactions on Computer Systems Database Systems 24, 529-65.
17. IBM (2002) Gryphon: Publish/subscribe over public networks. (White paper) http://researchweb.watson.ibm.com/distributedmessaging/gryphon.html.
18. Strom RE, Banavar G, Chandra TD, et al. (1998) Gryphon: An information flow based approach to message brokering. Computing Research Repository (CoRR). Available at: http://arxiv.org/corr/home.
19. Sutton P, Arkins R and Segall B (2001) Supporting disconnectedness-transparent information delivery for mobile and invisible computing CCGRID '01: Proceedings of the 1st International Symposium on Cluster Computing and the Grid. IEEE Computer Society, Washington, DC, USA.
20. Castro M, Druschel P, Kermarrec AM and Rowstron A (2002) Scribe: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communication (JSAC), 20(8): 1489-99.
21. Mühl G, Ulbrich A, Herrmann K and Weis T (2004) Disseminating information to mobile clients using publish-subscribe. IEEE Internet Computing 8, 46-53.
22. Pietzuch PR (2004) Hermes: A Scalable Event-Based Middleware. PhD thesis. Computer Laboratory, Queens' College, University of Cambridge.
23. Pietzuch PR and Bacon J (2002) Hermes: A distributed event-based middleware architecture ICDCS Workshops, pp. 611-18.
24. Carzaniga A, Rutherford MJ and Wolf AL (2004) A routing scheme for content-based networking. Proceedings of IEEE INFOCOM 2004. IEEE, Hong Kong, China, vol. 2, pp. 918-28.
25. Cugola G, Di Nitto E and Fuggetta A (1998) Exploiting an event-based infrastructure to develop complex distributed systems Proceedings of the 20th International Conference on Software Engineering, pp. 261-70. IEEE Computer Society.
26. Gritter M and Cheriton DR (2001) An architecture for content routing support in the Internet. Proceedings of the 3rd Conference on USENIX Symposium on Internet Technologies and Systems-Volume 3, p. 4, USITS'01. USENIX Association, Berkeley, CA.
27. Koponen T, Chawla M, Chun BG (2007) A data oriented (and beyond) network architecture. SIGCOMM Comput. Commun. Rev. 37(4), 181-92.
28. Tarkoma S, Ain M and Visala K (2009) The Publish/Subscribe Internet Routing Paradigm (PSIRP): designing the future Internet architecture. Future Internet Assembly, pp. 102-111.
29. Jacobson V, Smetters DK, Thornton JD, Plass MF, Briggs NH and Braynard RL (2009) Networking named content. Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies, pp. 1-12. CoNEXT '09. ACM, New York, NY, USA.
30. Object Computing, Inc. (2001) CORBA Event Service Specification v.1.1. OCI.
31. Rosenberg J, Schulzrinne H, Camarillo G, et al. (2002) RFC 3261: SIP: Session Initiation Protocol. IETF. http://www.ietf.org/rfc/rfc3261.txt.
32. Object Computing, Inc. (2007) Data Distribution Services, V1.2. OCI.
33. Saint-André P (2004) RFC 3920: Extensible Messaging and Presence Protocol (XMPP): Core. Internet Engineering Task Force.
34. Garlan D, Jha S, Notkin D and Dingel J (1998) Reasoning about implicit invocation. SIGSOFT Softw. Eng. Notes 23, 209-21.
35. Notkin D, Garlan D, Griswold WG and Sullivan KJ (1993) Adding implicit invocation to languages: Three approaches. Proceedings of the First JSSST International Symposium on Object Technologies for Advanced Software, pp. 489-510. Springer-Verlag, London.
36. Meier R and Cahill V (2002) Taxonomy of distributed event-based programming systems Proceedings of the 22nd International Conference on Distributed Computing Systems, pp. 585-8. ICDCSW '02. IEEE Computer Society, Washington, DC.
37. Blanco R and Alencar P (2010) Event models in distributed event based systems. Principles and Applications of Distributed Event-Based Systems, pp. 19-42.
38. Deering S and Hinden R (1998) RFC 2460: Internet Protocol, Version 6 (IPv6) Specification.
39. Clark DD (1988) The design philosophy of the DARPA internet protocols. SIGCOMM, pp. 106-114 ACM, Stanford, CA.
40. Saltzer JH, Reed DP and Clark DD (1984) End-to-end arguments in system design. ACM TOCS 2(4), 277-88.
41. Mockapetris P and Dunlap KJ (1988) Development of the domain name system. SIGCOMM Comput. Commun. Rev. 18(4), 123-33.
42. Aura T (2005) Cryptographically generated addresses (CGA). RFC 3972, IETF.
43. Komu M, Tarkoma S, Kangasharju J and Gurtov A (2005) Applying a cryptographic namespace to applications. Proceedings of the First ACM Workshop on Dynamic Interconnection of Networks, DIN, pp. 23-7.
44. Nikander P, Ylitalo J and Wall J (2003) Integrating security, mobility, and multi-homing in a HIP way. Proceedings of Network and Distributed Systems Security Symposium (NDSS03), The Internet Society, San Diego, CA.
45. Levchenko K, Voelker GM, Paturi R and Savage S (2008) Xl: an efficient network routing algorithm SIGCOMM '08: Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication, pp. 15-26. ACM, New York, NY.
46. Kleinrock L and Kamoun F (1975) Hierarchical routing for large networks. Computer Networks 1, 155-74.
47. Winter P (1987) Steiner problem in networks: a survey. Netw. 17(2), 129-67.
48. Opyrchal L, Astley M, Auerbach J, Banavar G, Strom R and Sturman D (2000) Exploiting IP multicast in content-based publish-subscribe systems. Middleware '00: IFIP/ACM International Conference on Distributed Systems Platforms, pp. 185-207. Springer-Verlag New York, Inc., Secaucus, NJ.
49. IBM (2002) Gryphon: Publish/subscribe over public networks (White paper). http://researchweb.watson.ibm.com/distributedmessaging/gryphon.html.
50. Fox G and Pallickara S 2002 The Narada Event Brokering System: Overview and extensions PDPTA '02: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 353-359. CSREA Press.
51. Jin X, Tu W and Chan SHG (2009) Challenges and advances in using IP multicast for overlay data delivery. IEEE Communications, 47(6): 157-63.
52. Dalal YK and Metcalfe RM (1978) Reverse path forwarding of broadcast packets. Commun. ACM 21: 1040-8.
53. Lamport L (1978) Time, clocks, and the ordering of events. Communications of the ACM 21(7), 558-65.
54. Colouris G, Dollimore J and Kindberg T (1994) Distributed Systems: Concepts and Design, 2nd edn. Addison-Wesley, Boston, Massachusetts.
55. Sun 2002 Java Message Service Specification 1.1.
56. Rosenberg J, Schulzrinne H, Camarillo G, et al. (2002) RFC 3261: SIP: Session Initiation Protocol IETF. http://www.ietf.org/rfc/rfc3261.txt.
57. Schulzrinne H and Wedlund E (2000) Application-layer mobility using SIP. SIGMOBILE Mob. Comput. Commun. Rev. 4(3), 47-57.
58. Tarkoma S (2010) Overlay Networks-Toward Information Networking. CRC Press.
59. Lua EK, Crowcroft J, Pias M, Sharma R and Lim S (2005) A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Surveys and Tutorials 7: 72-93.
60. Andersen D, Balakrishnan H, Kaashoek F and Morris R (2001) Resilient overlay networks. SOSP '01: Proceedings of the Eighteenth ACM Symposium on Operating Systems Principles, pp. 131-45. ACM, New York, NY.
61. Karger D, Lehman E, Leighton T, Panigrahy R, Levine M and Lewin D (1997) Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web. STOC '97: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 654-63. ACM, New York, NY.
62. Manku GS (2003) Routing networks for distributed hash tables. PODC '03: Proceedings of the Twenty- Second Annual Symposium on Principles of Distributed Computing, pp. 133-42. ACM, New York, NY.
63. Dabek F, Zhao B, Druschel P, Kubiatowicz J and Stoica I 2003 Towards a Common API for Structured Peer-to-Peer Overlays Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS03), Berkeley, CA.
64. Stoica I, Morris R, Karger D, Kaashoek MF and Balakrishnan H (2001) Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. ACM SIGCOMM.
65. Stoica I, Adkins D, Zhuang S, Shenker S and Surana S (2002) Internet indirection infrastructure. Proceedings of the 2002 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 73-86. ACM Press.
66. Stoica I, Morris R, Karger D, Kaashoek F and Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. Computer Communication Review 31(4), 149-60.
67. Rowstron A and Druschel P (2001) Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), pp. 329-50.
68. Castro M, Druschel P, Kermarrec AM and Rowstron A (2002) One ring to rule them all: service discovery and binding in structured peer-to-peer overlay networks. EW10: Proceedings of the 10th Workshop on ACM SIGOPS European Workshop, pp. 140-5. ACM, New York, NY.
69. Rowstron A and Druschel P (2001) Storage management and caching in PAST, a large-scale, persistent peerto- peer storage utility. 18th ACM Symposium on Operating Systems Principles (SOSP'01), pp. 188-201.
70. Castro M, Druschel P, Kermarrec AM, Nandi A, Rowstron A and Singh A (2003) SplitStream: Highbandwidth multicast in a cooperative environment. 19th ACM Symposium on Operating Systems Principles (SOSP'03), pp. 298-313.
71. Jannotti J, Gifford DK, Johnson KL, Kaashoek MF and O'Toole, Jr. JW (2000) Overcast: reliable multicasting with on overlay network. OSDI'00: Proceedings of the 4th Conference on Symposium on Operating System Design & Implementation, pp. 14-14. USENIX Association, Berkeley, CA.
72. Xu J, Kumar A and Yu X (2003) On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE Journal on Selected Areas in Communications 22: 151-63.
73. Boyd S, Ghosh A, Prabhakar B and Shah D (2006 Randomized gossip algorithms. IEEE/ACM Trans. Netw. 14(SI), 2508-30.
74. Ganesh AJ, Kermarrec AM and Massoulié L (2003) Peer-to-peer membership management for gossip-based protocols. IEEE Trans. Comput. 52(2), 139-49.
75. Lin S, Taïani F and Blair GS (2008) Facilitating Gossip programming with the GossipKit framework. DAIS, pp. 238-52.
76. Voulgaris S, Gavidia D and van Steen M (2005) CYCLON: Inexpensive membership management for unstructured P2P overlays. J. Network Syst Manage 13(2): 197-217.
77. Van Renesse R, Birman KP and VogelsW(2003) Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans. Comput. Syst. 21(2): 164-206.
78. DeCandia G, Hastorun D, Jampani M, et al. (2007) Dynamo: Amazon's highly available key-value store. SIGOPS Oper. Syst. Rev. 41(6): 205-20.
79. Jelasity M, Montresor A and Babaoglu O (2005) Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3): 219-52.
80. Bakhshi R, Gavidia D, Fokkink W and Steen M (2009) An analytical model of information dissemination for a gossip-based protocol. ICDCN '09: Proceedings of the 10th International Conference on Distributed Computing and Networking, pp. 230-42. Springer-Verlag, Berlin, Heidelberg.
81. Stavrou A, Rubenstein D and Sahu S (2004) A lightweight, robust P2P system to handle flash crowds. IEEE Journal on Selected Areas in Communications 22(1): 6-17.
82. Baehni S, Eugster PT and Guerraoui R (2004) Data-aware multicast. Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004), pp. 233-42.
83. Baldoni R, Beraldi R, Quema V, Querzoni L and Tucci-Piergiovanni S (2007) TERA: topic-based event routing for peer-to-peer architectures. DEBS '07: Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems, pp. 2-13. ACM, New York, NY.
84. Chockler G, Melamed R, Tock Y and Vitenberg R (2007) SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication. DEBS '07: Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems, pp. 14-25. ACM, New York, NY.
85. Costa P, Migliavacca M, Picco G and Cugola G (2003) Introducing reliability in content-based publishsubscribe through epidemic algorithms. Proceedings of the 2nd International Workshop on Distributed Event-Based Systems (DEBS'03).
86. Eugster PT, Guerraoui R, Handurukande SB, Kouznetsov P and Kermarrec AM (2001) Lightweight probabilistic broadcast. DSN '01: Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS), pp. 443-52. IEEE Computer Society, Washington, DC.
87. Picco GP and Costa G (2005) Semi-probabilistic publish/subscribe. Proceedings of 25th IEEE International Conference on Distributed Computing Systems (ICDCS 2005), pp. 575-85.
88. Voulgaris S, Rivire E, Kermarrec AM and Steen MV (2006) Sub-2-Sub: Self-organizing content-based publish subscribe for dynamic large scale collaborative networks. IPTPS06: the Fifth International Workshop on Peer-to-Peer Systems.
89. Eugster PT and Guerraoui R (2002) Probabilistic multicast. Proceedings of the 2002 International Conference on Dependable Systems and Networks, pp. 313-24. DSN '02. IEEE Computer Society, Washington, DC, USA.
90. Schmidt D, Stal M, Rohnert H and Buschmann F (2000) Pattern-Oriented Software Architecture. Vol. 2: Patterns for Concurrent and Networked Objects. John Wiley & Sons, Inc. New York.
91. Eugster PT, Felber PA, Guerraoui R and Kermarrec AM (2003) The many faces of publish/subscribe. ACM Comput. Surv. 35(2), 114-31.
92. Carzaniga A, Rosenblum DS and Wolf AL (1999) Interfaces and algorithms for a wide-area event notification service. Technical Report CU-CS-888-99, Department of Computer Science, University of Colorado. Revised May 2000.
93. Roberts S and Byous J (2001) Distributed Events in Jini Technology. Sun Microsystems. Available at: http://java.sun.com/developer/technicalArticles/jini/JiniEvents/.
94. Object Computing, Inc. (2001) CORBA Event Service Specification v.1.1. OCI.
95. Object Computing, Inc. (2001) Management of Event Domains Specification. http://www.omg.org/cgibin/doc?formal/2001-06-03.
96. Bacon J et al. (2000) Generic support for distributed applications. IEEE Computer 33(3), 68-76.
97. Gupta S, Hartkopf J and Ramaswamy S (1998) Event notifier, a pattern for event notification. Java Report 3(7), 19-36.
98. Hayton R, Bacon J, Bates J and Moody K (1996) Using events to build large scale distributed applications. Proceedings of the 7th ACM SIGOPS European Workshop on Systems Support for Worldwide Applications, pp. 9-16.
99. Yu H, Estrin D and Govindan R (1999) A hierarchical proxy architecture for internet-scale event services. Proceedings of 8th InternationalWorkshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE '99), pp. 78-83, Palo Alto, CA.
100. Rowstron AIT and Druschel P (2001) Pastry: scalable, decentralized object location, and routing for largescale peer-to-peer systems. Middleware 2001: Proceedings of the IFIP/ACMInternational Conference on Distributed Systems Platforms Heidelberg, pp. 329-50. Springer-Verlag, London.
101. Stoica I, Morris R, Karger D, Kaashoek F and Balakrishnan H (2001) Chord: a scalable peer-to-peer lookup service for internet applications. Computer Communication Review 31(4), 149-60.
102. Zhao BY, Kubiatowicz JD and Joseph AD (2002) Tapestry: a fault-tolerant wide-area application infrastructure. SIGCOMM Comput. Commun. Rev. 32(1), 81.
103. Pietzuch PR (2004) Hermes: A Scalable Event-Based Middleware. PhD thesis Computer Laboratory, Queens' College, University of Cambridge.
104. Pietzuch PR and Bacon J (2002) Hermes: A distributed event-based middleware architecture. ICDCS Workshops, pp. 611-18.
105. Riehle D (1996) The event notification pattern-integrating implicit invocation with objectorientation. TAPOS 2(1), 43-52.
106. Hohpe G and Woolf B (2003) Enterprise Integration Patterns: Designing, Building, and Deploying Messaging Solutions. Addison-Wesley Longman Publishing Co., Inc., Boston, MA.
107. Object Computing, Inc. (2001) CORBA Event Service Specification v.1.1. OCI.
108. Object Computing, Inc. (2001) CORBA Notification Service Specification v.1.0. OCI.
109. Object Computing, Inc. (2001) Management of Event Domains Specification. OCI. http://www.omg.org/cgibin/doc?formal/2001-06-03.
110. Object Computing, Inc. (2007) Data Distribution Services, V1.2. OCI.
111. Roberts S and Byous J (2001) Distributed Events in Jini Technology. Sun Microsystems. Available at: http://java.sun.com/developer/technicalArticles/jini/JiniEvents/.
112. Sun (2002) Java Message Service Specification 1.1.
113. Davies S et al. January 2009 Websphere mq v7.0 features and enhancements. IBM Redbooks.
114. Hunkeler U, Truong HL and Stanford-Clark A (2008) Mqtt-s-a publish/subscribe protocol for wireless sensor networks. COMSWARE, pp. 791-98.
115. Fielding RT and Taylor RN (2002) Principled design of the modern web architecture. ACM Trans.Internet Technol. 2: 115-50.
116. Mahemoff M (2006) Ajax Design Patterns. O'Reilly Media, Inc.
117. Rose I, Murty R, Pietzuch P, Ledlie J, Roussopoulos M and Welsh M (2007) Cobra: content-based filtering and aggregation of blogs and rss feeds Proceedings of the 4th USENIX Conference on Networked Systems Design And Implementation, pp. 3-3 NSDI'07. USENIX Association, Berkeley, CA.
118. Saint-André P (2004) RFC 3920: Extensible Messaging and Presence Protocol (XMPP): Core Internet Engineering Task Force.
119. Shelby Z, Hartke K, Bormann C and Frank B (2011) Constrained Application Protocol (CoAP) IETF. Internet Draft (work in progress).
120. W3C (2000) Document Object Model (DOM) Level 2 Events Specification, version 1.0. W3C Recommendation.
121. W3C (2011) Document Object Model (DOM) Level 3 Events Specification. W3C Working Draft.
122. Niblett P and Graham S (2005) Events and service-oriented architecture: the oasis web services notification specifications. IBM Syst. J. 44(4), 869-86.
123. Bricconi G, Tracanella E, Nitto ED and Fuggetta A (2000) Analyzing the behavior of event dispatching systems through simulation. HiPC, pp. 131-40.
124. Cugola G, Di Nitto E and Fuggetta A (1998) Exploiting an event-based infrastructure to develop complex distributed systems Proceedings of the 20th International Conference on Software Engineering, pp. 261-70. IEEE Computer Society.
125. Fiege L, Gärtner FC, Kasten O and Zeidler A (2003) Supporting mobility in content-based publish/subscribe middleware Middleware, pp. 103-22.
126. Mühl G (2002) Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis. Darmstadt University of Technology.
127. Mühl G, Ulbrich A, Herrmann K and Weis T (2004) Disseminating information to mobile clients using publish-subscribe. IEEE Internet Computing 8: 46-53.
128. Carzaniga A (1998) Architectures for an Event Notification Service Scalable to Wide-area Networks. PhD thesis. Politecnico di Milano Milano, Italy.
129. Carzaniga A, Rosenblum DS and Wolf AL (2001) Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems 19(3): 332-83.
130. Mühl G, Fiege L, Gärtner FC and Buchmann AP (2002) Evaluating advanced routing algorithms for content-based publish/subscribe systems. In: The Tenth IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS 2002) ( Boukerche A, Das SK and Majumdar S eds), pp. 167-76. IEEE Press, Fort Worth, TX.
131. Pietzuch PR (2004) Hermes: A Scalable Event-Based Middleware. PhD thesis. Computer Laboratory, Queens' College, University of Cambridge.
132. W3C 2003 SOAP Version 1.2. W3C Recommendation.
133. Carzaniga A, Rosenblum DS and Wolf AL (2000) Content-based addressing and routing: A general model and its application. Technical Report CU-CS-902-00, Department of Computer Science, University of Colorado.
134. Opyrchal L, Astley M, Auerbach J, Banavar G, Strom R and Sturman D (2000) Exploiting IP multicast in content-based publish-subscribe systems. Middleware '00: IFIP/ACM International Conference on Distributed Systems Platforms, pp. 185-207. Springer-Verlag New York, Inc., Secaucus, NJ.
135. Pietzuch PR and Bacon J (2002) Hermes: A distributed event-based middleware architecture. ICDCS Workshops, pp. 611-18.
136. Eugster PT, Felber P, Guerraoui R and Kermarrec AM (2003) The many faces of publish/subscribe. ACM Comput. Surv. 35(2), 114-31.
137. Adler M, Ge Z, Kurose JF, Towsley DF and Zabele S (2001) Channelization problem in large scale data dissemination ICNP, pp. 100-9.
138. Chockler G, Melamed R, Tock Y and Vitenberg R (2007) Constructing scalable overlays for pub-sub with many topics PODC, pp. 109-18.
139. Chockler G, Melamed R, Tock Y and Vitenberg R (2007) Spidercast: a scalable interest-aware overlay for topic-based pub/sub communication DEBS, pp. 14-25.
140. Milo T, Zur T and Verbin E (2007) Boosting topic-based publish-subscribe systems with dynamic clustering SIGMOD Conference, pp. 749-60.
141. Carzaniga A and Wolf AL (2003) Forwarding in a content-based network. Proceedings of ACM SIGCOMM 2003, pp. 163-74, Karlsruhe, Germany.
142. Carzaniga A, Rutherford MJ and Wolf AL (2004) A routing scheme for content-based networking. Proceedings of IEEE INFOCOM 2004. IEEE, Hong Kong, China.
143. Carzaniga A, Rosenblum DS and Wolf AL (1999) Interfaces and algorithms for a wide-area event notification service. Technical Report CU-CS-888-99, Department of Computer Science, University of Colorado. Revised May 2000.
144. Rowstron AIT and Druschel P (2001) Pastry: Scalable, decentralized object location, and routing for largescale peer-to-peer systems Middleware 2001: Proceedings of the IFIP/ACMInternational Conference on Distributed Systems Platforms Heidelberg, pp. 329-50. Springer-Verlag, London.
145. Stoica I, Morris R, Karger D, Kaashoek F and Balakrishnan H (2001) Chord: A scalable peer-to-peer lookup service for internet applications. Computer Communication Review 31(4): 149-60.
146. Zhao BY, Kubiatowicz JD and Joseph AD (2002) Tapestry: a fault-tolerant wide-area application infrastructure. SIGCOMM Comput. Commun. Rev. 32(1): 81.
147. Levchenko K, Voelker GM, Paturi R and Savage S (2008) Xl: an efficient network routing algorithm. SIGCOMM '08: Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication, pp. 15-26. ACM, New York, NY.
148. Lamport L (1978) Time, clocks, and the ordering of events. Communications of the ACM 21(7): 558-65.
149. Tarkoma S and Kangasharju J (2007) On the cost and safety of handoffs in content-based routing systems. Computer Networks 51(6): 1459-82.
150. Jerzak Z (2009) XSiena: The Content-Based Publish/Subscribe System. PhD thesis. TU Dresden Dresden, Germany.
151. Raman S and McCanne S (1999) A model, analysis, and protocol framework for soft state-based communication. SIGCOMM Comput. Commun. Rev. 29: 15-25.
152. Cristian F and Fetzer C (1999) The timed asynchronous distributed system model. IEEE Trans. Parallel Distrib. Syst. 10(6): 642-57.
153. Casimir A, Martins P, Rodrigues L and Verìssimo P (2001) Measuring distributed durations with stable errors Proceedings of the 22nd IEEE Real-Time Systems Symposium, pp. 310-19. RTSS '01, IEEE Computer Society, Washington, DC.
154. Object Computing, Inc. (2001) CORBA Notification Service Specification v.1.0. OCI.
155. Sun (2002) Java Message Service Specification 1.1.
156. Cugola G, Di Nitto E and Fuggetta A (1998) Exploiting an event-based infrastructure to develop complex distributed systems. Proceedings of the 20th International Conference on Software Engineering, pp. 261-70. IEEE Computer Society.
157. Sutton P, Arkins R and Segall B (2001) Supporting disconnectedness-transparent information delivery for mobile and invisible computing. CCGRID '01: Proceedings of the 1st International Symposium on Cluster Computing and the Grid, p. 277. IEEE Computer Society, Washington, DC.
158. Mühl G and Fiege L (2001) Supporting covering and merging in content-based publish/subscribe systems: Beyond name/value pairs. IEEE Distributed Systems Online (DSOnline).
159. IBM (2002) Gryphon: Publish/subscribe over public networks. (White paper) http://researchweb.watson.ibm.com/distributedmessaging/gryphon.html.
160. Carzaniga A, Rosenblum DS and Wolf AL (2001) Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems 19(3): 332-83.
161. Carzaniga A and Wolf AL (2003) Forwarding in a content-based network Proceedings of ACM SIGCOMM 2003 , pp. 163-74, Karlsruhe, Germany.
162. Carzaniga A, Deng J and Wolf AL (2001) Fast forwarding for content-based networking. Technical Report CU-CS-922-01, Department of Computer Science, University of Colorado.
163. Mitidieri C and Kaiser J (2003) Attribute-based filtering: Improving the expressiveness while keeping the predictability in P/S systems. Proceedings of the 2nd International Workshop on Distributed Event-Based Systems (DEBS'03).
164. Mühl G (2002) Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis. Darmstadt University of Technology.
165. Pereira J, Fabret F, Llirbat F and Shasha D (2000) Efficient matching for web-based publish/subscribe systems. In Cooperative Information Systems, 7th International Conference, CoopIS 2000, Eilat, Israel, September 6-8, 2000, Proceedings (ed. Etzion O and Scheuermann P), vol. 1901 of Lecture Notes in Computer Science, pp. 162-73. Springer.
166. Yan TW and Garcìa-Molina H (1994) Index structures for selective dissemination of information under the boolean model. ACM Trans. Database Syst. 19: 332-64.
167. Jacobsen HA, Ashayer G and Leung H (2002) Predicate matching and subscription matching in publish/ subscribe systems. In Proceedings of the 1st InternationalWorkshop on Distributed Event-Based Systems (DEBS'02) (ed. Bacon J, Fiege L, Guerraoui R, Jacobsen A and Mühl G), pp. 539-46.
168. Aguilera MK, Strom RE, Sturman DC, Astley M and Chandra TD (1999) Matching events in a contentbased subscription system. PODC '99: Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 53-61. ACM Press, New York, NY.
169. Campailla A, Chaki S, Clarke E, Jha S and Veith H (2001) Efficient filtering in publish-subscribe systems using binary decision diagrams ICSE '01: Proceedings of the 23rd International Conference on Software Engineering, pp. 443-52. IEEE Computer Society, Washington, DC.
170. Fabret F, Jacobsen HA, Llirbat F, Pereira J, Ross K and Shasha D (2001) Filtering algorithms and implementation for very fast publish/subscribe. In Proceedings of the 20th Intl. Conference on Management of Data (SIGMOD 2001) (ed. Sellis T and Mehrotra S), pp. 115-126, Santa Barbara, CA.
171. Liu H and Jacobsen HA (2002) A-TOPSS-a publish/subscribe system supporting approximate matching. Proceedings of the 28th VLDB Conference, Hong Kong, China, pp. 1281-4.
172. Yan TW and Garcìa-Molina H (1999) The SIFT information dissemination system. ACM Trans. Database Syst. 24, 529-65.
173. Hinze A and Bittner S (2002) Efficient distribution-based event filtering. In Proceedings of the 1st International Workshop on Distributed Event-Based Systems (DEBS'02) (ed. Bacon J, Fiege L, Guerraoui R, Jacobsen A and Mühl G), pp. 525-32.
174. Guttman A (1984) R-Trees: A dynamic index structure for spatial searching. In SIGMOD'84, Proceedings of Annual Meeting, Boston, Massachusetts, June 18-21, 1984 (ed. Yormark B), pp. 47-57. ACM Press.
175. W3C (1999) XML Path Language (XPath) 1.0. [W3C Recommendation] http://www.w3.org/TR/xpath.
176. W3C (2010) XQuery 1.0: An XML Query Language (Second Edition). [W3C Recommendation] http://www. w3.org/TR/xquery/.
177. Gottlob G, Koch C and Pichler R (2003) The complexity of XPath query evaluation. Proceedings of the Twenty-Second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 179-190. ACM Press.
178. Chan CY, Fan W, Felber P, Garofalakis MN and Rastogi R (2002) Tree pattern aggregation for scalable XML data dissemination. VLDB, pp. 826-37.
179. Whang S, Brower C, Shanmugasundaram J, et al. (2009) Indexing boolean expressions. PVLDB 2(1): 37-48.
180. Sadoghi M and Jacobsen HA (2011) Be-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space. SIGMOD Conference, pp. 637-48.
181. Mühl G (2001) Generic constraints for content-based publish/subscribe systems. In Proceedings of the 6th International Conference on Cooperative Information Systems (CoopIS'01) (ed. Batini C, Giunchiglia F, Giorgini P and Mecella M), vol. 2172 of LNCS, pp. 211-25. Springer-Verlag, Trento, Italy.
182. Tarkoma S and Kangasharju J (2006) Optimizing content-based routers: posets and forests. Distributed Computing 19(1): 62-77.
183. Cormen TH, Leiserson CE and Rivest TL (2001) Introduction to Algorithms. The MIT Press.
184. Collin C and Levinson R (1989) Partial order maintenance. SIGIR Forum 23(3-4): 59-88.
185. Altinel M and Franklin MJ (2000) Efficient filtering of XML documents for selective dissemination of information. Proceedings of the 26th International Conference on Very Large Data Bases, pp. 53-64. VLDB '00. Morgan Kaufmann Publishers Inc., San Francisco, CA.
186. Diao Y, Altinel M, Franklin MJ, Zhang H and Fischer P (2003) Path sharing and predicate evaluation for high-performance XML filtering. ACM Trans. Database Syst. 28, 467-516.
187. Wu E, Diao Y and Rizvi S (2006) High-performance complex event processing over streams. Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data, pp. 407-18. SIGMOD '06. ACM, New York, NY.
188. Bloom BH (1970) Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7): 422-6.
189. Tarkoma S, Rothenberg C and Lagerspetz E (2011) Theory and practice of bloom filters for distributed systems. Communications Surveys Tutorials, IEEE, pp. 1-25, preprint.
190. Triantafillou P and Economides A (2002) Subscription summaries for scalability and efficiency in publish/ subscribe systems. In Proceedings of the 1st InternationalWorkshop on Distributed Event-Based Systems (DEBS'02) (ed. Bacon J, Fiege L, Guerraoui R, Jacobsen A and Mühl G).
191. Triantafillou P and Economides A (2004) Subscription summarization: A new paradigm for efficient publish/ subscribe systems. ICDCS, pp. 562-71.
192. Jokela P, Zahemszky A, Esteve C, Arianfar S and Nikander P (2009) LIPSIN: Line speed publish/subscribe inter-networking. SIGCOMM'09, pp. 195-206.
193. Jerzak Z and Fetzer C (2008) Bloom filter based routing for content-based publish/subscribe. Proceedings of the Second International Conference on Distributed Event-Based Systems, pp. 71-81. DEBS '08. ACM, New York, NY.
194. Koloniari G and Pitoura E (2003) Bloom-based filters for hierarchical data. 5th Workshop on Distributed Data Structures and Algorithms (WDAS 03), Thessaloniki, pp. 13-14.
195. Koloniari G and Pitoura E (2004) Filters for XML-based service discovery in pervasive computing. Comput. J. 47(4): 461-74.
196. IBM (2002) Gryphon: Publish/subscribe over public networks. (White paper) http://researchweb.watson.ibm.com/distributedmessaging/gryphon.html.
197. Strom RE, Banavar G, Chandra TD, et al. (1998) Gryphon: An information flow based approach to message brokering. Computing Research Repository (CoRR). Available at: http://arxiv.org/corr/home.
198. Bacon J et al. (2000) Generic support for distributed applications. IEEE Computer 33(3), 68-76.
199. Carzaniga A, Rosenblum DS and Wolf AL (2001) Design and evaluation of a wide-area event notification service. ACM Transactions on Computer Systems 19(3): 332-83.
200. Carzaniga A and Wolf AL (2003) Forwarding in a content-based network Proceedings of ACM SIGCOMM 2003 , pp. 163-74, Karlsruhe, Germany.
201. Caporuscio M, Carzaniga A and Wolf AL (2003) Design and evaluation of a support service for mobile, wireless publish/subscribe applications. IEEE Transactions on Software Engineering 29(12): 1059-71.
202. Carzaniga A, Rutherford MJ and Wolf AL (2004) A routing scheme for content-based networking. Proceedings of IEEE INFOCOM 2004. IEEE, Hong Kong, China, vol. 2, pp. 918-28.
203. Sutton P, Arkins R and Segall B (2001) Supporting disconnectedness-transparent information delivery for mobile and invisible computing. CCGRID '01: Proceedings of the 1st International Symposium on Cluster Computing and the Grid, p. 277. IEEE Computer Society, Washington, DC.
204. Cugola G, Di Nitto E and Fuggetta A (2001) The JEDI event-based infrastructure and its application to the development of the OPSS WFMS. IEEE Transactions on Software Engineering 27(9): 827-50.
205. Cugola G, Di Nitto E and Picco GP (2000) Content-based dispatching in a mobile environment. Workshop su Sistemi Distribuiti: Algorithmi, Architectture e Linguaggi.
206. Jacobsen HA, Cheung AKY, Li G, Maniymaran B, Muthusamy V and Kazemzadeh RS (2010) The PADRES Publish/Subscribe System. Principles and Applications of Distributed Event-Based Systems, pp. 164-205.
207. Cugola G and Picco GP (2006) REDS: a reconfigurable dispatching system. Proceedings of the 6th International Workshop on Software Engineering and Middleware, pp. 9-16. SEM '06. ACM, New York, NY.
208. Sivaharan T, Blair G and Coulson G (2005) GREEN: A configurable and re-configurable publish-subscribe middleware for pervasive computing. Proceedings of DOA 2005, pp. 732-49.
209. Fiege L, Gärtner FC, Kasten O and Zeidler A (2003) Supporting mobility in content-based publish/subscribe middleware Middleware, pp. 103-22.
210. Zeidler A and Fiege L (2003) Mobility support with rebeca. Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 354, ICDCSW '03. IEEE Computer Society, Washington, DC, pp. 354-61.
211. Parzyjegla H, Graff D, Schrter A, Richling J and Mühl G (2010) Design and implementation of the rebeca publish/subscribe middleware. In From Active Data Management to Event-Based Systems and More (ed. Sachs K, Petrov I and Guerrero P) vol. 6462 of Lecture Notes in Computer Science. Springer Berlin/Heidelberg. pp. 124-40.
212. Jerzak Z (2009) XSiena: The Content-Based Publish/Subscribe System. PhD thesis TU Dresden. Dresden, Germany.
213. Jerzak Z and Fetzer C (2008) Bloom filter based routing for content-based publish/subscribe. Proceedings of the Second International Conference on Distributed Event-Based Systems, pp. 71-81, DEBS '08. ACM, New York, NY.
214. Fetzer C, Brito A, Fach R and Jerzak Z (2010) StreamMine. In Principles and Applications of Distributed Event-Based Systems (ed. Hinze A and Buchmann AP), IGI Global, pp. 394-410.
215. Tarkoma S, Kangasharju J, Lindholm T and Raatikainen K (2006) Fuego: Experiences with mobile data communication and synchronization. 17th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC), pp. 1-5.
216. W3C (2003) SOAP Version 1.2. W3C Recommendation.
217. Kangasharju J, Lindholm T and Tarkoma S (n.d.) Requirements and design for XML messaging in the mobile environment Second International Workshop on Next Generation Networking Middleware, pp. 29-36.
218. Sun (2002) Java Message Service Specification 1.1.
219. Tarkoma S (2008) Dynamic filter merging and mergeability detection for publish/subscribe. Pervasive and Mobile Computing 4(5): 681-96.
220. Tarkoma S and Kangasharju J (2007) On the cost and safety of handoffs in content-based routing systems. Comput. Netw. 51: 1459-82.
221. Tarkoma S, Kangasharju J and Raatikainen K (2003) Client mobility in rendezvous-notify. Intl.Workshop on Distributed Event-Based Systems (DEBS'03), pp. 1-8.
222. Meier R and Cahill V (2003) Exploiting proximity in event-based middleware for collaborative mobile applications. DAIS, pp. 285-96.
223. Zhou D, Chen Y, Eisenhauer G and Schwan K (2001) Active brokers and their runtime deployment in the ECho/JECho distributed event systems. Active Middleware Services, pp. 67-72.
224. Chen Y, Schwan K and Zhou D (2003) Opportunistic channels: Mobility-aware event delivery. Middleware, pp. 182-201.
225. Castro M, Druschel P, Kermarrec AM and Rowstron A (2002) Scribe: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communication (JSAC), 20(8): 1489-9.
226. Zhuang S, Zhao B, Joseph A, Katz R and Kubiatowicz J (2001) Bayeux: An architecture for scalable and fault-tolerant wide area data dissemination The 11th International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV'01), pp. 11-20.
227. Zhao BY, Kubiatowicz JD and Joseph AD (2002) Tapestry: a fault-tolerant wide-area application infrastructure. SIGCOMM Comput. Commun. Rev. 32(1): 81.
228. Zhuang SQ, Zhao BY, Joseph AD, Katz RH and Kubiatowicz J (2001) Bayeux: An architecture for scalable and fault-tolerant wide-area data dissemination. Proceedings of the Eleventh International Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV 2001).
229. Pietzuch PR (2004) Hermes: A Scalable Event-Based Middleware. PhD thesis. Computer Laboratory, Queens' College, University of Cambridge.
230. Pietzuch PR and Bacon J (2002) Hermes: A distributed event-based middleware architecture. ICDCS Workshops, pp. 611-18.
231. Gupta A, Sahin O, Agrawal D and Abbadi AE (2004) Meghdoot: Content-based publish:subscribe over P2P networks. Proceedings of the ACM/IFIP/USENIX 5th International Middleware Conference (Middleware' 04), pp. 254-73.
232. Ratnasamy S, Francis P, Handley M, Karp R and Schenker S (2001) A scalable content-addressable network. SIGCOMM '01: Proceedings of the 2001 Conference on Applications, Technologies, Architectures and Protocols for Computer Communications, pp. 161-72. ACM, New York, NY.
233. Baldoni R, Marchetti C, Virgillito A and Vitenberg R (2005) Content-based publish-subscribe over structured overlay networks. International Conference on Distributed Computing Systems (ICDCS 2005), pp. 437-46.
234. Cao F and Singh JP (2005) MEDYM: Match-early with dynamic multicast for content-based publishsubscribe networks. Proceedings of the ACM/IFIP/USENIX 6th International Middleware Conference (Middleware 2005), pp. 292-313.
235. Voulgaris S, Rivire E, Kermarrec AM and Steen MV (2006)Sub-2-Sub: Self-organizing content-based publish subscribe for dynamic large scale collaborative networks. In IPTPS06: the Fifth International Workshop on Peer-to-Peer Systems.
236. Baldoni R, Beraldi R, Quema V, Querzoni L and Tucci-Piergiovanni S (2007) TERA: topic-based event routing for peer-to-peer architectures. DEBS '07: Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based Systems, pp. 2-13. ACM, New York, NY.
237. Berry MW, Drmac Z and Jessup ER (1999) Matrices, vector spaces, and information retrieval. SIAM Rev. 41(2), 335-62.
238. Rao W, Chen L and Fu A (2011) STAIRS: Towards efficient full-text filtering and dissemination in dht environments. The VLDB Journal 20(6): 793-817. 10.1007/s00778-011-0224-z.
239. Rose I, Murty R, Pietzuch PR, Ledlie J, RoussopoulosM andWelsh M (2007) Cobra: Content-based filtering and aggregation of blogs and rss feeds. 4th Symposium on Networked Systems Design and Implementation (NSDI ), 11-13 April 2007, Cambridge, MA.
240. Li J, Loo BT, Hellerstein JM, Kaashoek MF, Karger DR and Morris R (2003) On the feasibility of peer-to-peer web indexing and search. IPTPS, pp. 207-15.
241. Yang Y, Dunlap R, Rexroad M and Cooper BF (2006) Performance of full text search in structured and unstructured peer-to-peer systems. INFOCOM.
242. Rao W, Fu AWC, Chen L and Chen H (2009) Stairs: Towards efficient full-text filtering and dissemination in a dht environment. ICDE '09. IEEE 25th International Conference on Data Engineering, pp. 198-209.
243. Liu Z, Parthasarthy S, Ranganathan A and Yang H (2007) Scalable event matching for overlapping subscriptions in pub/sub systems. DEBS, pp. 250-61.
244. Nguyen LT, Yee WG and Frieder O (2008) Adaptive distributed indexing for structured peer-to-peer networks. CIKM, pp. 1241-50.
245. Stoica I, Morris R, Liben-Nowell D, et al. (2003) Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11(1), 17-32.
246. Rowstron AIT and Druschel P (2001) Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. Middleware, pp. 329-50.
247. Zhao BY, Kubiatowicz J and Joseph AD (2002) Tapestry: a fault-tolerant wide-area application infrastructure. Computer Communication Review 32(1): 81.
248. Ganguly S, Bhatnagar S, Saxena A, Izmailov R and Banerjee S (2006) A fast content-based data distribution infrastructure. INFOCOM.
249. Rao W and Chen L (2011) A distributed full-text top-k document dissemination system in distributed hash tables. World Wide Web 14(5-6): 545-72.
250. Rao W, Vitenberg R and Tarkoma S (2011) Towards optimal keyword-based content dissemination in dht-based p2p networks. P2P, pp. 102-11.
251. Tang C and Dwarkadas S (2004) Hybrid global-local indexing for efficient peer-to-peer information retrieval. NSDI, pp. 211-24.
252. Tryfonopoulos C, Idreos S and Koubarakis M (2005) Publish/subscribe functionality in IR environments using structured overlay networks. SIGIR, pp. 322-9.
253. Yan TW and Garcia-Molina H (1999) The SIFT information dissemination system. ACM Trans. Database Syst. 24(4): 529-65.
254. Fabret F, Jacobsen HA, Llirbat F, Pereira J, Ross KA and Shasha D (2001) Filtering algorithms and implementation for very fast publish/subscribe SIGMOD Conference, pp. 115-26.
255. Wang C, Carzaniga A, Evans D and Wolf A (2002) Security issues and requirements for internetscale publish-subscribe systems. Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02), Volume 9, pp. 303-11. HICSS '02. IEEE Computer Society, Washington, DC.
256. Bacon J, Eyers D, Moody K and Pesonen L (2005) Securing publish/subscribe for multi-domain systems. Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware, pp. 1-20 Middleware '05. Springer-Verlag New York, Inc., New York, NY.
257. Fiege L, Zeidler A, Buchmann A, Kilian-Kehr R and Mühl G (2004) Security aspects in publish/subscribe systems. In Third Intl. Workshop on Distributed Event-based Systems (DEBS04. IEEE.
258. Khurana H (2005) Scalable security and accounting services for content-based publish/subscribe systems. Proceedings of the 2005 ACM Symposium on Applied Computing, pp. 801-7, SAC '05. ACM, New York, NY.
259. Hirsch F, Solo D, Reagle J, Eastlake D and Roessler T (2008) XML Signature Syntax and Processing, 2nd edn. W3C recommendation, W3C. http://www.w3.org/TR/2008/REC-xmldsig-core-20080610/.
260. Reagle J and Eastlake D (2009) XML encryption syntax and processing version 1.1. W3C working draft, W3C. http://www.w3.org/TR/2009/WD-xmlenc-core1-20090730/.
261. Srivatsa M and Liu L (2005) Securing publish-subscribe overlay services with EventGuard. CCS '05: Proceedings of the 12th ACM Conference on Computer and Communications Security, pp. 289-98. ACM, New York, NY.
262. Corman AB, Schachte P and Teague V (2007) QUIP: a protocol for securing content in peer-to-peer publish/subscribe overlay networks. ACSC '07: Proceedings of the Thirtieth Australasian Conference on Computer Science, pp. 35-40. Australian Computer Society, Inc., Darlinghurst, Australia.
263. Pietzuch PR (2004) Hermes: A Scalable Event-Based Middleware. PhD thesis. Computer Laboratory, Queens' College, University of Cambridge.
264. Huang Y and Garcia-Molina H (2001) Publish/subscribe in a mobile enviroment. Proceedings of the 2nd ACM International Workshop on Data Engineering for Wireless and Mobile Access, pp. 27-34. ACM Press.
265. Al-Muhtadi J, Campbell R, Kapadia A, Mickunas MD and Yi S (2002) Routing through the mist: Privacy preserving communication in ubiquitous computing environments. ICDCS '02: Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02), p. 74-. IEEE Computer Society, Washington, DC.
266. Gedik B and Liu L (2008) Protecting location privacy with personalized k-anonymity: Architecture and algorithms. IEEE Trans. Mob. Comput. 7(1): 1-18.
267. Pietzuch PR, Shand B and Bacon J (2003) A framework for event composition in distributed systems. Proceedings of the 4th International Conference on Middleware, pp. 62-82.
268. Pietzuch PR, Shand B and Bacon J (2004) Composite event detection as a generic middleware extension. IEEE Network 18(1): 44-55.
269. Jacobsen HA, Cheung AKY, Li G, Maniymaran B, Muthusamy V and Kazemzadeh RS (2010) The PADRES Publish/Subscribe System. Principles and Applications of Distributed Event-Based Systems, pp. 164-205.
270. Tarkoma S (2008) Fast track article: Dynamic filter merging and mergeability detection for publish/ subscribe. Pervasive Mob. Comput. 4: 681-96.
271. Crespo A, Buyukkokten O and Garcia-Molina H (2003) Query merging: Improving query subscription processing in a multicast environment. IEEE Trans. Knowl. Data Eng. 15(1): 174-91.
272. Mühl G (2002) Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis. Darmstadt University of Technology.
273. Salo J (2010) Offloading content routing cost from routers. Master's thesis, University of Helsinki.
274. Cheung AKY and Jacobsen HA (2006) Dynamic load balancing in distributed content-based publish/ subscribe Middleware, pp. 141-61.
275. Cheung AKY and Jacobsen HA (2010) Load balancing content-based publish/subscribe systems. ACM Trans. Comput. Syst. 28(4): 9.
276. Cheung AKY and Jacobsen HA (2010) Publisher placement algorithms in content-based publish/subscribe. ICDCS, pp. 653-64.
277. Wang YM, Qiu L, Achlioptas D, Das G, Larson P and Wang HJ (2002) Subscription partitioning and routing in content-based publish/subscribe networks. 16th International Symposium on DIStributed Computing (DISC'02), October 2002, Toulouse, France.
278. Tarkoma S (2008) Dynamic content-based channels: meeting in the middle. Proceedings of the Second International Conference on Distributed Event-Based Systems, pp. 47-58. DEBS '08. ACM, New York, NY.
279. Picco GP, Cugola G and Murphy AL (2003) Efficient content-based event dispatching in the presence of topological reconfiguration. Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 234-44. ICDCS '03. IEEE Computer Society, Washington, DC, USA.
280. Sivaharan T, Blair G and Coulson G (2005) GREEN: A configurable and re-configurable publish-subscribe middleware for pervasive computing. Proceedings of DOA 2005, pp. 732-49.
281. Cugola G and Picco GP (2006) REDS: a reconfigurable dispatching system. Proceedings of the 6th International Workshop on Software Engineering and Middleware, pp. 9-16. SEM '06. ACM, New York, NY.
282. Mottola L, Cugola G and Picco GP (2008) A self-repairing tree topology enabling content-based routing in mobile ad hoc networks. IEEE Transactions on Mobile Computing 7: 946-60.
283. Baldoni R, Beraldi R, Querzoni L and Virgillito A 2007 Efficient publish/subscribe through a self-organizing broker overlay and its application to siena. Comput. J. 50: 444-59.
284. Jaeger MA, Parzyjegla H, Mühl G and Herrmann K (2007) Self-organizing broker topologies for publish/ subscribe systems. Proceedings of the 2007 ACM Symposium on Applied Computing, pp. 543-50. SAC '07. ACM, New York, NY.
285. Baldoni R, Beraldi R, Querzoni L and Virgillito A (2004) A self-organizing crash-resilient topology management system for content-based publish/subscribe. 3rd International Workshop on Distributed Event-Based Systems (DEBS'04), Edinburgh, Scotland.
286. Burcea I, Jacobsen HA, de Lara E, Muthusamy V and Petrovic M (2004) Disconnected operation in publish/subscribe middleware. Mobile Data Management, pp. 39-50.
287. Tarkoma S, Kangasharju J and Raatikainen K (2003) Client mobility in rendezvous-notify. Intl.Workshop on Distributed Event-Based Systems (DEBS'03).
288. Caporuscio M, Carzaniga A and Wolf A (2002) An experience in evaluating publish/subscribe services in a wireless network. WOSP '02: Proceedings of the 3rd International Workshop on Software and Performance, pp. 128-33. ACM Press, New York, NY.
289. Caporuscio M, Carzaniga A and Wolf AL (2003) Design and evaluation of a support service for mobile, wireless publish/subscribe applications. IEEE Transactions on Software Engineering 29(12): 1059-71.
290. Tarkoma S and Kangasharju J (2007) On the cost and safety of handoffs in content-based routing systems. Computer Networks 51(6): 1459-82.
291. Tarkoma S and Kangasharju J (2005) Filter merging for efficient information dissemination. CoopIs LNCS 3760), pp. 274-91. Springer.
292. Rose I, Murty R, Pietzuch P, Ledlie J, Roussopoulos M and Welsh M (2007) Cobra: content-based filtering and aggregation of blogs and rss feeds. Proceedings of the 4th USENIX Conference on Networked Systems Design and Implementation, p. 3-. NSDI'07. USENIX Association, Berkeley, CA.
293. Mühl G, Ulbrich A, Herrmann K and Weis T (2004) Disseminating information to mobile clients using publish-subscribe. IEEE Internet Computing 8: 46-53.
294. Henjes R (2010) Performance Evaluation of Publish/Subscribe Middleware Architectures. PhD thesis. University of Würzburg.
295. Wu E, Diao Y and Rizvi S (2006) High-performance complex event processing over streams. Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data, pp. 407-18. SIGMOD '06. ACM, New York, NY.
296. Luckham DC (2002) The Power of Events: An Introduction to Complex Event Processing in Distributed Enterprise Systems. Addison-Wesley, Boston, Massachusetts.
297. Lindström J (2010) Algorithmic trading and complex event processing. Master's thesis, Aalto University.
298. Bharambe AR, Rao S and Seshan S (2002) Mercury: a scalable publish-subscribe system for internet games Proceedings of the 1st Workshop on Network and System Support for Games, pp. 3-9. NetGames '02. ACM, New York, NY.
299. Filinski A (1989) Declarative Continuations and Categorical Duality. Master's thesis. University of Copenhagen.
300. Jacobson V, Smetters DK, Thornton JD, Plass MF, Briggs NH and Braynard RL (2009) Networking named content Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies, pp. 1-12. CoNEXT '09. ACM, New York, NY.
301. Lagutin D, Visala K, Zahemszky A, Burbridge T and Marias GF (2010) Roles and security in a publish/ subscribe network architecture. ISCC'10, pp. 68-74.
302. Rajahalme J, Särelä M, Visala K and Riihijärvi J (2010) On name-based inter-domain routing. Computer Networks Journal: Special Issue on Architectures and Protocols for the Future Internet, pp. 975-86.
303. Visala K, Lagutin D and Tarkoma S (2009) LANES: An inter-domain data-oriented routing architecture. ReArch'09, pp. 55-60. ACM.
304. Koponen T, Chawla M, Chun BG, et al. (2007) A data-oriented (and beyond) network architecture. SIGCOMM Comput. Commun. Rev. 37(4): 181-92.
305. Carpenter B (1996) Architectural Principles of the Internet Internet Engineering Task Force: RFC 1958.
306. Tarkoma S and Antikainen M (2010) Canopy: publish/subscribe with upgraph combination. 13th IEEE Global Internet Symposium 2010, pp. 1-6.
307. The CAIDA AS Relationships Dataset, November 2009 (n.d.) http://www.caida.org/data/active/asrelationships/.
308. Labovitz C, Iekel-Johnson S, McPherson D, Oberheide J and Jahanian F (2010) Internet inter-domain traff. SIGCOMM'10, pp. 75-86.
309. Clark D, Wroclawski J, Sollins K and Braden R (2005) Tussle in cyberspace: Defining tomorrow's Internet. IEEE/ACM Transactions on Networking 13(3): 462-75.
310. Rajahalme J, Särelä M, Nikander P and Tarkoma S (2008) Incentive-compatible caching and peering in data-oriented networks. ReArch'08. ACM, 62:1-62:6.
311. Gao L (2001) On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on Networking 9(6): 733-45.
312. Ganesan P, Gummadi K and Garcia-Molina H (2004) Canon in G major: Designing DHTs with hierarchical structure. ICDCS'04, pp. 263-72. IEEE Computer Society.
313. Jokela P, Zahemszky A, Esteve C, Arianfar S and Nikander P (2009) LIPSIN: Line speed publish/subscribe inter-networking. SIGCOMM'09, pp. 195-206.
314. Su J, Scott J, Hui P, Crowcroft J, et al. (2007) Haggle: Seamless networking for mobile applications. Proceedings of the 9th International Conference on Ubiquitous Computing, pp. 391-408 UbiComp '07. Springer-Verlag, Berlin, Heidelberg.