基于属性的网络协议建模与互操作性测试方法研究
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
因特网是世界范围内的一个网络,其互联产品可能来自不同的生产厂家,因此需要进行互操作性测试。所谓互操作性测试就是检查两个或多个协议实现是否可以进行正确的交互,提供期望的服务,它可以对设备的互连互通和互操作提供根本保证。
     互操作性测试的过程一般包含被测系统建模、互操作性测试生成以及测试实施。本文对于协议说明中的不确定性问题进行了分析,提出了一种利用已有测试经验针对不确定进行建模的方法,并给出一种新的测试选择方法。属性是一个系统在某个特定的场景下应具有的功能或者特性。基于属性的互操作性测试生成可以分成四部分:基于属性建立被测系统的Petri网模型,考虑相关可达图的获取;基于可达图考虑覆盖属性的可执行测试序列的生成;测试数据的生成。采用基于属性的方法进行被测系统的建模在一般情况下可以减少建模的工作量。本文给出了义务属性、交互属性和可扩展属性的定义及相关模型,基于上述属性进行测试的测试判定方法。对协议的通用数据包进行了全面的分析并给出一种构建测试数据包的方法,对提出的方法进行了测试实践,检验了本文方法的有效性,最后总结全文,给出了下一步的研究工作。
     论文的创造性工作主要体现在以下几个方面:
     (1)针对协议说明的不确定性及当前已有的互操作性测试经验为被测系统建模,给出互操作性测试序列选择算法。
     互操作性测试至少包括两个被测实现,它们合起来构成被测系统。本文根据被测的说明的不确定有限状态机模型(FSM)和当前已有的互操作性测试经验构建概率不确定有限状态机(PNFSM),有效地刻画当前的互操作性测试状况。基于该模型及一定的策略生成包含所有状态的二叉树,然后基于得到的二叉树给出了包含不确定状态的互操作性测试序列的选择算法,通过示例展示了提出的算法的有效性,并以RIP协议为例展示了提出的建模方法的应用。
     (2)提出了基于属性进行互操作性测试建模的方法及测试序列的生成方法,给出测试判定方法。
     本文提出了一种基于两个被测的Petri网模型及较为完全交互消息序列进行模型复合的方法,得到了被测系统的复合Petri网模型。然后基于该模型及协议说明给出了互操作性测试中应考虑的义务属性、交互属性及可扩展属性的定义。基于复合模型及其可达图,依据本文给出的义务属性、交互属性及可扩展属性的定义的要求给出了可执行测试序列的生成算法,给出了属性覆盖的定义,测试判定的方法。并以BRP(Bounded Retransmition Protocol)为例进行相关方法的例示,通过对于RIP协议、OSPF的义务属性之一、BGP4的策略路由从不同的角度展示了本文的建模方法比传统方法在描述感兴趣的属性时可以更有效地减缓或者避免了状态爆炸,而且生成的测试序列数目也大大减少。(3)针对协议数据包的特点,给出了一种测试数据生成方法,以利于自动组包。
     在协议测试过程中,对于测试数据的生成方法的考虑应从包的粒度细化到字段上。本文对协议的通用数据包进行了全面的分析,根据各个字段的功能及其取值之间的关系,对所有字段进行了固定字段、独立字段以及相关字段序列的划分,然后根据测试经验对独立字段和相关字段序列进行了优先级赋值,并根据优先级构建测试包,从而可以将具有重要测试目的的包尽早生成并进行测试,并根据优先级标记指导测试结果判定。
