利索-全球专利检索

  1. 登录
  2. 注册

搜索结果

7 条记录 (耗时 0.02 秒)

    SYSTEM AND METHOD FOR MULTI-LAYER NETWORK ANALYSIS AND DESIGN
    1.
    发明申请
    SYSTEM AND METHOD FOR MULTI-LAYER NETWORK ANALYSIS AND DESIGN 有权
    多层网络分析与设计的系统与方法

    公开(公告)号：US20100149993A1

    公开(公告)日：2010-06-17

    申请号：US12334681

    申请日：2008-12-15

    申请人： Deepak KAKADIA ,  Jay J. LEE ,  Thomas H. TAN

    发明人： Deepak KAKADIA ,  Jay J. LEE ,  Thomas H. TAN

    IPC分类号： G06F11/00

    CPC分类号： H04L69/40

    摘要： Techniques for providing a method and system for multi-layer network analysis and design are disclosed. In one particular exemplary embodiment, the techniques may be realized as a method, comprising determining, using a computer model of a network, a minimum probability of failure path between a pair of network nodes at a first network layer for one or more pairs of network nodes, calculating, using a processor and stored network data, a value for the minimum probability of failure for the identified minimum probability of failure path between the pair of network nodes at the first network layer for the one or more pairs of network nodes. The method may include identifying, using a processor, a maximum of the determined minimum probability of failure values for the one or more pairs of network nodes for the first network layer, determining, using the computer model of a network, a minimum probability of failure path between a pair of network nodes at one or more secondary network layers for one or more pairs of network nodes and calculating, using a processor and stored network data, a value for the minimum probability of failure for the identified minimum probability of failure path at the one or more secondary network layers. The method may further include identifying, using a processor, a maximum of the determined minimum probability of failures for each of the one or more secondary network layers, and outputting, via a user interface, one or more maximum of the determined minimum probability of failure values for one or more network layers for one or more pairs of network nodes of the modeled network.

    摘要翻译： 公开了提供用于多层网络分析和设计的方法和系统的技术。 在一个特定的示例性实施例中，可以将技术实现为一种方法，包括使用网络的计算机模型来确定在一个或多个网络对的第一网络层的一对网络节点之间的最小故障路径概率 节点，使用处理器和存储的网络数据计算针对所述一对或多对网络节点的所述第一网络层的所述一对网络节点之间所识别的最小故障路径概率的最小故障概率的值。 该方法可以包括使用处理器识别用于第一网络层的一对或多对网络节点的所确定的最小故障概率值的最大值，使用网络的计算机模型确定最小故障概率 在一个或多个次网络层上的一对网络节点之间的一对或多对网络节点之间的路径，并且使用处理器和存储的网络数据计算所识别的最小故障路径概率的最小故障概率的值 一个或多个二级网络层。 该方法还可以包括使用处理器识别所确定的一个或多个辅助网络层中的每个的最大故障概率，并且经由用户界面输出所确定的最小故障概率的一个或多个最大值 用于建模网络的一个或多个网络节点对的一个或多个网络层的值。

    P2P ACTIVITY DETECTION AND MANAGEMENT
    2.
    发明申请
    P2P ACTIVITY DETECTION AND MANAGEMENT 有权
    P2P活动检测与管理

    公开(公告)号：US20120297051A1

    公开(公告)日：2012-11-22

    申请号：US13109195

    申请日：2011-05-17

    申请人： Deepak KAKADIA ,  Jay J. LEE ,  Thomas H. TAN

    发明人： Deepak KAKADIA ,  Jay J. LEE ,  Thomas H. TAN

    IPC分类号： G06F15/16

    CPC分类号： H04L67/104 ,  H04L12/6418 ,  H04L43/026 ,  H04L43/028 ,  H04L63/0227 ,  H04L63/1425 ,  H04L67/22

    摘要： A network device may receive a peer-to-peer (P2P) activity record corresponding to a P2P data flow of P2P activity in a network. The P2P data flow may include content information communicated from a first user equipment device (UE) to a second UE via the network, and the P2P activity record may include information identifying the P2P data flow. The network device may insert the information identifying the P2P data flow into a P2P activity map and compare the P2P activity map to a P2P pattern of interest. The network device may also determine a P2P activity of interest probability based on the comparison of the P2P activity map to the P2P pattern of interest, which may describe the likelihood that P2P activity of interest is occurring in the network. The network device may also generate a system response based on the P2P activity of interest probability.

    摘要翻译： 网络设备可以接收与网络中的P2P活动的P2P数据流对应的对等（P2P）活动记录。 P2P数据流可以包括经由网络从第一用户设备设备（UE）传送到第二UE的内容信息，并且P2P活动记录可以包括标识P2P数据流的信息。 网络设备可以将识别P2P数据流的信息插入到P2P活动地图中，并将P2P活动地图与P2P感兴趣的图案进行比较。 网络设备还可以基于P2P活动图与感兴趣的P2P模式的比较来确定兴趣的P2P活动，这可以描述在网络中发生兴趣的P2P活动的可能性。 网络设备还可以基于P2P兴趣概率生成系统响应。

    REDUNDANCY IN POINT-TO-MULTIPOINT (PMP) BACKHAUL NETWORKS
    5.
    发明申请
    REDUNDANCY IN POINT-TO-MULTIPOINT (PMP) BACKHAUL NETWORKS 有权
    点到多点（PMP）的冗余网络

    公开(公告)号：US20130077472A1

    公开(公告)日：2013-03-28

    申请号：US13246307

    申请日：2011-09-27

    申请人： Thomas H. TAN

    发明人： Thomas H. TAN

    IPC分类号： G06F11/00

    CPC分类号： H04L45/22 ,  H04L41/0663 ,  H04L45/28 ,  H04L69/40

    摘要： A device establishes a failover virtual local area network (VLAN) with a first concentration node, a first Ethernet backhaul router, and an access node of a first Ethernet backhaul coverage area. The device also receives, via the first Ethernet backhaul router, an indication of a failure of a second concentration node of a second Ethernet backhaul coverage area intersecting with the first Ethernet backhaul coverage area. The device further enables, based on the failure indication, a switchover of traffic, associated with the second concentration node, to the device and via the failover VLAN.

    摘要翻译： 设备与第一集中节点，第一以太网回程路由器和第一以太网回程覆盖区域的接入节点建立故障切换虚拟局域网（VLAN）。 该设备还经由第一以太网回程路由器接收与第一以太网回程覆盖区域相交的第二以太网回程覆盖区域的第二集中节点的故障的指示。 该设备还基于故障指示，将与第二集中节点相关联的流量切换到设备并经由故障转移VLAN。

    DYNAMIC RESOURCE ALLOCATION WITHIN A HETEROGENEOUS WIRELESS TRANSPORT NETWORK
    6.
    发明申请
    DYNAMIC RESOURCE ALLOCATION WITHIN A HETEROGENEOUS WIRELESS TRANSPORT NETWORK 有权
    在异质无线传输网络中的动态资源分配

    公开(公告)号：US20130051233A1

    公开(公告)日：2013-02-28

    申请号：US13222651

    申请日：2011-08-31

    申请人： Jin YANG ,  Thomas H. TAN

    发明人： Jin YANG ,  Thomas H. TAN

    IPC分类号： H04W24/00 ,  H04W72/10 ,  H04W28/02

    CPC分类号： H04W16/10 ,  H04W92/20

    摘要： A system to receive an instruction to allocate resources to a particular link of a group of links, to permit traffic to be transmitted to one of a group of nodes, associated with one of a group of base stations, via the particular link; and identify a respective achievable throughput, associated with each link during a first time period, based on a respective capacity and condition associated with each link. The system is also to identify a respective achieved throughput, associated with each link, based on a respective achieved throughput associated with each link during a second time period and a respective quantity of traffic to be transmitted via each link during the first time period; generate a respective value, associated with each link, based on the respective achievable throughput and the respective achieved throughput; and transmit, to a node and via a link, a quantity of traffic, based on a determination that a respective value, associated with the link, is a greatest respective value.

    摘要翻译： 一种系统，用于接收将资源分配给一组链路的特定链路的指令，以允许通过所述特定链路将流量发送到与一组基站中的一组相关联的一组节点; 以及基于与每个链路相关联的相应容量和条件，识别在第一时间段期间与每个链路相关联的相应的可实现吞吐量。 该系统还可以基于在第二时间段期间与每个链路相关联的相应实现吞吐量以及在第一时间段期间经由每个链路传送的相应数量的流量来识别与每个链路相关联的相应实现的吞吐量; 基于相应的可实现吞吐量和各自实现的吞吐量来生成与每个链路相关联的相应值; 并且基于与所述链路相关联的相应值是最大的相应值的确定，向节点和经由链路经由链路传送数量的业务量。