公开(公告)号：US20140237071A1

公开(公告)日：2014-08-21

申请号：US14346979

申请日：2011-09-30

申请人： Erik Friman ,  Åke Arvidsson ,  Lars Westberg

发明人： Erik Friman ,  Åke Arvidsson ,  Lars Westberg

IPC分类号： G06F15/173

CPC分类号： G06F15/17331 ,  G06F17/30902 ,  H04L67/2847

摘要： There is described a method for optimising the distribution of data objects between caches in a cache domain of a resource limited network. User requests for data objects are received at caches in the cache domain. A notification is sent from each cache at which a request is received to a cache manager. The notification reports the user request and identifies the requested data object. At the cache manager, object information including the request frequency of each requested data object and the locations of the caches at which the requests were received is collated and stored. At the cache manager, objects for distribution within the cache domain are identified on the basis of the object information. Instructions are sent from the cache manager to the caches to distribute data objects stored in those caches between themselves. The objects are classified into classes according to popularity, the classes including a high popularity class comprising objects which should be distributed to all caches in the cache domain, a medium popularity class comprising objects which should be distributed to a subset of the caches in the cache domain, and a low popularity class comprising objects which should not be distributed.

摘要翻译： 描述了用于优化资源有限网络的高速缓存域中的高速缓存之间的数据对象的分布的方法。 数据对象的用户请求在高速缓存域中的高速缓存中接收。 从接收到请求的每个高速缓存发送到高速缓存管理器的通知。 通知报告用户请求并标识所请求的数据对象。 在缓存管理器中，对包含每个请求数据对象的请求频率的对象信息和接收请求的高速缓存的位置进行整理并存储。 在缓存管理器中，基于对象信息来识别用于在缓存域内分发的对象。 指令从高速缓存管理器发送到高速缓存，以分配存储在这些缓存之间的数据对象。 根据流行度将对象分类为类，包括包括应分配给高速缓存域中的所有高速缓存的对象的高人气等级的类，包括应分配给高速缓存中的高速缓存的子集的对象的中等流行级 域，以及包含不应该分发的对象的低人气等级。

公开(公告)号：US20140126538A1

公开(公告)日：2014-05-08

申请号：US14127358

申请日：2011-06-23

申请人： Attila Mihály ,  Lars Westberg

发明人： Attila Mihály ,  Lars Westberg

IPC分类号： H04W40/04 ,  H04W36/02 ,  H04W40/36

CPC分类号： H04W40/04 ,  H04W36/023 ,  H04W40/36 ,  H04W76/12 ,  H04W76/22 ,  H04W76/32

摘要： A method is provided which introduces user plane caching over an interface between a first node in a radio access network and a second node in a core network. At the first node: receiving first uplink tunnel parameters relating to the second node, selecting first downlink tunnel parameters relating to the first node, sending the first uplink and downlink tunnel parameters to a cache node designated to the first node, receiving second uplink and downlink tunnel parameters relating to the cache node, and sending the second downlink tunnel parameters to the second node. A first tunnel is established between the first node and the cache node based on the second uplink tunnel parameters and the first downlink tunnel parameters, uplink user plane data is sent to the second node through the first and second tunnels via the cache node, and downlink user plane data is received from the second node.

摘要翻译： 提供一种方法，其通过无线电接入网络中的第一节点和核心网络中的第二节点之间的接口引入用户平面缓存。 在第一节点处：接收与第二节点有关的第一上行链路隧道参数，选择与第一节点相关的第一下行链路隧道参数，向指定给第一节点的高速缓存发送第一上行链路和下行链路参数，接收第二上行链路和下行链路 与缓存节点相关的隧道参数，以及向第二节点发送第二下行链路隧道参数。 基于第二上行链路隧道参数和第一下行链路隧道参数，在第一节点和高速缓存节点之间建立第一隧道，经由高速缓存节点通过第一和第二隧道将上行链路用户平面数据发送到第二节点，下行链路 从第二节点接收用户平面数据。

公开(公告)号：US20130227137A1

公开(公告)日：2013-08-29

申请号：US13881538

申请日：2010-11-25

申请人： Ayodele Damola ,  Lars Westberg

发明人： Ayodele Damola ,  Lars Westberg

IPC分类号： H04L12/70

CPC分类号： H04L47/78 ,  G06F9/5072 ,  H04L67/16

摘要： A method and arrangement for enabling delivery of an IT-service to a client, wherein execution of the IT-service requires resources in a cloud architecture. First, a plurality of predefined cloud computing services and respective requirements for resources, are registered. Then, service subscriptions and associated subscription identities, valid in a telecommunications network, are provisioned for the predefined cloud computing services. One of the service subscriptions and associated subscription identity is assigned to an identity module, for enabling delivery of the IT-service to the client by providing an associated predefined cloud computing service when the client uses the identity module. Then, activity of the assigned service subscription is monitored in the network based on the associated subscription identity, and resources are allocated in the cloud architecture according to the assigned service subscription, when it is detected that the assigned service subscription is activated or has been activated.

