期刊文献+

一种基于用户群的高铁专网断点定位方法与实践

Research and practice of the location network breakpoint method based on the high-railway user groups
下载PDF
导出
摘要 近年来,随着高铁网络规模逐渐扩大,传统网络的测试优化工作变得日益繁重。为提升工作效率,降低人力成本,遂开展基于群用户的高铁专网断点定位方法研究与实践。本文提出了一种基于用户群的高铁专网断点定位方法,可联合MR大数据中时间、空间两个维度识别高铁用户群体,依靠OTT定位、MR采样点及K-Measure算法快速锁定公专网切入切出问题高发区域,并进行自动分析优化。本算法研究与实践于2017年11月启动,经方案确定、功能实现、验证纠错,截至2018年3月底,某高铁网络整体切入切出专网比例减少17%,其中6个切入切出专网TOP小区异常切换减少30%以上,改善效果明显。 Recently, with the scale of the high-railway network gradually expanding, the traditional network test optimization becomes increasingly arduous. In order to improve work efficiency and reduce labor costs, the research and practice of the location network breakpoint method based on the high-railway user groups is carried out. The paper proposes a method which could identify the high-railway users based on MR big data in the view of both time and space dimensions. It cloud work out the network high-risk areas quickly and analyze automatically relying on the OTT locating, MR sampling information and the K-Measure algorithms. The research and practice have already made improvements obviously, which started in November 2017. It has gone through the stages of plan determination, function realization and verifi cation. By the end of March 2018, the proportion of error switching in some high-railway network was reduced by 17%, of which TOP 6 cells communities were reduced by 30%.
作者 张璐岩 贾磊 ZHANG Lu-yan;JIA Lei(China Mobile Group Shaanxi Co.,Ltd.,Xi'an 710077,China)
出处 《电信工程技术与标准化》 2018年第12期63-67,共5页 Telecom Engineering Technics and Standardization
关键词 高铁群用户识别 高铁专网断点定位 自动分析 identify the high-railway user groups worked out the network high-risk areas analyze automatically
  • 相关文献

参考文献2

二级参考文献34

  • 1孙明轩,王郸维,陈彭年.有限区间非线性系统的重复学习控制[J].中国科学:信息科学,2010,40(3):433-444. 被引量:12
  • 2郭开波,张李超,王从军,黄树槐.STL模型布尔运算的实现[J].华中科技大学学报(自然科学版),2006,34(7):96-99. 被引量:14
  • 3Mantyla M. Boolean operations of 2-manifolds through vertex neighborhood classification[J]. ACM Transactions on Graphics, 1986, 5(1): 1 229.
  • 4Schneider P J, Eberly D H. Geometric tools for computer graphics [M]. Beijing: Publishing House of Electronics Industry, 2004.
  • 5Tomas M. A fast triangle-triangle intersection test [J]. Journal of Graphics Tools, 1997, 2(2) : 25-30.
  • 6Garey M R, Johnson D S, Preparata F P, et al. Triangulating a simple polygon]J]. Information Proceeding Letters, 1978, 7(4): 175-179.
  • 7Chazelle B. Triangulating a simple polygon in linear time[J]. Discrete Comp Geom, 1991, 6(5): 485- 524.
  • 8Wu Liang. Fast and robust simple polygon triangulation with/without holes by sweep line algorithm[EB/ OL]. [2007-03-18]. http://www. mema. ucl. ac. be/ - wu/Poly2Tri/poly2tri. html
  • 9Gottschalk S, Lin M C, Manocha D, et al. OBBtree: a hierarchical structure for rapid interference detection [C] //Proceedings of ACM Annual Conference on Computer Graphics. New Orleans: [s. n], 2000: 171-180.
  • 10Arimoto S, Kawamura S, Miyazaki F. Bettering operation of robots by learning. Journal of Robotic Systems, 1984, 1(2): 123-140.

共引文献71

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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