WO2017128962A1 - 一种业务标签规划方法及装置 - Google Patents

一种业务标签规划方法及装置 Download PDF

Info

Publication number
WO2017128962A1
WO2017128962A1 PCT/CN2017/071084 CN2017071084W WO2017128962A1 WO 2017128962 A1 WO2017128962 A1 WO 2017128962A1 CN 2017071084 W CN2017071084 W CN 2017071084W WO 2017128962 A1 WO2017128962 A1 WO 2017128962A1
Authority
WO
WIPO (PCT)
Prior art keywords
service
planned
planning
devices
tags
Prior art date
Application number
PCT/CN2017/071084
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 WO2017128962A1 publication Critical patent/WO2017128962A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network

Definitions

  • the present disclosure relates to the field of communications, for example, to a service tag planning apparatus and method.
  • PTN Packet Transport Network
  • PNT Packet Transport Network
  • the outgoing service label of the A device must be the same as the incoming service label of the B device, and the same for other devices; however, the range of service tags that can be used by different devices is not necessarily the same.
  • the planner pre-designs the service tag exchange table. Because the service tag is often large, the number of tasks that need to be compared is large, and when it is decided to use A on a certain service.
  • the B device may have used the service label. As mentioned above, for the service of the A and B devices, the outgoing service label of the A device must be the same as the incoming service label of the B device. Creating conflicts creates inconvenience to planners, is prone to confusion and planning errors, and is inefficient.
  • the main technical problem to be solved by the present disclosure is to provide a service label planning method and device, which solves the problem that the manual labeling of the service label in the related art is inefficient and the chaos and errors are likely to occur when the service label is planned.
  • the present disclosure provides a service label planning method, which is applied to a packet transport network, and includes:
  • the number of the equipment to be planned is at least two;
  • the device to be planned is serviced according to the principle of culling the union of the unavailable service tags of the devices to be planned from the collection of the full range of service tags of the devices to be planned.
  • Label planning includes:
  • the device to be planned is serviced according to the principle of culling the union of the unavailable service tags of the devices to be planned from the collection of the full range of service tags of the devices to be planned.
  • Label planning includes:
  • the respective unavailable service tags are removed from the full-range service tags of each device to be planned, and the service tags available for each device to be planned are obtained.
  • the unavailable service tag includes: a reserved service tag and an occupied service tag.
  • the present disclosure also provides a service tag planning apparatus, which is applied to a packet transport network, and includes:
  • a module to be planned which is configured to determine a device to be planned, and the number of devices to be planned is at least two;
  • the obtaining module is configured to obtain a full-range service label and an unavailable service label of each device to be planned, where the full-range service label is a set of all service labels allowed to be existed by the device to be planned.
  • a planning module configured to perform service label planning on the to-be-planned device according to the principle of culling the union of the unavailable service labels of the to-be-planned devices from the intersection of the full-range service labels of the devices to be planned, Obtaining the final available service tags of the devices to be planned.
  • the planning module includes:
  • a first calculation sub-module configured to calculate an intersection of the full-range service tags of the devices to be planned
  • the first processing sub-module is configured to determine whether the intersection is an empty set. When the result of the determining is that the intersection is an empty set, the current service label planning is terminated.
  • the first processing sub-module is further configured to: when the result of the determining is that the intersection is not an empty set, calculate a union of the unavailable service tags of the to-be-planned devices, And removing the aggregate from the intersection to obtain a final available service label of each device to be planned.
  • the planning module includes:
  • the second processing sub-module is configured to respectively remove the respective unavailable service tags from the full-range service tags of each device to be planned, and obtain the respective service tags of each device to be planned;
  • the second calculation sub-module is configured to calculate an intersection of the respective service tags of the devices to be planned, where the intersection is a final available service tag of each device to be planned.
  • the unavailable service tag includes: a reserved service tag and an occupied service tag.
  • Embodiments of the present disclosure also provide a non-transitory computer readable storage medium storing computer executable instructions arranged to perform the above method.
  • An embodiment of the present disclosure further provides an electronic device, including:
  • At least one processor At least one processor
  • the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to cause the at least one processor to perform the method described above.
  • the utility model has the beneficial effects that the present disclosure provides a service label planning method and device,
  • the device to be planned is configured on the device to be planned, and the device to be planned is obtained. All the service tags that are allowed to exist; then, according to the principle of eliminating the union of the unavailable service tags of the devices to be planned from the intersection of the full range of service tags of the devices to be planned, planning the service tags of the planned devices to obtain the final available Business label.
  • the entire process can be automated and can be completed by the business label planning device, reducing manual workload and improving work efficiency, while effectively avoiding planning confusion and errors.
  • FIG. 1 is a flowchart of a service label planning method according to an embodiment of the present disclosure
  • FIG. 2 is a flowchart of an implementation manner of a service label planning method according to an embodiment of the present disclosure
  • FIG. 3 is a flowchart of another implementation manner of a service label planning method according to an embodiment of the present disclosure
  • FIG. 4 is a schematic structural diagram of a service label planning apparatus according to an embodiment of the present disclosure.
  • FIG. 5 is a schematic structural diagram of a planning module of a service label planning apparatus according to an embodiment of the present disclosure
  • FIG. 6 is another schematic structural diagram of a planning module of a service label planning apparatus according to an embodiment of the present disclosure.
  • FIG. 7 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure.
  • Embodiment 1 is a diagrammatic representation of Embodiment 1:
  • This embodiment provides a service label planning method, which has the advantages of high planning efficiency and high planning quality in comparison with the method of manually planning a service label in the related art.
  • FIG. 1 For the content of the method, refer to FIG. 1 , including:
  • S101 Determine a device to be planned that needs to perform service label planning
  • S103 Perform service label planning on the to-be-planned devices according to the principle of removing the union of the unavailable service labels of the devices to be planned from the intersection of the full-range service labels of the devices to be planned.
  • the number of devices to be planned that need to be determined cannot be less than two, for example, two, three, four or more.
  • the device needs to perform the planning of the service label.
  • the service needs to take data from device A.
  • the data is transmitted to the device B.
  • the relationship between these devices to be planned is not limited to the direct connection relationship like the above example, and may be indirectly connected or other relationships. Therefore, when determining the equipment to be planned, the personnel who need to use the disclosed service label planning method should pay attention to the equipment to be planned according to their own needs.
  • the full range and unavailable service tags of the devices to be planned are also obtained, and the process proceeds to S102.
  • the so-called full-range service tag is a set of all service tags allowed on a device. For example, if any tag within the range of 1-1000 can exist on the device A, then 1-1000 is the full-range service tag of the device A.
  • Unusable business tags are business tags that cannot be used during business tag planning. The so-called failure to use, that is, the use of these tags may cause some errors.
  • the unavailable service tags include reserved service tags and occupied service tags; the reserved tags include device reserved tags, OAM occupied tags, protocol occupied tags, and other functions fixed-use tags; and occupied service tags are those that are in progress All tags that have been occupied before the service tag planning, for example, the tags 200-250 are already occupied by a certain service before the service tag planning, then 200-250 belongs to the occupied service tag.
  • the service label of each device to be planned can be planned, and step S103 is performed.
  • step S102 it is obvious that only To remove the unavailable service tags from the full-range service tags, you can obtain the service tags that can be used. In this solution, you also need to consider some connections between the devices to be planned. Therefore, in this method, The service labeling process is performed on each device to be planned, and the final available service label of each device to be planned is obtained by removing the union of the unavailable service tags of the devices to be planned from the intersection of the service cards of the devices to be planned.
  • the service labeling process is performed on each device to be planned according to the rule that the available service tags are calculated by removing the unavailable service tags from the full-range service tags, thereby calculating the final available service tags of the devices to be planned.
  • Figure 2 for the process, including:
  • S201 Calculate an intersection of the full range of service labels of each device to be planned
  • S204 Calculate a union of service tags that are not available for each device to be planned, and remove the union from the centralized collection to obtain a final available service tag of the device to be planned.
  • the devices to be planned there are at least two devices to be planned, which can be more.
  • the administrator or the user of the method can be prompted to end the reason, because usually the full range of service tags of the device to be planned may be modified for the person who performs the business tag planning, so it may even be reminded to modify the full range.
  • the scope of the business label to facilitate business label planning.
  • intersection If the intersection is not an empty set, calculate the union of the unavailable service tags of the devices to be planned, and then calculate the available service tags according to the principle of removing the unavailable service tags from the full-range service tags, from the full range of each device to be planned.
  • the intersection of the service tags eliminates the union of the unavailable service tags of the devices to be planned, and the rest is the final available service tags of the required devices to be planned.
  • the service label planning method can be used to plan all the devices to be planned at the same time.
  • the labels of all the devices to be planned can be the same.
  • the planned service labels are relatively stable.
  • the device to be planned is device A, device B, and device C.
  • the full-range service label of device A is 1-1000
  • the full-range service label of device B is 500-15000.
  • the range service label is 100-15000.
  • Prepare A The unavailable service label is 200-700
  • the unavailable service label of device B is 500-600
  • the unavailable service label of device C is 100-200.
  • the intersection of the full range of service tags for device A, device B, and device C is 500-10000; then, the computing device A, device B, and device C are not available.
  • the union of service tags should be 100-700.
  • the aggregation of device A, device B, and device C unavailable service tags is removed from the intersection of device A, device B, and device C. -10000, then 700-10000 is the final available service label for Device A, Device B, and Device C.
  • the service labeling process is performed on each device to be planned according to the rule that the available service tags are calculated by removing the unavailable service tags from the full-range service tags, thereby calculating the final available service tags of the devices to be planned.
  • Figure 3 for the process, including:
  • S301 Excluding the unavailable service label of the to-be-planned device from the full-range service label of each device to be planned;
  • S302 Calculate an intersection of respective available service tags of each device to be planned.
  • each device to be planned After obtaining the full-range service label and the unavailable service label of each device to be planned, each device to be planned has a corresponding full-range service label and an unavailable service label, and the full-range service label corresponding to each device to be planned
  • the respective available service tags of the devices to be planned can be obtained by removing the corresponding unavailable service tags; the respective available service tags are also used on the device to be planned, regardless of possible conflicts with other devices. Business label.
  • the device to be planned After determining the device to be planned, you need to plan the service label of one of the devices to be planned. This method is convenient. For example, device A and device B are adjacent to each other, and device A and device C are also adjacent. Considering the relationship between the service tag and the incoming service tag between adjacent devices, device A may eventually need to calculate device A, device B, and The intersection of the respective available service tags of the three devices of device C. For device B, it may only be necessary to calculate the intersection of the respective service tags of device A and device B. Therefore, when a service tag is planned for a single device, the device to be planned can be selected first, and the method in this embodiment is used to perform service tag planning.
  • the foregoing is a process of performing a service label planning.
  • the service may be set in advance after obtaining the final available service label of the equipment to be planned.
  • Preferred business label which can be achieved in planning After that, you can automatically select and configure the service label according to the settings to complete the automatic configuration. After the automatic configuration is completed, the steps of the above label planning method can be repeated, and multiple planning is performed.
  • the service label planning apparatus 4 includes: a selecting module 41, an obtaining module 42 and a planning module 43.
  • the selecting module 41 is configured to determine that a service label planning is required.
  • the number of the devices to be planned is at least two;
  • the obtaining module 42 is configured to obtain the full range of service tags and the unavailable service tags of the devices to be planned respectively, and the full range of service tags refers to the allowed devices to be planned.
  • the planning module 43 is configured to perform the service tag planning on the planning device according to the principle of eliminating the union of the unavailable service tags of the devices to be planned from the intersection of the full range of service tags of the devices to be planned. Get the final available service tags for each device to be planned.
  • the planning module 43 includes a first computing submodule 431 and a first processing submodule 432.
  • the first computing submodule 431 is configured to calculate a full range of services of the devices to be planned.
  • the intersection of the labels; the first processing sub-module 432 is configured to determine whether the intersection is an empty set, and when the result of the determination is that the intersection is an empty set, the current service label planning is terminated.
  • the first processing sub-module 432 is further configured to: when the determination result is that the intersection is not an empty set, calculate a union of the unavailable service tags of the to-be-planned devices, and remove the union from the intersection.
  • the final available service label of each device to be planned is further configured to: when the determination result is that the intersection is not an empty set, calculate a union of the unavailable service tags of the to-be-planned devices, and remove the union from the intersection. The final available service label of each device to be planned.
  • the planning module 43 includes a second processing sub-module 433 and a second processing sub-module 434, which are configured to respectively obtain the full range of each device to be planned.
  • the service tag removes the respective unavailable service tags, and obtains the service tags available to each device to be planned.
  • the second process sub-module 434 is configured to calculate the intersection of the service tags of the devices to be planned, and the intersection is the devices to be planned. The final available business tag.
  • Embodiments of the present disclosure also provide a non-transitory computer readable storage medium storing computer executable instructions arranged to perform the method of any of the above embodiments.
  • the embodiment of the present disclosure further provides a schematic structural diagram of an electronic device.
  • the electronic device includes:
  • At least one processor 70 which is exemplified by a processor 70 in FIG. 7; and a memory 71, may further include a communication interface 72 and a bus 73. among them, The processor 70, the communication interface 72, and the memory 71 can communicate with each other via the bus 73. Communication interface 72 can be used for information transfer. Processor 70 can invoke logic instructions in memory 71 to perform the methods of the above-described embodiments.
  • logic instructions in the memory 71 described above may be implemented in the form of a software functional unit and sold or used as a stand-alone product, and may be stored in a computer readable storage medium.
  • the memory 71 is a computer readable storage medium, and can be used to store a software program, a computer executable program, a program instruction/module corresponding to the method in the embodiment of the present disclosure.
  • the processor 70 executes the function application and the data processing by executing the software program, the instruction and the module stored in the memory 71, that is, the service label planning method in the above method embodiment.
  • the memory 71 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may store data created according to usage of the terminal device, and the like. Further, the memory 71 may include a high speed random access memory, and may also include a nonvolatile memory.
  • the technical solution of the embodiments of the present disclosure may be embodied in the form of a software product stored in a storage medium, including one or more instructions for causing a computer device (which may be a personal computer, a server, or a network) The device or the like) performs all or part of the steps of the method described in the embodiments of the present disclosure.
  • the foregoing storage medium may be a non-transitory storage medium, including: a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and the like.
  • each module of the service tag planning apparatus in this embodiment performs the service tag planning method of the present disclosure, and each module is used to execute each step in the service tag planning method, so each step in the service tag planning method Features are also available for business label planning devices.
  • the device to be planned for the service label planning needs to be configured first, and the device to be planned has at least two devices; then, the full range label and the unavailable service label of each device to be planned are respectively obtained. , the full range of labels is allowed even on the device to be planned All the service tags in the system; then, according to the principle of eliminating the union of the unavailable service tags of the devices to be planned from the intersection of the full range of service tags of the devices to be planned, the service tags of the planned devices are planned to obtain the final available services. label.
  • the service tag planning device no manual manual planning of the service tag exchange table is required, so that many errors caused by many human factors can be avoided, for example, due to the carelessness of the service tag planner, the planned tags conflict.
  • the planned label is a reserved label or even an occupied label. It can reduce the labor workload and improve work efficiency, while effectively avoiding planning confusion and wrong technical effects.
  • modules or steps of the present disclosure can be implemented by a general computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in a storage medium (ROM/RAM, diskette, optical disk) by a computing device, and in some cases The steps shown or described may be performed in an order different than that herein, or they may be separately fabricated into individual integrated circuit modules, or a plurality of the modules or steps may be implemented as a single integrated circuit module. Therefore, the present disclosure is not limited to any specific combination of hardware and software.
  • the service label planning method and device provided by the disclosure solve the problem that the manual labeling of the service label is inefficient, and the planning is prone to confusion and error during the planning; thereby reducing the manual workload, improving the work efficiency, and effectively avoiding The effect of planning confusion and error.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本公开公开了一种业务标签规划方法及装置先确定需要进行业务标签规划的待规划设备，并且该待规划设备至少有两个；然后分别获取各个待规划设备的全范围标签和不可用业务标签，该全范围标签也即是在待规划设备上允许存在的所有业务标签；然后依照从各待规划设备的全范围业务标签的交集中剔除各待规划设备的不可用业务标签的并集的原则来对待规划设备的业务标签进行规划获取最终的可用业务标签。整个流程可以由业务标签规划装置来自动执行，解决相关技术中因人工手动规划业务标签，效率低下，规划时容易出现混乱和错误的问题；从而达到减少人工的工作量，提高工作效率，同时有效的避免了规划混乱和错误的效果。

