CN109525407B - 一种同层无交集全覆盖嵌套容器生成方法及可读存储介质 - Google Patents

一种同层无交集全覆盖嵌套容器生成方法及可读存储介质 Download PDF

Info

Publication number
CN109525407B
CN109525407B CN201710841726.1A CN201710841726A CN109525407B CN 109525407 B CN109525407 B CN 109525407B CN 201710841726 A CN201710841726 A CN 201710841726A CN 109525407 B CN109525407 B CN 109525407B
Authority
CN
China
Prior art keywords
layer
container
subgraphs
nodes
setting
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.)
Active
Application number
CN201710841726.1A
Other languages
English (en)
Other versions
CN109525407A (zh
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.)
Zhengzhou Xinrand Network Technology Co ltd
Original Assignee
Institute of Acoustics CAS
Beijing Hili Technology 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
Application filed by Institute of Acoustics CAS, Beijing Hili Technology Co Ltd filed Critical Institute of Acoustics CAS
Priority to CN201710841726.1A priority Critical patent/CN109525407B/zh
Priority to JP2020515114A priority patent/JP6862610B2/ja
Priority to KR1020207003076A priority patent/KR102317870B1/ko
Priority to EP17925419.8A priority patent/EP3687111B1/en
Priority to US16/632,629 priority patent/US11231954B2/en
Priority to PCT/CN2017/117699 priority patent/WO2019052076A1/zh
Publication of CN109525407A publication Critical patent/CN109525407A/zh
Application granted granted Critical
Publication of CN109525407B publication Critical patent/CN109525407B/zh
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • G06F9/45558Hypervisor-specific management and integration aspects
    • 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
    • H04L41/04Network management architectures or arrangements
    • H04L41/044Network management architectures or arrangements comprising hierarchical management structures
    • 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
    • H04L41/08Configuration management of networks or network elements
    • H04L41/0803Configuration setting
    • H04L41/0806Configuration setting for initial configuration or provisioning, e.g. plug-and-play
    • 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
    • H04L41/12Discovery or management of network topologies
    • H04L41/122Discovery or management of network topologies of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV]
    • 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
    • H04L41/40Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks using virtualisation of network functions or resources, e.g. SDN or NFV entities
    • 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
    • H04L41/50Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5041Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
    • H04L41/5054Automatic deployment of services triggered by the service manager, e.g. service implementation by automatic configuration of network components
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • G06F9/45558Hypervisor-specific management and integration aspects
    • G06F2009/45562Creating, deleting, cloning virtual machine instances
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • G06F9/45558Hypervisor-specific management and integration aspects
    • G06F2009/45566Nested virtual machines
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/455Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533Hypervisors; Virtual machine monitors
    • G06F9/45558Hypervisor-specific management and integration aspects
    • G06F2009/45595Network integration; Enabling network access in virtual machine instances

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

本发明涉及一种同层无交集全覆盖嵌套容器生成方法,包括:步骤1)给定一有权无向图G(V,E,W)与网络测量指标集合{Ti},用于对G中节点进行划分,每个网络测量指标Ti对应Ci层容器集合{Cik};步骤2)删除权重大于Ti的边,将G分割为若干子图,每个子图为连通分量;步骤3)将所述子图Gcm中未加入Ci层容器的所有节点设为集合L;步骤4)在集合L中,选择一个节点,作为当前锚点aj;步骤5)所述当前锚点aj为起点,广度优先搜索L中且在含有aj的Ci+1层容器内的所有与其连通的路径小于Ti的节点,形成一个以aj为锚点的Ci层容器;步骤6)设j’=j+1,判断L是否为空集;步骤7)设m=m+1,判断所有所述子图是否处理完毕;步骤8)设i=i‑1,判断是否满足i=1。

Description

