Relevant bibliographies by topics / Gossip, dissemination, network, algorithms

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Gossip, dissemination, network, algorithms'

Author: Grafiati
Published: 4 June 2021
Last updated: 9 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Gossip, dissemination, network, algorithms.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Gossip, dissemination, network, algorithms"

1

Yang, Bo, Demin Liu, and Wenfeng Zhang. "Information dissemination in mobile social networks with gossip algorithms." International Journal of Ad Hoc and Ubiquitous Computing 21, no. 4 (2016): 259. http://dx.doi.org/10.1504/ijahuc.2016.076369.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sharma, Rajesh, and Anwitaman Datta. "GoDisco++: A gossip algorithm for information dissemination in multi-dimensional community networks." Pervasive and Mobile Computing 9, no. 2 (April 2013): 324–35. http://dx.doi.org/10.1016/j.pmcj.2012.09.005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hromkovič, Juraj, Ralf Klasing, Dana Pardubská, Juraj Waczulík, and Hubert Wagener. "Effective Systolic Algorithms for Gossiping in Cycles." Parallel Processing Letters 08, no. 02 (June 1998): 197–205. http://dx.doi.org/10.1142/s0129626498000213.

Full text
Abstract:
The complexity of systolic dissemination of information in the rings of processors (cycles) in the one-way (telegraph) mode is investigated. Tight lower and upper bounds on the complexity of one-way systolic gossip are established.
APA, Harvard, Vancouver, ISO, and other styles
4

LIESTMAN, ARTHUR L., and DANA RICHARDS. "PERPETUAL GOSSIPING." Parallel Processing Letters 03, no. 04 (December 1993): 347–55. http://dx.doi.org/10.1142/s0129626493000381.

Full text
Abstract:
In this paper, we introduce a new information dissemination problem in which gossiping is to occur continuously but with restricted use of the network. In this problem, information continues to be generated by each member of the network and, thus, the gossip process must be ongoing. However, in order to allow the network to be used for other purposes, the communications used by the gossip process are limited to k calls per time unit. We present some preliminary results on this new problem.
APA, Harvard, Vancouver, ISO, and other styles
5

Kenyeres, Martin, and Jozef Kenyeres. "Comparative Study of Distributed Consensus Gossip Algorithms for Network Size Estimation in Multi-Agent Systems." Future Internet 13, no. 5 (May 18, 2021): 134. http://dx.doi.org/10.3390/fi13050134.

Full text
Abstract:
Determining the network size is a critical process in numerous areas (e.g., computer science, logistic, epidemiology, social networking services, mathematical modeling, demography, etc.). However, many modern real-world systems are so extensive that measuring their size poses a serious challenge. Therefore, the algorithms for determining/estimating this parameter in an effective manner have been gaining popularity over the past decades. In the paper, we analyze five frequently applied distributed consensus gossip-based algorithms for network size estimation in multi-agent systems (namely, the Randomized gossip algorithm, the Geographic gossip algorithm, the Broadcast gossip algorithm, the Push-Sum protocol, and the Push-Pull protocol). We examine the performance of the mentioned algorithms with bounded execution over random geometric graphs by applying two metrics: the number of sent messages required for consensus achievement and the estimation precision quantified as the median deviation from the real value of the network size. The experimental part consists of two scenarios—the consensus achievement is conditioned by either the values of the inner states or the network size estimates—and, in both scenarios, either the best-connected or the worst-connected agent is chosen as the leader. The goal of this paper is to identify whether all the examined algorithms are applicable to estimating the network size, which algorithm provides the best performance, how the leader selection can affect the performance of the algorithms, and how to most effectively configure the applied stopping criterion.
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Yu Ze, Shao Chuan Wu, and Wen Cui. "Gossip Algorithms for Average Energy Estimation in Wireless Sensor Networks." Applied Mechanics and Materials 577 (July 2014): 908–12. http://dx.doi.org/10.4028/www.scientific.net/amm.577.908.

Full text
Abstract:
Gossip algorithms which belong to a kind of distributed algorithms can be used to compute the (possibly weighted) average of the initial measurements of the nodes at every node in the network. This paper proposes an improved broadcast gossip algorithm to estimate average energy with better accuracy. In this proposed algorithm, we use some companion variables to save the sum, and convergence error is decreasing with the number of companion variables increasing. Convergence of the proposed algorithm is studied theoretically and verified by simulations. Although the estimated value is random, we show that the novel algorithm can converge closer to average than broadcast gossip algorithm in probability.
APA, Harvard, Vancouver, ISO, and other styles
7

