Filters








11,739 Hits in 4.3 sec

Tree-Pattern Similarity Estimation for Scalable Content-based Routing

Raphael Chand, Pascal Felber, Minos Garofalakis
2007 2007 IEEE 23rd International Conference on Data Engineering  
In this paper, we propose a general framework and algorithmic tools for estimating different tree-pattern similarity metrics over continuous streams of XML documents.  ...  Discovering semantic communities of consumers with similar interests is an important requirement for scalable content-based systems: such "semantic clusters" of consumers play a critical role in the design  ...  Conclusions We have studied the problem of tree pattern similarity, an important concept for building scalable XML distribution networks.  ... 
doi:10.1109/icde.2007.368960 dblp:conf/icde/ChandFG07 fatcat:2irrcncubbgstjdc273wk5vasu

Effects of routing computations in content-based routing networks with mobile data sources

Vinod Muthusamy, Milenko Petrovic, Hans-Arno Jacobsen
2005 Proceedings of the 11th annual international conference on Mobile computing and networking - MobiCom '05  
Our results show that ignoring route computation time paints a false picture of the scalability of content-based routing networks, but that with appropriate protocols the adverse effects can be mitigated  ...  This paper presents the first quantitative evaluation of the role of routing computations on performance when mobility is introduced to a content-based routing network.  ...  This is not true for content-based routing protocols, and as we show in the paper, computation time must be taken into account when analyzing scalability of content-based routing protocols.  ... 
doi:10.1145/1080829.1080840 dblp:conf/mobicom/MuthusamyPJ05 fatcat:wvelnxv3dbcsrpn6vlns2fc35a

Shift-Based Parallel Image Compositing on InfiniBand TM Fat-Trees [article]

Xavier Cavin, Olivier Demengeon
2012 Eurographics Symposium on Parallel Graphics and Visualization  
We propose in this paper a new parallel image compositing algorithm, called Shift-Based, relying on a well-known communication pattern called shift permutation.  ...  Among the existing supercomputers, InfiniBandTM (IB) PC clusters, and their associated fat-tree topology, are clearly becoming the dominant architecture, as they provide the scalability, high bandwidth  ...  In particular, the Fat-tree Unicast routing engine available in the latest version of OpenSM provides routing tables for contention free shift communication pattern on var-ary ntrees [ZJKL10], a variant  ... 
doi:10.2312/egpgv/egpgv12/129-138 fatcat:dcqbvmno35enxcssnh3ibb4bri

MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks [chapter]

Fengyun Cao, Jaswinder Pal Singh
2005 Lecture Notes in Computer Science  
Design of distributed architectures for content-based publishsubscribe (pub-sub) service networks has been a challenging problem.  ...  To best support the highly dynamic and diversified content-based pub-sub communication, we propose a new architectural design called MEDYM -Match-Early with DYnamic Multicast.  ...  The main challenge for the approach is its routing accuracy. As discussed in Section 1, event traffic pattern in a content-based pub-sub system is highly diversified.  ... 
doi:10.1007/11587552_15 fatcat:sgkkdxsyezfyrlaw3ibflsmuqe

HyperCBR: Large-Scale Content-Based Routing in a Multidimensional Space

S. Castelli, P. Costa, G. P. Picco
2008 IEEE INFOCOM 2008 - The 27th Conference on Computer Communications  
Content-based routing (CBR) is becoming increasingly popular as a building block for distributed applications.  ...  CBR differs from classical routing paradigms as messages are routed based on their content rather than their destination address, which fosters decoupling and flexibility in the application's distributed  ...  Cost of Routing a Single Pattern p We can estimate the routing cost to disseminate subscriptions for a pattern p by counting the number of routes in S i , represented by arrows in Figure 1 .  ... 
doi:10.1109/infocom.2008.233 dblp:conf/infocom/CastelliCP08 fatcat:gravg4gldbdb7no2d6lmena7ii

HyperCBR: Large-Scale Content-Based Routing in a Multidimensional Space

S. Castelli, P. Costa, G. P. Picco
2008 2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications  
Content-based routing (CBR) is becoming increasingly popular as a building block for distributed applications.  ...  CBR differs from classical routing paradigms as messages are routed based on their content rather than their destination address, which fosters decoupling and flexibility in the application's distributed  ...  Cost of Routing a Single Pattern p We can estimate the routing cost to disseminate subscriptions for a pattern p by counting the number of routes in S i , represented by arrows in Figure 1 .  ... 
doi:10.1109/infocom.2007.233 fatcat:kfvfnk7iqjfdbn6zqjr4a6k3za

Efficient and Predictable Group Communication for Manycore NoCs [chapter]

Karthik Yagna, Onkar Patil, Frank Mueller
2016 Lecture Notes in Computer Science  
Due to these objectives, it is not feasible to simply resort to binomial trees for most collectives or other algorithms such as recursive doubling for allreduce since these algorithms are contention agnostic  ...  This neither requires dynamic computation of a routing schedule nor incurs scheduling overhead or memoization of large routing tables.  ...  This results in a communication pattern similar to ours under dimension order routing.  ... 
doi:10.1007/978-3-319-41321-1_20 fatcat:kz6wby24xzcfhjgpt3pty37xf4

Tree Pattern Aggregation for Scalable XML Data Dissemination [chapter]

