公开(公告)号：US20150019757A1

公开(公告)日：2015-01-15

申请号：US13939541

申请日：2013-07-11

申请人： Sam Wechsler

发明人： Sam Wechsler

IPC分类号： H04L12/733

CPC分类号： G01C21/34 ,  G01C21/3438 ,  G08G1/0104 ,  G08G1/0141 ,  G08G1/0145 ,  H04L45/126

摘要： A method, computer program product, and computer system are provided for determining a convenient route. The method includes, for instance: obtaining, by a processor, a route that includes a starting point and an ending point; analyzing the route to determine whether at least one stored route is within a pre-defined acceptance zone of the route; and responsive to determining that at least one stored route is within a pre-defined acceptance zone, assigning a convenience factor of the at least one stored route relative to the route.

摘要翻译： 提供了一种方法，计算机程序产品和计算机系统，用于确定方便的路线。 该方法包括例如：由处理器获得包括起点和终点的路线; 分析路由以确定至少一个存储的路由是否在路由的预定义接收区域内; 并且响应于确定至少一个存储的路由在预定义的接收区域内，分配所述至少一个存储路由相对于所述路线的便利因子。

公开(公告)号：US08914042B2

公开(公告)日：2014-12-16

申请号：US13431730

申请日：2012-03-27

申请人： Tara Chand Singhal

发明人： Tara Chand Singhal

IPC分类号： H04W24/00 ,  H04W4/02 ,  H04W48/18 ,  H04L29/12

CPC分类号： H04L45/126 ,  G06F17/30377 ,  G06F17/30864 ,  H04L61/15 ,  H04L61/1511 ,  H04L61/2007 ,  H04L61/609 ,  H04L63/08 ,  H04M15/8005 ,  H04W4/02 ,  H04W4/023 ,  H04W12/06 ,  H04W48/18

摘要： A handheld wireless device makes a request for service from a server of a business on a global network, the request originating from the wireless device is automatically routed to the closest server of the business that is geographically closest to the location of the wireless device as determined by a GPS function in the device, or by a router server in the wireless network based on the group of cell towers being connected to by the wireless device, or based on the location of the wireless device in a global telephone network database, for faster access to the service and a response there from.

摘要翻译： 手持无线设备从全球网络上的业务的服务器请求服务，来自无线设备的请求被自动路由到所确定的在地理上最接近无线设备的位置的业务的最接近的服务器 通过设备中的GPS功能，或者由基于由无线设备连接的小区塔组的无线网络中的路由器服务器，或者基于无线设备在全球电话网络数据库中的位置来更快地 访问服务和响应。

公开(公告)号：US20140344473A1

公开(公告)日：2014-11-20

申请号：US14278640

申请日：2014-05-15

申请人： POWER-ALL NETWORKS LIMITED

发明人： STEVE LAP WAI HUI

IPC分类号： H04L12/721

CPC分类号： H04L45/126

摘要： A transmission management method, includes: receiving a request for establishing an on-demand virtual lease line from a first electronic device when a request is made to communicate with a second electronic device. geographic positions of the first electronic device, the second electronic device, and routers are determined. A data transmission direction is determined according to the geographic positions of the first and the second electronic device. Routers located between the first electronic device and the second electronic device are determined gradually. Positions and workloads of the routers located between the first and second electronic device are analyzed, and an optimal transmission path is determined according to the positions and workloads of the router. The first electronic device and the second electronic device are controlled to communicate with each other via the determined optimal transmission path.

摘要翻译： 一种传输管理方法，包括：当请求与第二电子设备通信时，从第一电子设备接收建立点播虚拟租用线路的请求。 确定第一电子设备，第二电子设备和路由器的地理位置。 根据第一和第二电子设备的地理位置来确定数据传输方向。 位于第一电子设备和第二电子设备之间的路由器被逐渐确定。 分析位于第一和第二电子设备之间的路由器的位置和工作负载，并根据路由器的位置和工作负载确定最佳传输路径。 控制第一电子设备和第二电子设备经由确定的最佳传输路径相互通信。

公开(公告)号：US08681635B2

公开(公告)日：2014-03-25

申请号：US12982356

申请日：2010-12-30

申请人： David W. Nesbitt ,  Leonard B. Jansen

发明人： David W. Nesbitt ,  Leonard B. Jansen

IPC分类号： G01R31/08

CPC分类号： G01C21/34 ,  H04L45/00 ,  H04L45/12 ,  H04L45/126

摘要： Systems and methods are disclosed for determining shortest route(s) or path(s) to one or more destination nodes from one or more origin nodes. In accordance with one implementation, a computer-implemented method is provided that includes identifying a plurality of origin nodes associated with a route based on a threshold distance from at least one destination node, the origin nodes being options for a departure from the route to the at least one destination node. Further, the method may include calculating, using a processor, a cost associated with travelling from each of the origin nodes to at least one common intermediate node between the route and the at least one destination node, and determining a path to the at least one destination node based on the origin node having the lowest calculated cost.