Zanaj, Elma, Marco Baldi, and Franco Chiaraluce. "Efficiency of Unicast and Broadcast Gossip Algorithms for Wireless Sensor Networks." Journal of Communications Software and Systems 4, no. 2 (June 22, 2008): 105. http://dx.doi.org/10.24138/jcomss.v4i2.223.

Full text
Abstract:
Gossip is a well-known technique for distributed computing in an arbitrarily connected network, that can be adopted effectively in wireless sensor networks. Gossip algorithms have been widely studied in previous literature, but mostly from a theoretical point of view. The aim of this paper isto verify the behavior of the gossip approach in practicalscenarios, through the analysis and interpretation of simulated results. So, we investigate the impact of optimizing the neighbor selection probabilities, the effect of multiple link failures and that of limited transmission radius. The possibility to use broadcast-like algorithms to increase the rate of convergence in averaging problems is also discussed and its advantage estimated.
APA, Harvard, Vancouver, ISO, and other styles
8

Fan, Xiying, Chuanhe Huang, Junyu Zhu, and Bin Fu. "Replication-Based Data Dissemination in Connected Internet of Vehicles." Wireless Communications and Mobile Computing 2019 (April 4, 2019): 1–16. http://dx.doi.org/10.1155/2019/2150524.

Full text
Abstract:
Due to the dynamically changing topology of Internet of Vehicles (IoV), it is a challenging issue to achieve efficient data dissemination in IoV. This paper considers strongly connected IoV with a number of heterogenous vehicular nodes to disseminate information and studies distributed replication-based data dissemination algorithms to improve the performance of data dissemination. Accordingly, two data replication algorithms, a deterministic algorithm and a distributed randomised algorithm, are proposed. In the proposed algorithms, the number of message copies spread in the network is limited and the network will be balanced after a series of average operations among the nodes. The number of communication stages needed for network balance shows the complexity of network convergence as well as network convergence speed. It is proved that the network can achieve a balanced status after a finite number of communication stages. Meanwhile, the upper and lower bounds of the time complexity are derived when the distributed randomised algorithm is applied. Detailed mathematical results show that the network can be balanced quickly in complete graph; thus highly efficient data dissemination can be guaranteed in dense IoV. Simulation results present that the proposed randomised algorithm outperforms the present schemes in terms of transmissions and dissemination delay.
APA, Harvard, Vancouver, ISO, and other styles
9

Yang, Zhiwei, Weigang Wu, Yong Li, and Yishun Chen. "Cluster-based efficient information dissemination in dynamic networks." International Journal of Distributed Sensor Networks 14, no. 3 (March 2018): 155014771876208. http://dx.doi.org/10.1177/1550147718762086.

Full text
Abstract:
Dynamic network is an abstraction of networks with frequent topology changes arising from node mobility or other reasons. In this article, we first propose a dynamic network model, named ( T, L)-HiNet, to extend existing dynamic network models with clusters. ( T, L)-HiNet includes several properties defining the stability of cluster hierarchy in a dynamic network, including cluster head set, cluster member set and the connections among them. Based on ( T, L)-HiNet, we design several hierarchical information dissemination algorithms for different scenarios of dynamics. Furthermore, we extend the ( T, L)-HiNet model and corresponding algorithms in two directions, that is, stability of cluster head set and cluster size. The correctness of our algorithms is proved rigorously, and their performance is evaluated via both numerical analysis and simulations. The results show that compared with the algorithm recently proposed by Kuhn et al., our design can significantly reduce communication cost and also time cost.
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Zhiyuan, Junlei Bi, and Carlos Borrego. "Exploiting Temporal and Spatial Regularities for Content Dissemination in Opportunistic Social Network." Wireless Communications and Mobile Computing 2019 (March 6, 2019): 1–16. http://dx.doi.org/10.1155/2019/3173152.

Full text
Abstract:
Recently, content dissemination has become more and more important for opportunistic social networks. The challenges of opportunistic content dissemination result from random movement of nodes and uncertain positions of a destination, which seriously affect the efficiency of content dissemination. In this paper, we firstly construct time-varying interest communities based on the temporal and spatial regularities of users. Next, we design a content dissemination algorithm on the basis of time-varying interest communities. Our proposed content dissemination algorithm can run in O(nlog⁡n) time. Finally, the comparisons between the proposed content dissemination algorithm and state-of-the-art content dissemination algorithms show that our proposed content dissemination algorithm can (a) keep high query success rate, (b) reduce the average query latency, (c) reduce the hop count of a query, and (d) maintain low system overhead.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Gossip, dissemination, network, algorithms"