摘要翻译： 一种用于实现向客户端传送IT服务的方法和装置，其中IT服务的执行需要云架构中的资源。 首先，注册了多个预定义的云计算服务和资源的各自要求。 然后，为预定义的云计算服务提供在电信网络中有效的服务订阅和相关联的订阅身份。 服务订阅和相关联的订阅身份之一被分配给身份模块，用于通过在客户端使用身份模块时通过提供关联的预定义云计算服务来实现向客户端传送IT服务。 然后，基于相关联的订阅身份在网络中监视所分配的服务订阅的活动，并且当检测到所分配的服务订阅被激活或已被激活时，根据分配的服务订阅在云架构中分配资源 。

公开(公告)号：US08446826B2

公开(公告)日：2013-05-21

申请号：US11718854

申请日：2004-11-12

申请人： Andras Csaszar ,  Attila Takacs ,  Attila Bader ,  Robert Szabo ,  Lars Westberg

发明人： Andras Csaszar ,  Attila Takacs ,  Attila Bader ,  Robert Szabo ,  Lars Westberg

IPC分类号： H04L12/26

CPC分类号： H04L47/115 ,  H04L43/026 ,  H04L43/0882 ,  H04L47/10 ,  H04L47/11 ,  H04L47/31 ,  Y02D50/30

摘要： A system and a method are described herein which provide for congestion handling in a packet switched network domain. In case of congestion, overload is measured by a core node, the data packets in proportion to the overload are marked and the signaled overload is stored. At least one egress node receives marked and not marked packets, decodes and counts the overload from the marked packets in a counting interval. Congestion report messages are sent to ingress nodes where flows are terminated.

摘要翻译： 这里描述了一种在分组交换网络域中提供拥塞处理的系统和方法。 在拥塞的情况下，由核心节点测量过载，与过载成比例的数据包被标记，并且信号过载被存储。 至少一个出口节点接收标记和未标记的分组，在计数间隔中对标记的分组进行解码和计数。 拥塞报告消息被发送到流终止的入口节点。

公开(公告)号：US20110274112A1

公开(公告)日：2011-11-10

申请号：US13128012

申请日：2008-11-07

申请人： Andras Czaszar ,  Lars G. Magnusson ,  Mats Naslund ,  Lars Westberg

发明人： Andras Czaszar ,  Lars G. Magnusson ,  Mats Naslund ,  Lars Westberg

IPC分类号： H04L12/56

CPC分类号： H04L45/00 ,  H04L63/0227

摘要： Method and apparatus for supporting the forwarding of received data packets in a router (402,702) of a packet-switched network. A forwarding table (706a) is configured in the router based on aggregating router keys and associated aggregation related instructions received from a key manager (400,700). Each aggregating router key represents a set of destinations. When a data packet (P) is received comprising an ingress tag derived from a sender key or router key, the ingress tag is matched with entries in the forwarding table. An outgoing port is selected for the packet according to a found matching table entry that further comprises an associated aggregation related instruction. An egress tag is then created according to the aggregation related instruction, and the packet with the created egress tag attached is sent from the selected outgoing port to a next hop router.

摘要翻译： 用于支持在分组交换网络的路由器（402,702）中转发所接收的数据分组的方法和装置。 基于从密钥管理器（400,700）接收的聚合路由器密钥和相关联的聚合相关指令，在路由器中配置转发表（706a）。 每个聚合路由器密钥代表一组目的地。 当接收到包含从发送方密钥或路由器密钥导出的入口标签的数据分组（P）时，入口标签与转发表中的条目匹配。 根据发现的匹配表条目，为分组选择输出端口，进一步包括相关联的聚合相关指令。 然后根据聚合相关指令创建出口标签，并将附加了创建的出口标签的数据包从所选出口端口发送到下一跳路由器。

公开(公告)号：US20110064085A1

公开(公告)日：2011-03-17

申请号：US12993674

申请日：2008-05-22

申请人： Lars Westberg ,  Andras Csaszar ,  Mats Naslund

发明人： Lars Westberg ,  Andras Csaszar ,  Mats Naslund

IPC分类号： H04L12/56

CPC分类号： H04L45/00 ,  H04L47/20 ,  H04L61/1511 ,  H04L63/0227 ,  H04L63/0428 ,  H04L63/104

