Evaluating Advanced Routing Algorithms for Content-Based Publish/Subscribe Systems
|
|
|
- Aleesha Stella Henderson
- 7 years ago
- Views:
Transcription
1 CSC8980 Wireless Sensor Networks Evaluating Advanced Routing Algorithms for Content-Based Publish/Subscribe Systems Instructor: Dr. Yingshu Li Presented by: Marco Valero
2 Outline Publish/Subscribe Systems Content-Based Publish/Subscribe Systems Routing Algorithms - Routing Tables Sizes - Filtering Forwarding Overhead Conclusions
3 Publish/Subscribe Systems Publish/Subscribe provides a simple communication abstraction which enables development of large-scale distributed applications. Information consumers (subscribers) indicate their interest in some information via subscriptions. Information producers (publishers) publish their data as events, which in turn are matched to subscriptions and delivered to interested subscribers. Keywords: Consumers Producers Advertisements Brokers
4 Broker Topology In many pub/sub systems, publishers post messages to an intermediary broker and subscribers register subscriptions with that broker, letting the broker perform the filtering. The broker normally performs a store-and-forward function to route messages from publishers to subscribers.
5 Broker Network B 4 B 1 Local clients
6 Content-Based Publish/Subscribe Systems In the pub/sub model, subscribers typically receive only a sub-set of the total messages published. Filtering: is the process of selecting messages for reception and processing. There are two common forms of filtering: topic-based and content-based. This papers focusses on content-based filtering through content-based routing which includes the following Routing Algorithms: Identity-Based Routing Covering-Based Routing Merging-Based Routing Advertisements
7 Routing Tables Routing Tables: Subscription-based routing tables are used to route notifications from producers to consumers and the advertisement-based routing tables are used to route subscriptions from consumers to producers. A routing table consist on a set of routing entries with a pair (F, D) a filter F and a destination D
8 Content-Based Publish/Subscribe Systems sub() sub(f) B 4 (,B 4 ) B 1 (F, ) (, ) Routing tables
9 Content-Based Publish/Subscribe Systems sub() sub(f) B 4 (,B 4 ) n B 1 (F, ) (, ) Routing tables n N(F) n N()
10 Content-Based Publish/Subscribe Systems sub() sub(f) B 4 (,B 4 ) n B 1 n (F, ) (, ) Routing tables n n N(F) n N()
11 Content-Based Publish/Subscribe Systems sub() B 4 sub(f) n (,B 4 ) n B 1 n (F, ) (, ) Routing tables n n N(F) n N()
12 Content-Based Publish/Subscribe Systems sub() n n B 4 sub(f) n (,B 4 ) n B 1 n (F, ) (, ) Routing tables n n N(F) n N()
13 Content-Based Publish/Subscribe Systems n N(F) n N() n N(H) Forwarding Engine Routing Table (F, ) (, B 4 ) (H, ) Broker B B 4
14 Content-Based Publish/Subscribe Systems n N(F) n N() n N(H) Forwarding Engine Routing Table (F, ) (, B 4 ) (H, ) Broker B 1 1. n 2. B 4
15 Content-Based Publish/Subscribe Systems n N(F) n N() n N(H) Forwarding Engine Routing Table (F, ) (, B 4 ) (H, ) Broker B 1 1. n 2. n B 4
16 Setup of Experiments
17 1. Simple Routing - Each broker has global knowledge about all active subscriptions - Each subscription stored in every routing table - Size of routing tables grows linearly in the number of active subscriptions and the number of brokers - Each routing table affected by a new/canceled subscription 1. sub(f) B 1 (F,B 1 ) B 4
18 1. Simple Routing - Each broker has global knowledge about all active subscriptions - Each subscription stored in every routing table - Size of routing tables grows linearly in the number of active subscriptions and the number of brokers - Each routing table affected by a new/canceled subscription 1. sub(f) 2. sub() B 1 (F,B 1 ) B 4
19 1. Simple Routing - Each broker has global knowledge about all active subscriptions - Each subscription stored in every routing table - Size of routing tables grows linearly in the number of active subscriptions and the number of brokers - Each routing table affected by a new/canceled subscription 1. sub(f) 2. sub() B 1 (F,B 1 ) B 4
20 1. Simple Routing - Each broker has global knowledge about all active subscriptions - Each subscription stored in every routing table - Size of routing tables grows linearly in the number of active subscriptions and the number of brokers - Each routing table affected by a new/canceled subscription 1. sub(f) 2. sub() B 1 (F,B 1 ) B 4
21 1. Simple Routing - Each broker has global knowledge about all active subscriptions - Each subscription stored in every routing table - Size of routing tables grows linearly in the number of active subscriptions and the number of brokers - Each routing table affected by a new/canceled subscription 1. sub(f) 2. sub() (F,B 1 ) (,B (F,B 12 ) B 1 B 4
22 1. Simple Routing - Each broker has global knowledge about all active subscriptions - Each subscription stored in every routing table - Size of routing tables grows linearly in the number of active subscriptions and the number of brokers - Each routing table affected by a new/canceled subscription 1. sub(f) 2. sub() (F,B 1 ) B 1 (,B (F,B 12 ) B 4
23 1. Simple Routing - Each broker has global knowledge about all active subscriptions - Each subscription stored in every routing table - Size of routing tables grows linearly in the number of active subscriptions and the number of brokers - Each routing table affected by a new/canceled subscription 1. sub(f) 2. sub() (F,B 1 ) (,B (F,B 12 ) B 1 B 4
24 1. Simple Routing - Each broker has global knowledge about all active subscriptions - Each subscription stored in every routing table - Size of routing tables grows linearly in the number of active subscriptions and the number of brokers - Each routing table affected by a new/canceled subscription 1. sub(f) 2. sub() (, ) B 1 (F,B 1 ) (,B (F,B 12 ) B 4 (, )
25 1. Simple Routing Routing Tables Sizes: RTS = ( V - 1 ). x Filter Forwarding Overhead: FFO = V - 1
26 Advanced Routing Algorithms 2. Routing based on Identity Uses identity tests for routing decisions Avoids: Forwarding of identical filters and Routing entries with identical filters for the same neighbor broker F N(F) = N() sub(f) B 1 (F,B 1 ) B 4
27 Advanced Routing Algorithms 2. Routing based on Identity Uses identity tests for routing decisions Avoids: Forwarding of identical filters and Routing entries with identical filters for the same neighbor broker F N(F) = N() sub(f) sub(f) B 1 (F,B 1 ) B 4
28 Advanced Routing Algorithms 2. Routing based on Identity Uses identity tests for routing decisions Avoids: Forwarding of identical filters and Routing entries with identical filters for the same neighbor broker F N(F) = N() sub(f) sub(f) B 1 F (F,B 1 ) B 4
29 Advanced Routing Algorithms 2. Routing based on Identity Uses identity tests for routing decisions Avoids: Forwarding of identical filters and Routing entries with identical filters for the same neighbor broker F N(F) = N() sub(f) sub(f) B 1 (F,B 1 ) B 4
30 Advanced Routing Algorithms 2. Routing based on Identity Uses identity tests for routing decisions Avoids: Forwarding of identical filters and Routing entries with identical filters for the same neighbor broker F N(F) = N() sub(f) sub(f) (F,B 1 ) B (F,B 12 ) 1 B 4
31 Advanced Routing Algorithms 2. Routing based on Identity Uses identity tests for routing decisions Avoids: Forwarding of identical filters and Routing entries with identical filters for the same neighbor broker F N(F) = N() sub(f) sub(f) (F,B 1 ) B 1 F (F,B 12 ) B 4
32 Advanced Routing Algorithms 2. Routing based on Identity Uses identity tests for routing decisions Avoids: Forwarding of identical filters and Routing entries with identical filters for the same neighbor broker F N(F) = N() sub(f) sub(f) (F,B 1 ) B (F,B 12 ) 1 B 4
33 Advanced Routing Algorithms 2. Routing based on Identity Uses identity tests for routing decisions Avoids: Forwarding of identical filters and Routing entries with identical filters for the same neighbor broker F N(F) = N() sub(f) sub(f) (F,B 1 ) B 1 (F,B 12 ) B 4
34 Advanced Routing Algorithms 2. Routing based on Identity Routing Tables Sizes: RTS = 2. m. ( V - 1 ) Filter Forwarding Overhead: FFO depends on the number of active subscriptions
35 Advanced Routing Algorithms 3. Routing based on Covering F covers N(F) N() F sub(f) B 1 (F,B 1 ) B 4 F
36 Advanced Routing Algorithms 3. Routing based on Covering F covers N(F) N() F sub(f) B 1 (F,B 1 ) B 4 F sub()
37 Advanced Routing Algorithms 3. Routing based on Covering F covers N(F) N() F sub(f) sub() B 1 (F,B 1 ) B 4 F
38 Advanced Routing Algorithms 3. Routing based on Covering F covers N(F) N() F sub(f) B 1 (F,B 1 ) B 4 F sub()
39 Advanced Routing Algorithms 3. Routing based on Covering F covers N(F) N() F sub(f) B 1 (F,B 1 ) (F,B (,B 12 ) B 4 F sub()
40 Advanced Routing Algorithms 3. Routing based on Covering F covers N(F) N() F sub(f) B 1 (F,B 1 ) (F,B (,B 12 ) B 4 F sub()
41 Advanced Routing Algorithms 3. Routing based on Covering F covers N(F) N() F sub(f) B 1 (F,B 1 ) (F,B (,B 12 ) B 4 F sub()
42 Advanced Routing Algorithms 3. Routing based on Covering F covers N(F) N() F sub(f) (, ) B 1 (F,B 1 ) (F,B (,B 12 ) B 4 F sub()
43 Advanced Routing Algorithms 3. Routing based on Covering sub(f) B 1 (F,B 1 ) (, ) (H, ) F sub() sub(h) B 4 H
44 Advanced Routing Algorithms 3. Routing based on Covering sub(f) B 1 (F,B 1 ) (, ) (H, ) F sub() sub(h) B 4 H
45 Advanced Routing Algorithms 3. Routing based on Covering sub(f) sub() sub(h) B 1 (F,B 1 ) (, ) (H, ) B 4 F F H
46 Advanced Routing Algorithms 3. Routing based on Covering sub(f) B 1 (F,B 1 ) (, ) (H, ) F sub() sub(h) B 4 H
47 Advanced Routing Algorithms 3. Routing based on Covering sub(f) B 1 (F,B 1 ) (, ) (H, ) F sub() sub(h) B 4 H
48 Advanced Routing Algorithms 3. Routing based on Covering sub(f) B 1 (F,B 1 ) (, ) (H, ) F sub() sub(h) B 4 F H
49 Advanced Routing Algorithms 3. Routing based on Covering sub(f) B 1 (F,B 1 ) (, ) (H, ) F sub() sub(h) B 4 F H
50 Advanced Routing Algorithms 3. Routing based on Covering sub(f) sub() sub(h) B 1 (F,B 1 ) (, ) (H, ) B 4 F F H F H
51 Advanced Routing Algorithms 3. Routing based on Covering sub(f) sub() sub(h) B 1 (F,B 1 ) (, ) (H, ) B 4 F F H (, ) (H, ) F H
52 Advanced Routing Algorithms 3. Routing based on Covering Routing Tables Sizes: RTS = m. ( V - 1 ) Filter Forwarding Overhead: FFO starts at the level of simple routing and decreases for larger number of subscriptions
53 Advanced Routing Algorithms 4. Routing based on Merging N() U N(H) = N(F) H F (, ) 1. sub() B 1 (,B 1 ) B 4 (, )
54 Advanced Routing Algorithms 4. Routing based on Merging N() U N(H) = N(F) H F (, ) 1. sub() B 1 B 4 (,B 1 ) 2. sub(h) (, )
55 Advanced Routing Algorithms 4. Routing based on Merging N() U N(H) = N(F) H F (, ) 1. sub() B 1 B 4 H (,B 1 ) 2. sub(h) (, )
56 Advanced Routing Algorithms 4. Routing based on Merging N() U N(H) = N(F) H F (, ) 1. sub() B 1 B 4 (,B 1 ) 2. sub(h) (, )
57 Advanced Routing Algorithms 4. Routing based on Merging N() U N(H) = N(F) H F (, ) 1. sub() B 1 B 4 2. sub(h) (, ) (,B 1 ) (H, )
58 Advanced Routing Algorithms 4. Routing based on Merging N() U N(H) = N(F) H F (, ) 1. sub() B 1 H B 4 2. sub(h) (, ) (,B 1 ) (H, )
59 Advanced Routing Algorithms 4. Routing based on Merging N() U N(H) = N(F) H F (, ) 1. sub() B 1 B 4 2. sub(h) (, ) (,B 1 ) (H, )
60 Advanced Routing Algorithms 4. Routing based on Merging N() U N(H) = N(F) H F (H, ) (, ) 1. sub() B 1 B 4 2. sub(h) (, ) (,B 1 ) (H, )
61 Advanced Routing Algorithms 4. Routing based on Merging N() U N(H) = N(F) H F (H, ) (, ) 1. sub() B 1 F B 4 2. sub(h) (, ) (,B 1 ) (H, )
62 Advanced Routing Algorithms 4. Routing based on Merging N() U N(H) = N(F) H F (H, ) (, ) 1. sub() B 1 B 4 2. sub(h) (, ) (,B 1 ) (H, )
63 Advanced Routing Algorithms 4. Routing based on Merging N() U N(H) = N(F) H F (H,B (, ) 1. sub() B 1 B 4 2. sub(h) (, ) (,B 1 ) (H, )
64 Advanced Routing Algorithms 4. Routing based on Merging Routing Tables Sizes: RTS < 2. ( V - 1 ) Filter Forwarding Overhead: FFO is similar to that of covering routing but decreases more slowly.
65 Advertisements Advertisements can be used as additional mechanism to further optimize content-based routing. They are filters that are issued by producers to indicate (and revoke) their intention to publish certain kinds of notifications. R B 1 B 4 B 5 B 6 N(F) N()
66 Advertisements Advertisements can be used as additional mechanism to further optimize content-based routing. They are filters that are issued by producers to indicate (and revoke) their intention to publish certain kinds of notifications. R B 1 B 4 B 5 B 6 1. adv(f) N(F) N()
67 Advertisements Advertisements can be used as additional mechanism to further optimize content-based routing. They are filters that are issued by producers to indicate (and revoke) their intention to publish certain kinds of notifications. R B 1 B 4 B 5 B 6 1. adv(f) N(F) N()
68 Advertisements Advertisements can be used as additional mechanism to further optimize content-based routing. They are filters that are issued by producers to indicate (and revoke) their intention to publish certain kinds of notifications. R B 1 B 4 B 5 B 6 1. adv(f) 2. sub() N(F) N()
69 Advertisements Advertisements can be used as additional mechanism to further optimize content-based routing. They are filters that are issued by producers to indicate (and revoke) their intention to publish certain kinds of notifications. R B 1 B 4 B 5 B 6 1. adv(f) 2. sub() N(F) N()
70 Advertisements Advertisements can be used as additional mechanism to further optimize content-based routing. They are filters that are issued by producers to indicate (and revoke) their intention to publish certain kinds of notifications. R (B,B 4 ) B 1 B 4 B 5 B 6 1. adv(f) 2. sub() N(F) N()
71 Advertisements Advertisements can be used as additional mechanism to further optimize content-based routing. They are filters that are issued by producers to indicate (and revoke) their intention to publish certain kinds of notifications. false R (B,B 4 ) B 1 B 4 B 5 B 6 1. adv(f) 2. sub() N(F) N()
72 Simple Routing with Advertisements Routing Tables Sizes: RTS = Pavg. x (Pavg is the average path length from a costumer to a notification source) Filter Forwarding Overhead: FFO = ( V - 1) / Pavg = 28.4
73 Simple Routing vs. Identity Routing (RTS)
74 Covering Routing vs. Merge Routing (RTS)
75 Simple Routing vs. Identity Routing (FFO)
76 Covering Routing vs. Merge Routing (RTS)
77 Conclusions 1. Advanced routing algorithms can be considered mandatory in large-scale publish/subscribe systems. 2. The use of advertisements considerably improves the scalability. 3. Advanced routing algorithms operate efficiently in more dynamic environments. 4. The good behavior of the algorithms even improves if the interests of the consumers are not evenly distributed,which can be expected in practice
78 Q&A
79 References. Muhl, L. Fiege, F. C. artner, and A. Buchmann. Evaluating advanced routing algorithms for content-based publish/subscribe systems. In Proc. 10th IEEE Intl. Symp. on Modeling, Analysis and Simulation of Computer and Telecommunications Systems (MASCOTS), pages IEEE, Lukasz Opyrchal and Atul Prakash.Content-based publish subscribe systems: scalability and security. ACM 2004 Wikipedia The Free Encyclopedia A. Carzaniga. Architectures for an Event Notification Service Scalable to Wide-area Networks. PhD thesis, Politecnico di Milano, Milano, Italy, Dec Mühl. Large-Scale Content-Based Publish/Subscribe Systems. PhD thesis, Darmstadt University of Technology, Chapter 3 A. Carzaniga, D. S. Rosenblum, and A. L. Wolf. Design and Evaluation of a Wide-Area Event Notification Service. ACM Transactions on Computer Systems, 19(3): , Content-Based Routing
Dynamic Load Balancing for Cluster-based Publish/Subscribe System
Dynamic Load Balancing for Cluster-based Publish/Subscribe System Hojjat Jafarpour, Sharad Mehrotra and Nalini Venkatasubramanian Department of Computer Science University of California, Irvine {hjafarpo,
Supporting Mobility In Publish-Subscribe Networks
A Selective Neighbor Caching Approach for Supporting Mobility in Publish/Subscribe Networks Vasilios A. Siris, Xenofon Vasilakos, and George C. Polyzos Mobile Multimedia Laboratory Department of Informatics
A Self-Organizing Crash-Resilient Topology Management System for Content-Based Publish/Subscribe
A Self-Organizing Crash-Resilient Topology Management System for Content-Based Publish/Subscribe R. Baldoni, R. Beraldi, L. Querzoni and A. Virgillito Dipartimento di Informatica e Sistemistica Università
An efficient event delivery scheme in mobile ad hoc communities
Int. J. Communication Networks and Distributed Systems, Vol. 10, No. 1, 2013 25 An efficient event delivery scheme in mobile ad hoc communities Juan Li* Department of Computer Science, North Dakota State
SemCast: Semantic Multicast for Content-based Data Dissemination
SemCast: Semantic Multicast for Content-based Data Dissemination Olga Papaemmanouil Brown University Uğur Çetintemel Brown University Wide Area Stream Dissemination Clients Data Sources Applications Network
Structure-less Content-Based Routing in Mobile Ad Hoc Networks
Structure-less Content-Based Routing in Mobile Ad Hoc Networks Roberto BALDONI Roberto BERALDI Gianpaolo CUGOLA + Matteo MIGLIAVACCA + Leonardo QUERZONI Università di Roma La Sapienza Via Salaria 3, I-9
Dealing with Heterogeneous Data in Pub/Sub Systems: The Concept-Based Approach
Dealing with Heterogeneous Data in Pub/Sub Systems: The Concept-Based Approach M. Cilia, M. Antollini, C. Bornhövd, A. Buchmann Databases and Distributed Systems, Dept. of Computer Science, Technische
Analysis on Leveraging social networks for p2p content-based file sharing in disconnected manets
Analysis on Leveraging social networks for p2p content-based file sharing in disconnected manets # K.Deepika 1, M.Tech Computer Science Engineering, Mail: medeepusony@gmail.com # K.Meena 2, Assistant Professor
An Efficient Implementation of Query/Advertise
An Efficient Implementation of Query/Advertise Dennis Heimbigner CU-CS-948-03 31 March 2003 University of Colorado at Boulder Technical Report CU-CS-948-03 Department of Computer Science Campus Box 430
Sensor Event Processing on Grid
Sensor Event Processing on Grid Eui-Nam Huh Dept. of Computer Engineering Kyung Hee University #1 Seochon Kiheung, Yoingin, Kyunggi-Do, Korea johnhuh@khu.ac.kr Abstract. Wireless sensor networks are increasingly
Design of a Scalable Event Notification Service: Interface and Architecture
Design of a Scalable Event Notification Service: Interface and Architecture Antonio Carzaniga Dept. of Computer Science University of Colorado Boulder, CO 80309-0430, USA +1 303 492 4463 carzanig@cs.colorado.edu
Design and Evaluation of a Wide-Area Event Notification Service
Design and Evaluation of a Wide-Area Event Notification Service ANTONIO CARZANIGA University of Colorado at Boulder DAVID S. ROSENBLUM University of California, Irvine and ALEXANDER L. WOLF University
AN EFFICIENT STRATEGY OF AGGREGATE SECURE DATA TRANSMISSION
INTERNATIONAL JOURNAL OF REVIEWS ON RECENT ELECTRONICS AND COMPUTER SCIENCE AN EFFICIENT STRATEGY OF AGGREGATE SECURE DATA TRANSMISSION K.Anusha 1, K.Sudha 2 1 M.Tech Student, Dept of CSE, Aurora's Technological
PLEROMA: A SDN-based High Performance Publish/Subscribe Middleware
PLEROMA: A SDN-based High Performance Publish/Subscribe Middleware Muhammad Adnan Tariq, Boris Koldehofe, Sukanya Bhowmik, Kurt Rothermel University of Stuttgart {first name.last name}@ipvs.uni-stuttgart.de
Cultural Design and Implementation of the Quality Notification Service
Data Quality Notification in Cooperative Information Systems Carlo Marchetti, Massimo Mecella, Monica Scannapieco, Antonino Virgillito, Roberto Baldoni Università di Roma La Sapienza Dipartimento di Informatica
Secure Access Policy Generation For Complex Event Handling System
Secure Access Policy Generation For Complex Event Handling System Sharad Handibag, Sandesh Ugale, Shafik Shaikh Savitribai Phule Pune University Pune Vidyarthi Griha s College of Engineering,Nashik of
DREAM: Distributed Reliable Event-based Application Management
DREAM: Distributed Reliable Event-based Application Management A. Buchmann, C. Bornhövd, M. Cilia, L. Fiege, F. Gärtner, C. Liebig, M. Meixner, and G. Mühl buchmann@informatik.tu-darmstadt.de Databases
2. Research and Development on the Autonomic Operation. Control Infrastructure Technologies in the Cloud Computing Environment
R&D supporting future cloud computing infrastructure technologies Research and Development on Autonomic Operation Control Infrastructure Technologies in the Cloud Computing Environment DEMPO Hiroshi, KAMI
Deployment Strategies for Distributed Complex Event Processing
Noname manuscript No. (will be inserted by the editor) Deployment Strategies for Distributed Complex Event Processing Gianpaolo Cugola Alessandro Margara Received: July 19th, 212 / Accepted: date Abstract
WSO2 Message Broker. Scalable persistent Messaging System
WSO2 Message Broker Scalable persistent Messaging System Outline Messaging Scalable Messaging Distributed Message Brokers WSO2 MB Architecture o Distributed Pub/sub architecture o Distributed Queues architecture
DDS-Enabled Cloud Management Support for Fast Task Offloading
DDS-Enabled Cloud Management Support for Fast Task Offloading IEEE ISCC 2012, Cappadocia Turkey Antonio Corradi 1 Luca Foschini 1 Javier Povedano-Molina 2 Juan M. Lopez-Soler 2 1 Dipartimento di Elettronica,
9 Referências Bibliográficas
Referências Bibliográficas 95 9 Referências Bibliográficas AYDIN, I. et al. Cellular SCTP: a transport-layer approach to Internet mobility. 2003. p.285-290. BANERJEE, N. et al. Seamless SIP-based mobility
DDOS WALL: AN INTERNET SERVICE PROVIDER PROTECTOR
Journal homepage: www.mjret.in DDOS WALL: AN INTERNET SERVICE PROVIDER PROTECTOR Maharudra V. Phalke, Atul D. Khude,Ganesh T. Bodkhe, Sudam A. Chole Information Technology, PVPIT Bhavdhan Pune,India maharudra90@gmail.com,
Event-based middleware services
3 Event-based middleware services The term event service has different definitions. In general, an event service connects producers of information and interested consumers. The service acquires events
Figure 1. The Example of ZigBee AODV Algorithm
TELKOMNIKA Indonesian Journal of Electrical Engineering Vol.12, No.2, February 2014, pp. 1528 ~ 1535 DOI: http://dx.doi.org/10.11591/telkomnika.v12i2.3576 1528 Improving ZigBee AODV Mesh Routing Algorithm
Software Service Defined Network: Centralized Network Information Service
www.huawei.com Software Defined : Centralized Information Jiafeng Zhu, Weisheng Xie, Li Li, Min Luo, Wu Chou HUAWEI Futurewei TECHNOLOGIES US Research CO., Centre Introduction Traditional SDN controller
A Publish/Subscribe Data Gathering Framework Integrating Wireless Sensor Networks and Mobile Phones
IT 10 066 Examensarbete 30 hp December 2010 A Publish/Subscribe Data Gathering Framework Integrating Wireless Sensor Networks and Mobile Phones He Huang Institutionen för informationsteknologi Department
Evolving from SCADA to IoT
Evolving from SCADA to IoT Evolving from SCADA to IoT Let s define Semantics IoT Objectives, chapters 1 and 2 Separating the hype from the reality Why IoT isn t easy An IoT roadmap & framework IoT vs.
Secured Data Transmissions In Manet Using Neighbor Position Verfication Protocol
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 3 Issue3 March, 2014 Page No. 5067-5071 Secured Data Transmissions In Manet Using Neighbor Position Verfication
A Catechistic Method for Traffic Pattern Discovery in MANET
A Catechistic Method for Traffic Pattern Discovery in MANET R. Saranya 1, R. Santhosh 2 1 PG Scholar, Computer Science and Engineering, Karpagam University, Coimbatore. 2 Assistant Professor, Computer
A Capability-Based Access Control Architecture for Multi-Domain Publish/Subscribe Systems
A Capability-Based Access Control Architecture for Multi-Domain Publish/Subscribe Systems Lauri I.W. Pesonen, David M. Eyers, and Jean Bacon University of Cambridge, Computer Laboratory JJ Thomson Avenue,
IoT concepts Andrea Acquaviva EDA group Politecnico di Torino, Italy
IoT concepts Andrea Acquaviva EDA group Politecnico di Torino, Italy Outline Introduction to the concept of IoT: paradigm, functionalities and requirements IoT devices features: sensing, processing, communication
A Survey Study on Monitoring Service for Grid
A Survey Study on Monitoring Service for Grid Erkang You erkyou@indiana.edu ABSTRACT Grid is a distributed system that integrates heterogeneous systems into a single transparent computer, aiming to provide
MAXIMIZING RESTORABLE THROUGHPUT IN MPLS NETWORKS
MAXIMIZING RESTORABLE THROUGHPUT IN MPLS NETWORKS 1 M.LAKSHMI, 2 N.LAKSHMI 1 Assitant Professor, Dept.of.Computer science, MCC college.pattukottai. 2 Research Scholar, Dept.of.Computer science, MCC college.pattukottai.
Technological Trend. A Framework for Highly-Available Cascaded Real-Time Internet Services. Service Composition. Service Composition
A Framework for Highly-Available Cascaded Real-Time Internet Services Bhaskaran Raman Qualifying Examination Proposal Feb 12, 2001 Examination Committee: Prof. Anthony D. Joseph (Chair) Prof. Randy H.
Modeling and Optimizing Content-based Publish/Subscribe Systems
Modeling and Optimizing Content-based Publish/Subscribe Systems vorgelegt von Diplom-Ingenieur Arnd Schröter von der Fakultät IV Elektrotechnik und Informatik der Technischen Universität Berlin zur Erlangung
Event-Driven Database Information Sharing
Event-Driven Database Information Sharing Luis Vargas, Jean Bacon, and Ken Moody University of Cambridge, Computer Laboratory {firstname.lastname}@cl.cam.ac.uk Abstract. Database systems have been designed
Energy Efficient Load Balancing among Heterogeneous Nodes of Wireless Sensor Network
Energy Efficient Load Balancing among Heterogeneous Nodes of Wireless Sensor Network Chandrakant N Bangalore, India nadhachandra@gmail.com Abstract Energy efficient load balancing in a Wireless Sensor
Load Balancing in Structured Peer to Peer Systems
Load Balancing in Structured Peer to Peer Systems DR.K.P.KALIYAMURTHIE 1, D.PARAMESWARI 2 Professor and Head, Dept. of IT, Bharath University, Chennai-600 073 1 Asst. Prof. (SG), Dept. of Computer Applications,
Load Balancing in Structured Peer to Peer Systems
Load Balancing in Structured Peer to Peer Systems Dr.K.P.Kaliyamurthie 1, D.Parameswari 2 1.Professor and Head, Dept. of IT, Bharath University, Chennai-600 073. 2.Asst. Prof.(SG), Dept. of Computer Applications,
A Fast Path Recovery Mechanism for MPLS Networks
A Fast Path Recovery Mechanism for MPLS Networks Jenhui Chen, Chung-Ching Chiou, and Shih-Lin Wu Department of Computer Science and Information Engineering Chang Gung University, Taoyuan, Taiwan, R.O.C.
A Novel Multi Ring Forwarding Protocol for Avoiding the Void Nodes for Balanced Energy Consumption
International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Issue-4 E-ISSN: 2347-2693 A Novel Multi Ring Forwarding Protocol for Avoiding the Void Nodes for Balanced Energy
EFFICIENT DETECTION IN DDOS ATTACK FOR TOPOLOGY GRAPH DEPENDENT PERFORMANCE IN PPM LARGE SCALE IPTRACEBACK
EFFICIENT DETECTION IN DDOS ATTACK FOR TOPOLOGY GRAPH DEPENDENT PERFORMANCE IN PPM LARGE SCALE IPTRACEBACK S.Abarna 1, R.Padmapriya 2 1 Mphil Scholar, 2 Assistant Professor, Department of Computer Science,
Tactical Service Bus: The flexibility of service oriented architectures in constrained theater environments
Tactical Bus: The flexibility of service oriented architectures in constrained theater environments Tactical Edge in NATO Context Tactical still very much under control of national forces: Zone of Operations
A Comprehensive Analysis on Route Discovery and Maintenance Features of DSDV, AODV and IERF Ad-hoc Routing Protocols
International Journal of Computer Sciences and Engineering Open Access Research Paper Volume-4, Issue-2 E-ISSN: 2347-2693 A Comprehensive Analysis on Route Discovery and Maintenance Features of DSDV, AODV
The Advantages Of A Network Based Data Routing System
Semantic Multicast for Content-based Stream Dissemination 1 Olga Papaemmanouil Department of Computer Science Brown University Providence, RI, USA olga@cs.brown.edu Uğur Çetintemel Department of Computer
Chapter 17: M2M-Based Metropolitan Platform for IMS-Enabled Road Traffic Management in IoT
Chapter 17: M2M-Based Metropolitan Platform for IMS-Enabled Road Traffic Management in IoT Chih-Yuan Lee Department of CSIE National Taipei University 1 Outline Abstract Introduction Background System
The Internet of Things (IoT) builds. Thingsonomy: Tackling Variety in Internet of Things Events. Building Internet of Things Software
Thingsonomy: Tackling Variety in Internet of Things Events To assure rapid adoption of Internet of Things (IoT) applications, it s important to have scalable middleware that can abstract developers and
Quality of Service Routing Network and Performance Evaluation*
Quality of Service Routing Network and Performance Evaluation* Shen Lin, Cui Yong, Xu Ming-wei, and Xu Ke Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 {shenlin, cy, xmw,
Efficient Search in Gnutella-like Small-World Peerto-Peer
Efficient Search in Gnutella-like Small-World Peerto-Peer Systems * Dongsheng Li, Xicheng Lu, Yijie Wang, Nong Xiao School of Computer, National University of Defense Technology, 410073 Changsha, China
A Hierarchical Event-based Architecture for the Notification of Medical Document Availability
A Hierarchical Event-based Architecture for the Notification of Medical Document Availability Christian Esposito and Mario Ciampi Institute for High Performance Computing and Networking (ICAR) National
SemCast: Semantic Multicast for Content-based Data Dissemination
SemCast: Semantic Multicast for Content-based Data Dissemination Olga Papaemmanouil Brown University olga@cs.brown.edu Abstract We address the problem of content-based dissemination of highly-distributed,
Wireless Sensor Networks Chapter 3: Network architecture
Wireless Sensor Networks Chapter 3: Network architecture António Grilo Courtesy: Holger Karl, UPB Goals of this chapter Having looked at the individual nodes in the previous chapter, we look at general
An Adaptive Load Balancing to Provide Quality of Service
An Adaptive Load Balancing to Provide Quality of Service 1 Zahra Vali, 2 Massoud Reza Hashemi, 3 Neda Moghim *1, Isfahan University of Technology, Isfahan, Iran 2, Isfahan University of Technology, Isfahan,
A SECURE DATA TRANSMISSION FOR CLUSTER- BASED WIRELESS SENSOR NETWORKS IS INTRODUCED
A SECURE DATA TRANSMISSION FOR CLUSTER- BASED WIRELESS SENSOR NETWORKS IS INTRODUCED J Karunamayi 1, Annapurna V K 2 1 Student, Computer Network and Engineering,The National Institute of Engineering, Mysuru,
Varalakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam
A Survey on P2P File Sharing Systems Using Proximity-aware interest Clustering Varalakshmi.T #1, Arul Murugan.R #2 # Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam
Processing Flows of Information: From Data Stream to Complex Event Processing
Processing Flows of Information: From Data Stream to Complex Event Processing GIANPAOLO CUGOLA and ALESSANDRO MARGARA, Politecnico di Milano A large number of distributed applications requires continuous
Hanyang University Grid Network Monitoring
Grid Network Monitoring Hanyang Univ. Multimedia Networking Lab. Jae-Il Jung Agenda Introduction Grid Monitoring Architecture Network Measurement Tools Network Measurement for Grid Applications and Services
Energy Aware Load Balancing in Secure Heterogeneous Wireless Sensor Network
Energy Aware Load Balancing in Secure Heterogeneous Wireless Sensor Network Chandrakant N Bangalore, India nadhachandra@gmail.com Abstract A Wireless Sensor Network(WSN) is a energy and security constraint
A Case Study Design of Border Gateway Routing Protocol Using Simulation Technologies
A Case Study Design of Border Gateway Routing Protocol Using Simulation Technologies Chengcheng Li School of Information Technology University of Cincinnati Cincinnati, OH 45221 Chengcheng.li@uc.edu ABSTRACT
Dynamic Antenna Mode Selection for Link Maintenances in Mobile Ad Hoc Network
Dynamic Antenna Mode Selection for Link Maintenances in Mobile Ad Hoc Network P. Shiva Kumar $, Rinki Sharma *, G.Varaprasad # $ Department of Information Technology Acharya Institute of Management and
CS6204 Advanced Topics in Networking
CS6204 Advanced Topics in Networking Assoc Prof. Chan Mun Choon School of Computing National University of Singapore Aug 14, 2015 CS6204 Lecturer Chan Mun Choon Office: COM2, #04-17 Email: chanmc@comp.nus.edu.sg
DDS and SOA Interfaces to ESB
DDS and SOA Interfaces to ESB NCOIC Plenary, VA Beach 29 Mar 2007 Joe Schlesselman NCOIC OS&P WG Chair joe.schlesselman@rti.com www.rti.com Gerardo Pardo-Castellote CTO & Co-Author DDS Specification gerardo.pardo@rti.com
SPACK FIREWALL RESTRICTION WITH SECURITY IN CLOUD OVER THE VIRTUAL ENVIRONMENT
SPACK FIREWALL RESTRICTION WITH SECURITY IN CLOUD OVER THE VIRTUAL ENVIRONMENT V. Devi PG Scholar, Department of CSE, Indira Institute of Engineering & Technology, India. J. Chenni Kumaran Associate Professor,
Power Efficiency Metrics for Geographical Routing In Multihop Wireless Networks
Power Efficiency Metrics for Geographical Routing In Multihop Wireless Networks Gowthami.A, Lavanya.R Abstract - A number of energy-aware routing protocols are proposed to provide the energy efficiency
Control overhead reduction: A Hierarchical Routing Protocol In Mobile Ad hoc Networks
Control overhead reduction: A Hierarchical Routing Protocol In Mobile Ad hoc Networks Dr.G.Mary Jansi Rani Professor / Department of Electronics and Communication Engineering, Sri Ramakrishna Engineering
Consecutive Geographic Multicasting Protocol in Large-Scale Wireless Sensor Networks
21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications Consecutive Geographic Multicasting Protocol in Large-Scale Wireless Sensor Networks Jeongcheol Lee, Euisin
Routing in packet-switching networks
Routing in packet-switching networks Circuit switching vs. Packet switching Most of WANs based on circuit or packet switching Circuit switching designed for voice Resources dedicated to a particular call
MAXIMIZING THE LIFETIME OF NETWORK SECURITY BY DSDV PROTOCOL USING GAME THEORY TECHNIQUES IN WIRELESS SENSOR NETWORK
MAXIMIZING THE LIFETIME OF NETWORK SECURITY BY DSDV PROTOCOL USING GAME THEORY TECHNIQUES IN WIRELESS SENSOR NETWORK 1 V. Vinoba, 2 P.Hema 1 Department of Mathematics, K.N. Government Arts college, (India)
How To Find A Failure In A Network
Practical Issues with Using Network Tomography for Fault Diagnosis Yiyi Huang Georgia Institute of Technology yiyih@cc.gatech.edu Nick Feamster Georgia Institute of Technology feamster@cc.gatech.edu Renata
International Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 9, September 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Experimental
Enhancing Data Security in Cloud Storage Auditing With Key Abstraction
Enhancing Data Security in Cloud Storage Auditing With Key Abstraction 1 Priyadharshni.A, 2 Geo Jenefer.G 1 Master of engineering in computer science, Ponjesly College of Engineering 2 Assistant Professor,
Autonomic IoT Systems Realizing Self-* Properties in IoT Systems
Autonomic IoT Systems Realizing Self-* Properties in IoT Systems Noor Bajunaid nbajunai@masonlive.gmu.edu CS 788 Fall 2015 1 IoT and CPS The internet of things is known as giving any object the ability
A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks
A Comparison Study of Qos Using Different Routing Algorithms In Mobile Ad Hoc Networks T.Chandrasekhar 1, J.S.Chakravarthi 2, K.Sravya 3 Professor, Dept. of Electronics and Communication Engg., GIET Engg.
A RFID Data-Cleaning Algorithm Based on Communication Information among RFID Readers
, pp.155-164 http://dx.doi.org/10.14257/ijunesst.2015.8.1.14 A RFID Data-Cleaning Algorithm Based on Communication Information among RFID Readers Yunhua Gu, Bao Gao, Jin Wang, Mingshu Yin and Junyong Zhang
Survey on Load Rebalancing for Distributed File System in Cloud
Survey on Load Rebalancing for Distributed File System in Cloud Prof. Pranalini S. Ketkar Ankita Bhimrao Patkure IT Department, DCOER, PG Scholar, Computer Department DCOER, Pune University Pune university
A Novel Path Selection and Recovery Mechanism for MANETs P2P File Sharing Applications
A Novel Path Selection and Recovery Mechanism for MANETs P2P File Sharing Applications Ahmed Abada Dept. of Systems and Computer Engineering Carleton University Ottawa, ON, Canada Li Cui Institute of Computing
Large-Scale IP Traceback in High-Speed Internet
2004 IEEE Symposium on Security and Privacy Large-Scale IP Traceback in High-Speed Internet Jun (Jim) Xu Networking & Telecommunications Group College of Computing Georgia Institute of Technology (Joint
PEER TO PEER FILE SHARING USING NETWORK CODING
PEER TO PEER FILE SHARING USING NETWORK CODING Ajay Choudhary 1, Nilesh Akhade 2, Aditya Narke 3, Ajit Deshmane 4 Department of Computer Engineering, University of Pune Imperial College of Engineering
Intelligent Agents for Routing on Mobile Ad-Hoc Networks
Intelligent Agents for Routing on Mobile Ad-Hoc Networks Y. Zhou Dalhousie University yzhou@cs.dal.ca A. N. Zincir-Heywood Dalhousie University zincir@cs.dal.ca Abstract This paper introduces a new agent-based
Bandwidth Management Framework for Multicasting in Wireless Mesh Networks
Bandwidth Management Framework for Multicasting in Wireless Mesh Networks Manaswi Saha and P. Venkata Krishna Abstract Wireless mesh networks (WMNs) provide a reliable and a scalable solution for multicasting.
Semantic Message Oriented Middleware For Publish/Subscribe Networks
Semantic Message Oriented Middleware For Publish/Subscribe Networks Han Li a and Guofei Jiang b a Thayer School of Engineering, Dartmouth College, Hanover, NH 03755 b Institute of Security Technology Studies
Evaluation of Unlimited Storage: Towards Better Data Access Model for Sensor Network
Evaluation of Unlimited Storage: Towards Better Data Access Model for Sensor Network Sagar M Mane Walchand Institute of Technology Solapur. India. Solapur University, Solapur. S.S.Apte Walchand Institute
Chapter 15: Distributed Structures. Topology
1 1 Chapter 15: Distributed Structures Topology Network Types Operating System Concepts 15.1 Topology Sites in the system can be physically connected in a variety of ways; they are compared with respect
Flexible Distributed Business Process Management. Vinod Muthusamy
Flexible Distributed Business Process Management by Vinod Muthusamy A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Electrical and Computer
Distributed Control Plane for Software-defined Networks: A Case Study Using Event-based Middleware
Distributed Control Plane for Software-defined Networks: A Case Study Using Event-based Middleware Sukanya Bhowmik,MuhammadAdnanTariq, Boris Koldehofe, André Kutzleb and Kurt Rothermel University of Stuttgart,
An Energy Efficient Location Service for Mobile Ad Hoc Networks
An Energ Efficient Location Service for Mobile Ad Hoc Networks Zijian Wang 1, Euphan Bulut 1 and Boleslaw K. Szmanski 1, 1 Department of Computer Science, Rensselaer Poltechnic Institute, Tro, NY 12180
CHAPTER 6 SECURE PACKET TRANSMISSION IN WIRELESS SENSOR NETWORKS USING DYNAMIC ROUTING TECHNIQUES
CHAPTER 6 SECURE PACKET TRANSMISSION IN WIRELESS SENSOR NETWORKS USING DYNAMIC ROUTING TECHNIQUES 6.1 Introduction The process of dispersive routing provides the required distribution of packets rather
Analyzing 6LoWPAN/ZigBeeIP networks with the Perytons Protocol Analyzer May, 2012
Analyzing 6LoWPAN/ZigBeeIP networks with the Perytons Protocol Analyzer May, 2012 Background While IP protocols are widely spread over broadband wireline and wireless communication means, transferring
SEMANTICS ENABLED PROACTIVE AND TARGETED DISSEMINATION OF NEW MEDICAL KNOWLEDGE
SEMANTICS ENABLED PROACTIVE AND TARGETED DISSEMINATION OF NEW MEDICAL KNOWLEDGE Lakshmish Ramaswamy & I. Budak Arpinar Dept. of Computer Science, University of Georgia laks@cs.uga.edu, budak@cs.uga.edu
PERFORMANCE COMPARISON OF COMMON OBJECT REQUEST BROKER ARCHITECTURE(CORBA) VS JAVA MESSAGING SERVICE(JMS) BY TEAM SCALABLE
PERFORMANCE COMPARISON OF COMMON OBJECT REQUEST BROKER ARCHITECTURE(CORBA) VS JAVA MESSAGING SERVICE(JMS) BY TEAM SCALABLE TIGRAN HAKOBYAN SUJAL PATEL VANDANA MURALI INTRODUCTION Common Object Request
IEEE 2015-2016 JAVA TITLES
ECWAY ECHNOLGIES IEEE 2015-2016 JAVA TITLES BE, B.TECH, ME, M.TECH, MSC, MCA PROJECTS Abstract: Introduction: Literature Survey: System Analysis: Existing System: Disadvantages: Proposed System: Advantages:
Dependability in Web Services
Dependability in Web Services Christian Mikalsen chrismi@ifi.uio.no INF5360, Spring 2008 1 Agenda Introduction to Web Services. Extensible Web Services Architecture for Notification in Large- Scale Systems.
XML Filtering in Peer-to-peer Systems
12/10/2003 Honguk Woo (honguk@cs.utexas.edu) Pilsung Kang (pilsungk@cs.utexas.edu) Computer Sciences University of Texas at Austin 1. Introduction 2. Publish/Subscribe Model 3. XML sharing application
Encryption-Enforced Access Control in Dynamic Multi-Domain Publish/Subscribe Networks
Encryption-Enforced Access Control in Dynamic Multi-Domain Publish/Subscribe Networks Lauri I.W. Pesonen University of Cambridge, Computer Laboratory JJ Thomson Avenue, Cambridge, CB3 0FD, UK {first.last}@cl.cam.ac.uk
APIL 2007 - A Guide to Multiple Domain Publishing and Subscribe Systems
JOURNAL OF NETWORKS, VOL. 2, NO. 2, APRIL 2007 57 Access Control in Decentralised Publish/Subscribe Systems Lauri I.W. Pesonen, David M. Eyers, and Jean Bacon University of Cambridge, Computer Laboratory
Simulation of Heuristic Usage for Load Balancing In Routing Efficiency
Simulation of Heuristic Usage for Load Balancing In Routing Efficiency Nor Musliza Mustafa Fakulti Sains dan Teknologi Maklumat, Kolej Universiti Islam Antarabangsa Selangor normusliza@kuis.edu.my Abstract.
Collective Self-Awareness and Self-Expression for Efficient Network Exploration
Collective Self-Awareness and Self-Expression for Efficient Network Exploration Michele Amoretti and Stefano Cagnoni Department of Information Engineering, University of Parma, Italy Problem Statement
ROUTE MECHANISMS FOR WIRELESS ADHOC NETWORKS: -CLASSIFICATIONS AND COMPARISON ANALYSIS
International Journal of Science, Environment and Technology, Vol. 1, No 2, 2012, 72-79 ROUTE MECHANISMS FOR WIRELESS ADHOC NETWORKS: -CLASSIFICATIONS AND COMPARISON ANALYSIS Ramesh Kait 1, R. K. Chauhan
The Monitoring of Ad Hoc Networks Based on Routing
The Monitoring of Ad Hoc Networks Based on Routing Sana Ghannay, Sonia Mettali Gammar, Farouk Kamoun CRISTAL Laboratory ENSI, University of Manouba 21 Manouba - Tunisia {chnnysn,sonia.gammar}@ensi.rnu.tn,