摘要翻译： 公开了用于从一个或多个起始节点确定到一个或多个目的地节点的最短路线或路径的系统和方法。 根据一个实现，提供了一种计算机实现的方法，其包括基于距离至少一个目的地节点的阈值距离来识别与路线相关联的多个起始节点，所述起始节点是用于从所述路线偏离到所述路线的选项 至少一个目的地节点。 此外，该方法可以包括使用处理器计算与从每个原始节点到路由与至少一个目的地节点之间的至少一个公共中间节点的行进相关联的成本，以及确定到至少一个 基于具有最低计算成本的原点节点的目的地节点。

公开(公告)号：US20140047109A1

公开(公告)日：2014-02-13

申请号：US14053884

申请日：2013-10-15

申请人： AT&T INTELLECTUAL PROPERTY I, L.P.

发明人： Mario A. Santoro ,  Herani Brotman ,  Alan L. Glasser ,  James Miros ,  Oliver Spatscheck ,  Jacobus E. Van der Merwe

IPC分类号： H04L12/26

CPC分类号： H04L43/08 ,  H04L29/12066 ,  H04L45/126 ,  H04L61/1511 ,  H04L61/2007 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/1021

摘要： A system includes first and second cache servers a domain name server, and a route controller. The cache servers are each configured to respond to an anycast address. Additionally, the first cache server is configured to respond to a first unicast address, and the second cache server is configured to respond to a second unicast address. The router controller configured to determine wither the status of the first cache server is non-overloaded, overloaded, or offline. The route controller is further configured to instruct the domain name server to provide the second unicast address when the status is overloaded or offline, and modify routing of the anycast address to direct a content request sent to the anycast address to the second cache server when the status is offline. The domain name server is configured to receive a request from a requestor for a cache server address. Additionally, the domain name server is configured to provide an anycast address to the requestor when the status of the first cache server is non-overloaded, and provide the second unicast address to the requestor when the status of the first cache server is offline or overloaded.

摘要翻译： 系统包括第一和第二缓存服务器，域名服务器和路由控制器。 每个缓存服务器都配置为响应任播地址。 此外，第一缓存服务器被配置为响应第一单播地址，并且第二高速缓存服务器被配置为响应第二单播地址。 配置为确定第一个缓存服务器的状态的路由器控制器是非重载的，过载的或离线的。 路由控制器还被配置为当状态过载或离线时，指示域名服务器提供第二单播地址，并且修改任播地址的路由以将发送到任播地址的内容请求定向到第二高速缓存服务器 状态离线 域名服务器被配置为从缓存服务器地址的请求者接收请求。 此外，当第一缓存服务器的状态不重载时，域名服务器被配置为向请求者提供任播地址，并且当第一缓存服务器的状态离线或超载时，向请求者提供第二单播地址 。

公开(公告)号：US08634406B2

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

申请号：US12165996

申请日：2008-07-01

申请人： Brian Keith Seal

发明人： Brian Keith Seal

IPC分类号： H04L12/28 ,  H04L12/56

CPC分类号： H04W40/20 ,  H04L45/126

摘要： Systems and methods for routing packets using node virtual locations are disclosed. Such a virtual location may be determined, for example, by determining a geographic location that is central to other nodes with which the node can communicate. In certain embodiments, a node's virtual location may more accurately represent an approximate center point of a node's communication range. In one exemplary embodiment, a node's virtual location is an average of the geographic locations of radio nodes with which the node is in communication.

摘要翻译： 公开了使用节点虚拟位置路由分组的系统和方法。 这样的虚拟位置可以例如通过确定对于节点可以与其进行通信的其他节点的中心的地理位置来确定。 在某些实施例中，节点的虚拟位置可以更准确地表示节点的通信范围的近似中心点。 在一个示例性实施例中，节点的虚拟位置是节点与之通信的无线电节点的地理位置的平均值。

公开(公告)号：US20130159550A1

公开(公告)日：2013-06-20

申请号：US13331686

申请日：2011-12-20

申请人： Jean-Philippe Vasseur

发明人： Jean-Philippe Vasseur

IPC分类号： G06F15/173

CPC分类号： H04L45/42 ,  H04L41/0823 ,  H04L41/12 ,  H04L41/5019 ,  H04L45/00 ,  H04L45/02 ,  H04L45/021 ,  H04L45/12 ,  H04L45/126 ,  H04L45/14 ,  H04L45/20 ,  H04L45/44 ,  H04L45/70 ,  H04W40/248 ,  Y04S40/164

摘要： In one embodiment, a distributed intelligence agent (DIA) collects local state information from a plurality of minimalistic connected objects (MCOs) in a computer network, the local state information for each MCO comprising a corresponding neighbor list and a selected next-hop for the respective MCO, where one or more of the MCOs are configured to select their next-hop without any self-optimization. The DIA may then analyze a current routing topology, which is the combined result of the selected next-hops, in comparison to a computed optimal routing topology, and (optionally) in light of required service level agreement (SLA), to determine whether to optimize the current routing topology. In response to determining that the current routing topology should be optimized, the DIA may transmit a unicast routing instruction to one or more individual MCOs to instruct those individual MCOs how to optimize the current routing topology, accordingly.