一种同层无交集全覆盖嵌套容器生成方法及可读存储介质
技术领域
本发明属于网络技术和网络通信技术领域,具体涉及一种同层无交集全覆盖嵌套容器生成方法及可读存储介质。
背景技术
近些年来,随着移动互联网的迅猛发展,移动设备爆发式增长,不仅扩大了网络规模,而且急剧地增加了网络的动态性。由于互联网的网络设备连接关系复杂,有必要采用虚拟化技术在物理网络之上构建一个虚拟网络,通过建立节点之间的逻辑关系,以规避物理设备的异构性、动态性等所带来的问题。实际上,虚拟网络的结构及其一致性会直接关系到建立在虚拟网络上的应用的执行效率、寻址效率、扩展性、实时性等,尤其一些对节点位置准确度要求较高或对时延和抖动敏感的业务,如流媒体直播等,因动态性、移动性带来的问题日益突出。
根据结构及节点维护方式,现有虚拟网络分为非结构化和结构化两类。非结构化的虚拟网络的邻居节点是随意的,信息资源在网络中存放的位置与网络本身的拓扑无关,而结构化的虚拟网络的邻居节点是有规律的,拓扑结构受到了严格的控制。其中,结构化的虚拟网络,因其对节点的有效组织以及拓扑结构的可控性,在网络流量控制和寻址效率性能上普遍优于非结构化的虚拟网络,受到大家持续的关注。但是,现有的结构化的虚拟网络,无法满足移动接入、普适计算、分布式信息处理、海量流媒体等新应用的发展需求,不能解决异构性、动态性、移动性、不一致性等问题,因此,如何构造一个结构化的虚拟网络,以适应包括信息中心网络在内的大规模高动态的未来网络环境,是学术界和工业界一直在探讨和有待解决的问题。
容器(Container)技术通过提供高性能可伸缩的应用管理服务,来简化用户对管理集群的搭建工作,无缝整合虚拟化、存储、网络和安全能力。以典型的Docker容器为例,它是一个开源的应用引擎,让开发者可以打包应用到一个可移植的容器中,然后发布到任何流行的Linux机器上,也可以实现虚拟化。它是完全使用沙箱机制,相互之间不会有任何接口,几乎没有性能开销,可以很容易地在机器和数据中心中运行,不依赖于任何编程语言。但是,现有的容器生成方法还不能通过嵌套的形式来构造一个有大量异构节点组成的大型结构化虚拟网络,从而难以适应大规模高动态的未来网络环境。
发明内容
本发明的目的在于,为了解决现有容器的生成方法存在上述问题,本发明提供了一种同层无交集全覆盖嵌套容器生成方法,依据网络测量结果进行节点划分、组织信息和资源的方法,以解决异构性、动态性、移动性、地理分布性等带来的网络问题,满足网络节点管理中的时延敏感性、复杂性、扩展性、灵活性等需求,以适应包括信息中心网络在内的未来网络的发展。
为了实现上述目的,本发明提供了一种同层无交集全覆盖嵌套容器生成方法,具体包括:
步骤1)给定一个有权无向图G(V,E,W)与网络测量指标集合{Ti},用于对所述有权无向图G中的节点进行划分,使每个网络测量指标Ti对应一个Ci层容器集合{Cik};
其中,网络测量指标Ti具体为时延或跳数或带宽,Ti<Ti+1,1≤i≤I-1,I为常数,0≤k≤K-1,K为Ci层容器的个数,将层数i初始化为I-1;
步骤2)删除权重大于Ti的边,将步骤1)中的有权无向图G分割为若干个子图,每个所述子图为一个连通分量;将所述若干子图按照节点数从小到大排列,其中,每个所述子图记为Gcm=(Vcm,Ecm,Wcm);其中,1≤m≤M,M为子图个数,m为子图序列号,并将子图数m初始化为1;如果所述若干子图中存在p个孤立节点,则直接将每个孤立节点都设为锚点,成为各自独立的Ci层容器,并设j’=j+p;m=m+p;并将锚点数j初始化为1;
步骤3)将在步骤2)中的所述子图Gcm中未加入Ci层容器的所有节点设为集合L;
步骤4)在步骤3)的集合L中,选择一个节点,作为当前锚点,记为aj;
步骤5)以所述当前锚点aj为起点,广度优先搜索集合L中且在含有aj的Ci+1层容器内的所有与其连通的路径小于Ti的节点,形成一个以aj为锚点的Ci层容器;
步骤6)设j’=j+1,判断集合L是否为空集;如果集合L为空集,则转至下一步骤,如果集合L不为空集,则返回步骤3),直至所述集合L为空集为止;
步骤7)设m=m+1,判断所有所述子图是否处理完毕;如果所有所述子图处理完毕,则转至下一步骤,如果所述子图没有处理完毕,则返回步骤3),直到所有所述子图处理完毕为止;
步骤8)设i=i-1,判断是否满足i=1;如果满足i=1,则结束,所有所述Ci容器构造完毕;如果不满足i=1,则返回步骤2),直到所有所述Ci容器构造完毕为止。
采用自顶向下的方式来构造和嵌套所述Ci容器,所述Ci容器的层数逐渐变小。
优选地,步骤4)中,选择集合L中带宽、计算、存储等性能指标最好的节点作为当前锚点;
在上述技术方案中,所述的步骤1)中的有权无向图G(V,E,W),其中,V为包括任何具有独立地址的网元设备在内的节点集合,E为在测量记录中节点间的边集合,W为在测量记录中节点间的权重集合。
在上述技术方案中,所述的步骤1)中,i=1时,C1层容器为底层容器,由多个网元设备构成,C2层容器由若干C1层容器构成,依此类推,第I层为顶层容器CI,由若干个CI-1层容器构成。
本发明还提供了一种计算机可读存储介质,其上存储有计算机程序,该计算机程序被处理器执行时,通过上述的同层无交集全覆盖的嵌套容器生成方法来实现。
本发明的优点在于:本发明的方法具有时延敏感、易于管理、扩展性好、灵活性好等优点,依据网络测量结果进行节点划分、组织信息和资源的方法,以解决异构性、动态性、移动性、地理分布性等带来的网络问题,以适应包括信息中心网络在内的未来网络特别是下一代移动通信的发展。
附图说明
图1是本发明的一种同层无交集全覆盖的嵌套容器生成方法的流程图。
具体实施方式
如图1所示,本发明提供了一种同层无交集全覆盖嵌套容器生成方法,具体包括:
步骤1)给定一个有权无向图G(V,E,W)与网络测量指标集合{Ti},用于对所述有权无向图G中的节点进行划分,使每个网络测量指标Ti对应一个Ci层容器集合{Cik};
其中,网络测量指标Ti具体为时延或跳数或带宽,Ti<Ti+1,1≤i≤I-1,I为常数,0≤k≤K-1,K为Ci层容器的个数,将层数i初始化为I-1;
步骤2)删除权重大于Ti的边,将步骤1)中的有权无向图G分割为若干个子图,每个所述子图为一个连通分量;将所述若干子图按照节点数从小到大排列,其中,每个所述子图记为Gcm=(Vcm,Ecm,Wcm);其中,1≤m≤M,M为子图个数,m为子图序列号,并将子图数m初始化为1;这里的c并不是参数,c的意思是child,只是一个标记,代表子图,主要作用是区分G与Gc有所不同。如果所述若干子图中存在p个孤立节点,则直接将每个孤立节点都设为锚点,成为各自独立的Ci层容器,并设j’=j+p;m=m+p;并将锚点数j初始化为1;
步骤3)将在步骤2)中的所述子图Gcm中未加入Ci层容器的所有节点设为集合L;
步骤4)在步骤3)的集合L中,选择一个节点,作为当前锚点,记为aj;
步骤5)以所述当前锚点aj为起点,广度优先搜索集合L中且在含有aj的Ci+1层容器内的所有与其连通的路径小于Ti的节点,形成一个以aj为锚点的Ci层容器;
步骤6)设j’=j+1,判断集合L是否为空集;如果集合L为空集,则转至下一步骤,如果集合L不为空集,则返回步骤3),直至所述集合L为空集为止;
步骤7)设m=m+1,判断所有所述子图是否处理完毕;如果所有所述子图处理完毕,则转至下一步骤,如果所述子图没有处理完毕,则返回步骤3),直到所有所述子图处理完毕为止;
步骤8)设i=i-1,判断是否满足i=1;如果满足i=1,则结束,所有所述Ci容器构造完毕;如果不满足i=1,则返回步骤2),直到所有所述Ci容器构造完毕为止。
采用自顶向下的方式来构造和嵌套所述Ci容器,所述Ci容器的层数逐渐变小。
优选地,步骤4)中,选择集合L中带宽、计算、存储等性能指标最好的节点作为当前锚点;
在上述技术方案中,所述的步骤1)中的有权无向图G(V,E,W),其中,V为包括任何具有独立地址的网元设备在内的节点集合,E为在测量记录中节点间的边集合,W为在测量记录中节点间的权重集合。
在上述技术方案中,所述的步骤1)中,i=1时,C1层容器为底层容器,由多个网元设备构成,C2层容器由若干C1层容器构成,依此类推,第I层为顶层容器CI,由若干个CI-1层容器构成。
本发明还提供了一种计算机可读存储介质,其上存储有计算机程序,该计算机程序被处理器执行时,通过上述的同层无交集全覆盖的嵌套容器生成方法来实现。
最后所应说明的是,以上实施例仅用以说明本发明的技术方案而非限制。尽管参照实施例对本发明进行了详细说明,本领域的普通技术人员应当理解,对本发明的技术方案进行修改或者等同替换,都不脱离本发明技术方案的精神和范围,其均应涵盖在本发明的权利要求范围当中。

