Peer-to-peer

View this topic in
Peer-to-peer (P2P) computing or networking is a distributed application architecture that partitions tasks or workloads between peers. (Wikipedia.org)






Conferences related to Peer-to-peer

Back to Top

ICASSP 2017 - 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

The ICASSP meeting is the world's largest and most comprehensive technical conference focused on signal processing and its applications. The conference will feature world-class speakers, tutorials, exhibits, and over 50 lecture and poster sessions.


2016 IEEE International Conference on Image Processing (ICIP)

Signal processing, image processing, biomedical imaging, multimedia, video, multidemensional.


ICC 2015 - 2015 IEEE International Conference on Communications

IEEE ICC is one of the two flagship IEEE conferences in the field of communications; London is to host this conference in 2015. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicise themselves and their products among the leaders of communications industries from all over the world.

  • ICC 2014 - 2014 IEEE International Conference on Communications

    The International Conference on Communications (ICC) is one of the two flagship conferences of the IEEE Communications Society, together with IEEE Globecom. Each year the ICC conference attracts about 2-3.000 submitted scientific papers, a technical program committee involving about 1.500 experts provides more than 10.000 reviews, the conference being finally attended by 1.500 - 2.000 professionals from all around the world. IEEE ICC is therefore one of the most significant scientific events of the networking and communications community, a must-attend forum for both industrials and academics working in this area.

  • ICC 2013 - 2013 IEEE International Conference on Communications

    A full programs of technical and professional activities spanning the entire range of hot topics in voice, data, image, quality of service, home networking, signal processing, wireless, optical, and multimedia communications

  • ICC 2012 - 2012 IEEE International Conference on Communications

    Full programs of technical and professional activities spanning the entire range of hot topics in voice, data, image, quality of service, home networking, signal processing, wireless, optical, and multimedia communications

  • ICC 2011 - 2011 IEEE International Conference on Communications

    A full programs of technical and professional activities spanning the entire range of hot topics in voice, data, image, quality of service, home networking, signal processing, wireless, optical, and multimedia communications.

  • ICC 2010 - 2010 IEEE International Conference on Communications

    Telecommunications


2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)

IEEE Consumer Communications and Networking Conference, sponsored by IEEE Communications Society, is a major annual international conference organized with the objective of bringing together researchers, developers, and practitioners from academia and industry working in all areas of consumer communications and networking.


2014 IEEE Information Theory Workshop (ITW)

ITW2014 is a forum for technical exchange among scientists and engineers working on the fundamentals of information theory. The agenda is broad and will cover the diverse topics that information theory presently impacts. There will be both invited and contributed sessions.

  • 2012 IEEE Information Theory Workshop (ITW 2012)

    The past decade has seen an exponential increase in the data stored in distributed locations in various forms including corporate & personal data, multimedia, and medical data in repositories. The grand challenge is to store, process and transfer this massive amount of data, efficiently and securely over heterogeneous communication networks.

  • 2010 IEEE Information Theory Workshop (ITW 2010)

    Algebraic Methods in Communications Technology

  • 2009 IEEE Information Theory Workshop (ITW 2009)

    Covers the most relevant topics in Information Theory and Coding Theory of interest to the most recent applications to wireless networks, sensor networks, and biology

  • 2008 IEEE Information Theory Workshop (ITW 2008)

    This workshop will take a brief look into the recent information theory past to commemorate the 60th anniversary of Shannon's landmark paper, and then proceed to explore opportunities for information theory research in quantum computation, biology, statistics, and computer science.

  • 2006 IEEE Information Theory Workshop (ITW 2006)


More Conferences

Periodicals related to Peer-to-peer

Back to Top

Broadcasting, IEEE Transactions on

Broadcast technology, including devices, equipment, techniques, and systems related to broadcast technology, including the production, distribution, transmission, and propagation aspects.


Internet Computing, IEEE

