期刊文献+

应用Paxos算法构建自组织网络 被引量:4

Constructing self-organizing network using Paxos algorithm
下载PDF
导出
摘要 着重阐述如何利用Paxos算法构建多节点自组织网络,提出利用该算法完成实时更新、同步节点全局视图的工作。结合该算法的开源实现开发出功能完善的原型系统,弥补开源实现中部分功能缺失所带来的应用缺陷。通过相关实验测定其具有在秒级时间内完成节点快速加入以及退出的能力。证明其具备在实际应用场景中进行部署的能力,可以满足各种分布式应用程序对底层自组织网络的高可靠性以及高可用性要求。 This paper focuses on how to build multi-node sub-network using the Paxos algorithm. It uses the algorithm to complete real-time updates and synchronization of the node’s status in the global view. And it develops a fully functional prototype system based on the related open source implementation to make up for defects in partial loss of function of the open-source. Through the relevant experiment it is proved the nodes can join and exit in seconds. Besides that it is proved the system can meet a variety of distributed applications on the underlying self-organizing network of high reliability and high availability requirements.
出处 《计算机工程与应用》 CSCD 2014年第6期88-91,204,共5页 Computer Engineering and Applications
关键词 自组织网络 Paxos算法 网络自动重组 self-organizing network Paxos algorithm network automatic reorganizing
  • 相关文献

参考文献9

  • 1黄远强,栾钟治,钱德沛.一种面向大规模P2P环境的成员管理机制[J].计算机研究与发展,2011,48(7):1225-1236. 被引量:1
  • 2Armbrust M, Fox A, Griffith R, et al.Above the clouds: a berkeley view of cloud computing,UCB/EECS-2009-28[R]. EECS Department, University of Califomia, Berkeley, 2009.
  • 3Burrows M.The chubby lock service for loosely-coupled distributed systems[C]//Proceedings of OSDI' 06: Seventh Symposium on Operating System Design and Implemen- tation, Seattle, WA, 2006.
  • 4Lamport L.The part-time parliament, tech rep 49[R].Digital Equipment Corporation Systems Research Center, Palo Alto, Calif, 1989.
  • 5Lamport L.Paxos made simple[J].ACM SIGACT News, 2001,32.18-25.
  • 6Lamport L.Fast Paos[J].Distributed Computing, 2006, 19 (2) .79-103.
  • 7Das A,Gupta I,Motivala A.SWIM: scalable weakly consis- tent infection-style process group membership protocol[C]// Proc of IEEE Int Conf on Dependable Systems and Net- works.Piscataway, NJ IEEE, 2002 : 303-312.
  • 8Stoica I,Morris R,Karger D,et al.Chord:a scalable peer- to-peer lookup service for internet applications[C]//Proc of SIGCOMM.New York:ACM,2001 ; 149-160.
  • 9Ratnasamy S, Francis P, Handley M, et al.A scalable con- tent-addressable network[C]//Proc of the Conf on Applica- tions, Technologies, Architectures, and Protocols for Com- puter Communications.New York: ACM, 2001 : 161-172.

二级参考文献24

  • 1Shavitt Y, Tankel T. Big-Bang simulation for embedding network distances in euclidean space [J]. IEEE/ACM Trans on Network, 2004, 12(6): 993-1006.
  • 2Shen Haiying, l.i Ze, l.i Ting, et al. PIRD: P2P Based intelligent resource discovery in internet-based distributed systems [C] //Proe of the 28th lnt Conf on Distributed Computing Systems. Piscataway, NJ: IEEE, 2008:858-865.
  • 3Kermarrec A M, Pace A, Quema V, et al. NAT-resilient gossip peer sampling [C] //Proc of the 29th Int Conf on Distributed Computing Systems. Piscataway, NJ: IEEE, 2009:360-367.
  • 4Ford B, Srisuresh P, Kegel D. Pecr-to-Peer communication across network address translators [C] //Proc of USENIX Annual Technical Conference. Berkeley, CA: USENIX, 2005:179-192.
  • 5Kazuyuki S, Yoshio T, Satoshi S, Overlay weaver: An overlay construction toolkit [J]. Computer Communiealions, 2008, 31(2): 402-412.
  • 6Alberto M, AnukooI L, Ibrahim M, et al. BR1TE: An approach to universal topology generation [C] //Proc of the Int Workshop on Modeling, Analysis and Simulation of Computer and Telecommunications Systems, Piscalaway, NJ: IEEE, 2001: 346-353.
  • 7Liu Hongzhou, Ramasubramanian V, Gun Sirer E. Client behavior and feed characteristics of RSS, a publish-subscribe system for web micronews [C] //Proe of the 5th ACM SIGCOMM Conf on lnterneI Measurement. Berkeley, CA: USENIX, 2005:29-34.
  • 8Jelasity M, Voulgaris S, Guerraoui R. et al. Gossip-based peer sampling [J]. ACM Trans on Computer Systems, 2007, 25(3): 8-44.
  • 9Kermarrec A M, Massoulie L, Ganesh A J. Probabilistic reliable dissemination in large-scale systems [J]. IEEE Trans ion Parallel and Distributed Systems, 2003, 14(3): 248-258.
  • 10Das A, Gupta I, Motivala A. SWIM: Scalable weakly consistent Infection style process group membership protocot [C] //Proc of IEEE Int Conf on Dependable Systems and Networks. Piscataway, NJ: IEEE, 2002:303-312.

同被引文献36

  • 1Lamport L. Paxos Made Simple[J].ACM SIGACT News 2001.32(4):18-25.
  • 2Jim G,Lamport L. Consensus on Transaction Commit[J] ACM Transactions on Database Systems,2006.1:133-160.
  • 3Robbert van R, Nicolas S, Fred B S. Vive La Difference:Paxos vs. Viewstamped Replication vs. Zab [J]. IEEE Transactions on Dependable and Secure Computing,2015,12(4) :472-484.
  • 4Chester S P,Fitzgerald S P. On soft decision value calculation for linear-dispersion codes with SC-FDMA [J]. IEEE Transactions on Wireless Communications, 2011,10(5) : 1378-1382.
  • 5Sergio F, Filippo F, Francesco P. Consistency checking and querying inprobabilistic databases under in- tegrity constraints [J]. Journal of Computer and Sys- tem Sciences, 2013,80(7) : 1-48.
  • 6Shuhadah W N,Deris M M,Noraziah A,et al. Database consistency using update ordering in distributed database [J]. Journal of Algorithms & Computational Technology, 2007,1 (1) : 17-43.
  • 7周婧,王意洁,李思昆.一种基于数据相关性的优化数据一致性维护方法[J].计算机学报,2008,31(5):741-754. 被引量:5
  • 8郭关飞,周悦芝.用于透明计算的基于块粒度数据一致性方法[J].清华大学学报(自然科学版),2009(10):1721-1724. 被引量:2
  • 9刘仕一,李涛,刘哲哿,李峰.异地备份系统数据一致性检测方法[J].计算机工程与设计,2010,31(17):3766-3768. 被引量:10
  • 10魏民.关于TDCS/CTC系统灾难备份建设方案的研究[J].铁道通信信号,2011,47(1):5-7. 被引量:1

引证文献4

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部