摘要： Method and apparatus for controlling the routing of data packets in an IP network (200). A DNS system (202) stores a packet admission policy configured for a first end-host (B) that dictates conditions for allowing other end-hosts to get across data packets to the first end-host or not. A routing voucher is defined which is required for routing data packets to the first end-host. The routing voucher is distributed to routers (R) in the IP network. When an address query is received at the DNS system (202) from a second end-host, the voucher is supplied to the second end-host if the configured policy allows the second end-host to convey data packets. Otherwise, the voucher is not supplied. If allowed, the second end-host will add the routing voucher to any data packets directed to the first end-host. When a valid routing voucher is present in a packet at a router (204) in the network, the packet will be forwarded to the next router in the IP network. The router will otherwise discard the packet.

摘要翻译： 控制IP网络中数据分组路由的方法和装置（200）。 DNS系统（202）存储为第一终端主机（B）配置的分组准入策略，其指示允许其他终端主机跨数据分组到达第一终端主机的条件。 定义了路由凭证，用于将数据包路由到第一个终端主机。 路由凭证分配给IP网络中的路由器（R）。 当从第二终端主机在DNS系统（202）处接收到地址查询时，如果所配置的策略允许第二终端主机传送数据分组，则将凭证提供给第二终端主机。 否则，不提供凭证。 如果允许，则第二个终端主机会将路由凭证添加到指向第一个终端主机的任何数据包。 当在网络中的路由器（204）的分组中存在有效的路由凭证时，分组将被转发到IP网络中的下一个路由器。 否则路由器将丢弃该数据包。

公开(公告)号：US07551556B2

公开(公告)日：2009-06-23

申请号：US10441174

申请日：2003-05-20

申请人： Bengt Henriques ,  Lars Westberg

发明人： Bengt Henriques ,  Lars Westberg

IPC分类号： H04L12/26

CPC分类号： H04M15/58 ,  H04L2012/5632 ,  H04L2012/5636 ,  H04L2012/5648 ,  H04L2012/5651 ,  H04M2215/0188 ,  H04M2215/22 ,  H04Q11/0478

摘要： A data packet network comprises a policer module metering the flow and deciding whether arrived packets are to be transmitted or discarded. The flow of transmitted packets is metered by a sliding window procedure having a fixed window length. The sliding window is divided in a plurality of subwindows of equal length and the sliding window moves by steps corresponding to the length of the subwindows. For each subwindow and for the sliding window counts of transmitted and/or discarded bytes and/or packets are determined and stored. For an arrived packet the counts of the current subwindow are compared to a maximum value obtained from the counts of the sliding window and an absolute maximum value, and based on the result of the comparison, the policer module will transmit or discard the packet. The policer module can perform soft policing in the case where the packets belong to different traffic classes.

摘要翻译： 数据分组网络包括对流量进行计量并决定是否传送或丢弃到达分组的策略模块。 传输分组的流量由具有固定窗口长度的滑动窗口过程计量。 滑动窗口被分成多个相等长度的子窗口，并且滑动窗口移动与子窗口的长度对应的步骤。 对于每个子窗口和滑动窗口，确定并存储发送和/或丢弃的字节和/或分组的计数。 对于到达的分组，将当前子窗口的计数与从滑动窗口的计数和绝对最大值获得的最大值进行比较，并且基于比较的结果，策略器模块将发送或丢弃该分组。 在分组属于不同流量类的情况下，策略模块可以执行软策略。

公开(公告)号：US20080291822A1

公开(公告)日：2008-11-27

申请号：US11916565

申请日：2005-06-14

申请人： Janos Farkas ,  Csaba Antal ,  Lars Westberg

发明人： Janos Farkas ,  Csaba Antal ,  Lars Westberg

IPC分类号： H04L12/24

CPC分类号： H04L12/4641 ,  H04L12/462 ,  H04L41/0213 ,  H04L41/06 ,  H04L43/10 ,  H04L45/00

摘要： The invention relates to failure handling in a tree sructure network (NW1) that has edge nodes (EN1 . . . EN4) and switching nodes (SW1 . . . SW4) interconnected by lines (L1). VLANs (VLAN1-VLAN3) are established such that at least one thereof provides connectivity in case of any single failure in the network. The VLANs can be established by using spanning trees (ST1,ST2,ST3). Among the edge nodes, emitters (EN3) broadcast alive messages (A1,A2,A3) regularly on the VLANs and notifiers (EN2) note the alive messages. A missing alive message indicates a failure (CD1) on one VLAN (VLAN2) and the notifier (EN2) broadcasts corresponding failure messages (F1,F2,F3) on the VLANs. When all the alive messages (A1,A2,A3) appear again the notifier (EN2) broadcasts corresponding repair messages (R1,R2,R3). If the notifiers don't note a failure the nodes (EN1,EN4) with no special role performs a similar function as the notifier (EN2) somewhat slower. The failure handling is fast, robust, uses few messages, increases only slightly the traffic load in the network (NW1) and is compliant with present standards.

