WO2021031986A1 - 一种承载网络快速切片的方法 - Google Patents

一种承载网络快速切片的方法 Download PDF

Info

Publication number
WO2021031986A1
WO2021031986A1 PCT/CN2020/109048 CN2020109048W WO2021031986A1 WO 2021031986 A1 WO2021031986 A1 WO 2021031986A1 CN 2020109048 W CN2020109048 W CN 2020109048W WO 2021031986 A1 WO2021031986 A1 WO 2021031986A1
Authority
WO
WIPO (PCT)
Prior art keywords
virtual
slice
bearer
node
service
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2020/109048
Other languages
English (en)
French (fr)
Inventor
白泽刚
汪俊芳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fiberhome Telecommunication Technologies Co Ltd
Original Assignee
Fiberhome Telecommunication Technologies Co Ltd
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
Priority claimed from CN201911131206.7A external-priority patent/CN112422310B/zh
Application filed by Fiberhome Telecommunication Technologies Co Ltd filed Critical Fiberhome Telecommunication Technologies Co Ltd
Priority to BR112022001774A priority Critical patent/BR112022001774A2/pt
Publication of WO2021031986A1 publication Critical patent/WO2021031986A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/28Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46Interconnection of networks

Definitions

  • the invention relates to the technical field of network management management, in particular to a method for fast slicing of a bearing network.
  • the 5G bearer network is part of the 5G end-to-end service path and must meet different service requirements in multiple scenarios.
  • 5G is an open network that can provide application requirements for vertical industries and leasing services.
  • bearer network support is required
  • the service isolation and independent operation and maintenance requirements of the 5G fragmented network allocate different types of bearer network fragments for different types of services. In practical applications, if a dedicated network is established for each business service, the cost will be unimaginable.
  • the network slicing technology allows operators to segment multiple virtual end-to-end networks in a hardware infrastructure. Each network slice is logically isolated on the forwarding plane, control plane, and management plane, and adapts to various types of services. And to meet the different needs of users.
  • 5G networks need to provide end-to-end network slicing for vertical application industries. This requirement is specifically decomposed to 5G bearer networks that must provide 5G bearer network slicing functions. 5G bearer network slicing is a new function for bearer networks and has not been clearly stipulated in related protocols.
  • the purpose of the present invention is to provide a method for fast slicing of the bearer network, which can realize the automatic creation of bearer network slices, which greatly improves the operation and maintenance efficiency compared with the manual creation method in the prior art.
  • a method for rapid slicing of a bearer network includes the following steps:
  • Plan to carry slice service enter slice type and service UNI node pair information, generate service UNI node pair information list; S2, generate tunnel layer topology in the area topology range according to slice type; S3, cycle according to service UNI node pair information Perform multipath path finding between business UNI node pairs; S4, comprehensively calculate the virtual nodes and virtual links generated by the multipath calculation, and generate recommended slices.
  • the slice types in step S1 include FlexE tunnel slices, SR tunnel slices, L2VPN slices, L3VPN slices, and enhanced VPN slices.
  • the service UNI node pair information in step S1 includes service UNI node pair information, source node, source UNI port, sink node, sink UNI port, bandwidth, maximum delay, and protection level.
  • step S3 specifically includes:
  • the service UNI node pair information list use the path finding algorithm to find multiple paths that meet the bandwidth and delay requirements; select the reserved path according to the total number of paths; save all the node and link information on the reserved path into the MAP mapping table ,
  • the MAP mapping table records the keywords including the sequence numbers of the service UNI node pairs; the multi-path path finding is completed for all service UNI node pairs cyclically.
  • step S3 specifically includes:
  • step S3 Perform cyclic comparison on the MAP mapping table generated in step S3 to remove duplicate virtual node and virtual link information, and generate a virtual link table with no duplicate information; refresh and calculate the bandwidth sum of duplicate virtual links; according to the no duplication information
  • the virtual link table of and the bandwidth sum to generate a recommended bearer slice.
  • step S4 it further includes: S5. Manually adjust the virtual node and the virtual link to complete the bearer slice creation.
  • step S5 specifically includes:
  • step S51 Determine whether a manual modification switch instruction is received, if yes, go to step S52, if not, go to step S53; S52, manually add or delete virtual nodes and virtual links; S53, generate virtual nodes and virtual links that bear slices Table and associate tenant information to complete the creation of bearer slices.
  • the step of manually adding virtual nodes and virtual links includes: providing all virtual nodes and virtual links in the regional topology; manually selecting virtual nodes in batches on the regional topology and adding the virtual links to step S4 In the generated virtual node and virtual link table;
  • the step of manually deleting virtual nodes and virtual links includes: displaying the virtual node and virtual link table generated in S4; manually removing the virtual nodes and virtual links from the slice.
  • the method for rapid slicing of the bearer network of the present invention provides a specific and implementable automatic and fast slicing method, which can specify the area network topology before calculation, avoiding large-scale irrelevant calculations, improving calculation efficiency, and realizing slicing of the bearer
  • the information of virtual nodes and virtual links is fully automated, and the creation of bearer slices is quickly completed.
  • the method for fast slicing of the bearer network of the present invention can support multiple constraints on quality requirements such as slicing type and bandwidth, delay, protection level, etc., to meet tenants' requirements for bearer slicing, and perform slicing services before creating bearer slices. Planning can avoid frequent adjustments after slice generation.
  • the method for rapid slicing of the bearer network of the present invention provides an opportunity to automatically create slices and manually adjust virtual nodes and virtual links, which can meet more flexible user needs. At the same time, this step can be adjusted as an optional step in actual operation. It can meet the requirements of automatic creation efficiency of bearer slices and flexibility of users.
  • Fig. 1 is a flowchart of a method for fast slicing a bearer network in an embodiment of the present invention.
  • an embodiment of the present invention provides a method for fast slicing a bearer network.
  • the method includes the following steps:
  • the solution provides a specific and implementable automatic and fast slice creation method, which can specify the regional network topology before calculation, avoid large-scale irrelevant calculations, improve calculation efficiency, and realize fully automatic calculation of virtual nodes and virtual links that carry slices. , Quickly complete the creation of bearing slices.
  • the bearer slice range can be estimated according to the network scale to avoid large-scale irrelevant calculations and improve calculation efficiency; for example, the network scale is larger (in a specific embodiment, if the number of physical nodes is greater than If it is equal to 1000, or the number of physical connections is greater than or equal to 5000, the network is considered to be a large-scale network management scenario, otherwise it is a small-scale network scenario), then the topology range of the bearer slice is estimated and specified in the network topology diagram by manual delineation, etc. A topology area larger than the topology range of the estimated bearing slice; if the network scale is small, the entire network managed by the network management system is automatically taken as the area network topology.
  • inputting slice type and service UNI node pair information, and generating the content of the service UNI node pair information list specifically includes:
  • the entered slice types include slice types including FlexE tunnel slices, SR tunnel slices, L2VPN slices, L3VPN slices and enhanced VPN slices, etc., which can be selected by the user according to their needs.
  • the entered service UNI node pair information includes service UNI node pair information, source node, source UNI port, sink node, sink UNI port, bandwidth, maximum delay, protection level and other quality requirements.
  • a list of service UNI node pair information can be generated and stored.
  • the user can select a tenant from the existing tenant list of the network management system as the tenant manager that bears the slice, complete the tenant information setting and specify the slice tenant information.
  • step S3 specifically includes:
  • the service UNI node pair information list use the path finding algorithm to find multiple paths that meet the bandwidth and delay requirements; select the reserved path according to the total number of paths; save all the node and link information on the reserved path to the service UNI node In the MAP mapping table with the sequence number as the key, the multi-path path finding is completed for all service UNI nodes in a loop.
  • the path finding algorithm used in the present invention can be specifically executed using algorithms such as the A-Star algorithm.
  • reserved paths when selecting reserved paths based on the total number of paths, for example, when the total number of paths is> 3 and the protection level is lower than permanent protection, 3 optimal paths are reserved; if the protection level is permanent protection or the total number of paths is ⁇ 3, Keep all paths. In a preferred embodiment, when the protection level is permanent protection, but the total number of paths is greater than 10, a maximum of 10 paths are reserved.
  • step S4 may specifically include:
  • step S1 the user manually selects whether the automatically created slice needs to be manually modified.
  • an optional drop-down list can be provided to the user in the network management system, and the user can manually select whether the automatically created slice needs to be manually modified. Initially, the options "can be modified” and “not modified” can be set, and the default value is set to "Can be modified".
  • step S4 it also includes: S5. Manually adjust the virtual node and the virtual link to complete the bearer slice creation.
  • the step S5 may include:
  • step S51 Judge whether a manual modification switch instruction is received, if yes, go to step S52, if no, go to step S53;