Internet is world widely network. Its products can be built by many different manufactures, therefore they need interoperability testing. Interoperability testing is to check whether two or more implementations can interact correctly and offer expected service, it is a basic guarantee for interconnecting network devices and transporting the information between these products.
     The generic process of interoperability testing includes SUT(System under Test) modeling, test sequence generation and test deployment and execution. The nondeterminism in specification is analyzed and the test experience results are made use to model the situation. A new test selection method is introduced. Properties are the functions or features of one system. Interoperability testing based on property can be divided into four parts:the construction of Petri net for SUT base on property, the executable test sequence generation based on reachable graph with property coverage consideration; the test data generation. Modeling SUT base on property generally can reduce the workload of model construction because it only focuses on the interested properties and ignores the others. The definitions of obligation property, interactive property and extensible property as well as the related models are puting forwarded. The test verdict methods are introduced base on the above properties. To generate test data, the format of generation protocol packet is fully analyzed. A new approach is given to construct test packet and its efficency is validated by the examples. Finally the summary and the research work in the future are presented.
     The main creativities of this dissertation are explained as follows:
     (1) A model of SUT is constructed from nondeterminism in specification and current experience of interoperability testing and a new algorithm of test sequence selection is presented. Interoperability testing involves at least two IUTs (implementation under test) and they make up the SUT. According to the nondeterministic finite state machine of specification and the current experience of interoperability testing, a probability nondeterministic finite state machine(PNFSM) is constructed gradually. The achieved model efficiently describes the current situation of interoperability testing. Based on PNFSM and the certain policy, a binary tree which covers all states of PNFSM is generated. The algorithms, which are used to select test sequences from that binary tree, are presented. The algorithms'validity is proved by an example and the final test sequences are listed in a table. Furthermore the testing scenario of the counting to infinite in RIP is used as an experiment to simply illuminate the modeling method.
     (2) A new modeling method for interoperability testing is putting forward as well as the test sequence generation method and the test verdict method. A SUT model, called composite Petri net(ComPN), is constructed by two IUTs'Petri nets and a relative complete interactive message sequence. Based on SUT model and protocol specification, the definitions of obligation property, extensible property and interactive property are given. Whereafter based on ComPN and its reachable graph, the algorithms of executable test sequence generation are presented according to each property's definition in the dissertation. Furthermore the definition of property coverage and the test verdict method are putting forwards. BRP(Bounded Retransmission Protocol) is used as an example to show the algorithm's validity. The routing protocols, such as RIP, one of obligation property of OSPF and the policy of BGP4, from different sides show that the modeling method can decrease or avoid state explosion more efficiently than tranditional method when it only focuses on the description of the interested property. Moreover the number of test sequence is reduced dramatically.
     (3) A method of test data generation, which considers the features of packet, is given to help construct packet automatically. During the process of protocol testing, the consideration of test data should be changed from the granularity of packet to the granularity of field. The general format of packet is analyzed completely. According to their functions and the relation of the values, the fields are divided into three parts, first part is constant part, second part is independent fields and third part is the related fields. Moreover based on the accumulated experience, the priority is assigned to the independent fields and each sequence of related field as a whole. The testing packets are sequentially constructed according to priorities such that the important packets are generated and some aspects of the protocol are tested as early as possible. The tag of priority is used to conduct the verdict of testing result.