摘要翻译： 在一个实施例中，分布式智能代理（DIA）从计算机网络中的多个简约连接对象（MCO）收集本地状态信息，每个MCO的本地状态信息包括对应的邻居列表和用于 相应的MCO，其中一个或多个MCO被配置为在没有任何自优化的情况下选择它们的下一跳。 然后，DIA可以分析当前路由拓扑，其是所选择的下一跳的组合结果，与计算的最佳路由拓扑相比，以及（可选地）根据所需的服务水平协议（SLA），以确定是否 优化当前路由拓扑。 响应于确定当前路由拓扑应被优化，DIA可以将单播路由指令发送到一个或多个单独的MCO，以指示这些个体MCO如何优化当前路由拓扑。

公开(公告)号：US08284788B2

公开(公告)日：2012-10-09

申请号：US12512693

申请日：2009-07-30

申请人： Cedric Westphal ,  Guanhong Pei

发明人： Cedric Westphal ,  Guanhong Pei

IPC分类号： H04L12/28 ,  H04L12/56

CPC分类号： H04L45/48 ,  H04L45/02 ,  H04L45/122 ,  H04L45/126 ,  H04L45/14 ,  H04L45/54

摘要： A method and apparatus is disclosed herein for scalable routing with greedy embedding. In one embodiment, the method comprises storing log(n) coordinates in a routing table, where n is the number of nodes in a network, and further wherein the log(n) coordinates are generated by constructing a greedy embedding that embeds a graph topology depicting connections between n nodes of a network into a geometric space so as to use greedy forwarding by generating a spanning tree out of a connection graph representing the connections between the n nodes of the network, decomposing the tree into at most n branches, assigning a set of geometric coordinates to vertices in the tree in an n-dimensional space, and projecting the set of geometric coordinates onto a k-dimensional space, where k is less than n, to create the log(n) coordinates; and routing packets via nodes of the network using the log(n) coordinates in the routing table.

摘要翻译： 本文公开了一种用于具有贪心嵌入的可扩展路由的方法和装置。 在一个实施例中，该方法包括在路由表中存储log（n）坐标，其中n是网络中的节点数，并且其中log（n）坐标是通过构建嵌入图形拓扑的贪心嵌入来生成的 描绘网络的n个节点之间的连接到几何空间，以便通过从表示网络的n个节点之间的连接的连接图中生成生成树来使用贪婪转发，将树分解为最多n个分支，分配 将几何坐标集合在n维空间中的树中的顶点，并将几何坐标集合投影到k维空间上，其中k小于n，以创建log（n）坐标; 并使用路由表中的log（n）坐标来路由节点的网络路由数据包。

公开(公告)号：US20120238275A1

公开(公告)日：2012-09-20

申请号：US13285286

申请日：2011-10-31

申请人： Paul Anthony Galwas ,  Raph Weyman

发明人： Paul Anthony Galwas ,  Raph Weyman

IPC分类号： H04W40/04

CPC分类号： H04W28/12 ,  H04L45/126

摘要： A communication system including one or more end points, each end point interconnected to a wireless network. The communication system also includes a media network system, the network system contains a registration server for registering device IDs of the end points in the communication system, a database for storing device IDs, one or more media servers for routing calls between end points and a signaling server for selecting one or more media servers to route a call between end points in the communication system based on an algorithm that evaluates one or more predetermined conditions.

摘要翻译： 包括一个或多个端点的通信系统，每个端点互连到无线网络。 通信系统还包括媒体网络系统，该网络系统包含用于注册通信系统中的终点的设备ID的注册服务器，用于存储设备ID的数据库，用于在终端之间路由呼叫的一个或多个媒体服务器 信令服务器，用于基于评估一个或多个预定条件的算法来选择一个或多个媒体服务器以在通信系统中的终点之间路由呼叫。

公开(公告)号：US20110051594A1

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

申请号：US12547580

申请日：2009-08-26

申请人： Joseph Edward Knepley, JR. ,  David Anthony Garbin

发明人： Joseph Edward Knepley, JR. ,  David Anthony Garbin

IPC分类号： G06F11/00

CPC分类号： H04L45/126

摘要： The invention is directed toward an automated system and process to provide resiliency to a network infrastructure where traditional established methods tend to fail. The system analyzes the underlying physical characteristics of the network topology to identify physically diverse backup routing paths among nodes in the network. The system takes as input the number of diverse paths desired and a characteristic(s) used to choose the most desirable paths, such as delay, flow, or cost. The invention searches for multiple solutions for the selected number of diverse paths within the network.

摘要翻译： 本发明涉及一种自动化系统和过程，以向传统建立的方法失败的网络基础设施提供弹性。 系统分析网络拓扑的底层物理特性，以识别网络节点之间的物理多样化备份路由路径。 系统以期望的不同路径的数量和用于选择最理想的路径（例如延迟，流量或成本）的特性作为输入。 本发明在网络内搜索所选数量的不同路径的多个解决方案。