Description

一种业务标签规划方法及装置 技术领域
本公开涉及通信领域，例如涉及一种业务标签规划装置及方法。
背景技术
PTN(Packet Transport Network，分组传送网)，具有更低的总体使用成本，同时秉承光传输的传统优势，包括高可用性和可靠性、高效的带宽管理机制和流量工程、便捷的网管、可扩展、较高的安全性等，因此被广泛应用。在PNT网络中往往需要承载基于标签交换协议的PNT业务，所以需要给承载这些业务的设备配置业务标签；但是由于承载相同业务标签的设备某些设备上的业务标签之间需要满足某些条件，例如，对于穿通A、B设备的业务，A设备的出业务标签必须与B设备的入业务标签相同，对于其他设备亦是如此；但是不同设备的可以使用的业务标签的范围却不一定相同。
在相关技术中，往往需要人工手动进行配置业务标签，规划人员预先设计业务标签交换表，因为业务标签常常数量大，所以需要比较查阅的任务量繁多，而且当针对某个业务决定在A上使用某个业务标签时，B设备可能已经使用过该业务标签，由于前面说过对于穿通A、B设备的业务，A设备的出业务标签必须与B设备的入业务标签相同，所以此时就会造成冲突，给规划人员造成许多不便，同时容易出现混乱和规划错误并且规划效率低下。
发明内容
本公开要解决的主要技术问题是，提供一种业务标签规划方法及装置，解决相关技术中因人工手动规划业务标签，效率低下，进行业务标签规划时容易出现混乱和错误的问题。
为解决上述技术问题，本公开提供一种业务标签规划方法，应用于分组传送网，包括：
确定需要进行业务标签规划的待规划设备，所述待规划设备的数量为至少两个；
分别获取各待规划设备的全范围业务标签和不可用业务标签，所述全范围业务标签为所述待规划设备允许存在的所有业务标签的集合；
依照从所述各待规划设备的全范围业务标签的交集中剔除所述各待规划设备的不可用业务标签的并集的原则对所述各待规划设备进行业务标签规划，得到所述各待规划设备的最终可用业务标签。
在本公开一种实施例中，依照从所述各待规划设备的全范围业务标签的较集中剔除所述各待规划设备的不可用业务标签的并集的原则对所述待规划设备进行业务标签规划包括：
计算各待规划设备的全范围业务标签的交集；
判断所述交集是否为空集，当所述判断的结果为所述交集是空集，则结束本次业务标签规划。
在本公开一种实施例中，当所述判断的结果为所述交集不是空集，计算各待规划设备不可用业务标签的并集，并从所述交集中剔除所述并集得到待规划设备的最终可用业务标签。
在本公开一种实施例中，依照从所述各待规划设备的全范围业务标签的较集中剔除所述各待规划设备的不可用业务标签的并集的原则对所述待规划设备进行业务标签规划包括：
分别从每个待规划设备的全范围业务标签中剔除各自的不可用业务标签，得到每个待规划设备各自可用业务标签；
计算所述各待规划设备各自可用业务标签的交集，所述交集为所述各待规划设备的最终可用业务标签。
在本公开一种实施例中，所述不可用业务标签包括：预留业务标签和已占用业务标签。
本公开还提供一种业务标签规划装置，应用于分组传送网，包括：
选择模块：被配置为确定需要进行业务标签规划的待规划设备，所述待规划设备的数量为至少两个；
获取模块：被配置为分别获取各待规划设备的全范围业务标签和不可用业务标签，所述全范围业务标签为所述待规划设备允许存在的所有业务标签的集 合；
规划模块：被配置为依照从所述各待规划设备的全范围业务标签的交集中剔除所述各待规划设备的不可用业务标签的并集的原则对所述待规划设备进行业务标签规划，得到所述各待规划设备的最终可用业务标签。
在本公开一种实施例中，所述规划模块包括：
第一计算子模块：被配置为计算所述各待规划设备的全范围业务标签的交集；
第一处理子模块：被配置为判断所述交集是否为空集，当所述判断的结果为所述交集是空集时，终止本次业务标签规划。
在本公开一种实施例中，所述第一处理子模块还被配置为当所述判断的结果为所述交集不是空集时，计算所述各待规划设备不可用业务标签的并集，并从所述交集中剔除所述并集得到所述各待规划设备的最终可用业务标签。
在本公开一种实施例中，所述规划模块包括：
第二处理子模块：被配置为分别从每个待规划设备的全范围业务标签中剔除各自的不可用业务标签，得到每个待规划设备各自可用业务标签；
第二计算子模块：被配置为计算所述各待规划设备各自可用业务标签的交集，所述交集为所述各待规划设备的最终可用业务标签。
在本公开一种实施例中，所述不可用业务标签包括：预留业务标签和已占用业务标签。
本公开实施例还提供了一种非暂态计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令设置为执行上述方法。
本公开实施例还提供了一种电子设备，包括：
至少一个处理器；以及
与所述至少一个处理器通信连接的存储器；其中，
所述存储器存储有可被所述至少一个处理器执行的指令，所述指令被所述至少一个处理器执行，以使所述至少一个处理器执行上述的方法。
本公开的有益效果是：本公开提供了一种业务标签规划方法及装置，先确 定需要进行业务标签规划的待规划设备，并且该待规划设备至少有两个；然后分别获取各个待规划设备的全范围标签和不可用业务标签，该全范围标签也即是在待规划设备上允许存在的所有业务标签；然后依照从各待规划设备的全范围业务标签的交集中剔除各待规划设备的不可用业务标签的并集的原则来对待规划设备的业务标签进行规划获取最终的可用业务标签。整个流程可以自动执行，可以由业务标签规划装置来完成，减少人工的工作量，提高工作效率，同时有效的避免了规划混乱和错误。
附图概述
图1为本公开实施例一种业务标签规划方法的流程图；
图2为本公开实施例一种业务标签规划方法一种实施方式的流程图；
图3为本公开实施例一种业务标签规划方法另一实施方式的流程图；
图4为本公开实施例一种业务标签规划装置的结构示意图；
图5为本公开实施例一种业务标签规划装置的规划模块的结构示意图；
图6为本公开实施例一种业务标签规划装置的规划模块的另一结构示意图；以及
图7为本公开实施例提供的电子设备的结构示意图。
具体实施方式
下面通过实施方式结合附图对本公开进行详细说明。
实施例一：
本实施例提供一种业务标签规划方法，其相对于相关技术中采用人工规划业务标签的方法具有规划效率高，规划质量高的优点，该方法的内容请参考图1，包括：
S101：确定需要进行业务标签规划的待规划设备；
S102：分别获取各待规划设备的全范围业务标签和不可用业务标签；
S103：依照从所述各待规划设备的全范围业务标签的交集中剔除所述各待规划设备的不可用业务标签的并集的原则对所述各待规划设备进行业务标签规划。
在执行S101时，需要注意，需要确定的待规划设备的数量不能少于两个，例如可以为两个，三个、四个或者更多。而在给设备配置业务标签时，需要进行业务标签进行规划的设备，往往这些设备之间使存在某些联系的，例如设备A和设备B之间有业务往来，该业务需要将数据从设备A传到数据B，此时就需要对设备A和设备B进行业务标签规划，使其能顺利完成该业务。但是这些待规划设备之间的关系不限于像上述示例这种直接相连关系，也可能是间接相连或者其他关系。所以在确定待规划设备时，可能需要使用本公开业务标签规划方法的人员比较注意，根据自己的需要来选取待规划设备。
当确定好了需要进行业务标签规划的待规划设备，还需要获取这些待规划设备的全范围和不可用业务标签，进入S102。所谓全范围业务标签也即是一个设备上允许存在的所有业务标签的集合，例如，设备A上可以存在1-10000之内的任意标签，那么1-10000就是设备A的全范围业务标签。而不可用业务标签也就是在进行业务标签规划时不能被使用的业务标签，所谓不能被使用也就是使用了这些标签可能会产生某些差错。通常，不可用业务标签包括预留业务标签和已占用业务标签；该预留标签包括设备保留标签、OAM占用标签、协议占用标签及其他功能固定使用标签；而已占用业务标签则是指那些在进行业务标签规划之前就已经被占用的所有标签，例如在进行在业务标签规划之前标签200-250就已经被某一个业务占用，那么200-250就属于已占用业务标签。
需要注意的是，在实际执行获取预留业务标签是容易的，但对于获取已占用业务标签可能需要某些特殊处理。当需要在设备上承载某些业务，例如隧道、伪线等业务时，为了满足某些需求通常需要将设备分配到的业务标签进行某些特殊处理，例如进行偏移，或者经过某种算法计算等，当然也有些业务使用的业务标签就是分配的业务标签，没有经过任何处理，针对上述情况，在有些业务采用了偏移技术时，需要进行反偏移计算才能得到真实的已占用业务标签，对于采用特殊算法的则需要进行逆运算来获得真实的已占用业务标签。
获取到进行业务标签规划需要的数据和信息之后就可以对各待规划设备的业务标签进行规划了，执行步骤S103，根据步骤S102的描述很明显可以知道只 要将不可用业务标签从全范围业务标签中剔除就可以获取那些可以被使用的业务标签，在本方案中还需要考虑各个待规划设备之间可能存在某些联系，所以在本方法中，依照从各待规划设备的全范围业务标签的交集中剔除各待规划设备的不可用业务标签的并集的原则来对各待规划设备进行业务标签规划，得到各待规划设备的最终可用业务标签。
在一种实施方式中，依照从全范围业务标签中剔除不可用业务标签计算可用业务标签这一规则来对各个待规划设备进行业务标签规划，从而计算出各个待规划设备的最终可用业务标签的过程请参考图2，包括：
S201：计算各待规划设备的全范围业务标签的交集；
S202：判断该交集是否为空集，若是空集，则执行S203；若不是空集，则执行S204；
S203：结束本次业务标签规划；
S204：计算各待规划设备不可用业务标签的并集，并从所述较集中剔除所述并集得到待规划设备的最终可用业务标签。
前面已经介绍过待规划设备至少为两个，可以为更多，先计算这些待规划是的全范围标签的交集判断其允许存在的业务标签部分是否有重叠，若判断结是交集为空集，那么证明这些待规划设备不能同时进行规划，结束本次业务标签规划。同时，还可以提示管理员或该方法使用者，结束原因，因为通常待规划设备的全范围业务标签对于进行业务标签规划的人员来说可能是可以修改的，所以甚至可以提醒让其修改全范围业务标签的范围，以便于再次进行业务标签规划。如果交集不是空集，就计算这些待规划设备的不可用业务标签的并集，然后同样按照从全范围业务标签中剔除不可用业务标签计算可用业务标签的原则，从各待规划设备的全范围业务标签的交集中剔除各待规划设备的不可用业务标签的并集，剩下的便是所需要的待规划设备的最终可用业务标签。使用这种方法进行业务标签规划方法可以对所有待规划设备同时规划，所有的待规划设备最终可使用标签都是相同的，规划出来的业务标签使用时相对比较稳定。
采用这种方式，可以对多个待规划设备同时进行业务标签规划。例如，待规划设备是设备A、设备B、设备C。先获取设备A、设备B、设备C的全范围业务标签和不可用业务标签，例如设备A的全范围业务标签为1-10000，设备B的全范围业务标签为500-15000，设备C的全范围业务标签为100-15000。备A 的不可用业务标签为200-700，设备B的不可用业务标签为500-600，设备C的不可用业务标签为100-200。然后计算获取到的三个设备的全范围业务标签的交集，对于设备A、设备B、设备C全范围业务标签的交集就是500-10000；然后接下来计算设备A、设备B、设备C不可用业务标签的并集，应当为100-700；然后从设备A、设备B、设备C全范围业务标签的交集中剔除设备A、设备B、设备C不可用业务标签的并集，也即是700-10000，那么700-10000就是设备A、设备B、设备C的最终可用业务标签。
在另一种实施方式中，依照从全范围业务标签中剔除不可用业务标签计算可用业务标签这一规则来对各个待规划设备进行业务标签规划，从而计算出各个待规划设备的最终可用业务标签的过程请参考图3，包括：
S301：分别从每个待规划设备的全范围业务标签中剔除该待规划设备的不可用业务标签；
S302：计算各待规划设备的各自可用业务标签的交集。
在获取各待规划设备的全范围业务标签和不可用业务标签之后，每个待规划设备都有对应的全范围业务标签和不可用业务标签，从每个待规划设备各自对应的全范围业务标签中剔除各自对应的不可用业务标签，就可以得到各待规划设备的各自可用业务标签；该各自可用业务标签也即是在该待规划设备上，不考虑与其他设备可能冲突的情况下可以使用的业务标签。但是，为了减少规划错误，当然还要考虑与其他待规划设备之间的冲突可能，所以还需要计算各个待规划设备各自可用业务标签的交集，该交集为这些待规划设备的最终可用业务标签。在确定好待规划设备后，需要对这些待规划设备中的某一个待规划设备的业务标签进行规划，采用这种方法会比较方便。例如，设备A和设备B相邻，设备A和设备C也相邻，考虑到相邻设备之间处业务标签和入业务标签的关系，对于设备A可能最终需要计算是设备A、设备B以及设备C三个设备的各自可用业务标签的交集。而对于设备B可能只需要计算设备A和设备B各自可用业务标签的交集。所以对于单个设备进行业务标签规划时可以有侧重的先选择好待规划设备从而采用本实施例中的方法来进行业务标签规划。
上述为进行一次业务标签规划的过程，考虑到可能用户需要进行多次业务规划可以在本规划方法的基础上，提前设置好在获得业务各待规划设备的最终可用业务标签后，对各种业务优先选用的业务标签，这样可以实现在完成规划 后可以根据设置自动选择并配置好业务标签，完成自动配置。并且再完成自动配置后还可以再重复上述标签规划方法的各个步骤，进行多次规划。
本实施例还提供一种业务标签规划装置，请参考图4，该业务标签规划装置4包括：选择模块41、获取模块42和规划模块43；选择模块41被配置为确定需要进行业务标签规划的待规划设备，所述待规划设备的数量为至少两个；获取模块42被配置为分别获取各待规划设备的全范围业务标签和不可用业务标签，全范围业务标签是指待规划设备允许存在的所有业务标签的集合；规划模块43被配置为依照从各待规划设备的全范围业务标签的交集中剔除各待规划设备的不可用业务标签的并集的原则对待规划设备进行业务标签规划，得到各待规划设备的最终可用业务标签。
在一种实施例中，请参考图5，规划模块43包括第一计算子模块431和第一处理子模块432；第一计算子模块431被配置为计算所述各待规划设备的全范围业务标签的交集；第一处理子模块432被配置为判断所述交集是否为空集，当判断结果为该交集是空集时，终止本次业务标签规划。同时，第一处理子模块432还被配置为当判断结果为该交集不是空集时，计算所述各待规划设备不可用业务标签的并集，并从所述交集中剔除所述并集得到所述各待规划设备的最终可用业务标签。
在另一种实施例中，请参考图6，规划模块43包括第二处理子模块433和第二处理子模块434，第二处理子模块433被配置为分别从每个待规划设备的全范围业务标签中剔除各自的不可用业务标签，得到每个待规划设备各自可用业务标签；第二处理子模块434被配置为计算各待规划设备各自可用业务标签的交集，该交集就是各待规划设备的最终可用业务标签。
本公开实施例还提供了一种非暂态计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令设置为执行上述任一实施例中的方法。
本公开实施例还提供了一种电子设备的结构示意图。参见图7，该电子设备包括：
至少一个处理器(processor)70，图7中以一个处理器70为例；和存储器(memory)71，还可以包括通信接口(Communications Interface)72和总线73。其中， 处理器70、通信接口72、存储器71可以通过总线73完成相互间的通信。通信接口72可以用于信息传输。处理器70可以调用存储器71中的逻辑指令，以执行上述实施例的方法。
此外，上述的存储器71中的逻辑指令可以通过软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。
存储器71作为一种计算机可读存储介质，可用于存储软件程序、计算机可执行程序，如本公开实施例中的方法对应的程序指令/模块。处理器70通过运行存储在存储器71中的软件程序、指令以及模块，从而执行功能应用以及数据处理，即实现上述方法实施例中的业务标签规划方法。
存储器71可包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序；存储数据区可存储根据终端设备的使用所创建的数据等。此外，存储器71可以包括高速随机存取存储器，还可以包括非易失性存储器。
本公开实施例的技术方案可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括一个或多个指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本公开实施例所述方法的全部或部分步骤。而前述的存储介质可以是非暂态存储介质，包括：U盘、移动硬盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、磁碟或者光盘等多种可以存储程序代码的介质，也可以是暂态存储介质。
很明显可以知道本实施例中的业务标签规划装置的各个模块执行本公开的业务标签规划方法，其各个模块用来执行业务标签规划方法中的各个步骤，所以在业务标签规划方法中各个步骤的特性，对于业务标签规划装置同样具备。
采用本实公开的业务标签规划方法和装置，先确需要进行业务标签规划的待规划设备，并且该待规划设备至少有两个；然后分别获取各个待规划设备的全范围标签和不可用业务标签，该全范围标签也即使在在待规划设备上允许存 在的所有业务标签；然后依照从各待规划设备的全范围业务标签的交集中剔除各待规划设备的不可用业务标签的并集的原则来对待规划设备的业务标签进行规划获取最终的可用业务标签。整个流程由业务标签规划装置来完成，不需要人工手动规划业务标签交换表，从而可以避免许多因为许多人为因素而导致的一些错误，例如因为业务标签规划人员的粗心而导致规划的标签存在冲突，或者规划的标签是预留标签甚至是已占用标签。可以达到减少人工的工作量，提高工作效率，同时有效的避免了规划混乱和错误的技术效果。
显然，本领域的技术人员应该明白，上述本公开的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，可选地，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储介质(ROM/RAM、磁碟、光盘)中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。所以，本公开不限制于任何特定的硬件和软件结合。
以上内容是结合实施方式对本公开所作的详细说明，不能认定本公开的实施只局限于这些说明。对于本公开所属技术领域的普通技术人员来说，在不脱离本公开实施例范围的前提下，还可以做出若干简单推演或替换，都应当视为属于本公开的保护范围。
工业实用性
本公开提供的业务标签规划方法及装置解决相关技术中因人工手动规划业务标签，效率低下，规划时容易出现混乱和错误的问题；从而达到减少人工的工作量，提高工作效率，同时有效的避免了规划混乱和错误的效果。