引文
[1]. Scott Moseley, Farbum Scotus, Steve Randall, PQM Consultants, Anthony Wiles, ETSI PTCC. In Pursuit of Interoperability[J]. International Journal of IT Standards and Standardization Research,2004,2(2):34-51.
    [2]. The University of New Hampshire InterOperability Laboratory (UNH-IOL). [EB/OL]. http://www. iol. unh. edu/services/testing/.
    [3]. European Telecommunications Standards Institute. [EB/OL]. http://www.etsi.org/
    [4].TAHI. IPv6 Test Scenario for Interoperability with Sample Network[EB/OL]. http://www. tahi. org.
    [5]Lee D, Yannakakis M. Principles and methods of testing finite state machines-a survey. Proceedings of the IEEE,1996,84(8):1090-1123.
    [6]W. H. Chen. Executable Test Sequence for the Protocol Control and Data Portions. Proc. Of IEEE Int'1 Conference on communications, New Orleans, U.S.A.,2000 Page(s):505-510 vol.1
    [7]郝瑞兵.基于形式化方法的协议一致性和互操作性测试研究:[博士学位论文],北京,清华大学,1997。
    [8]王之梁,基于形式化方法的分布式协议互操作性测试研究:[博士学位论文],北京,清华大学,2006。
    [9]林华辉,协议互操作性测试理论与方法研究,[博士学位论文],合肥,中国科学技术大学,2007。
    [10]Shin, S. Kang, Interoperability test suite derivation for the ATM/B-ISDN signaling protocol [C], IFIP International Conference on Testing of Communicating Systems. Kluwer Academic Publishers, Dordrecht,1998,11:313-330.
    [11]Peterson J L. Petri net theory and the modeling of systems [M]. Englewood Cliffs, Nj, Prentic-Hall, Inc.1981.
    [12]吴哲辉,Petri网导论[M].北京:机械工业出版社,2006.4.
    [13]李华,叶新铭。与时间相关的系统的Petri网模型,内蒙古大学学报.自然科学版,2000,vol(31),No.1:125-131。
    [14]杭成宝,OSPFv3协议的互操作性测试研究,[硕士学位论文],呼和浩特,内蒙古大学,2009。
    [15]J. Tretmans. A Formal Approach to Conformance Testing. [Dissertation], University of Twente, Enschede, Netherlands,1992.
    [16]J. Tretmans. Test generation with inputs, outputs, and quiescence. In:Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.1055, pp.127-146. Springer, Heidelberg, (1996).
    [17]Alexandra Desmoulin and Cesar Viho. Formalizing interoperability testing:Quiescence management and test generation。 FORT2005, Taiwan, October 2-5,2005, pp.533-537。
    [18]ITU-T Recommendation Z.120 - 1999, Message sequence chart (MSC) [S]. Geneva:ITU-Telecommunication Standardization Sector,1999.
    [19]Li Xuandong, Bu Lei, Hu Jun, Zhao Jianhua, Zheng Tao, Zheng Guoliang. Scenario-Based Timing Consistency Checking for Time Petri Nets [J]. In Proceedings of the 26th International Conference on Formal Methods for Networked and Distributed Systems (FORTE2006), France,2006, Lecture Notes in Computer Science 4229, Springer, pp.389-404.
    [20]Yoon, Gwang Sik; Kwon, Yong Rae. Extending MSC for Reactive Systems. Proceedings of the IEEE 2001 Symposia on Human Centric Computing Languages and Environments (HCC'01).2001.104-111
    [21]R. Miller. Calculus of Communication Systems. Volume 94 of Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, Germany,1980.
    [22]李梦君,李舟军,陈火旺,基于进程代数安全协议验证的研究综述,计算机研究与发展[J]2004,41(7):1097-1103
    [23]Richard L. Schwartz and P. Michael Melliar-Smith. From State Machines to Temporal Logic: Specification Methods for Protocol Standards. IEEE Transactions on Communications,1982,30(12) 2486-2496.
    [24]Fernandez, J., L. Mounier and C. Pachon, Property oriented test case generation, in:Formal Approaches to Software Testing, Proceedings of FATES 2003, Lecture Notes in Computer Science 2931 (2004), pp.147-163.
    [25]陈伟琳,周颢,赵保华。利用构造类别代数的协议安全测试方法。西安交通大学学报,2008 42(12):1481-1485。
    [26]ITU-R V.664 CCITT SDL (Specification and Description Language)
    [27]H. Ural, K. Saleh, and A. Williams, "Test Generation based on control and data dependencies within system specification in SDL, " Computer Communications, Vol.23,2000, pp.609-627.
    [28]Hao R B, Wu J P. A Formal Approach to Protocol Interoperability Testing. Journal of Computer Science and Technology,1998,13(1):79-90.
    [29]王之梁,吴建平,尹霞。基于通信多端口有限状态机的协议互操作性测试生成研究[J]。计算机学 报,2006,29(11):1909-1919。
    [30]林华辉,赵保华,张炜,互操作性测试序列生成与优化方法,中国科学技术大学学报,2008,38(12):1407-1413。
    [31]林华辉,赵保华,屈玉贵。基于有向图的最小完全覆盖互操作测试序列生成算法[J],中国科学技术大学学报,2006,36(2):225-229.
    [32]Sungwon Kang, Myungchul Kim, Interoperability Test Suite Derivation for Symmetric Communication Protocol[C], Osaka, FORTE/PSTV,1997. pp.57-72.
    [33]Seol S., Kim M, Kang S, Interoperability Test Suite Derivation for the TCP Protocol[C]. Beijing, FORTE XII/PSTV XIX,1999, pp.357-376.
    [34]Kang S., Shin J, Kim M, Interoperability test suite derivation for communication protocols[J]. Computer Networks,2000,32(3):347-364.
    [35]Khaled EI-Fakih, Vadim Trenkaev, Natalia Spitsyna, and Nina Yevtushenko. FSM Based Interoperability Testing Methods for Multi Stimuli Model. TestCom2004, Oxford, UK, March 17-19,2003 pp.60-75.
    [36]Alexandra Desmoulin and Cesar Viho. A New Method for Interoperability Test Generation. TestCom/FATES 2007, LNCS 4581, pp.58-73.
    [37]Alexandra Desmoulin and Cesar Viho. Quiescence Management Improves Interoperability Testing, TestCom 2005,pp.364-378.
    [38]Alexandra Desmoulin and Cesar Viho. Formalizing interoperability for test case generation purpose. International Journal on Software Tools for Technology Transfer (STTT), Springer Berlin/Heidelberg,2009,11:261-267.
    [39]Fan Zhang and To-yat Cheung. Optimal Transfer Trees and Distinguishing Trees for Testing Observable Nondeterministic Finite-State Machines. IEEE Transactions on Software Engineering, 2003,29(1):1-14.
    [40]Luo G, Bochmann G V, Alexandre P. Test selection based on communicating nondeterministic Finite-State Machines using a generalized WP-Method[J]. IEEE Transactions on Software Engineering,1994,20(2):149-162.
    [41]Miller R E, Chen D L, Lee D and Hao R. Coping with nondeterminism in network protocol testing[C]. Testcom2005, Montreal,2005, pp.129-145
    [42]R. M. HIERONS. Generating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine [J]. THE COMPUTER JOURNAL, British,2003,46(3):307-318.
    [43]Robert M. Hierons, Florentin Ipate. Testing A Deterministic Implementation Against A Non-controllable Non-deterministic Stream X-machine. Formal Aspects of Computing.2008,20(6): 597-617.
    [44]Alur R, Courcoubetis C, Yannakakis M. Distinguishing tests for nondeterministic and probabilistic machines[C]. In:Proc. the 27th ACM Symposium on Theory of Computing, Las Vegas, 1995, pp.363-372
    [45]Hwang I, Kim T, Hong S, Lee J. Test selection for a nondeterministic FSM. Computer Communications[J],2001,24(12):1213-1223
    [46]Natalia Shabaldina, Khaled El-Fakih, Nina Yevtushenko, Testing Nondeterministic Finite State Machines with Respect to the Separability Relation, TestCom/FATES 2007, LNCS 4581, pp. 305-318.
    [47]Alain Faivre, Christophe Gaston, PaExtensiblee Le Gall and etc. Test Purpose Concretization through Symbolic Action Refinement.2008,Testcom2008, pp.184-189.
    [48]王之梁,吴建平,尹霞等。基于MSC测试目的的协议互操作性测试生成。北京邮电大学学报[J],2006,5:116-120。
    [49]Viho C, Barbin S and Tanguy L. Towards a formal framework for interoperability testing[C]. Proceedings of the 21st IFIP International Conference on Formal Techniques for Networked and Distributed Systems(FORTE 2001), Cheju Island, Korea:Kluwer,2001. pp.53-68.
    [50]Cedric Besse, Ana Cavalli, Two methods for interoperability tests generation:An Application to the TCP/IP Protocols[C], Berlin, TestCom 2002.
    [51]Ural H. Test sequence selection based on static data flow analysis[J]. Computer Communications,1987,10(1):234-242.
    [52]SANDRA RAPPS, ELAINE J. WEYUKER. "Selecting Software Test Data Using Data Flow Information" IEEE TRANSACTIONS ON SOFTWARE ENGINEERING. VOL SE-11,NO.4 APRIL 1985, pp.367-375.
    [53]S. C. Ntafos, A Comparison of Some Structural Testing Strategies, IEEE Transactions on Software Engineering, June 1988.14(6):868-874.
    [54]李华,叶新铭,张巨萍。基于Petri网的测试路径选择标准,内蒙古大学学报(自然科学版),2007,38(1):88-93。
    [55]Allen S. Parrish and Suart H. Zweben. On the Relationships Among the All-uses, All-DU-Paths, and All-Edges Testing Criteria. IEEE Transaction On Software Engineering,1995, 21 (12):1006-1009.
    [56]李华。基于Petri网的数据流与控制流相结合的协议测试方法研究,[硕士学位论文],呼和浩特,内蒙古大学,1998。
    [57]Lihua, Ye Xin-Ming. "Gnerating Executable Test Sequences Based on Petri-net for Combined Control and Data Flow of Communication Protocol",1998年, ICCT'98 国际会议, S48-02-1-S48-02-5.
    [58]郑啸,秦锋。基于Petri网的协议测试例自动生成。华中科技大学学报自然科学版,第34卷,第3期,2006年3月,pp.25-28。
    [59]王红霞,叶新铭。基于Petri网模型的OSPF路由算法的测试序列生成。内蒙古大学学报(自然科学版),2001,32(3):340-343。
    [60]Vadim Trenkaev, Myungchul Kim, Soonuk Seol. Interoperability Testing Based on a Fault Model for a System of Communicating FSMs[C]. Sophia Antipolis, TestCom2003. pp.226-242.
    [61]Zhiliang Wang, Jianping Wu, Xia Yin. Towards Interoperability Test Generation of Time Dependent Protocols:a Case Study[C]. Dallas. Global Telecommunications Conference,2004. pp. 589-594.
    [62]Jianping Wu, Zhongjie Li, and Xia Yin. Towards Modeling and Testing of IP Routing Protocols [C]. Test Com2003, France, May 26-28,2003:49-62.
    [63]田军,张玉军,于东,邻居发现协议的形式化测试[J]。计算机研究与发展,2001,38(12):1409-1417。
    [64]ETSI ES 201 873-1:The Testing and Test Control Notation version 3; Part 1:TTCN-3 Core Language. V2.1.0 (2008-09),2008, an ITU-T standard Z.140.
    [65]http://www. go4-it. eu/svnrepos/Go4IT
    [66]http://www.testingtech.com/
    [67]http://www-01. ibm. com/software/rational/
    [68]李华,叶新铭,曾敏等。基于XML的协议一致性测试系统的设计与实现。计算机科学,2006,10:275-278。
    [69]李华,张涛,叶新铭。基于XML的OSPFv3一致性测试研究。计算机科学,2007,34(4):59-62。
    [70]李华,叶新铭。基于XML的协议一致性测试系统的设计与实现。计算机科学,2006,33(10):275-278。
    [71]Seol S, Kim M, Kang S, and et al. Fully automated interoperability test suite derivation for communication protocols[J]. Computer Networks,2003,43(6):735-759
    [72]Dibuz S,Kremer P. Framework and model for automated interoperability test and its application to ROHC. In:Hogrefe D, Wiles A, eds.Proceedings of the 15th IFIP International Conference on Testing of Communicating Systems(TestCom 2003), LNCS 2644. Sophia Antipolis, France:Springer,2003. pp.243-257.
    [73]R. Rubinfeld and M.Sudan. Robust Characterizations of Polynomials with Applications to Program Testing. Available as IBM Research Report RC 19156(83446)9/9/93 and Cornell CS Tech. Report 93-1387, September 1993.
    [74]Patricia D.L. Machado, Daniel A. Silva and Alexandre C. Mota. Towards Property Oriented Testing[J]. Electronic Notes in Theoretical Computer Science (ENTCS) archive,2007,184:3-19.
    [75]李书浩,王戟,齐治昌,董威。一种面向性质的实时系统测试方法[J].电子学报,2005,33(5):827-834。
    [76]George Fink, Michael Helmke, Matt Bishop, Karl Levitt. An interface language between specifications and testing. Technical Report CSE-95-15, University of California, Davis,1995.
    [77]George Fink, Karl Levitt. Property-based testing of privileged programs. Computer Security Applications Conference,1994. Proceedings.,10th Annual.1994, pp.154-463
    [78]G. Fink and M. Bishop. Property based testing:A new approach to testing for assurance. ACM SIGSOFT Software Engineering Notes,22(4), July 1997.
    [79]Jean-Claude Fernandez, Laurent Mounier and Cyril Pachon. Property-Oriented Test Generation, Proc. Formal Aspects of Software Testing Workshop,2003. Volume 2931/2004, pp.1101-1102.
    [80]Camille Constant, Thierry Je'ron, Herve'Marchand, and Vlad Rusu. Integrating Formal Verification and Conformance Testing for Reactive Systems. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL.33, NO.8, AUGUST 2007. pp.558-574.
    [81]周建涛,叶新铭.一种构造Petri网可达图的方法[J].内蒙古大学学报(自然科学版).1999,30(3):392-395。
    [82]http://www-verimag. imag. fr/-graf/INVARIANT-CHECKER/BRP/
    [83]To-Yat Cheung, Xinming Ye. A fault-detection approach to the conformance testing of nondeterministic systems. Journal of Parallel and Distributed Computing. Volume 28, Issue 1 (July 1995), pp.94-100.
    [84]Florentin Ipate, Bounded Sequence Testing from Non-deterministic Finite State Machines. Testcom2006, pp.55-70.
    [85]Robert M. Hierons Mercedes G. Merayo and Manuel Nunez. Testing from a Stochastic Timed System with a Fault Model. Journal of Logic and Algebraic Programming [J], Volume 78, Issue 2, January 2009, pp.98-115.
    [86]Natalia Shabaldina, Khaled El-Fakih, Nina Yevtushenko, Studying the separability relation between finite state machnies, Software Testing, Verification & Reliability, Volume 17, Issue 4 (December 2007), pp.227-241.
    [87]G. Malkin, RIP Version 2, RFC2453, November 1998
    [88]RFC 3775, Mobility Support in IPv6, D. Johnson, June 2004
    [89]J. Moy, "OSPF Version 2", STD 54, RFC2328, April 1998
    [90]R. Coltun, D. Ferguson, J. Moy, "OSPF for IPv6", RFC2740, December 1999
    [91]. R. Coltun, D. Ferguson, J. Moy, A. Lindem, Ed, "OSPF for IPv6", RFC5340, July 2008.(RFC2740的更新)
    [92]孙庆南,鲁士文。OSPFv3路由协议在FreeBSD下的实现研究。计算机科学,2005,32(11):16-19。
    [93]RFC 2370, July 1998, The OSPF Opaque LSA Option
    [94]BitTorrent Protocol Specification v1.0。http://wiki.theory.org/BitTorrentSpecification
    [95]叶新铭,郝松侠。IPv6邻居发现协议的形式化验证。软件学报,2005,16(6):1182-1189。
    [96]张玉军,移动IPv6协议测试研究与实践,[博士学位论文],北京,中科院计算所,2004。
    [97]Bates, T., Rekhter, Y., Chandra R., Multiprotocol Extensions for BGP-4 (BGP4+), RFC 2858, June,2000.
    [98]高翔,蒋凡,杨敬峰,等.TTCN-3研究综述[J].计算机工程与科学,2004,26(6):17-20。
    [99]张卫星,蒋凡。并发TTCN测试执行机的设计与实现。软件学报,2003,14(3):606-611。
    [100]李华,张巨萍,叶新铭,吴承勇。TTCN-3测试系统的协议相关部分的分析实现,计算机工程,2009,35(21):253-255。
    [101]尹霞,王之梁,景传明等。一种基于TTCN-3的协议测试系统及其扩展研究。中国科学E辑:信息科学,2008,38(10):1594-1613。
    [102]Zhiliang Wang, Xia Yin, Yang Xiang, etc. TTCN-3 Based Conformance Testing of Mobile Broadcast Business Management System in 3G networks.21st IFIP Int. Conference on Testing of Communicating Systems and the 9th Int. Workshop on Formal Approaches to Testing of Software (Testcom/FATES 2009). Eindhoven, the Netherlands. November,2009. LNCS 5826:163-178.
    [103]Zhiliang Wang, Jianping Wu, Xia Yin, etc. Using TIMED TTCN-3 in Interoperability Testing for Real-Time Communication Systems. TestCom 2006, LNCS 3964, pp.324-340.
    [104]王玮,黄小红,常婧等。基于TTCN-3的移动IPv6并行测试的设计与实现[J]。厦门大学学报(自然科学版)增刊,2007,46(11):14-17。
    [105]王小勇,基于XML的Linux系统下的协议一致性测试方法及测试系统。[硕士学位论文],呼和浩特,内蒙古大学,2005。

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700