Filters








169 Hits in 8.1 sec

Methods and problems of communication in usual networks

Pierre Fraigniaud, Emmanuel Lazard
1994 Discrete Applied Mathematics  
Two different models of communication time are analysed, namely the constant model and the linear model.  ...  This paper is a survey of existing methods of communication in usual networks.  ...  Acknowledgement Both authors are grateful to Dominique Sotteau and one of the referees for many helpful remarks.  ... 
doi:10.1016/0166-218x(94)90180-5 fatcat:bexo5ye4sfatvp3gzxeeu7skrm

A survey of proposals for an alternative group communication service

A. El-Sayed, V. Roca, L. Mathy
2003 IEEE Network  
After more than a decade of important research and development efforts, the deployment of multicast routing in the Internet is far behind expectations.  ...  In this article we identify, classify, and discuss some of these alternative approaches.  ...  The bottom line here is that the right compromise should be achieved between growing an overlay multicast tree in length or width, to suit both application requirements and network conditions.  ... 
doi:10.1109/mnet.2003.1174177 fatcat:qip77yefhrbzpaylpx6ha2frq4

Global Information Sharing under Network Dynamics [article]

Chinmoy Dutta and Gopal Pandurangan and Rajmohan Rajaraman and Zhifeng Sun and Emanuele Viola
2014 arXiv   pre-print
We first consider the strongly adaptive adversary model where in each round, each node first chooses a token to broadcast to all its neighbors (without knowing who they are), and then an adversary chooses  ...  This basic gossip problem can be completed in O(n + k) rounds in any static network, and determining its complexity in dynamic networks is central to understanding the algorithmic limits and capabilities  ...  An important intermediate model between the offline setting and the adaptive adversary models is the oblivious adversary model in which the adversary lays the dynamic network in advance (as in the offline  ... 
arXiv:1409.7771v1 fatcat:wmtju26lizcq7hixmbjkszivxu

Gossiping on MANETs

Roy Friedman, Daniela Gavidia, Luis Rodrigues, Aline Carneiro Viana, Spyros Voulgaris
2007 ACM SIGOPS Operating Systems Review  
In this work we identify the inherent differences in communication between wired and wireless networks and their impact on the design and implementation of gossip protocols.  ...  In particular, our comparison includes drawing a distinction between the gossiping primitives suitable for each of these environments.  ...  Instead, it simply broadcasts the message to all nodes in its communication range.  ... 
doi:10.1145/1317379.1317390 fatcat:j5xv2qfnozfonkdske3nb6vnj4

Araneola: A scalable reliable multicast system for dynamic environments

Roie Melamed, Idit Keidar
2008 Journal of Parallel and Distributed Computing  
Araneola overlays (in which all the links are random) with the same average node degree.  ...  We present a full implementation and evaluation of a gossip-based multicast scheme with up to 10,000 nodes.  ...  We are grateful to the Flux research group at the University of Utah, and especially Leigh Stoller and Jay Lepreau, for allowing us to use their network emulation testbed [64] and assisting us with our  ... 
doi:10.1016/j.jpdc.2008.07.011 fatcat:5fgnmurambezxdmafo2ofmuo3y

RRG: redundancy reduced gossip protocol for real-time N-to-N dynamic group communication

Vincent Wing-Hei Luk, Albert Kai-Sun Wong, Chin-Tau Lea, Robin Wentao Ouyang
2013 Journal of Internet Services and Applications  
We derive a mathematical model for estimating the frame nondelivery probability and the traffic load from overhead, and demonstrate the general correctness of the model by simulation.  ...  We perform experiments over the campus network and PlanetLab, and the prototype system demonstrates the ability of our protocol to maintain robust performance in real-world network environments.  ...  Therefore, the authors in the papers [29, 33, 37] have argued that multiple source-specific multicast trees should be constructed instead of just one shared multicast tree.  ... 
doi:10.1186/1869-0238-4-14 fatcat:xdlt3w63jbfd5c4y7kw4ssxk4y

Reliable Multicast in Data Center Networks

Dan Li, Mingwei Xu, Ying Liu, Xia Xie, Yong Cui, Jingyi Wang, Guihai Chen
2014 IEEE transactions on computers  
A multicast-tree-aware backup overlay is explicitly built on group members for peer-to-peer packet repair.  ...  The key idea of RDCM is to minimize the impact of packet loss on the multicast throughput, by leveraging the rich link resource in data centers.  ...  In this paper, we make substantial improvements based on the previous version, e.g., the multicast tree and backup overlay adjustment schemes, congestion control mechanisms, simulations to compare the  ... 
doi:10.1109/tc.2013.91 fatcat:yysahplhqzauhdxb6nu4kboghu

Radiator - efficient message propagation in context-aware systems

Pedro Alves, Paulo Ferreira
2014 Journal of Internet Services and Applications  
(as their interests continuously change), preventing the use of well-known solutions such as pub-sub and multicast trees.  ...  This leads to the use of non-scalable broadcast based solutions or point-to-point messaging.  ...  Acknowledgements This work was partially supported by national funds through FCT, under projects PTDC/EIA-EIA/113993/2009 and PEst-OE/EEI/LA0021/2011.  ... 
doi:10.1186/1869-0238-5-4 fatcat:tr6vmqz3dvggvexfew2dknfvzi

A Review on P2P Video Streaming [article]

Sabu M Thampi
2013 arXiv   pre-print
The article starts with an introduction to media streaming and its simplified architecture. Various solutions offering video streaming in the context of widespread usage of Internet are discussed.  ...  Finally, the security issues and solutions for P2P video streaming are discussed briefly.  ...  In addition, they all assume the availability of multicasting capability at all participating nodes.  ... 
arXiv:1304.1235v1 fatcat:ozpgxm2v6jdvzd3pwjbv6hanmi

Topology-aware group communication middleware for MANETs

Pedro Garcia Lopez, Raúl Gracia, Marc Espelt, Gerard Paris, Marcel Arrufat, Roc Messeguer
2009 Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middlewaRE - COMSWARE '09  
In this line, we have modified a well-known GC toolkit (JGroups) in order to adapt membership protocols, failure detectors and flow control mechanisms to the underlying MANET topology.  ...  chosen unicast and multicast routing protocols.  ...  ACKNOWLEDGEMENTS This work was partially funded by the Spanish research project P2PGRID (TIN2007-68050-C03-03) of the Spanish "Ministerio de Ciencia e Innovacion".  ... 
doi:10.1145/1621890.1621900 dblp:conf/comsware/LopezTEPAM09 fatcat:37kr5i5ncnazhbgtojfszwkd3m

Asymptotic optimality of randomized peer-to-peer broadcast with network coding

Di Niu, Baochun Li
2011 2011 Proceedings IEEE INFOCOM  
We also give a performance lower bound of the above randomized coded dissemination when both k and N scale under certain conditions.  ...  We consider the problem of distributing k blocks from a source to N nodes in a peer-to-peer (P2P) network with both node upload and download capacity constraints.  ...  rates at the nodes can be achieved by randomly matching the upload and download ports of all the nodes in each time slot.  ... 
doi:10.1109/infcom.2011.5934898 dblp:conf/infocom/NiuL11 fatcat:5dqgo3pgxreetcm7vpiof4r3cy

RBP

Fred Stann, John Heidemann, Rajesh Shroff, Muhammad Zaki Murtaza
2006 Proceedings of the 4th international conference on Embedded networked sensor systems - SenSys '06  
In this paper, we use broadcasting only for single-hop wireless transmission from a node to all its reasonably available neighbors. (We clarify the definition of neighbor in Section 3.)  ...  Many routing and resource discovery protocols depend on flooding (repeated per-node broadcasts) over the network.  ...  The comments of the anonymous SenSys reviewers, and particularly Phil Levis, our shepherd, greatly clarified the technical presentation.  ... 
doi:10.1145/1182807.1182817 dblp:conf/sensys/StannHSM06 fatcat:nbm7gctxtjhednhkp2fiiix3v4

FFMK: A Fast and Fault-Tolerant Microkernel-Based System for Exascale Computing [chapter]

Carsten Weinhold, Adam Lackorzynski, Jan Bierbaum, Martin Küttler, Maksym Planeta, Hannes Weisbach, Matthias Hille, Hermann Härtig, Alexander Margolin, Dror Sharf, Ely Levy, Pavel Gak (+7 others)
2020 Lecture Notes in Computational Science and Engineering  
In this paper, we describe the basic components, algorithms, and services we developed in Phase 2 of the project.  ...  The FFMK project designs, builds and evaluates a system-software architecture to address the challenges expected in Exascale systems.  ...  Acknowledgments This research and the work presented in this paper is supported by the German priority program 1648 "Software for Exascale Computing" via the research project FFMK [17] .  ... 
doi:10.1007/978-3-030-47956-5_16 fatcat:accs6fosezfuzme75yc63nrkum

Self-Optimised Tree Overlays Using Proximity-Driven Self-Organised Agents [chapter]

Evangelos Pournaras, Martijn Warnier, Frances M. T. Brazier
2010 Complex Intelligent Systems and Their Applications  
Self-organisation is the approach taken in this chapter. AETOS, the Adaptive Epidemic Tree Overlay Service, provides tree overlays on demand.  ...  The evaluation of AETOS in different simulation settings shows that it provides high connectivity in tree overlays optimised according to application requirements.  ...  Acknowledgements The authors are grateful to the NLnet Foundation and Delft University of Technology, for their support. http://www.nlnet.nl.  ... 
doi:10.1007/978-1-4419-1636-5_7 fatcat:lgxmln75qfhjfp4t5zlstl6tvm

Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode

T.F. Gonzalez
2008 IEEE Transactions on Parallel and Distributed Systems  
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with the multicasting communication  ...  The algorithm takes OðqnÞ time, where n is the number of processors and q is the total number of messages that the processors receive.  ...  The multiport communication model is more general than the single-port one used in this paper.  ... 
doi:10.1109/tpds.2007.70801 fatcat:7r2mrq2bkfaqvhpndmrkdmkk5m
« Previous Showing results 1 — 15 out of 169 results