1

Berti, Gianmarco. "Data dissemination over complex networks through gossip." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8154/.

Full text
Abstract:
This thesis offers a practical and theoretical evaluations about gossip-epidemic algorithms, comparing those most common in the literature with new proposed algorithms and analyzing their behavior. Tests have been executed using one hundred graphs that has been randomly generated by Large Unstructured NEtwork Simulator (LUNES), a simulation software provided by Parallel and Distributed Simulation Research Group (PADS), of the Department of Computer Science, Università di Bologna and simulated using Advanced RTI System (ARTÌS), based on the High Level Architecture standard. Literatures algorithms have been analyzed and taken as base for new algorithms.
APA, Harvard, Vancouver, ISO, and other styles
2

Rahimian, Fatemeh. "Gossip-based Algorithms for Information Dissemination and Graph Clustering." Doctoral thesis, KTH, Programvaruteknik och Datorsystem, SCS, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-145361.

Full text
Abstract:
Decentralized algorithms are becoming ever more prevalent in almost all real-world applications that are either data intensive, computation intensive or both. This thesis presents a few decentralized solutions for large-scale (i) data dissemination, (ii) graph partitioning, and (iii) data disambiguation. All these solutions are based on gossip, a light weight peer-to-peer data exchange protocol, and thus, appropriate for execution in a distributed environment. For efficient data dissemination, we make use of the publish/subscribe communication model and provide two distributed solutions, one for topicbased and one for content-based subscriptions, named Vitis and Vinifera respectively. These systems propagate large quantities of data to interested users with a relatively low overhead. Without any central coordinator and only with the use of gossip, we build a novel topology that enables efficient routing in an unstructured overlay. We construct a hybrid system by injecting structure into an otherwise unstructured network. The resulting structure resembles a navigable small-world network that spans along clusters of nodes that have similar subscriptions. The properties of such an overlay make it an ideal platform for efficient data dissemination in large-scale systems. Our solutions significantly outperforms their counterparts on various subscription and churn scenarios, from both synthetic models and real-world traces. We then investigate how gossiping protocols can be used, not for overlay construction, but for operating on fixed overlay topologies, which resemble graphs. In particular we study the NP-Complete problem of graph partitioning and present a distributed partitioning solution for very large graphs. This solution, called Ja-be-Ja, is based on local search and does not require access to the entire graph simultaneously. It is, therefore, appropriate for graphs that can not even fit into the memory of a single computer. Once again gossip-based algorithms prove efficient as they enable implementing light-weight peer sampling services, which supply graph nodes with partial knowledge about other nodes in the graph. The performance of our partitioning algorithm is comparable to centralized graph partitioning algorithms, and yet it is scalable and can be executed on several machines in parallel or even in a completely distributed peer-to-peer overlay. It can be used for both edge-cut and vertex-cut partitioning of graphs and can produce partition sizes of any given distribution. We further extend the use of gossiping protocols to find natural clusters in a graph instead of producing a given number of partitions. This problem, known as graph community detection, has extensive application in various fields and communities. We take the use of our community detection algorithm to the realm of linguistics and address a well-known problem of data disambiguation. In particular, we provide a parallel community detection algorithm for cross-document coreference problem. We operate on graphs that we construct by representing documents’ keywords as nodes and the co-location of those keywords in a document as edges. We then exploit the particular nature of such graphs, which is coreferent words are topologically clustered, and thus, can be efficiently discovered by our community detection algorithm.

QC 20140519

APA, Harvard, Vancouver, ISO, and other styles
3

Pace, Alessio. "Quelques défis posés par l'utilisation de protocoles de Gossip dans l'Internet." Phd thesis, Université de Grenoble, 2011. http://tel.archives-ouvertes.fr/tel-00636386.

