公开(公告)号：US20120166360A1

公开(公告)日：2012-06-28

申请号：US13409883

申请日：2012-03-01

申请人： Pritam Shah ,  Philip C. Jacobs ,  Rahul G. Patel

发明人： Pritam Shah ,  Philip C. Jacobs ,  Rahul G. Patel

IPC分类号： G06Q50/32

CPC分类号： H04L12/14 ,  G06Q30/0283 ,  H04L12/145 ,  H04L12/1485

摘要： In one embodiment, two or more links, coupled to a first service provider (SP) that charges a price for utilization of services according to a first pricing structure, are combined to form a single virtual combined link. Each of the two or more links of the virtual combined link and one or more other links, coupled to a second SP that charges a price for utilization of services according to a second pricing structure, are monitored to obtain link data. The link data for the two of more links of the virtual combined link is merged to form link data for the virtual combined link. Data distribution among the virtual combined link and the one or more other links is optimized to distribute data among the virtual combined link and the one or more other links in a manner that minimizes cost.

摘要翻译： 在一个实施例中，耦合到根据第一定价结构为服务的价格收费的第一服务提供商（SP）的两个或多个链路被组合以形成单个虚拟组合链路。 监视虚拟组合链路和一个或多个其他链路的两个或更多个链路中的每一个，耦合到根据第二定价结构为服务的价格收费的第二SP，以获得链路数据。 虚拟组合链接的两个链接的链接数据被合并以形成用于虚拟组合链接的链接数据。 优化虚拟组合链路和一个或多个其他链路之间的数据分布，以便以最小化成本的方式在虚拟组合链路和一个或多个其他链路之间分发数据。

公开(公告)号：US08098578B1

公开(公告)日：2012-01-17

申请号：US11337195

申请日：2006-01-20

申请人： Pritam Shah ,  Philip C. Jacobs

发明人： Pritam Shah ,  Philip C. Jacobs

IPC分类号： H04L12/26

CPC分类号： H04L47/122 ,  G01V1/28 ,  H04L29/06027 ,  H04L41/00 ,  H04L41/0213 ,  H04L41/0866 ,  H04L45/00 ,  H04L45/02 ,  H04L45/04 ,  H04L45/12 ,  H04L45/123 ,  H04L45/125 ,  H04L45/70 ,  H04L47/125

摘要： A technique dynamically increases the granularity of prefix control in a computer network. According to the novel technique, a routing table is populated with one or more reachable prefixes, e.g., learned or configured prefixes, and performance characteristics (e.g., bandwidth, cost, delay, etc.) of the prefixes are monitored. Upon determining that a need exists for more granular prefix control (i.e., smaller prefixes), one or more boundaries may be determined upon which to divide one or more of the prefixes based on the monitored characteristics and/or need. Once the one or more boundaries are determined, the one or more prefixes may be “split” accordingly, e.g., by injecting more specific prefixes into the routing table, thus providing more granular prefix control (i.e., by controlling the split prefixes).

摘要翻译： 一种技术动态地增加了计算机网络中前缀控制的粒度。 根据新颖技术，路由表被填充有一个或多个可达到的前缀，例如学习或配置的前缀，并且监视前缀的性能特征（例如，带宽，成本，延迟等）。 在确定需要存在更多的粒度前缀控制（即，较小的前缀）时，可以根据所监视的特性和/或需要确定一个或多个前缀来划分一个或多个前缀的一个或多个边界。 一旦确定了一个或多个边界，则一个或多个前缀可以相应地“分割”，例如通过将更多的特定前缀注入到路由表中，从而提供更细粒度的前缀控制（即，通过控制分割前缀）。

公开(公告)号：US20120120795A1

公开(公告)日：2012-05-17

申请号：US13313773

申请日：2011-12-07

申请人： Pritam Shah ,  Philip C. Jacobs

发明人： Pritam Shah ,  Philip C. Jacobs

IPC分类号： H04L12/26

CPC分类号： H04L47/122 ,  G01V1/28 ,  H04L29/06027 ,  H04L41/00 ,  H04L41/0213 ,  H04L41/0866 ,  H04L45/00 ,  H04L45/02 ,  H04L45/04 ,  H04L45/12 ,  H04L45/123 ,  H04L45/125 ,  H04L45/70 ,  H04L47/125

