WO2016086636A1 - 信息更新方法、装置及终端 - Google Patents

信息更新方法、装置及终端 Download PDF

Info

Publication number
WO2016086636A1
WO2016086636A1 PCT/CN2015/081280 CN2015081280W WO2016086636A1 WO 2016086636 A1 WO2016086636 A1 WO 2016086636A1 CN 2015081280 W CN2015081280 W CN 2015081280W WO 2016086636 A1 WO2016086636 A1 WO 2016086636A1
Authority
WO
WIPO (PCT)
Prior art keywords
full
information
cross
crossing
intersection
Prior art date
Application number
PCT/CN2015/081280
Other languages
English (en)
French (fr)
Inventor
鹿虹丽
何桓
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2016086636A1 publication Critical patent/WO2016086636A1/zh

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks

Definitions

  • the present invention relates to the field of communications, and in particular to an information update method, apparatus, and terminal.
  • the NMS creates a predetermined network
  • OTN optical transport network
  • cross-capacity representations There are currently two general types of cross-capacity representations, one is a list of all cross-connections that can be created but not yet created, that is, all possible cross-connections are exhausted; the other is a list of source endpoints that can be used to create cross-connections. And the list of endpoints, that is, the source and sink endpoints are compressed based on the first method.
  • the source endpoints A1 to A10 can be cross-connected with the sink endpoints Z1 to Z10.
  • the embodiment of the invention provides a method and a device for updating information to solve at least the problem that the network management program and the database are slow and inefficient due to the large amount of cross-capacity data existing in the related art.
  • an information updating method comprising: recording predetermined information of a full-intersection object, wherein the full-crossing object includes a predetermined number of source endpoints and/or sink endpoints supporting an unobstructed cross-connection; Determining a change of the full-cross object; updating the predetermined information of the full-intersection object according to the change of the full-cross object.
  • the predetermined information includes at least one of the following: the subrack information of the subrack in which the full cross object is located, the slot information of the slot where the full cross object is located, and the fiber joint information of the full cross object
  • the endpoint, the predetermined endpoint resource included in the full-crossing object includes an endpoint that does not belong to the management scope of the full-crossing object but participates in a full intersection.
  • the change that occurs in the full-crossing object includes at least one of: creating a full-cross object, updating a full-cross object, and deleting a full-cross object.
  • updating the predetermined information of the full-cross object according to the change of the full-cross object includes: generating the predetermined full-cross object when the change of the full-cross object is creating a predetermined full-cross object Recording predetermined information of the predetermined full-intersection object; when the change of the full-cross object is updating the full-cross object, determining predetermined information of the fully-crossed object that has changed, and updating the full-cross object Predetermined information; when the change of the full-intersection object is to delete the full-cross object, the deleted full-cross object is determined, and the determined predetermined information of the full-cross object is deleted.
  • an information updating apparatus comprising: a recording module configured to record predetermined information of a full-interleaved object, wherein the full-crossing object includes a predetermined number of source endpoints supporting an unobstructed cross-connection And/or a sink endpoint; a determining module configured to determine a change in the full-crossing object; an update module configured to update the predetermined information of the full-interleaved object according to the change occurring in the full-crossing object.
  • the predetermined information includes at least one of the following: the subrack information of the subrack in which the full cross object is located, the slot information of the slot where the full cross object is located, and the fiber joint information of the full cross object
  • the endpoint, the predetermined endpoint resource included in the full-crossing object includes an endpoint that does not belong to the management scope of the full-crossing object but participates in a full intersection.
  • the change that occurs in the full-crossing object includes at least one of: creating a full-cross object, updating a full-cross object, and deleting a full-cross object.
  • the updating module includes: when the change of the full-intersection object is to create a predetermined full-cross object, generating the predetermined full-cross object, and recording predetermined information of the predetermined full-cross object;
  • the change of the full-intersection object is to determine predetermined information of the fully-crossed object that changes when the full-cross object is updated, and to update predetermined information of the full-cross object; when the change of the full-cross object is to delete the full When the object is crossed, the deleted full-cross object is determined, and the determined predetermined information of the full-cross object is deleted.
  • a terminal comprising the apparatus of any of the above.
  • predetermined information for recording a full-intersection object wherein the full-cross object includes a predetermined number of source endpoints and/or sink endpoints supporting an unobstructed cross-connection; determining a change of the full-cross object; The change of the full-crossing object is updated to the predetermined information of the full-crossing object, which solves the problem that the amount of cross-capacity data existing in the related art causes the network management program and the database to be slow and inefficient, thereby reducing the cross-capacity.
  • the amount of data increases the speed and efficiency of the network management program and database.
  • FIG. 1 is a flowchart of an information update method according to an embodiment of the present invention.
  • FIG. 2 is a block diagram showing the structure of an information updating apparatus according to an embodiment of the present invention.
  • FIG. 3 is a structural block diagram of a terminal according to an embodiment of the present invention.
  • FIG. 4 is a block diagram showing the structure of an apparatus for OTN cross capacity management according to an embodiment of the present invention.
  • FIG. 5 is a flowchart of an OTN cross capacity management method according to an embodiment of the present invention.
  • FIG. 1 is a flowchart of an information update method according to an embodiment of the present invention. As shown in FIG. 1, the process includes the following steps:
  • Step S102 recording predetermined information of a full-intersection object, where the full-intersection object includes a predetermined number of source endpoints and/or sink endpoints supporting unobstructed cross-connections;
  • Step S104 determining a change that occurs in the full-cross object
  • Step S106 updating the predetermined information of the full-intersection object according to the change of the full-crossing object.
  • the intersection capacity composed of a certain number of endpoints that can be cross-connected unimpeded is abstracted into a full-cross object, and the source endpoint and/or the sink endpoint under the full-cross object are implemented by managing the full-cross object.
  • Management solves the problem that the amount of cross-capacity data in the related technology leads to slow operation and low efficiency of the network management program and the database, thereby achieving the effect of reducing the amount of cross-capacity data and improving the running speed and efficiency of the network management program and the database.
  • the predetermined information related to the full-crossing object may be first determined.
  • the predetermined information of the full-crossing object may include at least one of the following: Subrack information of the subrack, slot information of the slot where the full cross object is located, the fiber information of the full cross object, the number of endpoints of the full cross object, the name information of the full cross object, and the management scope of the full cross object
  • the change of the full-cross object may be a plurality of types of changes.
  • the change of the full-cross object may include at least one of the following: creating a full-cross object, updating a full-cross object, and deleting all Cross object. Therefore, the predetermined information of the full-intersection object is correlated and processed according to different changes.
  • updating the predetermined information of the full-intersection object according to the change of the full-cross object may include: generating a predetermined full cross when the change of the full-intersection object is to create a predetermined full-cross object An object, recording predetermined information of the predetermined full-cross object; when the change of the full-cross object is updating the full-cross object, determining predetermined information of the changed full-cross object, updating predetermined information of the full-cross object; When the change of the object is to delete the full-cross object, the deleted full-cross object is determined, and the predetermined information of the determined full-cross object is deleted.
  • module may implement a combination of software and/or hardware of a predetermined function.
  • apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
  • FIG. 2 is a block diagram showing the structure of an information updating apparatus according to an embodiment of the present invention. As shown in FIG. 2, the apparatus includes a recording module 22, a determining module 24, and an updating module 26. The apparatus will be described below.
  • the recording module 22 is configured to record predetermined information of the full-intersection object, wherein the full-cross object includes a predetermined number of source endpoints and/or sink endpoints supporting the unobstructed cross-connection;
  • the determining module 24 is connected to the recording module 22, and is configured to determine The change of the full-intersection object occurs;
  • the update module 26 is coupled to the determination module 24, and is configured to update the predetermined information of the full-intersection object according to the change occurring in the full-intersection object.
  • the predetermined information may include at least one of the following: the subrack information of the subrack where the full cross object is located, the slot information of the slot where the full cross object is located, the fiber information of the full cross object, and the endpoints of the full cross object.
  • the changes that occur in the above-described full-crossing object may include at least one of the following: creating a full-cross object, updating a full-cross object, and deleting a full-cross object.
  • the updating module may include: when a change of the full-crossing object is to create a predetermined full-crossing object, generating a predetermined full-crossing object, recording predetermined information of the predetermined full-crossing object; and when the change of the full-crossing object is updating the full-crossing And determining, by the object, the predetermined information of the fully-crossed object that has changed, updating the predetermined information of the full-intersection object; when the change of the full-crossing object is deleting the full-crossing object, determining the deleted full-cross object, deleting the determined The predetermined information of the fully intersected object.
  • the terminal 32 includes the information updating device 34 of any of the above.
  • the following describes an embodiment of the present invention by taking an example of managing an endpoint in an optical transport network OTN.
  • the cross-capacity composed of the endpoint objects that can be cross-connected in an unimpeded manner is abstracted as a full-crossing object, and only the subrack or slot information of all the endpoints participating in the cross-capacity and other limited parameters are used to represent the full-cross object.
  • the source and sink endpoint information that can create cross-connections is no longer exhausted, thereby reducing the amount of data and improving the processing efficiency of the network management program and the database.
  • Name The unique identifier of the fully intersected object.
  • the layer rate is the layer rate of the cross-connection, such as an optical channel data unit (ODU) and an optical channel (Opitcal Channel, abbreviated as OCh).
  • ODU optical channel data unit
  • OCh optical channel
  • Excluded endpoint resources that is, the management scope of a fully-interleaved object, but does not participate in a fully-crossed endpoint list.
  • the endpoint information interface that participates in the full crossover that is, the endpoint information of all the specified layer rates in the full-crossing object, minus the "excluded endpoint resources”, plus the "additional endpoint resources included”.
  • This interface can be queried by different conditions, such as querying the endpoint information in a specified slot or port.
  • the apparatus includes a device information collecting unit 42 (same as the above-described recording module 22) and a cross-capacity information configuration unit 44 (same as above).
  • the determination module 24 and the update module 26) and the cross capacity storage unit 46 Each unit will be described below.
  • the device information collecting unit 42 is configured to acquire relevant information and send the information to the cross-capacity information configuration unit when the information of the sub-rack, the slot, the board, the fiber, and the like related to the cross-capacity in the device information is changed. 44.
  • the cross-capacity information configuration unit 44 analyzes the collected device information, updates the full-intersection object, includes creating, updating, and deleting the full-cross object, and sends the updated full-cross object data to the cross-capacity storage unit for storage.
  • Create a full-crossing object Generate a fully-crossed object with the name, management scope, and layer rate information to be assigned.
  • Update full-crossing objects When some endpoints that are part of a full-crossing object cannot participate in a full crossover or some endpoints that are not part of a full-crossing object can participate in a full crossover through some configuration, the excluded endpoint of the fully-crossed object is updated Information about a resource or other endpoint resource that is included.
  • Delete a full-crossing object Deletes a full-crossing object when the subrack or board is deleted, causing the full-crossing object to no longer exist.
  • Cross Capacity Save Unit Set to save and query full cross object data.
  • FIG. 5 is a flowchart of an OTN cross capacity management method according to an embodiment of the present invention. As shown in FIG. 5, the process includes the following steps:
  • Step S502 starting.
  • step S506 the cross-capacity information configuration unit 44 analyzes whether or not there is a new full-cross subrack. If the determination result is YES, the process goes to step S508, and if the determination result is NO, the process goes to step S510.
  • Step S508 creating a new cross object, for example:
  • the relevant reservation information of the full-cross object is saved.
  • the device information collection unit 42 obtains the device configuration change information.
  • Step S512 updating the full intersection object information according to the change of the full intersection object. For example, if the exclusion point and the inclusion point of the full intersection object "1" need to be changed, the corresponding parameters of updating the full intersection object "1" are as follows:
  • the process goes to step S516, and if the result of the determination is NO, the process goes to step S518.
  • step S5166 the subrack or the board in the management scope of the full cross object is deleted. For example, if the full cross object corresponding to the subrack is "1", the full cross object is deleted; and the full cross object is deleted from the database. "1".
  • the object can also be provided externally.
  • the upper-layer integrated network management system can obtain cross-capacity objects of different vendors for creating cross-vendor paths.
  • modules or steps of the present invention described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein. Perform the steps shown or described, or separate them into individual integrated circuit modules, or Multiple of these modules or steps are fabricated as a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software.
  • the foregoing embodiments of the present invention are applied to the field of communications, and solve the problem that the amount of cross-capacity data in the related art is large, resulting in slow operation and low efficiency of the network management program and the database, thereby reducing the amount of cross-capacity data, improving the network management program, and The effect of database speed and efficiency.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本发明提供了一种信息更新方法、装置及终端,其中,该方法包括:记录全交叉对象的预定信息,其中该全交叉对象包括预定数量的支持无阻交叉连接的源端点和/或宿端点;确定全交叉对象发生的变化;根据全交叉对象发生的变化对该全交叉对象的预定信息进行更新,通过本发明,解决了相关技术中存在的交叉容量数据量大导致网管程序和数据库运行缓慢、效率低的问题,进而达到了减少交叉容量数据量,提高网管程序和数据库运行速度及效率的效果。