Full text
Abstract:
Les systèmes pair-à-pair (P2P) sont aujourd'hui très populaires. Leur utilisation va de la messagerie instantanée au partage de fichiers, en passant par la sauvegarde et le stockage distribué ou encore le streaming video. Parmi les protocoles P2P, les protocoles basés sur le "gossip" sont une famille de protocoles qui a fait l'objet de nombreux travaux de recherche durant la dernière décennie. Les raisons de l'engouement pour les protocoles basés sur le "gossip" sont qu'ils sont considérés robustes, faciles à mettre en oeuvre et qu'ils ont des propriétés de passage à l'échelle intéressantes. Ce sont donc des candidats intéressants dès lors qu'il s'agit de réaliser des systèmes distribués dynamiques à large échelle. Cette thèse considère deux problématiques rencontrées lorsque l'on déploie des protocoles basé sur le "gossip" dans un environnement réel comme l'Internet. La première problématique est la prise en compte des pare-feux (NAT) dans le cadre des protocoles d'échantillonnage basés sur le "gossip". Ces protocoles font l'hypothèse que, a tout moment, chaque noeud est capable de communiquer avec n'importe quel noeud du réseau. Cette hypothèse est fausse dès lors que certains noeuds utilisent des NAT. Nous présentons Nylon, un protocole d'échantillonnage qui fonctionne malgré la présence de NAT. Nylon introduit un faible surcoût pour gérer les NAT et partage équitablement ce surcoût entre les noeuds possédant un NAT et les autres noeuds. La deuxième problématique que nous étudions est la possibilité de limiter la dissémination de messages de type "spam" dans les protocoles de dissémination basés sur le "gossip". Ces protocoles sont en effet des vecteurs idéaux pour diffuser les messages de type "spam" du fait qu'il n'y a pas d'autorité de contrôle permettant de filtrer les messages basés sur leur contenu. Nous proposons FireSpam, un protocole de dissémination basé sur le "gossip" qui permet de limiter la diffusion des messages de type "spam". FireSpam fonctionne par filtrage décentralisé (chaque noeud participe au filtrage). Par ailleurs, il fonctionne malgré la présence d'une fraction de noeuds malicieux (aussi appelés "Byzantins") et malgré la présence de noeuds dits "rationnels" (aussi appelés "égoïstes"). Ces derniers sont prêts à dévier du protocole s'ils ont un intérêt à le faire.
APA, Harvard, Vancouver, ISO, and other styles
4

Wu, Hao. "Analysis and Design of Vehicular Networks." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7639.

Full text
Abstract:
Advances in computing and wireless communication technologies have increased interest in smart vehicles, vehicles equipped with significant computing, communication and sensing capabilities to provide services to travelers. Smart vehicles can be exploited to improve driving safety and comfort as well as optimize surface transportation systems. Wireless communications among vehicles and between vehicles and roadside infrastructures represent an important class of vehicle communications. One can envision creating an integrated radio network leveraging various wireless technologies that work together in a seamless fashion. Based on cost-performance tradeoffs, different network configurations may be appropriate for different environments. An understanding of the properties of different vehicular network architectures is absolutely necessary before services can be successfully deployed. Based on this understanding, efficient data services (e.g., data dissemination services) can be designed to accommodate application requirements. This thesis examines several research topics concerning both the evaluation and design of vehicular networks. We explore the properties of vehicle-to-vehicle (v2v) communications. We study the spatial propagation of information along the road using v2v communications. Our analysis identifies the vehicle traffic characteristics that significantly affect information propagation. We also evaluate the feasibility of propagating information along a highway. Several design alternatives exist to build infrastructure-based vehicular networks. Their characteristics have been evaluated in a realistic vehicular environment. Based on these evaluations, we have developed some insights into the design of future broadband vehicular networks capable of adapting to varying vehicle traffic conditions. Based on the above analysis, opportunistic forwarding that exploit vehicle mobility to overcome vehicular network partitioning appears to be a viable approach for data dissemination using v2v communications for applications that can tolerate some data loss and delay. We introduce a methodology to design enhanced opportunistic forwarding algorithms. Practical algorithms derived from this methodology have exhibited different performance/overhead tradeoffs. An in-depth understanding of wireless communication performance in a vehicular environment is necessary to provide the groundwork for realizing reliable mobile communication services. We have conducted an extensive set of field experiments to uncover the performance of short-range communications between vehicles and between vehicles and roadside stations in a specific highway scenario.
APA, Harvard, Vancouver, ISO, and other styles
5

Banerjee, Siddhartha. "Aggregation, dissemination and filtering : controlling complex information flows in networks." 2013. http://hdl.handle.net/2152/21751.