摘要： In one embodiment, a routing table of a router is populated with a plurality of prefixes. One or more performance characteristics of the plurality of prefixes are monitored. The router determines that a need exists to split a selected prefix of the plurality of prefixes. The router determines one or more boundaries upon which to split the selected prefix based on the monitored performance characteristics. The router then injects one or more more-specific prefixes into the routing table, each more-specific prefix referring to a smaller subset of nodes than the selected prefix, to split the selected prefix on the one or more boundaries to create a plurality of split prefixes. The split prefixes are controlled to optimize distribution of traffic.

摘要翻译： 在一个实施例中，路由器的路由表被填充有多个前缀。 监视多个前缀的一个或多个性能特征。 路由器确定存在分割多个前缀的所选前缀的需要。 路由器基于所监视的性能特征确定将所选择的前缀拆分到哪一个边界。 路由器然后将一个或多个更具体的前缀注入到路由表中，每个更具体的前缀引用比所选择的前缀更小的节点子集，以在一个或多个边界上分割所选择的前缀以创建多个分裂 前缀。 控制分割前缀以优化流量分配。

公开(公告)号：US08165969B2

公开(公告)日：2012-04-24

申请号：US11336584

申请日：2006-01-20

申请人： Pritam Shah ,  Philip C. Jacobs ,  Rahul G. Patel

发明人： Pritam Shah ,  Philip C. Jacobs ,  Rahul G. Patel

IPC分类号： G06Q99/00

CPC分类号： H04L12/14 ,  G06Q30/0283 ,  H04L12/145 ,  H04L12/1485

摘要： A technique performs route optimization of services provided by one or more service providers (SPs) for communication links that are combined in a computer network. According to the novel technique, performance characteristics and statistics (“link data”) for two or more combined links are merged to form link data for a single “virtual combined link.” Route optimization techniques (e.g., priority-based route optimization) may then be applied to one or more virtual combined links based on the combined link data, in addition to link data for zero or more conventional single links (physical or virtual). Illustratively, a route optimization technique may be used in accordance with the present invention to efficiently and accurately minimize costs associated with services provided by a plurality of SPs, wherein each SP charges for utilization of its service based on a tiered pricing structure. The tiered pricing structure comprises one or more tiers, wherein each tier correlates to an amount of service provided by the SP and an associated cost.

摘要翻译： 一种技术对由一个或多个服务提供商（SP）提供的用于组合在计算机网络中的通信链路的服务的路由优化。 根据新技术，两个或多个组合链路的性能特征和统计（“链路数据”）被合并以形成用于单个“虚拟组合链路”的链路数据。路由优化技术（例如，基于优先级的路由优化）可以 然后除了用于零个或更多个常规单个链路（物理或虚拟）的链路数据之外，还可以基于组合的链路数据将其应用于一个或多个虚拟组合链路。 说明性地，根据本发明可以使用路由优化技术来有效和准确地最小化与由多个SP提供的服务相关联的成本，其中每个SP基于分层定价结构为其服务使用收费。 分层定价结构包括一个或多个层，其中每个层与由SP提供的服务量和相关联的成本相关。

公开(公告)号：US08073968B1

公开(公告)日：2011-12-06

申请号：US10980550

申请日：2004-11-03

申请人： Pritam Shah ,  Vamsidhar Valluri ,  Dana Blair ,  Philip C. Jacobs ,  Kathleen Nguyen

发明人： Pritam Shah ,  Vamsidhar Valluri ,  Dana Blair ,  Philip C. Jacobs ,  Kathleen Nguyen

IPC分类号： G06F15/173 ,  G06F15/16

CPC分类号： H04L45/00 ,  H04L43/0829 ,  H04L43/0852 ,  H04L43/0864 ,  H04L45/04 ,  H04L49/20

摘要： An Optimized Edge Routing (OER) technique provides efficiently data routing at the edge of a network or subnetwork. The technique employs a Master node that manages a set of border nodes located at the edge of the network or subnetwork. The Master node may be a stand-alone network management node or may be incorporated into a network node, such as a border node. Unlike prior implementations, the Master node instructs the border nodes to dynamically acquire (“learn”) prefixes of incoming and outgoing data flows and to selectively filter a set of learned address prefixes whose corresponding data flows match a predetermined set of criteria. The criteria may be based on routing metrics other than, or in addition to, conventional cost-based or distance-based metrics. Further, the criteria may include a set of filtering parameters that may be reconfigured, e.g., by the Master node, from time to time. Using the learned prefixes filtered by the border nodes, the Master node can distribute network traffic and utilize network bandwidth more efficiently than conventionally done.

