-
1.发明申请METHOD AND NODE FOR FINDING CONTENT IN A CONTENT DISTRIBUTION NETWORK, AND METHOD FOR CREATING A VIRTUAL REPRESENTATION OF A CONTENT DISTRIBUTION NETWORK 有权用于在内容分发网络中发现内容的方法和节点，以及用于创建内容分发网络的虚拟表示的方法公开(公告)号：US20120076052A1
公开(公告)日：2012-03-29
申请号：US13375044
申请日：2009-06-03
IPC分类号： H04L12/28
CPC分类号： H04L41/12 , H04L45/12 , H04L45/306 , H04L45/48 , H04L45/64 , H04L65/4084 , H04L67/2842
摘要： Embodiments of the present invention a method and a node for finding the shortest path to a cache node in a content delivery network (CDN) comprising requested content and a method for creating a virtual representation of a network. According to an embodiment of the present invention, the virtual representation is in the form of a virtual, hierarchical topology, and the cache nodes correspond to the cache nodes of the real network. All cache nodes are arranged at a first level and with the virtual nodes arranged at higher levels. In the virtual representation, all nodes (cache and virtual) are connected with virtual links such that there exist only one path between any two arbitrary cache nodes. Further, costs to the virtual links are assigned such that the path cost between any two arbitrary cache nodes in the virtual representation generally corresponds to the lowest path cost between corresponding cache nodes in the real network.
摘要翻译： 本发明的实施例提供了一种方法和节点，用于找到包含所请求内容的内容传送网络（CDN）中的缓存节点的最短路径以及用于创建网络的虚拟表示的方法。 根据本发明的实施例，虚拟表示是虚拟分层拓扑的形式，并且高速缓存节点对应于真实网络的高速缓存节点。 所有缓存节点被布置在第一级并且虚拟节点排列在较高级别。 在虚拟表示中，所有节点（缓存和虚拟）都与虚拟链路相连，使得任何两个任意缓存节点之间只存在一条路径。 此外，分配虚拟链路的成本，使得虚拟表示中的任何两个任意高速缓存节点之间的路径开销通常对应于真实网络中相应的高速缓存节点之间的最低路径开销。
-
2.发明授权Method and node for distributing electronic content in a content distribution network 有权用于在内容分发网络中分发电子内容的方法和节点公开(公告)号：US09065809B2
公开(公告)日：2015-06-23
申请号：US13375022
申请日：2009-06-03
IPC分类号： G06F15/167 , H04L29/08
CPC分类号： H04L67/06 , G06F12/0871 , G06F12/0888 , G06F2212/263 , G06F2212/284 , H04L67/2842 , H04L67/2852
摘要： The present invention relates to a method and node for efficiently distributing electronic content in a content distribution network (CDN) comprising a plurality of cache nodes.Embodiments of the present invention include a virtual node logically representing a set of cache nodes. The set of cache nodes is in turn defined based on an internal communication cost between the cache nodes. In each of the cache nodes represented by the virtual node statistics regarding content requests is collected, and based on this statistics it is determined whether specific content is to be cached in the virtual node or not. If it is determined to cache specific content in the virtual node, the specific content may be caused to be cached in one or more of the cache nodes represented by the virtual node.
摘要翻译： 本发明涉及一种用于在包括多个高速缓存节点的内容分发网络（CDN）中有效地分发电子内容的方法和节点。 本发明的实施例包括逻辑上表示一组高速缓存节点的虚拟节点。 基于高速缓存节点之间的内部通信成本又定义了该组缓存节点。 在由虚拟节点表示的每个缓存节点中，收集关于内容请求的统计信息，并且基于该统计信息，确定特定内容是否被缓存在虚拟节点中。 如果确定在虚拟节点中缓存特定内容，则可以使特定内容被缓存在由虚拟节点表示的一个或多个高速缓存节点中。
-
3.发明申请METHOD AND NODE FOR DISTRIBUTING ELECTRONIC CONTENT IN A CONTENT DISTRIBUTION NETWORK 有权在内容分发网络中分配电子内容的方法和节点公开(公告)号：US20120072526A1
公开(公告)日：2012-03-22
申请号：US13375022
申请日：2009-06-03
IPC分类号： G06F15/167
CPC分类号： H04L67/06 , G06F12/0871 , G06F12/0888 , G06F2212/263 , G06F2212/284 , H04L67/2842 , H04L67/2852
摘要： The present invention relates to a method and node for efficiently distributing electronic content in a content distribution network (CDN) comprising a plurality of cache nodes.Embodiments of the present invention include a virtual node logically representing a set of cache nodes. The set of cache nodes is in turn defined based on an internal communication cost between the cache nodes. In each of the cache nodes represented by the virtual node statistics regarding content requests is collected, and based on this statistics it is determined whether specific content is to be cached in the virtual node or not. If it is determined to cache specific content in the virtual node, the specific content may be caused to be cached in one or more of the cache nodes represented by the virtual node.
摘要翻译： 本发明涉及一种用于在包括多个高速缓存节点的内容分发网络（CDN）中有效地分发电子内容的方法和节点。 本发明的实施例包括逻辑上表示一组高速缓存节点的虚拟节点。 基于高速缓存节点之间的内部通信成本又定义了该组缓存节点。 在由虚拟节点表示的每个缓存节点中，收集关于内容请求的统计信息，并且基于该统计信息，确定特定内容是否被缓存在虚拟节点中。 如果确定在虚拟节点中缓存特定内容，则可以使特定内容被缓存在由虚拟节点表示的一个或多个高速缓存节点中。
-
公开(公告)号：US08949533B2
公开(公告)日：2015-02-03
申请号：US13575723
申请日：2010-02-05
CPC分类号： H04L67/2842 , G06F8/4441 , G06F8/4442 , G06F12/08 , H04L67/02 , H04L67/1095
摘要： The present invention prdvides a method and a caching node entity for ensuring at least a predetermined number of a content object to be kept stored in a network, comprising a plurality of cache nodes for storing copies of content objects. The present invention makes use of ranking states values, deletable or non-deletable, which when assigned to copies of content objects are indicating whether a copy is either deletable or non-deletable. At least one copy of each content object is assigned the value non-deletable The value for a copy of a content object changing from deletable to non-deletable in one cache node of the network, said copy being a candidate for the value non-deletable, if a certain condition is fulfilled.
摘要翻译： 本发明提供了一种方法和缓存节点实体，用于确保至少预定数量的要保存在网络中的内容对象，包括用于存储内容对象的副本的多个高速缓存节点。 本发明利用排序状态值，可删除或不可删除，当分配给内容对象的副本时，它们指示副本是可删除还是不可删除。 每个内容对象的至少一个副本被分配值不可删除。 内容对象的副本的值从网络的一个缓存节点中的可删除到不可删除的文件的值，如果满足某个条件，则该副本是该值不可删除的候选者。
-
5.发明授权Method and node for finding content in a content distribution network, and method for creating a virtual representation of a content distribution network 有权用于在内容分发网络中查找内容的方法和节点以及用于创建内容分发网络的虚拟表示的方法公开(公告)号：US08665757B2
公开(公告)日：2014-03-04
申请号：US13375044
申请日：2009-06-03
IPC分类号： H04L12/28
CPC分类号： H04L41/12 , H04L45/12 , H04L45/306 , H04L45/48 , H04L45/64 , H04L65/4084 , H04L67/2842
摘要： Embodiments of the present invention a method and a node for finding the shortest path to a cache node in a content delivery network (CDN) comprising requested content and a method for creating a virtual representation of a network. According to an embodiment of the present invention, the virtual representation is in the form of a virtual, hierarchical topology, and the cache nodes correspond to the cache nodes of the real network. All cache nodes are arranged at a first level and with the virtual nodes arranged at higher levels. In the virtual representation, all nodes (cache and virtual) are connected with virtual links such that there exist only one path between any two arbitrary cache nodes. Further, costs to the virtual links are assigned such that the path cost between any two arbitrary cache nodes in the virtual representation generally corresponds to the lowest path cost between corresponding cache nodes in the real network.
摘要翻译： 本发明的实施例提供了一种方法和节点，用于找到包含所请求内容的内容传送网络（CDN）中的缓存节点的最短路径以及用于创建网络的虚拟表示的方法。 根据本发明的实施例，虚拟表示是虚拟分层拓扑的形式，并且高速缓存节点对应于真实网络的高速缓存节点。 所有缓存节点被布置在第一级并且虚拟节点排列在较高级别。 在虚拟表示中，所有节点（缓存和虚拟）都与虚拟链路相连，使得任何两个任意缓存节点之间只存在一条路径。 此外，分配虚拟链路的成本，使得虚拟表示中的任何两个任意高速缓存节点之间的路径开销通常对应于真实网络中相应的高速缓存节点之间的最低路径开销。
-
公开(公告)号：US20130073808A1
公开(公告)日：2013-03-21
申请号：US13575723
申请日：2010-02-05
IPC分类号： G06F12/08
CPC分类号： H04L67/2842 , G06F8/4441 , G06F8/4442 , G06F12/08 , H04L67/02 , H04L67/1095
摘要： The present invention provides a method and a caching node entity for ensuring at least a predetermined number of a content object to be kept stored in a network, comprising a plurality of cache nodes for storing copies of content objects. The present invention makes use of ranking states values, deletable or non-deletable, which when assigned to copies of content objects are indicating whether a copy is either deletable or non-deletable. At least one copy of each content object is assigned the value non-deletable. The value for a copy of a content object changing from deletable to non-deletable in one cache node of the network, said copy being a candidate for the value non-deletable, if a certain condition is fulfilled.
-
公开(公告)号：US09049199B2
公开(公告)日：2015-06-02
申请号：US13515234
申请日：2009-12-14
IPC分类号： G06F15/173 , H04L29/08 , H04L12/701 , H04L12/727 , H04L12/721 , H04L12/729
CPC分类号： H04L67/1025 , H04L45/00 , H04L45/121 , H04L45/124 , H04L45/125 , H04L67/1002 , H04L67/101 , H04L67/1097 , H04L67/2852
摘要： Node, computer software and method for selecting a resource that is available at multiple caches connected in a communication network. The method includes receiving from a user a request for the resource; identifying one or more caches of the multiple caches that store the resource; determining a total cost associated with a path between the user and each cache of the one or more caches storing the resource, the total cost including a static cost [Cf] that reflects a topology of the communication network and a dynamic cost [Δ] which is indicative of changing conditions of the communication network; and selecting one cache from the one or more caches that store the resource based on a lowest total cost of the one cache.
摘要翻译： 用于选择在通信网络中连接的多个高速缓存可用的资源的节点，计算机软件和方法。 该方法包括从用户接收对该资源的请求; 识别存储资源的多个高速缓存的一个或多个高速缓存; 确定与存储资源的一个或多个高速缓存之间的用户与每个高速缓存之间的路径相关联的总成本，总成本包括反映通信网络的拓扑的静态成本[Cf]和动态成本[ 这表示通信网络的变化条件; 以及基于所述一个高速缓存的最低总成本，从存储所述资源的所述一个或多个高速缓存中选择一个高速缓存。
-
公开(公告)号：US20120290677A1
公开(公告)日：2012-11-15
申请号：US13515234
申请日：2009-12-14
IPC分类号： G06F15/167
CPC分类号： H04L67/1025 , H04L45/00 , H04L45/121 , H04L45/124 , H04L45/125 , H04L67/1002 , H04L67/101 , H04L67/1097 , H04L67/2852
摘要： Node, computer software and method for selecting a resource that is available at multiple caches connected in a communication network. The method includes receiving from a user a request for the resource; identifying one or more caches of the multiple caches that store the resource; determining a total cost associated with a path between the user and each cache of the one or more caches storing the resource, the total cost including a static cost Cf that reflects a topology of the communication network and a dynamic cost [Δ] which is indicative of changing conditions of the communication network; and selecting one cache from the one or more caches that store the resource based on a lowest total cost of the one cache.
摘要翻译： 用于选择在通信网络中连接的多个高速缓存可用的资源的节点，计算机软件和方法。 该方法包括从用户接收对该资源的请求; 识别存储资源的多个高速缓存的一个或多个高速缓存; 确定与存储资源的一个或多个高速缓存之间的用户与每个高速缓存之间的路径相关联的总成本，总成本包括反映通信网络的拓扑的静态成本Cf和动态成本[＆Dgr] 指示通信网络的变化条件; 以及基于所述一个高速缓存的最低总成本，从存储所述资源的所述一个或多个高速缓存中选择一个高速缓存。
-
公开(公告)号：US11057268B2
公开(公告)日：2021-07-06
申请号：US14410292
申请日：2012-07-13
IPC分类号： H04L12/24 , H04L12/46 , H04L12/911 , H04W76/12 , G06F9/455 , H04L12/931 , H04W28/10
摘要： Apparatuses and methods enable connecting tunnels channeling data flow from a user terminal and to a mobile network through a virtual switch in a network device which is configured to provide a service by processing data in the data flow. A method performed by a device having one or more processors includes establishing a first tunnel between the device and a node of the mobile network, and a second tunnel between the device and another network device of the mobile network, the first tunnel and the second tunnel operating according to Internet protocols. The method further includes connecting the first tunnel to the second tunnel using a virtual switch running on the device, and connecting a virtual machine running on the device to the virtual switch, the virtual machine being configured to provide a service by processing data in the data flow.
-
10.发明授权Method for enhancing table lookups with exact and wildcards matching for parallel environments 有权使用与并行环境匹配的精确和通配符来增强表查找的方法公开(公告)号：US08559332B2
公开(公告)日：2013-10-15
申请号：US13111497
申请日：2011-05-19
IPC分类号： G01R31/08
CPC分类号： H04L43/026 , H04L47/10
摘要： Presented are methods for performing a constant time flow lookup utilizing parallel processing technology. The methods are suitable for multiprocessor and/or multi-core processor computing environments. The method generates hash table driven tables of exact flow matching patterns and then provides the generated tables to parallel processing based flow selection procedure that iteratively finds the highest priority flow from the exact flow matching patterns. The method is scalable based on the linear relationship between the number of processors and/or processor cores and the time required to perform the lookup. The method is also portable because it does not require any special or custom hardware typically associated with this type of lookup.
摘要翻译： 提出了使用并行处理技术执行恒定时间流查找的方法。 该方法适用于多处理器和/或多核处理器计算环境。 该方法生成精确流匹配模式的散列表驱动表，然后将生成的表提供给基于并行处理的流选择过程，该流选择过程从精确的流匹配模式迭代地找到最高优先级流。 该方法基于处理器数量和/或处理器核心之间的线性关系以及执行查找所需的时间是可扩展的。 该方法也是可移植的，因为它不需要通常与这种类型的查找相关联的特殊或定制的硬件。
-
-
-
-
-
-
-
-
-
搜索结果
14 条记录 (耗时 0.019 秒)