Claims (11)

  1. 一种业务标签规划方法，应用于分组传送网，所述方法包括：
    确定需要进行业务标签规划的待规划设备，所述待规划设备的数量为至少两个；
    分别获取各待规划设备的全范围业务标签和不可用业务标签，所述全范围业务标签为所述待规划设备允许存在的所有业务标签的集合；
    依照从所述各待规划设备的全范围业务标签的交集中剔除所述各待规划设备的不可用业务标签的并集的原则对所述各待规划设备进行业务标签规划，得到所述各待规划设备的最终可用业务标签。
  2. 如权利要求1所述的业务标签规划方法，其中，依照从所述各待规划设备的全范围业务标签的较集中剔除所述各待规划设备的不可用业务标签的并集的原则对所述待规划设备进行业务标签规划包括：
    计算各待规划设备的全范围业务标签的交集；
    判断所述交集是否为空集，当所述判断的结果为所述交集是空集，则结束本次业务标签规划。
  3. 如权利要求2所述的业务标签规划方法，其中，当所述判断的结果为所述交集不是空集，计算各待规划设备不可用业务标签的并集，并从所述交集中剔除所述并集得到待规划设备的最终可用业务标签。
  4. 如权利要求1所述的业务标签规划方法，其中，依照从所述各待规划设备的全范围业务标签的较集中剔除所述各待规划设备的不可用业务标签的并集的原则对所述待规划设备进行业务标签规划包括：
    分别从每个待规划设备的全范围业务标签中剔除各自的不可用业务标签，得到每个待规划设备各自可用业务标签；
    计算所述各待规划设备各自可用业务标签的交集，所述交集为所述各待规划设备的最终可用业务标签。
  5. 如权利要求1-4任意一项所述的业务标签规划方法，其中，所述不可用业务标签包括：预留业务标签和已占用业务标签。
  6. 一种业务标签规划装置，应用于分组传送网，所述装置包括：
    选择模块：被配置为确定需要进行业务标签规划的待规划设备，所述待规划设备的数量为至少两个；
    获取模块：被配置为分别获取各待规划设备的全范围业务标签和不可用业务标签，所述全范围业务标签为所述待规划设备允许存在的所有业务标签的集合；
    规划模块：被配置为依照从所述各待规划设备的全范围业务标签的交集中剔除所述各待规划设备的不可用业务标签的并集的原则对所述待规划设备进行业务标签规划，得到所述各待规划设备的最终可用业务标签。
  7. 如权利要求6所述的业务标签规划装置，其中，所述规划模块包括：
    第一计算子模块：被配置为计算所述各待规划设备的全范围业务标签的交集；
    第一处理子模块：被配置为判断所述交集是否为空集，当所述判断的结果为所述交集是空集时，终止本次业务标签规划。
  8. 如权利要求7所述的业务标签规划装置，其中，所述第一处理子模块还被配置为当所述判断的结果为所述交集不是空集时，计算所述各待规划设备不可用业务标签的并集，并从所述交集中剔除所述并集得到所述各待规划设备的最终可用业务标签。
  9. 如权利要求6所述的业务标签规划装置，其中，所述规划模块包括：
    第二处理子模块：被配置为分别从每个待规划设备的全范围业务标签中剔除各自的不可用业务标签，得到每个待规划设备各自可用业务标签；
    第二计算子模块：被配置为计算所述各待规划设备各自可用业务标签的交集，所述交集为所述各待规划设备的最终可用业务标签。
  10. 如权利要求6-9任意一项所述的业务标签规划装置，其中，所述不可用业务标签包括：预留业务标签和已占用业务标签。
  11. 一种非暂态计算机可读存储介质，存储有计算机可执行指令，所述计算机可执行指令设置为执行权利要求1-5中任一项的方法。
