Routing Cryptocurrency with the Spider Network
暂无分享,去创建一个
Pramod Viswanath | Mohammad Alizadeh | Giulia C. Fanti | Shaileshh Bojja Venkatakrishnan | Vibhaalakshmi Sivaraman | G. Fanti | P. Viswanath | M. Alizadeh | S. Venkatakrishnan | Vibhaalakshmi Sivaraman | Mohammad Alizadeh
[1] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[2] J. Y. Yen. Finding the K Shortest Loopless Paths in a Network , 1971 .
[3] P. F. Tsuchiya. The landmark hierarchy: a new hierarchy for routing in very large networks , 1988, SIGCOMM.
[4] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[5] Larry Peterson,et al. TCP Vegas: new techniques for congestion detection and avoidance , 1994, SIGCOMM 1994.
[6] V. Jacobson. Congestion avoidance and control , 1988, CCRV.
[7] Herbert S. Wilf,et al. Algorithms and Complexity , 1994, Lecture Notes in Computer Science.
[8] Frank Kelly,et al. Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..
[9] Paul F. Syverson,et al. Onion routing , 1999, CACM.
[10] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[11] Tim Roughgarden,et al. How bad is selfish routing? , 2002, JACM.
[12] Harald Räcke,et al. Minimizing Congestion in General Networks , 2002, FOCS.
[13] Rayadurgam Srikant,et al. The Mathematics of Internet Congestion Control , 2003 .
[14] Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM.
[15] Thomas Voice,et al. Stability of end-to-end algorithms for joint routing and rate control , 2005, CCRV.
[16] Srikanth Kandula,et al. Walking the tightrope: responsive yet stable traffic engineering , 2005, SIGCOMM '05.
[17] R. Srikant,et al. Joint congestion control, routing, and MAC for stability and fairness in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.
[18] Daniel Pérez Palomar,et al. A tutorial on decomposition methods for network utility maximization , 2006, IEEE Journal on Selected Areas in Communications.
[19] Injong Rhee,et al. CUBIC: a new TCP-friendly high-speed TCP variant , 2008, OPSR.
[20] Jiang Zhu,et al. Making Large Scale Deployment of RCP Practical for Real Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.
[21] Mark Handley,et al. The resource pooling principle , 2008, CCRV.
[22] Asuman E. Ozdaglar,et al. Subgradient methods in network resource allocation: Rate analysis , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.
[23] Vinton G. Cerf,et al. A brief history of the internet , 1999, CCRV.
[24] Shamik Sural,et al. Credit card fraud detection: A fusion approach using Dempster-Shafer theory and Bayesian learning , 2009, Inf. Fusion.
[25] Albert G. Greenberg,et al. Data center TCP (DCTCP) , 2010, SIGCOMM '10.
[26] Mark Handley,et al. Design, Implementation and Evaluation of Congestion Control for Multipath TCP , 2011, NSDI.
[27] Brighten Godfrey,et al. Finishing flows quickly with preemptive scheduling , 2012, CCRV.
[28] T. N. Vijaykumar,et al. Deadline-aware datacenter tcp (D2TCP) , 2012, CCRV.
[29] Nick McKeown,et al. pFabric: minimal near-optimal datacenter transport , 2013, SIGCOMM.
[30] Pili Hu,et al. A Survey and Taxonomy of Graph Sampling , 2013, ArXiv.
[31] Carlos Riquelme,et al. Pricing in Ride-Sharing Platforms: A Queueing-Theoretic Approach , 2015, EC.
[32] Pedro Moreno-Sanchez,et al. Privacy Preserving Payments in Credit Networks: Enabling trust with privacy in online marketplaces , 2015, NDSS.
[33] Pavel Prihodko,et al. Flare : An Approach to Routing in Lightning Network White Paper , 2016 .
[34] Stefanie Roos,et al. Anonymous addresses for efficient and resilient routing in F2F overlays , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.
[35] Giulio Malavolta,et al. SilentWhispers: Enforcing Security and Privacy in Decentralized Credit Networks , 2017, NDSS.
[36] Carlos Riquelme,et al. Dynamic pricing in ridesharing platforms , 2016, SECO.
[37] Christopher Neal Cordi. Simulating high-throughput cryptocurrency payment channel networks , 2017 .
[38] Rami Khalil,et al. Revive: Rebalancing Off-Blockchain Payment Networks , 2017, IACR Cryptol. ePrint Arch..
[39] Silvio Micali,et al. Algorand: Scaling Byzantine Agreements for Cryptocurrencies , 2017, IACR Cryptol. ePrint Arch..
[40] Asuman E. Ozdaglar,et al. On the Convergence Rate of Incremental Aggregated Gradient Algorithms , 2015, SIAM J. Optim..
[41] Conrad Burchert,et al. Scalable funding of Bitcoin micropayment channel networks , 2017, Royal Society Open Science.
[42] Ian Goldberg,et al. Settling Payments Fast and Private: Efficient Decentralized Routing for Path-Based Transactions , 2017, NDSS.
[43] Sreeram Kannan,et al. Deconstructing the Blockchain to Approach Physical Limits , 2018, IACR Cryptol. ePrint Arch..
[44] Philipp Jovanovic,et al. OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding , 2018, 2018 IEEE Symposium on Security and Privacy (SP).