Questions related to Peer-To-Peer Networks
with two of my coauthors, we are preparing a paper on P2P solutions to misuses and abuses of cryptocurrencies. I am wondering if you are aware of any model or paradigm? Best
On August 18, 2022, a blog post by Clarivate indicated that Publons has been fused into Web of Science (WoS): "Publons™ has joined the Web of Science™"
Access to the Publons website now redirects to a WoS page, so that:
Clarivate claims that all information (and supposedly data) has been integrated into WoS, but is that true if the public can no longer access the "publons.com" URL?
I have some questions for debate:
1) Will the Publons URL cease to exist?
2) Will WoS introduce paid services or paid access to access what was previously freely and publicly available information at Publons?
3) How will Clarivate reward reviewers?
4) Will the Publons brand be phased out, including things like the Publons Academy, Publons Peer Reviewer Award, etc?
- Application / Services LayerSide Chain Smart contract Cryptocurrency Digital Copy
- Blockchain Consensus LayerProof of Stake (PoS) Delegated Proof of Stake (DPoS) Proof of Work (PoW)
- Data LayerData Storage Merkle tree Block
- Network LayerCommunication Mechanism Peer-to-Peer (P2P) Network
I am looking for a network simulation tool for large scale structured P2P networks. I need to simulate Chord and Kademlia as a minimum and would like a GUI front end and graphical results output.
Most of the tools that I have found so far are very old, out of date, no longer available, completely undocumented and/or not functional due to version problems with Linux, Windows and Java.
I am currently using a very old version of Oversim / OMNet++
Thanks for any suggestions
Can we prove data analysis
in peer to peer computation system, you can analyze scientific data such as weather prediction using resources such as CPU storage and memory, is there an approach to prove computation power?
I am familiar with a fact that in P2P storage distributed systems reliability is provided with redundancy using erasure code or simple file replication. I am interested if there are some other techniques that I have not heard of. Thank you.
I am really confused now which simulation i can use to analyze.
I have researched for many years on P2P activities on the Internet. Many call this type of acativities Collaborative Economy, Sharing Economy or even Platform economy.
I beleive the P2P platforms show a particular case which is not covered by the reference and so valued theories of asymetric information and adverse choice.
I would like to write about this. Do you know any model which can inspire me for preparing a paper for the good ranked acadmeic journals?
Is that correct?
Could you give a list of pros and cons when compared to a plethora of options?
For instance, IR-UWB is simpler (hardware mainly) than narrowband options, although it works with low data rates.
I know that the market has opted for Bluetooth as a viable business solution. But in the first decade of this century, there was a lot of research on IR-UWB, but then it cooled.
I am trying to finish my project titled "The Improvement of Multi Layer Live Video Streaming in Peer to Peer Networks". unfortunately there is few researches in this area. To do so I need to run a software called: " ??? " to simulate the project outputs. I appreciate any kind of help including introducing resources, instructions, links, websites or cooperation to come up with the problem. any other advise is appreciated. thank you in advance.
Could anyone help me finding related research papers regarding p2p lending industry especially the portal algorithms of different p2p portals such as prosper, lending club, zopa etc...
While number of P2P protocols have been developed in OverSim, is there any support for social overlay networks in same simulator?
I have gone through number of research papers of P2P technology using OverSim but didn't found anything related to social networks using oversim. I was trying to create social graph (normal graph in oversim). To make it a social network, I tried connecting edges by adding social interest. But i'm getting confused about how to apply P2P protocol such as chord (structured P2P) or Gia (unstructured P2P) to the social network created.
The peer-to-peer (P2P) is common architecture to share wide range of media on the Internet. P2P traffic represents about 50% of the total Internet traffic, subject to geographical location. The high volume of P2P traffic is due to file sharing, video streaming, on-line gaming. Dynamic increase in P2P traffic volume often causes poorer network performance and higher congestion rates, triggered by P2P high bandwidth demand.
GBA is the seen to be the most secure architecture to perform authentication in cellular networks. What are the limitations of GBA or are there any know security threats imposed due the use of such an architecture in cellular authentication.
In the real world, how is a node mapped to the position on the ring, I have the following questions -
- Each nodes's IP address is hashed using SHA-1 hashing algorithm which will produce this hash - 184.108.40.206 hashed into 60CBFB98C9052A425D684A2C3D8D8D38424129A3
- This should have been in the range of 0 to (2^m) - 1 where m is the number of bits
- How should I convert this hashed value into a number
- Will the IP address after leaving and re-joining the ring get the same placeholder position?
- Are placeholders or node positions ordered numbers at all?
Dr. Shu-Hsiang "Ava" Chen and I are exploring the perceptions of international students about threaded discussions with peers in online and hybrid courses.
We are currently conducting survey responses (https://goo.gl/forms/KD97ID93LuPHrUjv2), though we are interested in anecdotal or more informal thoughts in this kind of forum in addition to any formal research or literature reviews conducted by others.
Thank you in advance for any formal or informal observations you might share.
How can we differentiate message-oriented protocols and stream-oriented protocols?
Explanation with examples would be highly appreciated.
I have developed a new algorithm for P2P networks routing. And before I assume that it is a good one, I need first to simulate it then compare it to the existing ones.
While I was looking for a simulation tool for my algorithm, I found the Riverbed 17.5 Academic solution.
The problem is, I don't know how to implement the algorithm in Riverbed. I implemented a Peer-to-Peer file sharing application in it, but I am still not able to implement the algorithm.
Any help is welcome,
Kindly guide me about choosing best simulator for dynamic routing in Adhoc networks.
Can we use Opnet simulation for high level work?
Blockchain is the world's leading software platform for digital assets. A blockchain is a distributed database that is used to maintain a continuously growing list of records, called blocks. Each block contains a timestamp and a link to a previous block. A blockchain is typically managed by a peer-to-peer network collectively adhering to a protocol for validating new blocks.
I want to develop an auction based multi-agent communication among multiple processes. I am aware of multi-agent frameworks but my scenario is completely different so i am forced to develop my own. Here, I need your expert Advice. Which language will be best suited for this? Which mechanism do i follow for sending bids from bidder process to auctioneer and vice versa for winner bid? In here, How to enforce synchronization among processes because the whole system is supposed to be synchronized? Thanks in Advance for your Help
I am working on user-oriented, security-based service broker policies for Cloud/Fog computing environment. To let the user decide the required security level for the Datacentre that would be processing his/her request, we need to measure and quantize the security. Security being a multi-dimensional entity, including several aspects like confidentiality, integrity etc., is difficult to measure. I am looking for a tool/simulator that can provide a way for the same.
For example: Given a Datacentre that uses algorithm "A" for encryption, algorithm "B" for integrity check, algorithm "C" for authentication,...and so on. Is there any tool to rate the security strength of this Datacentre?
Hi.I’m planning to investigate the robustness of complex network and read some papers about the subject.Then I find the definition of the robustness have different meanings after the paper, namely,controlliability of complex network published. I’m really looking to know how to define the robustness of complex network when talking about the cascade failure in your subject?
My interest is to develop an efficient mechanism to ensure exactly-once tuple processing guarantee. But to understand the domain well enough, I did not find much related resources over internet.
Please guide me about some resources (article, web links, tutorials etc) to highlight significance and challenges related to Guaranteeing Message Processing for Real time data flows.
Thanks in anticipation
I've noticed a revival in papers that use clustering as part of the network design of a vehciular ad-hoc network. To me it seems intuitively obvious, both from a security and a network management perspective, that performing clustering is an expensive and risky task with unclear gains. I'm wondering whether there is any work that addresses this more general question, rather than trying to show the feasibility of a specific clustering scheme for a specific application. More specifically, I'd like to see some discussion on these questions to either confirm or revise my intuitive standpoint:
- Is real-world traffic really stable enough to have clusters?
- How significant is the overhead needed for cluster management compared to a simple broadcast network?
- Is it really possible to design a clustering scheme that is secure against compromised cluster heads/leaders?
Vickery auctions have a reputation for being a mechanism that is DSIC by ensuring the players are truthful. Are there any other mechanisms (especially in sequential move games with private information) which can ensure DSIC (which can make the players reveal their private information). I'm a bit new to this area. So a good reference would be helpful.
I see that in several documents, a DNS Amplification Attack might result in a UDP Fragmentation Attack. But in the case of an NTP Amplification Attack, I cannot find such a specific mention.
i m making a p2p file transfer in xmlrpc server but it is unable to transfer heavy files for that i think to use simple http server to transfer file but don't know how to use http inside xmlrpc.
We are doing a study about the time spent in the WebRTC signaling process.
If you want to help us, please, visit this web page (It will only take you a minute): http://experiments.p2psp.org/signalingprocess/
Thanks for your time!
This is with regard to peer to peer communication in decentralized network.
I found the notes on this interaction trust value in the Paper named- Self Organizing Trust Model.. written by Ahmet B Can and Bharath Bhargava
More than half of world's population does not have reliable access to the Internet. At the same time, educational resources are more multimedia-based than ever (bandwidth) and often hosted on centralised cloud-based platforms requiring a good Internet connection.
Inability to use online education in underconnected regions is particularly prominent in the case of MOOCs, where some researchers argue it may lead to even further global digital divide.
Are you aware of research or cases of making online educational materials/courses (e.g. MOOCs) available in underconnected areas?
In my PhD I am studying and simulating differente types of incentive mechanisms to assess peers' performance in a P2P community.
I am focusing in the context of decentralized cloud federations and I've already performed some simulations but with hypothetical workloads.
I would like to use workloads from a real case scenario in order to see how would peers perform if they were using my proposed incentive mechanism for cooperation.
Several techniques can be applied in Peer-to-Peer networks to handle the presence of malicious nodes (Reputation Systems, Accountability, Distributed Consensus, etc...).
Which one do you think has the best trade off between the capability to discriminate malicious nodes from honest ones, and the cost of the technique (in term of the number of messages for example). Obviously, knowing that none of the previous systems can fully decide (with a 100% accuracy) whether a node is malicious or not .
The standard of IEEE 1588-2008 introduced P2P (peer to peer) mechanism to measure communication delay,what is the advance compared to request response mechanism in IEEE 1588-2002.
Please I need a help in emergency,
I would like to ask if anyone has a benchmark, or workload data on Grid/Cloud or Peer to peer systems, or any client/server applications, to provide me with these data and to allow me to use them for academic purposes, to make some experiments on these data.
Any help will be acknowledged, or even best, if some one is interesting by sharing the data in a collaboration form...
I will be very very grateful..
In layman terms what is the difference? How is decentralised (as with Grokster ?) more advantageous than centralised (Napster) in relation to file sharing. I understand to an extent that the central index server plays a key part of this answer.
There is some initial evidence from Millennials in the U.S. but would be interesting to know whether this is a trend that is structural in nature instead of a passing fad.
The initial evidence is the preference for sharing rather than owning, renting rather than buying etc.
The economic consequences of such a structural shift? For instance ownership tends to lead to commitment and therefore savings and investment. The abandonment of ownership for accessibility may change the preference structure as indicated by indifference maps?
Is there any available works on cloud resource discovery that use an hybrid architecture, specially master-slave or super-peer architectures?
I mean, is this a feasible idea since the network performance and resource
availability can be the tightest bottleneck for any cloud.
In fact I need some references on this subject.
I want to simulate Peer to Peer Network architecture (Node >500) in Qualnet Simulator. I did the simulation but now I have to analysis the result. So anyone can suggest what parameter should I consider for better results? Thanks in advance.
Peer-to-peer systems often adopt decentralized organization, and each client serves as a server as well. Can we say all nodes play equal roles from a system that is decentralized? Or can we say a system is decentralized if all nodes work as a server?
Please explain the differences and give me some examples. It would be better if the example is a system in the real world.
Wikipedia, formally launched on January 15, 2001, is a collaboratively edited, multilingual, free Internet encyclopedia that contains over 30 million articles written in 287 languages written by volunteers around the world.
Given its wealth of information, has Wikipedia become an acceptable source of information to be used in Research & Development?
A botnet is a collection of Internet-connected programs communicating with other similar programs in order to perform tasks. This can be as mundane as keeping control of an Internet Relay Chat (IRC) channel, or it could be used to send spam email or participate in distributed denial-of-service attacks. The word botnet is a portmanteau of robot and network.
some peer to peer networks/protocols such as Tor, Torrent address application of anonymity and storage in an infrastructureless and distributed framework. However I wonder if such a P2P network/protocol is available for distributed cloud computing such that people share their computer processing power ( CPU and/or GPU) to let other people enjoy parallel and distributed processing?
I want to implement network coding for p2p network but facing problem in interfacing of opnet with matlab. Is there any solution? Can I implement network coding through opnet without any interfacing with matlab? Is it possible with omnet++ also?
Wikipedia article about Peer-to-Peer computing says - "Peer-to-peer (P2P) computing or networking is a distributed application architecture that partitions tasks or work loads between peers. Peers are equally privileged, equipotent participants in the application. They are said to form a peer-to-peer network of nodes."
While Wikipedia article for Multi-agent systems says- "A multi-agent system (M.A.S.) is a computerized system composed of multiple interacting intelligent agents within an environment. Multi-agent systems can be used to solve problems that are difficult or impossible for an individual agent or a monolithic system to solve. Intelligence may include some methodic, functional, procedural or algorithmic search, find and processing approach."
Although having difference in definition, both architectures involve cooperation between distributed entities.
How does one define the suitability of having a P2P system based architecture or a MAS architecture for a research problem?
At this time, Peer-to-Peer has always be considered as a synonym of piracy by the industry. Do you think this can change in a near future?