PCT/CN2017/071084 2016-01-28 2017-01-13 一种业务标签规划方法及装置 WO2017128962A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610058404.5 2016-01-28
CN201610058404.5A CN107018003A (zh) 2016-01-28 2016-01-28 一种业务标签规划方法及装置

Publications (1)

Publication Number Publication Date
WO2017128962A1 true WO2017128962A1 (zh) 2017-08-03

Family

ID=59397465

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/071084 WO2017128962A1 (zh) 2016-01-28 2017-01-13 一种业务标签规划方法及装置

Country Status (2)

Country Link
CN (1) CN107018003A (zh)
WO (1) WO2017128962A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107885965B (zh) * 2017-09-26 2020-06-05 深圳市宇数科技有限公司 一种数据探索发现方法、系统、电子设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1859104A (zh) * 2005-09-28 2006-11-08 华为技术有限公司 业务隔离传送方法
CN103200029A (zh) * 2013-03-11 2013-07-10 烽火通信科技股份有限公司 网管对PTN/IPRan设备的标签分配和管理的方法
US20140064064A1 (en) * 2012-09-06 2014-03-06 Electronics And Telecommunications Research Institute Method and apparatus for protection switching
WO2015117411A1 (zh) * 2014-07-31 2015-08-13 中兴通讯股份有限公司 业务数据传输方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1859104A (zh) * 2005-09-28 2006-11-08 华为技术有限公司 业务隔离传送方法
US20140064064A1 (en) * 2012-09-06 2014-03-06 Electronics And Telecommunications Research Institute Method and apparatus for protection switching
CN103200029A (zh) * 2013-03-11 2013-07-10 烽火通信科技股份有限公司 网管对PTN/IPRan设备的标签分配和管理的方法
WO2015117411A1 (zh) * 2014-07-31 2015-08-13 中兴通讯股份有限公司 业务数据传输方法及装置