Full text
Abstract:
Modern day networks, both physical and virtual, are designed to support increasingly sophisticated applications based on complex manipulation of information flows. On the flip side, the ever-growing scale of the underlying networks necessitate the use of low-complexity algorithms. Exploring this tension needs an understanding of the relation between these flows and the network structure. In this thesis, we undertake a study of three such processes: aggregation, dissemination and filtering. In each case, we characterize how the network topology imposes limits on these processes, and how one can use knowledge of the topology to design simple yet efficient control algorithms. Aggregation: We study data-aggregation in sensor networks via in-network computation, i.e., via combining packets at intermediate nodes. In particular, we are interested in maximizing the refresh-rate of repeated/streaming aggregation. For a particular class of functions, we characterize the maximum achievable refresh-rate in terms of the underlying graph structure; furthermore we develop optimal algorithms for general networks, and also a simple distributed algorithm for acyclic wired networks. Dissemination: We consider dissemination processes on networks via intrinsic peer-to-peer transmissions aided by external agents: sources with bounded spreading power, but unconstrained by the network. Such a model captures many static (e.g. long-range links) and dynamic/controlled (e.g. mobile nodes, broadcasting) models for long-range dissemination. We explore the effect of external sources for two dissemination models: spreading processes, wherein nodes once infected remain so forever, and epidemic process, in which nodes can recover from the infection. The main takeaways from our results demonstrate: (i) the role of graph structure, and (ii) the power of random strategies. In spreading processes, we show that external agents dramatically reduce the spreading time in networks that are spatially constrained; furthermore random policies are order-wise optimal. In epidemic processes, we show that for causing long-lasting epidemics, external sources must scale with the number of nodes -- however the strategies can be random. Filtering: A common phenomena in modern recommendation systems is the use of user-feedback to infer the 'value' of an item to other users, resulting in an exploration vs. exploitation trade-off. We study this in a simple natural model, where an 'access-graph' constrains which user is allowed to see which item, and the number of items and the number of item-views are of the same order. We want algorithms that recommend relevant content in an online manner (i.e., instantaneously on user arrival). To this end, we consider both finite-population (i.e., with a fixed set of users and items) and infinite-horizon settings (i.e., with user/item arrivals and departures) -- in each case, we design algorithms with guarantees on the competitive ratio for any arbitrary user. Conversely, we also present upper bounds on the competitive ratio, which show that in many settings our algorithms are orderwise optimal.
text
APA, Harvard, Vancouver, ISO, and other styles
6

Barua, Chowdhury Sucharit. "A greedy algorithm for non-atomic data dissemination in publish/subscribe network /." 2007. http://proquest.umi.com/pqdweb?did=1441235061&sid=2&Fmt=2&clientId=10361&RQT=309&VName=PQD.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Gossip, dissemination, network, algorithms"

1

Friedman, Roy, Anne-Marie Kermarrec, Hugo Miranda, and Luís Rodrigues. "Gossip-Based Dissemination." In Middleware for Network Eccentric and Mobile Applications, 169–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-89707-1_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hirooka, Takumu, Daisuke Yamamasu, and Naohiro Hayashibara. "Gossip-Style Message Dissemination Based on Biconnected Components." In Advances in Network-Based Information Systems, 711–18. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-65521-5_63.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Guoli, Shuang Hou, and Hans Arno Jacobsen. "Content-Based XML Data Dissemination." In Advanced Applications and Structures in XML Processing, 227–55. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-61520-727-5.ch011.

Full text
Abstract:
XML-based data dissemination networks are rapidly gaining momentum. In these networks XML content is routed from data producers to data consumers throughout an overlay network of content-based routers. Routing decisions are based on XPath expressions (XPEs) stored at each router. To enable efficient routing, while keeping the routing state small, we introduce advertisement-based routing algorithms for XML content, present a novel data structure for managing XPEs, especially apt for the hierarchical nature of XPEs and XML, and develop several optimizations for reducing the number of XPEs required to manage the routing state. The experimental evaluation shows that our algorithms and optimizations reduce the routing table size by up to 90%, improve the routing time by roughly 85%, and reduce overall network traffic by about 35%. Experiments running on PlanetLab show the scalability of our approach.
APA, Harvard, Vancouver, ISO, and other styles
4

Repantis, Thomas, and Vana Kalogeraki. "Data Dissemination and Query Routing in Mobile Peer-to-Peer Networks." In Networking and Telecommunications, 371–94. IGI Global, 2010. http://dx.doi.org/10.4018/978-1-60566-986-1.ch025.

