知搜-全球专利检索

  1. Login
  2. Sign Up

Search Results

40 records (took 0.028 seconds)

    INTEREST FORWARDING FOR INTERACTIVE CLIENT ANONYMITY
    32.
    发明申请
    INTEREST FORWARDING FOR INTERACTIVE CLIENT ANONYMITY 有权
    相互交往客户偏好的利益

    公开(公告)号：US20150032892A1

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

    申请号：US13949393

    申请日：2013-07-24

    Applicant: CISCO TECHNOLOGY, INC.

    Inventor： Ashok Narayanan ,  David R. Oran

    IPC: H04L12/911

    CPC classification number: H04L47/70 ,  H04L63/0414 ,  H04L63/0428

    Abstract: In one embodiment, an intermediate node in a communication network receives a client interest with an indication of a client-requested reverse private path. The reverse private path is a label switched path toward a corresponding client with encrypted client information. In response to receiving the client interest, the intermediate node allocates a label for the reverse private path. The allocated label is mapped to a node from which the client interest is received. The intermediate node then forwards the client interest with the allocated label toward a server. In another embodiment, the server receives a client interest including a client-requested reverse private path from a particular intermediate node and determines a server interest. The allocated label for the client interest is inserted into the server interest which is forwarded toward the client via the particular intermediate node using the allocated label for the reverse private path.

    Abstract translation: 在一个实施例中，通信网络中的中间节点通过客户端请求的反向私有路径的指示来接收客户端兴趣。 反向私有路径是朝向具有加密客户端信息的相应客户端的标签交换路径。 响应于接收到客户端的兴趣，中间节点分配用于反向专用路径的标签。 分配的标签映射到接收客户端兴趣的节点。 中间节点然后将客户端的兴趣转发给服务器。 在另一个实施例中，服务器从特定中间节点接收包括客户端请求的反向专用路径的客户端兴趣并确定服务器兴趣。 用于客户兴趣的分配的标签被插入到通过特定中间节点使用分配的用于反向专用路径的标签向客户机转发的服务器兴趣。

    Optimized in-network retransmission for information-centric networking protocols
    35.
    发明授权
    Optimized in-network retransmission for information-centric networking protocols 有权

    公开(公告)号：US10069736B2

    公开(公告)日：2018-09-04

    申请号：US15144551

    申请日：2016-05-02

    Applicant: CISCO TECHNOLOGY, INC.

    Inventor： David R. Oran ,  James Cameron Gibson ,  Maziar Mirzazad Barijough

    IPC: H04L12/803 ,  H04L12/801 ,  H04L12/721 ,  H04L12/707 ,  H04L5/00 ,  H04L12/733

    Abstract: One embodiment includes receiving a notification at a communications network node; determining a lowest cost path for implementing a next hop for the notification; determining a best alternate path for the next hop; comparing a cost of the best alternate path with a value stored in a notification header field; updating the header field value to equal the cost of the best alternate path if the cost of the best alternate path is less than the header field value; and forwarding the notification along the lowest cost path. Some embodiments include receiving a NACK at the node; comparing a cost of the best alternate path with a NACK header field value; and retransmitting the notification along the best alternate path if the NACK header field value is greater than or equal to the cost of the best alternate path.

    TECHNIQUE FOR SELECTING A PATH COMPUTATION ELEMENT BASED ON RESPONSE TIME DELAY
    36.
    发明申请
    TECHNIQUE FOR SELECTING A PATH COMPUTATION ELEMENT BASED ON RESPONSE TIME DELAY 审中-公开

    公开(公告)号：US20170324648A1

    公开(公告)日：2017-11-09

    申请号：US15660802

    申请日：2017-07-26

    Applicant: Cisco Technology, Inc.

    Inventor： Jean-Philippe Vasseur ,  David R. Oran

    IPC: H04L12/721 ,  H04L29/08 ,  H04L12/46 ,  H04L12/801 ,  H04L29/06

    Abstract: A technique efficiently selects a path computation element (PCE) to compute a path between nodes of a computer network. The PCE selection technique is illustratively based on dynamic advertisements of the PCE's available path computation resources, namely a predictive response time (PRT). To that end, the novel technique enables one or more PCEs to dynamically send (advertise) their available path computation resources to one or more path computation clients (PCCs). In addition, the technique enables the PCC to efficiently select a PCE (or set of PCEs) to service a path computation request based upon those available resources.

    DE-CONGESTING DATA CENTERS WITH WIRELESS POINT-TO-MULTIPOINT FLYWAYS
    37.
    发明申请
    DE-CONGESTING DATA CENTERS WITH WIRELESS POINT-TO-MULTIPOINT FLYWAYS 有权

    公开(公告)号：US20170214551A1

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

    申请号：US15482365

    申请日：2017-04-07

    Applicant: CISCO TECHNOLOGY, INC.

    Inventor： Douglas Chan ,  David R. Oran

    IPC: H04L12/64 ,  H04L12/761 ,  H04B7/06

    CPC classification number: H04L12/6418 ,  H04B7/0452 ,  H04B7/0626 ,  H04L41/0896 ,  H04L45/16 ,  H04Q11/0005 ,  H05K7/1485

    Abstract: In one embodiment, a source top-of-rack (ToR) switch may identify multiple destination ToR switches from a group of ToR switches to send data traffic to. The source ToR switch may be connected to the group of ToR switches via a base network. The system may determine whether each destination ToR switch is suitable for receiving data transmission via a point-to-multipoint wireless flyway. The two or more destination ToR switches that are determined to be suitable may be considered flyway candidate ToR switches. The system may establish the point-to-multipoint wireless flyway between the source ToR switch and the flyway candidate ToR switches. The system may then transmit the data traffic from the source ToR switch to each of the flyway candidate ToR switches via the point-to-multipoint wireless flyway.

    Retransmission-based stream repair and stream join
    39.
    发明授权
    Retransmission-based stream repair and stream join 有权
    基于重传的流修复和流加入

    公开(公告)号：US09083585B2

    公开(公告)日：2015-07-14

    申请号：US14045813

    申请日：2013-10-04

    Applicant: Cisco Technology, Inc.

    Inventor： David R. Oran

    IPC: H04L12/28 ,  H04L12/66 ,  H04L1/18 ,  H04L29/08 ,  H04L1/16 ,  H04L29/12 ,  H04L12/721 ,  H04L12/761 ,  H04L29/06 ,  H04L1/00

    CPC classification number: H04L29/08585 ,  H04L1/1607 ,  H04L29/12783 ,  H04L45/12 ,  H04L45/16 ,  H04L61/35 ,  H04L65/4076 ,  H04L65/608 ,  H04L65/80 ,  H04L69/326 ,  H04L2001/0093

    Abstract: The Real-time Transport Protocol (RTP) and its related standards define a retransmission packet format and a way to give feedback via Negative ACKnowledge (NACK) packets for data that has been lost. In one embodiment, a unicast RTP repair session is associated with a main Source Specific Multicast (SSM) multicast session. Real-time Transport Control Protocol (RTCP) NACK packets are then used for feedback to a SSM feedback target address. This dynamically instantiates unicast RTP repair for multicast sessions. The repair scheme can be used for repairing multicast channels or joining new multicast channels. In another embodiment, a media transmission device shares an IP address with one or more other media transmission devices. The shared IP address can also be used to route multiple identical multicast media streams to different media stream receivers.

    Abstract translation: 实时传输协议（RTP）及其相关标准定义了重传分组格式，并且通过负数确认（NACK）分组为丢失的数据提供反馈的方式。 在一个实施例中，单播RTP修复会话与主要源特定多播（SSM）多播会话相关联。 然后将实时传输控制协议（RTCP）NACK分组用于SSM反馈目标地址的反馈。 这可以动态实例化多播会话的单播RTP修复。 修复方案可用于修复组播信道或加入新的组播信道。 在另一个实施例中，媒体传输设备与一个或多个其他媒体传输设备共享IP地址。 共享IP地址也可以用于将多个相同的多播媒体流路由到不同的媒体流接收器。

    Streaming Manifest Quality Control
    40.
    发明申请
    Streaming Manifest Quality Control 审中-公开
    流式清单质量控制

    公开(公告)号：US20150100703A1

    公开(公告)日：2015-04-09

    申请号：US14568355

    申请日：2014-12-12

    Applicant: Cisco Technology, Inc.

    Inventor： Ali C. Begen ,  David R. Oran

    IPC: H04L29/06

    CPC classification number: H04L65/60 ,  H04N19/146 ,  H04N19/154 ,  H04N19/169 ,  H04N19/176 ,  H04N19/39 ,  H04N19/46 ,  H04N19/65 ,  H04N21/23439 ,  H04N21/26258 ,  H04N21/44209 ,  H04N21/6125 ,  H04N21/6581 ,  H04N21/8456

    Abstract: In one embodiment, a method that receives a manifest for plural encoded representations of a single content stream, each representation fragmented into plural chunks, each representation comprising a different quality level, the manifest listing a plurality of representations, each representation comprising the plural chunks at one of a plurality of quality levels, and requests one of the plural chunks based on selection of one of the plurality of quality levels explicitly indicated in the manifest.

    Abstract translation: 在一个实施例中，一种接收单个内容流的多个编码表示的清单的方法，每个表示被分割成多个块，每个表示包括不同的质量级别，列出多个表示的清单，每个表示包括多个块 多个质量级中的一个，并且基于在清单中明确指示的多个质量等级之一的选择来请求多个块中的一个。

Patent Agency Ranking