专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2006099883A1 SYSTEM AND METHOD FOR TRANSPORTING DATA UNITS THROUGH A COMMUNICATION NETWORK 审中-公开
标题翻译：通过通信网络传输数据单元的系统和方法
公开(公告)号：WO2006099883A1
公开(公告)日：2006-09-28
申请号：PCT/EP2005/003113
申请日：2005-03-23
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (publ) , MEYER, Michael , WIEMANN, Henning , LUDWIG, Reiner , SACHS, Joachim , BAUCKE, Stephan
发明人： MEYER, Michael , WIEMANN, Henning , LUDWIG, Reiner , SACHS, Joachim , BAUCKE, Stephan
IPC分类号： H04L29/06 , H04L12/56
CPC分类号： H04L69/16 , H04L47/10 , H04L47/193 , H04L47/263 , H04L47/35 , H04L47/40 , H04L69/08 , H04L69/163
摘要： A system and method for transporting data units for a communication network. In a communication (1) between two peers (10, 13) a proxy (11) and a network entity (12) for controlling a partial communication are provided. One or both of the proxy (11) and the network entity (12) is arranged to modify one or more of the data units, in order to provide communication control related information that is different from communication control related information exchanged between the two peers (10, 13). The respective other or both of the proxy (11) and the network entity (12) is arranged to perform data unit transmission control based on the different communication control related information.
摘要翻译：一种用于传送通信网络的数据单元的系统和方法。在两个对等体（10,13）之间的通信（1）中，提供了用于控制部分通信的代理（11）和网络实体（12）。代理（11）和网络实体（12）中的一个或两个被布置成修改数据单元中的一个或多个，以便提供与两个对等体之间交换的与通信控制相关信息不同的通信控制相关信息（ 10，13）。代理（11）和网络实体（12）中的相应的其他或两者被布置为基于不同的通信控制相关信息执行数据单元传输控制。

2. 发明申请

WO2009071431A1 ALLOCATION OF RESOURCES TO SHARED SPECTRUM OPERATORS 审中-公开
标题翻译：资源分配给共享操作员
公开(公告)号：WO2009071431A1
公开(公告)日：2009-06-11
申请号：PCT/EP2008/065621
申请日：2008-11-14
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (publ) , BAUCKE, Stephan , SACHS, Joachim , WIEMANN, Henning
发明人： BAUCKE, Stephan , SACHS, Joachim , WIEMANN, Henning
IPC分类号： H04W28/16
CPC分类号： H04W16/14 , H04M15/00 , H04M15/58 , H04M15/8044 , H04M2215/0188 , H04M2215/745 , H04W4/24 , H04W28/16
摘要： A system operator may connect to an infrastructure resource and request a slice of spectrum resources with desired properties and a desired capacity. A slice manager of the infrastructure resource checks whether the request can be fulfilled from the available free capacity and optionally considers additional policies. If the outcome is positive, the slice manager offers a slice with a specific capacity, which may or may not be identical to the system operator' s requested capacity. The offer may contain other information such as cost and billing details. In case the offer is acceptable to the system operator, he sends an accept message to the slice, manager. Optionally, there may be additional negotiation steps.
摘要翻译：系统操作者可以连接到基础设施资源并且请求具有所需属性和期望容量的频谱资源片段。基础架构资源的切片管理器可以检查请求是否可以从可用的可用容量中获得满足，并可选地考虑其他策略。如果结果是肯定的，则切片管理器提供具有特定容量的切片，其可以或可以不与系统操作者的请求容量相同。优惠可能包含其他信息，如费用和结算明细。如果报价对于系统运营商来说是可以接受的，那么他会向切片管理者发送接受消息。可选地，可以存在额外的协商步骤。

3. 发明申请

