Cisco Technology, Inc.

Cabletron Systems, Inc.

Cisco Systems Inc.

David R Oran

Ali C Begen

Joshua B Gahm

Michael E Knappe

Bruce Stuart Davie

William C VerSteeg

Cary W FitzGerald

Ashok Narayanan

Robert Drisko

Michael V DiBiasio

Ilya V Moiseenko

Jean-Philippe Vasseur

Silvano Gai

Michael Anthony Ramalho

Dhaval N Shah

William C Ver Steeg

Tankut Akgul

Hussein Farouk Salama

James Cameron Gibson

Daniel George Wing

Ralph Droms

Zhi Li

James P Rivers

Francois Le Faucheur

Douglas Chan

Frederick Juergens Baker

Kevin J Rowett

Mark John Baugher

Mark Stapp

John M Schnizlein

Sean Convery

Kapil Sharma

Atif Faheem

Azita Ebrahimi Kia

Maziar Mirzazad Barijough

Eric Cunningham

Clarence Filsfils

Robert Drew Major

Stewart Frederick Bryant

Flemming Andreasen

Cullen F Jennings

Rong Pan

Toerless Eckert

Dino Farinacci

Scott C Labrozzi

Dana Lynn Blair

Gregory Pelton

Robert E Thomas

Anup Bandigadi Rao

Subhasri Dhesikan

Malcolm M Smith

John H W Bettink

Carol Etta Iturralde

Biswaranjan Panda

Peter Michael Gits

Dale James Seavey

Bruce P Osler

George Varghese

Kevin J Connor

Clay H Neighbors

Vishal Kumar Singh

Narayan Venkat

Bruce Albert Thompson

John M Zwiebel

Shiva Shankar

Khaled A Gouda

William R Foster

David C LaPier

Andrew Adamian

Saamer Akhshabi

Milad Mahdian

Ali Begen

Roger Levesque

Hoan T Dang

William Versteeg

Francois L Le Faucheur

A method is provided in one example embodiment and may include receiving an interest packet at a network element, wherein the interest packet identifies content requested by a consumer; determining whether a temporary face identifier (ID) contained in the interest packet is stored at the network element; and forwarding the interest packet to another network element based on a determination that the temporary face ID is stored at the network element, wherein the temporary face ID is associated with a face of the network element connected to the other network element.

System and method to bypass the forwarding information base (FIB) for interest packet forwarding in an information-centric networking (ICN) environment

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.

Technique for selecting a path computation element based on response time delay

Congestion aware load balancing for distributed storage may be provided. First, a read request for data may be received. The data may have redundancy through coding or through copying. Then it may be determined which K of M possible storage nodes to direct the received read request. K and M may be integers and M may be greater than K. In response to determining which K of M possible storage nodes to direct the received read request, the received read request may be copied into K read requests respectively corresponding to the determined K of M possible storage nodes. The copied K read requests may then be transmitted to the determined respective K storage nodes. And, in response to transmitting the copied K read requests, a client may receive data replies from each of the determined respective K storage nodes.

Congestion aware load balancing for distributed storage

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.

Streaming manifest quality control

Embodiments include technologies for identifying an equivalence class identifier in a packet received by a node configured to perform information centric networking (ICN) in an ICN network, where the packet includes a name identifying content associated with a producer node in the ICN network. Embodiments also include determining an equivalence class for the packet by determining a name prefix of the name based, at least in part, on the equivalence class identifier. Embodiments further include taking an action affecting a particular packet, the action based, at least in part, on the equivalence class. In specific embodiments, the name includes a plurality of name components, and the equivalence class identifier is a count indicating a number of name components in the name to be grouped together to determine the name prefix. In further embodiments, the number is greater than a particular number of name components in a routable name prefix.

Flow classification for information centric network protocols

In one embodiment, path routing in a node fabric of an information-centric network (ICN) includes transmitting a request from a source application to an upstream node via node faces of nodes in the node fabric along a path encoded in a Path Steering Value (PSV); and receiving at the source application from the upstream node a reply that travels along a return path encoded in the PSV. The PSV is generated by pairwise encoding pairs of node faces successively traversed by the reply and is represented by a deterministically decodable pairing function. Node face identifiers can be deterministically, i.e., uniquely, decoded from the PSV. The deterministically decodable pairing function is selected from a Cantor function, a Hopcroft and Ullman variant of the Cantor function, Hilbert curve algorithm, Morton code, and a bitwise pairing function.

Interest message path steering and multi-path traceroute in information-centric networking

Aspects of the disclosure are directed to systems, network nodes, and methods performed in a network node. A network node can host a TCP/ICN proxy for routing TCP packets through an ICN network. The network node can serve as a forward proxy or a reverse proxy. As a forward proxy, the network node can receive a first packet at the network node, the first packet compliant with a Transmission Control Protocol (TCP) protocol; encapsulate one or more TCP headers from the first packet into a payload field of a second packet, the second packet compliant with an Information Centric Networking (ICN) protocol; and transmit the second packet to a destination through an ICN network. As a reverse proxy, the network node can receive an ICN packet from an ICN network, decapsulate the ICN packet to its TCP components, and transmit the TCP packet through a TCP network.

Carrying TCP over an ICN network

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.

Optimized in-network retransmission for information-centric networking protocols

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.

De-congesting data centers with wireless point-to-multipoint flyways

In one embodiment, a method includes generating a request for media at a publisher and transmitting the request to a media pipeline, the media transmitted from the media pipeline to a distribution pipeline. The media pipeline includes a chain of streaming media processing components, the chain dynamically configured by the publisher. An apparatus and logic are also disclosed.

Pull-based media system

In one embodiment, a method comprises receiving a stream of transport packets encapsulating media packets, and generating a reference to the point-of-interest media packet relative to the location of the point-of-interest within the transport packet stream. The reference is generated for each media packet that is identified as a point-of-interest.

Locating points of interest using references to media frames within a packet flow

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.

Interest forwarding for interactive client anonymity

Growing community of inventors

Acton, MA, United States of America

David R Oran