Achieving expressive and efficient content-based
routing in publish/subscribe systems is a difficult problem. Traditional
approaches prove to be either inefficient or severely limited in their
expressiveness and flexibility. We present a novel routing method, based on
Bloom filters, which shows high efficiency while simultaneously preserving
the flexibility of content-based schemes. The resulting implementation is a
fast, flexible and fully decoupled content-based publish/subscribe system.
Guide for de mystifying law of trade mark litigation in IndiaVijay Dalmia
The document provides an overview of trademark law in India. It discusses that trademark registration is not required for protection, and that rights can be acquired through registration, first use, or assignment. It also outlines threats like cancellation, opposition, and litigation for infringement or passing off. Key principles of Indian trademark law include first adoption taking priority over registration, and volume of business not being a relevant consideration in litigation. Defences for infringement or passing off include delay, acquiescence, and differences in goods/sales channels.
Law Of Industrial Patent Design In India by Vijay DalmiaVijay Dalmia
This document discusses India's design laws and registration process. It provides an overview of the key aspects of industrial designs as a category of intellectual property rights in India, including definitions, eligibility, registration procedures, fees, rights conferred, and infringement. The document also shares statistics on design registrations in India and globally. In summary, it outlines the legal framework for design protection in India and relevant considerations for registering and enforcing industrial designs.
The document provides information about several Native American tribes that lived in Florida, including their locations, diets, customs, clothing, tools, housing, present status, and languages. The Timucua lived in northeast Florida and were heavily tattooed. They built houses out of palm fronds and wood. The Calusa were the most powerful tribe in Florida and gained wealth through trade and tribute. Sadly, all of the tribes described are now extinct.
The document discusses integration and integration techniques. It defines integration as connecting different applications within an enterprise so they can exchange data and interoperate as needed. Integration can occur at the process, application, or data level. Common integration techniques include standard data definitions, databases, middleware, message-based integration using buses or brokers, and software-based integration using adapters or RPCs. The document also discusses common software architectures like layered systems, client-server, and service-oriented architecture and how they support integration.
The document summarizes information about Khmer culture and history in Cambodia. It provides trivia questions about topics like the Funan kingdom, Angkor Wat temple, Khmer language, classical dances, and cultural traditions. The document is for a Khmer cultural trivia night being held by a Buddhist temple organization.
This document discusses several issues that undermine confidence in published medical research:
1. Poor methodology, selective reporting, and biased interpretation of results are common problems.
2. Reporting is often inadequate, omitting key details about how studies were designed and conducted.
3. Peer review is limited and cannot guarantee scientifically sound papers. Readers should be cautious in their interpretation.
Guide for de mystifying law of trade mark litigation in IndiaVijay Dalmia
The document provides an overview of trademark law in India. It discusses that trademark registration is not required for protection, and that rights can be acquired through registration, first use, or assignment. It also outlines threats like cancellation, opposition, and litigation for infringement or passing off. Key principles of Indian trademark law include first adoption taking priority over registration, and volume of business not being a relevant consideration in litigation. Defences for infringement or passing off include delay, acquiescence, and differences in goods/sales channels.
Law Of Industrial Patent Design In India by Vijay DalmiaVijay Dalmia
This document discusses India's design laws and registration process. It provides an overview of the key aspects of industrial designs as a category of intellectual property rights in India, including definitions, eligibility, registration procedures, fees, rights conferred, and infringement. The document also shares statistics on design registrations in India and globally. In summary, it outlines the legal framework for design protection in India and relevant considerations for registering and enforcing industrial designs.
The document provides information about several Native American tribes that lived in Florida, including their locations, diets, customs, clothing, tools, housing, present status, and languages. The Timucua lived in northeast Florida and were heavily tattooed. They built houses out of palm fronds and wood. The Calusa were the most powerful tribe in Florida and gained wealth through trade and tribute. Sadly, all of the tribes described are now extinct.
The document discusses integration and integration techniques. It defines integration as connecting different applications within an enterprise so they can exchange data and interoperate as needed. Integration can occur at the process, application, or data level. Common integration techniques include standard data definitions, databases, middleware, message-based integration using buses or brokers, and software-based integration using adapters or RPCs. The document also discusses common software architectures like layered systems, client-server, and service-oriented architecture and how they support integration.
The document summarizes information about Khmer culture and history in Cambodia. It provides trivia questions about topics like the Funan kingdom, Angkor Wat temple, Khmer language, classical dances, and cultural traditions. The document is for a Khmer cultural trivia night being held by a Buddhist temple organization.
This document discusses several issues that undermine confidence in published medical research:
1. Poor methodology, selective reporting, and biased interpretation of results are common problems.
2. Reporting is often inadequate, omitting key details about how studies were designed and conducted.
3. Peer review is limited and cannot guarantee scientifically sound papers. Readers should be cautious in their interpretation.
ThesisXSiena: The Content-Based Publish/Subscribe SystemZbigniew Jerzak
Just as packet switched networks constituted a major breakthrough in our
perception of the information exchange in computer networks so have the
decoupling properties of publish/subscribe systems revolutionized the way
we look at networking in the context of large scale distributed systems. The
decoupling of the components of publish/subscribe systems in time, space and
synchronization has created an appealing platform for the asynchronous information
exchange among anonymous information producers and consumers.
Moreover, the content-based nature of publish/subscribe systems provides a
great degree of flexibility and expressiveness as far as construction of data
flows is considered.
However, a number of challenges and not yet addressed issued still exists in the
area of the publish/subscribe systems. One active area of research is directed
toward the problem of the ecient content delivery in the content-based publish
/subscribe networks. Routing of the information based on the information
itself, instead of the explicit source and destination addresses poses challenges
as far as eciency and processing times are concerned. Simultaneously, due
to their decoupled nature, publish/subscribe systems introduce new challenges
with respect to issues related to dependability and fail-awareness.
This thesis seeks to advance the field of research in both directions. First it
shows the design and implementation of routing algorithms based on the end-toend
systems design principle. Proposed routing algorithms obsolete the need to
perform content-based routing within the publish/subscribe network, pushing
this task to the edge of the system. Moreover, this thesis presents a fail-aware
approach towards construction of the content-based publish/subscribe system
along with its application to the creation of the soft state publish/subscribe
system. A soft state publish/subscribe system exposes the self stabilizing
behavior as far as transient timing, link and node failures are concerned. The
result of this thesis is a family of the XSiena content-based publish/subscribe
systems, implementing the proposed concepts and algorithms. The family
of the XSiena content-based publish/subscribe systems has been a subject to
rigorous evaluation, which confirms the claims made in this thesis.
This document outlines different components of permaculture food systems, including:
1. Various food groups like fruits, vegetables, legumes, and animal foods that can be grown.
2. Elements that support the soil like nitrogen-fixing legumes, compost, mulch, and deep-rooted plants.
3. Vertical elements like climbers, trees, and structures that other plants can be supported on.
4. Ground covers and plants that protect the system from pests.
5. Integrated approaches that combine elements like fish ponds, water features, and animals.
The document outlines a school health and nutrition strategy in 3 sentences:
The strategy promotes safe, adequate, and healthy learning environments; integrates health and nutrition interventions into the curriculum; and has community nurses visit schools to assess, diagnose, treat, and refer students, while also distributing vitamin supplements and deworming medication.
Presentation delivered by Don Ross, Executive Director of the Frontenac Arch Biosphere Reserve at the November 17th "Economies in Transition" forum hosted by The Ontario Rural Council and the Municipal Cultural Planning Partnership.
Veselin Nikolov shared lessons he learned from working on WordPress.com. Some key lessons included keeping things simple with queries, code, and classes; avoiding repetition which can introduce errors; thoroughly testing features with A/B testing and unit tests before deployment; and not launching big projects on Fridays due to increased likelihood of encountering unexpected issues. He told stories of incidents where violating these principles led to broken functionality and unexpected outcomes.
The document summarizes two productive school environment programs in Malawi. The Junior Farmer Field & Life School program operates at 41 sites across 6 districts, training 123 facilitators to work with 1,640 youth. The schools are provided with gardening supplies and take-home kits. The Permaculture program aims to implement sustainable practices like composting toilets and diverse food production in all schools. It has operated in 8 districts across 40 primary schools and 11 teacher centers, training over 1,400 teachers, students, and community members. Preliminary reports suggest it has positively impacted homes, eating habits, and information sharing.
This document discusses three Photoshop tools: Blur, which allows setting the size to blur areas; Sharpen, which allows setting the size to sharpen selected areas; and Smudge, which allows setting the size to smudge or smear areas. The document ends lesson number 3.
This Photoshop tutorial document covers techniques for creating special text effects including horizontal and vertical text, text with horizontal and vertical masks, and special effects. It concludes with a lesson on rasterizing text.
This document discusses best practices for Git workflows including using branches for local and remote work, tagging versions using semantic versioning, and flows for coding, testing, reviewing, and releasing or rejecting changes. It also covers different specific workflows such as trunk-based development, Nvie workflow, GitHub workflow, and examples from Facebook and other companies.
The document lists 25 ways to improve health, including practicing good oral hygiene like brushing twice a day and visiting the dentist regularly, getting sufficient rest, eating a balanced diet with vegetables, exercising, spending time with friends, and maintaining a positive outlook through forgiveness and celebrating occasions. Following these tips can make a person happier and healthier.
Presentation delivered by Rebecca Cann, Cultural Planning Supervisor, City of St. Catharines at The Ontario Rural Council's municipal cultural planning forum, "Economies in Transition" on November 17, 2008 in Brockville.
Grey Visual Design Web Site Mini-PortfolioGrey Visual
The document lists the names of various clients and projects for Grey Visual Design, a company that provides design services for web and print. It includes 11 clients ranging from publishers and bloggers to non-profits and manufacturers. Each entry lists the client name followed by a brief description of the project and Grey Visual Design's contact information.
Adaptive Replication for Elastic Data Stream ProcessingZbigniew Jerzak
A major challenge for cloud-based systems is to be fault tolerant so as to cope with an increasing probability of faults in cloud environments. This is especially true for in-memory computing solutions like data stream processing systems, where a single host failure might result in an unrecoverable information loss.
In state of the art data streaming systems either active replication or upstream backup are applied to ensure fault tolerance, which have a high resource overhead or a high recovery time respectively. This paper combines these two fault tolerance mechanisms in one system to minimize the number of violations of a user-defined recovery time threshold and to reduce the overall resource consumption compared to active replication. The system switches for individual operators between both replication techniques dynamically based on the current workload characteristics. Our approach is implemented as an extension of an elastic data stream processing engine, which is able to reduce the number of used hosts due to the smaller replication overhead. Based on a real-world evaluation we show that our system is able to reduce the resource usage by up to 19% compared to an active replication scheme.
Optimization of Continuous Queries in Federated Database and Stream Processin...Zbigniew Jerzak
The constantly increasing number of connected devices and sensors results in increasing volume and velocity of sensor-based streaming data. Traditional approaches for processing high velocity sensor data rely on stream processing engines. However, the increasing complexity of continuous queries executed on top of high velocity data has resulted in growing demand for federated systems composed of data stream processing engines and database engines. One of major challenges for such systems is to devise the optimal query execution plan to maximize the throughput of continuous queries.
In this paper we present a general framework for federated database and stream processing systems, and introduce the design and implementation of a cost-based optimizer for optimizing relational continuous queries in such systems. Our optimizer uses characteristics of continuous queries and source data streams to devise an optimal placement for each operator of a continuous query. This fine level of optimization, combined with the estimation of the feasibility of query plans, allows our optimizer to devise query plans which result in 8 times higher throughput as compared to the baseline approach which uses only stream processing engines. Moreover, our experimental results showed that even for simple queries, a hybrid execution plan can result in 4 times and 1.6 times higher throughput than a pure stream processing engine plan and a pure database engine plan, respectively.
Visual analysis of high-volume time series data is ubiquitous in many industries, including finance, banking, and discrete manufacturing. Contemporary, RDBMS-based systems for visualization of high-volume time series data have difficulty to cope with the hard latency requirements of interactive visualizations and dissipate a lot expensive network bandwidth. Current solutions for lowering the volume of time series data disregard the properties of the resulting visualization and achieve only poor visualization quality.
In this work, we introduce M4, a simple aggregation-based time series dimensionality reduction technique that is superior to existing approaches, in that it provides lower visualization errors at higher data reduction ratios. Focusing on the semantic of line charts, as the predominant form of time-series visualization, we explain in detail, why current data reduction techniques fail and how our approach achieves superiority by respecting the process of line rasterization. We describe how to incorporate the proposed aggregation model already at the query-level in a visualization-driven query-
rewriting system. Our approach is generic and applicable to any visualization system that relies on relational data sources. Using real world data sets from high tech manufacturing, stock markets, and engineering domains we demonstrate that our visualization-oriented data aggregation can reduce data volumes by up to two orders of magnitude, while preserving perfect visualizations.
Latency-aware Elastic Scaling for Distributed Data Stream Processing SystemsZbigniew Jerzak
Elastic scaling allows a data stream processing system to react to a dynamically changing query or event workload by automatically scaling in or out. Thereby, both unpredictable load peaks as well as underload situations can be handled. However, each scaling decision comes with a latency penalty due to the required operator movements. Therefore, in practice an elastic system might be able to improve the system utilization, however it is not able to provide latency guarantees defined by a service level agreement (SLA). In this paper we introduce an elastic scaling system, which optimizes the utilization under certain latency constraints defined by a SLA. Specifically, we present a model, which estimates the latency spike created by a set of operator movements. We use this model to build a latency-aware elastic operator placement algorithm, which minimizes the number of latency violations. We show that our solution is able to reduce the 90th percentile of the end to end latency by up to 30% and reduce the number of latency violations by 50%. The achieved system utilization for our approach is comparable to a scaling strategy, which does not use latency as optimization target.
ThesisXSiena: The Content-Based Publish/Subscribe SystemZbigniew Jerzak
Just as packet switched networks constituted a major breakthrough in our
perception of the information exchange in computer networks so have the
decoupling properties of publish/subscribe systems revolutionized the way
we look at networking in the context of large scale distributed systems. The
decoupling of the components of publish/subscribe systems in time, space and
synchronization has created an appealing platform for the asynchronous information
exchange among anonymous information producers and consumers.
Moreover, the content-based nature of publish/subscribe systems provides a
great degree of flexibility and expressiveness as far as construction of data
flows is considered.
However, a number of challenges and not yet addressed issued still exists in the
area of the publish/subscribe systems. One active area of research is directed
toward the problem of the ecient content delivery in the content-based publish
/subscribe networks. Routing of the information based on the information
itself, instead of the explicit source and destination addresses poses challenges
as far as eciency and processing times are concerned. Simultaneously, due
to their decoupled nature, publish/subscribe systems introduce new challenges
with respect to issues related to dependability and fail-awareness.
This thesis seeks to advance the field of research in both directions. First it
shows the design and implementation of routing algorithms based on the end-toend
systems design principle. Proposed routing algorithms obsolete the need to
perform content-based routing within the publish/subscribe network, pushing
this task to the edge of the system. Moreover, this thesis presents a fail-aware
approach towards construction of the content-based publish/subscribe system
along with its application to the creation of the soft state publish/subscribe
system. A soft state publish/subscribe system exposes the self stabilizing
behavior as far as transient timing, link and node failures are concerned. The
result of this thesis is a family of the XSiena content-based publish/subscribe
systems, implementing the proposed concepts and algorithms. The family
of the XSiena content-based publish/subscribe systems has been a subject to
rigorous evaluation, which confirms the claims made in this thesis.
This document outlines different components of permaculture food systems, including:
1. Various food groups like fruits, vegetables, legumes, and animal foods that can be grown.
2. Elements that support the soil like nitrogen-fixing legumes, compost, mulch, and deep-rooted plants.
3. Vertical elements like climbers, trees, and structures that other plants can be supported on.
4. Ground covers and plants that protect the system from pests.
5. Integrated approaches that combine elements like fish ponds, water features, and animals.
The document outlines a school health and nutrition strategy in 3 sentences:
The strategy promotes safe, adequate, and healthy learning environments; integrates health and nutrition interventions into the curriculum; and has community nurses visit schools to assess, diagnose, treat, and refer students, while also distributing vitamin supplements and deworming medication.
Presentation delivered by Don Ross, Executive Director of the Frontenac Arch Biosphere Reserve at the November 17th "Economies in Transition" forum hosted by The Ontario Rural Council and the Municipal Cultural Planning Partnership.
Veselin Nikolov shared lessons he learned from working on WordPress.com. Some key lessons included keeping things simple with queries, code, and classes; avoiding repetition which can introduce errors; thoroughly testing features with A/B testing and unit tests before deployment; and not launching big projects on Fridays due to increased likelihood of encountering unexpected issues. He told stories of incidents where violating these principles led to broken functionality and unexpected outcomes.
The document summarizes two productive school environment programs in Malawi. The Junior Farmer Field & Life School program operates at 41 sites across 6 districts, training 123 facilitators to work with 1,640 youth. The schools are provided with gardening supplies and take-home kits. The Permaculture program aims to implement sustainable practices like composting toilets and diverse food production in all schools. It has operated in 8 districts across 40 primary schools and 11 teacher centers, training over 1,400 teachers, students, and community members. Preliminary reports suggest it has positively impacted homes, eating habits, and information sharing.
This document discusses three Photoshop tools: Blur, which allows setting the size to blur areas; Sharpen, which allows setting the size to sharpen selected areas; and Smudge, which allows setting the size to smudge or smear areas. The document ends lesson number 3.
This Photoshop tutorial document covers techniques for creating special text effects including horizontal and vertical text, text with horizontal and vertical masks, and special effects. It concludes with a lesson on rasterizing text.
This document discusses best practices for Git workflows including using branches for local and remote work, tagging versions using semantic versioning, and flows for coding, testing, reviewing, and releasing or rejecting changes. It also covers different specific workflows such as trunk-based development, Nvie workflow, GitHub workflow, and examples from Facebook and other companies.
The document lists 25 ways to improve health, including practicing good oral hygiene like brushing twice a day and visiting the dentist regularly, getting sufficient rest, eating a balanced diet with vegetables, exercising, spending time with friends, and maintaining a positive outlook through forgiveness and celebrating occasions. Following these tips can make a person happier and healthier.
Presentation delivered by Rebecca Cann, Cultural Planning Supervisor, City of St. Catharines at The Ontario Rural Council's municipal cultural planning forum, "Economies in Transition" on November 17, 2008 in Brockville.
Grey Visual Design Web Site Mini-PortfolioGrey Visual
The document lists the names of various clients and projects for Grey Visual Design, a company that provides design services for web and print. It includes 11 clients ranging from publishers and bloggers to non-profits and manufacturers. Each entry lists the client name followed by a brief description of the project and Grey Visual Design's contact information.
Adaptive Replication for Elastic Data Stream ProcessingZbigniew Jerzak
A major challenge for cloud-based systems is to be fault tolerant so as to cope with an increasing probability of faults in cloud environments. This is especially true for in-memory computing solutions like data stream processing systems, where a single host failure might result in an unrecoverable information loss.
In state of the art data streaming systems either active replication or upstream backup are applied to ensure fault tolerance, which have a high resource overhead or a high recovery time respectively. This paper combines these two fault tolerance mechanisms in one system to minimize the number of violations of a user-defined recovery time threshold and to reduce the overall resource consumption compared to active replication. The system switches for individual operators between both replication techniques dynamically based on the current workload characteristics. Our approach is implemented as an extension of an elastic data stream processing engine, which is able to reduce the number of used hosts due to the smaller replication overhead. Based on a real-world evaluation we show that our system is able to reduce the resource usage by up to 19% compared to an active replication scheme.
Optimization of Continuous Queries in Federated Database and Stream Processin...Zbigniew Jerzak
The constantly increasing number of connected devices and sensors results in increasing volume and velocity of sensor-based streaming data. Traditional approaches for processing high velocity sensor data rely on stream processing engines. However, the increasing complexity of continuous queries executed on top of high velocity data has resulted in growing demand for federated systems composed of data stream processing engines and database engines. One of major challenges for such systems is to devise the optimal query execution plan to maximize the throughput of continuous queries.
In this paper we present a general framework for federated database and stream processing systems, and introduce the design and implementation of a cost-based optimizer for optimizing relational continuous queries in such systems. Our optimizer uses characteristics of continuous queries and source data streams to devise an optimal placement for each operator of a continuous query. This fine level of optimization, combined with the estimation of the feasibility of query plans, allows our optimizer to devise query plans which result in 8 times higher throughput as compared to the baseline approach which uses only stream processing engines. Moreover, our experimental results showed that even for simple queries, a hybrid execution plan can result in 4 times and 1.6 times higher throughput than a pure stream processing engine plan and a pure database engine plan, respectively.
Visual analysis of high-volume time series data is ubiquitous in many industries, including finance, banking, and discrete manufacturing. Contemporary, RDBMS-based systems for visualization of high-volume time series data have difficulty to cope with the hard latency requirements of interactive visualizations and dissipate a lot expensive network bandwidth. Current solutions for lowering the volume of time series data disregard the properties of the resulting visualization and achieve only poor visualization quality.
In this work, we introduce M4, a simple aggregation-based time series dimensionality reduction technique that is superior to existing approaches, in that it provides lower visualization errors at higher data reduction ratios. Focusing on the semantic of line charts, as the predominant form of time-series visualization, we explain in detail, why current data reduction techniques fail and how our approach achieves superiority by respecting the process of line rasterization. We describe how to incorporate the proposed aggregation model already at the query-level in a visualization-driven query-
rewriting system. Our approach is generic and applicable to any visualization system that relies on relational data sources. Using real world data sets from high tech manufacturing, stock markets, and engineering domains we demonstrate that our visualization-oriented data aggregation can reduce data volumes by up to two orders of magnitude, while preserving perfect visualizations.
Latency-aware Elastic Scaling for Distributed Data Stream Processing SystemsZbigniew Jerzak
Elastic scaling allows a data stream processing system to react to a dynamically changing query or event workload by automatically scaling in or out. Thereby, both unpredictable load peaks as well as underload situations can be handled. However, each scaling decision comes with a latency penalty due to the required operator movements. Therefore, in practice an elastic system might be able to improve the system utilization, however it is not able to provide latency guarantees defined by a service level agreement (SLA). In this paper we introduce an elastic scaling system, which optimizes the utilization under certain latency constraints defined by a SLA. Specifically, we present a model, which estimates the latency spike created by a set of operator movements. We use this model to build a latency-aware elastic operator placement algorithm, which minimizes the number of latency violations. We show that our solution is able to reduce the 90th percentile of the end to end latency by up to 30% and reduce the number of latency violations by 50%. The achieved system utilization for our approach is comparable to a scaling strategy, which does not use latency as optimization target.
Auto-scaling Techniques for Elastic Data Stream ProcessingZbigniew Jerzak
An elastic data stream processing system is able to handle changes in workload by dynamically scaling out and
scaling in. This allows for handling of unexpected load spikes without the need for constant overprovisioning. One of the major challenges for an elastic system is to find the right point in time to scale in or to scale out. Finding such a point is difficult as it depends on constantly changing workload and system characteristics. In this paper we investigate the application of different auto-scaling techniques for solving this problem. Specifically: (1) we formulate basic requirements for an autoscaling technique used in an elastic data stream processing system, (2) we use the formulated requirements to select the best auto scaling techniques, and (3) we perform evaluation of the selected auto scaling techniques using the real world data. Our experiments show that the auto scaling techniques used in existing elastic data stream processing systems are performing worse than the strategies used in our work.
Elastic Scaling of a High-Throughput Content-Based Publish/Subscribe EngineZbigniew Jerzak
Publish/subscribe (pub/sub) infrastructures, running as a service in cloud environments, offer simplicity and flexibility for composing distributed applications. Provisioning them appropriately is, however, challenging. The amount of stored subscriptions and incoming publications varies over time, and the computational cost depends on the nature of the applications and in particular on the filtering operations they require, e.g., content-based vs. topic-based, encrypted vs. non-encrypted filtering. The ability to elastically adapt the amount of resources required to sustain given throughput and delay requirements is key to achieving cost-effectiveness for a pub/sub service running in a cloud environment. In this paper, we present the design and evaluation of an elastic content-based pub/sub system: eStreamHub. Specific contributions of this paper include: (1) a mechanism for dynamic scaling, both in and out, of stateful and stateless pub/sub operators, (2) a local and global elasticity policy enforcer maintaining high system utilization and stable end-to-end latencies, and (3) an evaluation using real-world tick workload from the Frankfurt Stock Exchange and encrypted content-based filtering.
Within this tutorial we present the results of recent research about the cloud enablement of data streaming systems. We illustrate, based on both industrial as well as academic prototypes, new emerging uses cases and research trends. Specifically, we focus on novel approaches for (1) fault tolerance and (2) scalability in large scale distributed streaming systems. In general, new fault tolerance mechanisms strive to be more robust and at the same time introduce less overhead. Novel load balancing approaches focus on elastic scaling over hundreds of instances based on the data and query workload. Finally, we present open challenges for the next generation of cloud-based data stream processing engines.
Introduction: What is clock synchronization?
The challenges of clock synchronization.
Basic Concepts: Software and hardware clocks. Basic clock synchronization algorithm
Algorithms: Deep dive into landmark papers
NTP: Internet scale time synchronization
XSiena: The Content-Based Publish/Subscribe SystemZbigniew Jerzak
This document is a slide presentation about content-based publish-subscribe systems. It discusses the evolution of networking from telephone systems to packet switching and then to content-based publish-subscribe. It describes key concepts of publish-subscribe like publishers, subscribers, events, and brokers. It also covers content-based matching and routing approaches and challenges like reusing matching results. Finally, it introduces Bloom filter-based routing techniques.
This document presents a talk on building soft state in publish/subscribe systems. It discusses challenges in distributed systems like unpredictable network latencies and failures. It proposes using an estimated link uncertainty to extend advertisement and subscription validity periods in order to cope with failures and latency variations. This allows the system state to be lost temporarily without disruption of system functionality, making the system survivable. The approach is evaluated on PlanetLab using different publish/subscribe implementations.
The document appears to be a presentation about a highly available publish/subscribe system for handling message overloads. It discusses using a value-based approach to prioritize messages, load shedding techniques like dropping subscriptions from overloaded nodes, and using a market-based approach for fairness. Evaluation of the system showed it could dynamically adapt to changing loads while maintaining decoupling of publications and subscriptions.
The document appears to be a presentation about a new approach for publish/subscribe systems called prefix forwarding. Some key points:
- It proposes a new routing structure called the routing tree for matching events to filters and a forwarding prefix tree for efficiently forwarding events.
- The goal is to decouple content and forwarding to only match events once and avoid false negatives.
- It presents the new approach and contributions, then outlines the topics to be covered including subscribing, publishing, how the routing tree works for matching, and filter insertion into the routing tree.
In this paper we present a wide area distributed
system using a content-based publish/subscribe communication middleware
which can deterministically detect and report failures with respect to
timely message delivery and message omission. Our approach does not require
external clock synchronization nor does it impose any constraints on the
publish/subscribe middleware. We show that our system performs better and is
safer than when using NTP for external clock synchronization. We provide a
proof of concept implementation and present results of experiments carried
out in the PlanetLab environment.
Existing clock synchronization algorithms assume a
bounded clock reading error. This, in turn, results in an inflexible design
that typically requires node crashes whenever the given bound might be
violated. We propose a novel, adaptive internal clock synchronization
algorithm which allows to compute the deviation between the clocks during
runtime. The computed deviation can be propagated to the application layer
to allow it to adapt its behavior according to the current clock deviation.
The contributions of this paper are: (1) a new specification of a relaxed
clock synchronization problem, and (2) a new clock synchronization algorithm
with a novel approach to dealing with crash failures.
Ivanti’s Patch Tuesday breakdown goes beyond patching your applications and brings you the intelligence and guidance needed to prioritize where to focus your attention first. Catch early analysis on our Ivanti blog, then join industry expert Chris Goettl for the Patch Tuesday Webinar Event. There we’ll do a deep dive into each of the bulletins and give guidance on the risks associated with the newly-identified vulnerabilities.
5th LF Energy Power Grid Model Meet-up SlidesDanBrown980551
5th Power Grid Model Meet-up
It is with great pleasure that we extend to you an invitation to the 5th Power Grid Model Meet-up, scheduled for 6th June 2024. This event will adopt a hybrid format, allowing participants to join us either through an online Mircosoft Teams session or in person at TU/e located at Den Dolech 2, Eindhoven, Netherlands. The meet-up will be hosted by Eindhoven University of Technology (TU/e), a research university specializing in engineering science & technology.
Power Grid Model
The global energy transition is placing new and unprecedented demands on Distribution System Operators (DSOs). Alongside upgrades to grid capacity, processes such as digitization, capacity optimization, and congestion management are becoming vital for delivering reliable services.
Power Grid Model is an open source project from Linux Foundation Energy and provides a calculation engine that is increasingly essential for DSOs. It offers a standards-based foundation enabling real-time power systems analysis, simulations of electrical power grids, and sophisticated what-if analysis. In addition, it enables in-depth studies and analysis of the electrical power grid’s behavior and performance. This comprehensive model incorporates essential factors such as power generation capacity, electrical losses, voltage levels, power flows, and system stability.
Power Grid Model is currently being applied in a wide variety of use cases, including grid planning, expansion, reliability, and congestion studies. It can also help in analyzing the impact of renewable energy integration, assessing the effects of disturbances or faults, and developing strategies for grid control and optimization.
What to expect
For the upcoming meetup we are organizing, we have an exciting lineup of activities planned:
-Insightful presentations covering two practical applications of the Power Grid Model.
-An update on the latest advancements in Power Grid -Model technology during the first and second quarters of 2024.
-An interactive brainstorming session to discuss and propose new feature requests.
-An opportunity to connect with fellow Power Grid Model enthusiasts and users.
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
This presentation provides valuable insights into effective cost-saving techniques on AWS. Learn how to optimize your AWS resources by rightsizing, increasing elasticity, picking the right storage class, and choosing the best pricing model. Additionally, discover essential governance mechanisms to ensure continuous cost efficiency. Whether you are new to AWS or an experienced user, this presentation provides clear and practical tips to help you reduce your cloud costs and get the most out of your budget.
Best 20 SEO Techniques To Improve Website Visibility In SERPPixlogix Infotech
Boost your website's visibility with proven SEO techniques! Our latest blog dives into essential strategies to enhance your online presence, increase traffic, and rank higher on search engines. From keyword optimization to quality content creation, learn how to make your site stand out in the crowded digital landscape. Discover actionable tips and expert insights to elevate your SEO game.
Monitoring and Managing Anomaly Detection on OpenShift.pdfTosin Akinosho
Monitoring and Managing Anomaly Detection on OpenShift
Overview
Dive into the world of anomaly detection on edge devices with our comprehensive hands-on tutorial. This SlideShare presentation will guide you through the entire process, from data collection and model training to edge deployment and real-time monitoring. Perfect for those looking to implement robust anomaly detection systems on resource-constrained IoT/edge devices.
Key Topics Covered
1. Introduction to Anomaly Detection
- Understand the fundamentals of anomaly detection and its importance in identifying unusual behavior or failures in systems.
2. Understanding Edge (IoT)
- Learn about edge computing and IoT, and how they enable real-time data processing and decision-making at the source.
3. What is ArgoCD?
- Discover ArgoCD, a declarative, GitOps continuous delivery tool for Kubernetes, and its role in deploying applications on edge devices.
4. Deployment Using ArgoCD for Edge Devices
- Step-by-step guide on deploying anomaly detection models on edge devices using ArgoCD.
5. Introduction to Apache Kafka and S3
- Explore Apache Kafka for real-time data streaming and Amazon S3 for scalable storage solutions.
6. Viewing Kafka Messages in the Data Lake
- Learn how to view and analyze Kafka messages stored in a data lake for better insights.
7. What is Prometheus?
- Get to know Prometheus, an open-source monitoring and alerting toolkit, and its application in monitoring edge devices.
8. Monitoring Application Metrics with Prometheus
- Detailed instructions on setting up Prometheus to monitor the performance and health of your anomaly detection system.
9. What is Camel K?
- Introduction to Camel K, a lightweight integration framework built on Apache Camel, designed for Kubernetes.
10. Configuring Camel K Integrations for Data Pipelines
- Learn how to configure Camel K for seamless data pipeline integrations in your anomaly detection workflow.
11. What is a Jupyter Notebook?
- Overview of Jupyter Notebooks, an open-source web application for creating and sharing documents with live code, equations, visualizations, and narrative text.
12. Jupyter Notebooks with Code Examples
- Hands-on examples and code snippets in Jupyter Notebooks to help you implement and test anomaly detection models.
Nunit vs XUnit vs MSTest Differences Between These Unit Testing Frameworks.pdfflufftailshop
When it comes to unit testing in the .NET ecosystem, developers have a wide range of options available. Among the most popular choices are NUnit, XUnit, and MSTest. These unit testing frameworks provide essential tools and features to help ensure the quality and reliability of code. However, understanding the differences between these frameworks is crucial for selecting the most suitable one for your projects.
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
Programming Foundation Models with DSPy - Meetup SlidesZilliz
Prompting language models is hard, while programming language models is easy. In this talk, I will discuss the state-of-the-art framework DSPy for programming foundation models with its powerful optimizers and runtime constraint system.
A Comprehensive Guide to DeFi Development Services in 2024Intelisync
DeFi represents a paradigm shift in the financial industry. Instead of relying on traditional, centralized institutions like banks, DeFi leverages blockchain technology to create a decentralized network of financial services. This means that financial transactions can occur directly between parties, without intermediaries, using smart contracts on platforms like Ethereum.
In 2024, we are witnessing an explosion of new DeFi projects and protocols, each pushing the boundaries of what’s possible in finance.
In summary, DeFi in 2024 is not just a trend; it’s a revolution that democratizes finance, enhances security and transparency, and fosters continuous innovation. As we proceed through this presentation, we'll explore the various components and services of DeFi in detail, shedding light on how they are transforming the financial landscape.
At Intelisync, we specialize in providing comprehensive DeFi development services tailored to meet the unique needs of our clients. From smart contract development to dApp creation and security audits, we ensure that your DeFi project is built with innovation, security, and scalability in mind. Trust Intelisync to guide you through the intricate landscape of decentralized finance and unlock the full potential of blockchain technology.
Ready to take your DeFi project to the next level? Partner with Intelisync for expert DeFi development services today!
How to Interpret Trends in the Kalyan Rajdhani Mix Chart.pdfChart Kalyan
A Mix Chart displays historical data of numbers in a graphical or tabular form. The Kalyan Rajdhani Mix Chart specifically shows the results of a sequence of numbers over different periods.
Main news related to the CCS TSI 2023 (2023/1695)Jakub Marek
An English 🇬🇧 translation of a presentation to the speech I gave about the main changes brought by CCS TSI 2023 at the biggest Czech conference on Communications and signalling systems on Railways, which was held in Clarion Hotel Olomouc from 7th to 9th November 2023 (konferenceszt.cz). Attended by around 500 participants and 200 on-line followers.
The original Czech 🇨🇿 version of the presentation can be found here: https://www.slideshare.net/slideshow/hlavni-novinky-souvisejici-s-ccs-tsi-2023-2023-1695/269688092 .
The videorecording (in Czech) from the presentation is available here: https://youtu.be/WzjJWm4IyPk?si=SImb06tuXGb30BEH .
Skybuffer SAM4U tool for SAP license adoptionTatiana Kojar
Manage and optimize your license adoption and consumption with SAM4U, an SAP free customer software asset management tool.
SAM4U, an SAP complimentary software asset management tool for customers, delivers a detailed and well-structured overview of license inventory and usage with a user-friendly interface. We offer a hosted, cost-effective, and performance-optimized SAM4U setup in the Skybuffer Cloud environment. You retain ownership of the system and data, while we manage the ABAP 7.58 infrastructure, ensuring fixed Total Cost of Ownership (TCO) and exceptional services through the SAP Fiori interface.
Introduction of Cybersecurity with OSS at Code Europe 2024Hiroshi SHIBATA
I develop the Ruby programming language, RubyGems, and Bundler, which are package managers for Ruby. Today, I will introduce how to enhance the security of your application using open-source software (OSS) examples from Ruby and RubyGems.
The first topic is CVE (Common Vulnerabilities and Exposures). I have published CVEs many times. But what exactly is a CVE? I'll provide a basic understanding of CVEs and explain how to detect and handle vulnerabilities in OSS.
Next, let's discuss package managers. Package managers play a critical role in the OSS ecosystem. I'll explain how to manage library dependencies in your application.
I'll share insights into how the Ruby and RubyGems core team works to keep our ecosystem safe. By the end of this talk, you'll have a better understanding of how to safeguard your code.
Introduction of Cybersecurity with OSS at Code Europe 2024
Bloom Filter Based Routing for Content-Based Publish/Subscribe
1. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 1 of 27 slides
Bloom Filter Based Routing for Content-Based
Publish/Subscribe
DEBS 2008
Zbigniew Jerzak and Christof Fetzer
Systems Engineering Group, Dresden University of Technology
Wednesday 2nd July, 2008
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
2. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 2 of 27 slides
Event forwarding ([CRW01]: siena, [TK06]: forest)
100000
siena
forest
10000
time [ms]
1000
100
0 5000 10000 15000 20000 25000 30000
# filters
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
3. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 3 of 27 slides
Subscription routing ([CRW01]: siena, [TK06]: forest)
1e+06
siena
forest
100000
time [ms]
10000
1000
100
0 5000 10000 15000 20000 25000 30000
# filters
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
4. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 4 of 27 slides
Motivation
Efficient End-to-End transmission delays
More flexible edge routing approach [JF07]
A flexible communication substrate for event processing
systems
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
5. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 5 of 27 slides
Our Contributions
New routing structures and algorithms:
applicable for both traditional and edge routing
sbsposet – predicate storage and coverage
sbstree – management of disjunctions of predicates
conjunctions
Content summarisation using Bloom filters [Blo70]
not imposing any limitation on the type and content of the
events/subscriptions
sparse Bloom filters for space complexity
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
6. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 5 of 27 slides
Our Contributions
New routing structures and algorithms:
applicable for both traditional and edge routing
sbsposet – predicate storage and coverage
sbstree – management of disjunctions of predicates
conjunctions
Content summarisation using Bloom filters [Blo70]
not imposing any limitation on the type and content of the
events/subscriptions
sparse Bloom filters for space complexity
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
7. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 6 of 27 slides
Publish/Subscribe Model
Decoupled [EFGK03] communication...
...between publishers and subscribers via routers
...using subscriptions (conjunction of predicates)
...and events (disjunction of predicates)
...based on their content
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
8. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 6 of 27 slides
Publish/Subscribe Model
Decoupled [EFGK03] communication...
...between publishers and subscribers via routers
...using subscriptions (conjunction of predicates)
...and events (disjunction of predicates)
...based on their content
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
9. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 6 of 27 slides
Publish/Subscribe Model
Decoupled [EFGK03] communication...
...between publishers and subscribers via routers
...using subscriptions (conjunction of predicates)
movie = ”star wars” AND price < 15
p () 0 p1 ()
...and events (disjunction of predicates)
...based on their content
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
10. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 6 of 27 slides
Publish/Subscribe Model
Decoupled [EFGK03] communication...
...between publishers and subscribers via routers
...using subscriptions (conjunction of predicates)
...and events (disjunction of predicates)
movie = ”batman” OR price = 15.5
an0 av0 an1 av1
...based on their content
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
11. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 6 of 27 slides
Publish/Subscribe Model
Decoupled [EFGK03] communication...
...between publishers and subscribers via routers
...using subscriptions (conjunction of predicates)
...and events (disjunction of predicates)
...based on their content
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
12. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 7 of 27 slides
Event forwarding
An event e matches a subscription s (e s)
∀p∈s ∃{an,av }∈e : p ({an, av }) = true (1)
A broker contains |S| subscriptions:
∀s∈S : execute Equation 1 (2)
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
13. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 8 of 27 slides
Approach
An event e matches a subscription s (e s)
∀p∈s ∃{an,av }∈e : p ({an, av }) = true
Evaluate predicate functions
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
14. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 8 of 27 slides
Approach
An event e matches a subscription s (e s)
∀p∈s ∃{an,av }∈e : p ({an, av }) = true
Calculate of disjunction of conjunctions of predicates
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
15. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 9 of 27 slides
Overview: Subscription Routing
S
R
P
te sops bs
eer tsbs
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
16. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 9 of 27 slides
Overview: Subscription Routing
p1 p2 p3
S
R
P
tes opsb s
eert sbs
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
17. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 9 of 27 slides
Overview: Subscription Routing
p1 p2 p3
S
R
P
p
1 p 2 p3
tes opsb s
eert sbs
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
18. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 9 of 27 slides
Overview: Subscription Routing
p1 p2 p3
S
R
P
p p p
+ + +
1 2 3
tes opsb s
bf bf bf
1 2 3
eert sbs
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
19. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 9 of 27 slides
Overview: Subscription Routing
p1 p2 p3
S
R
P
p p p
+ + +
1 2 3
tes opsb s
bf bf bf
1 2 3
bf bf bf
1 2 3 eert sbs
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
20. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 10 of 27 slides
Overview: Event Forwarding
S
R
P
te sops bs
e erts bs
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
21. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 10 of 27 slides
Overview: Event Forwarding
an an an
av av av
1 2 3
S 1 2 3
R
P
te sops bs
e erts bs
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
22. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 10 of 27 slides
Overview: Event Forwarding
an an an
av av av
1 2 3
S 1 2 3
R
P
an an an
av av av
1 2 3
tes opsb s
1 2 3
eer tsbs
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
23. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 10 of 27 slides
Overview: Event Forwarding
an an an
av av av
1 2 3
S 1 2 3
R
P
an an an an an an
av av av
1 2 3
av av av
1 2 3 tes opsb s
1 2 3
+ + +
1 2 3
bf i bfj bf k
eer tsbs
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
24. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 10 of 27 slides
Overview: Event Forwarding
an an an
av av av
1 2 3
S 1 2 3
R
P
an an an an an an
av av av
1 2 3
av av av
1 2 3 tes opsb s
1 2 3
+ + +
1 2 3
bf bf bf
i ecafretni
i j k
eer tsbs j ecafretni
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
25. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 11 of 27 slides
SBSPoset
Stores subscriptions as:
disjunction of single predicates
ordered by the coverage relation
Every predicate is assigned a Bloom filter
which summarizes its content
and that of covering predicates
No limitations on the expressiveness of the subscription/event
language
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
26. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 12 of 27 slides
SBSPoset: subscription storage
x
llun y
7.0≥ llun
}81521 ,7872{
5> 5<
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
0=
}6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
27. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 12 of 27 slides
SBSPoset: subscription storage
:noitpircsbus weN 51>x 0>y
x
llun y
7.0≥ llun
}81521 ,7872{
5> 5<
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
0=
}6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
28. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 12 of 27 slides
SBSPoset: subscription storage
:noitpircsbus weN 51>x 0>y
x }28501 ,1446{ }6368 ,2015{
llun y
7.0≥ llun
}81521 ,7872{
5> 5<
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
0=
}6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
29. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 12 of 27 slides
SBSPoset: subscription storage
:noitpircsbus weN 51>x 0>y
x }28501 ,1446{ }6368 ,2015{
llun y
7.0≥ llun
}81521 ,7872{
5> 5<
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
51> 0=
}28501 ,1446{ }6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
30. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 12 of 27 slides
SBSPoset: subscription storage
:noitpircsbus weN 51>x 0>y
x }28501 ,1446{ }6368 ,2015{
llun y
7.0≥ llun
}81521 ,7872{
5> 5<
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
51> 0=
81521 ,28501 ,1858 ,1446 ,6606 ,7872{ } }6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
31. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 12 of 27 slides
SBSPoset: subscription storage
:noitpircsbus weN 51>x 0>y
x }28501 ,1446{ }6368 ,2015{
llun y
7.0≥ llun
}81521 ,7872{
5> 5< 0>
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
}6368 ,2015{
51> 0=
}81521 ,28501 ,1858 ,1446 ,6606 ,7872{ }6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
32. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 13 of 27 slides
SBSTree
Represents the disjunction of conjunctions of subscriptions’
predicates:
stores only Bloom filters
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
33. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 14 of 27 slides
SBSTree: subscription storage
llun
7305 1005 6606 1446 7872
6158 7058 1858 28501 81521
m o c.t o d @ 4 f m o c.t o d @ 5f moc.t od@1f m oc.tod @3f m o c.t o d @ 2f
:noitpircsbus weN 51>x 0>y
}28501 ,1446 { } 6 3 6 8 , 2 0 1 5{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
34. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 14 of 27 slides
SBSTree: subscription storage
llun
7305 1005 6606 1446 7872
6158 7058 1858 28501 81521
m o c.t o d @ 4f moc.tod @5f m o c.t o d @ 1f m o c.t o d @ 3f moc.to d@2f
:noitpircsbus weN 51>x 0>y
} 2 8 5 0 1 , 1 4 4 6{ }6368 ,2015 {
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
35. Zbigniew Jerzak and Christof Fetzer Bloom Filter Based Routing for Content-Based Publish/Subscribe
m o c.t o d @ 6f
}6368 ,2015 { } 2 8 5 0 1 , 1 4 4 6{
28501
0>y 51>x :noitpircsbus weN
6368
moc.to d@2f m o c.t o d @ 3f m o c.t o d @ 1f moc.tod @5f m o c.t o d @ 4f
81521 28501 1858 7058 1446 6158
7872 1446 6606 1005 2015 7305
llun
SBSTree: subscription storage
14 of 27 slides Summary Evaluation SBSPoset & SBSTree Background & Overview Motivation
36. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 15 of 27 slides
SBSPoset: event forwarding
:t n e v E 7=x 2-= y
x
ll u n y
7.0≥ ll u n
}81521 ,7872{
5> 5< 0>
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
}6368 ,2015{
51> 0=
}81521 ,28501 ,1858 ,1446 ,6606 ,7872{ }6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
37. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 15 of 27 slides
SBSPoset: event forwarding
:t n e v E 7=x 2-= y
x
ll u n y
7.0≥ ll u n
}81521 ,7872{
5> 5< 0>
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
}6368 ,2015{
51> 0=
}81521 ,28501 ,1858 ,1446 ,6606 ,7872{ }6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
38. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 15 of 27 slides
SBSPoset: event forwarding
:t n e v E 7=x 2-= y
x
ll u n y
7.0≥ ll u n
}81521 ,7872{
5> 5< 0>
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
}6368 ,2015{
51> 0=
}81521 ,28501 ,1858 ,1446 ,6606 ,7872{ }6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
39. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 15 of 27 slides
SBSPoset: event forwarding
:t n e v E 7=x 2-= y
x
ll u n y
7.0≥ ll u n
}81521 ,7872{
5> 5< 0>
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
}6368 ,2015{
51> 0=
}81521 ,28501 ,1858 ,1446 ,6606 ,7872{ }6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
40. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 15 of 27 slides
SBSPoset: event forwarding
:t n e v E 7=x 2-= y
x
ll u n y
7.0≥ ll u n
}81521 ,7872{
5> 5< 0>
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
}6368 ,2015{
51> 0=
}81521 ,28501 ,1858 ,1446 ,6606 ,7872{ }6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
41. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 15 of 27 slides
SBSPoset: event forwarding
:t n e v E 7=x 2-= y
x }81521 ,1858 ,6606 ,7872{
ll u n y
7.0≥ ll u n
}81521 ,7872{
5> 5< 0>
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
}6368 ,2015{
51> 0=
}81521 ,28501 ,1858 ,1446 ,6606 ,7872{ }6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
42. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 15 of 27 slides
SBSPoset: event forwarding
:t n e v E 7=x 2- = y
x }81521 ,1858 ,6606 ,7872{
ll u n y
7.0≥ llun
}81521 ,7872{
5> 5< 0>
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
}6368 ,2015{
51> 0=
}81521 ,28501 ,1858 ,1446 ,6606 ,7872{ }6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
43. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 15 of 27 slides
SBSPoset: event forwarding
:t n e v E 7=x 2- = y
x }81521 ,1858 ,6606 ,7872{
ll u n y
7.0≥ llun
}81521 ,7872{
5> 5< 0>
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
}6368 ,2015{
51> 0=
}81521 ,28501 ,1858 ,1446 ,6606 ,7872{ }6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
44. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 15 of 27 slides
SBSPoset: event forwarding
:t n e v E 7=x 2- = y
x }81521 ,1858 ,6606 ,7872{
ll u n y
7.0≥ llun
}81521 ,7872{
5> 5< 0>
}81521 ,1858 ,6606 ,7872{ }6158 ,7305{
}6368 ,2015{
51> 0=
}81521 ,28501 ,1858 ,1446 ,6606 ,7872{ }6158 ,7058 ,7305 ,1005{
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
45. Zbigniew Jerzak and Christof Fetzer Bloom Filter Based Routing for Content-Based Publish/Subscribe
}6158 ,7058 ,7305 ,1005{ }81521 ,28501 ,1858 ,1446 ,6606 ,7872{
0= 51>
}6368 ,2015{
}6158 ,7305{ }81521 ,1858 ,6606 ,7872{
0> 5< 5>
}81521 ,7872{
llun 7.0≥
y ll u n
}81521 ,1858 ,
6158 ,6606 ,7305 ,7872{
x
2- = y 7=x :t n e v E
SBSPoset: event forwarding
15 of 27 slides Summary Evaluation SBSPoset & SBSTree Background & Overview Motivation
46. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 16 of 27 slides
SBSTree: event forwarding
llun
7305 2015 1005 6606 1446 7872
6158 1446 7058 1858 28501 81521
moc.tod@4f moc.tod@5f moc.tod@1f moc.tod@3f moc.tod@2f
6368
28501 :tnevE 7=x 2-= y
}81521 ,1858 ,6158 ,6606 ,7305 ,7872{
moc.tod@6f
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
47. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 16 of 27 slides
SBSTree: event forwarding
llun
7305 2015 1005 6606 1446 7872
6158 1446 7058 1858 28501 81521
moc.tod@4f moc.tod@5f m o c.t o d @ 1f moc.tod@3f moc.tod@2f
6368
28501 :tnevE 7=x 2-=y
6 6 0 6 , 7 3 0 5 , 7 8 7 2{ }8 15 21 ,1 85 8 ,6 15 8 ,
moc.tod@6f
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
48. Zbigniew Jerzak and Christof Fetzer Bloom Filter Based Routing for Content-Based Publish/Subscribe
moc.tod@6f
} 8 1 5 2 1 , 1 8 5 8 , 6 1 5 8 , 6 6 0 6 , 7 3 0 5 , 7 8 7 2{
2-=y 7=x :tnevE 28501
6368
moc.tod@2f moc.tod@3f m o c .t o d @ 1f m o c.t o d @ 5f moc.tod@4f
81521 28501 1858 7058 1446 6158
7872 1446 6606 1005 2015 7305
llun
SBSTree: event forwarding
16 of 27 slides Summary Evaluation SBSPoset & SBSTree Background & Overview Motivation
49. Zbigniew Jerzak and Christof Fetzer Bloom Filter Based Routing for Content-Based Publish/Subscribe
moc.tod@6f
} 8 1 5 2 1 , 1 8 5 8 , 6 1 5 8 , 6 6 0 6 , 7 3 0 5 , 7 8 7 2{
28501
2-=y 7=x :tnevE
6368
moc.tod@2f moc.tod@3f m o c .t o d @ 1f m o c.t o d @ 5f moc.tod@4f
81521 28501 1858 7058 1446 6158
7872 1446 6606 1005 2015 7305
llun
SBSTree: event forwarding
16 of 27 slides Summary Evaluation SBSPoset & SBSTree Background & Overview Motivation
50. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 17 of 27 slides
Evaluation Environment
SIENA 1.5.4
http://www.inf.unisi.ch/carzaniga/siena/
Apache Mina
Stochastic Simulation in Java (SSJ) library
BloomFilter
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
51. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 17 of 27 slides
Evaluation Environment
SIENA 1.5.4
Apache Mina
http://mina.apache.org/
ver. 2.0.0-M1 as of 24th Jan 2008
Stochastic Simulation in Java (SSJ) library
BloomFilter
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
52. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 17 of 27 slides
Evaluation Environment
SIENA 1.5.4
Apache Mina
Stochastic Simulation in Java (SSJ) library
umontreal.iro.lecuyer.randvar.*
umontreal.iro.lecuyer.rng.*
BloomFilter
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
53. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 17 of 27 slides
Evaluation Environment
SIENA 1.5.4
Apache Mina
Stochastic Simulation in Java (SSJ) library
BloomFilter
http://wwwse.inf.tu-dresden.de/xsiena
Based on code by: Hongbin Liu and Arash Partow
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
54. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 18 of 27 slides
Event forwarding
100000
siena
forest
sbsposet
sbstree
10000
time [ms]
1000
100
10
0 5000 10000 15000 20000 25000 30000
# filters
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
55. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 19 of 27 slides
Subscription routing
1e+06
siena
forest
sbsposet
sbstree
100000
10000
time [ms]
1000
100
10
0 5000 10000 15000 20000 25000 30000
# filters
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
56. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 20 of 27 slides
TCP/IP Latency
1600
1 broker (local)
2 brokers (local)
1400 3 brokers (local)
1 broker (distributed)
2 brokers (distributed)
1200 3 brokers (distributed)
number of events
1000
800
600
400
200
0
0 1000 2000 3000 4000 5000 6000 7000
latency [µs]
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
57. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 21 of 27 slides
TCP/IP Throughput
18
local (1 broker)
local (2 brokers) 12
16 local (3 brokers)
distributed (1 broker)
14 distributed (2 brokers)
distributed (3 brokers) 10
12
K events / second
8
10
MB/s
8 6
6
4
4
2
2
0 0
1 2 3 4 5 6 7 8 9 10
K events sent
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
58. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 22 of 27 slides
Local Throughput
delievered events
100K
10K
1K
unfrm distr norm distr Pareto distr
500K
400K
events/second
300K
200K
100K
0K
10K 20K 30K 40K 50K 60K 70K 80K 90K 100K
# events
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
60. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 24 of 27 slides
Bloom Filter vs Sparse Bloom Filter
106
Bloom filter Sparse Bloom filter
memory consumption [KB]
105
104
103
0 20000 40000 60000 80000 100000 120000
# elements inserted
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
61. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 25 of 27 slides
Summary
Low latency, high throughput
Event forwarding based on Bloom filters
No restrictions on the subscription language
Decoupled management of predicates and their conjunctions
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
62. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 26 of 27 slides
Thank You!
http://wwwse.inf.tu-dresden.de/xsiena/
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer
63. Motivation Background & Overview SBSPoset & SBSTree Evaluation Summary 27 of 27 slides
References
Burton H. Bloom.
Space/time trade-offs in hash coding with allowable errors.
Communications of the ACM, 13(7):422–426, 1970.
Antonio Carzaniga, David S. Rosenblum, and Alexander L. Wolf.
Design and evaluation of a wide-area event notification service.
ACM Trans. Comput. Syst., 19(3):332–383, 2001.
Patrick Th. Eugster, Pascal A. Felber, Rachid Guerraoui, and Anne-Marie Kermarrec.
The many faces of publish/subscribe.
ACM Comput. Surv., 35(2):114–131, 2003.
Zbigniew Jerzak and Christof Fetzer.
Prefix forwarding for publish/subscribe.
In DEBS ’07: Proceedings of the 2007 Inaugural International Conference on Distributed Event-Based
Systems, pages 238–249, Toronto, Ontario, Canada, June 2007. ACM Press.
Sasu Tarkoma and Jaakko Kangasharju.
Optimizing content-based routers: posets and forests.
Distributed Computing, 19(1):62–77, September 2006.
Bloom Filter Based Routing for Content-Based Publish/Subscribe Zbigniew Jerzak and Christof Fetzer