Landscapes

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

Abstract

本发明公开了一种承载网络快速切片的方法,涉及网管管理技术领域,包括以下步骤:S1、规划承载切片业务,录入切片类型和业务UNI节点对信息,生成业务UNI节点对信息列表;S2、根据切片类型在区域拓扑范围中生成隧道层拓扑;S3、根据业务UNI节点对信息,循环进行业务UNI节点对之间的多路径寻路;S4、综合计算多路径计算产生的虚节点和虚链路,生成推荐切片。本发明的目的在于提供一种承载网络切片快速创建的方法,可以实现承载网络切片的自动化创建,相比现有技术中手动创建方式,大大的提升了运维效率。

Description

一种承载网络快速切片的方法 技术领域
本发明涉及网管管理技术领域,具体涉及一种承载网络快速切片的方法。
背景技术
5G承载网络是5G端到端业务路径的一部分,必须满足多场景下的不同业务需求,同时5G是一个开放网络,可以提供面向垂直行业和租赁业务的应用需求,在此场景下要求承载网络支持5G分片网络的业务隔离和独立运维需求,为不同类型的业务分配不同类型的承载网分片。实际应用中,如果为每种业务服务建立一个专用网络,成本将是无法想象的。而网络切片技术可让运营商在一个硬件基础设施中切分出多个虚拟的端到端网络,每个网络切片在转发面、控制面、管理面上实现逻辑隔离,适配各种类型服务并满足用户的不同需求。
随着5G网络技术的快速发展,按照3GPP组织的标准要求,5G网络需要给垂直应用行业提供端到端的网络切片,这一需求具体分解到5G承载网络必须提供5G承载网络切片功能。5G承载网络切片对于承载网络是一个新的功能,并未在相关协议中进行明确规定。
现有方案中实施网络切片的方式较多,如基于SDN的控制面切片,以及基于FlexE的转发面切片技术等,但现有技术中相关网络切片方法的实施需依赖技术人员手动创建,运维效率低,实际应用困难。
发明内容
针对现有技术中存在的缺陷,本发明的目的在于提供一种承载网 络快速切片的方法,可以实现承载网络切片的自动化创建,相比现有技术中手动创建方式,大大的提升了运维效率。
为达到以上目的,本发明采取的技术方案是:
一种承载网络快速切片的方法,包括以下步骤:
S1、规划承载切片业务,录入切片类型和业务UNI节点对信息,生成业务UNI节点对信息列表;S2、根据切片类型在区域拓扑范围中生成隧道层拓扑;S3、根据业务UNI节点对信息,循环进行业务UNI节点对之间的多路径寻路;S4、综合计算多路径计算产生的虚节点和虚链路,生成推荐切片。
在上述技术方案的基础上,在规划承载切片业务时,如网络规模较大,则估计承载切片的拓扑范围,在网络拓扑图中指定大于所述估计承载切片的拓扑范围的拓扑区域;如网络规模较小,则将网管系统管理的全网作为该区域网络拓扑。
在上述技术方案的基础上,步骤S1中切片类型包括FlexE隧道切片、SR隧道切片、L2VPN切片,L3VPN切片和增强型VPN切片。
在上述技术方案的基础上,步骤S1中所述业务UNI节点对信息包括业务UNI节点对信息、源节点、源UNI端口、宿节点、宿UNI端口、带宽、最大时延和保护等级。
在上述技术方案的基础上,步骤S3具体包括:
根据所述业务UNI节点对信息列表,利用寻径算法,找到满足带宽、时延要求的多条路径;根据路径总数选择保留路径;将保留路径上所有节点和链路信息保存到MAP映射表中,所述MAP映射表记载包括业务UNI节点对序号的关键字;对所有业务UNI节点对循环完成多路径寻路。
在上述技术方案的基础上,所述根据路径总数选择保留路径时, 如当路径总数>3条,且保护级别低于永久保护时,保留3条最优路径;如保护级别为永久保护或路径总数≤3条时,保留所有路径。
在上述技术方案的基础上,步骤S3具体包括:
对步骤S3中生成的MAP映射表进行循环比对,去除重复虚节点和虚链路信息,生成无重复信息的虚链路表;刷新计算重复虚链路的带宽和;根据所述无重复信息的虚链路表和所述带宽和,生成推荐的承载切片。
在上述技术方案的基础上,在步骤S4后还包括:S5、手动调整虚节点和虚链路,完成承载切片创建。
在上述技术方案的基础上,所述步骤S5具体包括:
S51、判断是否接收到手动修改开关指令,如是转到步骤S52,如否,转到步骤S53;S52、手动添加或删除虚节点和虚链路;S53、生成承载切片的虚节点和虚链路表,并关联租户信息,完成承载切片的创建。
在上述技术方案的基础上,所述手动添加虚节点和虚链路步骤包括:提供区域拓扑所有虚节点和虚链路;在区域拓扑上手动批量选择虚节点、虚链路加入到步骤S4中生成的虚节点和虚链路表中;
所述手动删除虚节点和虚链路步骤包括:显示S4中生成的虚节点和虚链路表;手动操作从切片中移除虚节点和虚链路。
与现有技术相比,本发明的优点在于:
(1)本发明的承载网络快速切片的方法方案中提供了具体可实施的自动化快速创建切片方法,可在运算前指定区域网络拓扑,避免大范围无关计算,提高计算效率,同时实现对承载切片的虚节点、虚链路信息完全自动化计算,快速完成承载切片的创建。
(2)本发明的承载网络快速切片的方法可支持切片类型和带宽、 时延、保护等级等质量需求的多种约束,满足租户对承载切片的需求,同时在创建承载切片前对切片业务进行规划,可避免切片生成后的频繁调整。
(3)本发明的承载网络快速切片的方法提供自动创建切片手动调整虚节点、虚链路的机会,可以满足更灵活的用户需求,同时该步骤在实际操作中可作为可选步骤进行调整,可兼顾满足承载切片自动化创建效率和用户灵活的需求。
附图说明
图1为本发明实施例中承载网络快速切片的方法流程图。
具体实施方式
以下结合附图及实施例对本发明作进一步详细说明。
参见图1所示,本发明实施例提供一种承载网络快速切片的方法,该方法包括以下步骤:
S1、规划承载切片业务,录入切片类型和业务UNI节点对信息,生成业务UNI节点对信息列表;
S2、根据切片类型在区域拓扑范围中生成隧道层拓扑;
S3、根据业务UNI节点对信息,循环进行业务UNI节点对之间的多路径寻路;
S4、综合计算多路径计算产生的虚节点和虚链路,生成推荐切片。
该方案中提供了具体可实施的自动化快速创建切片方法,可在运算前指定区域网络拓扑,避免大范围无关计算,提高计算效率,同时实现对承载切片的虚节点、虚链路信息完全自动化计算,快速完成承载切片的创建。
在一个实施例中,在步骤S1规划承载切片业务时,可根据网络 规模估计承载切片范围,避免大范围无关计算,提高计算效率;如网络规模较大(在具体实施例中如物理节点数大于等于1000,或物理连接数大于等于5000,则认为该网络为大规模网络管理场景,反之则为小规模网络场景),则估计承载切片的拓扑范围,在网络拓扑图中以手动圈定等方式指定大于所述估计承载切片的拓扑范围的拓扑区域;如网络规模较小,则自动将网管系统管理的全网作为该区域网络拓扑。
在一个实施例中,录入切片类型和业务UNI节点对信息,生成业务UNI节点对信息列表的内容具体包括:
录入的切片类型包括切片类型包括FlexE隧道切片、SR隧道切片、L2VPN切片,L3VPN切片和增强型VPN切片等,由用户从各类型中按需求选择。
录入的业务UNI节点对信息包括业务UNI节点对信息、源节点、源UNI端口、宿节点、宿UNI端口、带宽、最大时延和保护等级等质量需求。
具体录入的业务UNI节点对信息如下表所示:
Figure PCTCN2020109048-appb-000001
Figure PCTCN2020109048-appb-000002
随后,可根据上表中信息,生成业务UNI节点对信息列表并存储。
在一个实施例中,在生成业务UNI节点对信息列表后,用户可网管系统已经存在的租户列表中选择一个租户作为承载切片的租户管理者,完成租户信息的设定和指定切片租户信息。
在一个实施例中,步骤S3具体包括:
根据所述业务UNI节点对信息列表,利用寻径算法,找到满足带宽、时延要求的多条路径;根据路径总数选择保留路径;将保留路径上所有节点和链路信息保存到以业务UNI节点对序号为关键字的MAP映射表中;对所有业务UNI节点对循环完成多路径寻路。本发明中使用的寻径算法可使用A-Star算法等算法具体执行。
具体的,在根据路径总数选择保留路径时,如当路径总数>3条, 且保护级别低于永久保护时,保留3条最优路径;如保护级别为永久保护或路径总数≤3条时,保留所有路径。在一个优选的实施例中,当保护级别为永久保护,但路径总数>10时,最多保留10条路径。
在另一个实施例中,步骤S4具体可包括:
对步骤S3中生成的MAP映射表进行循环比对,去除重复虚节点和虚链路信息,生成无重复信息的虚链路表;刷新计算重复虚链路的带宽和,这一步骤中无论虚链路是否重复,均要进行计算,主要是因为之前虽然去除了重复虚节点和链路对象,但是带宽需求还在,所以要把这些带宽累加起来,计算带宽之和;例如,某实施例中该虚链路在业务UNI节点序号1的路径上出现也在业务UNI节点序号2的路径上出现,每个业务UNI节点对上带宽需求为500M,则该虚链路计算后的带宽之和为1000M。
最后,根据所述无重复信息的虚链路表和所述带宽和,生成推荐的承载切片。
在另一个实施例中,在步骤S1后,由用户手动选择自动创建的切片是否需要手动修改。具体的,可在网管系统中提供非必选下拉列表给用户,由用户手动选择自动创建的切片是否需要手动修改,初始时可设置选项“可修改”和“不修改”,缺省值设置为“可修改”。当该步骤中选择自动创建的切片需要手动修改时,在步骤S4后还包括:S5、手动调整虚节点和虚链路,完成承载切片创建。
具体的,所述步骤S5可包括:
S51、判断是否接收到手动修改开关指令,如是转到步骤S52,如否,转到步骤S53;
S52、手动添加或删除虚节点和虚链路;其中,手动添加虚节点和虚链路步骤包括:提供区域拓扑所有虚节点和虚链路;用户在区域 拓扑上手动批量选择虚节点、虚链路加入到步骤S4中生成的虚节点和虚链路表中;手动删除虚节点和虚链路步骤包括:显示S4中生成的虚节点和虚链路表;用户手动操作从切片中移除虚节点和虚链路。
S53、生成承载切片的虚节点和虚链路表,并关联租户信息,完成承载切片的创建。
本发明不局限于上述实施方式,对于本技术领域的普通技术人员来说,在不脱离本发明原理的前提下,还可以做出若干改进和润饰,这些改进和润饰也视为本发明的保护范围之内。本说明书中未作详细描述的内容属于本领域专业技术人员公知的现有技术。