Full text
Abstract:
In this chapter the authors study the problems of data dissemination and query routing in mobile peerto- peer networks. They provide a taxonomy and discussion of existing literature, spanning overlay topologies, query routing, and data propagation. They proceed by proposing content-driven routing and adaptive data dissemination algorithms for intelligently routing search queries in a peer-to-peer network that supports mobile users. In the authors’ mechanism, nodes build content synopses of their data and adaptively disseminate them to their most appropriate peers. Based on the content synopses, a routing mechanism is being built, to forward the queries to those peers that have a high probability of providing the desired results. The authors provide an experimental evaluation of different dissemination strategies, which shows that content-driven routing and adaptive data dissemination is highly scalable and significantly improves resource usage.
APA, Harvard, Vancouver, ISO, and other styles
5

Katsaounidou, Anastasia N., and Charalampos A. Dimoulas. "Integrating Content Authentication Support in Media Services." In Advances in Marketing, Customer Relationship Management, and E-Services, 395–408. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-7766-9.ch031.

Full text
Abstract:
The chapter investigates content authentication strategies and their use in media practice. Remarkable research progress has been conducted on media veracity methods and algorithms, however without providing that much straightforward tools to users involved in real-world applications. Hence, there is an urgent need for further support content verification by exploiting all the available methods in properly integrated online environments, forming a media authentication network. On-demand training (and feedback) on these technologies is considered of major importance, enabling users to collaborate with media and forgery experts towards adoption, refinement, and widespread dissemination of best practices. Better comprehension of the involved tools and algorithms would propel their broad exploitation in practice, gaining valuable feedback for further improvements. Thus, a continuously updated online repository, containing documented examples, learning resources, and media veracity tools could be adaptively accommodated, better supporting various users and applications needs.
APA, Harvard, Vancouver, ISO, and other styles
6

Katsaounidou, Anastasia, and Charalampos Dimoulas. "Integrating Content Authentication Support in Media Services." In Encyclopedia of Information Science and Technology, Fourth Edition, 2908–19. IGI Global, 2018. http://dx.doi.org/10.4018/978-1-5225-2255-3.ch254.

Full text
Abstract:
The present chapter investigates content authentication strategies and their use in media practice. Remarkable research progress has been conducted on media veracity methods and algorithms, however, without providing that much straightforward tools to users involved in real-world applications. Hence, there is an urgent need for further supporting content verification by exploiting all the available methods in properly integrated online environments, forming a Media Authentication Network. On-demand training (and feedback) on these technologies is considered of major importance, enabling users to collaborate with media and forgery experts towards adoption, refinement and widespread dissemination of best practices. Better comprehension of the involved tools and algorithms would propel their broad exploitation in practice, gaining valuable feedback for further improvements. Thus, a continuously updated online repository, containing documented examples, learning resources and media veracity tools, could be adaptively accommodated, better supporting various users and applications needs.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Gossip, dissemination, network, algorithms"

1

Guosong Chu and You You. "Network coding aided gossip algorithms for information dissemination in arbitrary networks." In IET International Conference on Communication Technology and Application (ICCTA 2011). IET, 2011. http://dx.doi.org/10.1049/cp.2011.0689.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yang, Bo, Guangxi Zhu, and Weimin Wu. "Multimedia contents dissemination with gossip algorithms in distributed social networks." In the Fifth International Conference. New York, New York, USA: ACM Press, 2013. http://dx.doi.org/10.1145/2499788.2499848.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shah, Devavrat. "Network gossip algorithms." In ICASSP 2009 - 2009 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 2009. http://dx.doi.org/10.1109/icassp.2009.4960423.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Femminella, M., R. Francescangeli, G. Reali, and H. Schulzrinne. "Gossip-based signaling dissemination extension for next steps in signaling." In 2012 IEEE/IFIP Network Operations and Management Symposium (NOMS 2012). IEEE, 2012. http://dx.doi.org/10.1109/noms.2012.6212024.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Miletic, Luka, Zarko Milosevic, Marko Misic, and Jelica Protic. "Simulation Analysis of Data Dissemination Algorithms in a Blockchain Network." In 2018 26th Telecommunications Forum (TELFOR). IEEE, 2018. http://dx.doi.org/10.1109/telfor.2018.8611991.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Dhuli, Sateeshkrishna, Y. N. Singh, and Priya Ranjan. "Effect of nearest neighbors on convergence rate of periodic gossip algorithms in WSNs." In 2020 IEEE 9th International Conference on Communication Systems and Network Technologies (CSNT). IEEE, 2020. http://dx.doi.org/10.1109/csnt48778.2020.9115739.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Aguilar, Leonardo, and Daniel Macêdo Batista. "Effectiveness of Implementing Load Balancing via SDN." In XXXVII Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/sbrc_estendido.2019.7796.

