Consider these links:
PPCoin Proof of Stake:
https://bt.irlbtc.com/view/101820.0Qubic IP related proof of stake:
https://bt.irlbtc.com/view/112676.0Network effect in cloud computing observations:
http://thenetworkeffect.blogspot.com.es/2008/09/10-laws-of-cloudonomics.htmlBanking and superconnected companies study:
http://arxiv.org/PS_cache/arxiv/pdf/1107/1107.5728v2.pdfThe network that runs the world:
http://www.newscientist.com/article/mg21228354.500-revealed--the-capitalist-network-that-runs-the-world.html#bx283545B1Elliot waves, Fibonnaci numbers, stock exchange maths (got anymore links?):
http://www.goldennumber.net/fibonacci-stock-market-analysis/Markets are networks just like Bitcoin. Bitcoin may fix the inflation problem but it doesn't address the network effect.
- This is why we have MtGox so big
- this is why we have a number of dominant mining pools
but also
- this is why we have such swings in the stock market
- could this be the main cause of equality in the world?
At a minimum this undermines Bitcoin which is supposed to be decentralised. At a maximum it means we will always see these swings in markets that destroy people's lives, make the rich richer and the poor poorer.
One way to address it is to allow people to trade easily. Traders analyse the market and make a profit out of the network effect, usually in 2D as chartists. This only seems to smooth out the market bumps a little bit.
I can find no information on more complex analysis applied to a network or at least just more than one stock - can you help?I think this will always be a problem unless something is done at network level and finally we have a chance with cryptocurrencies.
I can't think of anything more pressing.
To address this I think you need to change the proof of work to working out this network effect combined with the QubicCoin identity by IP method. It sounds complicated but I my gut feeling is that to the right person an elegant solution is entirely possible to design. That right person with the background knowledge of this might be working as a programmer in investment banking, working for a hedge fund or just themselves day trading a profit.
Can you help me find any information related to this?
We are not punishing wealthy people here. We are not intending to punish big nodes per-sec. We are looking to cancel out this network effect where big nodes attract more and more traffic.
p2p load balancing?
http://www.scientific.net/AMM.220-223.2578.pdfp2p bottleneck mitogation:
http://ojs.academypublisher.com/index.php/jait/article/view/4153Irregular load balancing:
What search terms should I be using?
"network topology balancing"?
ABSTRACT In this paper we introduce a two-phase dynamic load-balancing technique for P2P computing systems. The first phase consists of mapping a P2P network onto a hierarchical topology based on 1-D space tessellations. This hierarchy is called TreeP (tree based P2P architecture). The second phase consists of balancing the load among the peers using the PSLB (positional scan load-balancing) technique, which is well suited for regular topologies. We study this technique and optimize its implementation on the TreeP topology. This technique is simple, efficient, scalable, and does not introduce a considerable overhead as shown in the experimental results and theoretical study
Paywall here -
http://www.researchgate.net/publication/224674655_On_the_Efficiency_of_Dynamic_Load_Balancing_on_P2P_Irregular_Network_TopologiesAnother paywall:
ABSTRACT
One of the challenges of P2P systems is to perform load balancing efficiently. A distributed hash table (DHT) abstraction, heterogeneous nodes, and non uniform distribution of objects cause load imbalance in structured P2P overlay networks. Several solutions are suggested to solve this problem but they have some restrictions. They assume the homogeneous capabilities of nodes, unawareness of the link latency during transferring load and imposing logical structures to collect and reassign load. This paper presents a distributed load balancing algorithm with topology awareness using the concept of virtual servers. In our proposed approach, each node collects neighborhood load information from physically close nodes and reassigns virtual servers to overlay nodes according to topology of underlying network. Consequently, it provides rapid convergence on load balance and reduces the load transfer cost. Moreover, our parametric algorithm increases the quality of load balancing among close nodes of overlay and also provides a new tradeoff between the quality of load balancing and load transfer cost among all overlay nodes. Our simulations show that our approach reduces the load transfer cost and saves a great network bandwidth.
^
http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5356795&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D5356795Topology-aware routing in structured peer-to-peer overlay
networks:
https://docs.google.com/viewer?a=v&q=cache:mdDBm9qJTN0J:www.mpi-sws.org/~druschel/publications/Pastry-locality.pdf+&hl=en&gl=uk&pid=bl&srcid=ADGEESgCFxw_yaFmRRDaDjW0A-8NklAdbUrLzJF-lvoRqNY6ctC9keugcqVuSlyIojpsalvOHn9q2x3MgUNDU2MdfcXcYvz7Zo6YFdSawml0nDzeRR9s8jBZFegQeY_fVuIZIh-Iidht&sig=AHIEtbRlVPaDOPdXprtR8ba9SmRu72CmCw