Description

信息更新方法、装置及终端 技术领域
本发明涉及通信领域,具体而言,涉及一种信息更新方法、装置及终端。
背景技术
网管创建预定网络时,需要获取该网络中的所有可用资源,例如,当网管创建光传输网络(Optical Transport Network,简称为OTN)路径需要先获取OTN网络中所有的可用资源,包括网元内可以创建但尚未创建交叉连接的源端点和宿端点的信息,即交叉容量信息。然后根据这些可用资源计算出可能的路径路由并创建路径。
目前通用的交叉容量的表示方式有两类,一类是所有可以创建但尚未创建的交叉连接的列表,即穷举出所有可能的交叉连接;另一类是可用于创建交叉连接的源端点列表和宿端点列表,即在第一种方法的基础上对源宿端点做了压缩。比如源端点A1~A10均可以与宿端点Z1~Z10创建交叉连接,用第一类方法有10×10=100条数据;用第2类方法有A端点要有10条数据、Z端点也要有10条数据,另还有1条二者关系的数据。
但随着OTN网络和设备的快速发展,光层和电层的交叉容量均越来越大,尤其是电层光分配网络(Optical Distribution Network,简称为ODN)交叉,上述两种表示方式数据量都太大,导致网管程序和数据库运行缓慢、效率低下。因此,在相关技术中存在着交叉容量数据量大导致网管程序和数据库运行缓慢、效率低的问题。
针对相关技术中存在的交叉容量数据量大导致网管程序和数据库运行缓慢、效率低的问题,目前尚未提出有效的解决方案。
发明内容
本发明实施例提供了一种信息更新方法及装置,以至少解决相关技术中存在的交叉容量数据量大导致网管程序和数据库运行缓慢、效率低的问题。
根据本发明实施例的一个方面,提供了一种信息更新方法,包括:记录全交叉对象的预定信息,其中所述全交叉对象包括预定数量的支持无阻交叉连接的源端点和/或宿端点;确定所述全交叉对象发生的变化;根据所述全交叉对象发生的变化对所述全交叉对象的预定信息进行更新。
进一步地,所述预定信息包括以下至少之一:所述全交叉对象所在的子架的子架信息、所述全交叉对象所在的槽位的槽位信息、所述全交叉对象的连纤信息、所述全交叉对象的端点个数信息、所述全交叉对象的名称信息、所述全交叉对象的管理范围信息、所述全交叉对象的地址信息、所述全交叉对象的层速率信息、所述全交叉对象排除的端点资源信息、所述全交叉对象包含的预定端点资源信息,其中,所述全交叉对象排除的端点资源包括属于所述全交叉对象的管理范围但不参与全交叉的端点,所述全交叉对象包含的预定端点资源包括不属于所述全交叉对象的管理范围但参与全交叉的端点。
进一步地,所述全交叉对象发生的变化包括以下至少之一:创建全交叉对象、更新全交叉对象、删除全交叉对象。
进一步地,根据所述全交叉对象发生的变化对所述全交叉对象的预定信息进行更新包括:当所述全交叉对象的变化为创建预定的全交叉对象时,生成所述预定的全交叉对象,记录所述预定的全交叉对象的预定信息;当所述全交叉对象的变化为更新所述全交叉对象时,确定发生变化的所述全交叉对象的预定信息,更新所述全交叉对象的预定信息;当所述全交叉对象的变化为删除所述全交叉对象时,确定删除的所述全交叉对象,删除确定的所述全交叉对象的预定信息。
根据本发明实施例的另一方面,提供了一种信息更新装置,包括:记录模块,设置为记录全交叉对象的预定信息,其中所述全交叉对象包括预定数量的支持无阻交叉连接的源端点和/或宿端点;确定模块,设置为确定所述全交叉对象发生的变化;更新模块,设置为根据所述全交叉对象发生的变化对所述全交叉对象的预定信息进行更新。
进一步地,所述预定信息包括以下至少之一:所述全交叉对象所在的子架的子架信息、所述全交叉对象所在的槽位的槽位信息、所述全交叉对象的连纤信息、所述全交叉对象的端点个数信息、所述全交叉对象的名称信息、所述全交叉对象的管理范围信息、所述全交叉对象的地址信息、所述全交叉对象的层速率信息、所述全交叉对象排除的端点资源信息、所述全交叉对象包含的预定端点资源信息,其中,所述全交叉对象排除的端点资源包括属于所述全交叉对象的管理范围但不参与全交叉的端点,所述全交叉对象包含的预定端点资源包括不属于所述全交叉对象的管理范围但参与全交叉的端点。
进一步地,所述全交叉对象发生的变化包括以下至少之一:创建全交叉对象、更新全交叉对象、删除全交叉对象。
进一步地,所述更新模块包括:当所述全交叉对象的变化为创建预定的全交叉对象时,生成所述预定的全交叉对象,记录所述预定的全交叉对象的预定信息;当所述全交叉对象的变化为更新所述全交叉对象时,确定发生变化的所述全交叉对象的预定信息,更新所述全交叉对象的预定信息;当所述全交叉对象的变化为删除所述全交叉对象时,确定删除的所述全交叉对象,删除确定的所述全交叉对象的预定信息。
根据本发明实施例的另一方面,提供了一种终端,包括上述任一项所述的装置。
通过本发明实施例,采用记录全交叉对象的预定信息,其中所述全交叉对象包括预定数量的支持无阻交叉连接的源端点和/或宿端点;确定所述全交叉对象发生的变化;根据所述全交叉对象发生的变化对所述全交叉对象的预定信息进行更新,解决了相关技术中存在的交叉容量数据量大导致网管程序和数据库运行缓慢、效率低的问题,进而达到了减少交叉容量数据量,提高网管程序和数据库运行速度及效率的效果。
附图说明
此处所说明的附图用来提供对本发明实施例的进一步理解,构成本申请的一部分,本发明的示意性实施例及其说明用于解释本发明,并不构成对本发明的不当限定。在附图中:
图1是根据本发明实施例的信息更新方法的流程图;
图2是根据本发明实施例的信息更新装置的结构框图;
图3是根据本发明实施例的终端的结构框图;
图4是根据本发明实施例的OTN交叉容量管理的装置结构框图;
图5是根据本发明实施例的OTN交叉容量管理方法流程图。
具体实施方式
下文中将参考附图并结合实施例来详细说明本发明。需要说明的是,在不冲突的情况下,本申请中的实施例及实施例中的特征可以相互组合。
在本实施例中提供了一种信息更新方法,图1是根据本发明实施例的信息更新方法的流程图,如图1所示,该流程包括如下步骤:
步骤S102,记录全交叉对象的预定信息,其中该全交叉对象包括预定数量的支持无阻交叉连接的源端点和/或宿端点;
步骤S104,确定全交叉对象发生的变化;
步骤S106,根据该全交叉对象发生的变化对该全交叉对象的预定信息进行更新。
通过上述步骤,采用将一定数量的可以无阻地进行交叉连接的端点组成的交叉容量抽象为一个全交叉对象,通过管理该全交叉对象实现对该全交叉对象下的源端点和/或宿端点的管理,解决了相关技术中存在的交叉容量数据量大导致网管程序和数据库运行缓慢、效率低的问题,进而达到了减少交叉容量数据量,提高网管程序和数据库运行速度及效率的效果。
在对该全交叉对象进行管理时,可以首先确定与该全交叉对象相关的预定信息,在一个可选的实施例中,该全交叉对象的预定信息可以包括以下至少之一:全交叉对象所在的子架的子架信息、全交叉对象所在的槽位的槽位信息、全交叉对象的连纤信息、全交叉对象的端点个数信息、全交叉对象的名称信息、全交叉对象的管理范围信息、全交叉对象的地址信息、全交叉对象的层速率信息、全交叉对象排除的端点资源信息、全交叉对象包含的预定端点资源信息,其中,该全交叉对象排除的端点资源包括属于该全交叉对象的管理范围但不参与全交叉的端点,该全交叉对象包含的预定端点资源包括不属于该全交叉对象的管理范围但参与全交叉的端点。利用该全交叉对象的上述预定信息来实现对该全交叉对象下的源端点和/或宿端点的管理,从而无需穷举所有可创建交叉连接的源、宿端点信息,从而减少数据量,提高网管程序和数据库的处理效率。
其中,全交叉对象的变化可以为多种类型的变化,在一个可选的实施例中,上述全交叉对象发生的变化可以包括以下至少之一:创建全交叉对象、更新全交叉对象、删除全交叉对象。从而依据不同的变化对该全交叉对象的预定信息进行相关处理。
在一个可选的实施例中,根据上述全交叉对象发生的变化对该全交叉对象的预定信息进行更新可以包括:当全交叉对象的变化为创建预定的全交叉对象时,生成预定的全交叉对象,记录该预定的全交叉对象的预定信息;当全交叉对象的变化为更新该全交叉对象时,确定发生变化的全交叉对象的预定信息,更新该全交叉对象的预定信息;当全交叉对象的变化为删除该全交叉对象时,确定删除的全交叉对象,删除确定的该全交叉对象的预定信息。
在本实施例中还提供了一种信息更新装置,该装置用于实现上述实施例及优选实施方式,已经进行过说明的不再赘述。如以下所使用的,术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现,但是硬件,或者软件和硬件的组合的实现也是可能并被构想的。
图2是根据本发明实施例的信息更新装置的结构框图,如图2所示,该装置包括记录模块22、确定模块24和更新模块26,下面对该装置进行说明。
记录模块22,设置为记录全交叉对象的预定信息,其中该全交叉对象包括预定数量的支持无阻交叉连接的源端点和/或宿端点;确定模块24,连接至上述记录模块22,设置为确定全交叉对象发生的变化;更新模块26,连接至上述确定模块24,设置为根据全交叉对象发生的变化对该全交叉对象的预定信息进行更新。
其中,上述预定信息可以包括以下至少之一:全交叉对象所在的子架的子架信息、全交叉对象所在的槽位的槽位信息、全交叉对象的连纤信息、全交叉对象的端点个数信息、全交叉对象的名称信息、全交叉对象的管理范围信息、全交叉对象的地址信息、全交叉对象的层速率信息、全交叉对象排除的端点资源信息、全交叉对象包含的预定端点资源信息,其中,该全交叉对象排除的端点资源包括属于全交叉对象的管理范围但不参与全交叉的端点,该全交叉对象包含的预定端点资源包括不属于全交叉对象的管理范围但参与全交叉的端点。
上述全交叉对象发生的变化可以包括以下至少之一:创建全交叉对象、更新全交叉对象、删除全交叉对象。
上述更新模块可以包括:当全交叉对象的变化为创建预定的全交叉对象时,生成预定的全交叉对象,记录该预定的全交叉对象的预定信息;当全交叉对象的变化为更新该全交叉对象时,确定发生变化的该全交叉对象的预定信息,更新全交叉对象的预定信息;当该全交叉对象的变化为删除该全交叉对象时,确定删除的该全交叉对象,删除确定的该全交叉对象的预定信息。
图3是根据本发明实施例的终端的结构框图,如图3所示,该终端32包括上述任一项的信息更新装置34。
下面以管理光传输网络OTN中的端点为例对本发明实施例进行说明。
基于OTN设备的硬件特点,在OTN网络中,互相之间可以创建交叉连接的端点都是限定在n(n>=1)块单板之间或一个子架内部的,基于此,可用将能够在一定的管理 范围内可以无阻地进行交叉连接的端点对象组成的交叉容量抽象为一个全交叉对象,仅用参与交叉容量的所有端点所在的子架或槽位信息以及其他有限几个参数来表示此全交叉对象,不再穷举出所有可创建交叉连接的源、宿端点信息,从而减少数据量,提高网管程序和数据库的处理效率。
所抽象成的全交叉对象可以具有以下特性:
名称:即全交叉对象的唯一标识。
范围:即全交叉对象的交叉范围,基于OTN设备的硬件特性,可能是一个子架是一个全交叉对象,或n(n>=1)块单板之间可以全交叉,是一个全交叉对象。
层速率:即交叉连接的层速率,例如光数据单元(Optical channel Data Unit,简称为ODU)、光通道(Opitcal Channel,简称为OCh)。
排除的端点资源:即属于全交叉对象的管理范围,但却不参与全交叉的端点列表。
包含的其他端点资源:即不属于全交叉的管理范围,但却参与全交叉的端点列表。
查询参与全交叉的端点信息接口:即全交叉对象内所有指定层速率的端点信息,减去“排除的端点资源”,再加上“包含的其他端点资源”。此接口可以支持按不同条件查询,比如查询指定槽位或端口下的端点信息。
查询参与全交叉的端点统计信息接口:同上,但不需要返回具体端点信息,返回个数信息即可,以方便用户使用。
图4是根据本发明实施例的OTN交叉容量管理的装置结构框图,如图4所示,该装置包括设备信息收集单元42(同上述的记录模块22)、交叉容量信息配置单元44(同上述的确定模块24和更新模块26)以及交叉容量保存单元46。下面对各单元进行说明。
设备信息收集单元42:当设备信息中与交叉容量有关的子架、槽位、单板、连纤等信息有变更时,该设备信息收集单元42负责获取相关信息并发送给交叉容量信息配置单元44。
交叉容量信息配置单元44:分析收集到的设备信息,更新全交叉对象,包括创建、更新、删除全交叉对象,并将更新后的全交叉对象数据发往交叉容量保存单元进行保存。
创建全交叉对象:生成一个全交叉对象,“名称、管理范围、层速率”信息需要赋值。
更新全交叉对象:当通过某些配置导致属于全交叉对象的某些端点不能参与全交叉或某些不属于全交叉对象的端点可以参与全交叉时,则更新该全交叉对象的“排除的端点资源”或“包含的其他端点资源”的信息。
删除全交叉对象:当删除子架或单板导致全交叉对象不再存在时,删除全交叉对象。
交叉容量保存单元:设置为保存和查询全交叉对象数据。
图5是根据本发明实施例的OTN交叉容量管理方法流程图,如图5所示,该流程包括如下步骤:
步骤S502,开始。
步骤S504,设备信息收集单元42获取设备配置变更信息,例如,设备新添加了一个ODU集中式全交叉子架,地址为”ME{1},EQ={/r=0/sh=1}”。
步骤S506,交叉容量信息配置单元44分析是否有新增的全交叉子架,在判断结果为是时转至步骤S508,判断结果为否时转至步骤S510。
步骤S508,新建一个全交叉对象,例如:
名称:“1”,唯一即可;
范围:“ME{1},EQ={/r=0/sh=1}”;
层速率:“ODU”;
排除的端点资源:空;
包含的其他端点资源:空;
在创建完该全交叉对象后,保存该全交叉对象的相关预定信息。
步骤S510,设备信息收集单元42获取设备配置变更信息,比如设备配置了业务单板级联,已有全交叉子架“1”上的业务单板的端口“ME{1},EQ={/r=0/sh=1},PTP={454_1}”与另一子架的业务单板的端口“ME{1},EQ={/r=0/sh=2}, PTP={453_1}”之间建了连纤;交叉容量信息配置单元分44分析是否有新增的全交叉子架,分析结果为否;则继续判断是否有配置导致已有交叉子架变更,在判断结果为是时,转至步骤S512,判断结果为否时,转至步骤S514。
步骤S512,根据全交叉对象的变化更新全交叉对象信息,例如,全交叉对象“1”的排除点和包含点需要变化,则更新全交叉对象“1”的对应参数如下:
排除的端点资源:“ME{1},EQ={/r=0/sh=1},PTP={454_1},CTP={/odu2=1}”;
包含的其他端点资源:“ME{1},EQ={/r=0/sh=2},PTP={454_1},CTP={/odu4=1/odu2=1}”;
在更新全交叉对象信息之后,保存该全交叉对象的信息。
步骤S514,设备信息收集单元42获取设备相关信息,比如设备删除了地址为“ME{1},EQ={/r=0/sh=1}”的全交叉子架;交叉容量信息配置单元44分析是否有新增的全交叉子架,分析结果为否;则继续分析是否有配置导致已有交叉子架变更,分析结果为否;则继续判断是否某全交叉对象管理范围内的子架或单板全被删除,在判断结果为是时,转至步骤S516,判断结果为否时,转至步骤S518。
步骤S516,某全交叉对象管理范围内的子架或单板全被删除,例如,该子架对应的全交叉对象为“1”,则删除该全交叉对象;从数据库中删除此全交叉对象“1”。
步骤S518,保存全交叉对象信息。
步骤S520,结束。
在本发明的上述各实施例中,不论OTN交叉容量的源宿端口的个数有多少,始终用一个全交叉对象来表示,减小了交叉容量的存储空间,解决了OTN交叉容量数据量大,网管程序和数据库运行缓慢、效率低的问题。
该对象也可以对外提供,比如上层综合网管可以获取不同厂商的交叉容量对象用于跨厂商的路径的创建。
显然,本领域的技术人员应该明白,上述的本发明的各模块或各步骤可以用通用的计算装置来实现,它们可以集中在单个的计算装置上,或者分布在多个计算装置所组成的网络上,可选地,它们可以用计算装置可执行的程序代码来实现,从而,可以将它们存储在存储装置中由计算装置来执行,并且在某些情况下,可以以不同于此处的顺序执行所示出或描述的步骤,或者将它们分别制作成各个集成电路模块,或者将 它们中的多个模块或步骤制作成单个集成电路模块来实现。这样,本发明不限制于任何特定的硬件和软件结合。
以上所述仅为本发明的优选实施例而已,并不用于限制本发明,对于本领域的技术人员来说,本发明可以有各种更改和变化。凡在本发明的精神和原则之内,所作的任何修改、等同替换、改进等,均应包含在本发明的保护范围之内。
工业实用性
上述的本发明实施例,应用于通信领域,解决了相关技术中存在的交叉容量数据量大导致网管程序和数据库运行缓慢、效率低的问题,进而达到了减少交叉容量数据量,提高网管程序和数据库运行速度及效率的效果。