Full text
Abstract:
Software-Defined Networking (SDN) is an architecture that allows the creation, management and customization of the network through programmable switches and centralized controllers via a well-defined protocol. Despite the wide dissemination of general advantages in using SDN, it is always important to evaluate the real advantages considering specific network applications. In line with this, the purpose of this work is to analyze the effectiveness of using SDN for load balancing by developing a balancer, made available as free software, that can execute three different algorithms, giving to the administrator the possibility to choose, at run time, which will be used as well as their configurations, and the possibility to implement new algorithms.
APA, Harvard, Vancouver, ISO, and other styles
8

Sáenz, Carlos Abel Córdova, Marcelo Dias, and Karin Becker. "Combining compact news representations generated using DistilBERT and topological features to classify fake news." In Symposium on Knowledge Discovery, Mining and Learning. Sociedade Brasileira de Computação, 2020. http://dx.doi.org/10.5753/kdmile.2020.11978.

Full text
Abstract:
Fake news (FN) have affected people’s lives in unimaginable ways. The automatic classification of FN is a vital tool to prevent their dissemination and support fact-checking. Related work has shown that FN spread faster, deeper, and more broadly than the truth on social media. Besides, deep learning has produced state-of-the-art solutions in this field, mainly based on textual attributes. In this paper, we propose initial experiments to combine compact representations of the textual news properties generated using DistilBERT, with topological metrics extracted from the social propagation network. Using a dataset related to politics and five distinct classification algorithms, our results are encouraging. Regarding the textual attributes, we reached results comparable to state-of-the-art solutions using only the news title and contents, which is useful for FN early detection. The topological attributes were not as effective, but the promising results encourage the investigation of alternative architectures for their combination
APA, Harvard, Vancouver, ISO, and other styles
9

Scianna, Andrea, Giuseppe Fulvio Gaglio, and Marcello La Guardia. "ACCESSIBILITY TO UNDERWATER CULTURAL HERITAGE: INTERACTIVE WEB NAVIGATION OF THE ROMAN SUBMERSED VESSEL OF CALA MINNOLA." In ARQUEOLÓGICA 2.0 - 9th International Congress & 3rd GEORES - GEOmatics and pREServation. Editorial Universitat Politécnica de Valéncia: Editorial Universitat Politécnica de Valéncia, 2021. http://dx.doi.org/10.4995/arqueologica9.2021.12148.

Full text
Abstract:
The possibilities offered by photogrammetric reconstruction based on computer vision algorithms allowed in recent years to develop new interesting solutions for the use and dissemination of knowledge on Cultural Heritage (CH). In the same way, the recent technological development in the field of Virtual Reality (VR) has offered new possibilities for the creation of interactive virtual environments which can be freely accessed via the browser using any type of device. These technologies acquire an additional relevance if applied to archaeological sites or monuments that are difficult to access, or even totally inaccessible, except by specialized personnel. In this case the virtual fruition on web becomes strategic for the valorization of CH, as in the case of submerged archaeological sites, where the virtual tour represents in fact the only opportunity of diffuse accessibility. The present case shows the virtual reconstruction of the wreck area of the Roman ship found on the seabed of Cala Minnola on the island of Levanzo (TP, Italy). The model, obtained from a Structure from Motion (SfM) processing of a chunk of photos originally intended for a traditional photogrammetric survey, was edited and inserted into a specific template based on HTML5 and linked to Javascript libraries (Three.js) which allowed browsing on web. Subsequently, the navigation model was appropriately adapted to the purpose, so as to make the use of the network more intuitive possible, considering any type of device and using the most common browsers (Chrome, Safari, Firefox). This experimentation is a viable procedure for spreading the knowledge of a submerged archaeological site in a simple way, by web-browsing. This type of navigation models with the future development of 5G networks will find greater diffusion and application, with the possibility of including increasingly complex environments in the navigation.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Gossip, dissemination, network, algorithms' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography