-
公开(公告)号：US20110196943A1
公开(公告)日：2011-08-11
申请号：US13088517
申请日：2011-04-18
IPC分类号： G06F15/16
CPC分类号： H04L67/06 , H04L29/06 , H04L45/00 , H04L45/22 , H04L45/26 , H04L67/26 , H04L67/2814 , H04L67/2842 , H04L67/289 , H04L67/322 , H04L69/329 , H04L69/40
摘要： A routing mechanism, service or system operable in a distributed networking environment. One preferred environment is a content delivery network (CDN) wherein the present invention provides improved connectivity back to an origin server, especially for HTTP traffic. In a CDN, edge servers are typically organized into regions, with each region comprising a set of content servers that preferably operate in a peer-to-peer manner and share data across a common backbone such as a local area network (LAN). The inventive routing technique enables an edge server operating within a given CDN region to retrieve content (cacheable, non-cacheable and the like) from an origin server more efficiently by selectively routing through the CDN's own nodes, thereby avoiding network congestion and hot spots. The invention enables an edge server to fetch content from an origin server through an intermediate CDN server or, more generally, enables an edge server within a given first region to fetch content from the origin server through an intermediate CDN region.
-
公开(公告)号：US07274658B2
公开(公告)日：2007-09-25
申请号：US10087033
申请日：2002-03-01
IPC分类号： H04J1/16
CPC分类号： H04L67/06 , H04L29/06 , H04L45/00 , H04L45/22 , H04L45/26 , H04L67/26 , H04L67/2814 , H04L67/2842 , H04L67/289 , H04L67/322 , H04L69/329 , H04L69/40
摘要： A routing mechanism, service or system operable in a distributed networking environment. One preferred environment is a content delivery network (CDN) wherein the present invention provides improved connectivity back to an origin server, especially for HTTP traffic. In a CDN, edge servers are typically organized into regions, with each region comprising a set of content servers that preferably operate in a peer-to-peer manner and share data across a common backbone such as a local area network (LAN). The inventive routing technique enables an edge server operating within a given CDN region to retrieve content (cacheable, non-cacheable and the like) from an origin server more efficiently by selectively routing through the CDN's own nodes, thereby avoiding network congestion and hot spots. The invention enables an edge server to fetch content from an origin server through an intermediate CDN server or, more generally, enables an edge server within a given first region to fetch content from the origin server through an intermediate CDN region. As used herein, this routing through an intermediate server, node or region is sometimes referred to as “tunneling.”
摘要翻译： 在分布式网络环境中可操作的路由机制，业务或系统。 一个优选的环境是内容传送网络（CDN），其中本发明提供了到原始服务器的改进的连接，特别是对于HTTP流量。 在CDN中，边缘服务器通常被组织成区域，每个区域包括一组内容服务器，其优选地以点对点的方式操作，并且通过诸如局域网（LAN）的公共骨干网共享数据。 本发明的路由技术使得在给定CDN区域内的边缘服务器能够通过选择性地路由通过CDN自己的节点更有效地从原始服务器检索内容（可高速缓存，不可缓存等），从而避免网络拥塞和热点。 本发明使得边缘服务器能够通过中间CDN服务器从原始服务器获取内容，或者更一般地，允许给定第一区域内的边缘服务器通过中间CDN区域从原始服务器获取内容。 如本文所使用的，通过中间服务器，节点或区域的该路由有时被称为“隧道”。
-
公开(公告)号：US08477630B2
公开(公告)日：2013-07-02
申请号：US13487297
申请日：2012-06-04
IPC分类号： H04J1/16
CPC分类号： H04L67/06 , H04L29/06 , H04L45/00 , H04L45/22 , H04L45/26 , H04L67/26 , H04L67/2814 , H04L67/2842 , H04L67/289 , H04L67/322 , H04L69/329 , H04L69/40
摘要： A routing mechanism operable in a distributed networking environment, such as a content delivery network (CDN), provides improved connectivity back to an origin server, especially for HTTP traffic. The technique enables an edge server operating within a given edge region to retrieve content (cacheable, non-cacheable and the like) from an origin server more efficiently by selectively routing through the network's own nodes, thereby avoiding network congestion and hot spots. The technique enables an edge server to fetch content from an origin server through an intermediate edge server or, more generally, enables an edge server within a given first region to fetch content from the origin server through an intermediate edge region.
摘要翻译： 在诸如内容传送网络（CDN）的分布式网络环境中可操作的路由机制提供了返回原始服务器的改进的连接，特别是对于HTTP流量。 该技术使得在给定边缘区域内的边缘服务器能够通过选择性地通过网络本身的节点路由从原始服务器更高效地检索内容（可缓存，不可缓存等），从而避免网络拥塞和热点。 该技术使得边缘服务器能够通过中间边缘服务器从原始服务器获取内容，或者更一般地，允许给定第一区域内的边缘服务器通过中间边缘区域从原始服务器获取内容。
-
公开(公告)号：US20120246273A1
公开(公告)日：2012-09-27
申请号：US13487297
申请日：2012-06-04
IPC分类号： G06F15/16
CPC分类号： H04L67/06 , H04L29/06 , H04L45/00 , H04L45/22 , H04L45/26 , H04L67/26 , H04L67/2814 , H04L67/2842 , H04L67/289 , H04L67/322 , H04L69/329 , H04L69/40
摘要： A routing mechanism operable in a distributed networking environment, such as a content delivery network (CDN), provides improved connectivity back to an origin server, especially for HTTP traffic. The technique enables an edge server operating within a given edge region to retrieve content (cacheable, non-cacheable and the like) from an origin server more efficiently by selectively routing through the network's own nodes, thereby avoiding network congestion and hot spots. The technique enables an edge server to fetch content from an origin server through an intermediate edge server or, more generally, enables an edge server within a given first region to fetch content from the origin server through an intermediate edge region.
摘要翻译： 在诸如内容传送网络（CDN）的分布式网络环境中可操作的路由机制提供了返回原始服务器的改进的连接，特别是对于HTTP流量。 该技术使得在给定边缘区域内的边缘服务器能够通过选择性地通过网络本身的节点路由从原始服务器更高效地检索内容（可缓存，不可缓存等），从而避免网络拥塞和热点。 该技术使得边缘服务器能够通过中间边缘服务器从原始服务器获取内容，或者更一般地，允许给定第一区域内的边缘服务器通过中间边缘区域从原始服务器获取内容。
-
5.发明授权VLSI circuit layout method based on spreading functions and simulated annealing heuristics to minimize area 失效基于扩展函数和模拟退火启发式的VLSI电路布局方法，以最小化面积
公开(公告)号：US5737233A
公开(公告)日：1998-04-07
申请号：US583296
申请日：1996-01-05
申请人： Satish B. Rao
发明人： Satish B. Rao
CPC分类号： G06F17/5068
摘要： A VLSI circuit layout method includes defining a circuit to be designed in terms of a set of components V and a set of nets H connecting the components. A cost function is defined using a spreading function to define a cost of a VLSI circuit layout. A simulated annealing is applied to the cost function to produce a VLSI circuit layout having a minimal cost function. The resulting VLSI circuit layout requires minimal area.
摘要翻译： VLSI电路布局方法包括根据一组组件V和一组连接组件的网H定义要设计的电路。 使用扩展函数定义成本函数来定义VLSI电路布局的成本。 将模拟退火应用于成本函数以产生具有最小成本函数的VLSI电路布局。 所产生的VLSI电路布局需要最小面积。
-
公开(公告)号：US08194538B2
公开(公告)日：2012-06-05
申请号：US13088517
申请日：2011-04-18
IPC分类号： H04J1/16
CPC分类号： H04L67/06 , H04L29/06 , H04L45/00 , H04L45/22 , H04L45/26 , H04L67/26 , H04L67/2814 , H04L67/2842 , H04L67/289 , H04L67/322 , H04L69/329 , H04L69/40
摘要： A routing mechanism, service or system operable in a distributed networking environment. One preferred environment is a content delivery network (CDN) wherein the present invention provides improved connectivity back to an origin server, especially for HTTP traffic. In a CDN, edge servers are typically organized into regions, with each region comprising a set of content servers that preferably operate in a peer-to-peer manner and share data across a common backbone such as a local area network (LAN). The inventive routing technique enables an edge server operating within a given CDN region to retrieve content (cacheable, non-cacheable and the like) from an origin server more efficiently by selectively routing through the CDN's own nodes, thereby avoiding network congestion and hot spots. The invention enables an edge server to fetch content from an origin server through an intermediate CDN server or, more generally, enables an edge server within a given first region to fetch content from the origin server through an intermediate CDN region.
摘要翻译： 在分布式网络环境中可操作的路由机制，业务或系统。 一个优选的环境是内容传送网络（CDN），其中本发明提供了到原始服务器的改进的连接，特别是对于HTTP流量。 在CDN中，边缘服务器通常被组织成区域，每个区域包括一组内容服务器，其优选地以点对点的方式操作，并且通过诸如局域网（LAN）的公共骨干网共享数据。 本发明的路由技术使得在给定CDN区域内的边缘服务器能够通过选择性地路由通过CDN自己的节点更有效地从原始服务器检索内容（可高速缓存，不可缓存等），从而避免网络拥塞和热点。 本发明使得边缘服务器能够通过中间CDN服务器从原始服务器获取内容，或者更一般地，允许给定第一区域内的边缘服务器通过中间CDN区域从原始服务器获取内容。
-
公开(公告)号：US07929429B2
公开(公告)日：2011-04-19
申请号：US11858261
申请日：2007-09-20
IPC分类号： H04J1/16
CPC分类号： H04L67/06 , H04L29/06 , H04L45/00 , H04L45/22 , H04L45/26 , H04L67/26 , H04L67/2814 , H04L67/2842 , H04L67/289 , H04L67/322 , H04L69/329 , H04L69/40
摘要： A routing mechanism, service or system operable in a distributed networking environment. One preferred environment is a content delivery network (CDN) wherein the present invention provides improved connectivity back to an origin server, especially for HTTP traffic. In a CDN, edge servers are typically organized into regions, with each region comprising a set of content servers that preferably operate in a peer-to-peer manner and share data across a common backbone such as a local area network (LAN). The inventive routing technique enables an edge server operating within a given CDN region to retrieve content (cacheable, non-cacheable and the like) from an origin server more efficiently by selectively routing through the CDN's own nodes, thereby avoiding network congestion and hot spots. The invention enables an edge server to fetch content from an origin server through an intermediate CDN server or, more generally, enables an edge server within a given first region to fetch content from the origin server through an intermediate CDN region.
摘要翻译： 在分布式网络环境中可操作的路由机制，业务或系统。 一个优选的环境是内容传送网络（CDN），其中本发明提供了到原始服务器的改进的连接，特别是对于HTTP流量。 在CDN中，边缘服务器通常被组织成区域，每个区域包括一组内容服务器，其优选地以点对点的方式操作，并且通过诸如局域网（LAN）的公共骨干网共享数据。 本发明的路由技术使得在给定CDN区域内的边缘服务器能够通过选择性地路由通过CDN自己的节点更有效地从原始服务器检索内容（可高速缓存，不可缓存等），从而避免网络拥塞和热点。 本发明使得边缘服务器能够通过中间CDN服务器从原始服务器获取内容，或者更一般地，允许给定第一区域内的边缘服务器通过中间CDN区域从原始服务器获取内容。
-
8.发明授权Method for image segmentation by minimizing the ratio between the exterior boundary cost and the cost of the enclosed region 失效通过最小化外部边界成本与封闭区域的成本之间的比例来进行图像分割的方法
公开(公告)号：US6078688A
公开(公告)日：2000-06-20
申请号：US702351
申请日：1996-08-23
申请人： Ingemar J. Cox , Satish B. Rao
发明人： Ingemar J. Cox , Satish B. Rao
CPC分类号： G06T7/0093 , G06T7/0083 , G06T7/0089 , G06T2207/10072 , G06T2207/20104 , G06T2207/20156 , G06T2207/30004
摘要： Segmentation of an image into separate regions is useful in many computer vision problems. The separate regions may be represented by their enclosing contours. A planar graph is constructed for each image. The optimal contour is determined by the assignment of edge costs and face weights of the graph. An algorithm is provided such that given a planar graph G = (V,E) where V is a set of nodes, E is a set of edges and each edge e is provided with a non-negative cost c(e) and each face f of the planar graph is provided with a non-negative weight w(f), and given a single node v in G and single face F adjacent to v which is viewed as the exterior face, then find a directed path P in G that starts and finishes at v and minimizes ##EQU1## where cost(P) is defined as the length of the path under c, and weight (P) is the weight of the faces that are separated from F by P. The contour that minimizes .zeta. is the optimal contour.
摘要翻译： 将图像分割成单独的区域在许多计算机视觉问题中是有用的。 分开的区域可以由其包围的轮廓表示。 为每个图像构建平面图。 最佳轮廓由图的边缘成本和面重的分配决定。 提供了一种算法，使得给定平面图G =（V，E）其中V是一组节点，E是一组边缘，并且每个边缘e被提供有非负成本c（e），并且每个面 平面图的f被提供有非负权重w（f），并给出G中的单个节点v和与视觉为外部面的v相邻的单个面F，然后在G中找到有向路径P， 以v开始和完成，并将成本（P）定义为c下路径的长度，并且权重（P）是通过P与F分离的面的权重。最小化Zeta的轮廓是最优的 轮廓。
-
-
-
-
-
-
-
搜索结果
8 条记录 (耗时 0.013 秒)