Chee-Yong Chan, Wenfei Fan, Pascal Felber, Minos Garofalakis, Rajeev Rastogi
2002 VLDB '02: Proceedings of the 28th International Conference on Very Large Databases  
As part of our solution, we also develop several novel algorithms for tree-pattern containment and minimization, as well as "least-upper-bound" computation for a set of tree patterns.  ...  With the rapid growth of XML-document traffic on the Internet, scalable content-based dissemination of XML documents to a large, dynamic group of consumers has become an important research challenge.  ...  Effective support for scalable, content-based XML routing is crucial to enabling efficient and timely delivery of relevant XML documents to a large, dynamic group of consumers.  ... 
doi:10.1016/b978-155860869-6/50078-0 dblp:conf/vldb/ChanFFGR02 fatcat:svkxvutqazdzthoimacaggqnte

Scalable multi-hop routing in wireless networks

David Palma, Marilia Curado
2013 EURASIP Journal on Wireless Communications and Networking  
The obtained results reveal that this routing scheme outperforms existing routing protocols regardless of the mobility pattern being used, being consistently lighter in overhead and delivering up to 50%  ...  This approach uses a virtual hierarchy of clusters to explore the contextual-proximity of nodes, while reducing the total overhead of routing traffic even when compared with other cluster-based approaches  ...  Acknowledgements The authors were grateful to the anonymous referees for their valuable comments which greatly helped in improving the article.  ... 
doi:10.1186/1687-1499-2013-86 fatcat:kibwwnexcrhd3ljmlfleuhnkle

Table of contents

2013 2013 IEEE 9th International Conference on Emerging Technologies (ICET)  
Development of an On-board Diagnostic (OBD) Kit for Troubleshooting of Compliant Vehicles .  ...  Vertical Handover Mechanism between WLAN and EVDO Networks . 362 Shortest Path Tree Scaling Hierarchical Power Efficient Routing for Wireless Sensor Networks 367 Smart Trimming of Video from Edge, for  ...  Noise Sources 319 Region of Interest (ROI) Based Scalable Multiple Description Image Coding Using MDSQ-SR . 325 Comparison of Thermal and Visual Facial Imagery for use in Sparse Representation Based Facial  ... 
doi:10.1109/icet.2013.6743554 fatcat:2yme674xynedvlyph5jgzq4xhi

Is information-centric multi-tree routing feasible?

Antonio Carzaniga, Koorosh Khazaei, Michele Papalini, Alexander L. Wolf
2013 Computer communication review  
In this paper we present a concrete routing scheme that realizes this: "push" as well as "pull" communication; anycast as well as multicast; and descriptor-based (as opposed to name-based) addressing.  ...  On each tree, the scheme combines addresses so as to reduce forwarding state.  ...  ROUTING SCHEME We propose a routing scheme based on multiple trees.  ... 
doi:10.1145/2534169.2491230 fatcat:2qtmlu6rxzb4fidg2oruijb3qy

Is information-centric multi-tree routing feasible?

Antonio Carzaniga, Koorosh Khazaei, Michele Papalini, Alexander L. Wolf
2013 Proceedings of the 3rd ACM SIGCOMM workshop on Information-centric networking - ICN '13  
In this paper we present a concrete routing scheme that realizes this: "push" as well as "pull" communication; anycast as well as multicast; and descriptor-based (as opposed to name-based) addressing.  ...  On each tree, the scheme combines addresses so as to reduce forwarding state.  ...  ROUTING SCHEME We propose a routing scheme based on multiple trees.  ... 
doi:10.1145/2491224.2491230 dblp:conf/acmicn/CarzanigaKPW13 fatcat:jlwyyq5bbzfjzcfwyob3pwukfm

Multistage switches are not crossbars: Effects of static routing in high-performance networks

Torsten Hoefler, Timo Schneider, Andrew Lumsdaine
2008 2008 IEEE International Conference on Cluster Computing  
Simulations with application-based patterns showed that the difference between effective and rated bisection bandwidth could impact overall application performance by up to 12%.  ...  Multistage interconnection networks based on central switches are ubiquitous in high-performance computing.  ...  the input file for the Thunderbird cluster.  ... 
doi:10.1109/clustr.2008.4663762 dblp:conf/cluster/HoeflerSL08 fatcat:kmc2mvaw6bbtnkw7glguyhgnha

Indexing multi-dimensional data in a cloud system

Jinbao Wang, Sai Wu, Hong Gao, Jianzhong Li, Beng Chin Ooi
2010 Proceedings of the 2010 international conference on Management of data - SIGMOD '10  
RT-CAN integrates CAN [23]based routing protocol and the R-tree based indexing scheme to support efficient multi-dimensional query processing in a Cloud system.  ...  Experiments on Amazon's EC2 show that our proposed routing protocol and indexing scheme are robust, efficient and scalable.  ...  Content Addressable Network CAN (Content Addressable Network) is a scalable, selforganized structured peer-to-peer overlay network.  ... 
doi:10.1145/1807167.1807232 dblp:conf/sigmod/WangWGLO10 fatcat:uazajqrw4bcqzmulq2c7kj4lh4

Modeling the communication costs of content-based routing

Stefano Castelli, Paolo Costa, Gian Pietro Picco
2007 Proceedings of the 2007 inaugural international conference on Distributed event-based systems - DEBS '07  
Content-based routing (CBR) provides the core distribution support of several middleware paradigms, most notably content-based publish-subscribe.  ...  We provide closed analytical expressions for the overall network traffic required to disseminate subscriptions and propagate notifications, as well as for the message forwarding load on individual nodes  ...  Content-based routing protocols.  ... 
doi:10.1145/1266894.1266902 dblp:conf/debs/CastelliCP07 fatcat:ou62ztrjcjgqbg7lgohpdnpti4
« Previous Showing results 1 — 15 out of 11,739 results