|
Gossip Protocol
A gossip protocol or epidemic protocol is a procedure or process of computer peer-to-peer communication that is based on the way epidemics spread. Some distributed systems use peer-to-peer gossip to ensure that data is disseminated to all members of a group. Some ad-hoc networks have no central registry and the only way to spread common data is to rely on each member to pass it along to their neighbors. Communication The concept of ''gossip communication'' can be illustrated by the analogy of office workers spreading rumors. Let's say each hour the office workers congregate around the water cooler. Each employee pairs off with another, chosen at random, and shares the latest gossip. At the start of the day, Dave starts a new rumor: he comments to Bob that he believes that Charlie dyes his mustache. At the next meeting, Bob tells Alice, while Dave repeats the idea to Eve. After each water cooler rendezvous, the number of individuals who have heard the rumor roughly doubles (thou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Epidemic
An epidemic (from Greek ἐπί ''epi'' "upon or above" and δῆμος ''demos'' "people") is the rapid spread of disease to a large number of hosts in a given population within a short period of time. For example, in meningococcal infections, an attack rate in excess of 15 cases per 100,000 people for two consecutive weeks is considered an epidemic. Epidemics of infectious disease are generally caused by several factors including a change in the ecology of the host population (e.g., increased stress or increase in the density of a vector species), a genetic change in the pathogen reservoir or the introduction of an emerging pathogen to a host population (by movement of pathogen or host). Generally, an epidemic occurs when host immunity to either an established pathogen or newly emerging novel pathogen is suddenly reduced below that found in the endemic equilibrium and the transmission threshold is exceeded. An epidemic may be restricted to one location; however, if it sp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Paxos Algorithm
Paxos is a family of protocols for solving Consensus (computer science), consensus in a network of unreliable or fallible processors. Consensus is the process of agreeing on one result among a group of participants. This problem becomes difficult when the participants or their communications may experience failures. Consensus protocols are the basis for the state machine replication approach to distributed computing, as suggested by Leslie Lamport and surveyed by Fred B. Schneider, Fred Schneider. State machine replication is a technique for converting an algorithm into a fault-tolerant, distributed implementation. Ad-hoc techniques may leave important cases of failures unresolved. The principled approach proposed by Lamport et al. ensures all cases are handled safely. The Paxos protocol was first submitted in 1989 and named after a fictional legislative consensus system used on the Paxi, Paxos island in Greece, where Lamport wrote that the parliament had to function "even thou ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Eli Upfal
__NOTOC__ Eli Upfal () is a computer science researcher, currently the Rush C. Hawkins Professor of Computer Science at Brown University. He completed his undergraduate studies in mathematics and statistics at the Hebrew University of Jerusalem in 1978, received an M.Sc. in computer science from the Feinberg Graduate School of the Weizmann Institute of Science, Israel in 1980, and completed his PhD in computer science at the Hebrew University in 1983 under Eli Shamir. He has made contributions in a variety of areas. Most of his work involves randomized and/or online algorithms, stochastic processes, or the probabilistic analysis of deterministic algorithms. Particular applications include routing and communications networks, computational biology, and computational finance. He is responsible for a large body of work, including, as of May 2012, more than 150 publications in journals and conferences as well as many patents. He has won several prizes, including the IBM Outstandi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symposium On Principles Of Distributed Computing
The ACM Symposium on Principles of Distributed Computing (PODC) is an academic conference in the field of distributed computing organised annually by the Association for Computing Machinery (special interest groups SIGACT and SIGOPS). Scope and related conferences Work presented at PODC typically studies theoretical aspects of distributed computing, such as the design and analysis of distributed algorithms. The scope of PODC is similar to the scope of International Symposium on Distributed Computing (DISC), with the main difference being geographical: DISC is usually organized in European locations,DISC in . while PODC has been traditionally held in North America. [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
International Conference On Distributed Computing Systems
The International Conference on Distributed Computing Systems (ICDCS) is the oldest conference in the field of distributed computing systems in the world. It was launched by the IEEE Computer Society Technical Committee on Distributed Processing (TCDP) in October 1979, and is sponsored by such committee. It was started as an 18-month conference until 1983 and became an annual conference since 1984. The ICDCS has a long history of significant achievements and worldwide visibility, and has recently celebrated its 37th year. Location history * 2019: Dallas, Texas, United States * 2018: Vienna, Austria * 2017: Atlanta, GA, United States * 2016: Nara, Japan * 2015: Columbus, Ohio, United States * 2014: Madrid, Spain * 2013: Philadelphia, Pennsylvania, United States * 2012: Macau, China * 2011: Minneapolis, Minnesota, United States * 2010: Genoa, Italy * 2009: Montreal, Quebec, Canada * 2008: Beijing, China * 2007: Toronto, Ontario, Canada * 2006: Lisbon, Portugal * 2005: Columbus, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of Systems And Software
The ''Journal of Systems and Software'' is a computer science journal in the area of software systems, established in 1979 and published by Elsevier. Content and scope The journal publishes research papers, state-of-the-art surveys, and practical experience reports. It includes papers covering issues of programming methodology, software engineering, and hardware/software systems. Topics include: "software systems, prototyping issues, high-level specification techniques, procedural and functional programming techniques, data-flow concepts, multiprocessing, real-time, distributed, concurrent, and telecommunications systems, software metrics, reliability models for software, performance issues, and management concerns." Abstracting and indexing According to the 2021 ''Journal Citation Reports'', the ''Journal of Systems and Software'' has an impact factor of 3.514. According to Google Scholar, the journal has an ''h''5-index of 61, which ranks third among international public ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Symposium On Foundations Of Computer Science
The IEEE Annual Symposium on Foundations of Computer Science (FOCS) is an academic conference in the field of theoretical computer science. FOCS is sponsored by the IEEE Computer Society. As writes, FOCS and its annual Association for Computing Machinery counterpart STOC (the Symposium on Theory of Computing) are considered the two top conferences in theoretical computer science, considered broadly: they “are forums for some of the best work throughout theory of computing that promote breadth among theory of computing researchers and help to keep the community together.” includes regular attendance at FOCS and STOC as one of several defining characteristics of theoretical computer scientists. Awards The Knuth Prize for outstanding contributions to theoretical computer science is presented alternately at FOCS and STOC. Works of the highest quality presented at the conference are awarded the Best Paper Award. In addition, the Machtey Award is presented to the best studen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Journal Of The ACM
The ''Journal of the ACM'' (''JACM'') is a peer-reviewed scientific journal covering computer science in general, especially theoretical aspects. It is an official journal of the Association for Computing Machinery. Its current editor-in-chief is Venkatesan Guruswami. The journal was established in 1954 and "computer scientists universally hold the ''Journal of the ACM'' in high esteem". See also * ''Communications of the ACM ''Communications of the ACM'' (''CACM'') is the monthly journal of the Association for Computing Machinery (ACM). History It was established in 1958, with Saul Rosen as its first managing editor. It is sent to all ACM members. Articles are i ...'' References External links * {{DEFAULTSORT:Journal Of The Acm Academic journals established in 1954 Computer science journals Association for Computing Machinery academic journals Bimonthly journals English-language journals ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
International Symposium On Reliable Distributed Systems
The International Symposium on Reliable Distributed Systems (SRDS) is an academic conference covering distributed systems design and development, particularly with properties such as reliability, availability, safety, security and real time. The symposium is traditionally a single track event held over three days with a number of associated workshops staged a day before the symposium starts. SRDS is sponsored by the IEEE Computer Society Technical Committee on Distributed Processing. SRDS was first organised in 1981; since then, the symposium has been organised in 1982, 1983, 1984, and annually from 1986. See also * The list of distributed computing conferences contains other academic conferences in distributed computing. * The list of computer science conferences contains other academic conferences in computer science. References *Message from the Symposium Chair" SRDS 2006, . SRDS proceedings informationin DBLP. SRDS 1981in DBLP DBLP is a computer science bibliography websit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tribler
Tribler is an open source decentralized BitTorrent client which allows anonymous peer-to-peer by default. Tribler is based on the BitTorrent protocol and uses an overlay network for content searching. Due to this overlay network, Tribler does not require an external website or indexing service to discover content. The user interface of Tribler is very basic and focused on ease of use instead of diversity of features. Tribler is available for Linux, Windows, and OS X. Tribler has run trials for a video streamer known as SwarmPlayer. History The name Tribler stems from the word ''tribe'', referring to the usage of social networks in this P2P client. The first version of Tribler was an enhancement of ''ABC'' aka ''Yet Another BitTorrent Client''. In 2009, the development team behind Tribler stated that their efforts for the coming years were focused on the integration of Tribler with television hardware. In 2014, with the release of version 6.3.1, a custom built-in onion ro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Routing
Routing is the process of selecting a path for traffic in a Network theory, network or between or across multiple networks. Broadly, routing is performed in many types of networks, including circuit-switched networks, such as the public switched telephone network (PSTN), and computer networks, such as the Internet. In packet switching networks, routing is the higher-level decision making that directs network packets from their source toward their destination through intermediate network nodes by specific packet forwarding mechanisms. Packet forwarding is the transit of network packets from one Network interface controller, network interface to another. Intermediate nodes are typically network hardware devices such as Router (computing), routers, gateway (telecommunications), gateways, Firewall (computing), firewalls, or network switch, switches. General-purpose computers also forward packets and perform routing, although they have no specially optimized hardware for the task. T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Expander Graph
In graph theory, an expander graph is a sparse graph that has strong connectivity properties, quantified using vertex, edge or spectral expansion. Expander constructions have spawned research in pure and applied mathematics, with several applications to complexity theory, design of robust computer networks, and the theory of error-correcting codes. Definitions Intuitively, an expander graph is a finite, undirected multigraph in which every subset of the vertices that is not "too large" has a "large" boundary. Different formalisations of these notions give rise to different notions of expanders: ''edge expanders'', ''vertex expanders'', and ''spectral expanders'', as defined below. A disconnected graph is not an expander, since the boundary of a connected component is empty. Every connected finite graph is an expander; however, different connected graphs have different expansion parameters. The complete graph has the best expansion property, but it has largest possible ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