WO2012045338A1 APPLICATION ALLOCATION IN DATACENTERS 审中-公开
标题翻译：应用分配在DATACENTERS
公开(公告)号：WO2012045338A1
公开(公告)日：2012-04-12
申请号：PCT/EP2010/064905
申请日：2010-10-06
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (publ) , NIEMOELLER, Joerg , BAUCKE, Stephan
发明人： NIEMOELLER, Joerg , BAUCKE, Stephan
IPC分类号： G06F9/50
CPC分类号： H04L29/08297 , G06F9/505
摘要： An allocation entity of a datacenter is provided, wherein said allocation entity being configured: to receive an application allocation request for allocating an application to one of a plurality of processing units of the datacenter, the application allocation request comprising application network load information; to acquire path network load information indicating network load of network paths to at least a part of the plurality of processing units; and to select a processing unit from the plurality of processing units for allocating the application based on the application network load information and the path network load information.
摘要翻译：提供数据中心的分配实体，其中所述分配实体被配置为：接收应用分配请求，以将应用分配给所述数据中心的多个处理单元之一，所述应用分配请求包括应用网络负载信息; 获取指示到所述多个处理单元的至少一部分的网络路径的网络负载的路径网络负载信息; 并且从多个处理单元中选择基于应用网络负载信息和路径网络负载信息来分配应用的处理单元。

4. 发明申请

WO2007110096A1 METHOD AND TERMINATION NODE FOR BUNDLING MULTIPLE MESSAGES INTO A PACKET 审中-公开
标题翻译：用于将多个消息嵌入到分组中的方法和终止节点
公开(公告)号：WO2007110096A1
公开(公告)日：2007-10-04
申请号：PCT/EP2006/002805
申请日：2006-03-28
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , BAUCKE, Stephan , SAUERMANN, Jürgen , BRUSS, Jörg
发明人： BAUCKE, Stephan , SAUERMANN, Jürgen , BRUSS, Jörg
IPC分类号： H04L12/56
CPC分类号： H04L49/90
摘要： The invention relates to a method and a termination node for bundling multiple messages into a packet having a predetermined maximum size. The total size of messages received from an upper layer is checked if it is large enough to fill the maximum-sized packet. If not, the receipt of further messages is waited for a bundling delay time and if the bundling delay time has expired the messages received during said delay time are bundled into the packet. In order to ensure primarily a maximal bundling efficiency and secondarily a lowest possible delay time for the received messages before they are bundled the bundling delay time is calculated in response to an average arrival rate and an average size of the previously received messages such that the bundling delay time corresponds to an average time to fill the packet of the predetermined maximum size.
摘要翻译：本发明涉及一种用于将多个消息捆绑成具有预定最大大小的分组的方法和终止节点。检查从上层接收到的消息的总大小是否足够大以填满最大大小的数据包。如果不是，则等待捆绑延迟时间的进一步消息的接收，并且如果捆绑延迟时间已经到期，则在所述延迟时间期间接收到的消息被捆绑到分组中。为了在接收的消息被捆绑之前确保主要的最大捆绑效率和次要的最低可能的延迟时间，响应于先前接收到的消息的平均到达速率和平均大小来计算捆绑延迟时间，使得捆绑延迟时间对应于填充预定最大尺寸的分组的平均时间。

5. 发明申请

WO2009127225A1 METHOD AND SYSTEM FOR PROVIDING TRUSTWORTHINESS OF COMMUNICATION 审中-公开
标题翻译：用于提供通信信任的方法和系统
公开(公告)号：WO2009127225A1
公开(公告)日：2009-10-22
申请号：PCT/EP2008/002993
申请日：2008-04-15
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL) , EL KHAYAT, Ibitissam , BAUCKE, Stephan
发明人： EL KHAYAT, Ibitissam , BAUCKE, Stephan
IPC分类号： H04L29/06 , H04L12/56
CPC分类号： H04L63/104 , H04L45/04 , H04L45/46 , H04L63/126 , H04W40/32
摘要： A method and system of providing trustworthiness of communication among a plurality of communication nodes is described. This comprises arranging each of said communication nodes to perform a trustworthiness judging operation on received data elements for judging a received packet to be trustworthy or not, grouping said plurality of communication nodes into a plurality of distinguishable clusters, each cluster comprising at least two of said communication nodes, implementing in each respective cluster an intra-cluster trust mechanism such that trustworthiness of data elements sent by any member node of said respective cluster is judgable within said respective cluster, arranging said clusters such that each of said clusters comprises one or more multi-cluster-member nodes that belong to at least two different of said clusters, and routing inter-cluster traffic through said multi-cluster-member nodes.
摘要翻译：描述了提供多个通信节点之间的通信可信度的方法和系统。这包括安排每个所述通信节点对接收到的数据元素执行可信赖性判断操作，用于将接收到的分组判断为是可信赖的，将所述多个通信节点分组为多个可区分的群集，每个群集包括至少两个所述通信节点，在每个相应集群中实现集群内信任机制，使得由所述相应集群的任何成员节点发送的数据元素的可信赖性在所述相应集群内是可判断的，将所述集群设置为使得每个所述集群包括一个或多个多个集群 - 属于至少两个不同的所述集群的集群成员节点，以及通过所述多集群成员节点路由集群间流量。

