Power Aware Hierarchical Epidemics in P2P Systems Emrah Çem, Tuğba Koç, Öznur Özkasap Koç University, İstanbul
|
|
- Nickolas Haynes
- 5 years ago
- Views:
Transcription
1 Power Aware Hierarchical Epidemics in P2P Systems Emrah Çem, Tuğba Koç, Öznur Özkasap Koç University, İstanbul COST Action IC0804 Workshop in Budapest - Working Group 3 May 19th 2011 supported by TUBITAK (The Scientific and Technological Research Council of Turkey) research grant 109M761
2 Outline Motivation Epidemic (Gossip-Based) Mechanisms Flat Gossip Hierarchical Gossip Energy Cost Models Experimental Results Conclusion & Future Works 2 Koç University
3 Motivation Epidemic (gossip-based) principles: highly popular in large scale distributed systems Reliable multicast ([1],[2]) Aggregation P2P Streaming Topology construction Peer-to-Peer Energy Consumption Among the total internet traffic, 70% is accounted as peer-to-peer [3] Need to reduce cost and overhead of P2P principles Significance of energy efficient epidemic protocols Lack of studies on energy consumption and modeling of epidemic protocols [4] [1]K.P. Birman, M. Hayden, Ö. Özkasap, Z. Xiao, M. Budiu, Y. Minsky (1999), Bimodal Multicast, ACM Transactions on Computer Systems, 17/2, [2] Z. Genc, Ö. Özkasap, EraMobile: Epidemic-based Reliable and Adaptive Multicast for MANETs, IEEE WCNC (Wireless Communications and Networking Conference), March 2007, Hong Kong. [3] J. Erman, A. Mahanti, M. Arlitt, and C. Williamson, Identifying and discriminating between web and peer-to-peer traffic in the network core, in Proc. of the 16th international conference on World Wide Web. ACM New York, NY, USA, 2007, pp [4] van Renesse, R.: Power-aware epidemics. In: Proc. Of IEEE Symposium on Reliable Distributed Systems (2002) 3 Koç University
4 Epidemic (Gossip-Based) Algorithms Apply biological/social concepts to distributed systems Peers communicating in rounds Involve pairwise propagation of information (like an epidemic disease) Benefits: ease of deployment, simplicity, robustness, load-balanced Drawback: redundant communication overhead 4 Koç University
5 Types of Epidemic Algorithms Basic Requires global knowledge Uniform gossiping Not practical Neighborhood Uses local knowledge Gossiping with neighbors Redundant communication Hierarchical Makes use of a structure among peers Flat Aims to reduce communication overhead Possibility of active/passive peers 5 Koç University
6 Flat Neighborhood Gossiping We consider data aggregation as a case study Can be used to support P2P FID service [5] Atomic pairwise averaging Push-pull gossip communication push update p1 p2 average pull We have developed energy cost model [5] Emrah Cem, Oznur Ozkasap (2010), ProFID: Practical Frequent Item Set Discovery in Peer-to-Peer Networks, ISCIS, London/UK, September Koç University
7 Cost Model of Flat Neighborhood Gossip Energy consumed while [6] Computing new state Sending messages Receiving messages V: The set of neighbors chosen by Pi as gossip targets W : The set of neighbors that initiates an atomic pairwise averaging with Pi R f : Number of rounds to converge fanout : number of gossip targets in a single round [6] Emrah Cem, Oznur Ozkasap, Energy Cost Model for Frequent Item Set Discovery in Unstructured P2P Networks, ISCIS, London/UK, September Koç University
8 Our Hierarchical Gossip Model Dominating Set (DS) DS is a subset S of a graph G=(V,E) such that every vertex in G is either in S or adjacent to a vertex in S. 1 2 Overlay Topology Dominating Set 3 NDS Peer DS Peer High-level Overlay 8 Koç University
9 Hierarchical Cost Model Energy model for NDS peer: Passive during gossiping Energy consumed while receiving result Energy consumed while receiving request, sending LSI and DS ID set Energy model for DS peer: Energy consumed while sending request, receiving LSI and DS ID set Energy consumed during gossip operation Energy consumed while sending result 10 Koç University
10 Experimental Platform Peersim was used Flat [7] and hierarchical gossip algorithms were implemented Flat gossip was tested in PlanetLab Barabasi-Albert model with average degree 10 was used as a default overlay topology. Parameter Default Value fanout 1 convlimit mms 500 (item) [7] 11 Koç University
11 Experimental Results Top-level overlay characteristics for realistic power-law P2P Average degree increases logarithmically Significant reduction in # of gossiping peers 12 Koç University
12 Experimental Results Scalability comparison Decrease in convergence time 13 Koç University Decrease in total message sent per peer
13 Conclusion Address the aspect of energy efficiency in epidemic protocols. Propose a distributed hierarchical gossip-based approach Uses dominating set (active/passive peers) Uses local knowledge Gossiping on the high level overlay Uses new neighborhood definition among DS peers Develop and compare cost models for flat and hierarchical approaches Conducted experiments to study energy efficiency 14 Koç University
14 Work in Progress Analyzing the effect of churn on Hierarchical Gossip model Testing Hierarchical Gossip on PlanetLab Smart selection of DS peers Stable High computational power DS updates in a dynamic network 15 Koç University
15 Questions? Emrah Çem, Ph.D. Student in Electrical and Computer Engineering Tuğba Koç, M.Sc. Student in Electrical and Computer Engineering Öznur Özkasap, Associate Professor of Computer Engineering 16 Koç University
16 Hierarchical Gossiping Various hierarchical gossiping algorithms: Grid Box [7], Leaf Box [8], Subgroup [9] substantial reduction in network overhead similar probabilistic reliability, slightly higher latency They need to know the system size information a priori. All peers still get involved in gossiping [7] Ahmed, D.T.; Shirmohammadi, S.; El Saddik, A.;, "A Dominating Set Based Peer-to-Peer Protocol for Real-Time Multi-source Collaboration," Enabling Technologies: Infrastructure for Collaborative Enterprises, WETICE th IEEE International Workshops on, vol., no., pp , June 2007 [8] Gupta, I., Kermarrec, A., Ganesh, A. J.: Efficient and Adaptive Epidemic-Style Protocols for Reliable and Scalable Multicast, IEEE Transactions on Parallel and Distributed Systems, Vol. 17, No. 7, July 2006 [9] Fan, X., Cao, J., W. Weigang, Cheng, H.: Modeling Hierarchical Gossiping in Reliable Multicast Protocols, IEEE Second International Conference on Future Generation Communication and Networking, 2008, pp Koç University
17 Gossip-Based Protocols The efficiency of three models of epidemic protocols in terms of power usage [3] : Basic Epidemic Neighborhood Epidemic Hierarchical Epidemic [3] van Renesse, R.: Power-aware epidemics. In: Proc. Of IEEE Symposium on Reliable Distributed Systems (2002) 18 Koç University
Self-Adapting Epidemic Broadcast Algorithms
Self-Adapting Epidemic Broadcast Algorithms L. Rodrigues U. Lisboa ler@di.fc.ul.pt J. Pereira U. Minho jop@di.uminho.pt July 19, 2004 Abstract Epidemic broadcast algorithms have a number of characteristics,
More informationMulticast Transport Protocol Analysis: Self-Similar Sources *
Multicast Transport Protocol Analysis: Self-Similar Sources * Mine Çağlar 1 Öznur Özkasap 2 1 Koç University, Department of Mathematics, Istanbul, Turkey 2 Koç University, Department of Computer Engineering,
More informationStAN: Exploiting Shared Interests without Disclosing Them in Gossip-based Publish/Subscribe
StAN: Exploiting Shared Interests without Disclosing Them in Gossip-based Publish/Subscribe Miguel Matos Ana Nunes Rui Oliveira José Pereira Universidade do Minho {miguelmatos,ananunes,rco,jop}@di.uminho.pt
More informationCS505: Distributed Systems
Cristina Nita-Rotaru CS505: Distributed Systems Protocols. Slides prepared based on material by Prof. Ken Birman at Cornell University, available at http://www.cs.cornell.edu/ken/book/ Required reading
More informationBUFFER management is a significant component
1 Stepwise Fair-Share Buffering for Gossip-Based Peer-to-Peer Data Dissemination Oznur Ozkasap, Mine Caglar, Emrah Cem, Emrah Ahi, and Emre Iskender Abstract We consider buffer management in support of
More informationCausal Order Multicast Protocol Using Different Information from Brokers to Subscribers
, pp.15-19 http://dx.doi.org/10.14257/astl.2014.51.04 Causal Order Multicast Protocol Using Different Information from Brokers to Subscribers Chayoung Kim 1 and Jinho Ahn 1, 1 Dept. of Comp. Scie., Kyonggi
More informationHiScamp: self-organizing hierarchical membership protocol
HiScamp: self-organizing hierarchical membership protocol Ayalvadi J. Ganesh, Anne-Marie Kermarrec and Laurent Massoulié Microsoft Research 7 J J Thomson Avenue Cambridge CB3 0FB, UK fajg,annemk,lmassoulg@microsoft.com
More informationKelips : Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead
Kelips : Building an Efficient and Stable PP DHT Through Increased Memory and Background Overhead Indranil Gupta, Ken Birman, Prakash Linga, Al Demers, Robbert van Renesse Cornell University, Ithaca, NY,
More information-Reliable Broadcast: A Probabilistic Measure of Broadcast Reliability. Patrick Th. Eugster Rachid Guerraoui Petr Kouznetsov
-Reliable Broadcast: A Probabilistic Measure of Broadcast Reliability Patrick Th. Eugster Rachid Guerraoui Petr Kouznetsov Sun Microsystems Switzerland Distributed Programming Lab, EPFL Switzerland ICDCS
More informationPath Optimization in Stream-Based Overlay Networks
Path Optimization in Stream-Based Overlay Networks Peter Pietzuch, prp@eecs.harvard.edu Jeff Shneidman, Jonathan Ledlie, Mema Roussopoulos, Margo Seltzer, Matt Welsh Systems Research Group Harvard University
More informationA SOLUTION FOR REPLICA CONSISTENCY MAINTENANCE IN UNSTRUCTURED PEER-TO-PEER NETWORKS
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 A SOLUTION FOR REPLICA CONSISTENCY MAINTENANCE IN UNSTRUCTURED PEER-TO-PEER NETWORKS Narjes Nikzad Khasmakhi 1, Shahram
More informationPacket Routing using Optimal Flooding Protocol in Cluster based MANET
IJSTE - International Journal of Science Technology & Engineering Volume 2 Issue 09 March 2016 ISSN (online): 2349-784X Packet Routing using Optimal Flooding Protocol in Cluster based MANET S.Bavani V.Aiswariya
More informationImpact of Node Cheating on Gossip-Based Protocol
Impact of Node Cheating on Gossip-Based Protocol Nan Zhang, Yuanchun Shi, and Bin Chang Dept. of Computer Science and Technology, Tsinghua University, Beijing, China {z-n04@mails, shiyc@, cb99@mails}tsinghua.edu.cn
More informationPerformance study of a probabilistic multicast transport protocol
Performance Evaluation 57 (2004) 177 198 Performance study of a probabilistic multicast transport protocol Öznur Özkasap Department of Computer Engineering, Koc University, 34450 Istanbul, Turkey Received
More informationFast Topology Management in Large Overlay Networks
Topology as a key abstraction Fast Topology Management in Large Overlay Networks Ozalp Babaoglu Márk Jelasity Alberto Montresor Dipartimento di Scienze dell Informazione Università di Bologna! Topology
More informationDYNAMIC RESOURCE MANAGEMENT IN LARGE CLOUD ENVIRONMENTS USING DISTRIBUTED GOSSIP PROTOCOL
DYNAMIC RESOURCE MANAGEMENT IN LARGE CLOUD ENVIRONMENTS USING DISTRIBUTED GOSSIP PROTOCOL M.SASITHARAGAI 1, A.PADMASHREE 2, T.DHANALAKSHMI 3 & S.GOWRI 4 1,2,3&4 Department of Computer Science and Engineering,
More informationCongestion Control in Mobile Ad-Hoc Networks
Congestion Control in Mobile Ad-Hoc Networks 1 Sandeep Rana, 2 Varun Pundir, 3 Ram Sewak Singh, 4 Deepak Yadav 1, 2, 3, 4 Shanti Institute of Technology, Meerut Email: sandeepmietcs@gmail.com Email: varunpundir@hotmail.com
More informationLoad Sharing in Peer-to-Peer Networks using Dynamic Replication
Load Sharing in Peer-to-Peer Networks using Dynamic Replication S Rajasekhar, B Rong, K Y Lai, I Khalil and Z Tari School of Computer Science and Information Technology RMIT University, Melbourne 3, Australia
More informationCollaborative Multi-Source Scheme for Multimedia Content Distribution
Collaborative Multi-Source Scheme for Multimedia Content Distribution Universidad Autónoma Metropolitana-Cuajimalpa, Departament of Information Technology, Mexico City, Mexico flopez@correo.cua.uam.mx
More informationLightweight Gossip-based Distribution Estimation
Lightweight Gossip-based Distribution Estimation Amir H. Payberah, Hanna Kavalionak, Alberto Montresor, Jim Dowling, Seif Haridi Swedish Institute of Computer Science (SICS) University of Trento, Italy
More informationStudy and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs
Study and Comparison of Mesh and Tree- Based Multicast Routing Protocols for MANETs Rajneesh Gujral Associate Proffesor (CSE Deptt.) Maharishi Markandeshwar University, Mullana, Ambala Sanjeev Rana Associate
More informationScalable Information Dissemination for Pervasive Systems: Implementation and Evaluation
Scalable Information Dissemination for Pervasive Systems: Implementation and Evaluation Graham Williamson, Graeme Stevenson, Steve Neely, Lorcan Coyle, Paddy Nixon Systems Research Group School of Computer
More informationScheduling of Multi-Stream Gossip Systems
Scheduling of Multi-Stream Gossip Systems Nathanael Thompson, Ercan Ucan and Indranil Gupta Dept. of Computer Science, University of Illinois at Urbana-Champaign Email: {nathomps,eucan2,indy}@cs.uiuc.edu
More informationPeer-to-Peer Streaming Systems. Behzad Akbari
Peer-to-Peer Streaming Systems Behzad Akbari 1 Outline Introduction Scaleable Streaming Approaches Application Layer Multicast Content Distribution Networks Peer-to-Peer Streaming Metrics Current Issues
More informationHyParView: a membership protocol for reliable gossip-based broadcast
HyParView: a membership protocol for reliable gossip-based broadcast João Leitão José Pereira Luís Rodrigues DI FCUL TR 07 13 May 2007 Departamento de Informática Faculdade de Ciências da Universidade
More informationSmartGossip: : an improved randomized broadcast protocol for sensor networks
SmartGossip: : an improved randomized broadcast protocol for sensor networks Presented by Vilas Veeraraghavan Advisor Dr. Steven Weber Presented to the Center for Telecommunications and Information Networking
More informationMulticast. Presented by Hakim Weatherspoon. Slides borrowed from Qi Huang 2009 and Tom Ternquist 2010
Multicast Presented by Hakim Weatherspoon Slides borrowed from Qi Huang 2009 and Tom Ternquist 2010 Midterm report abstract, introduction, background, related work, and design section. These sections should
More informationParallel Routing Method in Churn Tolerated Resource Discovery
in Churn Tolerated Resource Discovery E-mail: emiao_beyond@163.com Xiancai Zhang E-mail: zhangxiancai12@sina.com Peiyi Yu E-mail: ypy02784@163.com Jiabao Wang E-mail: jiabao_1108@163.com Qianqian Zhang
More informationRSM-based Gossip on P2P Network 1
RSM-based Gossip on P2P Network 1 Hai Zhuge and Xiang Li China Knowledge Grid Research Group, Key Lab of Intelligent Information Processing Institute of Computing Technology, Chinese Academy of Sciences,
More informationA Top Catching Scheme Consistency Controlling in Hybrid P2P Network
A Top Catching Scheme Consistency Controlling in Hybrid P2P Network V. Asha*1, P Ramesh Babu*2 M.Tech (CSE) Student Department of CSE, Priyadarshini Institute of Technology & Science, Chintalapudi, Guntur(Dist),
More informationThroughput Stability of Reliable Multicast Protocols *
Throughput Stability of Reliable Multicast Protocols * Öznur Özkasap 1 Kenneth P. Birman 2 1 Ege University, Department of Computer Engineering, 351 Bornova, Izmir, Turkey ozkasap@bornova.ege.edu.tr 2
More informationEARM: An Efficient and Adaptive File Replication with Consistency Maintenance in P2P Systems.
: An Efficient and Adaptive File Replication with Consistency Maintenance in P2P Systems. 1 K.V.K.Chaitanya, 2 Smt. S.Vasundra, M,Tech., (Ph.D), 1 M.Tech (Computer Science), 2 Associate Professor, Department
More informationA Novel Broadcasting Algorithm for Minimizing Energy Consumption in MANET
A Novel Broadcasting Algorithm for Minimizing Energy Consumption in MANET Bhagyashri Thakre 1, Archana Raut 2 1 M.E. Student, Mobile Technology, G H Raisoni College of Engineering, Nagpur, India 2 Assistant
More informationEfficient Buffering in Reliable Multicast Protocols
Efficient Buffering in Reliable Multicast Protocols Oznur Ozkasap, Robbert van Renesse, Kenneth P. Birman, Zhen Xiao Dept. of Computer Science, Cornell University 4118 Upson Hall, Ithaca, NY 14853 {ozkasap,rvr,ken,xiao}@cs.cornell.edu
More informationA Survey of Current Directions in Service Placement in Mobile Ad-hoc Networks
A Survey of Current Directions in Service Placement in Mobile Ad-hoc Networks Georg Wittenburg and Jochen Schiller Freie Universität Berlin Middleware Support for Pervasive Computing Workshop (PerWare
More informationMultilevel Fault-tolerance for Designing Dependable Wireless Networks
Multilevel Fault-tolerance for Designing Dependable Wireless Networks Upkar Varshney Department of Computer Information Systems Georgia State University Atlanta, Georgia 30302-4015 E-mail: uvarshney@gsu.edu
More informationCS 425 / ECE 428 Distributed Systems Fall 2015
CS 425 / ECE 428 Distributed Systems Fall 2015 Indranil Gupta (Indy) Sep 24, 2015 Lecture 10: Gossiping All slides IG Multicast Fault-tolerance and Scalability Needs: 1. Reliability (Atomicity) 100% receipt
More informationPUB-2-SUB: A Content-Based Publish/Subscribe Framework for Cooperative P2P Networks
PUB-2-SUB: A Content-Based Publish/Subscribe Framework for Cooperative P2P Networks Duc A. Tran Cuong Pham Network Information Systems Lab (NISLab) Dept. of Computer Science University of Massachusetts,
More informationQi Huang CS FA 10/29/09
Qi Huang CS6410 2009 FA 10/29/09 What is mul3cast? Basic idea: same data needs to reach a set of mul3ple receivers Applica3on: Why not just unicast? Unicast How about using unicast? Sender s overhead grows
More informationThe Impact of Clustering on the Average Path Length in Wireless Sensor Networks
The Impact of Clustering on the Average Path Length in Wireless Sensor Networks Azrina Abd Aziz Y. Ahmet Şekercioğlu Department of Electrical and Computer Systems Engineering, Monash University, Australia
More informationThe peer-to-peer (P2P) computing model
RESEARCH FEATURE Epidemic Information Dissemination in Distributed Systems Easy to deploy, robust, and highly resilient to failures, epidemic algorithms are a potentially effective mechanism for propagating
More informationNetwork Awareness and Failure Resilience in Self-Organising Overlay Networks
Network Awareness and Failure Resilience in Self-Organising Overlay Networks Laurent Massoulié Anne-Marie Kermarrec Ayalvadi J. Ganesh Microsoft Research, 7 J J Thomson Avenue, Cambridge CB3 0FB, UK E-mail:
More informationReliable Distributed System Approaches
Reliable Distributed System Approaches Manuel Graber Seminar of Distributed Computing WS 03/04 The Papers The Process Group Approach to Reliable Distributed Computing K. Birman; Communications of the ACM,
More informationHeterogeneous Gossip. Davide Frey Rachid Guerraoui Anne-Marie Kermarrec Boris Koldehofe Maxime Monod Martin Mogensen Vivien Quéma
Heterogeneous Gossip Davide Frey Rachid Guerraoui Anne-Marie Kermarrec Boris Koldehofe Maxime Monod Martin Mogensen Vivien Quéma Outline Context Live Streaming Gossip Limitations Heterogeneous Gossip Protocol
More informationA Study on Issues Associated with Mobile Network
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 9, September 2014,
More informationEfficient Epidemic-style Protocols for Reliable and Scalable Multicast
Efficient Epidemic-style Protocols for Reliable and Scalable Multicast Indranil Gupta Dept. of Computer Science, Cornell University Ithaca, NY USA 4853 gupta@cs.cornell.edu Anne-Marie Kermarrec, Ayalvadi
More informationAdaptive Push-Then-Pull Gossip Algorithm for Scale-free Networks
Adaptive Push-Then-Pull Gossip Algorithm for Scale-free Networks Ruchir Gupta, Abhijeet C. Maali, Yatindra Nath Singh, Senior Member IEEE Department of Electrical Engineering, IIT, Kanpur {rgupta, abhicm,
More informationAn Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks
An Approximation Algorithm for Connected Dominating Set in Ad Hoc Networks Xiuzhen Cheng, Min Ding Department of Computer Science The George Washington University Washington, DC 20052, USA {cheng,minding}@gwu.edu
More informationOptimizing Segment Caching for Mobile Peer-to-Peer Interactive Streaming
Optimizing Segment Caching for Mobile Peer-to-Peer Interactive Streaming Jingwei Li S-H. Gary Chan Department of Computer Science and Engineering The Hong Kong University of Science and Technology Clear
More informationA Middleware for Gossip Protocols
A Middleware for Gossip Protocols Michael Chow Cornell University mcc59@cornell.edu Robbert van Renesse Cornell University rvr@cs.cornell.edu Gossip protocols are known to be highly robust in scenarios
More informationTowards Low-Redundancy Push-Pull P2P Live Streaming
Towards Low-Redundancy Push-Pull P2P Live Streaming Zhenjiang Li, Yao Yu, Xiaojun Hei and Danny H.K. Tsang Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology
More informationTO DESIGN ENERGY EFFICIENT PROTOCOL BY FINDING BEST NEIGHBOUR FOR ZIGBEE PROTOCOL
TO DESIGN ENERGY EFFICIENT PROTOCOL BY FINDING BEST NEIGHBOUR FOR ZIGBEE PROTOCOL 1 Mr. Sujeet D. Gawande, Prof. Amit M. Sahu 2 1 M.E. Scholar, Department of Computer Science and Engineering, G.H.R.C.E.M.,
More informationCROSS LAYER PROTOCOL (APTEEN) USING WSN FOR REAL TIME APPLICATION
CROSS LAYER PROTOCOL (APTEEN) USING WSN FOR REAL TIME APPLICATION V. A. Dahifale 1, N. Y. Siddiqui 2 PG Student, College of Engineering Kopargaon, Maharashtra, India 1 Assistant Professor, College of Engineering
More informationThe Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations Márk Jelasity 1, Rachid Guerraoui 2, Anne-Marie Kermarrec 3, and Maarten van Steen 4 1 University of Bologna,
More informationEfficient Message Caching Scheme for MANET
Efficient Message Caching Scheme for MANET S. Manju 1, Mrs. K. Vanitha, M.E., (Ph.D) 2 II ME (CSE), Dept. of CSE, Al-Ameen Engineering College, Erode, Tamil Nadu, India 1 Assistant Professor, Dept. of
More informationIntroduction to Peer-to-Peer Systems
Introduction Introduction to Peer-to-Peer Systems Peer-to-peer (PP) systems have become extremely popular and contribute to vast amounts of Internet traffic PP basic definition: A PP system is a distributed
More informationSimple, Fast and Deterministic Gossip and Rumor Spreading. Main paper by: B. Haeupler, MIT Talk by: Alessandro Dovis, ETH
Simple, Fast and Deterministic Gossip and Rumor Spreading Main paper by: B. Haeupler, MIT Talk by: Alessandro Dovis, ETH Presentation Outline What is gossip? Applications Basic Algorithms Advanced Algorithms
More informationA Decentralized Content-based Aggregation Service for Pervasive Environments
A Decentralized Content-based Aggregation Service for Pervasive Environments Nanyan Jiang, Cristina Schmidt, Manish Parashar The Applied Software Systems Laboratory Rutgers, The State University of New
More informationJetStream: Achieving Predictable Gossip Dissemination by. Leveraging Social Networks Principles
JetStream: Achieving Predictable Gossip Dissemination by Leveraging Social Networks Principles Jay A. Patel, Indranil Gupta and Noshir Contractor Abstract Gossip protocols provide probabilistic reliability
More informationDynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds 1
Dynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds 1 Contents: Introduction Multicast on parallel distributed systems Multicast on P2P systems Multicast on clouds High performance
More informationREDUCING BUFFER OVERHEAD IN A RELIABLE MAODV PROTOCOL
REDUCING BUFFER OVERHEAD IN A RELIABLE MAODV PROTOCOL Parul Nabiyal Department of CSE, National Institute of Technology, Jalandhar Jalandhar, India Abstract: As the technology of Mobile ad hoc networks
More informationCS551 Ad-hoc Routing
CS551 Ad-hoc Routing Bill Cheng http://merlot.usc.edu/cs551-f12 1 Mobile Routing Alternatives Why not just assume a base station? good for many cases, but not some (military, disaster recovery, sensor
More informationPerformance Evaluation of Various Routing Protocols in MANET
208 Performance Evaluation of Various Routing Protocols in MANET Jaya Jacob 1,V.Seethalakshmi 2 1 II MECS,Sri Shakthi Institute of Science and Technology, Coimbatore, India 2 Associate Professor-ECE, Sri
More informationProactive-Caching based Information Centric Networking Architecture for Reliable Green Communication in ITS
ITU Kaleidoscope 2015 Trust in the Information Society Proactive-Caching based Information Centric Networking Architecture for Reliable Green Communication in ITS Presenter: Prof. PhD. Takuro SATO Waseda
More informationImage-Space-Parallel Direct Volume Rendering on a Cluster of PCs
Image-Space-Parallel Direct Volume Rendering on a Cluster of PCs B. Barla Cambazoglu and Cevdet Aykanat Bilkent University, Department of Computer Engineering, 06800, Ankara, Turkey {berkant,aykanat}@cs.bilkent.edu.tr
More informationDistributed Indexing and Data Dissemination in Large Scale Wireless Sensor Networks
Distributed Indexing and Data Dissemination in Large Scale Wireless Sensor Networks Yiwei Wu Department of Computer Science Georgia State University Email: wyw@cs.gsu.edu Yingshu Li Department of Computer
More informationA Comparative Analysis of Pro-active Routing Protocols in MANET
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 6, June 2014, pg.144
More informationROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols
ROUTING ALGORITHMS Part 1: Data centric and hierarchical protocols 1 Why can t we use conventional routing algorithms here?? A sensor node does not have an identity (address) Content based and data centric
More informationEpidemic Broadcast Trees
Epidemic Broadcast Trees João Leitão José Pereira Luís Rodrigues DI FCUL TR 07 14 May 2007 Departamento de Informática Faculdade de Ciências da Universidade de Lisboa Campo Grande, 1749 016 Lisboa Portugal
More informationPerformance Analysis of AODV using HTTP traffic under Black Hole Attack in MANET
Performance Analysis of AODV using HTTP traffic under Black Hole Attack in MANET Ekta Barkhodia 1, Parulpreet Singh 2, Gurleen Kaur Walia 3 Lovely Professional University, Phagwara, India ektab0@gmail.com,
More informationCOOCHING: Cooperative Prefetching Strategy for P2P Video-on-Demand System
COOCHING: Cooperative Prefetching Strategy for P2P Video-on-Demand System Ubaid Abbasi and Toufik Ahmed CNRS abri ab. University of Bordeaux 1 351 Cours de la ibération, Talence Cedex 33405 France {abbasi,
More informationSCALABILITY, THROUGHPUT STABILITY AND EFFICIENT BUFFERING IN RELIABLE MULTICAST PROTOCOLS
SCALABILITY, THROUGHPUT STABILITY AND EFFICIENT BUFFERING IN RELIABLE MULTICAST PROTOCOLS A Dissertation Presented to the Faculty of the Graduate School of Ege University, Izmir, Turkey in Partial Fulfillment
More informationDYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET
DYNAMIC SEARCH TECHNIQUE USED FOR IMPROVING PASSIVE SOURCE ROUTING PROTOCOL IN MANET S. J. Sultanuddin 1 and Mohammed Ali Hussain 2 1 Department of Computer Science Engineering, Sathyabama University,
More informationPerformance and Scalability of Networks, Systems, and Services
Performance and Scalability of Networks, Systems, and Services Niklas Carlsson Linkoping University, Sweden Student presentation @LiU, Sweden, Oct. 10, 2012 Primary collaborators: Derek Eager (University
More informationChord on Demand. Mark Jelasity University of Bologna, Italy.
Chord on Demand Alberto Montresor University of Bologna, Italy montresor@cs.unibo.it Mark Jelasity University of Bologna, Italy jelasity@cs.unibo.it Ozalp Babaoglu University of Bologna, Italy babaoglu@cs.unibo.it
More informationEvaluating Unstructured Peer-to-Peer Lookup Overlays
Evaluating Unstructured Peer-to-Peer Lookup Overlays Idit Keidar EE Department, Technion Roie Melamed CS Department, Technion ABSTRACT Unstructured peer-to-peer lookup systems incur small constant overhead
More informationUsing a Managed Peer-to-Peer Protocol to Deliver Files within an Organization
ASIA-PACIFIC SYMPOSIUM ON QUEUEING THEORY AND NETWORK APPLICATIONS 2007 227 Using a Managed Peer-to-Peer Protocol to Deliver s within an Organization Chih-Chin Liang a, Chia-Hung Wang b, Hsing Luh b and
More informationCONSTRUCTION AND EVALUATION OF MESHES BASED ON SHORTEST PATH TREE VS. STEINER TREE FOR MULTICAST ROUTING IN MOBILE AD HOC NETWORKS
CONSTRUCTION AND EVALUATION OF MESHES BASED ON SHORTEST PATH TREE VS. STEINER TREE FOR MULTICAST ROUTING IN MOBILE AD HOC NETWORKS 1 JAMES SIMS, 2 NATARAJAN MEGHANATHAN 1 Undergrad Student, Department
More informationConstructing Overlay Networks through Gossip
Constructing Overlay Networks through Gossip Márk Jelasity Università di Bologna Project funded by the Future and Emerging Technologies arm of the IST Programme The Four Main Theses 1: Topology (network
More informationPeer-to-Peer Systems. Network Science: Introduction. P2P History: P2P History: 1999 today
Network Science: Peer-to-Peer Systems Ozalp Babaoglu Dipartimento di Informatica Scienza e Ingegneria Università di Bologna www.cs.unibo.it/babaoglu/ Introduction Peer-to-peer (PP) systems have become
More informationLecture 6: Overlay Networks. CS 598: Advanced Internetworking Matthew Caesar February 15, 2011
Lecture 6: Overlay Networks CS 598: Advanced Internetworking Matthew Caesar February 15, 2011 1 Overlay networks: Motivations Protocol changes in the network happen very slowly Why? Internet is shared
More informationPresenting a multicast routing protocol for enhanced efficiency in mobile ad-hoc networks
Presenting a multicast routing protocol for enhanced efficiency in mobile ad-hoc networks Mehdi Jalili, Islamic Azad University, Shabestar Branch, Shabestar, Iran mehdijalili2000@gmail.com Mohammad Ali
More informationMobility Control for Complete Coverage in Wireless Sensor Networks
Mobility Control for Complete Coverage in Wireless Sensor Networks Zhen Jiang Computer Sci. Dept. West Chester University West Chester, PA 9383, USA zjiang@wcupa.edu Jie Wu Computer Sci. & Eng. Dept. Florida
More informationChapter 7 CONCLUSION
97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in
More informationChord on Demand. Ozalp Babaoglu University of Bologna, Italy. Alberto Montresor University of Bologna, Italy
Chord on Demand Alberto Montresor University of Bologna, Italy montresor@cs.unibo.it Márk Jelasity University of Bologna, Italy jelasity@cs.unibo.it Ozalp Babaoglu University of Bologna, Italy babaoglu@cs.unibo.it
More informationPerformance Analysis and Enhancement of Routing Protocol in Manet
Vol.2, Issue.2, Mar-Apr 2012 pp-323-328 ISSN: 2249-6645 Performance Analysis and Enhancement of Routing Protocol in Manet Jaya Jacob*, V.Seethalakshmi** *II MECS, Sri Shakthi Institute of Engineering and
More informationDistributed Meta-data Servers: Architecture and Design. Sarah Sharafkandi David H.C. Du DISC
Distributed Meta-data Servers: Architecture and Design Sarah Sharafkandi David H.C. Du DISC 5/22/07 1 Outline Meta-Data Server (MDS) functions Why a distributed and global Architecture? Problem description
More informationOnline Optimization of VM Deployment in IaaS Cloud
Online Optimization of VM Deployment in IaaS Cloud Pei Fan, Zhenbang Chen, Ji Wang School of Computer Science National University of Defense Technology Changsha, 4173, P.R.China {peifan,zbchen}@nudt.edu.cn,
More informationREVIEW ON ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS
REVIEW ON ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS G. Poornima 1, Mr. M. Rajasenathipathi 2, 1 Research Scholar, Department of Computer Science, NGM College, Pollachi 2 Assistant Professor, Department
More informationARTICLE IN PRESS. Journal of Network and Computer Applications
Journal of Network and Computer Applications 32 (29) 666 683 Contents lists available at ScienceDirect Journal of Network and Computer Applications journal homepage: www.elsevier.com/locate/jnca Principles
More informationBehaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model
Behaviour of Routing Protocols of Mobile Adhoc Netwok with Increasing Number of Groups using Group Mobility Model Deepak Agrawal, Brajesh Patel Department of CSE Shri Ram Institute of Technology Jabalpur,
More informationIMPLEMENTATION AND PERFORMANCE TESTING OF A GOSSIP-BASED COMMUNICATION SYSTEM
IMPLEMENTATION AND PERFORMANCE TESTING OF A GOSSIP-BASED COMMUNICATION SYSTEM Kim P. Kihlstrom, Joel L. Stewart, N. Tobias Lounsbury, Adrian J. Rogers, and Michael C. Magnuson Department of Computer Science,
More informationImpact of Node Velocity and Density on Probabilistic Flooding and its Effectiveness in MANET
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 12, December 2014,
More informationAn Energy Efficient and Delay Aware Data Collection Protocol in Heterogeneous Wireless Sensor Networks A Review
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 5, May 2015, pg.934
More informationStavros Nikolaou. 413 Gates Hall URL: Ithaca, NY, 14853, USA Date of Birth: December, 1987
413 Gates Hall +1 6073795409 Department of Computer Science Cornell University email: snikolaou@cs.cornell.edu URL: www.cs.cornell.edu/~snikolaou Ithaca, NY, 14853, USA Date of Birth: December, 1987 Education
More informationCHAPTER 2 WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL
WIRELESS SENSOR NETWORKS AND NEED OF TOPOLOGY CONTROL 2.1 Topology Control in Wireless Sensor Networks Network topology control is about management of network topology to support network-wide requirement.
More informationAnil Saini Ph.D. Research Scholar Department of Comp. Sci. & Applns, India. Keywords AODV, CBR, DSDV, DSR, MANETs, PDF, Pause Time, Speed, Throughput.
Volume 6, Issue 7, July 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance Analysis
More informationMulti-path based Algorithms for Data Transfer in the Grid Environment
New Generation Computing, 28(2010)129-136 Ohmsha, Ltd. and Springer Multi-path based Algorithms for Data Transfer in the Grid Environment Muzhou XIONG 1,2, Dan CHEN 2,3, Hai JIN 1 and Song WU 1 1 School
More informationPeerfactSim.KOM: A Simulation Framework for Peer-to-Peer Systems
PeerfactSim.KOM: A Simulation Framework for Peer-to-Peer Systems The 2011 International Conference on High Performance Computing & Simulation July 4 8, 2011, Istanbul, Turkey Dominik Stingl Christian Gross
More informationGossiping in Distributed Systems
Gossiping in Distributed Systems Anne-Marie Kermarrec INRIA, Rennes, France Anne-Marie.Kermarrec@irisa.fr Maarten van Steen Vrije Universiteit Amsterdam, Netherlands steen@cs.vu.nl ABSTRACT Gossip-based
More information