Claims (9)

  1. 一种信息更新方法,包括:
    记录全交叉对象的预定信息,其中所述全交叉对象包括预定数量的支持无阻交叉连接的源端点和/或宿端点;
    确定所述全交叉对象发生的变化;
    根据所述全交叉对象发生的变化对所述全交叉对象的预定信息进行更新。
  2. 根据权利要求1所述的方法,其中,所述预定信息包括以下至少之一:
    所述全交叉对象所在的子架的子架信息、所述全交叉对象所在的槽位的槽位信息、所述全交叉对象的连纤信息、所述全交叉对象的端点个数信息、所述全交叉对象的名称信息、所述全交叉对象的管理范围信息、所述全交叉对象的地址信息、所述全交叉对象的层速率信息、所述全交叉对象排除的端点资源信息、所述全交叉对象包含的预定端点资源信息,其中,所述全交叉对象排除的端点资源包括属于所述全交叉对象的管理范围但不参与全交叉的端点,所述全交叉对象包含的预定端点资源包括不属于所述全交叉对象的管理范围但参与全交叉的端点。
  3. 根据权利要求1所述的方法,其中,所述全交叉对象发生的变化包括以下至少之一:
    创建全交叉对象、更新全交叉对象、删除全交叉对象。
  4. 根据权利要求3所述的方法,其中,根据所述全交叉对象发生的变化对所述全交叉对象的预定信息进行更新包括:
    当所述全交叉对象的变化为创建预定的全交叉对象时,生成所述预定的全交叉对象,记录所述预定的全交叉对象的预定信息;
    当所述全交叉对象的变化为更新所述全交叉对象时,确定发生变化的所述全交叉对象的预定信息,更新所述全交叉对象的预定信息;
    当所述全交叉对象的变化为删除所述全交叉对象时,确定删除的所述全交叉对象,删除确定的所述全交叉对象的预定信息。
  5. 一种信息更新装置,包括:
    记录模块,设置为记录全交叉对象的预定信息,其中所述全交叉对象包括预定数量的支持无阻交叉连接的源端点和/或宿端点;
    确定模块,设置为确定所述全交叉对象发生的变化;
    更新模块,设置为根据所述全交叉对象发生的变化对所述全交叉对象的预定信息进行更新。
  6. 根据权利要求5所述的装置,其中,所述预定信息包括以下至少之一:
    所述全交叉对象所在的子架的子架信息、所述全交叉对象所在的槽位的槽位信息、所述全交叉对象的连纤信息、所述全交叉对象的端点个数信息、所述全交叉对象的名称信息、所述全交叉对象的管理范围信息、所述全交叉对象的地址信息、所述全交叉对象的层速率信息、所述全交叉对象排除的端点资源信息、所述全交叉对象包含的预定端点资源信息,其中,所述全交叉对象排除的端点资源包括属于所述全交叉对象的管理范围但不参与全交叉的端点,所述全交叉对象包含的预定端点资源包括不属于所述全交叉对象的管理范围但参与全交叉的端点。
  7. 根据权利要求5所述的装置,其中,所述全交叉对象发生的变化包括以下至少之一:
    创建全交叉对象、更新全交叉对象、删除全交叉对象。
  8. 根据权利要求7所述的装置,其中,所述更新模块包括:
    当所述全交叉对象的变化为创建预定的全交叉对象时,生成所述预定的全交叉对象,记录所述预定的全交叉对象的预定信息;
    当所述全交叉对象的变化为更新所述全交叉对象时,确定发生变化的所述全交叉对象的预定信息,更新所述全交叉对象的预定信息;
    当所述全交叉对象的变化为删除所述全交叉对象时,确定删除的所述全交叉对象,删除确定的所述全交叉对象的预定信息。
  9. 一种终端,包括权利要求5至8中任一项所述的装置。