6. 发明申请

WO2017191489A1 DISTRIBUTED NETWORK-AWARE SERVICE PLACEMENT UTILIZING CONSTRAINED KERNIGHAN-LIN HEURISTIC MODELS 审中-公开
标题翻译：分布式网络服务布局使用受约束的金斯林启发式模型
公开(公告)号：WO2017191489A1
公开(公告)日：2017-11-09
申请号：PCT/IB2016/052519
申请日：2016-05-03
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
发明人： YAZIR, Yagiz Onat , HALÉN, Joacim , ABBASI, Zahra , BAUCKE, Stephan
IPC分类号： G06F9/50
CPC分类号： G06F9/5072 , G06F9/5066
摘要： Distributed agents perform network-aware service placement utilizing a modified constrained Kernighan-Lin (KL) based heuristic model. In a first phase, the distributed control agents cooperate to compute a set of placement solutions that meet the computational requirements. In the second phase, the constrained KL heuristic model is utilized to identify placements within that solution space that push the network load to the lower levels of the cloud infrastructure to thereby reduce the network load at the core and aggregate levels of the cloud system switching fabric. The constrained KL heuristic model generates initial partitions that are compliant with placement solutions provided by child agents, and gains are calculated only for admissible swaps.
摘要翻译：分布式代理使用修改的约束Kernighan-Lin（KL）启发式模型执行网络感知服务布局。在第一阶段，分布式控制代理合作计算满足计算要求的一组布局解决方案。在第二阶段，利用受约束的KL启发式模型来识别解决方案空间内的布局，将网络负载推送到云基础架构的较低级别，从而降低云系统交换结构的核心和聚合级别的网络负载。受约束的KL启发式模型生成的初始分区符合子代理商提供的安置解决方案，并且收益仅针对可接受的交换进行计算。

7. 发明申请

WO2017199069A1 DECENTRALIZED SERVICE PLACEMENT IN CLOUD PLATFORMS USING MONOTONICALLY DECREASING SEQUENCES OF VIRTUAL MACHINE TYPES 审中-公开
标题翻译：使用虚拟机类型的单调减少序列在云平台中分散服务放置
公开(公告)号：WO2017199069A1
公开(公告)日：2017-11-23
申请号：PCT/IB2016/054623
申请日：2016-08-01
申请人： TELEFONAKTIEBOLAGET LM ERICSSON (PUBL)
发明人： ABBASI, Zahra , YAZIR, Yagiz Onat , HALÉN, Joacim , KEMPF, James , BAUCKE, Stephan
IPC分类号： G06F9/50
CPC分类号： G06F9/5072 , G06F9/5066 , G06F9/5077 , G06F2209/503
摘要： Exemplary techniques for decentralized service placement in cloud platforms using monotonically decreasing sequences of virtual machine (VM) types are described. A root agent in a hierarchy of agents can receive service requests, transform these into sequences of strictly monotonically decreasing VM types according to at least one of their dimensions, and pass the sequences along with size ratios down through the hierarchy to arrive at leaf nodes. The leaf nodes can each, perhaps in parallel, generate compact feasible VM vectors indicating possible placements of some or all of the components of the service request that one or more computing devices associated with each agent can locally provide. The feasible VM vectors can be passed back up through the hierarchy and be merged as they flow through the hierarchy, allowing the root agent to quickly and accurately determine whether the service request may be fulfilled, and possibly place the service.
摘要翻译：描述了使用单调减少的虚拟机（VM）类型序列来在云平台中分散式服务布置的示例性技术。代理层次结构中的根代理可以接收服务请求，根据它们的维度中的至少一个将它们转换为严格单调递减的VM类型的序列，并且将序列与大小比率一起向下通过分层结构以到达叶节点。每个叶节点可以并行地生成紧凑的可行VM向量，其指示与每个代理关联的一个或多个计算设备可本地提供的服务请求的部分或全部组件的可能布置。可行的虚拟机向量可以通过层次传回，并在流经层次结构时进行合并，使得根代理可以快速准确地确定是否可以实现服务请求，并可能放置服务。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式