摘要翻译： 优化的边缘路由（OER）技术可在网络或子网的边缘高效地提供数据路由。 该技术采用主节点来管理位于网络或子网边缘的一组边界节点。 主节点可以是独立的网络管理节点，或者可以并入到诸如边界节点的网络节点中。 与先前的实现不同，主节点指示边界节点动态地获取（“学习”）入局和出站数据流的前缀，并且选择性地过滤一组学习的地址前缀，其相应的数据流与预定标准集匹配。 该标准可以基于除了常规的基于成本或基于距离的度量之外的除了或附加的路由度量。 此外，标准可以包括可以例如由主节点不时地重新配置的一组过滤参数。 使用由边界节点过滤的学习前缀，主节点可以比传统方式更高效地分配网络流量并利用网络带宽。

公开(公告)号：US08874490B2

公开(公告)日：2014-10-28

申请号：US13409883

申请日：2012-03-01

申请人： Pritam Shah ,  Philip C. Jacobs ,  Rahul G. Patel

发明人： Pritam Shah ,  Philip C. Jacobs ,  Rahul G. Patel

IPC分类号： G06Q99/00 ,  H04L12/14 ,  G06Q30/02

CPC分类号： H04L12/14 ,  G06Q30/0283 ,  H04L12/145 ,  H04L12/1485

摘要： In one embodiment, two or more links, coupled to a first service provider (SP) that charges a price for utilization of services according to a first pricing structure, are combined to form a single virtual combined link. Each of the two or more links of the virtual combined link and one or more other links, coupled to a second SP that charges a price for utilization of services according to a second pricing structure, are monitored to obtain link data. The link data for the two of more links of the virtual combined link is merged to form link data for the virtual combined link. Data distribution among the virtual combined link and the one or more other links is optimized to distribute data among the virtual combined link and the one or more other links in a manner that minimizes cost.

摘要翻译： 在一个实施例中，耦合到根据第一定价结构为服务的价格收费的第一服务提供商（SP）的两个或多个链路被组合以形成单个虚拟组合链路。 监视虚拟组合链路和一个或多个其他链路的两个或更多个链路中的每一个，耦合到根据第二定价结构为服务的价格收费的第二SP，以获得链路数据。 虚拟组合链接的两个链接的链接数据被合并以形成用于虚拟组合链接的链接数据。 优化虚拟组合链路和一个或多个其他链路之间的数据分布，以便以最小化成本的方式在虚拟组合链路和一个或多个其他链路之间分发数据。

公开(公告)号：US08625420B2

公开(公告)日：2014-01-07

申请号：US13313773

申请日：2011-12-07

申请人： Pritam Shah ,  Philip C. Jacobs

发明人： Pritam Shah ,  Philip C. Jacobs

IPC分类号： H04L12/26

CPC分类号： H04L47/122 ,  G01V1/28 ,  H04L29/06027 ,  H04L41/00 ,  H04L41/0213 ,  H04L41/0866 ,  H04L45/00 ,  H04L45/02 ,  H04L45/04 ,  H04L45/12 ,  H04L45/123 ,  H04L45/125 ,  H04L45/70 ,  H04L47/125

摘要： In one embodiment, a routing table of a router is populated with a plurality of prefixes. One or more performance characteristics of the plurality of prefixes are monitored. The router determines that a need exists to split a selected prefix of the plurality of prefixes. The router determines one or more boundaries upon which to split the selected prefix based on the monitored performance characteristics. The router then injects one or more more-specific prefixes into the routing table, each more-specific prefix referring to a smaller subset of nodes than the selected prefix, to split the selected prefix on the one or more boundaries to create a plurality of split prefixes. The split prefixes are controlled to optimize distribution of traffic.

摘要翻译： 在一个实施例中，路由器的路由表被填充有多个前缀。 监视多个前缀的一个或多个性能特征。 路由器确定存在分割多个前缀的所选前缀的需要。 路由器基于所监视的性能特征确定将所选择的前缀拆分到哪一个边界。 路由器然后将一个或多个更具体的前缀注入到路由表中，每个更具体的前缀引用比所选择的前缀更小的节点子集，以在一个或多个边界上分割所选择的前缀以创建多个分裂 前缀。 控制分割前缀以优化流量分配。