Claims (10)

  1. 一种承载网络快速切片的方法,其特征在于,包括以下步骤:
    S1、规划承载切片业务,录入切片类型和业务UNI节点对信息,生成业务UNI节点对信息列表;
    S2、根据切片类型在区域拓扑范围中生成隧道层拓扑;
    S3、根据业务UNI节点对信息,循环进行业务UNI节点对之间的多路径寻路;
    S4、综合计算多路径计算产生的虚节点和虚链路,生成推荐切片。
  2. 如权利要求1所述的承载网络快速切片的方法,其特征在于:在规划承载切片业务时,如网络规模较大,则估计承载切片的拓扑范围,在网络拓扑图中指定大于所述估计承载切片的拓扑范围的拓扑区域;如网络规模较小,则将网管系统管理的全网作为该区域网络拓扑。
  3. 如权利要求1所述的承载网络快速切片的方法,其特征在于:步骤S1中切片类型包括FlexE隧道切片、SR隧道切片、L2 VPN切片,L3 VPN切片和增强型VPN切片。
  4. 如权利要求1所述的承载网络快速切片的方法,其特征在于:步骤S1中所述业务UNI节点对信息包括业务UNI节点对信息、源节点、源UNI端口、宿节点、宿UNI端口、带宽、最大时延和保护等级。
  5. 如权利要求1所述的承载网络快速切片的方法,其特征在于,步骤S3具体包括:
    根据所述业务UNI节点对信息列表,利用寻径算法,找到满足带宽、时延要求的多条路径;
    根据路径总数选择保留路径;
    将保留路径上所有节点和链路信息保存到MAP映射表中,所述 MAP映射表记载包括业务UNI节点对序号的关键字;
    对所有业务UNI节点对循环完成多路径寻路。
  6. 如权利要求5所述的承载网络快速切片的方法,其特征在于,所述根据路径总数选择保留路径时,如当路径总数>3条,且保护级别低于永久保护时,保留3条最优路径;如保护级别为永久保护或路径总数≤3条时,保留所有路径。
  7. 如权利要求5所述的承载网络快速切片的方法,其特征在于,步骤S3具体包括:
    对步骤S3中生成的MAP映射表进行循环比对,去除重复虚节点和虚链路信息,生成无重复信息的虚链路表;
    刷新计算重复虚链路的带宽和;
    根据所述无重复信息的虚链路表和所述带宽和,生成推荐的承载切片。
  8. 如权利要求1所述的承载网络快速切片的方法,其特征在于,在步骤S4后还包括:S5、手动调整虚节点和虚链路,完成承载切片创建。
  9. 如权利要求8所述的承载网络快速切片的方法,其特征在于,所述步骤S5具体包括:
    S51、判断是否接收到手动修改开关指令,如是转到步骤S52,如否,转到步骤S53;
    S52、手动添加或删除虚节点和虚链路;
    S53、生成承载切片的虚节点和虚链路表,并关联租户信息,完成承载切片的创建。
  10. 如权利要求9所述的承载网络快速切片的方法,其特征在于:
    所述手动添加虚节点和虚链路步骤包括:提供区域拓扑所有虚节 点和虚链路;在区域拓扑上手动批量选择虚节点、虚链路加入到步骤S4中生成的虚节点和虚链路表中;
    所述手动删除虚节点和虚链路步骤包括:显示S4中生成的虚节点和虚链路表;手动操作从切片中移除虚节点和虚链路。