Claims (5)

1.一种同层无交集全覆盖嵌套容器生成方法,具体包括:
步骤1)给定一个有权无向图G(V,E,W)与网络测量指标集合{Ti},用于对所述有权无向图G中的节点进行划分,使每个网络测量指标Ti对应一个Ci层容器集合{Ci k};其中,V为包括任何具有独立地址的网元设备在内的节点集合,E为在测量记录中节点间的边集合,W为在测量记录中节点间的权重集合;
其中,网络测量指标Ti具体为时延或跳数或带宽,Ti<Ti+1,1≤i≤I-1,I为常数,0≤k≤K-1,K为Ci层容器的个数,将层数i初始化为I-1;
步骤2)删除权重大于Ti的边,将步骤1)中的有权无向图G分割为若干个子图,每个所述子图为一个连通分量;将所述若干个子图按照节点数从小到大排列,其中,每个所述子图记为Gcm=(Vcm,Ecm,Wcm);其中,1≤m≤M,M为子图个数,m为子图序列号,并将子图数M初始化为1;如果所述若干个子图中存在p个孤立节点,则直接将每个孤立节点都设为锚点,成为各自独立的Ci层容器,并设j=j+p;m=m+p;并将锚点数j初始化为1;
步骤3)将在步骤2)中的所述子图Gcm中未加入Ci层容器的所有节点设为集合L;
步骤4)在步骤3)的集合L中,选择一个节点,作为当前锚点,记为aj;
步骤5)以所述当前锚点aj为起点,广度优先搜索集合L中且在含有aj的Ci+1层容器内的所有与其连通的路径小于Ti的节点,形成一个以aj为锚点的Ci层容器;
步骤6)设j=j+1,判断集合L是否为空集;如果集合L为空集,则转至下一步骤,如果集合L不为空集,则返回步骤3),直至所述集合L为空集为止;
步骤7)设m=m+1,判断所有所述子图是否处理完毕;如果所有所述子图处理完毕,则转至下一步骤,如果所述子图没有处理完毕,则返回步骤3),直到所有所述子图处理完毕为止;
步骤8)设i=i-1,判断是否满足i=1;如果满足i=1,则结束,所有所述Ci层容器构造完毕;如果不满足i=1,则返回步骤2),直到所有所述Ci层容器构造完毕为止。
2.根据权利要求1所述的同层无交集全覆盖嵌套容器生成方法,其特征在于,采用自顶向下的方式来构造和嵌套所述Ci层容器,所述Ci层容器的层数逐渐变小。
3.根据权利要求1所述的同层无交集全覆盖嵌套容器生成方法,其特征在于,步骤4)中,选择集合L中带宽、计算和存储性能指标最好的节点作为当前锚点。
4.根据权利要求1所述的同层无交集全覆盖嵌套容器生成方法,其特征在于,所述的步骤1)中,i=1时,C1层容器为底层容器,由多个网元设备构成,C2层容器由若干C1层容器构成,依此类推,第I层为顶层容器CI,由若干个CI-1层容器构成。
5.一种计算机可读存储介质,在其上存储有计算机程序,其特征在于,该计算机程序被处理器执行时,实现如上述权利要求1-4中任一的所述同层无交集全覆盖嵌套容器生成方法。
CN201710841726.1A 2017-09-18 2017-09-18 一种同层无交集全覆盖嵌套容器生成方法及可读存储介质 Active CN109525407B (zh)