IEEE Internet Computing provides journal-quality evaluation and review of emerging and maturing Internet technologies and applications. The magazine targets the technical and scientific Internet user communities as well as designers and developers of Internet-based applications and enabling technologies. IC publishes refereed articles on the latest developments and key trends in Internet technologies and applications. A crossroads between academic researchers and ...


Knowledge and Data Engineering, IEEE Transactions on

Artificial intelligence techniques, including speech, voice, graphics, images, and documents; knowledge and data engineering tools and techniques; parallel and distributed processing; real-time distributed processing; system architectures, integration, and modeling; database design, modeling, and management; query design, and implementation languages; distributed database control; statistical databases; algorithms for data and knowledge management; performance evaluation of algorithms and systems; data communications aspects; system ...


Parallel and Distributed Systems, IEEE Transactions on

IEEE Transactions on Parallel and Distributed Systems (TPDS) is published monthly. Topic areas include, but are not limited to the following: a) architectures: design, analysis, and implementation of multiple-processor systems (including multi-processors, multicomputers, and networks); impact of VLSI on system design; interprocessor communications; b) software: parallel languages and compilers; scheduling and task partitioning; databases, operating systems, and programming environments for ...


Software, IEEE

IEEE Software's mission is to build the community of leading and future software practitioners. The magazine delivers reliable, useful, leading-edge software development information to keep engineers and managers abreast of rapid technology change. The authority on translating software theory into practice, IEEE Software is positioned between pure research and pure practice, transferring ideas, methods, and experiences among researchers and engineers. ...


More Periodicals


Xplore Articles related to Peer-to-peer

Back to Top

Towards a trust management for VANETs

Yeongkwun Kim; Injoo Kim; Charlie Y. Shim The International Conference on Information Networking 2014 (ICOIN2014), 2014

Information transmitted over a vehicular network may be sensitive and affect important safety decisions. Exchanging information must be based on trust; however, an issue that arises is the degree to which drivers can trust the received information from other (previously unknown) drivers. Thus, trust management is a fundamental and critical issue in vehicular ad-hoc networks (VANETs). However, studies and research ...


An Age-Based Membership Protocol against Strong Churn in Unstructured P2P Networks

Haowen Liu; Xiwen Liu; Wei Song; Weidong Wen 2011 International Conference on Network Computing and Information Security, 2011

Churn refers the continuous process of node arrival and departure in distributed peer-to-peer network. Enormous nodes joining the system concurrently will results in a flash crowd scenario for special nodes in the system, and enormous nodes crashing in a moment might come out a broken network. In fact, the joining and crashing always occur around some nodes at the same ...


A New Land Mark Node Technology Based Load Balancing Method for Constructing Future Carrier-Class P2P Network

Heng Zhang; Sicong Kuang 2011 International Conference on Network Computing and Information Security, 2011

In P2P network, present load balancing algorithms are network locality insensitive. Load transfer between nodes may be done between two or more long- distance nodes. This will delay transfer time, waste some bandwidth resource, result in node failure and network bottleneck. This paper aims to build a controllable, operable P2P network and furthermore benefit the future mobile Internet. This paper ...


Coverage Algorithm Based on Sensor Residual Energy for Sensor Network

Weifeng Yang; Xiao Liu; Jin Zhang 2010 IEEE Asia-Pacific Services Computing Conference, 2010

Aiming at the coverage problem, a new coverage algorithm is proposed based on residual energy of sensors in this paper. In the algorithm, it is unnecessary for sensors to know its geographic information. By exchanging some related information with its neighbors, sensors judge its suitable status (active or sleep) according to energy. The algorithm can save sensor energy and extend ...


Trace Driven Simulation Model for City Scale Crowd Movements

Tobias Franke; Andreas Poxrucker; Gernot Bahle; Paul Lukowicz 2016 IEEE 18th International Conference on High Performance Computing and Communications; IEEE 14th International Conference on Smart City; IEEE 2nd International Conference on Data Science and Systems (HPCC/SmartCity/DSS), 2016