PCT/CN2020/109048 2019-08-21 2020-08-14 一种承载网络快速切片的方法 Ceased WO2021031986A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
BR112022001774A BR112022001774A2 (pt) 2019-08-21 2020-08-14 Método para o fatiamento rápido de uma rede de portadora

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN201910774337 2019-08-21
CN201910774337.0 2019-08-21
CN201911131206.7A CN112422310B (zh) 2019-08-21 2019-11-19 一种承载网络快速切片的方法
CN201911131206.7 2019-11-19

Publications (1)

Publication Number Publication Date
WO2021031986A1 true WO2021031986A1 (zh) 2021-02-25

Family

ID=74659828

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/109048 Ceased WO2021031986A1 (zh) 2019-08-21 2020-08-14 一种承载网络快速切片的方法

Country Status (2)

Country Link
BR (1) BR112022001774A2 (zh)
WO (1) WO2021031986A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113691897A (zh) * 2021-08-27 2021-11-23 烽火通信科技股份有限公司 一种端到端逆向创建eoo业务的方法与装置
CN114095075A (zh) * 2021-11-17 2022-02-25 国网宁夏电力有限公司信息通信公司 一种基于业务定制需求感知的光网络故障恢复方法
CN115051944A (zh) * 2022-07-15 2022-09-13 中国电信股份有限公司 端到端切片创建方法、装置、设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140317248A1 (en) * 2013-04-17 2014-10-23 Ciena Corporation Network technology interworking via user programmable event-action profiles
CN107453905A (zh) * 2017-07-31 2017-12-08 烽火通信科技股份有限公司 一种灵活以太网1:1保护倒换实现方法
US20180041424A1 (en) * 2016-08-05 2018-02-08 Huawei Technologies Co., Ltd. Slice/service-based routing in virtual networks
CN108419259A (zh) * 2018-02-11 2018-08-17 烽火通信科技股份有限公司 基于保留开销字段实现灵活以太网保护倒换的方法及系统
CN108809794A (zh) * 2017-05-04 2018-11-13 中兴通讯股份有限公司 基于sdn的传送网虚拟网络创建方法和装置及传送网络系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140317248A1 (en) * 2013-04-17 2014-10-23 Ciena Corporation Network technology interworking via user programmable event-action profiles
US20180041424A1 (en) * 2016-08-05 2018-02-08 Huawei Technologies Co., Ltd. Slice/service-based routing in virtual networks
CN108809794A (zh) * 2017-05-04 2018-11-13 中兴通讯股份有限公司 基于sdn的传送网虚拟网络创建方法和装置及传送网络系统
CN107453905A (zh) * 2017-07-31 2017-12-08 烽火通信科技股份有限公司 一种灵活以太网1:1保护倒换实现方法
CN108419259A (zh) * 2018-02-11 2018-08-17 烽火通信科技股份有限公司 基于保留开销字段实现灵活以太网保护倒换的方法及系统

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113691897A (zh) * 2021-08-27 2021-11-23 烽火通信科技股份有限公司 一种端到端逆向创建eoo业务的方法与装置
CN113691897B (zh) * 2021-08-27 2023-05-12 烽火通信科技股份有限公司 一种端到端逆向创建eoo业务的方法与装置
CN114095075A (zh) * 2021-11-17 2022-02-25 国网宁夏电力有限公司信息通信公司 一种基于业务定制需求感知的光网络故障恢复方法
CN115051944A (zh) * 2022-07-15 2022-09-13 中国电信股份有限公司 端到端切片创建方法、装置、设备及存储介质
CN115051944B (zh) * 2022-07-15 2023-07-21 中国电信股份有限公司 端到端切片创建方法、装置、设备及存储介质