Priority Applications (6)

Application Number Priority Date Filing Date Title
CN201710841726.1A CN109525407B (zh) 2017-09-18 2017-09-18 一种同层无交集全覆盖嵌套容器生成方法及可读存储介质
JP2020515114A JP6862610B2 (ja) 2017-09-18 2017-12-21 ネストコンテナの生成方法及び読み取り可能な記憶媒体
KR1020207003076A KR102317870B1 (ko) 2017-09-18 2017-12-21 동일한 층의 무 교집 풀 커버 내포 컨테이너 생성 방법 및 판독 가능 저장 매체
EP17925419.8A EP3687111B1 (en) 2017-09-18 2017-12-21 Method for generating nested container with no intersection and full coverage in the same layer and readable storage medium
US16/632,629 US11231954B2 (en) 2017-09-18 2017-12-21 Method for generating nested container with no intersection and full coverage in the same layer and readable storage medium
PCT/CN2017/117699 WO2019052076A1 (zh) 2017-09-18 2017-12-21 一种同层无交集全覆盖嵌套容器生成方法及可读存储介质

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710841726.1A CN109525407B (zh) 2017-09-18 2017-09-18 一种同层无交集全覆盖嵌套容器生成方法及可读存储介质

Publications (2)

Publication Number Publication Date
CN109525407A CN109525407A (zh) 2019-03-26
CN109525407B true CN109525407B (zh) 2020-05-26