We present a city-scale crowd simulation model based on a large data set (25 million GPS data points from 28'000 volunteers recorded during a 3-day city- wide festival held in Zurich in 2013). The model is based on a spatio-temporal abstraction of the festival, focusing on event sites and event times. Thus, we assume a certain number of events (concerts, ...


More Xplore Articles

Educational Resources on Peer-to-peer

Back to Top

eLearning

Towards a trust management for VANETs

Yeongkwun Kim; Injoo Kim; Charlie Y. Shim The International Conference on Information Networking 2014 (ICOIN2014), 2014

Information transmitted over a vehicular network may be sensitive and affect important safety decisions. Exchanging information must be based on trust; however, an issue that arises is the degree to which drivers can trust the received information from other (previously unknown) drivers. Thus, trust management is a fundamental and critical issue in vehicular ad-hoc networks (VANETs). However, studies and research ...


An Age-Based Membership Protocol against Strong Churn in Unstructured P2P Networks

Haowen Liu; Xiwen Liu; Wei Song; Weidong Wen 2011 International Conference on Network Computing and Information Security, 2011

Churn refers the continuous process of node arrival and departure in distributed peer-to-peer network. Enormous nodes joining the system concurrently will results in a flash crowd scenario for special nodes in the system, and enormous nodes crashing in a moment might come out a broken network. In fact, the joining and crashing always occur around some nodes at the same ...


A New Land Mark Node Technology Based Load Balancing Method for Constructing Future Carrier-Class P2P Network

Heng Zhang; Sicong Kuang 2011 International Conference on Network Computing and Information Security, 2011

In P2P network, present load balancing algorithms are network locality insensitive. Load transfer between nodes may be done between two or more long- distance nodes. This will delay transfer time, waste some bandwidth resource, result in node failure and network bottleneck. This paper aims to build a controllable, operable P2P network and furthermore benefit the future mobile Internet. This paper ...


Coverage Algorithm Based on Sensor Residual Energy for Sensor Network

Weifeng Yang; Xiao Liu; Jin Zhang 2010 IEEE Asia-Pacific Services Computing Conference, 2010

Aiming at the coverage problem, a new coverage algorithm is proposed based on residual energy of sensors in this paper. In the algorithm, it is unnecessary for sensors to know its geographic information. By exchanging some related information with its neighbors, sensors judge its suitable status (active or sleep) according to energy. The algorithm can save sensor energy and extend ...


Trace Driven Simulation Model for City Scale Crowd Movements

Tobias Franke; Andreas Poxrucker; Gernot Bahle; Paul Lukowicz 2016 IEEE 18th International Conference on High Performance Computing and Communications; IEEE 14th International Conference on Smart City; IEEE 2nd International Conference on Data Science and Systems (HPCC/SmartCity/DSS), 2016

We present a city-scale crowd simulation model based on a large data set (25 million GPS data points from 28'000 volunteers recorded during a 3-day city- wide festival held in Zurich in 2013). The model is based on a spatio-temporal abstraction of the festival, focusing on event sites and event times. Thus, we assume a certain number of events (concerts, ...


More eLearning Resources

IEEE-USA E-Books

  • No title

    This book results from many years of teaching an upper division course on communication networks in the EECS department at University of California, Berkeley. It is motivated by the perceived need for an easily accessible textbook that puts emphasis on the core concepts behind current and next generation networks. After an overview of how today's Internet works and a discussion of the main principles behind its architecture, we discuss the key ideas behind Ethernet, WiFi networks, routing, internetworking and TCP. To make the book as self contained as possible, brief discussions of probability and Markov chain concepts are included in the appendices. This is followed by a brief discussion of mathematical models that provide insight into the operations of network protocols. Next, the main ideas behind the new generation of wireless networks based on WiMAX and LTE, and the notion of QoS are presented. A concise discussion of the physical layer technologies underlying various networks i also included. Finally, a sampling of topics is presented that may have significant influence on the future evolution of networks including overlay networks like content delivery and peer-to-peer networks, sensor networks, distributed algorithms, Byzantine agreement and source compression. Table of Contents: The Internet / Principles / Ethernet / WiFi / Routing / Internetworking / Transport / Models / WiMAX & LTE / QOS / Physical Layer / Additional Topics

  • Introduction

    Sharing isn't new. Giving someone a ride, having a guest in your spare room, running errands for someone, participating in a supper club -- these are not revolutionary concepts. What is new, in the "sharing economy," is that you are not helping a friend for free; you are providing these services to a stranger for money. In this book, Arun Sundararajan, an expert on the sharing economy, explains the transition to what he describes as "crowd-based capitalism" -- a new way of organizing economic activity that may supplant the traditional corporate-centered model. As peer-to-peer commercial exchange blurs the lines between the personal and the professional, how will the economy, government regulation, what it means to have a job, and our social fabric be affected? Drawing on extensive research and numerous real-world examples -- including Airbnb, Lyft, Uber, Etsy, TaskRabbit, France's BlaBlaCar, China's Didi Kuaidi, and India's Ola, Sundararajan explains the basics of crowd-b sed capitalism. He describes the intriguing mix of "gift" and "market" in its transactions, demystifies emerging blockchain technologies, and clarifies the dizzying array of emerging on-demand platforms. He considers how this new paradigm changes economic growth and the future of work. Will we live in a world of empowered entrepreneurs who enjoy professional flexibility and independence? Or will we become disenfranchised digital laborers scurrying between platforms in search of the next wedge of piecework? Sundararajan highlights the important policy choices and suggests possible new directions for self-regulatory organizations, labor law, and funding our social safety net.

  • New DDBE Architectures

    This chapter contains sections titled: Cooperative DBEs Peer-to-Peer DDBEs Comparing COOP and P2P Summary Glossary References Exercises

  • No title

    This book concerns peer-to-peer applications and mechanisms operating on the Internet, particularly those that are not fully automated and involve significant human interaction. So, the realm of interest is the intersection of distributed systems and online social networking. Generally, simple models are described to clarify the ideas. Beginning with short overviews of caching, graph theory and game theory, we cover the basic ideas of structured and unstructured search. We then describe a simple framework for reputations and for iterated referrals and consensus. This framework is applied to a problem of sybil identity management. The fundamental result for iterated Byzantine consensus for a relatively important issue is also given. Finally, a straight- forward epidemic model is used to describe the propagation of malware on-line and for BitTorrent-style file-sharing. This short book can be used as a preliminary orientation to this subject matter. References are given for the interested student to papers with good survey and tutorial content and to those with more advanced treatments of specific topics. For an instructor, this book is suitable for a one-semester seminar course. Alternatively, it could be the framework for a semester's worth of lectures where the instructor would supplement each chapter with additional lectures on related or more advanced subject matter. A basic background is required in the areas of computer networking, probability theory, stochastic processes, and queueing. Table of Contents: Networking overview / Graphs / Games / Search in structured networks / Search in unstructured networks / Transactions, reputations, and referrals / False Referrals / Peer-to-peer file sharing / Consensus in dynamical belief systems / Byzantine consensus / Epidemics

  • No title

    Cooperative network supercomputing is becoming increasingly popular for harnessing the power of the global Internet computing platform. A typical Internet supercomputer consists of a master computer or server and a large number of computers called workers, performing computation on behalf of the master. Despite the simplicity and benefits of a single master approach, as the scale of such computing environments grows, it becomes unrealistic to assume the existence of the infallible master that is able to coordinate the activities of multitudes of workers. Large-scale distributed systems are inherently dynamic and are subject to perturbations, such as failures of computers and network links, thus it is also necessary to consider fully distributed peer-to-peer solutions. We present a study of cooperative computing with the focus on modeling distributed computing settings, algorithmic techniques enabling one to combine efficiency and fault-tolerance in distributed systems, and the exposit on of trade-offs between efficiency and fault-tolerance for robust cooperative computing. The focus of the exposition is on the abstract problem, called Do-All, and formulated in terms of a system of cooperating processors that together need to perform a collection of tasks in the presence of adversity. Our presentation deals with models, algorithmic techniques, and analysis. Our goal is to present the most interesting approaches to algorithm design and analysis leading to many fundamental results in cooperative distributed computing. The algorithms selected for inclusion are among the most efficient that additionally serve as good pedagogical examples. Each chapter concludes with exercises and bibliographic notes that include a wealth of references to related work and relevant advanced results. Table of Contents: Introduction / Distributed Cooperation and Adversity / Paradigms and Techniques / Shared-Memory Algorithms / Message-Passing Algorithms / The Do-All Problem in Other Setting / Bibliography / Authors' Biographies

  • Cause

    Sharing isn't new. Giving someone a ride, having a guest in your spare room, running errands for someone, participating in a supper club -- these are not revolutionary concepts. What is new, in the "sharing economy," is that you are not helping a friend for free; you are providing these services to a stranger for money. In this book, Arun Sundararajan, an expert on the sharing economy, explains the transition to what he describes as "crowd-based capitalism" -- a new way of organizing economic activity that may supplant the traditional corporate-centered model. As peer-to-peer commercial exchange blurs the lines between the personal and the professional, how will the economy, government regulation, what it means to have a job, and our social fabric be affected? Drawing on extensive research and numerous real-world examples -- including Airbnb, Lyft, Uber, Etsy, TaskRabbit, France's BlaBlaCar, China's Didi Kuaidi, and India's Ola, Sundararajan explains the basics of crowd-b sed capitalism. He describes the intriguing mix of "gift" and "market" in its transactions, demystifies emerging blockchain technologies, and clarifies the dizzying array of emerging on-demand platforms. He considers how this new paradigm changes economic growth and the future of work. Will we live in a world of empowered entrepreneurs who enjoy professional flexibility and independence? Or will we become disenfranchised digital laborers scurrying between platforms in search of the next wedge of piecework? Sundararajan highlights the important policy choices and suggests possible new directions for self-regulatory organizations, labor law, and funding our social safety net.

  • Concluding Thoughts

    Sharing isn't new. Giving someone a ride, having a guest in your spare room, running errands for someone, participating in a supper club -- these are not revolutionary concepts. What is new, in the "sharing economy," is that you are not helping a friend for free; you are providing these services to a stranger for money. In this book, Arun Sundararajan, an expert on the sharing economy, explains the transition to what he describes as "crowd-based capitalism" -- a new way of organizing economic activity that may supplant the traditional corporate-centered model. As peer-to-peer commercial exchange blurs the lines between the personal and the professional, how will the economy, government regulation, what it means to have a job, and our social fabric be affected? Drawing on extensive research and numerous real-world examples -- including Airbnb, Lyft, Uber, Etsy, TaskRabbit, France's BlaBlaCar, China's Didi Kuaidi, and India's Ola, Sundararajan explains the basics of crowd-b sed capitalism. He describes the intriguing mix of "gift" and "market" in its transactions, demystifies emerging blockchain technologies, and clarifies the dizzying array of emerging on-demand platforms. He considers how this new paradigm changes economic growth and the future of work. Will we live in a world of empowered entrepreneurs who enjoy professional flexibility and independence? Or will we become disenfranchised digital laborers scurrying between platforms in search of the next wedge of piecework? Sundararajan highlights the important policy choices and suggests possible new directions for self-regulatory organizations, labor law, and funding our social safety net.

  • No title

    Managing data in a mobile computing environment invariably involves caching or replication. In many cases, a mobile device has access only to data that is stored locally, and much of that data arrives via replication from other devices, PCs, and services. Given portable devices with limited resources, weak or intermittent connectivity, and security vulnerabilities, data replication serves to increase availability, reduce communication costs, foster sharing, and enhance survivability of critical information. Mobile systems have employed a variety of distributed architectures from client- server caching to peer-to-peer replication. Such systems generally provide weak consistency models in which read and update operations can be performed at any replica without coordination with other devices. The design of a replication protocol then centers on issues of how to record, propagate, order, and filter updates. Some protocols utilize operation logs, whereas others replicate state. Sys ems might provide best-effort delivery, using gossip protocols or multicast, or guarantee eventual consistency for arbitrary communication patterns, using recently developed pairwise, knowledge-driven protocols. Additionally, systems must detect and resolve the conflicts that arise from concurrent updates using techniques ranging from version vectors to read-write dependency checks. This lecture explores the choices faced in designing a replication protocol, with particular emphasis on meeting the needs of mobile applications. It presents the inherent trade-offs and implicit assumptions in alternative designs. The discussion is grounded by including case studies of research and commercial systems including Coda, Ficus, Bayou, Sybase's iAnywhere, and Microsoft's Sync Framework. Table of Contents: Introduction / System Models / Data Consistency / Replicated Data Protocols / Partial Replication / Conflict Management / Case Studies / Conclusions / Bibliography

  • No title

    The application of mathematical analysis to wireless networks has met with limited success, due to the complexity of mobility and traffic models, coupled with the dynamic topology and the unpredictability of link quality that characterize such networks. The ability to model individual, independent decision makers whose actions potentially affect all other decision makers makes game theory particularly attractive to analyze the performance of ad hoc networks. Game theory is a field of applied mathematics that describes and analyzes interactive decision situations. It consists of a set of analytical tools that predict the outcome of complex interactions among rational entities, where rationality demands a strict adherence to a strategy based on perceived or measured results. In the early to mid-1990's, game theory was applied to networking problems including flow control, congestion control, routing and pricing of Internet services. More recently, there has been growing interest in ado ting game-theoretic methods to model today's leading communications and networking issues, including power control and resource sharing in wireless and peer-to-peer networks. This work presents fundamental results in game theory and their application to wireless communications and networking. We discuss normal-form, repeated, and Markov games with examples selected from the literature. We also describe ways in which learning can be modeled in game theory, with direct applications to the emerging field of cognitive radio. Finally, we discuss challenges and limitations in the application of game theory to the analysis of wireless systems. We do not assume familiarity with game theory. We introduce major game theoretic models and discuss applications of game theory including medium access, routing, energy-efficient protocols, and others. We seek to provide the reader with a foundational understanding of the current research on game theory applied to wireless communications and networkin .

  • The Space of Flows, Timeless Time, and Mobile Networks

    Wireless networks are the fastest growing communications technology in history. Are mobile phones expressions of identity, fashionable gadgets, tools for life--or all of the above? Mobile Communication and Society looks at how the possibility of multimodal communication from anywhere to anywhere at any time affects everyday life at home, at work, and at school, and raises broader concerns about politics and culture both global and local.Drawing on data gathered from around the world, the authors explore who has access to wireless technology, and why, and analyze the patterns of social differentiation seen in unequal access. They explore the social effects of wireless communication-- what it means for family life, for example, when everyone is constantly in touch, or for the idea of an office when workers can work anywhere. Is the technological ability to multitask further compressing time in our already hurried existence?The authors consider the rise of a mobile youth culture based on peer-to-peer networks, with its own language of texting, and its own values. They examine the phenomenon of flash mobs, and the possible political implications. And they look at the relationship between communication and development and the possibility that developing countries could "leapfrog" directly to wireless and satellite technology. This sweeping book--moving easily in its analysis from the United States to China, from Europe to Latin America and Africa--answers the key questions about our transformation into a mobile network society.



Standards related to Peer-to-peer

Back to Top

IEEE Standard for a High Performance Serial Bus Peer-to-Peer Data Transport Protocol (PPDT)

This is a full-use standard whose scope is the definition of a peer-to-peer data transport protocol between Serial Bus devices that implement ANSI NCITS 325-1998, Serial Bus Protocol 2. The facilities specified include, but are not limited to device and service discovery, self-configurable (plug and play) binding of software device drivers to PPDT devices and service connection management.



Jobs related to Peer-to-peer

Back to Top