Also Published As

Publication number Publication date
BR112022001774A2 (pt) 2022-03-22

Similar Documents

Publication Publication Date Title
CN112491636B (zh) 数据处理方法及装置、计算机存储介质
US8848544B2 (en) Event correlation using network data flow simulation over unmanaged network segments
CN103825954B (zh) 一种OpenFlow控制方法及相应插件、平台和网络
WO2022083540A1 (zh) 故障恢复预案确定方法、装置及系统、计算机存储介质
WO2021031986A1 (zh) 一种承载网络快速切片的方法
US10855530B2 (en) Method and apparatus for implementing composed virtual private network VPN
WO2021007963A1 (zh) 路由分发方法及控制器、信息路由方法及网络节点设备
EP3182656B1 (en) Method and device for discovering a network topology
CN103973567B (zh) 虚拟专用网络的路由配置方法及装置
CN106487558B (zh) 一种实现接入设备扩缩容的方法和装置
CN109660441B (zh) Overlay网络中组播复制的方法及装置
CN107294745B (zh) 网络拓扑自动发现方法及装置
WO2018113792A1 (zh) 广播报文的处理方法和处理装置、控制器和交换机
CN109067579A (zh) 面向底层节点失效的5g网络切片拓扑设计及可靠映射方法
CN104158745A (zh) 一种实现数据包转发的方法及系统
CN106302076B (zh) 建立vxlan隧道的方法、系统及sdn控制器
WO2019218649A1 (zh) 软件定义网络的路由获取方法、装置及存储介质
JP2019149772A (ja) ネットワーク装置、ネットワーク制御方法及びプログラム
CN103841026B (zh) 一种路由器ip协议栈的vpn路由管理系统及方法
CN101330411A (zh) 一种模拟大规模网络拓扑的方法和系统
CN104883321B (zh) 一种基于交换机负载的域内负载均衡方法
CN112422310B (zh) 一种承载网络快速切片的方法
US20240365119A1 (en) Systems and Methods for Detecting Domain Changes in an SD-WAN Environment
CN101316239B (zh) 一种在虚拟专用局域网业务网络中控制访问及转发的方法
Tao et al. Research and implementation of a network based on SDN and multi area OSPF protocol

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

Country of ref document: EP

Kind code of ref document: A1

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112022001774

Country of ref document: BR

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 112022001774

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20220131

122 Ep: pct application non-entry in european phase

Ref document number: 20854293

Country of ref document: EP

Kind code of ref document: A1