PCT/CN2015/081280 2014-12-03 2015-06-11 信息更新方法、装置及终端 WO2016086636A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410727682.6A CN105721183A (zh) 2014-12-03 2014-12-03 信息更新方法、装置及终端
CN201410727682.6 2014-12-03

Publications (1)

Publication Number Publication Date
WO2016086636A1 true WO2016086636A1 (zh) 2016-06-09

Family

ID=56090934

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/081280 WO2016086636A1 (zh) 2014-12-03 2015-06-11 信息更新方法、装置及终端

Country Status (2)

Country Link
CN (1) CN105721183A (zh)
WO (1) WO2016086636A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108462535A (zh) * 2017-02-20 2018-08-28 中兴通讯股份有限公司 一种网元级光层交叉容量管理方法及装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050254421A1 (en) * 2002-11-19 2005-11-17 Fujitsu Limited Connection management system and method for large-scale optical networks
WO2009100575A1 (zh) * 2008-02-04 2009-08-20 Zte Corporation 有阻交叉网络实现源路由的方法和装置
CN102325049A (zh) * 2011-09-19 2012-01-18 烽火通信科技股份有限公司 网管对多种电信设备单盘的端口统一配置和管理的方法
CN102547494A (zh) * 2012-02-20 2012-07-04 烽火通信科技股份有限公司 一种端到端光交叉连接配置的方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050254421A1 (en) * 2002-11-19 2005-11-17 Fujitsu Limited Connection management system and method for large-scale optical networks
WO2009100575A1 (zh) * 2008-02-04 2009-08-20 Zte Corporation 有阻交叉网络实现源路由的方法和装置
CN102325049A (zh) * 2011-09-19 2012-01-18 烽火通信科技股份有限公司 网管对多种电信设备单盘的端口统一配置和管理的方法
CN102547494A (zh) * 2012-02-20 2012-07-04 烽火通信科技股份有限公司 一种端到端光交叉连接配置的方法及装置

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108462535A (zh) * 2017-02-20 2018-08-28 中兴通讯股份有限公司 一种网元级光层交叉容量管理方法及装置
CN108462535B (zh) * 2017-02-20 2022-08-30 中兴通讯股份有限公司 一种网元级光层交叉容量管理方法及装置