摘要翻译： 本发明涉及具有通过线路（L1）互连的边缘节点（EN1 ... EN4）和交换节点（SW1 ... SW4）的树结构网络（NW1）中的故障处理。 建立VLAN（VLAN1-VLAN3），使得其中的至少一个在网络中的任何单个故障的情况下提供连接性。 VLAN可以通过生成树（ST1，ST2，ST3）建立。 在边缘节点中，发射器（EN3）定期在VLAN和通知器（EN2）上广播有效消息（A1，A2，A3），注意活动消息。 丢失的活着消息表示一个VLAN（VLAN2）发生故障（CD1），通知器（EN2）广播VLAN上相应的故障消息（F1，F2，F3）。 当所有活动消息（A1，A2，A3）再次出现时，通知器（EN2）广播相应的修复消息（R1，R2，R3）。 如果通知程序不记录故障，则没有特殊角色的节点（EN1，EN4）执行与通知程序（EN2）类似的功能稍慢。 故障处理快速，稳健，使用少量消息，仅增加网络流量负载（NW1），符合现行标准。

公开(公告)号：US20060018300A1

公开(公告)日：2006-01-26

申请号：US11170185

申请日：2005-06-30

申请人： Lars Westberg ,  Jan-Erik Mangs ,  Christofer Flinta

发明人： Lars Westberg ,  Jan-Erik Mangs ,  Christofer Flinta

IPC分类号： H04L12/28

CPC分类号： H04L63/0272 ,  H04L12/4641

摘要： Information about virtual private networks—VPNs—in each domain of a multi-domain communications system is provided. By comparing a request for a configuration of a VPN with the provided information of other connected domains, a match can be found. VPN configuration can then be performed based on the outcome of the match. The provided domain VPN information is in one embodiment spread to other domains under constrictions put by SLAs between domain operators. The spreading of VPN information can be performed regularly or triggered by an external event. In another embodiment, the VPN configuration request is instead spread to different domains.

摘要翻译： 提供了有关虚拟专用网络的信息 - 在多域通信系统的每个域中的VPN。 通过将VPN的配置请求与其他连接域的提供信息进行比较，可以找到匹配。 然后可以基于匹配的结果来执行VPN配置。 在一个实施例中，所提供的域VPN信息在域运营商之间由SLA放置的限制下传播到其他域。 VPN信息的扩展可以定期执行或者由外部事件触发。 在另一个实施例中，VPN配置请求被传播到不同的域。

公开(公告)号：US20050169179A1

公开(公告)日：2005-08-04

申请号：US10939970

申请日：2004-09-14

申请人： Csaba Antal ,  Janos Harmatos ,  Alpar Juttner ,  Lars Westberg

发明人： Csaba Antal ,  Janos Harmatos ,  Alpar Juttner ,  Lars Westberg

IPC分类号： H04L12/24 ,  H04L12/26 ,  H04L12/28

CPC分类号： H04L41/0806 ,  H04L41/5003 ,  H04L41/5009 ,  H04L41/5054

摘要： In the area of network provisioning, there is a problem of selecting a suitable traffic-provisioning model for large networks due to the high management complexity of the resource-efficient trunk model and the poor bandwidth efficiency of the easy-to-configure hose model. The invention is based on the idea of partitioning at least part of the network into multi-node clusters, and defining traffic limitations on at least two levels, including the intra-cluster level and the inter-cluster level, where the traffic limitations include one or more node-to-cluster traffic limitations for inter-cluster traffic. Subsequently, cluster-based provisioning of the network is performed based on the traffic limitations. The novel node-to-cluster limitations proposed by the invention are preferably applied in a cluster-based trunk or hose model on the inter-cluster level. In other words, for the description of the inter-cluster traffic (traffic between the clusters) cluster-based trunk or hose models can be used, preferably depending on the available information about the traffic. The cluster-based provisioning makes it possible to find a trade-off between management complexity and overprovisioning.

摘要翻译： 在网络配置领域，由于资源高效的主干模型的高管理复杂性和易于配置的软管模型的较差带宽效率，存在为大型网络选择合适的流量供应模型的问题。 本发明基于将网络的至少一部分划分成多节点集群并且在包括集群内级别和集群间级别的至少两个级别上定义业务限制的想法，其中流量限制包括一个 或更多的群集间流量的节点到群集流量限制。 随后，基于流量限制来执行基于群集的网络供应。 本发明提出的新颖的节点到群集限制优选地应用于群集间级别上的基于群集的中继线或软管模型。 换句话说，对于集群间流量（集群之间的流量）的描述，可以使用基于集群的中继或软件模型，优选地取决于关于流量的可用信息。 基于集群的配置使得可以在管理复杂性和过度配置之间找到权衡。