知搜-全球专利检索

  1. 登录
  2. 注册

搜索结果

61 条记录 (耗时 0.018 秒)

    Distributing decision making in a centralized flow routing system
    5.
    发明申请
    Distributing decision making in a centralized flow routing system 有权
    在集中流量路由系统中分配决策

    公开(公告)号：US20110273988A1

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

    申请号：US12662885

    申请日：2010-05-10

    申请人： Jean Tourrilhes ,  Praveen Yalagandula ,  Puneet Sharma ,  Jeffrey Clifford Mogul ,  Sujata Banerjee

    发明人： Jean Tourrilhes ,  Praveen Yalagandula ,  Puneet Sharma ,  Jeffrey Clifford Mogul ,  Sujata Banerjee

    IPC分类号： H04L12/26

    CPC分类号： H04L43/062 ,  H04L41/0816 ,  H04L45/38 ,  H04L45/42 ,  H04L47/32

    摘要： Local rules for managing flows devolved from a central controller are received at a switch. The central controller determines a global set of rules for managing flows. The switch receives a packet from a flow from a network and determines whether a metric for the flow satisfies a dynamic condition to trigger a metric report to the central controller. In response to a determination that the metric for the flow at the switch satisfies the dynamic condition to trigger a metric report to the central controller, the switch sends a metric report to the central controller, and the switch then receives an instruction to manage the flow from the central controller. In response to a determination that the metric for the flow at the switch does not satisfy the dynamic condition to trigger the metric report to the central controller, the switch manages the flow using the local rules for managing flows.

    摘要翻译： 在交换机上接收到用于管理从中央控制器传出的流量的本地规则。 中央控制器确定管理流量的全局规则集。 交换机从来自网络的流接收分组，并确定流的度量是否满足动态条件以触发对中央控制器的度量报告。 响应于确定交换机处的流量的度量满足动态条件以触发对中央控制器的度量报告，交换机向中央控制器发送度量报告，然后交换机接收管理流程的指令 从中央控制器。 响应于确定交换机处的流量的度量不满足触发向中央控制器的度量报告的动态条件，交换机使用用于管理流的本地规则管理流。

    Selecting nodes close to another node in a network using location information for the nodes
    6.
    发明授权
    Selecting nodes close to another node in a network using location information for the nodes 有权
    使用节点的位置信息选择靠近网络中另一个节点的节点

    公开(公告)号：US07827279B2

    公开(公告)日：2010-11-02

    申请号：US10767285

    申请日：2004-01-30

    申请人： Zhichen Xu ,  Sujata Banerjee ,  Sung-Ju Lee

    发明人： Zhichen Xu ,  Sujata Banerjee ,  Sung-Ju Lee

    IPC分类号： G06F15/173

    CPC分类号： H04L45/02 ,  H04L45/126 ,  H04L45/46 ,  H04L45/54

    摘要： A network includes a plurality of nodes. A set of candidate nodes from the plurality of nodes is selected based on location information for the candidate nodes and a first node also in the network. A clustering algorithm is applied to the location information for the candidate nodes and the first node, and a subset of the set of candidate nodes closest to the first node is identified based on the results of applying the clustering algorithm.

    摘要翻译： 网络包括多个节点。 基于候选节点的位置信息和网络中的第一节点来选择来自多个节点的一组候选节点。 聚类算法应用于候选节点和第一节点的位置信息，并且基于应用聚类算法的结果来识别最接近第一节点的候选节点集合的子集。

    Distributed network distance detemination using a distributed hash table overlay network
    8.
    发明申请
    Distributed network distance detemination using a distributed hash table overlay network 有权
    使用分布式哈希表覆盖网络分布式网络距离

    公开(公告)号：US20080181135A1

    公开(公告)日：2008-07-31

    申请号：US11700579

    申请日：2007-01-31

    申请人： Praveen Yalagandula ,  Puneet Sharma ,  Sujata Banerjee ,  Sung-Ju Lee

    发明人： Praveen Yalagandula ,  Puneet Sharma ,  Sujata Banerjee ,  Sung-Ju Lee

    IPC分类号： G08C15/00 ,  H04L12/28

    CPC分类号： H04L67/104 ,  H04L41/12 ,  H04L43/0829 ,  H04L43/0852 ,  H04L43/0864 ,  H04L43/10 ,  H04L67/1002 ,  H04L67/1065

    摘要： Distances are determined between an identified node and landmark nodes and milestone nodes in a network. The closest milestone or landmark node associated with a shortest of the measured distances is determined. A corresponding distributed hash table (DHT) overlay node is queried for distances between observed nearest nodes for the closest milestone or landmark node and the identified node. Distances between the identified node and the observed nearest nodes are calculated from distances received from the DHT overlay node and the measured distance to the closest milestone or landmark node. K-closest nodes from the identified node are selected from at least one of the closest milestone or landmark node and one or more of the observed nearest nodes based on the calculated distances.

    摘要翻译： 在一个网络中确定的节点和地标节点和里程碑节点之间确定距离。 确定与最短测量距离相关联的最近的里程碑或地标节点。 查询对应的分布式哈希表（DHT）覆盖节点，用于最近的里程碑或地标节点和已识别节点的观察最近节点之间的距离。 从从DHT覆盖节点接收的距离和到最近里程碑或地标节点的测量距离计算识别的节点和观察到的最近节点之间的距离。 基于计算出的距离，从最近的里程碑或地标节点中的至少一个和观察到的最近的节点中的至少一个中选出来自所识别的节点的K个最近的节点。

    Selecting service nodes for an end-to-end service path from a reduced search space
    9.
    发明申请
    Selecting service nodes for an end-to-end service path from a reduced search space 有权
    从减少的搜索空间中选择服务节点以实现端到端服务路径

    公开(公告)号：US20080181118A1

    公开(公告)日：2008-07-31

    申请号：US11700441

    申请日：2007-01-31

    申请人： Puneet Sharma ,  Manish Jain ,  Sujata Banerjee

    发明人： Puneet Sharma ,  Manish Jain ,  Sujata Banerjee

    IPC分类号： G08C15/00 ,  H04L12/28

    CPC分类号： H04L67/16 ,  H04L45/02 ,  H04L45/306 ,  H04L45/48 ,  H04L45/64

    摘要： Service nodes in a service overlay network are selected to provide a service path for a requested service by determining a reduced search space of service nodes in the service overlay network that are operable to provide service components for the requested service. From the reduced search space of service nodes, service nodes are selected to form a service path that satisfies all quality of service constraints for the service.

    摘要翻译： 选择服务覆盖网络中的服务节点以通过确定服务覆盖网络中的可操作以提供所请求服务的服务组件的服务节点的减小的搜索空间来为所请求的服务提供服务路径。 从服务节点的减少的搜索空间中选择服务节点以形成满足服务的所有服务质量约束的服务路径。