Also Published As

Publication number Publication date
CN105721183A (zh) 2016-06-29

Similar Documents

Publication Publication Date Title
US10033623B2 (en) Multithreaded system and method for establishing network connections
CN108989066B (zh) 设备管理方法及装置
US9491086B2 (en) Distributed network planning systems and methods
EP3682597B1 (en) Modeling access networks as trees in software-defined network controllers
WO2015139533A1 (zh) 一种网管对混合组网业务的反算方法
CN107547283B (zh) 分布式聚合组的管理方法及装置
CN101459469B (zh) 网元设备的光层业务调度方法及网管控制系统
US10382924B2 (en) M2M node management method and apparatus, and computer storage medium
CN102377679A (zh) 一种在fttx接入系统中实现链路发现和管理的方法
WO2019196844A1 (zh) 一种ason业务模型的实现方法、装置、设备及存储介质
US11757716B2 (en) Network management apparatus, method, and program
CN105491507A (zh) 一种m2m中管理应用资源的方法和注册节点
CN105491620A (zh) 一种m2m中管理应用资源的方法和注册节点
WO2016086636A1 (zh) 信息更新方法、装置及终端
US8855015B2 (en) Techniques for generic pruning in a trill network
CN115587097A (zh) 一种目录节点信息的查询方法、装置、设备及存储介质
CN113055490B (zh) 数据的存储方法及装置
JP5782393B2 (ja) ネットワークリソース分散管理方法およびプログラム
EP2930883B1 (en) Method for the implementation of network functions virtualization of a telecommunications network providing communication services to subscribers, telecommunications network, program and computer program product
CN107959628B (zh) 业务路由搜索方法和系统
CN107592207B (zh) 一种网管业务数据管理方法和网管业务数据管理装置
CN106330476B (zh) 一种获取用户侧端口保证带宽的方法和网络监测系统
CN108881407A (zh) 一种信息处理方法及装置
CN110880979B (zh) 光网络终端配置方法、光线路终端、光网络系统及介质
WO2017000600A1 (zh) 告警查询方法及装置、光传输网络管理系统

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15864810

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 15864810

Country of ref document: EP

Kind code of ref document: A1