Family

ID=65722363

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710841726.1A Active CN109525407B (zh) 2017-09-18 2017-09-18 一种同层无交集全覆盖嵌套容器生成方法及可读存储介质

Country Status (6)

Country Link
US (1) US11231954B2 (zh)
EP (1) EP3687111B1 (zh)
JP (1) JP6862610B2 (zh)
KR (1) KR102317870B1 (zh)
CN (1) CN109525407B (zh)
WO (1) WO2019052076A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116015936B (zh) * 2022-12-30 2024-05-03 中国联合网络通信集团有限公司 一种安全能力编排方法、装置及计算机可读存储介质

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104391889A (zh) * 2014-11-11 2015-03-04 西安交通大学 一种面向有向-加权网络的社区结构发现方法
CN106355251A (zh) * 2016-04-29 2017-01-25 北京大学 一种数据处理装置及数据处理方法

Family Cites Families (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002011048A2 (en) * 2000-07-31 2002-02-07 Agilix Corporation Visualization and manipulation of biomolecular relationships using graph operators
US8990397B2 (en) * 2009-07-31 2015-03-24 Ntt Docomo, Inc. Resource allocation protocol for a virtualized infrastructure with reliability guarantees
CN101931543A (zh) 2010-09-03 2010-12-29 浙江大学 一种基于覆盖网络组播系统的动态节点高效管理方法
US8434150B2 (en) * 2011-03-24 2013-04-30 Microsoft Corporation Using social graphs to combat malicious attacks
CN102223281B (zh) * 2011-06-24 2013-09-04 清华大学 基于虚拟网络资源需求动态变化的再映射方法
CN102364899A (zh) 2011-11-16 2012-02-29 北京邮电大学 一种基于粒子群优化的虚拟网络映射方法及系统
WO2013091221A1 (en) * 2011-12-22 2013-06-27 Intel Corporation Enabling efficient nested virtualization
CN103150435B (zh) * 2013-03-12 2015-10-28 清华大学 时钟节点结群方法以及时钟网络结构
US9842125B2 (en) * 2013-04-24 2017-12-12 Atlys, Inc. Nested media container, panel and organizer
US9642077B2 (en) * 2013-10-23 2017-05-02 Cisco Technology, Inc. Node selection in virtual evolved packet core
US9202178B2 (en) * 2014-03-11 2015-12-01 Sas Institute Inc. Computerized cluster analysis framework for decorrelated cluster identification in datasets
CN103888982B (zh) * 2014-03-28 2018-10-16 北京邮电大学 一种内容中心无线网络中的管理与控制节点选择方法
AU2015353434B2 (en) * 2014-11-28 2018-08-23 Huawei Technologies Co., Ltd. Systems and methods for providing customized virtual wireless networks based on service oriented network auto-creation
US10129097B2 (en) * 2015-06-02 2018-11-13 ALTR Solutions, Inc. GUI and high-level API wrapper for software defined networking and software defined access for controlling network routing and rules
JP6466789B2 (ja) * 2015-06-22 2019-02-06 日本電信電話株式会社 物理経路割当装置、物理経路割当方法、及びプログラム
JP6389811B2 (ja) * 2015-07-23 2018-09-12 日本電信電話株式会社 物理リソース割当装置、物理リソース割当方法、及びプログラム
DE102015112540A1 (de) * 2015-07-30 2017-02-16 Bayerische Motoren Werke Aktiengesellschaft Verfahren und Vorrichtung zum Beschichten einer Oberfläche
WO2017107215A1 (zh) * 2015-12-25 2017-06-29 华为技术有限公司 一种数据中心内服务功能体部署方法、装置及控制器
CN106095579B (zh) * 2016-06-14 2019-06-07 中国联合网络通信集团有限公司 容器资源分配方法及装置
KR102460416B1 (ko) * 2016-10-24 2022-10-28 삼성에스디에스 주식회사 컨테이너 기반의 분산 애플리케이션 관리 시스템 및 방법
US10410098B2 (en) * 2017-04-24 2019-09-10 Intel Corporation Compute optimizations for neural networks

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104391889A (zh) * 2014-11-11 2015-03-04 西安交通大学 一种面向有向-加权网络的社区结构发现方法
CN106355251A (zh) * 2016-04-29 2017-01-25 北京大学 一种数据处理装置及数据处理方法

Also Published As

Publication number Publication date
US20200167182A1 (en) 2020-05-28
CN109525407A (zh) 2019-03-26
KR20200021532A (ko) 2020-02-28
WO2019052076A1 (zh) 2019-03-21
JP2020533915A (ja) 2020-11-19
KR102317870B1 (ko) 2021-10-25
US11231954B2 (en) 2022-01-25
EP3687111A4 (en) 2021-06-02
EP3687111B1 (en) 2022-09-28
EP3687111A1 (en) 2020-07-29
JP6862610B2 (ja) 2021-04-21

Similar Documents

Publication Publication Date Title
Xia et al. Cost-effective app data distribution in edge computing
Mohan et al. Edge-Fog cloud: A distributed cloud for Internet of Things computations
Cao et al. Novel node-ranking approach and multiple topology attributes-based embedding algorithm for single-domain virtual network embedding
Abdulazeez et al. Offloading mechanisms based on reinforcement learning and deep learning algorithms in the fog computing environment
Li et al. Resource allocation with multi-factor node ranking in data center networks
CN107615792B (zh) 用于mtc事件的管理方法与系统
CA2701107C (en) Method and apparatus for concurrent topology discovery
Dimitrios et al. Simulation and performance evaluation of a fog system
CN109525407B (zh) 一种同层无交集全覆盖嵌套容器生成方法及可读存储介质
Subrahmanyam et al. Optimizing horizontal scalability in cloud computing using simulated annealing for Internet of Things
Fajjari et al. Cloud networking: An overview of virtual network embedding strategies
CN107257356B (zh) 一种基于超图分割的社交用户数据优化放置方法
Shefu et al. Fruit fly optimization algorithm for network-aware web service composition in the cloud
Lim et al. Virtual network embedding based on hierarchical cooperative multi-agent reinforcement learning
Kulathumani et al. Trail: A distance-sensitive sensor network service for distributed object tracking
Wen et al. An efficient resource embedding algorithm in software defined virtualized data center
Wang et al. Virtual network embedding with pre‐transformation and incentive convergence mechanism
Štefanič et al. Quality of Service‐aware matchmaking for adaptive microservice‐based applications
Chen et al. Fog computing support scheme based on fusion of location service and privacy preservation for QoS enhancement
Kang et al. Towards Scalability of Dense Sensor Networks: A Software-Defined Networking Approach
Zeng et al. Fork and join queueing networks with heavy tails: Scaling dimension and throughput limit
Shi et al. Novel node‐ranking approach for SDN‐based virtual network embedding
Selvarani et al. Enhanced two stage heuristics algorithm for VM scheduling
Wu et al. Algorithms for replica placement and update in tree network
Wang et al. A Container Migration Method for Edge Environments Based on Malicious Traffic Detection

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
TR01 Transfer of patent right
TR01 Transfer of patent right

Effective date of registration: 20220916

Address after: Room 1601, 16th Floor, East Tower, Ximei Building, No. 6 Changchun Road, High-tech Industrial Development Zone, Zhengzhou City, Henan Province, 450000

Patentee after: Zhengzhou xinrand Network Technology Co.,Ltd.

Address before: 100190, No. 21 West Fourth Ring Road, Beijing, Haidian District

Patentee before: INSTITUTE OF ACOUSTICS, CHINESE ACADEMY OF SCIENCES

Patentee before: BEIJING ZHONGKE HAILI TECHNOLOGY Co.,Ltd.