公开(公告)号：US07257560B2

公开(公告)日：2007-08-14

申请号：US10631682

申请日：2003-07-31

申请人： Philip C. Jacobs ,  Rahul G. Patel

发明人： Philip C. Jacobs ,  Rahul G. Patel

IPC分类号： G06F17/00

CPC分类号： H04L12/1485 ,  G06Q30/0283 ,  H04L12/14 ,  H04L12/145 ,  H04M15/00 ,  H04M15/41 ,  H04M15/49 ,  H04M15/80

摘要： A technique for efficiently and accurately minimizing costs associated with services provided by a plurality of service providers (SPs) that bill for their services based on a tiered cost structure. Target tiers are generated based on the utilization of the SPs' services and the SPs' cost structures. Utilization of the SPs' services is monitored. A momentary target utilization rate (MTUR) is generated for each SP based on the cumulated utilization of the SP's service and the SP's target tier. Utilization of the SPs' services is distributed based on the generated MTURs in a manner that minimizes cost. If the utilization of the SPs' services indicates the MTURs have been exceeded, new target tiers and MTURs are generated and utilization of the SPs' services is redistributed among the SPs in a manner that minimizes cost.

摘要翻译： 一种用于有效和准确地最小化由多个服务提供商（SP）提供的服务相关联的成本的技术，其基于分层成本结构对其服务进行计费。 目标层是基于SPs服务和SP的成本结构的利用而产生的。 对SPs服务的利用进行监控。 基于SP的服务和SP的目标层的累积利用率，为每个SP生成瞬时目标利用率（MTUR）。 基于生成的MTUR以最小化成本的方式来分发SP的服务的使用。 如果SP服务的使用表明已经超出了MTUR，则会生成新的目标层和MTUR，并以最小化成本的方式在SP之间重新分配SP的业务的使用。

公开(公告)号：US09697346B2

公开(公告)日：2017-07-04

申请号：US13412948

申请日：2012-03-06

申请人： Philip C. Jacobs ,  John A. Toebes

发明人： Philip C. Jacobs ,  John A. Toebes

IPC分类号： H04L9/32 ,  G06F21/36 ,  G06F21/31 ,  H04L29/06 ,  G06F21/32

CPC分类号： G06F21/36 ,  G06F21/31 ,  G06F21/32 ,  H04L63/08

摘要： In one embodiment, a method includes identifying a request for access to a first system and obtaining a visual image including at least a first piece of information associated with the request. The visual image is associated with a first device and obtained using a second device. The method also includes determining if the at least first piece of information indicates that the access to the first system is to be granted, wherein determining if the at least first piece of information indicates that the access to the first system is to be granted includes implementing a visual recognition algorithm to process the at least first piece of information. Finally, the access to the first system is granted if it is determined that the at least first piece of information indicates that the access to the first system is to be granted.

公开(公告)号：US20130239205A1

公开(公告)日：2013-09-12

申请号：US13412948

申请日：2012-03-06

申请人： Philip C. Jacobs ,  John A. Toebes

发明人： Philip C. Jacobs ,  John A. Toebes

IPC分类号： G06F21/00

CPC分类号： G06F21/36 ,  G06F21/31 ,  G06F21/32 ,  H04L63/08

摘要： In one embodiment, a method includes identifying a request for access to a first system and obtaining a visual image including at least a first piece of information associated with the request. The visual image is associated with a first device and obtained using a second device. The method also includes determining if the at least first piece of information indicates that the access to the first system is to be granted, wherein determining if the at least first piece of information indicates that the access to the first system is to be granted includes implementing a visual recognition algorithm to process the at least first piece of information. Finally, the access to the first system is granted if it is determined that the at least first piece of information indicates that the access to the first system is to be granted.

摘要翻译： 在一个实施例中，一种方法包括识别访问第一系统的请求并获得包括至少与请求相关联的第一信息的可视图像。 视觉图像与第一装置相关联并且使用第二装置获得。 所述方法还包括确定所述至少第一条信息是否指示对第一系统的访问被授予，其中确定所述至少第一条信息是否指示对第一系统的访问将被授予包括实现 用于处理所述至少第一片信息的视觉识别算法。 最后，如果确定所述至少第一条信息指示要对第一系统的访问被授予，则授予对第一系统的访问。