Also Published As

Publication number Publication date
CN107018003A (zh) 2017-08-04

Similar Documents

Publication Publication Date Title
CN110138575B (zh) 网络切片创建方法、系统、网络设备及存储介质
US20190230004A1 (en) Network slice management method and management unit
CN105359459B (zh) 一种实现虚拟化网管的方法、装置及系统
EP3096490B1 (en) Method for realizing network virtualization and related device and communication system
EP3214891B1 (en) Switching-on method, base station and storage medium
US9722890B2 (en) Integrated incident management for hybrid landscapes
CN104639370A (zh) 一种通过带外管理获取系统pci-e设备信息的方法
CN110389843A (zh) 一种业务调度方法、装置、设备及可读存储介质
CN104484167B (zh) 任务处理方法及装置
CN103685083A (zh) 异步管理网络中的通信方法
CN104468223B (zh) 一种数据中心计算、存储、网络设备自动管理分配方法
US20210336852A1 (en) Network-configuration-information generation method and communication device
CN105335887A (zh) 一种基于总线模式的自助办税系统及自助办税方法
CN114285695B (zh) 通信方法、装置、设备、系统和存储介质
CN101808037B (zh) 交换网中流量管理的方法和装置
WO2017128962A1 (zh) 一种业务标签规划方法及装置
CN112333672B (zh) 一种5g核心网upf网元的开局方法及装置
CN113658351A (zh) 一种产品生产的方法、装置、电子设备及存储介质
US11700189B2 (en) Method for performing task processing on common service entity, common service entity, apparatus and medium for task processing
US20150138979A1 (en) Network management control device, network management control system, and network management control method
CN104092794A (zh) 批量进程处理方法和系统
US20180329758A1 (en) Method and device for transmitting managing instruction and managing automatic scaling function of vnf
CN110391934B (zh) 网络设备标注方法和装置
CN109224451A (zh) 基于区块链子链的游戏开发方法、设备以及存储介质
CN104052624A (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: 17743577

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: 17743577

Country of ref document: EP

Kind code of ref document: A1