Filters








2,217 Hits in 6.6 sec

BAD

Manos Kapritsos, Peter Triantafillou
2007 Proceedings of the 8th ACM/IFIP/USENIX international conference on Middleware - Middleware '07  
BAD is designed to improve the performance of multicast dissemination trees, under both a static and a dynamic environment, where the effective bandwidth of the network links changes with time.  ...  BAD consists of a suit of algorithms for node joins/leaves, bandwidth distribution to heterogeneous nodes, tree rearrangement and reduction of overhead.  ...  Moreover, BAD introduces a novel algorithm for selecting a high-bandwidth node as the root of the tree.  ... 
doi:10.1145/1377943.1377963 dblp:conf/middleware/KapritsosT07 fatcat:mmcsafqf35dzllfhsgfzipdime

Toward Heterogeneity-Aware Device-to-Device Data Dissemination over Wi-Fi Networks

Lyes Hamidouche, Pierre Sens, Sebastien Monnet, Dimitri Refauvelet
2017 2017 IEEE 23rd International Conference on Parallel and Distributed Systems (ICPADS)  
Furthermore, taking into account the devices bandwidth capabilities can help to increase the dissemination speed.  ...  Among these new usages, there are many occasions for which a content has to be disseminated to a large number of mobile devices (e.g., large-scale events providing a multi-media support, video streaming  ...  Algorithm 1 Battery aware dissemination policy In order to protect the devices having bad or low-level batteries, we do not use them for D2D exchanges.  ... 
doi:10.1109/icpads.2017.00025 dblp:conf/icpads/HamidoucheSMR17 fatcat:xzhykmmcsvdvndild7visze7mu

Heterogeneous Gossip [chapter]

Davide Frey, Rachid Guerraoui, Anne-Marie Kermarrec, Boris Koldehofe, Martin Mogensen, Maxime Monod, Vivien Quéma
2009 Lecture Notes in Computer Science  
This paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynamically adapt their contribution to the gossip dissemination according to their bandwidth capabilities.  ...  In practice, a blind load-balancing strategy might significantly hamper the performance of the gossip dissemination.  ...  Acknowledgements The authors would like to thank Ken Birman, Pascal Felber, Ali Ghodsi and Dahlia Malkhi for useful comments.  ... 
doi:10.1007/978-3-642-10445-9_3 fatcat:nvyc4ekmtbh4noprzhgxorzx34

A distributed approach to topology-aware overlay path monitoring

C. Tang, P.K. McKinley
2004 24th International Conference on Distributed Computing Systems, 2004. Proceedings.  
We describe a minimum diameter, link-stress bounded overlay spanning tree, which is used to collect and disseminate path quality information.  ...  All nodes in the tree collaborate to infer the quality of all paths.  ...  Acknowledgements This work was supported in part by the U.S. Department of the Navy, Office of Naval Research under Grant No. N00014-01-1-0744.  ... 
doi:10.1109/icdcs.2004.1281575 dblp:conf/icdcs/TangM04 fatcat:xzn36u2zrrbklbq3ymk2yomk3e

Performance Comparison of Two Different Energy Conservation Mac Protocols

G.S. Binu, K.P. Jacob
2012 Procedia Technology - Elsevier  
To avoid buffer overflow and achieve fairness for the poor quality nodes, a Load prediction algorithm is designed.  ...  In this paper, a channel adaptive MAC protocol with a traffic-aware dynamic power management algorithm is developed for efficient packet scheduling and queuing in a sensor network, with time varying characteristics  ...  As we can see from the figure, the Throughput is more in the case of AEMAC than TASL. Figure 6 shows the results of energy consumption for the protocols.  ... 
doi:10.1016/j.protcy.2012.05.031 fatcat:ysxocrioaveb3ptqm5ddumjiia

Impact of Network-Awareness on Profile Migration

S. Bhatnagar, S. Ganguly, R. Izmailov
2006 22nd International Conference on Data Engineering Workshops (ICDEW'06)  
Our main contribution is the design of a fully-distributed algorithm for dynamic profile movement in order to adapt to the changing network conditions.  ...  Our focus is on the design of a overlay network based filtering architecture capable of disseminating high bandwidth and high volume data streams to a large user population.  ...  In such a case, there is no extra processing or forwarding load on any other node in the network.  ... 
doi:10.1109/icdew.2006.65 dblp:conf/icde/BhatnagarGI06 fatcat:xymihyn6nvfddmgkkblykpspme

Stretching gossip with live streaming

Davide Frey, Rachid Guerraoui, Anne-Marie Kermarrec, Maxime Monod, Vivien Quema
2009 2009 IEEE/IFIP International Conference on Dependable Systems & Networks  
bandwidths.  ...  For instance, when 20% of the nodes simultaneously crash, 70% of the remaining nodes do not suffer any loss in stream quality, while the others only experience a performance decrease for an average of  ...  For example the lines for the 700 kbps bandwidth cap show an almost homogeneous distribution apart from a small set of bad nodes.  ... 
doi:10.1109/dsn.2009.5270330 dblp:conf/dsn/FreyGKMQ09 fatcat:rnb4s77khzcldgjptehoxpxzfa

Heuristics for Flash-Dissemination in Heterogenous Networks [chapter]

Mayur Deshpande, Nalini Venkatasubramanian, Sharad Mehrotra
2006 Lecture Notes in Computer Science  
While optimal algorithms are available for a highly constrained case (all nodes having the same bandwidth and latency), there is relatively little work in the context of heterogenous networks.  ...  Most systems and protocols today either use trees or randomized mesh-based techniques to deal with heterogeneity and mostly work with local knowledge.  ...  Fig. 1 depicts an sample dissemination for 3 chunks (from Node 1) and 10 nodes (Nodes 1 and 2 have twice the bandwidth of the remaining nodes) for 3 centralized protocols -(i) a naive-FNF adaptation,  ... 
doi:10.1007/11945918_57 fatcat:o4wualk6sfhp3pxv3wpras7wam

On application-level load balancing in FastReplica

Jangwon Lee, Gustavo de Veciana
2007 Computer Communications  
Our goal is to study (1) how to make FastReplica adaptive to dynamic environments and (2) how much performance gain can be achieved by exploring the application-level load balancing idea in FastReplica  ...  To remedy this problem, we propose an application-level load balancing idea: putting more data on 'good' paths and less on 'bad' ones.  ...  For bandwidth availability, we assume a tree session model wherein chunk is transferred at the same rate along the entire overlay tree.  ... 
doi:10.1016/j.comcom.2007.01.013 fatcat:ghpwgipulzfshdv5dozfw4znw4

Security and privacy issues in P2P streaming systems: A survey

Gabriela Gheorghe, Renato Lo Cigno, Alberto Montresor
2010 Peer-to-Peer Networking and Applications  
; and (ii) the general perception (not necessarily the truth, but a commonplace belief) that it is necessary to sacrifice accuracy or performance in order to tolerate faults or misbehaviors, is not always  ...  Research on security for P2P streaming started to flourish, but no comprehensive security analysis over the current P2P solutions has yet been attempted.  ...  make it useless or of bad quality, is a day-by-day routine.  ... 
doi:10.1007/s12083-010-0070-6 fatcat:hgg7fujecbdvpd7647lttvh2qm

Adaptive Routing Strategies for Modern High Performance Networks

Patrick Geoffray, Torsten Hoefler
2008 2008 16th IEEE Symposium on High Performance Interconnects  
Our best adaptive routing scheme is able to increase the effective bisection bandwidth to 77% for 512 nodes and 100% for smaller node counts.  ...  Our experiments show that the effective bisection bandwidth of a non-blocking 512-node Clos network is as low as 38% if the network is routed statically.  ...  Acknowledgments Computation for the work described in this paper was supported by the University of Southern California Center for High-Performance Computing and Communications (www.usc.edu/hpcc).  ... 
doi:10.1109/hoti.2008.21 dblp:conf/hoti/GeoffrayH08 fatcat:l4nunhv5cbhd5j7v6ststh5bly

A content-based publish/subscribe framework for large-scale content delivery

Mohamed Diallo, Vasilis Sourlas, Paris Flegkas, Serge Fdida, Leandros Tassiulas
2013 Computer Networks  
requirements, large number of publications and scarcity of end-to-end bandwidth.  ...  We propose and design a service model for addressing the consumers' requirements for content-based information retrieval and describe the relevant protocols necessary to implement such a service.  ...  However, these CBF schemes are correct only if spanning trees verify the all-pairs path symmetry property, i.e. only in the case where shortest-paths are unique or routes between routers are symmetric.  ... 
doi:10.1016/j.comnet.2012.11.009 fatcat:7ltkds2yazbyngvz2bawsm7o5m

Securing Channel Assignment in Multi-Radio Multi-Channel Wireless Mesh Networks

Aftabul Haq, Anjum Naveed, Salil S. Kanhere
2007 2007 IEEE Wireless Communications and Networking Conference  
In order to fully exploit the aggregate bandwidth available in the radio spectrum, future Wireless Mesh Networks (WMN) are expected to take advantage of multiple orthogonal channels, where the nodes have  ...  Dynamic channel assignment is critical for ensuring effective utilization of the non-overlapping channels. Several algorithms have been proposed in recent years, which aim at achieving this.  ...  We intend to explore the following research directions in the future. We intend to consider the effect of colluding malicious nodes on the security mechanism and the channel assignment algorithms.  ... 
doi:10.1109/wcnc.2007.575 dblp:conf/wcnc/HaqNK07 fatcat:dk4ncgxzrndnxk7xofda4n4gfm

Architectures and Algorithms for Internet-Scale (p2p) Data Management [chapter]

Joseph M. Hellerstein
2004 Proceedings 2004 VLDB Conference  
This file was generated using MS PowerPoint 2004 for Mac. It may not display correctly in other versions of PowerPoint. In particular, animations are often a problem.  ...  • Case 1: Broadcast -As far as we know, all nodes need to participate -Need to have a broadcast tree out of the query node -This is the opposite of an aggregation tree! • But how to instantiate it?  ...  tuples toward the hash ID of the grouping columns -An agg tree is naturally constructed per group • Note nice dual-purpose use of DHT Query Dissemination • How do nodes find out about a query?  ... 
doi:10.1016/b978-012088469-8.50117-0 dblp:conf/vldb/Hellerstein04 fatcat:crwdutblwvh77i4tbgivwdkmki

Adaptive Spraying for Routing in Delay Tolerant Networks

Junbao Zhang, Guangchun Luo
2011 Wireless personal communications  
The number of nodes encountered can be viewed as the number of copies disseminated.  ...  Adaptive Spraying exploits mobility pattern and encounter history to predict the number of nodes with no copy a node will encounter within the expected delay.  ...  Number of Copies Disseminated Per Message Let us look into two cases, whether the message gets delivered in the spraying phase or not.  ... 
doi:10.1007/s11277-011-0334-3 fatcat:72y42n4mbzei3okebsqewjohzi
« Previous Showing results 1 — 15 out of 2,217 results