期刊文献+

不完全标记的事务行为踪迹问题研究

Research on Transaction Behavior Footprint with Incomplete Tokens
下载PDF
导出
摘要 开放网络环境下分布式软件在交互行为中产生的事件行为踪迹标记丢失,导致无法对软件行为进行分析和预测。为丢失的踪迹找到事件源,将不完全标记的事务行为踪迹问题转化为网路最大流问题。采用沿路径推进的增载轨算法,找到各事务产生的最有可能的行为踪迹序列。仿真实验表明:本方法可以有效、准确地标记不完全标记的事务行为踪迹序列。 In open network environment, the loss of behavior footprint tokens producing in the interactions among the distributed software may lead unable to analyze and predict the software behavior. In order to find the event source for the lost token, translates the incomplete token problem of behavior footprint into the problem of network maxflow. Takes the along path forward of augmenting path algorithm to find the most possible behavior sequence for every transaction. The simulation experiment proves that the proposed method has validity and accuracy in marking the transaction of incomplete token.
出处 《湖南工业大学学报》 2012年第1期61-65,共5页 Journal of Hunan University of Technology
基金 国家技术创新基金资助项目(11C26214302856) 湖南省自然科学基金资助项目(11JJ4050) 湖南省教育厅科研基金资助项目(11B039 11W002 10C0620)
关键词 不完全标记 行为踪迹 最大流 增载轨算法 incomplete token behavior footprint maxflow augmenting path algorithm
  • 相关文献

参考文献7

  • 1Li C Y,Man J F,Wang Z B. Research on Interactive Behavior Analyzing in New-Type Distributed Software System[A].San Antonio:TSIPress,2010.513-517.
  • 2满君丰;李长云;文志诚.不完全标记的多个并行事务踪迹的"剥离”[J]软件学报,2010(增刊1):224-237.
  • 3Chandy K M,Lamport L. Distributed Snapshots:Determining Global States of Distributed Systems[J].ACM Transactions on Computer Systems,1985,(01):3-7.
  • 4Mansouri-Samani M,Sloman M. Monitoring Distributed Systems[J].IEEE Transactions on Networking,1993,(06):20-30.
  • 5Ahuja R K,Magnanti T L,Borlin J. Network Flows:Theory,Algorithms and Applocation[M].New Jersey:Prentice-Hall,Inc,1993.58-62.
  • 6张宪超,江贺.一个新的最大流问题增载轨算法[J].小型微型计算机系统,2006,27(9):1726-1730. 被引量:10
  • 7Monnot J,Toulouse S. The Path Partition Problem and Related Problems in Bipartite Graphs[J].Operations Research Letters,2007,(05):677-684.doi:10.1016/j.orl.2006.12.004.

二级参考文献20

  • 1Ahujia R K,Magnanti T L,Orlin J B.Network flows:theory,algorithms and applications[M].New Jersey:PRENTICE-HALL,1993.
  • 2Goldberg A V,Tarjan R E.A new approach to the maximum flow problem[J].J.ACM.1988,35(4):921-940.
  • 3Goldberg A V,Rao S.Flows in undirected unit capacity networks[J].SIAM J.Discrete Math.,1999,12(1):1-5.
  • 4Goldberg A V,Rao S.Beyond the flow decomposition barrier[J].J.ACM,1998,45(5):783-797.
  • 5Weihe K.Maximum (s,t)-flows in planar network in O(|V|log|V|)time[J].J.Comput.System Sci.1997,55(3):454-475.
  • 6Sleator D D,Tarjan R E.A data structure for dynamic tree[J].J.Comput.System Sci.1983,26(3):362-391.
  • 7Klingman D,Napier A,Stutz J.NETGEN:a program for generating large scale capacitated assignment[J].Transportation and Minimum Cost Flow Network Problems.Management Science,1974,20(5):814-821.
  • 8Ford L R,Fulkerson D R.Maximum flow through a network[J].Canadian Journal of Math.,1956,8(5):399-404.
  • 9Dinic E A.Algorithm for solution of a problem of maximum flow in networks with power estimation[J].Soviet Math.Dokl.1970,11(8):1277-1280.
  • 10Karzanov A V.Determining the maximum flow in a network by the method of preflows[J].Soviet Math.Dokl.1974,15(3):434-437.

共引文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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